{"meta":{"query_hash":"6611ad8c03c0","filters":{"venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005."},"cohort_total":74,"direct_labels_cover":0,"predictions_cover":74,"exported":74,"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/6611ad8c03c0","api":"https://metacan.xera.ac/api/v1/cohort?venue=GLOBECOM+%2705.+IEEE+Global+Telecommunications+Conference%2C+2005."},"results":[{"id":"W1966984386","doi":"10.1109/glocom.2005.1577906","title":"Performance of space-time spreading in DS-CDMA systems over fast-fading channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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":"Concordia University","funders":"","keywords":"Fading; Computer science; Rayleigh fading; Multiuser detection; Block code; Code division multiple access; Transmit diversity; Single antenna interference cancellation; Detector; Minimum mean square error; Antenna diversity; Interference (communication); Algorithm; Transmitter; Diversity scheme; Spread spectrum; Electronic engineering; Telecommunications; Channel (broadcasting); Mathematics; Decoding methods; Wireless; Statistics; Engineering; Estimator","score_opus":0.029145122079590004,"score_gpt":0.28852843678013557,"score_spread":0.25938331470054554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966984386","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.9006851,0.0010965652,0.09258725,0.00018496194,0.00002820272,0.000031723754,0.000087742665,0.00021226873,0.0050861263],"genre_scores_gemma":[0.99528944,0.00016422117,0.0041428683,0.000016405906,0.0000074465024,0.000007935982,0.000024885481,0.000010979858,0.00033578044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987367,0.0004853929,0.000049243637,0.000097708486,0.00047716554,0.0001537053],"domain_scores_gemma":[0.9941058,0.0039149905,0.0005515884,0.00042035215,0.00089798006,0.000109400644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021341282,0.00091391505,0.00057327206,0.0005673587,0.0005275792,0.0010787047,0.0003282148,0.00093908544,0.00084567926],"category_scores_gemma":[0.008054997,0.00022311155,0.0002794975,0.00055952877,0.0008404576,0.0009964016,0.0008878705,0.00044139472,0.00021749505],"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.0007766233,0.00006951227,0.008458727,0.00013643682,0.00013629989,0.0002552873,0.00023773864,0.9217255,0.035120975,0.010571569,0.00017169851,0.022339582],"study_design_scores_gemma":[0.00003371069,0.00042215595,0.003584955,0.00001608346,0.00004753766,0.00027544858,0.000072390314,0.97052705,0.02065982,0.004088345,0.00023684835,0.000035602054],"about_ca_topic_score_codex":0.0026146625,"about_ca_topic_score_gemma":0.0017392169,"teacher_disagreement_score":0.0026146625,"about_ca_system_score_codex":0.0007771086,"about_ca_system_score_gemma":0.0007685969,"threshold_uncertainty_score":0.011286497},"labels":[],"label_agreement":null},{"id":"W1982300404","doi":"10.1109/glocom.2005.1577801","title":"Adaptive multiloop PI rate-based controller design for a MIMO IP router based on phase margin","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","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 Ottawa","funders":"","keywords":"Active queue management; Phase margin; MIMO; Router; Control theory (sociology); Computer science; Robustness (evolution); PID controller; Encoder; Engineering; Control engineering; Computer network; Network congestion; Amplifier; Bandwidth (computing); Operational amplifier; Control (management)","score_opus":0.04891216530299321,"score_gpt":0.29605095501706286,"score_spread":0.24713878971406966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982300404","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.009093555,0.00016312664,0.987316,0.00011565237,0.00008166439,0.00006278886,0.0000133380845,0.0006006479,0.002553261],"genre_scores_gemma":[0.8501611,0.00018782771,0.14675662,0.0002270759,0.00012058173,0.00016639597,0.00003164482,0.000041872874,0.0023068176],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996068,0.000058148722,0.000025140977,0.00009908916,0.00017326855,0.00003756419],"domain_scores_gemma":[0.9996451,0.000076897435,0.000059633432,0.000025663212,0.00017339007,0.000019368837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046237148,0.0004845058,0.000369664,0.0002793398,0.00032781268,0.0007602771,0.0009934896,0.00048097875,0.0016285147],"category_scores_gemma":[0.00073226047,0.00018446788,0.0002485268,0.00016208537,0.00031078616,0.00039135024,0.00034281643,0.0007537582,0.00050251867],"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.00047056278,0.00030406806,0.0011674921,0.00043621665,0.0001398863,0.00034104282,0.00029190644,0.4358884,0.20616877,0.027863909,0.003843188,0.32308456],"study_design_scores_gemma":[0.0000669052,0.00029938028,0.00017394268,0.00001033225,0.00003058196,0.00008403885,0.000010663891,0.97016853,0.025042456,0.00135059,0.0027445497,0.00001794843],"about_ca_topic_score_codex":0.00089566683,"about_ca_topic_score_gemma":0.0010311479,"teacher_disagreement_score":0.0016285147,"about_ca_system_score_codex":0.0003913245,"about_ca_system_score_gemma":0.00045599413,"threshold_uncertainty_score":0.005447924},"labels":[],"label_agreement":null},{"id":"W2012719569","doi":"10.1109/glocom.2005.1578060","title":"Pilot symbols for channel estimation in OFDM systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"Estimator; Orthogonal frequency-division multiplexing; Algorithm; Channel (broadcasting); Cramér–Rao bound; Computer science; Minimum mean square error; Gaussian; Mathematics; Impulse response; Statistics; Mathematical optimization; Telecommunications","score_opus":0.03632341136163796,"score_gpt":0.2970148124218545,"score_spread":0.26069140106021654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012719569","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.0148914,0.001810326,0.9804898,0.00021071275,0.00015321173,0.000027939794,0.00005532992,0.00031229452,0.0020489623],"genre_scores_gemma":[0.47691256,0.0026678264,0.51638395,0.00024825198,0.00038596973,0.00012238733,0.00023541959,0.000064464744,0.0029792127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996878,0.00013874484,0.000013529764,0.00004067367,0.00009951911,0.000019682857],"domain_scores_gemma":[0.9993026,0.00039982735,0.000053116044,0.00012844201,0.000095348834,0.000020680067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004900362,0.0003964153,0.00033414314,0.00023121727,0.0002114815,0.0004647685,0.0003815048,0.00056702027,0.001507488],"category_scores_gemma":[0.0034176363,0.00021802098,0.00011908579,0.0005387566,0.00045745436,0.00077665853,0.00052037387,0.0006207757,0.00066805613],"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.00041043927,0.0000865172,0.0010976354,0.0004712527,0.00006424454,0.00067714154,0.00027223807,0.2660846,0.040596593,0.12106703,0.008372318,0.5608],"study_design_scores_gemma":[0.000074404306,0.00033207604,0.000685547,0.00012459487,0.000049770002,0.00047602213,0.00006262103,0.8812759,0.027592517,0.06867797,0.020615743,0.000032797165],"about_ca_topic_score_codex":0.00040438358,"about_ca_topic_score_gemma":0.00049308134,"teacher_disagreement_score":0.001507488,"about_ca_system_score_codex":0.00013845449,"about_ca_system_score_gemma":0.000407264,"threshold_uncertainty_score":0.00504303},"labels":[],"label_agreement":null},{"id":"W2021856733","doi":"10.1109/glocom.2005.1578050","title":"A vector-hydrophone~s minimal composition for finite estimation-variance in direction-finding near a rigid reflecting boundary","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Direction-of-Arrival Estimation Techniques","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 Waterloo","funders":"","keywords":"Hydrophone; Acoustics; Underwater; Boundary (topology); Underwater acoustics; Sound pressure; Geology; Mathematics; Physics; Mathematical analysis","score_opus":0.03939539621145125,"score_gpt":0.33711664004476477,"score_spread":0.2977212438333135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021856733","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.023995208,0.000035848785,0.9752484,0.00003791752,0.000006759468,0.000016658105,0.00001996591,0.000074325195,0.0005648332],"genre_scores_gemma":[0.33801118,0.00010678399,0.66016304,0.00002892067,0.000021018574,0.000093803195,0.00012296694,0.00007252539,0.0013796983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999342,0.0002832561,0.00002668127,0.00010002333,0.00020662359,0.0000413868],"domain_scores_gemma":[0.99898356,0.00060380885,0.00009740521,0.000107638465,0.00014516378,0.0000623602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102481,0.00057303766,0.0005472727,0.0003409214,0.00032838478,0.00041049364,0.0004517895,0.0003960236,0.0010601322],"category_scores_gemma":[0.0039065876,0.00041086203,0.0003225807,0.0002969384,0.0007326901,0.00077980064,0.0012097307,0.00067902316,0.00030671377],"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.0008012664,0.00014639557,0.002603432,0.00032085396,0.000067251596,0.0002546067,0.00028948698,0.33926094,0.23727572,0.16127121,0.0014033511,0.2563054],"study_design_scores_gemma":[0.0000214906,0.00020508222,0.00062245893,0.000016976745,0.00001943811,0.00015475106,0.000029907902,0.94195664,0.027226603,0.028231537,0.0014925963,0.000022495893],"about_ca_topic_score_codex":0.0005257835,"about_ca_topic_score_gemma":0.00067003275,"teacher_disagreement_score":0.0010601322,"about_ca_system_score_codex":0.00023507977,"about_ca_system_score_gemma":0.00070124085,"threshold_uncertainty_score":0.0054197907},"labels":[],"label_agreement":null},{"id":"W2035625138","doi":"10.1109/glocom.2005.1577379","title":"Detector for Alamouti space-time coding in Rayleigh fading MIMO channels with randomly distributed timing drift","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Samsung","keywords":"Detector; Algorithm; Estimator; Rayleigh fading; Channel state information; Channel (broadcasting); Fading; MIMO; Coding (social sciences); Computer science; Mathematics; Block code; Space–time code; Statistics; Topology (electrical circuits); Telecommunications; Decoding methods; Wireless; Combinatorics","score_opus":0.02187344640656313,"score_gpt":0.26585172607275454,"score_spread":0.2439782796661914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035625138","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.0652635,0.000990153,0.92997354,0.00029747767,0.000045352506,0.0000813306,0.00016023019,0.00040759187,0.0027808489],"genre_scores_gemma":[0.8835939,0.00085142785,0.112518996,0.00017162318,0.000088827095,0.00017651435,0.00025833343,0.000091463335,0.0022489843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789786,0.0006843022,0.000079336656,0.00023129793,0.00078329915,0.000323845],"domain_scores_gemma":[0.98058915,0.015035462,0.0019034456,0.0006763354,0.0016185761,0.00017707201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006240351,0.0011795228,0.0011664401,0.0012432176,0.0007156064,0.0013614524,0.0010621303,0.0015709245,0.0014082494],"category_scores_gemma":[0.026460474,0.0006108618,0.0006271295,0.0011335069,0.0019218744,0.0019794747,0.0012867072,0.0011891813,0.00048493137],"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.00032068565,0.000030823012,0.0014920176,0.000107128006,0.000084131294,0.00016562495,0.0001381231,0.91946507,0.0049927197,0.05554099,0.0007239497,0.016938698],"study_design_scores_gemma":[0.000015275496,0.000046163477,0.00021991818,0.00001408414,0.000014249087,0.00009786079,0.000011915462,0.9923614,0.0017290631,0.0053224773,0.00015020506,0.00001742134],"about_ca_topic_score_codex":0.0032167395,"about_ca_topic_score_gemma":0.0025253056,"teacher_disagreement_score":0.006240351,"about_ca_system_score_codex":0.0025827521,"about_ca_system_score_gemma":0.0026633686,"threshold_uncertainty_score":0.033002555},"labels":[],"label_agreement":null},{"id":"W2085601259","doi":"10.1109/glocom.2005.1577919","title":"Distributed space-time block coding","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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 British Columbia","funders":"","keywords":"Computer science; Node (physics); Block code; Wireless sensor network; Code (set theory); Wireless ad hoc network; Coding (social sciences); Block (permutation group theory); Matrix (chemical analysis); Space–time block code; Decoding methods; Set (abstract data type); Algorithm; Theoretical computer science; Wireless; Mathematics; Computer network; Combinatorics; Telecommunications; Engineering","score_opus":0.03307642726339382,"score_gpt":0.2837614291637141,"score_spread":0.2506850019003203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085601259","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.004845183,0.0009238158,0.9866149,0.00017592972,0.00021167027,0.000048865382,0.00013178412,0.00024487672,0.0068030204],"genre_scores_gemma":[0.5168122,0.0031227577,0.45934314,0.00043996275,0.00036215244,0.00035173364,0.0009656329,0.000087935085,0.018514479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915075,0.00021851549,0.000033127984,0.0001268404,0.00037416533,0.00009664982],"domain_scores_gemma":[0.99911135,0.00028122336,0.00007274007,0.00021496727,0.00028431453,0.000035325604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005171657,0.00046845461,0.0006086453,0.000435484,0.00033785007,0.00084413186,0.00073761656,0.0005768533,0.0025138357],"category_scores_gemma":[0.0016091173,0.00017920678,0.00028733746,0.00096009666,0.00060003204,0.00085561606,0.0007840781,0.0008325557,0.001255213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000362779,0.00007859336,0.0007013325,0.00023344654,0.000067240435,0.00020670761,0.000107352185,0.22167158,0.025638405,0.45794913,0.0103218425,0.2826616],"study_design_scores_gemma":[0.00006089301,0.0001363154,0.00023756328,0.00003473625,0.000025461592,0.0002898335,0.000022203632,0.8816088,0.00996548,0.07367713,0.033915825,0.000025764672],"about_ca_topic_score_codex":0.0015569422,"about_ca_topic_score_gemma":0.001974883,"teacher_disagreement_score":0.0025138357,"about_ca_system_score_codex":0.0007180907,"about_ca_system_score_gemma":0.00091310777,"threshold_uncertainty_score":0.00840956},"labels":[],"label_agreement":null},{"id":"W2095649434","doi":"10.1109/glocom.2005.1578323","title":"Generalized feedback detection for MIMO systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"MIMO; Decoding methods; Detector; Computer science; Convolutional code; Computation; Algorithm; Tree (set theory); Multiplexing; Theoretical computer science; Mathematics; Channel (broadcasting); Telecommunications","score_opus":0.027581408411313194,"score_gpt":0.2807371188759759,"score_spread":0.25315571046466273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095649434","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.0057627177,0.0007892112,0.9918195,0.000107600914,0.000077202094,0.000018738114,0.000040042556,0.00015519687,0.0012297701],"genre_scores_gemma":[0.55106246,0.002279315,0.44189993,0.00051002594,0.0003587444,0.00014071092,0.000192632,0.000051686417,0.0035044681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993374,0.00018640826,0.00002864274,0.000119093944,0.00025818005,0.00007036381],"domain_scores_gemma":[0.99952567,0.00021470926,0.000050609255,0.00007944099,0.000110323184,0.000019264346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006496372,0.00062513276,0.0007827183,0.00042959448,0.00028068584,0.0006445266,0.0006599413,0.000672806,0.0010822656],"category_scores_gemma":[0.0015021954,0.00017887405,0.00042462366,0.0005787605,0.0006722746,0.0010842879,0.00080342183,0.00074639416,0.00027933047],"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.00014705042,0.00004156261,0.00057573913,0.00038099842,0.0000868398,0.0003404734,0.00017775786,0.357842,0.031431034,0.40553036,0.0043485025,0.1990977],"study_design_scores_gemma":[0.000020147727,0.00011007112,0.00016865287,0.000028393752,0.000017807968,0.00018297583,0.00001812539,0.8803424,0.0042390893,0.108152084,0.0066880845,0.00003212127],"about_ca_topic_score_codex":0.0010320329,"about_ca_topic_score_gemma":0.0013390746,"teacher_disagreement_score":0.0010822656,"about_ca_system_score_codex":0.0006405798,"about_ca_system_score_gemma":0.0006662567,"threshold_uncertainty_score":0.0046477914},"labels":[],"label_agreement":null},{"id":"W2097081530","doi":"10.1109/glocom.2005.1578328","title":"Maximum network lifetime in fault tolerant sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":13,"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; Erasure code; Network packet; Fault tolerance; Computer network; Erasure; Wireless sensor network; Sink (geography); Linear network coding; Communication source; Distributed computing; Real-time computing; Decoding methods; Algorithm","score_opus":0.016618624191067473,"score_gpt":0.2536875600252603,"score_spread":0.2370689358341928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097081530","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.032684326,0.009768202,0.94874394,0.0011185583,0.00013751451,0.000048362122,0.000102572114,0.00047035632,0.006926108],"genre_scores_gemma":[0.86186105,0.0068710824,0.12657522,0.00022194925,0.00033218018,0.00022966215,0.00012065825,0.00018329658,0.0036048966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991092,0.00031975692,0.000044092238,0.00014834089,0.00029745648,0.000081199876],"domain_scores_gemma":[0.99874425,0.00075915514,0.00017060974,0.00012665924,0.00014591368,0.000053377407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011820017,0.0006116463,0.00073190953,0.0006849581,0.00060136,0.0009257853,0.0009877608,0.0009240307,0.0010468333],"category_scores_gemma":[0.004247845,0.00032950938,0.00027091894,0.0009557187,0.0007934115,0.0026565178,0.0010868536,0.0006644277,0.00024661675],"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.00022791188,0.000041781375,0.00087273953,0.0008312052,0.00008866848,0.00024002694,0.00038750414,0.60929054,0.018387962,0.17563629,0.00474956,0.18924582],"study_design_scores_gemma":[0.000034912096,0.00018008189,0.00039685194,0.0001323561,0.000050286755,0.00044098592,0.000101585894,0.78325284,0.010296247,0.18487017,0.020208484,0.000035245528],"about_ca_topic_score_codex":0.00030146271,"about_ca_topic_score_gemma":0.00041981356,"teacher_disagreement_score":0.0011820017,"about_ca_system_score_codex":0.001028497,"about_ca_system_score_gemma":0.00046781317,"threshold_uncertainty_score":0.007462263},"labels":[],"label_agreement":null},{"id":"W2097475015","doi":"10.1109/glocom.2005.1578379","title":"Theoretical analysis of cooperative diversity in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"York University; University of Toronto","funders":"","keywords":"Cooperative diversity; Fading; Energy consumption; Diversity (politics); Relay; Computer science; Computer network; Wireless sensor network; Perspective (graphical); Wireless network; Efficient energy use; Energy (signal processing); Wireless; Routing protocol; Routing (electronic design automation); Telecommunications; Engineering; Channel (broadcasting); Artificial intelligence; Electrical engineering","score_opus":0.037773635301519254,"score_gpt":0.29408163922517483,"score_spread":0.2563080039236556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097475015","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.018412488,0.0041881856,0.9431079,0.002766679,0.00019764964,0.00004178865,0.00013802723,0.00010056654,0.03104671],"genre_scores_gemma":[0.91285837,0.01089444,0.06568591,0.0009265423,0.00096585136,0.0004742433,0.00019817463,0.00011502022,0.007881376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986939,0.000401899,0.000034104218,0.00009466061,0.0006547898,0.00012077892],"domain_scores_gemma":[0.99681914,0.0021530846,0.0002664666,0.00022511357,0.00046525593,0.000071025745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002180248,0.00075396977,0.000690426,0.001371046,0.0007960423,0.0015351233,0.0017681775,0.0014424456,0.0019590643],"category_scores_gemma":[0.0089317225,0.00043435904,0.0005273389,0.0016415556,0.002412812,0.0028142317,0.0014803621,0.0015096039,0.0004483045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000010067171,0.000018530072,0.00020575523,0.000095998854,0.000015167439,0.00008144272,0.00012533777,0.19896454,0.0008971438,0.79045784,0.0014552274,0.0076729213],"study_design_scores_gemma":[0.000005476917,0.000022479635,0.00009922644,0.00004434643,0.0000067413316,0.00007738781,0.00004861667,0.40614396,0.00026093813,0.5902951,0.0029844726,0.000011314451],"about_ca_topic_score_codex":0.0011464134,"about_ca_topic_score_gemma":0.00067141507,"teacher_disagreement_score":0.002180248,"about_ca_system_score_codex":0.0019215515,"about_ca_system_score_gemma":0.0009174139,"threshold_uncertainty_score":0.013941884},"labels":[],"label_agreement":null},{"id":"W2097993003","doi":"10.1109/glocom.2005.1577881","title":"Detection of code index in turbo source coding","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Systematic code; Turbo code; Constant-weight code; Distributed source coding; Decoding methods; Variable-length code; Algorithm; Source code; Polynomial code; Low-density parity-check code; Code rate; Code (set theory); Coding (social sciences); Concatenated error correction code; Block code; Mathematics; Statistics; Programming language","score_opus":0.019455169420289842,"score_gpt":0.2698235767624036,"score_spread":0.25036840734211374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097993003","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.036662534,0.0006477944,0.9601501,0.00015072412,0.00009189116,0.000046593494,0.00006594403,0.00046571638,0.0017187244],"genre_scores_gemma":[0.59702796,0.0009718469,0.3986898,0.00018196958,0.00016257819,0.00014140997,0.00023511858,0.000121706005,0.0024675892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754506,0.000642674,0.00014423137,0.00025996234,0.0012734281,0.00013450766],"domain_scores_gemma":[0.9922193,0.0039004497,0.0010520824,0.0008920788,0.0017030884,0.00023294403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014991417,0.0007255289,0.0010004219,0.0019727768,0.0005962822,0.0011743316,0.00080555305,0.0013219814,0.00039485743],"category_scores_gemma":[0.017362528,0.0004892479,0.00031681033,0.0013694696,0.0014891678,0.0019594838,0.0014309476,0.0010900478,0.0004384838],"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.0016995686,0.00014966642,0.0069505568,0.00043113815,0.00010715963,0.001413752,0.00071250123,0.24156861,0.17299598,0.12144339,0.0033505403,0.44917706],"study_design_scores_gemma":[0.000026722517,0.00015985066,0.0008864832,0.00005331474,0.000027112832,0.00068448833,0.000024487117,0.894116,0.07888519,0.023356851,0.0017035458,0.00007599886],"about_ca_topic_score_codex":0.00094788946,"about_ca_topic_score_gemma":0.0007971378,"teacher_disagreement_score":0.0019727768,"about_ca_system_score_codex":0.0009207912,"about_ca_system_score_gemma":0.0010411062,"threshold_uncertainty_score":0.007928312},"labels":[],"label_agreement":null},{"id":"W2099120675","doi":"10.1109/glocom.2005.1577846","title":"Optimal packet scheduling over correlated Nakagami-m channels with different diversity-combining techniques","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 British Columbia","funders":"","keywords":"Nakagami distribution; Computer science; Fading; Network packet; Scheduling (production processes); Markov process; Bit error rate; Markov decision process; Markov chain; Transmission (telecommunications); Mathematical optimization; Channel (broadcasting); Algorithm; Mathematics; Computer network; Telecommunications; Statistics","score_opus":0.01482366636108302,"score_gpt":0.2399280109414401,"score_spread":0.22510434458035708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099120675","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.20892127,0.0012663578,0.78480464,0.00048385,0.00008268092,0.00006894605,0.00011725625,0.00012692662,0.0041281856],"genre_scores_gemma":[0.9624623,0.0005278343,0.03584804,0.000054167882,0.000042465148,0.000044135293,0.000035057164,0.000028617462,0.00095738546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.0003292619,0.000023606304,0.00007743436,0.00012484686,0.00017435114],"domain_scores_gemma":[0.99794835,0.0013908157,0.0003048065,0.000074616306,0.00018146215,0.00010001452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168104,0.00090500707,0.0010057924,0.00042712872,0.0004045858,0.0012023671,0.0006597998,0.00067622453,0.0007940585],"category_scores_gemma":[0.0031280408,0.00061769644,0.00048646214,0.00089301454,0.00082130794,0.0010302853,0.00070642575,0.0005662336,0.00012999414],"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.000053265725,0.000021777229,0.00023333417,0.000026129957,0.000017487682,0.000029872012,0.00002032313,0.9907336,0.0012088801,0.0046598082,0.00014373932,0.0028517575],"study_design_scores_gemma":[0.000013103259,0.000031277323,0.000110172856,0.0000020519515,0.00000896183,0.0000059398517,0.000008480157,0.9974746,0.0004775813,0.0018118732,0.00005147904,0.000004362564],"about_ca_topic_score_codex":0.0034344674,"about_ca_topic_score_gemma":0.0027017079,"teacher_disagreement_score":0.0034344674,"about_ca_system_score_codex":0.001645596,"about_ca_system_score_gemma":0.0017052031,"threshold_uncertainty_score":0.011939704},"labels":[],"label_agreement":null},{"id":"W2100245203","doi":"10.1109/glocom.2005.1578204","title":"Analysis of the outage probability for spatially correlated MIMO channels with receive antenna selection","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Concordia University","funders":"","keywords":"MIMO; Fading; Channel state information; Transmitter; Spatial correlation; Computer science; Antenna (radio); Channel (broadcasting); Signal-to-noise ratio (imaging); Selection (genetic algorithm); Antenna diversity; Topology (electrical circuits); Algorithm; Wireless; Telecommunications; Mathematics; Machine learning","score_opus":0.01900970044103999,"score_gpt":0.2494240987641517,"score_spread":0.2304143983231117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100245203","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.16623802,0.002563396,0.81722677,0.0007087571,0.000042965785,0.00005583961,0.00038335365,0.0003494142,0.012431413],"genre_scores_gemma":[0.982967,0.001344312,0.013093532,0.00011842107,0.00010165177,0.0000625647,0.00017186085,0.00005689876,0.0020839495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784887,0.0007963912,0.00006855858,0.00016178096,0.00077356026,0.00035086577],"domain_scores_gemma":[0.9853249,0.011795526,0.0011887059,0.0005768707,0.00092830416,0.00018575133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030911507,0.0011580073,0.0014564015,0.00090654416,0.0005656586,0.0011867055,0.0009625371,0.0008312232,0.0027294296],"category_scores_gemma":[0.011204383,0.000581139,0.00059523626,0.0014571173,0.0014177286,0.002003419,0.0013400345,0.00088505825,0.00039531977],"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.000084874504,0.00002155468,0.0016282017,0.00008543754,0.000054413005,0.00034915403,0.00010214744,0.96154886,0.0017898683,0.027550986,0.0005995142,0.006184915],"study_design_scores_gemma":[0.000008790227,0.000038960316,0.0010843208,0.000015703814,0.000027867909,0.00021436125,0.0000515943,0.9860436,0.00082207116,0.011392949,0.0002824977,0.00001727894],"about_ca_topic_score_codex":0.0017543015,"about_ca_topic_score_gemma":0.00140331,"teacher_disagreement_score":0.0030911507,"about_ca_system_score_codex":0.0018005025,"about_ca_system_score_gemma":0.0008850309,"threshold_uncertainty_score":0.016347766},"labels":[],"label_agreement":null},{"id":"W2101173152","doi":"10.1109/glocom.2005.1577915","title":"A variational free energy minimization interpretation of multiuser detection in CDMA","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":13,"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":"Multiuser detection; Maximization; Computer science; Detector; Decoding methods; Minification; Heuristic; Energy (signal processing); Mathematical optimization; Algorithm; Code division multiple access; Mathematics; Artificial intelligence; Telecommunications; Statistics","score_opus":0.02150182340802422,"score_gpt":0.2814710991454904,"score_spread":0.2599692757374662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101173152","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.0018546015,0.00027686992,0.99540675,0.00035408756,0.000034094755,0.00001152014,0.000021470014,0.000017625653,0.0020229556],"genre_scores_gemma":[0.41515666,0.0018440299,0.5695233,0.0009130412,0.00043222442,0.0002442098,0.000137739,0.00015535258,0.011593524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993369,0.00031337104,0.0000220063,0.000098687306,0.00017031355,0.00005857717],"domain_scores_gemma":[0.999091,0.0005995828,0.00006245715,0.00008551693,0.00011374687,0.00004777215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016922317,0.00076195836,0.00073257176,0.000663939,0.00044937263,0.0012876146,0.0015452256,0.0015625985,0.0019513079],"category_scores_gemma":[0.003177766,0.0005047608,0.00082422415,0.00063326093,0.0019397266,0.0017666648,0.001606944,0.0017765202,0.00037074907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000020037538,0.000022503835,0.00024819074,0.00008802394,0.000033708082,0.000069761416,0.0001277697,0.2227868,0.0035765925,0.7567183,0.0012786374,0.015029825],"study_design_scores_gemma":[0.0000067178394,0.000020625044,0.00008217799,0.0000140453,0.000005186587,0.000040433166,0.000012068126,0.790844,0.0005672918,0.20667616,0.0017167086,0.00001459756],"about_ca_topic_score_codex":0.0015419847,"about_ca_topic_score_gemma":0.001158168,"teacher_disagreement_score":0.0019513079,"about_ca_system_score_codex":0.0011416118,"about_ca_system_score_gemma":0.00098304,"threshold_uncertainty_score":0.008949518},"labels":[],"label_agreement":null},{"id":"W2102682822","doi":"10.1109/glocom.2005.1577355","title":"Margin maximization in multiuser interference digital subscriber line channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Power Line Communications and Noise","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":"McGill University","funders":"","keywords":"Digital subscriber line; Margin (machine learning); Computer science; Maximization; Mathematical optimization; Algorithm; Computer network; Mathematics","score_opus":0.02658985573717016,"score_gpt":0.26013747694041134,"score_spread":0.23354762120324118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102682822","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.01392371,0.00016515564,0.9844512,0.000090764726,0.000011687673,0.00001687364,0.000016344204,0.0001088698,0.0012154144],"genre_scores_gemma":[0.8204978,0.00035238516,0.17474467,0.000098505356,0.00003656609,0.000104842606,0.00008012402,0.00011249612,0.0039725765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994312,0.0002595795,0.000019941592,0.00009455504,0.0001332588,0.00006153236],"domain_scores_gemma":[0.9988343,0.0008178907,0.00009936011,0.000053505257,0.00016208565,0.000032931835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010656939,0.0006517299,0.00076977763,0.0002588145,0.00024004707,0.00073270546,0.00059417967,0.00061816047,0.0010042067],"category_scores_gemma":[0.0030309544,0.00037669085,0.00031929673,0.00037079517,0.0010083815,0.00096581713,0.0008413574,0.0006864458,0.00036323187],"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.00006694514,0.000020134687,0.0002315669,0.00005521144,0.00001317867,0.000039410486,0.00008106219,0.9588755,0.0026437007,0.014239429,0.0005185226,0.023215353],"study_design_scores_gemma":[0.0000051674433,0.000010121145,0.00003848537,0.0000019059117,0.0000011125792,0.0000045176153,0.000004192744,0.9962794,0.00059555465,0.0029060398,0.00015128496,0.0000020854238],"about_ca_topic_score_codex":0.0024404027,"about_ca_topic_score_gemma":0.0014201204,"teacher_disagreement_score":0.0024404027,"about_ca_system_score_codex":0.0007402915,"about_ca_system_score_gemma":0.0006629902,"threshold_uncertainty_score":0.0056360364},"labels":[],"label_agreement":null},{"id":"W2103261319","doi":"10.1109/glocom.2005.1578422","title":"Comparison of modulation schemes and rake receiver structures for UWB systems on an IEEE 802.15.3 indoor channel","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Ultra-Wideband Communications Technology","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":"University of Alberta","funders":"","keywords":"Intersymbol interference; Rake receiver; Rake; Computer science; Electronic engineering; Fading; Modulation (music); Interference (communication); Bit error rate; Pulse-position modulation; Channel (broadcasting); Ultra-wideband; Transmission (telecommunications); Computer network; Telecommunications; Engineering; Pulse-amplitude modulation; Physics; Acoustics","score_opus":0.039936436637421746,"score_gpt":0.309999410270099,"score_spread":0.27006297363267723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103261319","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.86075515,0.0033930144,0.12887822,0.00023064164,0.000080158374,0.00013927292,0.000096125485,0.0006132118,0.005814309],"genre_scores_gemma":[0.97385037,0.0007376481,0.024517955,0.00005106755,0.00003124145,0.000027760709,0.000051901934,0.000028300681,0.00070369896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861884,0.00065558346,0.00007791191,0.00007761231,0.00036973268,0.00020031937],"domain_scores_gemma":[0.994013,0.0039260257,0.00042513967,0.00045817412,0.0010944182,0.00008318319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001847264,0.0008317894,0.00078185543,0.0008905059,0.00053005485,0.0007483285,0.0006541577,0.0008925994,0.0013439582],"category_scores_gemma":[0.0060858005,0.00029682348,0.00041087362,0.0007765338,0.00034570825,0.0009825068,0.0003960572,0.0005339773,0.00033480037],"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.012053207,0.0006792669,0.017303046,0.00119497,0.00070841704,0.0007042954,0.00072436925,0.35569936,0.23290661,0.012322642,0.0013427185,0.36436105],"study_design_scores_gemma":[0.00064581283,0.01433583,0.018966228,0.0002443979,0.0013323575,0.0027248636,0.00063335913,0.71982765,0.2317058,0.0043304,0.0050072526,0.00024597422],"about_ca_topic_score_codex":0.0006291047,"about_ca_topic_score_gemma":0.0012937456,"teacher_disagreement_score":0.001847264,"about_ca_system_score_codex":0.0005673008,"about_ca_system_score_gemma":0.00034648328,"threshold_uncertainty_score":0.00976938},"labels":[],"label_agreement":null},{"id":"W2103621885","doi":"10.1109/glocom.2005.1578005","title":"A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"graph theory and CDMA systems","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":"Greedy algorithm; Algorithm; Reuse; Computer science; Code (set theory); Set (abstract data type); Process (computing); Reduction (mathematics); Mathematics; Engineering","score_opus":0.030874760277588568,"score_gpt":0.2722429596859024,"score_spread":0.24136819940831383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103621885","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.007451967,0.00004445732,0.99115115,0.0000413306,0.000017185195,0.000044819597,0.000017488464,0.00015164111,0.0010798839],"genre_scores_gemma":[0.068200134,0.00007182888,0.92990375,0.000052586623,0.000017848426,0.000119477496,0.00009783961,0.000051959,0.0014844881],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999278,0.00018373117,0.00003986385,0.00010644746,0.00031341417,0.00007845696],"domain_scores_gemma":[0.99921846,0.00035429437,0.00007686726,0.00014902685,0.00016712466,0.000034242228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000594917,0.00051275693,0.00040457502,0.0007123611,0.0005982253,0.0005964462,0.0009594173,0.0006176329,0.0013168807],"category_scores_gemma":[0.0020251174,0.00029813094,0.0005270957,0.0006701895,0.0006934429,0.00075366837,0.001157526,0.0008249611,0.0006632177],"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.00033075723,0.00014632288,0.00094996666,0.0001575925,0.00007994125,0.00020043789,0.00026089378,0.22435091,0.05346359,0.1429716,0.0033864356,0.57370156],"study_design_scores_gemma":[0.00012263212,0.00022245127,0.00028138421,0.000032510274,0.00003940708,0.0005182367,0.00006454129,0.8742253,0.040891442,0.07018948,0.013346962,0.00006563254],"about_ca_topic_score_codex":0.0006379882,"about_ca_topic_score_gemma":0.00089867413,"teacher_disagreement_score":0.0013168807,"about_ca_system_score_codex":0.00055140676,"about_ca_system_score_gemma":0.0010630069,"threshold_uncertainty_score":0.0044053793},"labels":[],"label_agreement":null},{"id":"W2103967031","doi":"10.1109/glocom.2005.1578334","title":"Exploiting spatial diversity in rate adaptive WLANs with relay infrastructure","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"York University; University of Toronto","funders":"","keywords":"Relay; Computer network; Throughput; Rayleigh fading; Computer science; Fading; Antenna diversity; Wireless; Diversity gain; Wireless network; Wi-Fi; Telecommunications; Channel (broadcasting)","score_opus":0.04221403381932609,"score_gpt":0.2683632542098175,"score_spread":0.2261492203904914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103967031","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.519349,0.0009197974,0.47347456,0.00019349316,0.000021724863,0.00002835919,0.000034031673,0.00043483634,0.0055441423],"genre_scores_gemma":[0.9947648,0.00017584437,0.004786325,0.000012546151,0.000011735335,0.000009157032,0.000005804909,0.000008518288,0.00022520994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999353,0.0002941609,0.00001828851,0.000055906665,0.00013605501,0.00014253426],"domain_scores_gemma":[0.99709296,0.00202258,0.00033897613,0.0002470814,0.00023440096,0.00006396003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014388963,0.00051759277,0.00043804746,0.0005609572,0.00032386693,0.00081133965,0.00061650254,0.00044829553,0.00048711273],"category_scores_gemma":[0.0042373096,0.0003893317,0.00034420434,0.000560128,0.0011133257,0.0012746626,0.0007095017,0.00037708535,0.00015237277],"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.00019112832,0.00005171838,0.0016702533,0.000056644818,0.000064361004,0.00040888114,0.00015859018,0.92190266,0.034314726,0.022332238,0.0001941761,0.01865476],"study_design_scores_gemma":[0.000014993236,0.00012579352,0.0004358174,0.000006294387,0.00004048409,0.00015836669,0.000046908794,0.98354465,0.007891689,0.0074486113,0.000268858,0.000017614011],"about_ca_topic_score_codex":0.0012556543,"about_ca_topic_score_gemma":0.00105647,"teacher_disagreement_score":0.0014388963,"about_ca_system_score_codex":0.0007450173,"about_ca_system_score_gemma":0.00040529223,"threshold_uncertainty_score":0.007609725},"labels":[],"label_agreement":null},{"id":"W2104197982","doi":"10.1109/glocom.2005.1577380","title":"Constrained detection for multiple-input multiple-output channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Detector; MIMO; Computer science; Constant (computer programming); Interference (communication); Control theory (sociology); Noise (video); Algorithm; Constellation; Telecommunications; Channel (broadcasting); Physics; Artificial intelligence","score_opus":0.030112040400150357,"score_gpt":0.27897592812822614,"score_spread":0.24886388772807577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104197982","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.002724095,0.00029317575,0.995745,0.000094905874,0.000036516023,0.000017336288,0.000030964275,0.0000990256,0.0009589601],"genre_scores_gemma":[0.3633939,0.0016829378,0.62823415,0.00066233886,0.00016714336,0.00024580857,0.00028052868,0.00007586988,0.005257363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986725,0.00039959484,0.00005237529,0.0001980487,0.0005667239,0.0001108178],"domain_scores_gemma":[0.9975674,0.0013307615,0.00025764955,0.00030174124,0.00047976608,0.00006271701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010401441,0.0007798303,0.00076794816,0.0004941544,0.00035508876,0.00092719716,0.0009821975,0.00088581926,0.0014332366],"category_scores_gemma":[0.0048679435,0.00037787505,0.00048402185,0.00074088573,0.000792521,0.0016310534,0.0011648689,0.0010974705,0.0005772042],"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.00020829408,0.0000806036,0.00081225595,0.00031938014,0.00011396497,0.0003882264,0.00014038882,0.46927562,0.032312296,0.2663887,0.0054406915,0.22451948],"study_design_scores_gemma":[0.000020479676,0.00007977738,0.00012165444,0.000023331315,0.000011792608,0.0001712995,0.0000089806235,0.93744975,0.010026377,0.047076907,0.0049785604,0.00003114783],"about_ca_topic_score_codex":0.0008517498,"about_ca_topic_score_gemma":0.00094512134,"teacher_disagreement_score":0.0014332366,"about_ca_system_score_codex":0.000499661,"about_ca_system_score_gemma":0.0009700666,"threshold_uncertainty_score":0.005500853},"labels":[],"label_agreement":null},{"id":"W2106163264","doi":"10.1109/glocom.2005.1578237","title":"Realtime service provisioning in CDMA wireless cellular networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network 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":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Code division multiple access; Service layer; Wireless network; Wireless; Provisioning; Mobile QoS; Resource allocation; Cellular network; Service (business); Service provider; Telecommunications","score_opus":0.01374594829628422,"score_gpt":0.24135443437532392,"score_spread":0.2276084860790397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106163264","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.14251229,0.0043188776,0.84063303,0.00061383826,0.0001842784,0.00008109622,0.00006513568,0.00045248456,0.011138909],"genre_scores_gemma":[0.94155604,0.0015954754,0.053101856,0.00009850515,0.000110977206,0.00005802323,0.000037551643,0.00004132304,0.003400266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911565,0.00031474637,0.000028639335,0.00011256907,0.00032292836,0.00010552309],"domain_scores_gemma":[0.99912626,0.00049428665,0.00012384135,0.00007478942,0.00012674794,0.000054084376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010872901,0.00040476827,0.00039875152,0.00033169673,0.0005305275,0.0012454754,0.00064021535,0.0007677967,0.0010323707],"category_scores_gemma":[0.0035649864,0.00031849046,0.00013482425,0.00060911855,0.0006200499,0.00141126,0.00070190884,0.0006376869,0.0002183428],"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.00018493964,0.00007344565,0.0007499698,0.00013332751,0.000024208119,0.00028997913,0.00014190662,0.8099876,0.01151741,0.057272233,0.0022905674,0.11733434],"study_design_scores_gemma":[0.00000994346,0.00002969509,0.00012614377,0.000005720585,0.000005135132,0.000060744704,0.000025800598,0.98891187,0.0013694791,0.008257121,0.00118985,0.000008368339],"about_ca_topic_score_codex":0.003473883,"about_ca_topic_score_gemma":0.0016225444,"teacher_disagreement_score":0.003473883,"about_ca_system_score_codex":0.0008533266,"about_ca_system_score_gemma":0.0006670153,"threshold_uncertainty_score":0.006907344},"labels":[],"label_agreement":null},{"id":"W2107330658","doi":"10.1109/glocom.2005.1578077","title":"Optimal rotations for quasi-orthogonal STBC with two-dimensional constellations","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Coding gain; Constellation; Space–time block code; Keying; Coding (social sciences); Mathematics; Phase-shift keying; Algorithm; Diversity gain; Block code; Euclidean distance; Rotation (mathematics); Quadrature amplitude modulation; Computer science; Topology (electrical circuits); Telecommunications; Combinatorics; Geometry; Fading; Physics; Decoding methods; Statistics; Bit error rate","score_opus":0.022106246495537687,"score_gpt":0.28692486362159103,"score_spread":0.26481861712605337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107330658","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.20670173,0.0017520898,0.776164,0.0005795344,0.000076592674,0.00007412934,0.00021869534,0.00035052857,0.014082769],"genre_scores_gemma":[0.92623514,0.0011572357,0.07089598,0.00007041627,0.000049320675,0.00007334622,0.000119589444,0.000046427052,0.001352442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999218,0.00031187775,0.00003500767,0.000060969567,0.00023696017,0.00013720167],"domain_scores_gemma":[0.99897194,0.00052369136,0.00019425299,0.0001323935,0.0001309868,0.000046768735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006947651,0.0007364734,0.00045917238,0.00066607265,0.000316775,0.00094003114,0.00027919415,0.00046461745,0.001653891],"category_scores_gemma":[0.003356668,0.00033875732,0.00031444427,0.0009908925,0.0012803589,0.0011103102,0.0007878097,0.00048439013,0.00059765595],"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.00041409497,0.000054610442,0.0007522164,0.00014800722,0.00003471022,0.00013702457,0.00017845811,0.6840396,0.03270666,0.21544795,0.0016267982,0.06445989],"study_design_scores_gemma":[0.00009633846,0.00015906022,0.0004176089,0.000040775354,0.000015864278,0.00016028924,0.000056291297,0.88610864,0.012733656,0.09824005,0.0019244665,0.000046936664],"about_ca_topic_score_codex":0.00076290034,"about_ca_topic_score_gemma":0.00079911214,"teacher_disagreement_score":0.001653891,"about_ca_system_score_codex":0.00085103273,"about_ca_system_score_gemma":0.0007662493,"threshold_uncertainty_score":0.006174743},"labels":[],"label_agreement":null},{"id":"W2108375697","doi":"10.1109/glocom.2005.1578339","title":"Burst-based orthogonal ST block coding for CPM","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"University of British Columbia","funders":"","keywords":"Continuous phase modulation; Block code; Algorithm; Computer science; Coding (social sciences); Bit error rate; Electronic engineering; Mathematics; Telecommunications; Decoding methods; Engineering","score_opus":0.029428306966732057,"score_gpt":0.2902264852009385,"score_spread":0.2607981782342065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108375697","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.010633858,0.0005302778,0.98530143,0.00013938585,0.00008615557,0.000038318027,0.00004362576,0.00015294753,0.003074004],"genre_scores_gemma":[0.4939296,0.0016168489,0.49726477,0.00032183056,0.00025533102,0.0002390317,0.00025411157,0.00007323363,0.0060453946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995098,0.0001763226,0.000024679413,0.000042662294,0.00020628929,0.000040309154],"domain_scores_gemma":[0.9990355,0.00049315154,0.00009316883,0.00016244935,0.00019201491,0.000023834675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005658878,0.00050895516,0.00039530112,0.00043331456,0.0002947505,0.000462455,0.0005291228,0.00066980737,0.0020666185],"category_scores_gemma":[0.0020478445,0.00018642563,0.00024440215,0.00085098774,0.00050621113,0.00072281883,0.0006929111,0.00077361264,0.00063454325],"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.0003870513,0.00006841954,0.0006061338,0.00033795502,0.000056251993,0.00027030482,0.00018784903,0.17889021,0.10007918,0.4281178,0.002503128,0.28849572],"study_design_scores_gemma":[0.000037575475,0.00015415202,0.00016645934,0.00005796478,0.00002019558,0.00023416754,0.000013902861,0.93560654,0.014192344,0.039475027,0.010016325,0.000025396994],"about_ca_topic_score_codex":0.00064178725,"about_ca_topic_score_gemma":0.0009812971,"teacher_disagreement_score":0.0020666185,"about_ca_system_score_codex":0.00045956933,"about_ca_system_score_gemma":0.00057073496,"threshold_uncertainty_score":0.006913483},"labels":[],"label_agreement":null},{"id":"W2109155742","doi":"10.1109/glocom.2005.1578476","title":"Minimum BER transmit optimization for two-input multiple-output spatial multiplexing","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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":"Queen's University","funders":"","keywords":"Spatial multiplexing; MIMO; Beamforming; Transmitter; Phase-shift keying; Computer science; Multiplexing; Transmitter power output; Channel state information; Bit error rate; Precoding; Antenna (radio); Keying; Electronic engineering; Channel (broadcasting); Telecommunications; Wireless; Engineering","score_opus":0.047998556115146855,"score_gpt":0.30071625945223457,"score_spread":0.2527177033370877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109155742","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.036002595,0.00047159154,0.95855486,0.00027540806,0.00002008006,0.000023800314,0.000056223304,0.00013113301,0.0044643176],"genre_scores_gemma":[0.81183827,0.0007023974,0.1818518,0.00012779585,0.000052659867,0.00013827436,0.00009801008,0.00007862618,0.0051122434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994351,0.0002503755,0.000016806152,0.000051997566,0.00019251298,0.000053118532],"domain_scores_gemma":[0.99903274,0.00068161666,0.00011183321,0.000056622885,0.0000980604,0.000019142919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009939702,0.00079104403,0.0006051055,0.00031222563,0.00029354266,0.0006887062,0.00037835463,0.0006315771,0.0014304345],"category_scores_gemma":[0.0026222216,0.0003398024,0.0002668315,0.00057848444,0.0006882272,0.0007156514,0.0006380037,0.0004989114,0.0003322658],"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.000090443944,0.00002835834,0.00027156185,0.00008405231,0.000020157131,0.0000582795,0.00007171284,0.93533874,0.00646843,0.03349791,0.0005899078,0.023480486],"study_design_scores_gemma":[0.000006295933,0.000026143694,0.00006147347,0.0000040976074,0.0000028666377,0.00001704488,0.000007800537,0.99113256,0.0013374367,0.0071769427,0.00022251892,0.000004735255],"about_ca_topic_score_codex":0.0007568287,"about_ca_topic_score_gemma":0.00070991355,"teacher_disagreement_score":0.0014304345,"about_ca_system_score_codex":0.00081325736,"about_ca_system_score_gemma":0.00059747655,"threshold_uncertainty_score":0.0059006214},"labels":[],"label_agreement":null},{"id":"W2110776229","doi":"10.1109/glocom.2005.1577688","title":"Spatio-ternporal schedulers in IEEE 802.16","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"University of Toronto","funders":"","keywords":"Computer science; Base station; Computer network; Wireless broadband; Telecommunications link; Wireless; Mobile broadband; Scheduling (production processes); Broadband; Backhaul (telecommunications); WiMAX; Broadband networks; Wireless network; IEEE 802; Real-time computing; Telecommunications; Engineering","score_opus":0.019751528043394345,"score_gpt":0.25998545952447666,"score_spread":0.24023393148108232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110776229","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.05682194,0.0018290064,0.930372,0.0005181811,0.000611629,0.00019786018,0.00014945814,0.0012240591,0.008275756],"genre_scores_gemma":[0.78159726,0.000886325,0.21111548,0.00027013128,0.00027232277,0.00022881632,0.00018904704,0.00010533277,0.005335308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988361,0.000375239,0.00012123918,0.00014130675,0.00035276776,0.00017339869],"domain_scores_gemma":[0.99767834,0.00058671425,0.0003267488,0.0006524654,0.00061861373,0.00013724502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030673922,0.00045214125,0.00039325887,0.00040969616,0.0007341936,0.001145737,0.0012079058,0.00032031842,0.0025026419],"category_scores_gemma":[0.0047803326,0.00034698256,0.00028529915,0.00076838525,0.00064277306,0.001297683,0.00084233645,0.00072507176,0.0007907162],"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.0013476859,0.00037556997,0.005132845,0.00022267664,0.00012720698,0.0002852813,0.00039101526,0.4878206,0.017298613,0.163392,0.010568655,0.31303778],"study_design_scores_gemma":[0.00014518523,0.00030628737,0.00064828485,0.00002341587,0.000052418385,0.00019464949,0.00008721384,0.95000225,0.0071897204,0.024801886,0.016507972,0.000040787443],"about_ca_topic_score_codex":0.0044622035,"about_ca_topic_score_gemma":0.007889633,"teacher_disagreement_score":0.0044622035,"about_ca_system_score_codex":0.001088233,"about_ca_system_score_gemma":0.0026058892,"threshold_uncertainty_score":0.01622212},"labels":[],"label_agreement":null},{"id":"W2115248402","doi":"10.1109/glocom.2005.1577728","title":"On optimizing token bucket parameters at the network edge under generalized processor sharing (GPS) scheduling","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"University of Manitoba","funders":"","keywords":"Token bucket; Leaky bucket; Bounding overwatch; Computer science; Security token; Scheduling (production processes); Traffic shaping; Generalized processor sharing; Mathematical optimization; Computer network; Mathematics; Dynamic priority scheduling; Network traffic control; Quality of service; Round-robin scheduling","score_opus":0.03630965501397243,"score_gpt":0.27656494397902165,"score_spread":0.24025528896504922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115248402","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.1919027,0.0006172642,0.8036173,0.00023901826,0.000031829615,0.00006449484,0.000063825886,0.00021514278,0.0032485703],"genre_scores_gemma":[0.93921995,0.00032702243,0.059199702,0.0000456179,0.000018127354,0.000042562675,0.000045752095,0.00006494937,0.0010363346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994543,0.00022080881,0.000014421163,0.00007752361,0.000083015926,0.00014991712],"domain_scores_gemma":[0.9982323,0.0013274325,0.0001792445,0.00007752088,0.0001151167,0.00006851458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015566027,0.0007851944,0.0009424588,0.00046533303,0.00036178107,0.0010399142,0.00090337405,0.0008421066,0.0013477806],"category_scores_gemma":[0.0053726397,0.00033461722,0.00021971045,0.001000503,0.0008219841,0.0022334643,0.00085676764,0.0006417505,0.00015629204],"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.000076770506,0.0000123696345,0.00015952201,0.000020869393,0.000005146532,0.0000149079,0.000014812452,0.9864057,0.0009660609,0.0035988616,0.00014620007,0.008578822],"study_design_scores_gemma":[0.00000974269,0.000021657504,0.00005578291,0.0000026791708,0.0000038377275,0.0000049349683,0.000016950946,0.99583226,0.0006818396,0.0032398363,0.00012680552,0.0000037335278],"about_ca_topic_score_codex":0.002808613,"about_ca_topic_score_gemma":0.0020391624,"teacher_disagreement_score":0.002808613,"about_ca_system_score_codex":0.0011868649,"about_ca_system_score_gemma":0.0011944347,"threshold_uncertainty_score":0.008611321},"labels":[],"label_agreement":null},{"id":"W2115358448","doi":"10.1109/glocom.2005.1578472","title":"An analytical solution for the BER of an individually optimal single cochannel interferer BPSK receiver","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Phase-shift keying; Additive white Gaussian noise; Bit error rate; Interference (communication); Keying; Algorithm; Computer science; Binary number; White noise; Noise (video); Electronic engineering; Mathematics; Telecommunications; Decoding methods; Engineering; Artificial intelligence","score_opus":0.04388963841142763,"score_gpt":0.31376928984140096,"score_spread":0.26987965142997333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115358448","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.012036498,0.001097842,0.96542925,0.00051549566,0.000112824666,0.00003924862,0.00013196228,0.00042951416,0.02020732],"genre_scores_gemma":[0.541414,0.003926679,0.41866168,0.00048012042,0.0002741227,0.0003058115,0.00033353048,0.00041783057,0.034186285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994929,0.00008820896,0.000019934663,0.000070457085,0.00026610165,0.000062487095],"domain_scores_gemma":[0.99935013,0.00030740074,0.000059979153,0.00004959087,0.00021906951,0.000013853305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083640794,0.0010140177,0.0007847838,0.00065994187,0.00042568913,0.0010422599,0.0008962943,0.0015133229,0.0049900077],"category_scores_gemma":[0.0036597995,0.000473573,0.0005486306,0.00064598134,0.0009751391,0.0013964762,0.0005853499,0.0010433338,0.0023139226],"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.00005722417,0.000032995762,0.00036895767,0.00032132727,0.0000350259,0.00023489603,0.0002655894,0.8051116,0.012011591,0.14396363,0.004027339,0.033569932],"study_design_scores_gemma":[0.000009021282,0.00003341717,0.00025659017,0.000066780536,0.000017036711,0.00027916394,0.000060003833,0.9626364,0.0032070114,0.030048868,0.0033641115,0.000021541287],"about_ca_topic_score_codex":0.0014189119,"about_ca_topic_score_gemma":0.0019772293,"teacher_disagreement_score":0.0049900077,"about_ca_system_score_codex":0.0013794565,"about_ca_system_score_gemma":0.0011511933,"threshold_uncertainty_score":0.016693234},"labels":[],"label_agreement":null},{"id":"W2116978174","doi":"10.1109/glocom.2005.1578202","title":"Call-level and packet-level performance modeling in cellular CDMA networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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 Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Queueing theory; Handover; Telecommunications link; Cellular network; Call blocking; Call Admission Control; Queue; Throughput; Transmission delay; Call control; Code division multiple access; Real-time computing; Wireless network; Telecommunications; Wireless","score_opus":0.09163511005369797,"score_gpt":0.29639997611731345,"score_spread":0.2047648660636155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116978174","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.18590523,0.0014811059,0.7904481,0.0007312656,0.00013818617,0.00015596827,0.000626449,0.0010253545,0.01948831],"genre_scores_gemma":[0.9755341,0.000652873,0.019465966,0.00010822734,0.000063787724,0.0001338249,0.00017312616,0.000060501498,0.0038075882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882823,0.00036154597,0.000039820003,0.00014048854,0.00038377751,0.00024624664],"domain_scores_gemma":[0.99864286,0.00075348985,0.00014895477,0.000097424374,0.00029821752,0.00005911979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011467017,0.0011213185,0.0007205032,0.0006699207,0.0005680291,0.0019274344,0.0015663309,0.0015744675,0.0013780594],"category_scores_gemma":[0.004622854,0.00047889396,0.00047629452,0.0009606581,0.0009217313,0.0017293296,0.0007346596,0.001046122,0.0005027022],"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.000018772002,0.000018065843,0.0003122446,0.000013332127,0.000007934985,0.000024998026,0.0000267085,0.9879637,0.0009319974,0.00863061,0.00016612248,0.0018855901],"study_design_scores_gemma":[0.0000017006083,0.000007652896,0.0000697168,0.0000015684767,0.0000028277473,0.000004833452,0.0000036445126,0.99836344,0.00012960975,0.0013127405,0.000098961755,0.000003358235],"about_ca_topic_score_codex":0.015900541,"about_ca_topic_score_gemma":0.005552486,"teacher_disagreement_score":0.015900541,"about_ca_system_score_codex":0.0029253366,"about_ca_system_score_gemma":0.0013081564,"threshold_uncertainty_score":0.031615973},"labels":[],"label_agreement":null},{"id":"W2117764384","doi":"10.1109/glocom.2005.1578462","title":"Queue-aware uplink bandwidth allocation for polling services in 802.16 broadband wireless networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":48,"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 Winnipeg; University of Manitoba","funders":"","keywords":"Polling; Computer network; Computer science; Wireless broadband; Telecommunications link; Quality of service; Bandwidth allocation; Queueing theory; Scheduling (production processes); Broadband networks; Queue; Bandwidth (computing); Wireless; IEEE 802; Call Admission Control; Broadband; Wireless network; Telecommunications; Engineering","score_opus":0.01320950270994596,"score_gpt":0.25245193554416656,"score_spread":0.23924243283422061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117764384","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.14747393,0.0011018021,0.8479609,0.00040237303,0.00014163097,0.000068151676,0.000024255865,0.00046989173,0.0023570813],"genre_scores_gemma":[0.97190046,0.00017721382,0.027365778,0.000058040405,0.00003176317,0.000024697254,0.000007673373,0.000016109234,0.00041821346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993774,0.0002551184,0.000033029966,0.00006471643,0.00016438491,0.0001054085],"domain_scores_gemma":[0.99902964,0.0005195216,0.0001470426,0.00009927932,0.00014900265,0.000055450895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018636743,0.0002886147,0.0005318994,0.00039399264,0.0006981997,0.0008639762,0.0009790396,0.00057719764,0.0005238284],"category_scores_gemma":[0.0048394674,0.00025492205,0.00022427327,0.0005061704,0.000627612,0.0007884341,0.0005876945,0.0005325815,0.00007461476],"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.0003088194,0.00016905068,0.0031860964,0.0001130296,0.00005743394,0.00028882312,0.00031426648,0.8022602,0.034322556,0.060737412,0.00214443,0.096097894],"study_design_scores_gemma":[0.000012760404,0.000031315198,0.0002181947,0.000003054945,0.000009107188,0.0000309734,0.000012499653,0.9944049,0.0014247845,0.0035529402,0.00029149043,0.000007947855],"about_ca_topic_score_codex":0.0031627107,"about_ca_topic_score_gemma":0.003263144,"teacher_disagreement_score":0.0031627107,"about_ca_system_score_codex":0.0013549409,"about_ca_system_score_gemma":0.0011525315,"threshold_uncertainty_score":0.009856164},"labels":[],"label_agreement":null},{"id":"W2118673502","doi":"10.1109/glocom.2005.1578443","title":"High-rate codes over space, time, and frequency","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Queen's University","funders":"","keywords":"Block code; Orthogonal frequency-division multiplexing; Fading; MIMO; Decoding methods; Algorithm; Bit error rate; Computer science; MIMO-OFDM; Electronic engineering; Telecommunications","score_opus":0.012499237724501634,"score_gpt":0.25376674810210004,"score_spread":0.24126751037759842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118673502","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.11867786,0.0047013853,0.86078686,0.0004334621,0.00012130254,0.00006446232,0.00011845969,0.00030773232,0.01478851],"genre_scores_gemma":[0.8198093,0.0034021633,0.16992715,0.00018591991,0.00024385328,0.00015598247,0.00014291168,0.00005726717,0.0060754493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987675,0.00027194552,0.000048896094,0.000154702,0.0005885777,0.00016836937],"domain_scores_gemma":[0.99460196,0.0030382802,0.00065981137,0.00067926577,0.00093352917,0.00008713826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085790065,0.00053171336,0.00046278088,0.0007176214,0.00047885632,0.00079454866,0.0005795214,0.0006151918,0.0013703738],"category_scores_gemma":[0.005222573,0.00021885635,0.0002706422,0.0012870026,0.0010790774,0.0014208786,0.00073913473,0.0008159097,0.00046337285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00049543526,0.00008147138,0.0025367178,0.00036701845,0.00005553333,0.00028879926,0.00059183856,0.24602352,0.048829053,0.41769043,0.0014344435,0.28160578],"study_design_scores_gemma":[0.00009303141,0.0005591145,0.0015387891,0.00015436651,0.000061373314,0.0012019962,0.00016915167,0.80021787,0.054798048,0.11241749,0.028665103,0.00012373277],"about_ca_topic_score_codex":0.0012969805,"about_ca_topic_score_gemma":0.0013419432,"teacher_disagreement_score":0.0013703738,"about_ca_system_score_codex":0.00074585306,"about_ca_system_score_gemma":0.00072070654,"threshold_uncertainty_score":0.0054115057},"labels":[],"label_agreement":null},{"id":"W2119573140","doi":"10.1109/glocom.2005.1578386","title":"Capacity-approaching semi-orthogonal space-time block codes","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","field":"Engineering","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":"Block code; Linear code; Space–time block code; Circulant matrix; Concatenated error correction code; Mathematics; Computer science; Code word; Theoretical computer science; Algorithm; Discrete mathematics; Decoding methods","score_opus":0.023063698890426605,"score_gpt":0.25692456254048535,"score_spread":0.23386086365005873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119573140","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.10561321,0.0018061262,0.8630437,0.0005771625,0.00014519364,0.000048136953,0.0002987437,0.00040877605,0.02805898],"genre_scores_gemma":[0.9182215,0.001268211,0.0738669,0.00015906498,0.000143635,0.00010464517,0.00029493638,0.000039784867,0.0059013665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990779,0.00021938613,0.000028664103,0.00007839593,0.00043349396,0.00016207356],"domain_scores_gemma":[0.9974915,0.0012134364,0.0002182094,0.00033576807,0.0006539821,0.00008717674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008129896,0.00040496548,0.0005453385,0.00052732683,0.00035361102,0.001078396,0.0005481267,0.00048792592,0.0018027511],"category_scores_gemma":[0.0042323065,0.00018720048,0.00027776125,0.0007548213,0.00086660136,0.0011304553,0.0010155564,0.0008599258,0.0005690549],"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.00031521058,0.000040544244,0.00082104566,0.00017513603,0.000041529045,0.0002598768,0.00019361697,0.43470615,0.021216638,0.4381647,0.0053356043,0.09873007],"study_design_scores_gemma":[0.00002504953,0.00006932424,0.00022649679,0.000021553884,0.000007950948,0.0002206141,0.000025590745,0.91254336,0.005563848,0.076588415,0.0046861703,0.000021513632],"about_ca_topic_score_codex":0.0012196939,"about_ca_topic_score_gemma":0.000994873,"teacher_disagreement_score":0.0018027511,"about_ca_system_score_codex":0.0007337438,"about_ca_system_score_gemma":0.0010751908,"threshold_uncertainty_score":0.006030798},"labels":[],"label_agreement":null},{"id":"W2119652870","doi":"10.1109/glocom.2005.1578059","title":"Joint iterative multiuser detection and channel estimation for differentially coded asynchronous CDMA systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 Windsor","funders":"","keywords":"Computer science; Multiuser detection; Algorithm; Channel (broadcasting); Additive white Gaussian noise; Decoding methods; Code division multiple access; Estimator; Telecommunications link; Minimum mean square error; Single antenna interference cancellation; Mathematics; Telecommunications; Statistics","score_opus":0.024158461755531543,"score_gpt":0.26895883750880684,"score_spread":0.2448003757532753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119652870","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.008064156,0.00015148078,0.99118316,0.000039794086,0.000010121401,0.00001348732,0.00001003289,0.00014125944,0.00038658667],"genre_scores_gemma":[0.559395,0.0003304945,0.43847096,0.000067104214,0.00004657998,0.000108843844,0.00009662085,0.000029028997,0.001455297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987349,0.0004862422,0.000057929145,0.00013446982,0.0004734435,0.00011297951],"domain_scores_gemma":[0.99858224,0.0007328437,0.00015860274,0.00021002973,0.0002804511,0.000035833567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010114999,0.00061440666,0.00055902475,0.0004394804,0.0004135851,0.0007008454,0.0008925518,0.0007012145,0.0004824589],"category_scores_gemma":[0.0032725793,0.00039897434,0.00039950223,0.00044897592,0.00065848493,0.0007581963,0.0010161535,0.00075036334,0.0002508766],"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.00032559014,0.000081682614,0.0021820827,0.00018562804,0.00011685083,0.00028934472,0.00035400715,0.6009623,0.04394918,0.047555033,0.0013886526,0.30260968],"study_design_scores_gemma":[0.000013935468,0.00006199791,0.00019410624,0.0000054592374,0.00001215909,0.00006725485,0.0000070387932,0.9874254,0.007821411,0.0036683131,0.0007080896,0.0000149072075],"about_ca_topic_score_codex":0.0017373594,"about_ca_topic_score_gemma":0.0025480604,"teacher_disagreement_score":0.0017373594,"about_ca_system_score_codex":0.0006375244,"about_ca_system_score_gemma":0.0010232589,"threshold_uncertainty_score":0.0053493977},"labels":[],"label_agreement":null},{"id":"W2121938034","doi":"10.1109/glocom.2005.1578374","title":"On the optimal number of hops in infrastructure-based fixed relay networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":54,"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":"Hop (telecommunications); Relay; Computer science; Computer network; Wireless network; Spectral efficiency; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Channel (broadcasting); Power (physics)","score_opus":0.02535904658105658,"score_gpt":0.28665937485464854,"score_spread":0.26130032827359195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121938034","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.26550254,0.0032399737,0.7180557,0.0005510663,0.000059580583,0.00009135868,0.000103680046,0.00013596134,0.01226011],"genre_scores_gemma":[0.94396657,0.0018061554,0.052057523,0.000052731997,0.000046790192,0.00009066658,0.000046924477,0.00005779052,0.0018748903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.00052085944,0.000031132815,0.00012606435,0.0001652943,0.0001358449],"domain_scores_gemma":[0.99440527,0.0043593184,0.0005841334,0.00018798429,0.00031434163,0.00014883181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020434775,0.00087270176,0.00068225054,0.0012206197,0.00062446966,0.0011786512,0.0010437021,0.00092516677,0.0014711224],"category_scores_gemma":[0.010222651,0.00058924867,0.0003006599,0.0009469353,0.0020897663,0.0025616467,0.00075058104,0.0005428241,0.00024023274],"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.00012387149,0.000029872877,0.00073850213,0.000079615056,0.000028378445,0.00012614032,0.00008281317,0.91440314,0.0024418181,0.07099781,0.00042172993,0.010526396],"study_design_scores_gemma":[0.000049109007,0.00018345384,0.0006148962,0.000054997858,0.000042999236,0.00015372032,0.00019771766,0.9199042,0.0022036594,0.075245015,0.0013223747,0.000027911323],"about_ca_topic_score_codex":0.0009207596,"about_ca_topic_score_gemma":0.0010693143,"teacher_disagreement_score":0.0020434775,"about_ca_system_score_codex":0.0012639788,"about_ca_system_score_gemma":0.0006782725,"threshold_uncertainty_score":0.010807037},"labels":[],"label_agreement":null},{"id":"W2125656720","doi":"10.1109/glocom.2005.1578004","title":"Optical S-ALOHA/CDMA system for multirate applications: system architecture and performance evaluation","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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":"Université Laval","funders":"","keywords":"Aloha; Computer science; Code division multiple access; Network packet; Computer network; Throughput; Markov chain; Packet switching; Transmission (telecommunications); Telecommunications; Wireless","score_opus":0.0394546444886669,"score_gpt":0.3095236087175406,"score_spread":0.27006896422887366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125656720","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.86666495,0.0010494613,0.12595288,0.00016583777,0.000046198627,0.00013077077,0.000055809152,0.00055894296,0.0053751892],"genre_scores_gemma":[0.9773865,0.00020159496,0.021371843,0.000019504449,0.000018593499,0.000024504501,0.000031955016,0.000010053923,0.0009355143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.00014911221,0.000014469477,0.000043424807,0.00016142275,0.000060886476],"domain_scores_gemma":[0.999366,0.00020932198,0.000076237426,0.00007588337,0.00022690289,0.000045605226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009191096,0.00027618528,0.00030093064,0.0005394881,0.00036794893,0.0004914238,0.0004711847,0.00035914485,0.0013611718],"category_scores_gemma":[0.000973675,0.00009021154,0.00014091708,0.00032387898,0.00029665232,0.0006256814,0.00029152373,0.00024351524,0.00022146494],"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.0042650597,0.0008102738,0.021620518,0.00046926012,0.00023804068,0.0006371806,0.00036640448,0.34903917,0.26587555,0.016818082,0.0016488824,0.33821157],"study_design_scores_gemma":[0.00009176872,0.0014625181,0.003737366,0.000014512999,0.00006740523,0.0002999635,0.0000762548,0.9335428,0.057251807,0.0010974333,0.002325108,0.000032974134],"about_ca_topic_score_codex":0.0018329263,"about_ca_topic_score_gemma":0.0018937205,"teacher_disagreement_score":0.0018329263,"about_ca_system_score_codex":0.000567047,"about_ca_system_score_gemma":0.00034691492,"threshold_uncertainty_score":0.004860759},"labels":[],"label_agreement":null},{"id":"W2125828703","doi":"10.1109/glocom.2005.1578464","title":"Queueing analysis of OFDM/TDMA systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":30,"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":"Queueing theory; Time division multiple access; Computer science; Layered queueing network; Rayleigh fading; Computer network; Queue; Orthogonal frequency-division multiplexing; Fading; Channel (broadcasting)","score_opus":0.01721836265690664,"score_gpt":0.2579243439454483,"score_spread":0.24070598128854165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125828703","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.17468299,0.0034145352,0.8029277,0.0011189783,0.00023001354,0.00013350685,0.00027685903,0.00036411564,0.01685135],"genre_scores_gemma":[0.98007685,0.0009382021,0.015263907,0.00010193848,0.00013001822,0.00005878113,0.00009602663,0.000043989654,0.0032903021],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00020957869,0.000035541787,0.00010723022,0.00030916085,0.00017627589],"domain_scores_gemma":[0.9987117,0.00065864285,0.00016159336,0.000053130778,0.00034994356,0.00006504406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012254909,0.00058899156,0.0004952911,0.00060544297,0.0004949223,0.0010985264,0.00068796455,0.00054433075,0.0020263735],"category_scores_gemma":[0.0044510034,0.0002450431,0.00035416108,0.0005012044,0.0006775309,0.0011389977,0.00063242106,0.0006264357,0.00023594835],"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.00006405779,0.000060190967,0.0016952475,0.00009212357,0.00005258798,0.00021298684,0.00017254252,0.8669187,0.0047485414,0.11304189,0.0013116852,0.01162948],"study_design_scores_gemma":[0.0000030117676,0.000008797416,0.00019199909,0.0000028089096,0.0000037361572,0.00001155618,0.000013827112,0.9945075,0.0001652103,0.0048593893,0.00022850849,0.000003681648],"about_ca_topic_score_codex":0.015185753,"about_ca_topic_score_gemma":0.003627425,"teacher_disagreement_score":0.015185753,"about_ca_system_score_codex":0.0021491426,"about_ca_system_score_gemma":0.0011288476,"threshold_uncertainty_score":0.0301947},"labels":[],"label_agreement":null},{"id":"W2126425467","doi":"10.1109/glocom.2005.1577779","title":"Using feedback control to manage QoS for clusters of servers providing service differentiation","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Distributed and Parallel Computing Systems","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":"Western University","funders":"","keywords":"Server; Computer science; Quality of service; Control (management); Distributed computing; Service (business); Service level; Computer network; File server; Artificial intelligence","score_opus":0.04918237558252242,"score_gpt":0.2991411786468079,"score_spread":0.24995880306428547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126425467","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.16454099,0.0006516856,0.8298508,0.00032696233,0.00018670927,0.00010424235,0.00001903797,0.0014863681,0.002833232],"genre_scores_gemma":[0.96272844,0.00012428568,0.036084946,0.00008036458,0.0000456527,0.000038921633,0.000015524893,0.000019336598,0.0008625245],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999448,0.00010081053,0.000030505456,0.000100822646,0.00025259866,0.000067242225],"domain_scores_gemma":[0.99911255,0.00041412155,0.00012358681,0.0000982535,0.00020131374,0.000050203464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008972398,0.00042155222,0.0003230334,0.00032645787,0.00048297193,0.00068199186,0.0008605152,0.00041225663,0.00075457536],"category_scores_gemma":[0.0021811032,0.00018854075,0.00023897421,0.00023039554,0.0005849927,0.00076133094,0.00051703904,0.00048773855,0.00010743354],"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.0011704279,0.00062155444,0.0023949933,0.00028793263,0.000096079704,0.00032834182,0.00077549176,0.3486703,0.27059576,0.022875978,0.0017074835,0.35047555],"study_design_scores_gemma":[0.000079688194,0.00062903104,0.0006316191,0.00001269465,0.00003101986,0.000085441105,0.00006407396,0.9485418,0.04154918,0.0059463694,0.0023983507,0.000030689796],"about_ca_topic_score_codex":0.001973518,"about_ca_topic_score_gemma":0.0014270894,"teacher_disagreement_score":0.001973518,"about_ca_system_score_codex":0.00074167515,"about_ca_system_score_gemma":0.0005421669,"threshold_uncertainty_score":0.005381286},"labels":[],"label_agreement":null},{"id":"W2131143723","doi":"10.1109/glocom.2005.1578458","title":"Support of multimedia SIP applications in mobile ad hoc networks: service discovery and networking architecture","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Mobile Ad Hoc Networks","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":"Communications Research Centre Canada","funders":"","keywords":"Session Initiation Protocol; Computer science; Computer network; SIP trunking; Mobile ad hoc network; Service discovery; Session (web analytics); Service layer; Wireless ad hoc network; Voice over IP; The Internet; Quality of service; Server; World Wide Web; Telecommunications; Web service; Wireless","score_opus":0.014263055367609436,"score_gpt":0.2592723045023577,"score_spread":0.24500924913474828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131143723","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.12976788,0.0057734847,0.821392,0.001370814,0.00027710848,0.00027256657,0.00007186279,0.002914458,0.038159885],"genre_scores_gemma":[0.6824269,0.0046144207,0.2987667,0.00035895355,0.000258141,0.00028462367,0.0002654604,0.00014103095,0.012883752],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996836,0.00011218057,0.000021228032,0.000024419267,0.00013067198,0.000027869306],"domain_scores_gemma":[0.9996201,0.000080230304,0.000035249574,0.000057013305,0.0001734833,0.00003384366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285384,0.00036341802,0.00024364695,0.00036918413,0.000494316,0.0010613261,0.0006399875,0.00064206164,0.0008257838],"category_scores_gemma":[0.00083997846,0.00016051337,0.00014380856,0.00042037337,0.0003768476,0.0011141702,0.00039637223,0.00045298875,0.00045844112],"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.000638051,0.00041078447,0.0034726,0.0007658178,0.00008424125,0.0007333585,0.00065857306,0.06322841,0.2133576,0.18830708,0.01272994,0.51561356],"study_design_scores_gemma":[0.0000677565,0.00081084634,0.0022831517,0.00012471054,0.00015232482,0.0016558303,0.00022619624,0.7746114,0.07729742,0.05095746,0.09174016,0.00007274329],"about_ca_topic_score_codex":0.00044283332,"about_ca_topic_score_gemma":0.0008025927,"teacher_disagreement_score":0.0010613261,"about_ca_system_score_codex":0.0004337731,"about_ca_system_score_gemma":0.0006058704,"threshold_uncertainty_score":0.004910648},"labels":[],"label_agreement":null},{"id":"W2131482164","doi":"10.1109/glocom.2005.1577651","title":"Improved analysis of list decoding and its application to convolutional codes","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Decoding methods; Code word; Convolutional code; Computer science; Parity-check matrix; Sequential decoding; List decoding; Algorithm; Code (set theory); Linear code; Serial concatenated convolutional codes; Concatenated error correction code; Block code; Theoretical computer science","score_opus":0.018336538639002708,"score_gpt":0.2877390831975976,"score_spread":0.2694025445585949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131482164","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.00915009,0.00033789536,0.98769546,0.00008228973,0.000037510854,0.000019038933,0.000054784898,0.00028637802,0.0023365228],"genre_scores_gemma":[0.5992792,0.0023945712,0.3886403,0.00030551822,0.00031019512,0.00024510108,0.0004534141,0.0004561147,0.0079156095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988594,0.00036282543,0.00004362486,0.0000752559,0.00055402465,0.00010485819],"domain_scores_gemma":[0.9961647,0.0022571825,0.00025616447,0.0003418102,0.0009221749,0.000057958216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015350401,0.0011513508,0.0006185663,0.0015003642,0.00037192984,0.0007171469,0.0011275574,0.0008298667,0.0019060493],"category_scores_gemma":[0.010283918,0.00028555308,0.00064731005,0.001214572,0.0008138012,0.002174515,0.00092990045,0.0013272996,0.0007347693],"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.00007881506,0.000028148886,0.00077228935,0.00011823128,0.000025866859,0.00014431504,0.000089655456,0.7856128,0.006729231,0.16609995,0.0014116963,0.038888935],"study_design_scores_gemma":[0.0000013645508,0.0000149193,0.00006376586,0.000007497604,0.0000030603383,0.000020408608,0.0000028229238,0.97858536,0.0017910762,0.01900854,0.0004928006,0.000008350178],"about_ca_topic_score_codex":0.0022157603,"about_ca_topic_score_gemma":0.0014827127,"teacher_disagreement_score":0.0022157603,"about_ca_system_score_codex":0.0011646121,"about_ca_system_score_gemma":0.0009031215,"threshold_uncertainty_score":0.008449912},"labels":[],"label_agreement":null},{"id":"W2132007739","doi":"10.1109/glocom.2005.1577847","title":"Error rate of S + N selection combining M-ary NCFSK in Nakagami fading","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Fading; Nakagami distribution; Independent and identically distributed random variables; Mathematics; Algorithm; Diversity combining; Statistics; Bit error rate; Telecommunications; Computer science; Random variable; Decoding methods","score_opus":0.027049272020653478,"score_gpt":0.29030005642519113,"score_spread":0.26325078440453764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132007739","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.8974142,0.000994131,0.0941072,0.00038365342,0.000045717596,0.000025914283,0.00015994397,0.0003302521,0.006539002],"genre_scores_gemma":[0.9938834,0.00020278135,0.004802062,0.00004512688,0.0000147892615,0.000011846877,0.000084972584,0.000017938732,0.0009370932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983411,0.0005177095,0.00008801526,0.0001416996,0.00063838845,0.00027300266],"domain_scores_gemma":[0.9826314,0.013587502,0.0015569555,0.0007093405,0.0013376891,0.00017701923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033457505,0.0007137957,0.00079588767,0.00051934173,0.0006006048,0.00076482387,0.00058190833,0.0010933981,0.0010973284],"category_scores_gemma":[0.012700721,0.00021362607,0.0003361295,0.00079970364,0.0012008956,0.0010063809,0.0010145777,0.0004719113,0.00021340842],"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.0018348091,0.000064795466,0.017406872,0.000192181,0.00017236623,0.0006449403,0.00028727172,0.9147183,0.017590333,0.0144508155,0.0007623268,0.031874914],"study_design_scores_gemma":[0.000055555138,0.00031537045,0.0043410263,0.000028242664,0.00008022601,0.0006518097,0.00008399183,0.9707035,0.020364005,0.0029867634,0.0003317996,0.00005767952],"about_ca_topic_score_codex":0.0035470831,"about_ca_topic_score_gemma":0.0021805689,"teacher_disagreement_score":0.0035470831,"about_ca_system_score_codex":0.0009492424,"about_ca_system_score_gemma":0.0009134045,"threshold_uncertainty_score":0.017694294},"labels":[],"label_agreement":null},{"id":"W2132786415","doi":"10.1109/glocom.2005.1578471","title":"Optimum receivers for pilot symbol assisted modulation in Rician fading","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Rician fading; Fading; Detector; Computer science; Modulation (music); Symbol (formal); Rayleigh fading; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering; Physics; Acoustics","score_opus":0.04093043660509608,"score_gpt":0.2978946019338687,"score_spread":0.2569641653287726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132786415","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.017119417,0.00069046277,0.97970927,0.00015731872,0.000035350717,0.000025797364,0.000048155893,0.00019671032,0.0020175318],"genre_scores_gemma":[0.48783034,0.0015207456,0.50663495,0.00018926262,0.00019306933,0.0001331154,0.00016965588,0.000048648773,0.0032802525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851876,0.0005130014,0.00008263921,0.00020267503,0.00050435326,0.00017865858],"domain_scores_gemma":[0.9982021,0.0009042128,0.0002664701,0.00015129053,0.00042877853,0.00004726612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015014196,0.00090535596,0.0010786477,0.00087128597,0.0003149627,0.0013020892,0.00065867393,0.001564627,0.0013558058],"category_scores_gemma":[0.004662504,0.0007222769,0.0004612278,0.00068526046,0.0008751424,0.0012305779,0.000834545,0.0011271208,0.0011749889],"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.0014137179,0.00015476206,0.0033356221,0.0004926294,0.00019263684,0.0005771936,0.0005876086,0.3477768,0.10981863,0.25307205,0.005370568,0.2772077],"study_design_scores_gemma":[0.00015088356,0.00033374567,0.00090436,0.00011613634,0.00007327981,0.00057387,0.00007970219,0.8935619,0.03249508,0.06476755,0.0068608723,0.00008259289],"about_ca_topic_score_codex":0.00026219332,"about_ca_topic_score_gemma":0.0004958083,"teacher_disagreement_score":0.001564627,"about_ca_system_score_codex":0.0006622378,"about_ca_system_score_gemma":0.0006822905,"threshold_uncertainty_score":0.007940412},"labels":[],"label_agreement":null},{"id":"W2136719960","doi":"10.1109/glocom.2005.1578045","title":"Performance comparison of layered coding and multiple description coding in packet networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","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":"Queen's University","funders":"","keywords":"Retransmission; Go-Back-N ARQ; Computer science; Automatic repeat request; Network packet; Hybrid automatic repeat request; Selective Repeat ARQ; Packet loss; Linear network coding; Computer network; Coding (social sciences); Multiple description coding; End-to-end delay; Transmission delay; Real-time computing; Algorithm; Mathematics; Statistics; Telecommunications link","score_opus":0.05215254175720044,"score_gpt":0.3130629905788054,"score_spread":0.26091044882160497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136719960","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.70875305,0.0037005947,0.27611163,0.00067927205,0.00016352645,0.00013900775,0.00029406368,0.0013282029,0.008830807],"genre_scores_gemma":[0.9685707,0.0005145239,0.02985149,0.00007891593,0.000028509616,0.000037818012,0.00019930716,0.000037396137,0.0006813705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99755955,0.0008789555,0.000093509996,0.00010983308,0.0010358804,0.00032224742],"domain_scores_gemma":[0.9810144,0.013025555,0.00072367914,0.0010992922,0.0037487398,0.00038844216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034580904,0.0006681179,0.000665532,0.0009441966,0.0002988848,0.0011500245,0.00086271134,0.0009145627,0.0008997632],"category_scores_gemma":[0.020813793,0.00021324774,0.0002762319,0.0010005469,0.00068708294,0.0019385832,0.0013089081,0.00070034026,0.00019950644],"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.0033244926,0.00036692858,0.0070446962,0.00034320404,0.00021009817,0.0002006385,0.00023939382,0.701915,0.02658585,0.01907395,0.0016941964,0.2390016],"study_design_scores_gemma":[0.000040387225,0.00050956785,0.00069941545,0.000018956915,0.00003509298,0.0000749203,0.000038280403,0.9837915,0.012276276,0.002167704,0.0003093112,0.00003865702],"about_ca_topic_score_codex":0.0052015134,"about_ca_topic_score_gemma":0.0041655344,"teacher_disagreement_score":0.0052015134,"about_ca_system_score_codex":0.0014616193,"about_ca_system_score_gemma":0.0014103082,"threshold_uncertainty_score":0.018288374},"labels":[],"label_agreement":null},{"id":"W2138160752","doi":"10.1109/glocom.2005.1578206","title":"Energy efficient information collection with the ARIMA model in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":79,"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 Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Autoregressive integrated moving average; Wireless sensor network; Computer science; Wireless; Computer network; Data mining; Telecommunications; Time series; Machine learning","score_opus":0.011936453253223919,"score_gpt":0.22382888813488286,"score_spread":0.21189243488165893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138160752","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.008057756,0.00050461845,0.9904116,0.00015190152,0.000040313476,0.000018007133,0.000028722296,0.00022089404,0.0005661716],"genre_scores_gemma":[0.7191776,0.0025532288,0.2725779,0.00024619556,0.00034518572,0.00026184748,0.00026740058,0.00012969352,0.004440919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774194,0.0010167235,0.00012280534,0.0003464804,0.0006399767,0.00013207749],"domain_scores_gemma":[0.99743456,0.001775921,0.00019565315,0.00028182007,0.00027150623,0.000040660598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003022778,0.00088248274,0.0011327578,0.00071146083,0.00054772536,0.0011311764,0.0015285544,0.0010396146,0.0006411191],"category_scores_gemma":[0.0073331185,0.0006107419,0.0008741882,0.0014190989,0.00080675946,0.0028041438,0.0010063469,0.0017790773,0.00029565452],"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.0002063527,0.00010735967,0.001534849,0.00014420724,0.00018379139,0.00015038774,0.00021222679,0.8387201,0.0059775547,0.040218707,0.0011542545,0.11139026],"study_design_scores_gemma":[0.0000074671098,0.000043228865,0.00015178185,0.0000060496336,0.000016403368,0.000021442333,0.000010538531,0.9875843,0.000737134,0.010805924,0.0005999648,0.000015712729],"about_ca_topic_score_codex":0.0065824497,"about_ca_topic_score_gemma":0.0049162386,"teacher_disagreement_score":0.0065824497,"about_ca_system_score_codex":0.00067277777,"about_ca_system_score_gemma":0.000998901,"threshold_uncertainty_score":0.015986145},"labels":[],"label_agreement":null},{"id":"W2138519663","doi":"10.1109/glocom.2005.1578495","title":"MMSE based turbo equalization for chip space-time block coded downlink CDMA","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 British Columbia","funders":"","keywords":"Computer science; Turbo; Turbo code; Telecommunications link; Equalization (audio); Electronic engineering; Fading; Block code; Decoding methods; Turbo equalizer; Code division multiple access; Multipath propagation; Algorithm; Computer network; Channel (broadcasting); Concatenated error correction code; Engineering","score_opus":0.023024995725500687,"score_gpt":0.2806043566591221,"score_spread":0.2575793609336214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138519663","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.034661338,0.00030491708,0.9611724,0.000113156166,0.000052592,0.000029725054,0.000034938468,0.0004793232,0.003151627],"genre_scores_gemma":[0.75962955,0.0005374177,0.2318184,0.00014206614,0.00006492152,0.00006128537,0.00009410627,0.000046189733,0.0076061822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999671,0.000085599706,0.000018566196,0.00003191242,0.00015372678,0.000039254817],"domain_scores_gemma":[0.999356,0.00028598742,0.00005234869,0.00007248625,0.00021766032,0.000015634998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043075762,0.00033327402,0.00034429968,0.00031131756,0.00035182261,0.00041974572,0.0004719572,0.0005428112,0.0015609041],"category_scores_gemma":[0.0017392301,0.00022443263,0.00029232947,0.00035851047,0.00038887621,0.0005821688,0.0003800919,0.0005011848,0.0006821459],"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.00048076638,0.00009376176,0.0015122658,0.00016937258,0.00009509988,0.00033648685,0.00018332643,0.5986806,0.12451066,0.038822237,0.0031382767,0.23197708],"study_design_scores_gemma":[0.000008342167,0.00006278089,0.00016809403,0.0000070468036,0.000013122655,0.00007970334,0.000007677392,0.97552764,0.02197541,0.001226263,0.000912444,0.000011444911],"about_ca_topic_score_codex":0.0024169637,"about_ca_topic_score_gemma":0.0052048624,"teacher_disagreement_score":0.0024169637,"about_ca_system_score_codex":0.00039065207,"about_ca_system_score_gemma":0.0008652696,"threshold_uncertainty_score":0.0052217245},"labels":[],"label_agreement":null},{"id":"W2138719047","doi":"10.1109/glocom.2005.1578033","title":"Fairness control in wavelength-routed WDM ring networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Carleton University","funders":"","keywords":"Blocking (statistics); Computer science; Hop (telecommunications); Wavelength-division multiplexing; Computer network; Scheme (mathematics); Wavelength; Distributed computing; Mathematics","score_opus":0.014768924305396012,"score_gpt":0.24683110579892498,"score_spread":0.23206218149352897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138719047","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.17009245,0.00041951868,0.8275078,0.000137444,0.00005846313,0.00005526717,0.00002071209,0.00021520056,0.0014931583],"genre_scores_gemma":[0.9726094,0.000073443916,0.026833495,0.000021184449,0.000020446381,0.000019540259,0.0000069307057,0.000011195651,0.00040441548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883467,0.00052869745,0.000041742656,0.00014179034,0.00029313593,0.00015989895],"domain_scores_gemma":[0.99693525,0.0020741974,0.0003095693,0.00019772399,0.00034570455,0.00013752993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003252663,0.0003725487,0.00063198176,0.0004135315,0.0007153988,0.00088563655,0.0013379507,0.00045481033,0.00048456885],"category_scores_gemma":[0.006169135,0.0002455717,0.00028224228,0.00033153075,0.0011943608,0.0012096887,0.00087814446,0.00048265624,0.0000782859],"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.00030581953,0.00007392101,0.0008665585,0.000044600078,0.000030642954,0.00009476287,0.00020293905,0.9144687,0.010779482,0.0431033,0.00024741565,0.029781794],"study_design_scores_gemma":[0.000014238876,0.00003346728,0.00006913491,0.000001585963,0.0000050656713,0.000011622896,0.0000063450925,0.993085,0.0011799678,0.0054290756,0.00015915162,0.0000053661647],"about_ca_topic_score_codex":0.0023932196,"about_ca_topic_score_gemma":0.0015480799,"teacher_disagreement_score":0.003252663,"about_ca_system_score_codex":0.0012755614,"about_ca_system_score_gemma":0.0008804003,"threshold_uncertainty_score":0.01720196},"labels":[],"label_agreement":null},{"id":"W2140124754","doi":"10.1109/glocom.2005.1578320","title":"Performance analysis of the node cooperative ARQ scheme for wireless ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"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":"Wireless ad hoc network; Computer science; Computer network; Node (physics); Scheme (mathematics); Selective Repeat ARQ; Automatic repeat request; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless network; Wireless; Optimized Link State Routing Protocol; Hybrid automatic repeat request; Telecommunications; Telecommunications link; Network packet; Engineering; Mathematics","score_opus":0.03751028069615478,"score_gpt":0.2919866345592695,"score_spread":0.25447635386311473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140124754","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.31782687,0.003838237,0.6571105,0.00079402834,0.00013251985,0.00014899537,0.00012925366,0.0004867765,0.019532744],"genre_scores_gemma":[0.9906977,0.00082067424,0.006502955,0.000040802952,0.00004092813,0.000045081953,0.000038020855,0.00002655352,0.0017872438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.000393008,0.00002188553,0.00008308914,0.00044538823,0.00018226301],"domain_scores_gemma":[0.99715376,0.0018823144,0.00018052399,0.0001372503,0.00059641735,0.000049756858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021502902,0.0008493925,0.0005899975,0.00077726564,0.00054224284,0.00083410216,0.00072115374,0.0006205282,0.0016481675],"category_scores_gemma":[0.006392632,0.00029605985,0.0004278394,0.0006934217,0.0009087385,0.0009524154,0.000591789,0.000603922,0.00033858282],"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.00010287998,0.00003829864,0.00068167364,0.000074851065,0.000034263267,0.00011451158,0.00016950512,0.9413128,0.0075582266,0.035224225,0.0007861396,0.0139026595],"study_design_scores_gemma":[0.0000029435912,0.000050551236,0.0001631789,0.000003906019,0.00000646031,0.000024268238,0.00001853794,0.997373,0.00043440962,0.0017746051,0.00014272066,0.0000054272446],"about_ca_topic_score_codex":0.00531088,"about_ca_topic_score_gemma":0.0027752514,"teacher_disagreement_score":0.00531088,"about_ca_system_score_codex":0.0021932046,"about_ca_system_score_gemma":0.0010091638,"threshold_uncertainty_score":0.01591283},"labels":[],"label_agreement":null},{"id":"W2141338028","doi":"10.1109/glocom.2005.1577786","title":"Call level service differentiation for efficient SLA management","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"University of Waterloo; University of Toronto","funders":"","keywords":"Service-level agreement; Computer science; Bandwidth (computing); Quality of service; Service level; Computer network; Preemption; Shared resource; Differentiated services; Service (business); Distributed computing; Operating system; Business","score_opus":0.034292673773368296,"score_gpt":0.2707770062553197,"score_spread":0.2364843324819514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141338028","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.016299482,0.00060227566,0.9732983,0.0004987225,0.00021005223,0.00011650608,0.000029302351,0.00097172,0.0079736225],"genre_scores_gemma":[0.6605899,0.00048361337,0.33359337,0.00038694975,0.00023268885,0.00013841438,0.00010578233,0.000121382334,0.0043479614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826604,0.00052170304,0.0001004981,0.00017117096,0.0006954429,0.00024505367],"domain_scores_gemma":[0.99821645,0.0006091211,0.00018330666,0.0004797533,0.00038389378,0.00012747914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002229167,0.00044778598,0.0005368796,0.0004603779,0.0008440575,0.0014993558,0.0013569923,0.00072133937,0.003582656],"category_scores_gemma":[0.0038203383,0.00026378754,0.0003709762,0.00055162515,0.000730761,0.0015561716,0.0014746597,0.002377478,0.0012918249],"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.00035243388,0.00032827354,0.001002198,0.00031434142,0.00006140325,0.00039885181,0.0005971812,0.13673565,0.10926892,0.41881454,0.009649506,0.3224767],"study_design_scores_gemma":[0.00006347291,0.00015395517,0.0004305945,0.00004988298,0.00003277376,0.000311388,0.00008277725,0.8792657,0.017518165,0.063044906,0.038992763,0.000053589858],"about_ca_topic_score_codex":0.0011019827,"about_ca_topic_score_gemma":0.0011979674,"teacher_disagreement_score":0.003582656,"about_ca_system_score_codex":0.0010500626,"about_ca_system_score_gemma":0.0013796083,"threshold_uncertainty_score":0.011985183},"labels":[],"label_agreement":null},{"id":"W2142122479","doi":"10.1109/glocom.2005.1577852","title":"Low-density parity-check convolutional codes applied to packet based communication systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Error Correcting Code Techniques","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 Alberta","funders":"","keywords":"Low-density parity-check code; Encoder; Convolutional code; Computer science; Serial concatenated convolutional codes; Network packet; Turbo code; Algorithm; Decoding methods; Communications system; Forward error correction; Block code; Theoretical computer science; Concatenated error correction code; Computer network","score_opus":0.027947130595222063,"score_gpt":0.2825641169939033,"score_spread":0.25461698639868124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142122479","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.03431302,0.0010084442,0.9575102,0.0002540632,0.00008783782,0.00004758579,0.000034407596,0.0002719082,0.0064725126],"genre_scores_gemma":[0.8521001,0.0023190472,0.14118186,0.00012318756,0.00007742256,0.00008066812,0.000054325195,0.000042763444,0.0040206383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996604,0.0001057948,0.000013171443,0.000028545903,0.00015721611,0.00003490876],"domain_scores_gemma":[0.99909544,0.0005782027,0.000059759717,0.00009106092,0.00016265645,0.000012809192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039087894,0.00038715545,0.0002678424,0.00039338914,0.0003073669,0.0005589688,0.0003266973,0.00057727686,0.00084277795],"category_scores_gemma":[0.0025810516,0.00017205942,0.00017249885,0.00061010284,0.000589297,0.00042692598,0.00040688404,0.0006253547,0.0002292764],"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.000094617164,0.000032190517,0.0015469282,0.000296748,0.000035130724,0.00044659,0.00018494221,0.53304404,0.030711144,0.32800263,0.0013175417,0.10428759],"study_design_scores_gemma":[0.000008260781,0.000048681126,0.00024457093,0.000027720347,0.000016531074,0.00015037203,0.000012211962,0.9463013,0.012785841,0.03630754,0.004086664,0.000010256235],"about_ca_topic_score_codex":0.002635113,"about_ca_topic_score_gemma":0.0019748472,"teacher_disagreement_score":0.002635113,"about_ca_system_score_codex":0.0007952398,"about_ca_system_score_gemma":0.0008404376,"threshold_uncertainty_score":0.0057699084},"labels":[],"label_agreement":null},{"id":"W2142738316","doi":"10.1109/glocom.2005.1577745","title":"Applying PR-SCTP to transport SIP traffic","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"IPv6, Mobility, Handover, Networks, Security","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":"University of British Columbia","funders":"","keywords":"Stream Control Transmission Protocol; Retransmission; Computer network; Session Initiation Protocol; Computer science; Transport layer; Reliability (semiconductor); Session (web analytics); The Internet; Layer (electronics); Network packet; Server; Operating system; Chemistry","score_opus":0.019492755068478043,"score_gpt":0.25428989512880346,"score_spread":0.23479714006032543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142738316","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.22541139,0.0008207342,0.7560101,0.00071753544,0.0002472192,0.0003802233,0.00008661598,0.0027270361,0.013599209],"genre_scores_gemma":[0.8851778,0.0004604904,0.11174993,0.00020028035,0.00013435587,0.00009441664,0.00016102467,0.00006978132,0.0019519693],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991635,0.0002298377,0.00007561107,0.00009127327,0.0003586768,0.000081082486],"domain_scores_gemma":[0.99776065,0.00044275942,0.00014740319,0.00067727274,0.00091065414,0.00006127557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012339795,0.00041658344,0.00025838354,0.0005919746,0.00046221082,0.000701759,0.0007301665,0.00056351366,0.00044878424],"category_scores_gemma":[0.003132695,0.00016709066,0.00028916667,0.00042652874,0.0005562874,0.000779431,0.00075163506,0.0007596915,0.0003801972],"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.00041062455,0.00022452857,0.005256024,0.0005197802,0.00013163277,0.0015211217,0.0006654161,0.06594647,0.49732324,0.021987153,0.0040303315,0.40198368],"study_design_scores_gemma":[0.0000528425,0.0011499503,0.0028214522,0.00009513383,0.00013646981,0.0029384703,0.00026614792,0.6324819,0.3191767,0.009573895,0.03122279,0.00008433689],"about_ca_topic_score_codex":0.0009444837,"about_ca_topic_score_gemma":0.00080090854,"teacher_disagreement_score":0.0012339795,"about_ca_system_score_codex":0.0002995358,"about_ca_system_score_gemma":0.00048144753,"threshold_uncertainty_score":0.0065259933},"labels":[],"label_agreement":null},{"id":"W2143021806","doi":"10.1109/glocom.2005.1577887","title":"Precise bit error probability analysis of DCT OFDM in the presence of carrier frequency offset on AWGN channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"PAPR reduction in OFDM","field":"Engineering","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":"University of Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Additive white Gaussian noise; Phase-shift keying; Discrete cosine transform; Carrier frequency offset; Quadrature amplitude modulation; Computer science; Bit error rate; Algorithm; Electronic engineering; Frequency offset; QAM; Discrete Fourier transform (general); Keying; Mathematics; Telecommunications; White noise; Fourier transform; Fractional Fourier transform; Decoding methods; Engineering; Channel (broadcasting); Fourier analysis","score_opus":0.04230999826414001,"score_gpt":0.2958693911485138,"score_spread":0.2535593928843738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143021806","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.07678416,0.0007214689,0.9198949,0.00007691727,0.000033179145,0.000022882796,0.00008782871,0.00027428695,0.0021044163],"genre_scores_gemma":[0.9050219,0.0011741476,0.092071965,0.00004995522,0.000057104164,0.000058468824,0.00018172983,0.00005344106,0.0013314647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784863,0.000400955,0.000100048215,0.00018531,0.0013475388,0.00011752786],"domain_scores_gemma":[0.9944952,0.0040648635,0.00037222233,0.00045262682,0.0005795875,0.000035478584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014561075,0.00074577343,0.00072335836,0.0008971128,0.00032009435,0.0006033711,0.0005182274,0.00062630966,0.0010975918],"category_scores_gemma":[0.0102134785,0.00030374157,0.00033368412,0.00078843714,0.0007327442,0.0014209842,0.0006281434,0.00064201787,0.00026560508],"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.00035151324,0.00003281425,0.002715155,0.00019638705,0.000070717746,0.0005253606,0.00014090646,0.8515787,0.04730568,0.03728169,0.0004961558,0.059304915],"study_design_scores_gemma":[0.000004477678,0.000052356827,0.0011307835,0.00001359495,0.000016594919,0.000277485,0.000010433814,0.9820681,0.0131871505,0.002923615,0.00029522213,0.000020235835],"about_ca_topic_score_codex":0.0012183273,"about_ca_topic_score_gemma":0.0009793008,"teacher_disagreement_score":0.0014561075,"about_ca_system_score_codex":0.0006363522,"about_ca_system_score_gemma":0.0003964597,"threshold_uncertainty_score":0.0077007413},"labels":[],"label_agreement":null},{"id":"W2144433150","doi":"10.1109/glocom.2005.1578390","title":"On distributed space-time filtering","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","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 British Columbia","funders":"","keywords":"Node (physics); Computer science; Channel (broadcasting); Relation (database); Filter (signal processing); Algorithm; Grassmannian; Upper and lower bounds; Optimization problem; Wireless; Topology (electrical circuits); Mathematical optimization; Control theory (sociology); Mathematics; Artificial intelligence; Telecommunications; Engineering; Data mining","score_opus":0.03322163927317642,"score_gpt":0.28439093554073036,"score_spread":0.2511692962675539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144433150","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.0027777217,0.0003874018,0.9942028,0.00015288021,0.000051429623,0.000009183587,0.000012031429,0.00003308875,0.002373428],"genre_scores_gemma":[0.58136135,0.0047269566,0.39598307,0.00058038766,0.00089933054,0.00025549834,0.00022216441,0.00011512457,0.01585615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986046,0.00045501153,0.000059954302,0.00021086191,0.000551083,0.00011844558],"domain_scores_gemma":[0.99830085,0.0009785045,0.00010957028,0.00026550816,0.00029934128,0.000046243505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015215796,0.0009127903,0.00073505216,0.0005631912,0.00041542112,0.0011115707,0.0006971393,0.0012353436,0.0021649182],"category_scores_gemma":[0.0034764067,0.00027716736,0.0004623697,0.0011058552,0.001683578,0.001606521,0.0012415237,0.0011199324,0.000697781],"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.00018486928,0.000047200076,0.00045118527,0.00014189527,0.00005057772,0.00009247374,0.00014933084,0.33003852,0.012320656,0.5036167,0.003350209,0.14955643],"study_design_scores_gemma":[0.000030432915,0.00011638236,0.00018020788,0.000029237952,0.000014753269,0.00009010777,0.000022431994,0.8574938,0.004092114,0.12911433,0.008793293,0.000022932896],"about_ca_topic_score_codex":0.0009793208,"about_ca_topic_score_gemma":0.0008896658,"teacher_disagreement_score":0.0021649182,"about_ca_system_score_codex":0.0008890909,"about_ca_system_score_gemma":0.000640076,"threshold_uncertainty_score":0.008046925},"labels":[],"label_agreement":null},{"id":"W2144575370","doi":"10.1109/glocom.2005.1577837","title":"Cooperative diversity using message passing in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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 Toronto","funders":"","keywords":"Decoding methods; Decodes; Relay; Computer science; Fading; Cooperative diversity; Relay channel; Channel (broadcasting); Computer network; Parity bit; Wireless; Node (physics); Algorithm; Telecommunications; Engineering","score_opus":0.05801066960294587,"score_gpt":0.29995637230889116,"score_spread":0.2419457027059453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144575370","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.028252037,0.0030770595,0.9657034,0.0003247734,0.00011986995,0.00005999963,0.000023734148,0.00034289501,0.0020962302],"genre_scores_gemma":[0.8889451,0.0033612722,0.10446449,0.00013346096,0.00027835762,0.00020646445,0.000065388354,0.000029378885,0.0025160187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989072,0.00053395337,0.00005311959,0.000112751,0.00032978918,0.00006319735],"domain_scores_gemma":[0.9980831,0.001181163,0.00025876652,0.00022794896,0.00020680265,0.00004221959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018756676,0.00060802844,0.0007294912,0.0007379449,0.00046328825,0.0008890379,0.00079196383,0.0009994345,0.00035876242],"category_scores_gemma":[0.0034964886,0.00031921334,0.00034084,0.0011634151,0.0013255356,0.0013861279,0.0010981765,0.00076764636,0.00014748421],"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.00019166512,0.000083472136,0.0010681418,0.00038667416,0.00013428715,0.00026571876,0.000432979,0.6979809,0.018112365,0.12897459,0.0013947134,0.15097453],"study_design_scores_gemma":[0.0000314392,0.00017167258,0.0001780486,0.000025460577,0.000030296695,0.000086839274,0.00002280957,0.93406594,0.0040082396,0.057762526,0.0035950658,0.000021675169],"about_ca_topic_score_codex":0.0007431159,"about_ca_topic_score_gemma":0.0005696874,"teacher_disagreement_score":0.0018756676,"about_ca_system_score_codex":0.0005103586,"about_ca_system_score_gemma":0.00044709674,"threshold_uncertainty_score":0.009919584},"labels":[],"label_agreement":null},{"id":"W2144774445","doi":"10.1109/glocom.2005.1578203","title":"Connection admission control algorithms for OFDM wireless networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","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 Winnipeg; University of Manitoba","funders":"","keywords":"Connection (principal bundle); Queueing theory; Computer science; Admission control; Queue; Computer network; Orthogonal frequency-division multiplexing; Network packet; Wireless; Scheme (mathematics); Wireless network; Algorithm; Real-time computing; Mathematics; Telecommunications; Channel (broadcasting); Quality of service","score_opus":0.018893301785923838,"score_gpt":0.2675074850987157,"score_spread":0.24861418331279186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144774445","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.015897151,0.0013845447,0.9771851,0.0003786434,0.000113607915,0.00010070029,0.00004873729,0.00043429923,0.0044572107],"genre_scores_gemma":[0.802072,0.0019406892,0.18992466,0.00022742485,0.00026901308,0.0003401633,0.00014165451,0.000105145584,0.0049792132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998623,0.0003659477,0.00006576034,0.00012637087,0.0006257055,0.00019322048],"domain_scores_gemma":[0.99748576,0.0016226333,0.00019713746,0.00013990008,0.0004896906,0.0000649018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018494143,0.00081899075,0.0007413286,0.0010152289,0.00078416703,0.0015877518,0.0016015429,0.000860336,0.0028364125],"category_scores_gemma":[0.009150576,0.00031380277,0.00035678557,0.0013912228,0.00084943866,0.0015032064,0.0010186378,0.0014845062,0.00039820056],"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.00008685976,0.000097681324,0.00055405457,0.00007360685,0.00003549229,0.00004042915,0.00015063012,0.770597,0.0017810591,0.10667096,0.0030070168,0.11690525],"study_design_scores_gemma":[0.0000062687973,0.0000065614095,0.000048806756,0.0000040348104,0.000002878974,0.000006572062,0.000005106187,0.98820275,0.00014825867,0.011113416,0.00045149287,0.000003819805],"about_ca_topic_score_codex":0.007958293,"about_ca_topic_score_gemma":0.0042119967,"teacher_disagreement_score":0.007958293,"about_ca_system_score_codex":0.002484528,"about_ca_system_score_gemma":0.0015918784,"threshold_uncertainty_score":0.01802659},"labels":[],"label_agreement":null},{"id":"W2147610275","doi":"10.1109/glocom.2005.1577960","title":"Vulnerability analysis of IP traceback schemes","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Security and Intrusion Detection","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 Waterloo; University of Victoria","funders":"","keywords":"IP traceback; Computer science; Denial-of-service attack; Exploit; Vulnerability (computing); Computer network; Stateless protocol; Computer security; Network packet; Context (archaeology); Overhead (engineering); Probabilistic logic; The Internet; Buffer overflow; Vulnerability assessment","score_opus":0.030711574122465547,"score_gpt":0.2957869377449852,"score_spread":0.26507536362251966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147610275","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.59810555,0.001222197,0.38998497,0.0008956715,0.000037353737,0.00021565736,0.00017954315,0.00063924957,0.008719829],"genre_scores_gemma":[0.9913088,0.00024177696,0.0079713315,0.000019408593,0.000007991055,0.000028353134,0.00003312854,0.00001546327,0.00037366524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978656,0.0007264131,0.00013030738,0.00014771255,0.0008324841,0.00029754132],"domain_scores_gemma":[0.9876351,0.008411465,0.001383319,0.0013434337,0.0009883911,0.00023840404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021276523,0.00050800346,0.0005663014,0.002464276,0.000614788,0.00089317624,0.0007994541,0.0008351691,0.00095873605],"category_scores_gemma":[0.015028795,0.00021289913,0.0004878471,0.0010379114,0.0016116281,0.0026562538,0.0013393533,0.00086358597,0.0000945127],"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.00032679643,0.00016358728,0.012133593,0.0002996344,0.00009890195,0.000736589,0.00057165785,0.6862313,0.025820553,0.22432488,0.0014111312,0.047881335],"study_design_scores_gemma":[0.0000075384232,0.0000629266,0.0008009198,0.000017438859,0.00002627227,0.000311502,0.000059762657,0.9725801,0.004572042,0.02103589,0.0005097208,0.000015942323],"about_ca_topic_score_codex":0.0008182411,"about_ca_topic_score_gemma":0.00029886203,"teacher_disagreement_score":0.002464276,"about_ca_system_score_codex":0.0013994717,"about_ca_system_score_gemma":0.0006429572,"threshold_uncertainty_score":0.011252224},"labels":[],"label_agreement":null},{"id":"W2149617299","doi":"10.1109/glocom.2005.1578019","title":"2D optical CDMA networks using multi-wavelength pulse modulation and modified carrier-hopping prime sequence","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"graph theory and CDMA 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":"McGill University","funders":"","keywords":"Code division multiple access; Modulation (music); Computer science; Interference (communication); Prime (order theory); Electronic engineering; Broadband; Optical communication; Telecommunications; Physics; Engineering; Mathematics; Channel (broadcasting)","score_opus":0.05076284663640882,"score_gpt":0.27804686886344787,"score_spread":0.22728402222703906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149617299","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.28966105,0.0013794092,0.7010633,0.00029801278,0.000118538235,0.00013313588,0.000039346447,0.0004237775,0.0068833986],"genre_scores_gemma":[0.78415537,0.0006806348,0.21279,0.00014556569,0.00008815216,0.00012961905,0.000047473142,0.000015692363,0.0019475203],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995943,0.00015981757,0.000013649813,0.00007756656,0.00012279164,0.00003195315],"domain_scores_gemma":[0.9996259,0.00019275697,0.000059192098,0.000052279203,0.000049595044,0.000020279094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003289607,0.0005316749,0.00026911456,0.00053469336,0.00033879562,0.000597697,0.0004050991,0.0005163665,0.00047961716],"category_scores_gemma":[0.0007433457,0.00027545396,0.00023584669,0.00052861794,0.00060740486,0.001224568,0.0006006586,0.00032283054,0.0001457829],"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.0006472736,0.00025051073,0.003345775,0.0005427738,0.00015477973,0.001376211,0.00073765125,0.15949786,0.35429558,0.17306967,0.0018935718,0.30418834],"study_design_scores_gemma":[0.00020330831,0.0011329617,0.0017077343,0.00005950749,0.00010490247,0.0020156435,0.00010410795,0.84133786,0.09701944,0.03963623,0.01657475,0.00010347524],"about_ca_topic_score_codex":0.0005852102,"about_ca_topic_score_gemma":0.001102105,"teacher_disagreement_score":0.000597697,"about_ca_system_score_codex":0.0004126679,"about_ca_system_score_gemma":0.00039731953,"threshold_uncertainty_score":0.0029941797},"labels":[],"label_agreement":null},{"id":"W2151152523","doi":"10.1109/glocom.2005.1578433","title":"Locally optimal relay node placement in heterogeneous wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":64,"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":"Relay; Wireless sensor network; Computer science; Computer network; Heuristic; Node (physics); Key distribution in wireless sensor networks; Distributed computing; Grid; Wireless network; Wireless; Engineering; Telecommunications; Mathematics; Power (physics)","score_opus":0.017757762280610313,"score_gpt":0.2557282246524422,"score_spread":0.2379704623718319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151152523","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.053256426,0.0004422923,0.94469017,0.00009760878,0.000023389364,0.000029465702,0.000029517902,0.00021530889,0.0012158098],"genre_scores_gemma":[0.8843467,0.00043996936,0.11371062,0.00003782352,0.000024083145,0.00006811734,0.000070494825,0.000059581744,0.0012425834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941146,0.00026274892,0.000027242504,0.00012672126,0.0001128446,0.000059009428],"domain_scores_gemma":[0.99941134,0.00032539948,0.00010510982,0.000068333415,0.000055586785,0.00003420379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000975015,0.00065392524,0.00075445883,0.00048200155,0.0003898396,0.0006774034,0.0007482447,0.0006738025,0.0005244396],"category_scores_gemma":[0.002665145,0.00041411078,0.00028983958,0.0005152232,0.00060649955,0.0011025659,0.00082080334,0.00030903466,0.0002053103],"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.00008371283,0.000018168528,0.00037755206,0.00004724451,0.000023252112,0.0001889393,0.000045781213,0.9622251,0.008044477,0.009314843,0.00040322432,0.019227648],"study_design_scores_gemma":[0.000015542886,0.000068484245,0.00014418308,0.000004937825,0.000009704409,0.00005048691,0.00004584548,0.98664373,0.002596911,0.009905514,0.00050666946,0.0000080097625],"about_ca_topic_score_codex":0.0008015258,"about_ca_topic_score_gemma":0.0009856396,"teacher_disagreement_score":0.000975015,"about_ca_system_score_codex":0.0005720047,"about_ca_system_score_gemma":0.00034454215,"threshold_uncertainty_score":0.005156398},"labels":[],"label_agreement":null},{"id":"W2151901300","doi":"10.1109/glocom.2005.1578453","title":"Frequency domain channel estimation for SC-FDE in UWB communications","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Ultra-Wideband Communications Technology","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 Victoria","funders":"","keywords":"SC-FDE; Estimator; Channel (broadcasting); Frequency domain; Computer science; Transmission (telecommunications); Ultra-wideband; Equalization (audio); Algorithm; Upper and lower bounds; Minimum mean square error; Mean squared error; Electronic engineering; Telecommunications; Mathematics; Engineering; Statistics","score_opus":0.02502145290885426,"score_gpt":0.27721386344895327,"score_spread":0.252192410540099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151901300","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.014997174,0.00052967056,0.9832533,0.00016761274,0.00003364175,0.000011487103,0.000023169183,0.00015541821,0.0008284284],"genre_scores_gemma":[0.5873257,0.0018442742,0.40777016,0.0001575156,0.0001443809,0.00009502482,0.00018246027,0.000044462886,0.002436113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996112,0.00014888238,0.00001559876,0.000046014276,0.00015006067,0.000028284952],"domain_scores_gemma":[0.9983125,0.0011703068,0.00011403639,0.00015385161,0.00023184333,0.000017535878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007570765,0.00034652423,0.0004953605,0.00030365612,0.00031559332,0.00053948374,0.00025501614,0.00056243216,0.001253375],"category_scores_gemma":[0.004823684,0.00024441452,0.00016844961,0.00036897775,0.00052163255,0.00062860636,0.00042942743,0.00065069966,0.00030701834],"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.000278207,0.000060495768,0.0011598837,0.000250897,0.000055806777,0.00018807291,0.00010004017,0.6791832,0.047518026,0.035038948,0.0029944123,0.233172],"study_design_scores_gemma":[0.000012828955,0.000048433332,0.00038647393,0.000019915573,0.000009720314,0.00010167376,0.000014238287,0.9830981,0.009231141,0.005463239,0.001599951,0.000014272845],"about_ca_topic_score_codex":0.0010586366,"about_ca_topic_score_gemma":0.0016205057,"teacher_disagreement_score":0.001253375,"about_ca_system_score_codex":0.00036323775,"about_ca_system_score_gemma":0.00089100277,"threshold_uncertainty_score":0.0041929483},"labels":[],"label_agreement":null},{"id":"W2152413159","doi":"10.1109/glocom.2005.1578286","title":"AQuA: aggregated queueing algorithm for CDMA2000 base station controll","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","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":"Carleton University","funders":"","keywords":"Computer science; Computer network; Queueing theory; Base station; Network packet; Queue; Channel (broadcasting); CDMA2000; Buffer (optical fiber); Buffer overflow; Algorithm; Distributed computing; Telecommunications","score_opus":0.01595413676409905,"score_gpt":0.2582083014631412,"score_spread":0.24225416469904218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152413159","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.010849874,0.00014584485,0.98480886,0.00014315045,0.00006659787,0.00008137369,0.00008594792,0.0022835282,0.0015348183],"genre_scores_gemma":[0.32809174,0.00013915497,0.66768706,0.00018552112,0.00005439989,0.00029414488,0.0003222251,0.0001560154,0.003069704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995148,0.00015117387,0.000032793938,0.0000781301,0.00015566383,0.0000674509],"domain_scores_gemma":[0.9992685,0.00031994397,0.00005666628,0.00008168977,0.0002229081,0.000050367024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011746286,0.00047264848,0.000577612,0.0006218437,0.0006189051,0.0010269373,0.0016715084,0.000666845,0.0040130634],"category_scores_gemma":[0.0034714083,0.00024312458,0.00028179752,0.00054645695,0.0003287544,0.0008427154,0.0009941775,0.0008292461,0.0008171705],"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.000539726,0.00018090828,0.0018388872,0.00010177293,0.000056523753,0.00008474586,0.00015841158,0.5467453,0.006212824,0.04156449,0.011559907,0.39095652],"study_design_scores_gemma":[0.00001650616,0.000019200068,0.000044687327,0.0000022230397,0.0000025282134,0.000010331508,0.0000045929155,0.9953218,0.00044846858,0.0032986342,0.00082848605,0.0000025434056],"about_ca_topic_score_codex":0.0046480983,"about_ca_topic_score_gemma":0.0036433185,"teacher_disagreement_score":0.0046480983,"about_ca_system_score_codex":0.0010311853,"about_ca_system_score_gemma":0.0013550081,"threshold_uncertainty_score":0.013425052},"labels":[],"label_agreement":null},{"id":"W2154024803","doi":"10.1109/glocom.2005.1577941","title":"A self-encryption authentication protocol with identity anonymity for teleconference services","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Authentication Protocols Security","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 Waterloo","funders":"","keywords":"Pseudonym; Anonymity; Computer science; Authentication (law); Computer security; Identity (music); Computer network; Encryption; Protocol (science); Teleconference; Telecommunications; Political science","score_opus":0.022186160536754474,"score_gpt":0.32093571071423344,"score_spread":0.29874955017747895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154024803","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.02017915,0.0009528052,0.9703361,0.0005073369,0.00038277358,0.0003011376,0.000079725745,0.000818938,0.006442119],"genre_scores_gemma":[0.60321146,0.0015946286,0.3773001,0.0005037259,0.00041411933,0.0008519845,0.0003739163,0.0001278691,0.015622167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984273,0.0003920652,0.00021567813,0.0001736414,0.00062182185,0.00016959247],"domain_scores_gemma":[0.99885535,0.00022331373,0.0001790718,0.00029210275,0.0003812533,0.00006893063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011750148,0.0005395691,0.0006924424,0.0006984264,0.0012945037,0.0013421195,0.0014539632,0.0013479245,0.0018830406],"category_scores_gemma":[0.0016136534,0.00033300815,0.0008381639,0.000861203,0.00092532276,0.004034225,0.0020183877,0.0016435729,0.0010280546],"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.0005475759,0.00037513615,0.0012291612,0.0010715935,0.00017359947,0.0026897346,0.00085218996,0.01437904,0.15628095,0.59659356,0.013239761,0.21256763],"study_design_scores_gemma":[0.0003664184,0.0012493704,0.0016347051,0.00017978642,0.00042716524,0.010962677,0.00040131426,0.5028121,0.15770788,0.13028751,0.19363005,0.00034111826],"about_ca_topic_score_codex":0.00022475683,"about_ca_topic_score_gemma":0.0002409666,"teacher_disagreement_score":0.0018830406,"about_ca_system_score_codex":0.0004922729,"about_ca_system_score_gemma":0.0009613484,"threshold_uncertainty_score":0.0062993765},"labels":[],"label_agreement":null},{"id":"W2154176545","doi":"10.1109/glocom.2005.1577909","title":"Error rate analysis of asynchronous multicode DS-CDMA systems","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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 Alberta","funders":"","keywords":"Code division multiple access; Computer science; Algorithm; Spread spectrum; Code (set theory); Additive white Gaussian noise; Gaussian; Bit error rate; Asynchronous communication; Selection (genetic algorithm); Channel (broadcasting); Decoding methods; Set (abstract data type); Telecommunications; Artificial intelligence","score_opus":0.04671585368808951,"score_gpt":0.32556867202592177,"score_spread":0.27885281833783226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154176545","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.0143843135,0.0008885664,0.98179126,0.00007928139,0.000038467042,0.000025979914,0.00006405425,0.00013411434,0.0025941033],"genre_scores_gemma":[0.8288916,0.0034406516,0.15920967,0.00013983215,0.00024440594,0.00022143817,0.00028021785,0.00020385586,0.007368363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702495,0.00072544813,0.00013308066,0.00030477517,0.0016149938,0.0001967223],"domain_scores_gemma":[0.99384016,0.0037342415,0.00050354504,0.0006300367,0.0012217092,0.00007041354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002553169,0.0011444886,0.00084013777,0.0013370706,0.0003698734,0.0012311261,0.00091807987,0.0006997338,0.0011696885],"category_scores_gemma":[0.011307824,0.00043947686,0.00046227957,0.00095055526,0.0009639303,0.00172291,0.0010858063,0.0012554642,0.00059737725],"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.000114470684,0.000023694085,0.00070788054,0.00017236227,0.00005302238,0.00015705921,0.00020784991,0.79923415,0.020111559,0.14637241,0.0006408385,0.032204725],"study_design_scores_gemma":[0.0000051728534,0.000024941122,0.00030171467,0.000018684617,0.000009614981,0.00007747321,0.000011972748,0.98145616,0.0037586275,0.013585696,0.00072986237,0.000019996425],"about_ca_topic_score_codex":0.0011789786,"about_ca_topic_score_gemma":0.0005525163,"teacher_disagreement_score":0.002553169,"about_ca_system_score_codex":0.0009475545,"about_ca_system_score_gemma":0.0005388529,"threshold_uncertainty_score":0.013502598},"labels":[],"label_agreement":null},{"id":"W2154215137","doi":"10.1109/glocom.2005.1578454","title":"A TDMA scheme for SC-FDE UWB communications","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Ultra-Wideband Communications Technology","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 Victoria","funders":"","keywords":"Time division multiple access; Computer science; Code division multiple access; Transmission (telecommunications); Computer network; Transmitter; Interference (communication); Electronic engineering; Block (permutation group theory); Channel (broadcasting); Telecommunications; Engineering","score_opus":0.0319879514881362,"score_gpt":0.28384693191165256,"score_spread":0.25185898042351634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154215137","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.016826589,0.0021398547,0.967368,0.0003958529,0.0005386167,0.00022666458,0.00008008648,0.00063191,0.011792435],"genre_scores_gemma":[0.42415476,0.001835904,0.5585893,0.00040468966,0.0003475304,0.00037787258,0.0001567309,0.000039583545,0.014093679],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000028859447,0.000010904905,0.000031292475,0.00006889031,0.000017863855],"domain_scores_gemma":[0.99981433,0.000034147233,0.000020681266,0.00004705156,0.00006991832,0.0000137609095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018652876,0.00032766518,0.00023050143,0.0004285862,0.0005091531,0.00044640046,0.000613628,0.0005483927,0.0029151705],"category_scores_gemma":[0.0005093329,0.00014681842,0.00022023123,0.0003993488,0.0004120894,0.0005148869,0.0003580748,0.00073728064,0.0010935679],"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.0002594044,0.00013884042,0.0007079724,0.0005435947,0.000057418027,0.00047563892,0.00027443544,0.018955577,0.32552114,0.20287247,0.0068078646,0.44338554],"study_design_scores_gemma":[0.00027145512,0.0011991264,0.0012287517,0.00015519172,0.00013854948,0.004845875,0.00012571034,0.51707774,0.15859582,0.041549034,0.27466893,0.00014390345],"about_ca_topic_score_codex":0.00035462005,"about_ca_topic_score_gemma":0.00054113485,"teacher_disagreement_score":0.0029151705,"about_ca_system_score_codex":0.00031609347,"about_ca_system_score_gemma":0.00044310399,"threshold_uncertainty_score":0.009752214},"labels":[],"label_agreement":null},{"id":"W2154484410","doi":"10.1109/glocom.2005.1577759","title":"End-to-end delay satisfaction balancing routing","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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":"McGill University","funders":"","keywords":"Computer science; Network delay; Routing (electronic design automation); Static routing; Load balancing (electrical power); Equal-cost multi-path routing; Destination-Sequenced Distance Vector routing; End-to-end delay; Computation; Mathematical optimization; Distributed computing; Link-state routing protocol; Computer network; Algorithm; Routing protocol; Mathematics","score_opus":0.032755521751906914,"score_gpt":0.30709026169046066,"score_spread":0.27433473993855373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154484410","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.014124337,0.00015992322,0.98164016,0.000105123036,0.000049053477,0.000030525025,0.000031146137,0.00040488076,0.0034548305],"genre_scores_gemma":[0.64643604,0.000463947,0.34430593,0.00018686273,0.00012946465,0.00007974003,0.0003589573,0.0001458712,0.007893145],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948055,0.00010887493,0.000030213558,0.00008361498,0.00023382134,0.000062945786],"domain_scores_gemma":[0.99932945,0.00021177884,0.000077576784,0.00011162813,0.0002360289,0.000033592332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070658134,0.0005957965,0.00041295102,0.00040632184,0.0005140964,0.0010105242,0.0013809011,0.0004742149,0.0016765911],"category_scores_gemma":[0.001337189,0.00014686868,0.00020888369,0.00043688086,0.00028464792,0.0010359639,0.00070640893,0.0006445573,0.0006225351],"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.00037721533,0.0002296692,0.0012970754,0.00011941746,0.000043807682,0.00007378196,0.00012411234,0.44052124,0.051756855,0.044102523,0.004892685,0.45646158],"study_design_scores_gemma":[0.000011140321,0.000063798405,0.00021346947,0.000005268848,0.000007630184,0.00006965743,0.00002356733,0.97199553,0.014543811,0.008055642,0.004998379,0.000012062894],"about_ca_topic_score_codex":0.00071447867,"about_ca_topic_score_gemma":0.0009346112,"teacher_disagreement_score":0.0016765911,"about_ca_system_score_codex":0.0007284259,"about_ca_system_score_gemma":0.00051279797,"threshold_uncertainty_score":0.0056087375},"labels":[],"label_agreement":null},{"id":"W2155291150","doi":"10.1109/glocom.2005.1578291","title":"WWW browsing performance within a mixed speech environment of future cellular networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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":"McGill University","funders":"","keywords":"Computer science; Throughput; Download; Computer network; World Wide Web; Telecommunications; Wireless","score_opus":0.023815535092307494,"score_gpt":0.2553289807543403,"score_spread":0.2315134456620328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155291150","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.9809616,0.00021239225,0.016976057,0.000051658833,0.000004200688,0.000005783504,0.0000364055,0.00012913026,0.0016226519],"genre_scores_gemma":[0.9988883,0.000041618096,0.0009039629,0.0000075991215,0.000003888224,0.0000028309723,0.00002208959,0.0000075721377,0.00012201061],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993199,0.00021353003,0.000026198435,0.00006780429,0.00019409081,0.00017845373],"domain_scores_gemma":[0.9963142,0.0022360815,0.0003303903,0.0002691159,0.0006531019,0.00019703592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009214169,0.00042509363,0.0004699722,0.00041763892,0.00061462633,0.0011747209,0.0003525769,0.0007970048,0.0005323262],"category_scores_gemma":[0.004322617,0.0001860513,0.00015381328,0.00058806204,0.0005530495,0.0012382782,0.0005277897,0.00050203776,0.00018525754],"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.0044609495,0.00035970155,0.06355347,0.0002709487,0.00022033832,0.003293187,0.0010420516,0.6868352,0.149326,0.008831712,0.0013683956,0.08043793],"study_design_scores_gemma":[0.000030971158,0.00060969783,0.022055706,0.000015066797,0.00010131487,0.0012438878,0.0004462976,0.9489765,0.023011446,0.002846218,0.0006137453,0.000049104234],"about_ca_topic_score_codex":0.00298287,"about_ca_topic_score_gemma":0.0025221151,"teacher_disagreement_score":0.00298287,"about_ca_system_score_codex":0.0006688661,"about_ca_system_score_gemma":0.00031226224,"threshold_uncertainty_score":0.00593102},"labels":[],"label_agreement":null},{"id":"W2158685876","doi":"10.1109/glocom.2005.1578267","title":"Delay limited optimal and suboptimal power and bit loading algorithms for OFDM systems over correlated fading channels","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"University of British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Fading; Markov decision process; Computer science; Algorithm; Dynamic programming; Transmitter power output; Mathematical optimization; Transmission (telecommunications); Power (physics); Markov process; Mathematics; Telecommunications; Channel (broadcasting); Transmitter; Decoding methods","score_opus":0.019591539596354585,"score_gpt":0.2583814134103958,"score_spread":0.23878987381404118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158685876","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.04425778,0.0004649658,0.95180666,0.00031199784,0.000027051072,0.000048778285,0.00003199782,0.00024552434,0.002805269],"genre_scores_gemma":[0.7930931,0.0004670058,0.20346488,0.00017223034,0.000047063288,0.0001646827,0.000060578295,0.00009127103,0.0024392526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991627,0.00035995326,0.000043219876,0.0000960788,0.000165886,0.00017213212],"domain_scores_gemma":[0.99597836,0.0031888522,0.00034576078,0.00013931362,0.00025005863,0.00009763416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00175548,0.0010907722,0.0010082124,0.00060064223,0.00060145574,0.0011631503,0.00073484244,0.0010619563,0.0015140927],"category_scores_gemma":[0.007080524,0.00064467586,0.0003321239,0.0007597078,0.001624663,0.0014958063,0.0012833758,0.0010415928,0.0003557561],"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.000098671604,0.00003817369,0.00027866516,0.000034566077,0.00001422039,0.000029988683,0.000074352145,0.9623307,0.0010437381,0.012911468,0.00046907467,0.022676464],"study_design_scores_gemma":[0.000015251431,0.000018558094,0.000047539677,0.0000035551875,0.0000033829274,0.000008218017,0.000010437435,0.9945914,0.0003348704,0.004883652,0.000079015284,0.0000040756267],"about_ca_topic_score_codex":0.003812871,"about_ca_topic_score_gemma":0.003250941,"teacher_disagreement_score":0.003812871,"about_ca_system_score_codex":0.0014217604,"about_ca_system_score_gemma":0.0021235298,"threshold_uncertainty_score":0.010315657},"labels":[],"label_agreement":null},{"id":"W2159441471","doi":"10.1109/glocom.2005.1578246","title":"Receiver windowing for reduction of ICI in OFDM systems with carrier frequency offset","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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 Alberta","funders":"","keywords":"Orthogonal frequency-division multiplexing; Carrier frequency offset; Frequency offset; Computer science; Window (computing); Offset (computer science); Bit error rate; Interference (communication); Window function; Trigonometric functions; Electronic engineering; Reduction (mathematics); Nyquist–Shannon sampling theorem; Nyquist rate; Telecommunications; Mathematics; Engineering; Decoding methods; Spectral density; Channel (broadcasting); Sampling (signal processing)","score_opus":0.02189349121280954,"score_gpt":0.2704374566852393,"score_spread":0.24854396547242974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159441471","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.17097102,0.0024666057,0.82179046,0.00012861015,0.000113631264,0.00006729631,0.0000781044,0.0016488022,0.0027354439],"genre_scores_gemma":[0.6975015,0.0021344437,0.29706267,0.000062566556,0.00018159776,0.00005667742,0.00021551247,0.00022769015,0.0025573708],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998273,0.00003640153,0.000012765131,0.000026328637,0.00006970844,0.000027544036],"domain_scores_gemma":[0.9996654,0.00018548404,0.000038930546,0.00003690365,0.000060927854,0.000012401924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043724666,0.0004190996,0.00042986384,0.00027432284,0.00023757141,0.00046508983,0.00030385482,0.00024602775,0.0016312243],"category_scores_gemma":[0.0015523237,0.0001752673,0.00020582364,0.00040754245,0.00016523646,0.0005830353,0.00025558475,0.0004941085,0.0003961543],"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.0013097464,0.00010115161,0.00075563154,0.00029007325,0.000069904556,0.00031099474,0.00022473763,0.030567857,0.57393616,0.007203915,0.0012302974,0.38399947],"study_design_scores_gemma":[0.00012890005,0.001328324,0.0033965432,0.00007229734,0.00024869034,0.00091811334,0.00007080898,0.4129535,0.5671233,0.0021980226,0.011501222,0.000060248243],"about_ca_topic_score_codex":0.0004134923,"about_ca_topic_score_gemma":0.000561081,"teacher_disagreement_score":0.0016312243,"about_ca_system_score_codex":0.0001666013,"about_ca_system_score_gemma":0.00031322442,"threshold_uncertainty_score":0.005456984},"labels":[],"label_agreement":null},{"id":"W2161013972","doi":"10.1109/glocom.2005.1578314","title":"Block differential space-time modulation with decision-feedback detection in Rayleigh fading","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Fading; Computer science; Differential (mechanical device); Rayleigh fading; Modulation (music); Bandwidth (computing); Control theory (sociology); Electronic engineering; Signal-to-noise ratio (imaging); Fading distribution; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Physics; Engineering; Artificial intelligence; Acoustics","score_opus":0.011373042695698674,"score_gpt":0.24593086467072733,"score_spread":0.23455782197502867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161013972","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.19318639,0.0016642036,0.79933155,0.0002688254,0.00014724965,0.000092655115,0.00006946924,0.00031754465,0.004922181],"genre_scores_gemma":[0.9461282,0.00046043735,0.052230027,0.000059211015,0.000055060933,0.000036523616,0.000036396494,0.000008706697,0.0009855072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912304,0.0003314064,0.00004084359,0.000081968465,0.0003036166,0.00011913882],"domain_scores_gemma":[0.9988502,0.00061592326,0.00014066255,0.00016010301,0.00020211934,0.00003099686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091492874,0.0004543848,0.0004830979,0.00033771645,0.00034651515,0.00050086196,0.0007223368,0.0005489772,0.00074064115],"category_scores_gemma":[0.0026996417,0.00022411573,0.00016805848,0.00066035555,0.00048329085,0.0010177351,0.00067515817,0.00033221385,0.00027377647],"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.0022732196,0.00023531425,0.005271091,0.00063078455,0.0001646108,0.00093369785,0.00053188985,0.3483481,0.21906254,0.06328391,0.0029863573,0.35627848],"study_design_scores_gemma":[0.000059847483,0.00049358106,0.0008404103,0.000028932709,0.000037653586,0.00049297744,0.00002862925,0.96328497,0.025668535,0.0067695803,0.002267451,0.000027395941],"about_ca_topic_score_codex":0.00085355266,"about_ca_topic_score_gemma":0.0012699164,"teacher_disagreement_score":0.00091492874,"about_ca_system_score_codex":0.0004425702,"about_ca_system_score_gemma":0.00041376808,"threshold_uncertainty_score":0.004838705},"labels":[],"label_agreement":null},{"id":"W2161700532","doi":"10.1109/glocom.2005.1578341","title":"Fano space-time multiple symbol differential detectors","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"Simon Fraser University","funders":"","keywords":"Fano plane; Detector; Algorithm; Channel (broadcasting); Fading; Computer science; Decoding methods; Telecommunications; Mathematics","score_opus":0.013894511814536117,"score_gpt":0.24828137456765353,"score_spread":0.23438686275311743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161700532","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.021931367,0.0014246986,0.969341,0.00025332326,0.00019959544,0.000051155013,0.000078440935,0.00044227508,0.006278116],"genre_scores_gemma":[0.56825924,0.0010280657,0.42155582,0.00045251654,0.0001818332,0.00007564208,0.00017652627,0.0000478206,0.008222522],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999311,0.00017074155,0.000033296332,0.000118385215,0.00028501643,0.00008146948],"domain_scores_gemma":[0.99927455,0.00027432744,0.000079739635,0.00013926468,0.00019404442,0.00003816642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008711,0.000697121,0.00050304015,0.00078420027,0.0004997615,0.00087454816,0.0006394321,0.00084860425,0.0016211956],"category_scores_gemma":[0.001989313,0.00018927566,0.00028352768,0.0006622132,0.00068090664,0.001114785,0.0005737574,0.0006880787,0.0006006394],"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.0008958435,0.00013035956,0.0065048104,0.00036160985,0.00012464801,0.0006559174,0.0002531698,0.09581588,0.09593193,0.25853008,0.0080870185,0.5327087],"study_design_scores_gemma":[0.000055511147,0.0005021506,0.0012437863,0.00005869876,0.00007751208,0.0021484818,0.000036260713,0.79189974,0.111849084,0.03681443,0.055199355,0.00011498996],"about_ca_topic_score_codex":0.00046694043,"about_ca_topic_score_gemma":0.0009395217,"teacher_disagreement_score":0.0016211956,"about_ca_system_score_codex":0.00060071156,"about_ca_system_score_gemma":0.0005010752,"threshold_uncertainty_score":0.0054234266},"labels":[],"label_agreement":null},{"id":"W2162541252","doi":"10.1109/glocom.2005.1577845","title":"BER analysis of BPSK signaling in Ricean-faded cochannel interference","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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":"University of Alberta","funders":"","keywords":"Phase-shift keying; Bit error rate; Interference (communication); Fading; Computer science; SIGNAL (programming language); Saddle point; Algorithm; Demodulation; Word error rate; Adjacent-channel interference; Mathematics; Channel (broadcasting); Telecommunications; Electronic engineering; Speech recognition; Engineering","score_opus":0.02552327861550993,"score_gpt":0.2866920819322841,"score_spread":0.26116880331677417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162541252","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.257954,0.0023320601,0.7212247,0.0006016568,0.00008507208,0.000033963388,0.00015220827,0.0008349601,0.01678132],"genre_scores_gemma":[0.98470646,0.00070482393,0.012096274,0.000057739468,0.000027050617,0.000021966718,0.00005501857,0.000053877597,0.0022767938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.00028581804,0.000023137167,0.000068113346,0.0004135314,0.00010532773],"domain_scores_gemma":[0.9974783,0.0016650792,0.00019882031,0.00014510813,0.0004736882,0.000039016868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013356787,0.0008543375,0.0007946721,0.0007279325,0.00040427988,0.000737352,0.0006138924,0.0009837112,0.0013084984],"category_scores_gemma":[0.0050065583,0.00031155124,0.00041930602,0.0008064439,0.0012631268,0.0007239566,0.00056711055,0.00066381245,0.00043697332],"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.0002193036,0.000021243992,0.0010214172,0.00014033329,0.00004140122,0.00030658682,0.00025131894,0.9246717,0.015602346,0.044320956,0.0006184739,0.012784945],"study_design_scores_gemma":[0.0000035201722,0.000027970711,0.0005059037,0.000013609533,0.000007857769,0.000089179695,0.00002124096,0.99190724,0.0017525298,0.0054822736,0.00017534476,0.000013378529],"about_ca_topic_score_codex":0.0026406907,"about_ca_topic_score_gemma":0.0010272401,"teacher_disagreement_score":0.0026406907,"about_ca_system_score_codex":0.0014161431,"about_ca_system_score_gemma":0.0006034698,"threshold_uncertainty_score":0.010274887},"labels":[],"label_agreement":null},{"id":"W2162726981","doi":"10.1109/glocom.2005.1577863","title":"A new intuitive result for the BEP of a jointly optimal single cochannel interferer BPSK receiver","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Wireless Communication Networks Research","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 Alberta","funders":"","keywords":"Phase-shift keying; Additive white Gaussian noise; Interference (communication); Binary number; Computer science; Algorithm; Keying; Bit error rate; Channel (broadcasting); Expression (computer science); Mathematics; Electronic engineering; Telecommunications; Decoding methods; Engineering; Arithmetic","score_opus":0.05865821781180097,"score_gpt":0.31568331253833115,"score_spread":0.2570250947265302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162726981","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.0027257835,0.00065604266,0.9908468,0.00034559582,0.00010274425,0.000018372728,0.0000521593,0.000085975895,0.0051665376],"genre_scores_gemma":[0.431391,0.005822255,0.53893405,0.0015784843,0.0014799279,0.00043931924,0.00036294392,0.0006075211,0.019384535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745816,0.00060557097,0.00013404457,0.0004444343,0.0011592876,0.00019846394],"domain_scores_gemma":[0.9966898,0.0021536865,0.00023870268,0.00023153934,0.0006055525,0.000080693906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026577243,0.0019989212,0.0011760253,0.00082306645,0.0004285237,0.002489924,0.0015591022,0.0017531961,0.004443865],"category_scores_gemma":[0.010113194,0.0006889451,0.00069532386,0.00082682667,0.0024882986,0.003963219,0.0016926667,0.002578882,0.0017018133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00011368961,0.000058884947,0.0005865641,0.00044630043,0.00009083942,0.00044486456,0.00027023524,0.23019043,0.01859853,0.69544417,0.0062580868,0.047497474],"study_design_scores_gemma":[0.00003375034,0.00016119776,0.0006231054,0.00013958343,0.0000676781,0.0014656503,0.00007026719,0.62920356,0.008402131,0.34867612,0.011068363,0.000088648165],"about_ca_topic_score_codex":0.0003772421,"about_ca_topic_score_gemma":0.0003802097,"teacher_disagreement_score":0.004443865,"about_ca_system_score_codex":0.0011349163,"about_ca_system_score_gemma":0.0008599345,"threshold_uncertainty_score":0.014866173},"labels":[],"label_agreement":null},{"id":"W2164574966","doi":"10.1109/glocom.2005.1577849","title":"Exact evaluation of BER for arbitrary modulation and signaling in AWGN channel","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Communication Techniques","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Modulation (music); Computer science; Additive white Gaussian noise; Symbol (formal); Bounding overwatch; Transmission (telecommunications); Constellation; Channel (broadcasting); Algorithm; Bit error rate; Quadrature amplitude modulation; Theoretical computer science; Electronic engineering; Telecommunications; Artificial intelligence; Engineering","score_opus":0.04667697124037834,"score_gpt":0.3138617831009122,"score_spread":0.26718481186053383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164574966","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.059897516,0.0009067084,0.9297942,0.00019148565,0.0000342119,0.000020166779,0.000054348206,0.0002841582,0.0088171605],"genre_scores_gemma":[0.8704568,0.0009694994,0.12507965,0.00007576837,0.000028779277,0.000045489098,0.00007368823,0.000111691064,0.003158607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999054,0.0003847061,0.000031086765,0.000050331295,0.00040406885,0.000075756376],"domain_scores_gemma":[0.99758315,0.001851587,0.00015338408,0.00020042961,0.00018175384,0.000029734234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017004004,0.00052202726,0.0006890328,0.00039507396,0.00020399062,0.0007192416,0.00046705946,0.0008464351,0.0012210278],"category_scores_gemma":[0.007962037,0.00022711394,0.0002260086,0.00043844178,0.0010472419,0.0014027628,0.000828046,0.00061157224,0.00033625404],"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.000059964445,0.0000125000415,0.00028924787,0.00008994941,0.000008812828,0.000092760914,0.000072756055,0.929095,0.0046213567,0.048562765,0.000299286,0.016795592],"study_design_scores_gemma":[0.0000037622694,0.000012352948,0.000092713395,0.000009790559,0.0000017618644,0.000036482124,0.00000843352,0.9864362,0.001277155,0.011944645,0.00017133032,0.0000053228823],"about_ca_topic_score_codex":0.0012177316,"about_ca_topic_score_gemma":0.0012523356,"teacher_disagreement_score":0.0017004004,"about_ca_system_score_codex":0.0006808206,"about_ca_system_score_gemma":0.00053106,"threshold_uncertainty_score":0.008992672},"labels":[],"label_agreement":null},{"id":"W2164638100","doi":"10.1109/glocom.2005.1577871","title":"Performance of the successive coding strategy in the CEO problem","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Concordia University","funders":"","keywords":"Wireless sensor network; Distortion (music); Rate distortion; Gaussian; Coding (social sciences); Upper and lower bounds; Rate–distortion theory; Computer science; Algorithm; Mathematics; Mathematical optimization; Statistics; Telecommunications; Computer network; Physics","score_opus":0.023425082978525965,"score_gpt":0.2628776841207789,"score_spread":0.23945260114225292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164638100","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.37246063,0.003018993,0.58879477,0.0029529207,0.00020928514,0.00022597384,0.00039484532,0.00056960766,0.031372964],"genre_scores_gemma":[0.9700814,0.0007820104,0.026225774,0.00023980702,0.000071842274,0.000082323524,0.00020344491,0.000067034525,0.002246384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764425,0.0011216028,0.000065173386,0.00024587548,0.0004191609,0.0005040031],"domain_scores_gemma":[0.9827617,0.014143043,0.0008667924,0.00062777183,0.0009427562,0.00065795664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004828281,0.0014890161,0.0017848545,0.00081005995,0.00065138744,0.0017720973,0.001420671,0.0017518387,0.0027449527],"category_scores_gemma":[0.020776019,0.00038055924,0.0006479902,0.000896481,0.0020749369,0.0027198843,0.0025282563,0.0014533203,0.00036534213],"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.001072691,0.00015426459,0.0010514344,0.00022466523,0.00007365867,0.00018208631,0.00014528127,0.89737177,0.003394127,0.06815722,0.002521702,0.025651058],"study_design_scores_gemma":[0.00010007554,0.00020201918,0.00021471693,0.000019890205,0.000015074143,0.00008772715,0.000061394465,0.9772562,0.0015620237,0.020157969,0.00030325458,0.000019571493],"about_ca_topic_score_codex":0.004578239,"about_ca_topic_score_gemma":0.0019447625,"teacher_disagreement_score":0.004828281,"about_ca_system_score_codex":0.0016874501,"about_ca_system_score_gemma":0.0031055287,"threshold_uncertainty_score":0.02553469},"labels":[],"label_agreement":null},{"id":"W2164938435","doi":"10.1109/glocom.2005.1577874","title":"Joint source-channel decoding of convolutionally encoded multiple-descriptions","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Data Compression Techniques","field":"Computer Science","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 Manitoba","funders":"","keywords":"Convolutional code; Computer science; Decoding methods; Viterbi decoder; Viterbi algorithm; Algorithm; Sequential decoding; Turbo code; Binary erasure channel; Soft output Viterbi algorithm; Channel (broadcasting); Serial concatenated convolutional codes; Theoretical computer science; Concatenated error correction code; Telecommunications; Channel capacity; Block code","score_opus":0.05186381459234656,"score_gpt":0.29160493794875897,"score_spread":0.2397411233564124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164938435","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.060639054,0.0003289434,0.9360143,0.00018729702,0.000036624893,0.000061817445,0.00014237192,0.00040615583,0.002183417],"genre_scores_gemma":[0.842872,0.00021832928,0.15264681,0.00007212525,0.000020705202,0.00006102515,0.00024849622,0.00005462351,0.0038058609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987118,0.00046194272,0.00007224319,0.00012581723,0.00044343414,0.00018466107],"domain_scores_gemma":[0.99668556,0.0021267731,0.00027306954,0.00040719417,0.0004327938,0.00007454264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019854202,0.00066234986,0.00082093437,0.00046713607,0.00037773172,0.0009446137,0.00094329653,0.00096545095,0.0010809406],"category_scores_gemma":[0.0056210305,0.00041881364,0.00040786035,0.00074324483,0.00069934217,0.0014730309,0.0013148229,0.00096872135,0.00034933584],"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.000412655,0.00006558024,0.00095502316,0.000119832606,0.00006176301,0.00037391274,0.00015902835,0.8520412,0.010848738,0.070246115,0.0009133324,0.0638028],"study_design_scores_gemma":[0.000014974862,0.00003156458,0.000056749475,0.000007990188,0.0000060026887,0.000060497132,0.000011402393,0.9799468,0.010348276,0.009127393,0.000376861,0.000011530324],"about_ca_topic_score_codex":0.0035035936,"about_ca_topic_score_gemma":0.0038334557,"teacher_disagreement_score":0.0035035936,"about_ca_system_score_codex":0.0011000783,"about_ca_system_score_gemma":0.0018259472,"threshold_uncertainty_score":0.010500014},"labels":[],"label_agreement":null},{"id":"W2167641880","doi":"10.1109/glocom.2005.1578302","title":"LPT for data aggregation in wireless sensor networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Energy Efficient Wireless Sensor Networks","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":"Wireless sensor network; Data aggregator; Computer science; Sink (geography); Computer network; Distributed computing; Tree (set theory); Overlay; Routing protocol; Routing (electronic design automation)","score_opus":0.045904024691659724,"score_gpt":0.29745970099147556,"score_spread":0.25155567629981584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167641880","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.0015662423,0.0009341028,0.995479,0.00024968118,0.0001416027,0.000056564717,0.00002363793,0.000421946,0.0011271789],"genre_scores_gemma":[0.16004814,0.0028777297,0.83020073,0.00054131023,0.00046606996,0.0006209136,0.000263164,0.00025120337,0.004730728],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.0003861035,0.000106266605,0.00018240204,0.00048357435,0.00005443912],"domain_scores_gemma":[0.99868387,0.0006956461,0.00013822969,0.00024102489,0.00020425906,0.000036885493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019713475,0.000692951,0.0008066615,0.00067678874,0.0007296917,0.0010189838,0.001191684,0.00095456705,0.0018670042],"category_scores_gemma":[0.0054690987,0.00028722736,0.0006766449,0.0017148538,0.0007842126,0.0019984276,0.001351034,0.0015113177,0.0010283985],"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.00026844535,0.000082168524,0.0008805309,0.0005882019,0.000111855596,0.0004030438,0.0003210368,0.24169476,0.01266261,0.13410975,0.012975046,0.59590256],"study_design_scores_gemma":[0.000027644828,0.0001293573,0.0001571871,0.000047987156,0.000028953666,0.0002843751,0.000037205187,0.90079224,0.004355861,0.07262405,0.021496894,0.000018157278],"about_ca_topic_score_codex":0.00077114406,"about_ca_topic_score_gemma":0.0006873659,"teacher_disagreement_score":0.0019713475,"about_ca_system_score_codex":0.0006994905,"about_ca_system_score_gemma":0.00069242716,"threshold_uncertainty_score":0.010425627},"labels":[],"label_agreement":null},{"id":"W2168744335","doi":"10.1109/glocom.2005.1577693","title":"An analytical model for fair rate calculation in resilient packet rings","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Power Line Communications and Noise","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":"Carleton University","funders":"","keywords":"Computer science; Network packet; Node (physics); Convergence (economics); Reuse; Upstream (networking); Filter (signal processing); Computer network; Rate of convergence; Network congestion; Fairness measure; Channel (broadcasting); Throughput; Wireless; Telecommunications","score_opus":0.039066585925264845,"score_gpt":0.3138723955503759,"score_spread":0.27480580962511103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168744335","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.008158042,0.00023723273,0.9855853,0.00024789968,0.000048788883,0.000060124603,0.000042154777,0.00020137386,0.0054190774],"genre_scores_gemma":[0.7782775,0.0011140041,0.19755585,0.00034056854,0.00016044869,0.0004622024,0.00012293081,0.00024033796,0.02172627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913377,0.0002266834,0.000031358282,0.0001455848,0.00032273255,0.00013990821],"domain_scores_gemma":[0.99830675,0.00096697244,0.00018359373,0.00012051491,0.0003768617,0.000045256624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018000681,0.00068906037,0.0008376457,0.00088963105,0.0008912763,0.0014475954,0.0025028929,0.0017059359,0.003223074],"category_scores_gemma":[0.0063637844,0.0005826303,0.00076378195,0.00074008835,0.0013123233,0.0024305752,0.00068972,0.0014142253,0.0011088838],"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.00003818675,0.000027001923,0.00018390923,0.000041538304,0.000011061156,0.00011394697,0.00013890168,0.8660829,0.0031224343,0.12314291,0.00077584496,0.00632135],"study_design_scores_gemma":[0.0000031547565,0.0000060363755,0.000016319942,0.0000030835668,0.0000023013172,0.000017064149,0.0000040551977,0.9941474,0.00024223677,0.005116563,0.00043738744,0.000004372325],"about_ca_topic_score_codex":0.0048507676,"about_ca_topic_score_gemma":0.002053976,"teacher_disagreement_score":0.0048507676,"about_ca_system_score_codex":0.002568458,"about_ca_system_score_gemma":0.0013125975,"threshold_uncertainty_score":0.018635511},"labels":[],"label_agreement":null},{"id":"W2168861763","doi":"10.1109/glocom.2005.1577804","title":"Recursive parameter estimation for the dynamic packet loss system","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Network Traffic and Congestion Control","field":"Computer Science","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":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Packet loss; Multiprotocol Label Switching; Network packet; Provisioning; Computer network; Key (lock); Real-time computing","score_opus":0.01887969627661919,"score_gpt":0.27474235134851516,"score_spread":0.255862655071896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168861763","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.015126442,0.0002032527,0.98333573,0.00012053503,0.000013747736,0.000024507428,0.00004406565,0.00037058422,0.0007611244],"genre_scores_gemma":[0.86586195,0.00052602007,0.12878844,0.00009564457,0.000039804483,0.00023453076,0.0003697327,0.00012543511,0.003958464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995548,0.00012743902,0.000022550146,0.00012932952,0.00011274213,0.00005319663],"domain_scores_gemma":[0.998425,0.0010647153,0.00015673265,0.000099853045,0.00023042977,0.000023311673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011510103,0.0007906932,0.00083925837,0.0005687079,0.00036833883,0.0008942761,0.0007160474,0.00080382044,0.0017540465],"category_scores_gemma":[0.0065583102,0.0004764076,0.00042549256,0.00042908266,0.0005407028,0.00096435647,0.00068461354,0.0013393895,0.00056177477],"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.0000729751,0.000024528315,0.0008143232,0.00006534014,0.000028387265,0.00004805105,0.00007669058,0.94451225,0.0024678023,0.0062456336,0.0004730543,0.04517087],"study_design_scores_gemma":[0.0000035609958,0.000007809966,0.00018930784,0.000003070789,0.0000030736896,0.00001043182,0.0000038831113,0.9978422,0.0003572079,0.001396736,0.00017725308,0.000005485525],"about_ca_topic_score_codex":0.010383776,"about_ca_topic_score_gemma":0.0067463345,"teacher_disagreement_score":0.010383776,"about_ca_system_score_codex":0.0008546957,"about_ca_system_score_gemma":0.0008866079,"threshold_uncertainty_score":0.020646691},"labels":[],"label_agreement":null},{"id":"W2169032273","doi":"10.1109/glocom.2005.1578205","title":"Reactive cognitive radio algorithms for co-existence between IEEE 802.11b and 802.16a networks","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":55,"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":"Cognitive radio; Computer science; Computer network; Throughput; Radio resource management; Interference (communication); Co-channel interference; Wireless; Frequency band; IEEE 802.11; Power control; Wireless network; Channel (broadcasting); Telecommunications; Power (physics); Bandwidth (computing)","score_opus":0.03399956503745423,"score_gpt":0.29820018840138446,"score_spread":0.26420062336393024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169032273","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.008332356,0.0001899303,0.9879078,0.00012775187,0.000056154593,0.00003793838,0.0000048863735,0.00016793035,0.0031752181],"genre_scores_gemma":[0.79909587,0.00035038017,0.19656676,0.00022097981,0.00010143925,0.00026598017,0.000030298395,0.0000758551,0.0032924213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986981,0.00045628,0.00004858546,0.00016525744,0.00045577594,0.00017597621],"domain_scores_gemma":[0.9959377,0.0027504605,0.0004582361,0.00024778306,0.00047786676,0.00012790786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003277366,0.0010594558,0.0007134634,0.00071670895,0.00090168556,0.0013499213,0.0019311889,0.0010213022,0.0019261249],"category_scores_gemma":[0.008593713,0.00044776444,0.00051188184,0.00063046574,0.0014294942,0.0016612121,0.0017358838,0.0016056433,0.00032284777],"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.00011878568,0.00009157301,0.00047546916,0.00006648839,0.00007962089,0.000089051435,0.00021444955,0.8527735,0.0024077778,0.081610225,0.0011105028,0.06096262],"study_design_scores_gemma":[0.000023710316,0.00004388275,0.000048265043,0.000006346502,0.000012940914,0.000030834646,0.000018673536,0.9853388,0.00042101656,0.013261811,0.00078483194,0.000008819912],"about_ca_topic_score_codex":0.0030003379,"about_ca_topic_score_gemma":0.0027258173,"teacher_disagreement_score":0.003277366,"about_ca_system_score_codex":0.0008653549,"about_ca_system_score_gemma":0.0013343456,"threshold_uncertainty_score":0.017332554},"labels":[],"label_agreement":null},{"id":"W2170974177","doi":"10.1109/glocom.2005.1578445","title":"GSECps: a diversity technique with improved performance-complexity tradeoff","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","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 Victoria","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Diversity combining; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Computational complexity theory; Diversity scheme; Diversity (politics); Algorithm; Performance improvement; Scheme (mathematics); Diversity gain; Cooperative diversity; Telecommunications; Mathematics; Decoding methods; Engineering; Artificial intelligence","score_opus":0.05732486372260757,"score_gpt":0.2757730914047872,"score_spread":0.2184482276821796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170974177","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.07031814,0.0012831556,0.91893035,0.00047066098,0.00011043706,0.00010905762,0.000070342816,0.0005958459,0.008112029],"genre_scores_gemma":[0.69231427,0.0009802093,0.30211392,0.00046955445,0.00026778836,0.000117530086,0.00016158167,0.00003714359,0.0035379494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.000223561,0.000028281533,0.000094596435,0.00033507746,0.00010077116],"domain_scores_gemma":[0.99907565,0.00033931198,0.0001178215,0.0002558016,0.00015082367,0.0000606761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065417396,0.00090126647,0.0006274996,0.0005673563,0.00045029714,0.00087749626,0.0008900054,0.000683461,0.0013780455],"category_scores_gemma":[0.0012508801,0.00019894018,0.0003839144,0.0012624905,0.00081112934,0.0009825863,0.0016387718,0.001174726,0.00040957078],"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.0008295524,0.0002557975,0.0035769402,0.00032780206,0.0003909275,0.0009476461,0.0003554327,0.09892667,0.2436433,0.09966665,0.0060792235,0.545],"study_design_scores_gemma":[0.00040590295,0.002001842,0.0032140207,0.00007704135,0.00028846337,0.005097336,0.00020092218,0.7337107,0.16813256,0.054683123,0.0320397,0.00014836549],"about_ca_topic_score_codex":0.0003809651,"about_ca_topic_score_gemma":0.0008663899,"teacher_disagreement_score":0.0013780455,"about_ca_system_score_codex":0.0003430942,"about_ca_system_score_gemma":0.0005438998,"threshold_uncertainty_score":0.0046100616},"labels":[],"label_agreement":null}]}