{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79833424,0.004069856,0.06104165,0.009918164,0.0014495413,0.002875032,0.00017096834,0.0010220613,0.12111847],"genre_scores_gemma":[0.9739178,0.0020548245,0.022392422,0.00011165756,0.00012813546,0.0001879104,0.000047099744,0.000030645686,0.0011295065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948308,0.0008577045,0.0014123515,0.00074911676,0.00084375194,0.0013062676],"domain_scores_gemma":[0.9929992,0.0004863738,0.0006323559,0.004961583,0.000565019,0.00035548967],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015507684,0.0005164361,0.00082642084,0.0005925972,0.00049813715,0.0005349332,0.008232093,0.00032384964,0.00015610474],"category_scores_gemma":[0.000104474886,0.0005652612,0.00018008643,0.002412809,0.0003623363,0.0018103678,0.0018230863,0.00086298736,0.0004896087],"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.00014698635,0.0027324255,0.03494595,0.0003384609,0.0004466597,0.000019109999,0.0030164814,0.46575132,0.0043725534,0.20656325,0.04978414,0.23188266],"study_design_scores_gemma":[0.0009103667,0.00009484359,0.0059686825,0.0004390987,0.000013169843,0.000056579265,0.000080991216,0.9679108,0.0005176617,0.00020842822,0.023217585,0.00058174715],"about_ca_topic_score_codex":0.0007664436,"about_ca_topic_score_gemma":0.0006235511,"teacher_disagreement_score":0.50215954,"about_ca_system_score_codex":0.001014856,"about_ca_system_score_gemma":0.00064225815,"threshold_uncertainty_score":0.99967986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046092112,0.0003230925,0.9712908,0.0194322,0.0005031366,0.0024835593,0.00033831978,0.00064475485,0.0045232074],"genre_scores_gemma":[0.7583312,0.000045616154,0.2332057,0.006442063,0.00019354335,0.0011106369,0.00009167912,0.00003079564,0.00054878974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99511534,0.001071317,0.001026983,0.001069587,0.00048159127,0.0012351886],"domain_scores_gemma":[0.9939827,0.0015949821,0.00050645473,0.002601208,0.00080284924,0.0005118231],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012318566,0.00073741993,0.0008121443,0.00026425556,0.0008033561,0.00057456415,0.0036236416,0.00033382868,0.00023202795],"category_scores_gemma":[0.00015228108,0.00072503166,0.0004253248,0.00076946494,0.0002605322,0.0006032546,0.00014771013,0.00050991867,0.0004181854],"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.0014006293,0.0027212042,0.000031150714,0.000012609678,0.00020088116,0.000008534142,0.00007421658,0.17541818,0.00007750568,0.045179117,0.08727622,0.6875997],"study_design_scores_gemma":[0.0132707525,0.0006883556,0.00014565993,0.00007889256,0.00008605631,0.0000071138447,0.000022810997,0.90035355,0.0001948659,0.00079948705,0.08364541,0.00070706854],"about_ca_topic_score_codex":0.00006994242,"about_ca_topic_score_gemma":0.0003618374,"teacher_disagreement_score":0.75787026,"about_ca_system_score_codex":0.00057609857,"about_ca_system_score_gemma":0.0012749553,"threshold_uncertainty_score":0.99952006},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013365975,0.004933205,0.9295512,0.0026108797,0.00089266,0.003868516,0.0007837075,0.0035006867,0.040493187],"genre_scores_gemma":[0.90784997,0.00234626,0.08728571,0.00012465807,0.00007317622,0.001681735,0.0003543134,0.00006218594,0.00022196659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972648,0.00017990549,0.0011250158,0.00039387378,0.00025689387,0.0007794866],"domain_scores_gemma":[0.9965668,0.00028748118,0.00024067856,0.0024010353,0.0003076354,0.0001963925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00049612985,0.00047956678,0.00058524817,0.0003033649,0.00029590688,0.00018978951,0.002046413,0.00021406612,0.00004053272],"category_scores_gemma":[0.0001077407,0.0005731598,0.00012258458,0.0006961372,0.00015425359,0.00076430826,0.00017915745,0.0004897252,0.00014867572],"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.00006742818,0.0009098051,0.00030553743,0.0002649546,0.00017166563,0.0000017903482,0.00033544647,0.7329396,0.0014238977,0.103912644,0.055218946,0.10444829],"study_design_scores_gemma":[0.0011656757,0.00011495723,0.0006800353,0.00030158405,0.00003359762,0.000033207172,0.00017820446,0.93022245,0.0012977441,0.005334186,0.059837233,0.0008011036],"about_ca_topic_score_codex":0.00026963578,"about_ca_topic_score_gemma":0.0021627636,"teacher_disagreement_score":0.89448404,"about_ca_system_score_codex":0.001118625,"about_ca_system_score_gemma":0.00015685697,"threshold_uncertainty_score":0.999672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021876602,0.00031435722,0.958881,0.0036926237,0.00075520703,0.0013158126,0.00015615045,0.0009839134,0.012024306],"genre_scores_gemma":[0.55570984,0.000076382006,0.44357663,0.00015004977,0.000048111902,0.00028193896,0.00007253728,0.000016449338,0.00006806333],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645346,0.0003422068,0.0013351786,0.0007269922,0.00043792682,0.0007042387],"domain_scores_gemma":[0.99616677,0.00069376035,0.00078293256,0.0016117899,0.000560186,0.00018456313],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912706,0.00043127057,0.0005891,0.00041311726,0.0009259888,0.000653633,0.0020253232,0.0002576451,0.00005002037],"category_scores_gemma":[0.00035738834,0.00052248384,0.00021121417,0.001875154,0.00027281212,0.0017932131,0.00028988597,0.00042628634,0.000075149415],"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.00035901656,0.0038250156,0.0032264236,0.00038589883,0.00040745866,0.000013340286,0.0040656175,0.107556425,0.012087557,0.20903794,0.022771707,0.6362636],"study_design_scores_gemma":[0.0010904594,0.00018940587,0.0036473037,0.00035020977,0.000034363886,0.0000761551,0.000038505586,0.9595549,0.006355031,0.009775674,0.018242327,0.0006456688],"about_ca_topic_score_codex":0.00068125495,"about_ca_topic_score_gemma":0.0012143817,"teacher_disagreement_score":0.85199845,"about_ca_system_score_codex":0.0010337337,"about_ca_system_score_gemma":0.00084838946,"threshold_uncertainty_score":0.99972266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06602403,0.0016918277,0.90843886,0.0033428501,0.00033380528,0.0036120617,0.0011338636,0.0034077761,0.012014921],"genre_scores_gemma":[0.89016587,0.001103924,0.10696597,0.00009100497,0.00008732903,0.0008777572,0.00044421546,0.00008629854,0.00017764374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996841,0.00020131549,0.0010357186,0.0005221358,0.00029418603,0.0011056092],"domain_scores_gemma":[0.9964554,0.0005187363,0.0002871036,0.002150178,0.0003239349,0.00026465414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005178207,0.0006547716,0.0008505796,0.000329914,0.0004937283,0.0002335073,0.0020469655,0.0003269322,0.00011060865],"category_scores_gemma":[0.00013166085,0.0007070954,0.00018349687,0.0009757435,0.00023774068,0.00075823744,0.00023257972,0.0006578993,0.00010056992],"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.0011724195,0.0018467461,0.004416645,0.00059113925,0.0013255319,0.000025727688,0.002406819,0.65528363,0.034788664,0.041314904,0.071199946,0.18562782],"study_design_scores_gemma":[0.008591884,0.00021363443,0.0011347851,0.0010009678,0.00016833584,0.000106581705,0.00040781123,0.7634845,0.035027035,0.0022897192,0.18501772,0.0025570507],"about_ca_topic_score_codex":0.000093828115,"about_ca_topic_score_gemma":0.0013485365,"teacher_disagreement_score":0.82414186,"about_ca_system_score_codex":0.0011024995,"about_ca_system_score_gemma":0.00017172136,"threshold_uncertainty_score":0.999538},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022757718,0.003993403,0.6858679,0.10988605,0.0013155552,0.0019750127,0.00060769054,0.0034883092,0.17010833],"genre_scores_gemma":[0.92181724,0.0037655346,0.07087109,0.0013587063,0.00016578066,0.000108779655,0.0002175599,0.000024516256,0.0016707565],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960621,0.0006705973,0.00095668173,0.0007705141,0.00048548437,0.0010545941],"domain_scores_gemma":[0.9935419,0.00030851157,0.0004135645,0.004578029,0.00067922816,0.000478792],"candidate_categories":["metaepi_narrow","sts","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072362873,0.00055665575,0.0005985375,0.00019248718,0.0013386098,0.00084267143,0.006574405,0.00021437339,0.00040611648],"category_scores_gemma":[0.00015337487,0.00059687847,0.00024314862,0.0016642328,0.00029468563,0.0011393175,0.0016577325,0.0006792227,0.0019609507],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027611068,0.0012184877,0.0006863253,0.000018396193,0.00028084771,0.000011093915,0.0005773333,0.004522668,0.0022623213,0.36735755,0.37727025,0.24576713],"study_design_scores_gemma":[0.0010756007,0.000078559664,0.002561494,0.00011550856,0.00004242775,0.00013614995,0.00004757963,0.3478416,0.00075318135,0.001359477,0.64500755,0.000980886],"about_ca_topic_score_codex":0.000054646927,"about_ca_topic_score_gemma":0.0007793266,"teacher_disagreement_score":0.89905953,"about_ca_system_score_codex":0.00075275265,"about_ca_system_score_gemma":0.0005472113,"threshold_uncertainty_score":0.9999615},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031808995,0.0071637905,0.90872496,0.0021769102,0.0014834843,0.0033601203,0.00090311887,0.005975344,0.038403265],"genre_scores_gemma":[0.8863225,0.0041882005,0.10684223,0.00017169185,0.00020485013,0.0013639936,0.00026728242,0.00008001794,0.00055925397],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972458,0.00020627529,0.0010350317,0.00042899346,0.00027125876,0.00081264053],"domain_scores_gemma":[0.9959776,0.00018519368,0.0002629008,0.0028457297,0.00046923658,0.00025938766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037313448,0.00053091714,0.0005894282,0.00020657432,0.000552736,0.00025090217,0.0021053664,0.00037045582,0.0000885054],"category_scores_gemma":[0.00006292103,0.00061578094,0.0002281364,0.0005993619,0.00018562817,0.0006300907,0.00018293964,0.00046115136,0.00023155268],"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.00013625014,0.000796508,0.00025375924,0.00032961514,0.0006646989,0.000001992252,0.0003328476,0.19163671,0.027111808,0.09667366,0.1656,0.51646215],"study_design_scores_gemma":[0.0012058261,0.0000679471,0.0002084134,0.000099103156,0.00006882101,0.00005651438,0.00013075379,0.36258212,0.010796766,0.0020773988,0.62183005,0.0008763165],"about_ca_topic_score_codex":0.00019454703,"about_ca_topic_score_gemma":0.0017494818,"teacher_disagreement_score":0.85451347,"about_ca_system_score_codex":0.0010447764,"about_ca_system_score_gemma":0.0001250231,"threshold_uncertainty_score":0.9996294},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03440097,0.0045279292,0.85555524,0.01944659,0.0031113983,0.0015849342,0.00008383861,0.0019409375,0.07934816],"genre_scores_gemma":[0.80315274,0.0014986146,0.1911644,0.0024458421,0.0006357669,0.00013266498,0.000107867716,0.000048269885,0.0008138126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99331355,0.0008457034,0.0015841608,0.0012736192,0.00070391654,0.0022790704],"domain_scores_gemma":[0.9935421,0.00041392067,0.0005477645,0.0044972925,0.00041294147,0.0005860064],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009848335,0.0008226747,0.0009251402,0.0002616936,0.000713377,0.0006968769,0.0061319885,0.0005935875,0.00019071842],"category_scores_gemma":[0.00006322188,0.0008893189,0.0003078125,0.0025797104,0.0003425166,0.00088739855,0.0011579307,0.0011628598,0.0005840593],"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.00002315647,0.00048423404,0.0011556181,0.000005615708,0.00005793163,0.000026034306,0.00010237951,0.8785517,0.000015098799,0.028523939,0.0343207,0.056733593],"study_design_scores_gemma":[0.0010843831,0.0000707903,0.0028536287,0.00014876538,0.000024371282,0.00013774083,0.00003948916,0.8551321,0.00003424268,0.0009486868,0.13860288,0.000922889],"about_ca_topic_score_codex":0.0005169359,"about_ca_topic_score_gemma":0.005854964,"teacher_disagreement_score":0.7687518,"about_ca_system_score_codex":0.00082512276,"about_ca_system_score_gemma":0.00044859017,"threshold_uncertainty_score":0.99935573},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20221233,0.001241782,0.72595483,0.012395794,0.00038102153,0.0009851998,0.00016756763,0.00041374628,0.056247745],"genre_scores_gemma":[0.97843015,0.0034166244,0.01719278,0.0006932432,0.000034387776,0.000035951165,0.00008278924,0.00000887474,0.00010519367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963681,0.0010730117,0.0009244383,0.00059443957,0.00038386538,0.00065615575],"domain_scores_gemma":[0.9953928,0.00045594847,0.00033923943,0.0028867912,0.00068041036,0.00024483938],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008769124,0.0003724813,0.0007867333,0.00043268543,0.00069565437,0.00020161079,0.004533185,0.00019403112,0.00043423497],"category_scores_gemma":[0.00008313733,0.0003825777,0.00027013296,0.0041821254,0.0006389745,0.00060382293,0.002410017,0.0005815311,0.00004132022],"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.000027875894,0.0006744347,0.009580131,0.0000041144435,0.00048378893,0.0000036685349,0.00076793344,0.034207135,0.000060548937,0.8885421,0.0020890352,0.063559234],"study_design_scores_gemma":[0.0007107226,0.00005794314,0.027869727,0.000049464863,0.00016678691,0.000008712342,0.00012258258,0.9667824,0.000115301795,0.0008376305,0.0028048735,0.00047383568],"about_ca_topic_score_codex":0.0001597837,"about_ca_topic_score_gemma":0.0069864113,"teacher_disagreement_score":0.9325753,"about_ca_system_score_codex":0.00044764014,"about_ca_system_score_gemma":0.00027120425,"threshold_uncertainty_score":0.9998626},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19643277,0.0028436282,0.7458261,0.0013275868,0.00039035646,0.0013120046,0.00026603794,0.0027724197,0.04882909],"genre_scores_gemma":[0.97290355,0.0032046274,0.0233809,0.000090709145,0.000042381205,0.00016628204,0.000053320036,0.000045451146,0.000112799135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976044,0.00019755916,0.0010379915,0.00030897855,0.00027252786,0.0005785266],"domain_scores_gemma":[0.9970291,0.0001685134,0.00026506814,0.0021644786,0.00022402471,0.00014881782],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003628518,0.00037939948,0.00051012577,0.0003369232,0.00018628828,0.00006419927,0.0018136164,0.00030085695,0.000091300695],"category_scores_gemma":[0.00007229724,0.0004644668,0.00012494082,0.00095456385,0.0002341332,0.00064342073,0.0002502449,0.0006939514,0.00006825644],"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.00006555817,0.0007030622,0.0052014184,0.00013722223,0.00016969739,0.0000023440853,0.0006777824,0.18964396,0.026109176,0.011860572,0.004210442,0.7612187],"study_design_scores_gemma":[0.0021704154,0.000109786844,0.013625475,0.00048903376,0.00006253455,0.00008921392,0.00064302277,0.6688197,0.09549307,0.0052758874,0.21153283,0.0016890368],"about_ca_topic_score_codex":0.00029976142,"about_ca_topic_score_gemma":0.00783919,"teacher_disagreement_score":0.7764708,"about_ca_system_score_codex":0.0008357076,"about_ca_system_score_gemma":0.000107702894,"threshold_uncertainty_score":0.9997807},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4281896,0.0009475375,0.54923934,0.0007101428,0.000704201,0.0011407313,0.00018921487,0.003335339,0.015543929],"genre_scores_gemma":[0.89993906,0.0017099769,0.09737751,0.00013576917,0.00014845881,0.00011167229,0.00031936003,0.00007421646,0.00018397706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972389,0.00014001013,0.00069494155,0.0005276043,0.0004223299,0.000976228],"domain_scores_gemma":[0.9976379,0.000116254865,0.00024939797,0.0013887517,0.00028834713,0.00031933674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018483844,0.00067012483,0.0006183827,0.00021998025,0.00082960835,0.00023103501,0.0013606366,0.00036668277,0.0002633747],"category_scores_gemma":[0.000024362605,0.00068968744,0.00013684333,0.0007980006,0.0002376992,0.0008355345,0.00052839087,0.00080225914,0.00008156766],"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.000055259676,0.00024787028,0.0025498634,0.000026532332,0.00022513217,0.000007104284,0.00028402905,0.96784824,0.0001436446,0.002285132,0.0038344625,0.022492712],"study_design_scores_gemma":[0.0015414011,0.00014847946,0.0017797401,0.0003807941,0.00014903613,0.00007359081,0.00023380162,0.98131144,0.0016241833,0.0003432392,0.011134523,0.0012797511],"about_ca_topic_score_codex":0.00006486595,"about_ca_topic_score_gemma":0.00040775817,"teacher_disagreement_score":0.47174948,"about_ca_system_score_codex":0.00088545535,"about_ca_system_score_gemma":0.000097073505,"threshold_uncertainty_score":0.9995554},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056044716,0.0002668987,0.93464756,0.0007463064,0.00051379704,0.0024620353,0.0007121293,0.0005365855,0.0040699802],"genre_scores_gemma":[0.9534208,0.000162048,0.045515012,0.00004432803,0.000049432263,0.00027871138,0.00024122917,0.000033253786,0.0002551409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978654,0.00018213662,0.00084903144,0.00038381276,0.00022691034,0.00049272465],"domain_scores_gemma":[0.9971657,0.00013272504,0.00040603327,0.0013735505,0.000806366,0.00011562829],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033085482,0.000363937,0.00060311815,0.00020549251,0.00031379538,0.000073180665,0.00094147946,0.00023124552,0.00007704946],"category_scores_gemma":[0.00010420461,0.00030890832,0.00023735221,0.0022276286,0.00018236885,0.0003698244,0.00007290662,0.00028917688,0.000012766924],"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.000052781288,0.00017637457,0.00505404,0.00004431624,0.00084825855,1.2419886e-7,0.0002428392,0.9867558,0.00050287746,0.0012348841,0.00081255316,0.004275175],"study_design_scores_gemma":[0.00080351945,0.00008884235,0.0038336045,0.00009516347,0.0007456505,0.00001226385,0.000102628204,0.98888296,0.00076724315,0.00034836394,0.0039058537,0.00041393464],"about_ca_topic_score_codex":0.00024186962,"about_ca_topic_score_gemma":0.012482437,"teacher_disagreement_score":0.8973761,"about_ca_system_score_codex":0.0006638038,"about_ca_system_score_gemma":0.0002068822,"threshold_uncertainty_score":0.9999363},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008518798,0.00051387056,0.9720723,0.00600854,0.00033437865,0.00050428405,0.00007689695,0.00026897542,0.011701951],"genre_scores_gemma":[0.8744203,0.0007695952,0.123961754,0.0002683403,0.00006378433,0.00020269603,0.00012014253,0.000017466044,0.0001759203],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958906,0.0009673818,0.0012565617,0.00058500544,0.00068042707,0.00062001555],"domain_scores_gemma":[0.9942462,0.0004772502,0.00058608374,0.0036445684,0.000852577,0.00019332052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000684146,0.00034127446,0.00043925582,0.00054024986,0.00030069883,0.0002541554,0.0053315097,0.0002967647,0.00012310699],"category_scores_gemma":[0.00029260083,0.00039206215,0.00014886683,0.0020455278,0.00021714545,0.0015018176,0.0010688348,0.0004593243,0.00006420497],"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.00011073687,0.0014228203,0.0016996891,0.000027867887,0.0001255451,0.0000021599906,0.0009726551,0.0860056,0.0008548144,0.2049051,0.008275837,0.6955972],"study_design_scores_gemma":[0.001220948,0.00006917126,0.010631519,0.000082499355,0.000012367048,0.000021691409,0.00006297533,0.96639496,0.0010490129,0.0058675758,0.014226096,0.00036115473],"about_ca_topic_score_codex":0.0011152893,"about_ca_topic_score_gemma":0.017728923,"teacher_disagreement_score":0.8803894,"about_ca_system_score_codex":0.00079480687,"about_ca_system_score_gemma":0.0005876424,"threshold_uncertainty_score":0.99985313},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5314494,0.008917616,0.17577294,0.016077565,0.0032787283,0.003489394,0.0024129257,0.0040570544,0.25454438],"genre_scores_gemma":[0.98315096,0.0027934795,0.012078864,0.0002155309,0.00012097889,0.00018568031,0.00057636085,0.000052663756,0.00082550914],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734795,0.000140894,0.001031665,0.00042416685,0.00024252497,0.0008128211],"domain_scores_gemma":[0.996771,0.00012607168,0.00015096633,0.0024097536,0.0002744084,0.0002678096],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029014284,0.00051306444,0.0004931756,0.00032229564,0.00021685666,0.00038502435,0.0022145163,0.00027666215,0.00046830683],"category_scores_gemma":[0.00008995056,0.0005731607,0.00014582888,0.0010012538,0.00018033946,0.0011227725,0.00038032277,0.00066267984,0.0007177612],"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.00019659055,0.004348461,0.0181745,0.00018175654,0.0005419858,0.000025691965,0.002252379,0.32019237,0.001466312,0.02626653,0.13170497,0.49464846],"study_design_scores_gemma":[0.0022829967,0.00008788958,0.0070267376,0.00030320924,0.000053017404,0.0000759944,0.00028078788,0.66486865,0.0009508269,0.0017487053,0.32084203,0.0014791491],"about_ca_topic_score_codex":0.00017149044,"about_ca_topic_score_gemma":0.003667184,"teacher_disagreement_score":0.4931693,"about_ca_system_score_codex":0.0006201201,"about_ca_system_score_gemma":0.00015654539,"threshold_uncertainty_score":0.999672},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9271497,0.0039182687,0.05228807,0.0020052965,0.0008879435,0.0024446994,0.0010291027,0.0014084291,0.008868447],"genre_scores_gemma":[0.9809472,0.0008210938,0.017316366,0.00006628524,0.00010272853,0.00031775105,0.00031450565,0.000044596818,0.00006944857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976743,0.00017989114,0.0009616127,0.00040154517,0.00024007224,0.0005425648],"domain_scores_gemma":[0.99654937,0.00022931125,0.00031940182,0.0023667153,0.00036323385,0.00017196206],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027587605,0.00043842278,0.0006834736,0.00029819988,0.00039137018,0.00012494049,0.0016018065,0.00045117325,0.0000348262],"category_scores_gemma":[0.00007139237,0.00047505612,0.000108069355,0.00046020673,0.0002965393,0.00041144158,0.00010155495,0.00047695133,0.00002346705],"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.00031353836,0.0023228119,0.0076898816,0.0005108734,0.0012024875,0.000001056706,0.0022740182,0.41544828,0.015702182,0.18573922,0.06420216,0.3045935],"study_design_scores_gemma":[0.0022931036,0.00043788194,0.007043778,0.00020202172,0.00016539753,0.00004523484,0.00084023253,0.86583424,0.01114802,0.0068889656,0.1039574,0.0011437428],"about_ca_topic_score_codex":0.00016069536,"about_ca_topic_score_gemma":0.0011212908,"teacher_disagreement_score":0.45038593,"about_ca_system_score_codex":0.00030188574,"about_ca_system_score_gemma":0.00010772298,"threshold_uncertainty_score":0.9997701},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37828335,0.0021253757,0.59112906,0.00092977635,0.0016800468,0.0017864376,0.0014839408,0.0018610236,0.020720968],"genre_scores_gemma":[0.796649,0.0002621434,0.20211414,0.00012309966,0.00029854322,0.00018837914,0.00019792991,0.000057853802,0.00010894195],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970313,0.00021470882,0.0009643299,0.00046736977,0.00030262917,0.0010197101],"domain_scores_gemma":[0.99680704,0.00026191646,0.00017181231,0.0020426936,0.00036042146,0.00035610897],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058822765,0.00053079904,0.0006137231,0.00019061237,0.00064262823,0.00025449978,0.0018712711,0.00037035145,0.00013858397],"category_scores_gemma":[0.00011655575,0.00059202354,0.00028206248,0.00066750427,0.00024876036,0.0004843038,0.00022945052,0.0004748542,0.000112175876],"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.00023206088,0.0022306796,0.0037323374,0.00047109387,0.0028916711,0.000047670095,0.0016615643,0.11541104,0.01952409,0.19641735,0.095024556,0.5623559],"study_design_scores_gemma":[0.0015649206,0.00010399542,0.0011639085,0.00024148668,0.00022409322,0.0004315224,0.00038552473,0.90730166,0.0013009502,0.0048290445,0.08123132,0.0012215972],"about_ca_topic_score_codex":0.00010161396,"about_ca_topic_score_gemma":0.0013518843,"teacher_disagreement_score":0.7918906,"about_ca_system_score_codex":0.000492605,"about_ca_system_score_gemma":0.00024231724,"threshold_uncertainty_score":0.9996531},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20036954,0.00072600925,0.7196562,0.013865502,0.000450404,0.000943642,0.0001023173,0.0007043134,0.06318202],"genre_scores_gemma":[0.92926663,0.0012434901,0.068245806,0.0008968846,0.00007201804,0.00005729008,0.00004194596,0.000012859359,0.00016304829],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971408,0.0006847235,0.0005734551,0.0005847264,0.00033239005,0.00068386446],"domain_scores_gemma":[0.99657565,0.00021651703,0.0003185211,0.002271622,0.00038196874,0.00023569197],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000575623,0.00037845504,0.0003782625,0.00018621376,0.0016089331,0.00026060123,0.0039997045,0.00015544251,0.00016040148],"category_scores_gemma":[0.0000647838,0.00038235952,0.000095912445,0.0011584808,0.0002412674,0.0010940321,0.0028873112,0.00074450247,0.000109211825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001994426,0.0009152876,0.02858762,0.00001965144,0.00026909244,0.00004211486,0.0076066586,0.03626769,0.00028619045,0.32269126,0.021097131,0.58201784],"study_design_scores_gemma":[0.0045901984,0.00044755574,0.1437903,0.00047388207,0.00007451465,0.0001915417,0.0010014857,0.74015236,0.0006221611,0.0041126707,0.10237133,0.0021720193],"about_ca_topic_score_codex":0.00047342028,"about_ca_topic_score_gemma":0.021702018,"teacher_disagreement_score":0.7288971,"about_ca_system_score_codex":0.00055166276,"about_ca_system_score_gemma":0.0004625969,"threshold_uncertainty_score":0.99986285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01960043,0.0012808299,0.9546481,0.002062064,0.00089075865,0.002622836,0.0009811837,0.0046373354,0.013276475],"genre_scores_gemma":[0.8583493,0.0015481673,0.13770095,0.00024746457,0.00020467593,0.0012343861,0.0003487137,0.00008681518,0.00027953883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671596,0.00019202897,0.00117618,0.0005617094,0.00030884612,0.0010452773],"domain_scores_gemma":[0.9952764,0.0006459911,0.00031133476,0.0028607033,0.00055763836,0.00034791706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041839448,0.0006855686,0.000673449,0.00028653414,0.0006991691,0.00022013766,0.0022945264,0.0004632872,0.0000889668],"category_scores_gemma":[0.00030640856,0.0008131002,0.0003085864,0.0006438229,0.00037249937,0.0007489639,0.00025300705,0.00065507833,0.00019060104],"study_design_candidate":"design_other","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.000136199,0.000767238,0.0006866448,0.00016311905,0.00045283124,0.0000024407193,0.0004431048,0.090696886,0.014386819,0.009755269,0.02622389,0.8562856],"study_design_scores_gemma":[0.002224749,0.00011109723,0.00047328146,0.00012220557,0.000070368034,0.00007106754,0.00020515393,0.64178354,0.029183274,0.0020421501,0.32256716,0.0011459385],"about_ca_topic_score_codex":0.000115050796,"about_ca_topic_score_gemma":0.0029728296,"teacher_disagreement_score":0.8551396,"about_ca_system_score_codex":0.0009482524,"about_ca_system_score_gemma":0.00017047694,"threshold_uncertainty_score":0.99943197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.143459,0.005076936,0.77364844,0.004057132,0.0014849772,0.0024500096,0.00019362509,0.0031260543,0.0665038],"genre_scores_gemma":[0.9487149,0.0029966887,0.04673458,0.00041107417,0.0002491228,0.00019080161,0.0004371713,0.00008602987,0.00017960656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966714,0.00021783367,0.0010881295,0.00055127556,0.00032467363,0.0011467091],"domain_scores_gemma":[0.9972098,0.00014434545,0.00022998912,0.0018272614,0.00028860767,0.0003000057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036540427,0.00058076583,0.0006015754,0.00021195412,0.00034870094,0.00018861274,0.0015962,0.00042077314,0.00021160598],"category_scores_gemma":[0.00002433605,0.00069474836,0.000109842775,0.0016796413,0.00011213855,0.00079774513,0.00024328285,0.0008362176,0.00027237687],"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.000015743788,0.00013970977,0.0006148085,0.000027327033,0.000039343642,0.0000048629086,0.00011185297,0.9285977,0.00016781055,0.0022158213,0.005275399,0.062789634],"study_design_scores_gemma":[0.0008408968,0.000022934102,0.0008819387,0.00020082976,0.000027978063,0.000022328391,0.000094245166,0.9699279,0.00022946724,0.00032912046,0.02673882,0.00068352965],"about_ca_topic_score_codex":0.00028197287,"about_ca_topic_score_gemma":0.0067338687,"teacher_disagreement_score":0.80525595,"about_ca_system_score_codex":0.0009906571,"about_ca_system_score_gemma":0.0001840831,"threshold_uncertainty_score":0.99955034},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05696457,0.0015749186,0.88166535,0.004515134,0.00033805662,0.0028498108,0.0021645504,0.003471251,0.04645639],"genre_scores_gemma":[0.61371106,0.00027635193,0.3842041,0.00020104901,0.00007999029,0.00063043006,0.0006320906,0.000054450415,0.00021051205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971577,0.00016097532,0.0009825109,0.0004857789,0.00039004735,0.00082297326],"domain_scores_gemma":[0.99591595,0.00048472558,0.0002687209,0.0022624524,0.0007372456,0.00033087944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003062592,0.00057476683,0.00054939184,0.00024611835,0.00085253833,0.00018441124,0.0015879165,0.00022677431,0.00033781785],"category_scores_gemma":[0.000054759203,0.0006198692,0.00019773383,0.0007191576,0.00047624187,0.0007348724,0.00018075621,0.00056235574,0.00016555093],"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.00006868816,0.0006418131,0.0006339363,0.000035719484,0.00030924767,0.0000017090362,0.00016340302,0.8076938,0.0006951806,0.10263034,0.029013777,0.058112413],"study_design_scores_gemma":[0.00338359,0.00029252065,0.0012929059,0.00022249887,0.00021295315,0.00024316169,0.00033070357,0.77177656,0.0029894745,0.0048385337,0.21254008,0.0018770394],"about_ca_topic_score_codex":0.000053344873,"about_ca_topic_score_gemma":0.0017779871,"teacher_disagreement_score":0.5567465,"about_ca_system_score_codex":0.00060886284,"about_ca_system_score_gemma":0.00041514245,"threshold_uncertainty_score":0.99962527},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018919278,0.0028059827,0.9095406,0.00798463,0.00073017145,0.0028002677,0.003165641,0.006180324,0.047873095],"genre_scores_gemma":[0.7988849,0.0012231892,0.19770706,0.00047110865,0.00013326031,0.00071750657,0.0005843974,0.00007548746,0.00020303612],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99704385,0.00015541962,0.001027369,0.00047781793,0.00033963224,0.0009559057],"domain_scores_gemma":[0.99557924,0.00038332463,0.00026103714,0.0029703951,0.00048886787,0.0003171081],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041488616,0.00059133547,0.0005931248,0.0002331846,0.00063853204,0.00019867365,0.0027031242,0.0003406076,0.00022697425],"category_scores_gemma":[0.000098637014,0.00070069305,0.00027428087,0.0006501416,0.00028916038,0.0006345962,0.000219594,0.00061390054,0.00015441733],"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.00014737705,0.001524701,0.0013293788,0.0003076933,0.0005930226,0.0000051128145,0.00026840824,0.22776091,0.0051846076,0.20931916,0.24825327,0.30530638],"study_design_scores_gemma":[0.0014631072,0.000091584676,0.0006317508,0.000177101,0.0000858443,0.000036611797,0.000086834094,0.33016464,0.0055919415,0.0036321355,0.65687007,0.0011684088],"about_ca_topic_score_codex":0.00004726155,"about_ca_topic_score_gemma":0.0014321755,"teacher_disagreement_score":0.7799657,"about_ca_system_score_codex":0.00087991275,"about_ca_system_score_gemma":0.0003123473,"threshold_uncertainty_score":0.99954444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023429429,0.0007871603,0.9708136,0.014988058,0.0006308441,0.0014477989,0.00019674403,0.0006776685,0.008115207],"genre_scores_gemma":[0.6428215,0.0009862582,0.35381112,0.0011068593,0.000217289,0.0003248308,0.00026227505,0.000029036282,0.00044085213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957712,0.00057104387,0.0012243357,0.00092276797,0.00044929254,0.0010613054],"domain_scores_gemma":[0.9940877,0.0006581968,0.00047260732,0.0034196074,0.00095670554,0.00040519686],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0007771456,0.00062087004,0.00062272506,0.00024718945,0.0014423737,0.0007296486,0.005013917,0.00023590103,0.00018795047],"category_scores_gemma":[0.00023164338,0.00067931606,0.00034748288,0.00096303463,0.00025921784,0.001291101,0.0007058667,0.0005159295,0.00016232661],"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.000089347224,0.0010425239,0.0006890486,0.000030743697,0.00021697824,0.000002314772,0.00095804443,0.14728163,0.0006049891,0.045930535,0.02533632,0.7778175],"study_design_scores_gemma":[0.0025545182,0.000081709375,0.0005103098,0.00007803159,0.000037600847,0.0000278827,0.00004156715,0.8527403,0.00046438834,0.0003174907,0.14246507,0.0006811515],"about_ca_topic_score_codex":0.00014688654,"about_ca_topic_score_gemma":0.0059096916,"teacher_disagreement_score":0.7771364,"about_ca_system_score_codex":0.0005671503,"about_ca_system_score_gemma":0.00053427817,"threshold_uncertainty_score":0.9998576},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30718955,0.0036838811,0.51931304,0.0046001347,0.0029606142,0.0023723259,0.00056239375,0.0034338618,0.1558842],"genre_scores_gemma":[0.9215117,0.0023016839,0.07478786,0.00026560877,0.00021671089,0.00016531374,0.00036266653,0.00006643334,0.00032202827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700534,0.00016530702,0.0009918009,0.00048764257,0.0003376771,0.0010122138],"domain_scores_gemma":[0.9975482,0.000095108124,0.0001999984,0.0016714955,0.0002018639,0.00028331485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026796633,0.00054927636,0.00054307096,0.00026557146,0.00024103209,0.00016419389,0.0014373462,0.00034217225,0.00045166528],"category_scores_gemma":[0.000036650723,0.0006654832,0.0001390571,0.001088718,0.00021233343,0.00086019374,0.00012611099,0.00066240336,0.0005817956],"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.000018164397,0.00020204314,0.0038169243,0.000021997179,0.000062194995,0.0000039548036,0.00009808004,0.91246456,0.00009762946,0.0035599368,0.02099186,0.05866267],"study_design_scores_gemma":[0.0018048106,0.000050250987,0.0044806697,0.0001798698,0.00004698724,0.0000483267,0.0001599515,0.8800011,0.0006661554,0.0015162259,0.10982525,0.0012203954],"about_ca_topic_score_codex":0.00021586372,"about_ca_topic_score_gemma":0.010292713,"teacher_disagreement_score":0.6143221,"about_ca_system_score_codex":0.001548542,"about_ca_system_score_gemma":0.00019823908,"threshold_uncertainty_score":0.99957967},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10827003,0.0036899014,0.79932237,0.048356973,0.001970973,0.0019377636,0.00006883754,0.0015359919,0.034847196],"genre_scores_gemma":[0.864261,0.0007963073,0.12633978,0.006324568,0.00036587534,0.00031147685,0.000057966146,0.000032803368,0.0015102435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580806,0.0004346922,0.00091703836,0.00097233005,0.0005565851,0.0013112975],"domain_scores_gemma":[0.9951551,0.0005028262,0.00047414456,0.0031951133,0.00030910864,0.00036372265],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009537711,0.0005838021,0.00055689964,0.000084083396,0.00177181,0.0009307023,0.0053757504,0.000258864,0.00019299112],"category_scores_gemma":[0.00006795697,0.0004981786,0.00027092858,0.0009741611,0.0002797666,0.0006923671,0.0010370372,0.00071717816,0.00054717873],"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.000053857893,0.00019277487,0.00021584312,0.000006889115,0.0001635477,0.0000031090165,0.0001296805,0.6326803,0.000018481865,0.21603303,0.03246374,0.118038744],"study_design_scores_gemma":[0.0017364474,0.000089049085,0.0003807539,0.00015143445,0.00008525272,0.00007691602,0.00007815197,0.9364707,0.00007854719,0.009892444,0.050128568,0.0008317407],"about_ca_topic_score_codex":0.00009804344,"about_ca_topic_score_gemma":0.0016217093,"teacher_disagreement_score":0.755991,"about_ca_system_score_codex":0.00071567803,"about_ca_system_score_gemma":0.00043191548,"threshold_uncertainty_score":0.999747},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0819659,0.0010539381,0.9004826,0.0027630115,0.0003248548,0.0015700673,0.0009171567,0.0013690757,0.009553422],"genre_scores_gemma":[0.8334277,0.000609666,0.16496865,0.00016800761,0.000090988244,0.0002587582,0.00034028647,0.000047274752,0.00008865186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754333,0.00023688152,0.0009173627,0.00037571156,0.00029559675,0.00063108385],"domain_scores_gemma":[0.9956283,0.00029458688,0.0002568491,0.0030487091,0.0005452,0.00022634401],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005418032,0.00041408036,0.00047179018,0.00016829188,0.00042285287,0.00015231778,0.003032298,0.00030268377,0.00016272775],"category_scores_gemma":[0.000078029065,0.00039625855,0.00017706866,0.00047860516,0.00045957603,0.0009735734,0.00023919834,0.00049846346,0.00003420788],"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.00020056148,0.003015603,0.0004130799,0.000095879805,0.0007517248,0.000001032571,0.0016047118,0.20553498,0.010411331,0.06529593,0.032614157,0.68006104],"study_design_scores_gemma":[0.00086385995,0.0003672737,0.0015997522,0.000091260474,0.00015480419,0.00002583097,0.00039091412,0.92718273,0.007610841,0.0018180038,0.059206992,0.0006877047],"about_ca_topic_score_codex":0.00009994323,"about_ca_topic_score_gemma":0.0016426116,"teacher_disagreement_score":0.7514618,"about_ca_system_score_codex":0.0004883545,"about_ca_system_score_gemma":0.0001397721,"threshold_uncertainty_score":0.9998489},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13622262,0.004058231,0.83354735,0.010408929,0.00034105935,0.0010160855,0.00008616868,0.00047934556,0.01384024],"genre_scores_gemma":[0.88660324,0.007859161,0.104170784,0.000523183,0.0001125426,0.00017474453,0.00008777321,0.000030193956,0.00043840558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99499094,0.00073370466,0.0012214778,0.00092001667,0.0006732038,0.001460625],"domain_scores_gemma":[0.9937027,0.00030682128,0.0002978724,0.004670775,0.00052178995,0.000500037],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014338057,0.000570577,0.0006319798,0.00034988593,0.0008334034,0.00069983635,0.006856341,0.00040665804,0.00005898125],"category_scores_gemma":[0.000079372025,0.00062442076,0.00013126215,0.0016798557,0.00036665908,0.0015644466,0.0022934354,0.0013427978,0.00016728623],"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.000045017594,0.00081974623,0.006011076,0.00004291177,0.00010676437,0.000011131724,0.00056310405,0.3095244,0.00011937353,0.047572915,0.011224242,0.62395936],"study_design_scores_gemma":[0.0009325559,0.00005106671,0.0046544,0.00013497414,0.000011560491,0.000053574033,0.000068937,0.98298615,0.000063716565,0.00080163014,0.009601374,0.000640078],"about_ca_topic_score_codex":0.00070964155,"about_ca_topic_score_gemma":0.006359753,"teacher_disagreement_score":0.7503806,"about_ca_system_score_codex":0.00070564135,"about_ca_system_score_gemma":0.000639346,"threshold_uncertainty_score":0.99962074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024779463,0.0030917483,0.963236,0.001010112,0.0006709175,0.0013964995,0.0001696836,0.0008860644,0.004759527],"genre_scores_gemma":[0.95617193,0.0059514814,0.035398528,0.00029881077,0.00033146708,0.00043817496,0.0011633992,0.00008698821,0.00015919999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996962,0.00012396899,0.0010808004,0.00055891095,0.00024043643,0.0010338745],"domain_scores_gemma":[0.9975676,0.0002012214,0.00027028247,0.0013675062,0.00035098882,0.00024239272],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003488219,0.0005786934,0.000607839,0.00021944022,0.00040480026,0.00023229061,0.0013369118,0.00045477485,0.00008782809],"category_scores_gemma":[0.000015617845,0.0006900496,0.00014896154,0.0009703481,0.00011407438,0.0008566489,0.0001257528,0.00052162574,0.000048396658],"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.000034516306,0.00012922609,0.001077594,0.00006904613,0.00006447696,6.6398917e-7,0.00011014727,0.9103729,0.00005509163,0.0033218635,0.0025205472,0.082243934],"study_design_scores_gemma":[0.0013099475,0.000033188466,0.0008675119,0.00026060632,0.000047806403,0.000013244581,0.00015317125,0.9741042,0.00023460595,0.00072530255,0.02156695,0.0006834193],"about_ca_topic_score_codex":0.00022323462,"about_ca_topic_score_gemma":0.010882258,"teacher_disagreement_score":0.9313925,"about_ca_system_score_codex":0.0011431435,"about_ca_system_score_gemma":0.0001551485,"threshold_uncertainty_score":0.99955505},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44795662,0.019381687,0.14698042,0.015801875,0.0012270332,0.0040513673,0.0036802967,0.0155276535,0.34539306],"genre_scores_gemma":[0.8371953,0.008414869,0.15283106,0.00033194353,0.000086894106,0.00017274062,0.00025125218,0.00006434281,0.00065164943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975082,0.00024710057,0.0008079397,0.00044131328,0.00024890515,0.00074649986],"domain_scores_gemma":[0.996253,0.0002140933,0.00020924825,0.0027704847,0.0002447464,0.00030838526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035430244,0.000561063,0.00059458194,0.00020161468,0.00043474097,0.0002214587,0.0018120658,0.00031957528,0.0006003932],"category_scores_gemma":[0.00006233767,0.0006359011,0.00011214554,0.0006074309,0.00040364283,0.0008293783,0.00035292492,0.00063500286,0.0005214447],"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.00006142874,0.0010545539,0.0030685428,0.00016199112,0.00081679487,0.000014377334,0.0004966569,0.030853393,0.039336693,0.3548631,0.3117315,0.25754097],"study_design_scores_gemma":[0.003679644,0.000263439,0.022112615,0.0005551963,0.00029525708,0.00023090064,0.00020072718,0.22807804,0.02772469,0.059916817,0.65221226,0.0047304262],"about_ca_topic_score_codex":0.00044299292,"about_ca_topic_score_gemma":0.002392047,"teacher_disagreement_score":0.38923863,"about_ca_system_score_codex":0.0005428812,"about_ca_system_score_gemma":0.00012863927,"threshold_uncertainty_score":0.99960923},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25340942,0.0061187423,0.2678192,0.0121849505,0.000862627,0.0032242767,0.0022250246,0.014895012,0.43926075],"genre_scores_gemma":[0.8441933,0.0023829974,0.15183587,0.00026795006,0.00014238856,0.00026055553,0.00027955754,0.00008342769,0.00055397116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99640775,0.0003569722,0.001105992,0.000564034,0.0004776698,0.0010875625],"domain_scores_gemma":[0.9950673,0.00025733985,0.00029267417,0.0036321962,0.00033887065,0.00041163704],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053424167,0.00074249814,0.00076220796,0.0002666733,0.0007153245,0.0002679681,0.0031364711,0.0004281702,0.00037581378],"category_scores_gemma":[0.00008778667,0.00086573005,0.00025995492,0.00080483605,0.00043542747,0.00087372604,0.0004697026,0.0011972656,0.000819583],"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.000079312726,0.0020749276,0.0027636597,0.00024524715,0.0011842095,0.000012531675,0.0012791603,0.3267928,0.022847207,0.1587156,0.21720563,0.2667997],"study_design_scores_gemma":[0.0011696289,0.000082316124,0.0015602517,0.00026596422,0.00013163334,0.00028003022,0.00018382912,0.44089723,0.010048468,0.006395666,0.53682095,0.0021640544],"about_ca_topic_score_codex":0.000120054756,"about_ca_topic_score_gemma":0.0010081917,"teacher_disagreement_score":0.5907839,"about_ca_system_score_codex":0.0010354463,"about_ca_system_score_gemma":0.00021711996,"threshold_uncertainty_score":0.9999584},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021068476,0.0015185784,0.96969324,0.0005803375,0.00039853697,0.0018510704,0.00040084444,0.0015557659,0.0029331755],"genre_scores_gemma":[0.9068055,0.0017908062,0.089612484,0.00007067745,0.00009199269,0.0012069552,0.00026568086,0.000058213824,0.000097685304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976578,0.00019539268,0.0009154418,0.00042038134,0.00022302216,0.0005879922],"domain_scores_gemma":[0.99731445,0.00018094419,0.00029304207,0.0015668224,0.0004327797,0.00021196512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028282456,0.0005050434,0.0005601487,0.00021428186,0.0005795745,0.0003151965,0.00085573544,0.00030757298,0.000025909418],"category_scores_gemma":[0.00007893186,0.0005635175,0.00012495248,0.00032097416,0.00019476275,0.00074615446,0.00017815936,0.00040563804,0.000044511038],"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.0001332118,0.0008744936,0.00010087823,0.00048326576,0.0006447769,0.0000018736655,0.001557521,0.48673788,0.019397609,0.026971202,0.008019819,0.45507747],"study_design_scores_gemma":[0.0010397562,0.00010048471,0.00066369015,0.0001572183,0.00006500466,0.000044582575,0.00016461758,0.97723913,0.00858157,0.0020619559,0.009238686,0.00064327987],"about_ca_topic_score_codex":0.00012688378,"about_ca_topic_score_gemma":0.0014652915,"teacher_disagreement_score":0.885737,"about_ca_system_score_codex":0.00079094054,"about_ca_system_score_gemma":0.00008562215,"threshold_uncertainty_score":0.99968165},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17547993,0.0013036615,0.6642432,0.047483243,0.0008869707,0.001816466,0.000097847194,0.0005743738,0.10811428],"genre_scores_gemma":[0.94005466,0.0010376151,0.056363262,0.0021779065,0.000051694293,0.00008669855,0.00003862166,0.00001478066,0.00017477309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966197,0.0009382829,0.0009181674,0.00048813503,0.00038361334,0.00065207115],"domain_scores_gemma":[0.99440515,0.0008068876,0.00041458552,0.003818584,0.00038541816,0.00016939016],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00086590816,0.00039582662,0.0004517647,0.00014141436,0.000479101,0.00025374148,0.0054915776,0.00019692592,0.0004791589],"category_scores_gemma":[0.00016779629,0.00033492874,0.00017580988,0.0015932696,0.00034244885,0.0004173287,0.0007246469,0.0008741823,0.00016741091],"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.000054013544,0.00065310136,0.0039435066,0.0000072494036,0.00007539251,0.0000028019656,0.0003502667,0.26855543,0.000058504913,0.5551875,0.057912692,0.11319948],"study_design_scores_gemma":[0.001147337,0.00007876984,0.016801953,0.00016337122,0.000016618173,0.000024895759,0.00005298907,0.9273637,0.00021674037,0.0017870546,0.051815033,0.00053152826],"about_ca_topic_score_codex":0.0000740464,"about_ca_topic_score_gemma":0.0013898277,"teacher_disagreement_score":0.7645747,"about_ca_system_score_codex":0.00041495243,"about_ca_system_score_gemma":0.00049550954,"threshold_uncertainty_score":0.9999103},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014597106,0.0031619503,0.9390663,0.0076856986,0.00036725053,0.0055292323,0.00019023856,0.0012465193,0.028155727],"genre_scores_gemma":[0.79797083,0.0006036633,0.19755712,0.00014071554,0.00018520236,0.0032065285,0.00015790442,0.000028631559,0.00014939114],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99510133,0.0007919799,0.0011614349,0.0009828807,0.00090586167,0.0010565011],"domain_scores_gemma":[0.99231046,0.00060158083,0.00048145058,0.0046902476,0.0014409414,0.00047529323],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.002280322,0.0005296565,0.0006025088,0.00028482525,0.0014431865,0.00083570136,0.005340911,0.00034854776,0.000016211507],"category_scores_gemma":[0.000093913965,0.000538484,0.00016834824,0.0011628243,0.00038471952,0.00094535504,0.0010744443,0.00066241005,0.0002189013],"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.000048201757,0.00028791808,0.00025997864,0.00022397528,0.00011568009,7.068454e-7,0.00019516454,0.011057798,0.00013195035,0.22111809,0.0032770378,0.7632835],"study_design_scores_gemma":[0.0015222095,0.00011560479,0.0016309952,0.00025158803,0.000067314264,0.00017604882,0.00022105148,0.9336385,0.00033635405,0.000403257,0.06103943,0.0005976564],"about_ca_topic_score_codex":0.00006630199,"about_ca_topic_score_gemma":0.00044395006,"teacher_disagreement_score":0.9225807,"about_ca_system_score_codex":0.0014344371,"about_ca_system_score_gemma":0.0008212096,"threshold_uncertainty_score":0.99985677},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08487624,0.007176418,0.797732,0.00073484174,0.0011937306,0.0011652706,0.00084146456,0.0018251097,0.104454935],"genre_scores_gemma":[0.9648917,0.0027488852,0.03144381,0.00005763214,0.000106434956,0.000089598245,0.00036268402,0.000040748746,0.0002585517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737483,0.00017021845,0.0010999999,0.00036208576,0.00033965064,0.0006532215],"domain_scores_gemma":[0.9971058,0.00014742502,0.00031918215,0.0018497385,0.00036841494,0.00020944297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027906144,0.00041071317,0.00079460285,0.0004251514,0.00021871361,0.00011708562,0.0012509133,0.00025424245,0.00021001497],"category_scores_gemma":[0.00003653247,0.0004745571,0.00024956366,0.0024956292,0.00015671877,0.00050147984,0.00012888125,0.00033149438,0.00009491984],"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.0000068467643,0.000096960415,0.0012705949,0.000027652904,0.0007320942,8.89759e-7,0.00008563712,0.9701742,0.00016171904,0.008639576,0.005228016,0.013575808],"study_design_scores_gemma":[0.0003730252,0.000019295865,0.0021551463,0.000076964054,0.0004890592,0.0000100494335,0.00013693186,0.962796,0.00019017862,0.00011213117,0.033179138,0.00046209103],"about_ca_topic_score_codex":0.00029377994,"about_ca_topic_score_gemma":0.0023717333,"teacher_disagreement_score":0.88001543,"about_ca_system_score_codex":0.00061283034,"about_ca_system_score_gemma":0.00011770757,"threshold_uncertainty_score":0.99977064},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053807583,0.000117125244,0.93416643,0.0056585036,0.0008006501,0.001609512,0.00036379328,0.00028429693,0.0031921004],"genre_scores_gemma":[0.8903282,0.000019497893,0.10816246,0.0009962366,0.00014748602,0.000090798,0.00010547287,0.000017208775,0.00013260516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690473,0.0003239715,0.0009826509,0.00062397064,0.00039277147,0.00077190716],"domain_scores_gemma":[0.9962718,0.00019185938,0.0005948188,0.0019184505,0.00073697325,0.00028611635],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063043274,0.00039937443,0.0005794004,0.00020008541,0.00049035857,0.00041433307,0.0034799958,0.00019167809,0.000020448793],"category_scores_gemma":[0.00005830138,0.0004333309,0.00021400927,0.0010832999,0.000056692512,0.0006872509,0.0004683571,0.0002032087,0.00008928975],"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.00038125084,0.002348217,0.00751702,0.001025423,0.0013368037,0.000004873579,0.0045160935,0.6580475,0.005751551,0.13198982,0.065830685,0.12125079],"study_design_scores_gemma":[0.0020584052,0.00010079693,0.0019101849,0.00023670783,0.0000887069,0.00002973269,0.00015849575,0.9363294,0.00031810335,0.00057337974,0.057598844,0.00059720076],"about_ca_topic_score_codex":0.00062788266,"about_ca_topic_score_gemma":0.0012300742,"teacher_disagreement_score":0.8365207,"about_ca_system_score_codex":0.00050243165,"about_ca_system_score_gemma":0.0002884335,"threshold_uncertainty_score":0.9998118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03040857,0.030415019,0.9173968,0.005536628,0.0008117994,0.003943943,0.00026768222,0.0006592772,0.010560318],"genre_scores_gemma":[0.8713656,0.012201615,0.11356179,0.0012062372,0.00026761985,0.00093003345,0.0002451161,0.000035807287,0.00018619248],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962318,0.00034620723,0.0011492134,0.0008717126,0.0003914151,0.001009667],"domain_scores_gemma":[0.9952838,0.00048469225,0.00054020394,0.0030817832,0.00027891004,0.00033060287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058694073,0.0005262227,0.0006938198,0.00020508775,0.0003358168,0.00034858895,0.0037183694,0.00033264977,0.000052765856],"category_scores_gemma":[0.000016768005,0.0005502377,0.00014517369,0.0019169878,0.0003036461,0.0009825916,0.0011417737,0.0007531129,0.000039939132],"study_design_candidate":"design_other","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.0000314674,0.0007841834,0.00469251,0.000049723632,0.00010127192,0.0000048707107,0.0008215459,0.07580622,0.00006241765,0.008114052,0.0064829667,0.90304875],"study_design_scores_gemma":[0.001503073,0.00016518906,0.0074269194,0.00018532906,0.00006446778,0.00010148382,0.00021940444,0.47304568,0.000059981063,0.0028983757,0.51330495,0.0010251405],"about_ca_topic_score_codex":0.0001404811,"about_ca_topic_score_gemma":0.0107904235,"teacher_disagreement_score":0.9020236,"about_ca_system_score_codex":0.00029432584,"about_ca_system_score_gemma":0.0004245983,"threshold_uncertainty_score":0.9996949},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18590124,0.0038887458,0.7872287,0.0026094648,0.00014021063,0.0016333285,0.0014856643,0.0016662296,0.015446429],"genre_scores_gemma":[0.91995394,0.0023722078,0.07677442,0.00016538044,0.000029317735,0.00030805072,0.000298535,0.000025421781,0.0000727513],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798775,0.000113629845,0.0008691831,0.00036309302,0.00022332577,0.00044304508],"domain_scores_gemma":[0.9971912,0.00019109105,0.00023785392,0.0016770582,0.00045484837,0.00024793617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031941268,0.00033789774,0.0005883289,0.00044365934,0.00027039603,0.00007032176,0.0013573291,0.00019202117,0.000104974926],"category_scores_gemma":[0.00007422454,0.00040475957,0.00014502252,0.0015843681,0.00015957128,0.0003896837,0.00028216187,0.00028974115,0.000033149936],"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.00009452238,0.0009392293,0.006632981,0.00018376339,0.0030446728,8.7458517e-7,0.0008064642,0.2089448,0.12531239,0.2604032,0.011250434,0.38238668],"study_design_scores_gemma":[0.00038916472,0.00004024483,0.005442844,0.000050830597,0.00033456122,0.000009244586,0.00010692344,0.9438193,0.01330991,0.0007914646,0.035109136,0.0005963882],"about_ca_topic_score_codex":0.00016272624,"about_ca_topic_score_gemma":0.00357605,"teacher_disagreement_score":0.7348745,"about_ca_system_score_codex":0.00048022525,"about_ca_system_score_gemma":0.00009478299,"threshold_uncertainty_score":0.99984044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6038374,0.006039025,0.2008738,0.00467293,0.0010641784,0.0032062468,0.00059499027,0.006588674,0.17312276],"genre_scores_gemma":[0.93657434,0.0027842328,0.059916157,0.00017075808,0.000039527265,0.00019578994,0.00014104584,0.00005376994,0.00012435087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711955,0.00036074573,0.001227181,0.0003671516,0.00021976039,0.0007056088],"domain_scores_gemma":[0.997179,0.00024580632,0.00032146534,0.0017925064,0.00025969223,0.0002015796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059541326,0.00045348087,0.00062692957,0.00040267728,0.0002506212,0.00007634357,0.0018461323,0.00032403207,0.00024129538],"category_scores_gemma":[0.00010883508,0.0005607019,0.00013149706,0.0012444605,0.00022535633,0.0007720743,0.00025501536,0.0008546045,0.00009414693],"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.00014824147,0.0019382642,0.0130397845,0.00033574965,0.00051947054,0.000008580081,0.0018873403,0.47323802,0.042680565,0.102056265,0.042968556,0.32117915],"study_design_scores_gemma":[0.003142341,0.0002118966,0.013628418,0.00084365613,0.00011018007,0.000116128045,0.0009176788,0.76785105,0.044050336,0.011118098,0.15567133,0.002338863],"about_ca_topic_score_codex":0.0002995137,"about_ca_topic_score_gemma":0.003088614,"teacher_disagreement_score":0.33273697,"about_ca_system_score_codex":0.00089309976,"about_ca_system_score_gemma":0.000209118,"threshold_uncertainty_score":0.99968445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08175982,0.0023237707,0.7878685,0.0055763205,0.00085460744,0.0044922414,0.0007700965,0.0051338314,0.11122083],"genre_scores_gemma":[0.8337271,0.001795127,0.163144,0.00015567357,0.00006098076,0.00057803694,0.0003121991,0.00005541025,0.00017141554],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997353,0.00018766453,0.0010069414,0.00042754057,0.00024771006,0.0007771344],"domain_scores_gemma":[0.9969029,0.00024866482,0.00024092986,0.0021162578,0.00029773757,0.00019353512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041860086,0.0004677381,0.0005290476,0.0003663395,0.00037655237,0.00014255127,0.0018769782,0.0002660509,0.00008973331],"category_scores_gemma":[0.00009623001,0.0005851444,0.00014334977,0.00092192885,0.0001558503,0.0008175199,0.00017332268,0.00053328736,0.00009010598],"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.00010463771,0.0009381037,0.001571358,0.000111159454,0.00020898454,0.000002370072,0.00047025405,0.34947163,0.006895821,0.03397107,0.027270919,0.5789837],"study_design_scores_gemma":[0.002249595,0.00015910316,0.011482852,0.00028442542,0.000058321806,0.0000321393,0.0003680766,0.85447353,0.0027497122,0.0057196193,0.12107034,0.0013522774],"about_ca_topic_score_codex":0.00013777053,"about_ca_topic_score_gemma":0.0026175226,"teacher_disagreement_score":0.7519673,"about_ca_system_score_codex":0.0016118493,"about_ca_system_score_gemma":0.00013820919,"threshold_uncertainty_score":0.99966},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14238617,0.0008440465,0.85091203,0.0009584735,0.00023721615,0.0006084065,0.00007762565,0.00043938568,0.0035366574],"genre_scores_gemma":[0.81289095,0.0017873087,0.18504134,0.000111974696,0.000028634566,0.00004240938,0.00005557439,0.000010766583,0.000031054034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724877,0.00028046418,0.001009412,0.0005462369,0.00030416902,0.00061095064],"domain_scores_gemma":[0.9969516,0.00025236097,0.0005179244,0.0018645112,0.00023351503,0.00018010284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005329327,0.00033609278,0.000562664,0.00023018416,0.00035203667,0.0002011696,0.002395648,0.00020238289,0.00002371775],"category_scores_gemma":[0.000096819545,0.00036235247,0.000067415036,0.00078552455,0.00022880285,0.0016991195,0.00092694175,0.00049362873,0.000015238351],"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.00010049474,0.0011706338,0.16875131,0.00009338962,0.00006488934,0.0000035987327,0.0008752122,0.030975925,0.0043596616,0.049559653,0.019303229,0.724742],"study_design_scores_gemma":[0.0008041868,0.000079865094,0.018825557,0.00026998387,0.000009710998,0.000024385308,0.000104747574,0.96779877,0.0027883523,0.000648409,0.008249112,0.0003969205],"about_ca_topic_score_codex":0.00017884791,"about_ca_topic_score_gemma":0.001268217,"teacher_disagreement_score":0.93682283,"about_ca_system_score_codex":0.00032085943,"about_ca_system_score_gemma":0.00012948134,"threshold_uncertainty_score":0.9998828},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036500886,0.00019556997,0.93647724,0.007646608,0.0003266166,0.00048943516,0.000022365526,0.00042658197,0.017914709],"genre_scores_gemma":[0.9535692,0.0004635026,0.04367183,0.0015805252,0.00008481232,0.00018795533,0.00008360409,0.000020245408,0.00033836276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996327,0.000451505,0.0009063973,0.00058134133,0.0006515971,0.0010821837],"domain_scores_gemma":[0.9959156,0.00023340955,0.00051627395,0.0025847508,0.00051254826,0.00023740075],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005997866,0.00052395754,0.0004593244,0.00029830408,0.000876473,0.00067173346,0.0032965236,0.00031384933,0.000017552427],"category_scores_gemma":[0.000018214163,0.00043071582,0.00013315163,0.0024540797,0.0003121061,0.0009992503,0.0004951206,0.0006387899,0.00005769556],"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.000032467557,0.0002532204,0.000113464106,0.0000033187418,0.000030350348,0.0000018293557,0.0002260487,0.89275926,0.000013729183,0.07018202,0.0076324465,0.028751865],"study_design_scores_gemma":[0.00092245254,0.00006306512,0.0005640807,0.000058809903,0.00002076437,0.00007688154,0.0001177994,0.98164153,0.000112707596,0.00012869632,0.01578129,0.0005119097],"about_ca_topic_score_codex":0.000789813,"about_ca_topic_score_gemma":0.009568667,"teacher_disagreement_score":0.9170683,"about_ca_system_score_codex":0.0009496606,"about_ca_system_score_gemma":0.00056245073,"threshold_uncertainty_score":0.99981445},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039914604,0.0040525533,0.85110897,0.018230285,0.0009284449,0.0065835775,0.0033844658,0.012332656,0.06346447],"genre_scores_gemma":[0.7791188,0.0011748204,0.21657093,0.00051120523,0.0001402422,0.0007516534,0.0011418408,0.00009885002,0.00049171486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966459,0.00027910242,0.001183602,0.00054743903,0.00037864508,0.0009652935],"domain_scores_gemma":[0.99465275,0.0004998474,0.00036093703,0.0035578834,0.0005897512,0.00033885284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004961333,0.0006881227,0.00070683804,0.00029295794,0.0005931302,0.00023276753,0.002644498,0.0004637899,0.00033117554],"category_scores_gemma":[0.00019941699,0.00080481684,0.00027957614,0.00085622666,0.00028440115,0.00062696246,0.00022827437,0.00056014094,0.00041528977],"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.00022159744,0.001919276,0.00050264236,0.00035127308,0.00062417914,0.0000036103309,0.00058798905,0.46016562,0.023094703,0.07162799,0.24315837,0.19774275],"study_design_scores_gemma":[0.0016970519,0.00009666914,0.00027849752,0.00016194521,0.00009842966,0.000021140113,0.000051302737,0.63225096,0.020570729,0.0031189662,0.34048384,0.0011704459],"about_ca_topic_score_codex":0.00006180077,"about_ca_topic_score_gemma":0.0006264097,"teacher_disagreement_score":0.73920417,"about_ca_system_score_codex":0.00094004744,"about_ca_system_score_gemma":0.00029639126,"threshold_uncertainty_score":0.99944025},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.104978755,0.0066164294,0.77219534,0.0059667216,0.0016142112,0.002286661,0.00031791956,0.0074942023,0.098529756],"genre_scores_gemma":[0.9412023,0.0029561776,0.05494262,0.00029045204,0.00015246327,0.00022615801,0.0000721309,0.000056644247,0.00010110105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665946,0.00013940223,0.0010311314,0.000513617,0.00027228743,0.0013840962],"domain_scores_gemma":[0.9971534,0.000287829,0.00014479274,0.001993181,0.00017506866,0.00024571683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003225925,0.0005982781,0.0007223259,0.00021509686,0.00025734538,0.00015989477,0.0020920588,0.0005416503,0.00014961547],"category_scores_gemma":[0.000107596345,0.00066762476,0.00015347553,0.0011409011,0.0003294272,0.0005779147,0.00026990447,0.0011793175,0.00024349196],"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.000031012176,0.00023326754,0.0021085963,0.00002154025,0.00012773409,0.000012728061,0.00005040198,0.71035504,0.00008638902,0.030037789,0.0073495554,0.24958593],"study_design_scores_gemma":[0.0015912798,0.00003476361,0.0037716532,0.00011543719,0.000039241262,0.00003736337,0.00014468955,0.93723446,0.00005424539,0.0027458335,0.053438555,0.00079250627],"about_ca_topic_score_codex":0.00008789014,"about_ca_topic_score_gemma":0.0037852046,"teacher_disagreement_score":0.8362235,"about_ca_system_score_codex":0.0009705316,"about_ca_system_score_gemma":0.000092567374,"threshold_uncertainty_score":0.9995775},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17123817,0.0061075604,0.77926934,0.019952707,0.00091827294,0.0022521794,0.00031476837,0.0005188265,0.019428197],"genre_scores_gemma":[0.93720734,0.009242385,0.05136637,0.001213617,0.000057952857,0.00023383503,0.00009665029,0.000016291528,0.00056555896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99680907,0.0005129472,0.0010076571,0.00059289316,0.0003724302,0.00070501404],"domain_scores_gemma":[0.99337405,0.00037525332,0.00058415695,0.0042895763,0.0011835024,0.00019343385],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00074567285,0.0004261906,0.000702061,0.00021835281,0.001242341,0.0002905186,0.0065339413,0.00017970687,0.000097435935],"category_scores_gemma":[0.000080169644,0.00036398164,0.00042515824,0.003616246,0.0004098561,0.00071487937,0.0011817106,0.0004966991,0.00003112486],"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.00009610608,0.0012797534,0.00912581,0.00003643105,0.0022808781,5.606724e-7,0.0013563633,0.13173848,0.0007764582,0.1418906,0.03652927,0.67488927],"study_design_scores_gemma":[0.0006136397,0.000060242164,0.011854962,0.00007126478,0.00018983477,0.0000056800013,0.000052390107,0.905706,0.00031359974,0.000059224156,0.080666825,0.00040637824],"about_ca_topic_score_codex":0.000018598259,"about_ca_topic_score_gemma":0.002848239,"teacher_disagreement_score":0.77396744,"about_ca_system_score_codex":0.0003855017,"about_ca_system_score_gemma":0.00051297515,"threshold_uncertainty_score":0.9998812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005754035,0.0004377677,0.9503406,0.022687307,0.00091468403,0.0014056724,0.00020334986,0.00064110773,0.01761545],"genre_scores_gemma":[0.86576724,0.00027029705,0.12892044,0.0024868168,0.00019600095,0.0005092162,0.0001598107,0.000020386138,0.0016697646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968033,0.00022022126,0.00081442215,0.00077254564,0.00047083374,0.00091866584],"domain_scores_gemma":[0.99618834,0.00018713257,0.00034556497,0.002363201,0.0006018859,0.00031387364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047461546,0.00045651285,0.0004305971,0.00015968185,0.0007182444,0.00048785293,0.0036292446,0.00020045499,0.0000809927],"category_scores_gemma":[0.000021835405,0.0004748891,0.0002165999,0.0008202193,0.00008714304,0.00041258862,0.00050042744,0.00027673077,0.00044133054],"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.00003319412,0.0006974737,0.00009720861,0.000034721597,0.00018322104,0.0000019400045,0.00016885101,0.019605936,0.000033538094,0.3052239,0.05030944,0.62361056],"study_design_scores_gemma":[0.0019502223,0.000059024398,0.002971039,0.00006274551,0.000092031296,0.00002351708,0.000051376763,0.793591,0.000049899154,0.0017503265,0.1988231,0.00057567476],"about_ca_topic_score_codex":0.0000923825,"about_ca_topic_score_gemma":0.00186728,"teacher_disagreement_score":0.86001325,"about_ca_system_score_codex":0.0004765392,"about_ca_system_score_gemma":0.0002541883,"threshold_uncertainty_score":0.9997703},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030625893,0.0005851629,0.89821064,0.01649925,0.00084615115,0.0023006075,0.00031104614,0.0034968148,0.047124404],"genre_scores_gemma":[0.76050425,0.00013855149,0.23678944,0.0016544865,0.000084102,0.0003873507,0.00019423799,0.00002666201,0.0002209031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949431,0.0008599815,0.0012477523,0.0010233038,0.00082667364,0.0010992306],"domain_scores_gemma":[0.991072,0.000535022,0.0006080636,0.0061752056,0.0010470527,0.00056262914],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016437095,0.0006571777,0.0007797992,0.00034142716,0.0012007963,0.00083542254,0.007176801,0.00041011773,0.00007608707],"category_scores_gemma":[0.00021645486,0.00075068075,0.00021816645,0.0015083372,0.00037184072,0.0007761139,0.0013586972,0.00085519894,0.00086549454],"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.0001009558,0.0022272582,0.0038058646,0.00008329588,0.00021272035,0.000006853755,0.0007009415,0.011543095,0.0019434823,0.68322855,0.25323045,0.042916503],"study_design_scores_gemma":[0.0029891965,0.00037422037,0.019739117,0.0007983257,0.00016896921,0.00027781536,0.0005605124,0.6808741,0.01012477,0.014034071,0.26617244,0.003886447],"about_ca_topic_score_codex":0.0012013195,"about_ca_topic_score_gemma":0.004952099,"teacher_disagreement_score":0.72987837,"about_ca_system_score_codex":0.0014146795,"about_ca_system_score_gemma":0.0010246082,"threshold_uncertainty_score":0.99991244},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6887346,0.006566726,0.06587044,0.005925048,0.0045419643,0.008837756,0.0018772817,0.0071444893,0.21050169],"genre_scores_gemma":[0.97938865,0.0008520926,0.016869647,0.0006917522,0.0004005792,0.0010104422,0.00026521052,0.000083788174,0.00043783087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99582344,0.0001907357,0.0012269254,0.0007396968,0.00054359634,0.0014756061],"domain_scores_gemma":[0.9959657,0.00013970847,0.00015149121,0.002807936,0.0002750121,0.0006601193],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062010996,0.0007641346,0.0008005215,0.00021219291,0.0005015203,0.00020609809,0.0024674041,0.00045199678,0.0006757674],"category_scores_gemma":[0.00003756381,0.0009015468,0.00031639863,0.0011521179,0.0002113439,0.0005678041,0.00017755556,0.0009092415,0.0010784798],"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.00012168946,0.0014140331,0.0022721174,0.00020545271,0.00049356755,0.000019673433,0.0013184056,0.50415754,0.0005432452,0.0082239015,0.10508351,0.37614688],"study_design_scores_gemma":[0.001742573,0.00011249611,0.0051271794,0.0001663588,0.00020165929,0.00009590287,0.00028467536,0.14343561,0.000460942,0.00064409437,0.8459726,0.0017559004],"about_ca_topic_score_codex":0.00019469523,"about_ca_topic_score_gemma":0.011194951,"teacher_disagreement_score":0.7408891,"about_ca_system_score_codex":0.0010739753,"about_ca_system_score_gemma":0.00027679582,"threshold_uncertainty_score":0.9996993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9420589,0.00090908294,0.0019240788,0.0026125251,0.0006078524,0.0016356326,0.0021025506,0.0002607473,0.047888584],"genre_scores_gemma":[0.9942619,0.00041523244,0.004740781,0.000054715532,0.000051792962,0.00024074095,0.00011822114,0.000018452072,0.00009812184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967459,0.00049201347,0.0012600868,0.0004157806,0.00053710345,0.0005491272],"domain_scores_gemma":[0.9959006,0.00032550175,0.00033664334,0.0029388282,0.00036047277,0.00013797257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085839257,0.0003813961,0.0007360781,0.00047032113,0.00013728168,0.000055141216,0.002335294,0.00023480851,0.0004946647],"category_scores_gemma":[0.00029580278,0.00034364645,0.0003087573,0.0028096237,0.00042990656,0.00033300355,0.0001193675,0.0005007542,0.00004527282],"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.00010220844,0.0024681585,0.025791977,0.00022599625,0.0019161522,0.0000030306378,0.0036022041,0.886995,0.002213696,0.02317333,0.034548465,0.018959748],"study_design_scores_gemma":[0.0034906105,0.00068336487,0.20475857,0.0009765413,0.0026505063,0.00007323698,0.0030332627,0.6745684,0.014114015,0.01663343,0.07572761,0.0032904667],"about_ca_topic_score_codex":0.0008279401,"about_ca_topic_score_gemma":0.0051388335,"teacher_disagreement_score":0.21242665,"about_ca_system_score_codex":0.00045312775,"about_ca_system_score_gemma":0.00023243186,"threshold_uncertainty_score":0.99990153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02410904,0.001617483,0.69458294,0.076220155,0.001318899,0.0014315498,0.0005047379,0.0025331532,0.19768205],"genre_scores_gemma":[0.9340465,0.001995859,0.05969044,0.0019622853,0.0001697466,0.00012314848,0.000237722,0.000024741401,0.0017495265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966537,0.00055452815,0.00076714804,0.00070037955,0.0004368823,0.0008873916],"domain_scores_gemma":[0.9940204,0.00034019907,0.00031656507,0.004494846,0.0004393476,0.0003886495],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000543355,0.0005020528,0.00049604854,0.00017989732,0.0010429632,0.0006925479,0.0057185395,0.00017214713,0.0005335763],"category_scores_gemma":[0.00015371526,0.0005263648,0.00020554572,0.0012590449,0.00021142953,0.00087120757,0.0012860593,0.0006168733,0.002478251],"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.00003143532,0.0009657928,0.00016254814,0.00001040657,0.00015376054,0.000007828577,0.00032021845,0.0055619716,0.0013279394,0.41789722,0.3137752,0.25978568],"study_design_scores_gemma":[0.0012749464,0.00017534735,0.003094707,0.00017653189,0.000031053543,0.00008645906,0.000031658074,0.29285884,0.0010681326,0.0042500324,0.6958149,0.0011373593],"about_ca_topic_score_codex":0.00003775183,"about_ca_topic_score_gemma":0.0005175264,"teacher_disagreement_score":0.9099375,"about_ca_system_score_codex":0.00068641757,"about_ca_system_score_gemma":0.00035436702,"threshold_uncertainty_score":0.9997188},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15233289,0.0015824194,0.8119294,0.0088808965,0.0006659274,0.0009913695,0.000058271806,0.00061789976,0.022940919],"genre_scores_gemma":[0.9443505,0.0029201426,0.051097136,0.0011712904,0.00010617146,0.00003722632,0.000043834858,0.000018386014,0.0002553512],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99576277,0.0011725738,0.0008961551,0.0007713165,0.00040908527,0.0009880865],"domain_scores_gemma":[0.9955698,0.0002838172,0.00037189713,0.0028824876,0.00057043025,0.00032153272],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00087278784,0.0005172084,0.00061972305,0.00024342361,0.0019883513,0.0006446816,0.0046786354,0.00023825534,0.00013007643],"category_scores_gemma":[0.00006481004,0.0005675078,0.0001653664,0.0019147315,0.0003394008,0.0014785682,0.0032320493,0.000875786,0.00008146493],"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.0000892986,0.002362123,0.021294687,0.000030984695,0.00036748798,0.000059978127,0.0034335426,0.15721084,0.0012737478,0.2258683,0.020907605,0.5671014],"study_design_scores_gemma":[0.0011169518,0.000042280033,0.00777103,0.00016416454,0.000027688535,0.00006318561,0.00016935535,0.97418815,0.00021740742,0.0002737422,0.015173646,0.00079241814],"about_ca_topic_score_codex":0.00033906646,"about_ca_topic_score_gemma":0.00695991,"teacher_disagreement_score":0.81697726,"about_ca_system_score_codex":0.0011555263,"about_ca_system_score_gemma":0.00049367564,"threshold_uncertainty_score":0.99967766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003412089,0.0014897516,0.98350996,0.001263376,0.001163413,0.0013648288,0.0003063493,0.0012932596,0.0061969454],"genre_scores_gemma":[0.9272644,0.003033514,0.06715282,0.0003781421,0.00061663217,0.0005333462,0.00063913036,0.00009000764,0.0002920356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711776,0.00015488738,0.0009371032,0.0005162248,0.0002700999,0.0010039544],"domain_scores_gemma":[0.9972666,0.00027467337,0.00026473816,0.001359891,0.0004543202,0.00037981017],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003320568,0.0005687528,0.0006161152,0.00014470414,0.0005945424,0.0001823295,0.00105246,0.00045039027,0.00019180393],"category_scores_gemma":[0.00005512241,0.000646062,0.00021468593,0.0006550168,0.00014678796,0.0006652264,0.00008295925,0.00048877596,0.00008605223],"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.000047213805,0.00013185707,0.00012481572,0.000020250325,0.00010736491,7.229769e-7,0.000028767266,0.81646335,0.00012903886,0.0036269154,0.028119175,0.15120055],"study_design_scores_gemma":[0.0019207856,0.00006732186,0.00024444333,0.000085368265,0.0000816964,0.000030294475,0.000056559013,0.89389825,0.00024450273,0.00054468197,0.10220956,0.00061655],"about_ca_topic_score_codex":0.000040788193,"about_ca_topic_score_gemma":0.0006969158,"teacher_disagreement_score":0.92385226,"about_ca_system_score_codex":0.00082107243,"about_ca_system_score_gemma":0.00015524212,"threshold_uncertainty_score":0.99959904},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.341227,0.0023112705,0.5764296,0.014702018,0.0011987743,0.0011329846,0.00037114558,0.0010840981,0.061543144],"genre_scores_gemma":[0.93901366,0.0007753018,0.059336837,0.00042926386,0.00008117951,0.00004896581,0.000059258175,0.000008290417,0.00024724152],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660385,0.0005183065,0.0010720452,0.0006757974,0.00049835135,0.0006316745],"domain_scores_gemma":[0.9950509,0.00021816962,0.00049858884,0.0033984636,0.00056919374,0.0002646769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008873515,0.00035461813,0.0006937186,0.00037193828,0.0005074611,0.00024804936,0.003476694,0.00026255578,0.0007147566],"category_scores_gemma":[0.000105049694,0.0003693017,0.00044267753,0.0036048554,0.00031725806,0.0010222747,0.00052595924,0.00048499857,0.00018022831],"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.000069221795,0.0024504836,0.005435245,0.000040633284,0.0017869205,0.000002967418,0.00078103045,0.016786193,0.00057309645,0.23468916,0.034820117,0.70256495],"study_design_scores_gemma":[0.0008413163,0.00016102003,0.02191002,0.000046065932,0.0004758594,0.000028099234,0.0000850519,0.6941031,0.002284388,0.0063597,0.27290565,0.00079970923],"about_ca_topic_score_codex":0.00043019856,"about_ca_topic_score_gemma":0.0046945307,"teacher_disagreement_score":0.70176524,"about_ca_system_score_codex":0.00033703394,"about_ca_system_score_gemma":0.00032003934,"threshold_uncertainty_score":0.9998759},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6106609,0.0017236839,0.37469503,0.00031662153,0.0007614304,0.00095473917,0.00020862314,0.00087105465,0.009807913],"genre_scores_gemma":[0.96942776,0.00062605663,0.029402748,0.00008788694,0.0001646222,0.00006479153,0.0001054028,0.000046118916,0.00007459838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997237,0.00026812984,0.0008660256,0.0004954786,0.00026330494,0.00087004126],"domain_scores_gemma":[0.9977292,0.000117082054,0.00017198245,0.0013900098,0.0002078464,0.00038388013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051208347,0.00051643536,0.0005365315,0.00016221305,0.0005706436,0.00027790916,0.0008674847,0.00040235912,0.000059012204],"category_scores_gemma":[0.000048835307,0.00058402674,0.00014176506,0.000567871,0.00029062794,0.0006472597,0.0001669662,0.0005876712,0.000033469787],"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.00004836728,0.00028692716,0.0022330298,0.000090096204,0.00035885753,0.000010832889,0.0005441163,0.77987266,0.0067165145,0.04191193,0.000573539,0.16735315],"study_design_scores_gemma":[0.00074866106,0.00002379488,0.0030776346,0.00012735164,0.00006919851,0.00013924671,0.00014402717,0.99131644,0.00027578702,0.00055668264,0.0028963892,0.00062477234],"about_ca_topic_score_codex":0.0002328207,"about_ca_topic_score_gemma":0.00071673194,"teacher_disagreement_score":0.35876685,"about_ca_system_score_codex":0.0004916627,"about_ca_system_score_gemma":0.00013030457,"threshold_uncertainty_score":0.9996611},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12115262,0.001383344,0.85264134,0.005848751,0.0011761273,0.0009725785,0.0000630492,0.0009595037,0.01580271],"genre_scores_gemma":[0.7922203,0.0012045248,0.20420232,0.0013625291,0.00018905089,0.00013987352,0.00008995806,0.000043212316,0.000548223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99379724,0.00072753825,0.0015167249,0.0012995716,0.0007535139,0.0019053989],"domain_scores_gemma":[0.9941426,0.00030967957,0.00052260974,0.004076256,0.00039808016,0.00055078417],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00076434534,0.00080739864,0.00081224553,0.00031120636,0.00059405225,0.00060748856,0.0055929204,0.00054019067,0.00015113832],"category_scores_gemma":[0.000039736864,0.00088959234,0.00027625513,0.0016178292,0.00035936182,0.0006634085,0.0012184288,0.0010091845,0.00036262072],"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.000038500006,0.00068079453,0.00060365227,0.000006994037,0.00006945165,0.000042837637,0.00012768594,0.9615576,0.000057522982,0.007407601,0.0068949894,0.02251235],"study_design_scores_gemma":[0.0013943873,0.0001106002,0.0005863921,0.00013724178,0.000025793428,0.00023834623,0.00006277973,0.9634396,0.00030054976,0.00003525015,0.032742843,0.00092625176],"about_ca_topic_score_codex":0.0003719243,"about_ca_topic_score_gemma":0.004370521,"teacher_disagreement_score":0.67106766,"about_ca_system_score_codex":0.0012773769,"about_ca_system_score_gemma":0.0004949612,"threshold_uncertainty_score":0.9997873},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11632382,0.015865304,0.54564667,0.0737399,0.0014670686,0.007937591,0.0026796444,0.0072463965,0.22909358],"genre_scores_gemma":[0.7190179,0.0028369008,0.2755969,0.00026939058,0.000048031918,0.0014362553,0.0006435422,0.00005512206,0.00009597283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649554,0.0002758898,0.001357454,0.00048808835,0.00025422196,0.0011288218],"domain_scores_gemma":[0.99263054,0.00045807232,0.00025972008,0.0060933167,0.0003349169,0.00022341157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071140734,0.00057277235,0.0006439359,0.0005145107,0.0007267321,0.00018073252,0.005251226,0.00053566165,0.00011164671],"category_scores_gemma":[0.00017968964,0.0006940255,0.00021391909,0.001358318,0.0005105688,0.0007204691,0.000445474,0.00088084687,0.00033940334],"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.000048816182,0.0024353184,0.0022582756,0.0001541904,0.0005043883,0.0000033708523,0.0016476217,0.044051267,0.0035644148,0.6673931,0.063685454,0.2142538],"study_design_scores_gemma":[0.0039842054,0.00016456796,0.0042707305,0.0003529293,0.00016728269,0.00016575785,0.00096134574,0.5492945,0.0012511462,0.18719186,0.24992816,0.002267567],"about_ca_topic_score_codex":0.00039888296,"about_ca_topic_score_gemma":0.016710114,"teacher_disagreement_score":0.6026941,"about_ca_system_score_codex":0.0012516078,"about_ca_system_score_gemma":0.00030340158,"threshold_uncertainty_score":0.9995511},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002654138,0.0018072807,0.98039544,0.0010114,0.0006225568,0.0014002004,0.0009542547,0.0013347531,0.009819991],"genre_scores_gemma":[0.5214986,0.0028763688,0.47203666,0.0003847955,0.00035136828,0.0005639809,0.0015819513,0.00010371832,0.00060256507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971357,0.0001591516,0.0009797339,0.0004800309,0.00029034232,0.0009550185],"domain_scores_gemma":[0.99736327,0.00026101968,0.0002882694,0.0012967568,0.0004979263,0.00029276326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031788633,0.0005421606,0.0005713121,0.0001868428,0.0004906719,0.00020770852,0.00096389116,0.00030763072,0.00018346062],"category_scores_gemma":[0.00007017591,0.000641409,0.00018047878,0.0007378069,0.00013931564,0.00087116373,0.000079390615,0.00039061176,0.00018135819],"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.000022781502,0.00012975655,0.00003972857,0.00001906996,0.000115596005,0.0000014552365,0.000072342664,0.551084,0.00011883648,0.0028361168,0.019680286,0.42588004],"study_design_scores_gemma":[0.0019646455,0.000049517505,0.000098036784,0.000083150175,0.000074852585,0.000019036881,0.000082358754,0.89298433,0.0005417658,0.0010895699,0.10240802,0.0006047403],"about_ca_topic_score_codex":0.00014702987,"about_ca_topic_score_gemma":0.0019062695,"teacher_disagreement_score":0.5188444,"about_ca_system_score_codex":0.00094493595,"about_ca_system_score_gemma":0.00021920411,"threshold_uncertainty_score":0.99960375},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019718497,0.00002966941,0.89745975,0.0036889461,0.00014171805,0.09108596,0.00014264362,0.0011763758,0.004303114],"genre_scores_gemma":[0.37159336,0.000029487464,0.4494542,0.0004433013,0.00009692706,0.1780817,0.00009885172,0.00002743435,0.00017475607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99538696,0.00039301135,0.0011810064,0.0012287872,0.0007448239,0.0010654103],"domain_scores_gemma":[0.9931788,0.00020046621,0.0010082757,0.0037430297,0.001458681,0.00041079137],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009041823,0.00064284453,0.00056676194,0.00022527628,0.0010729088,0.0010893446,0.0054656267,0.00029296085,0.00013613187],"category_scores_gemma":[0.00007216324,0.0006314573,0.00019884792,0.0012623149,0.00026774753,0.0048990864,0.00060346175,0.00045642236,0.0003822251],"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.00014160696,0.0024697466,0.0018516952,0.00042213302,0.0001755884,0.000002123307,0.0009784653,0.00032675118,0.00050869357,0.9376541,0.00094966526,0.05451947],"study_design_scores_gemma":[0.0070180176,0.00076180836,0.012615423,0.00040767516,0.0001882288,0.0001933782,0.00026045542,0.45212606,0.0037033611,0.25433186,0.26598203,0.002411694],"about_ca_topic_score_codex":0.00010621906,"about_ca_topic_score_gemma":0.0032140294,"teacher_disagreement_score":0.6833222,"about_ca_system_score_codex":0.000800617,"about_ca_system_score_gemma":0.00096803275,"threshold_uncertainty_score":0.9999476},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06704803,0.0062803156,0.84605116,0.015021051,0.001064558,0.002409842,0.0008456673,0.0013643679,0.059914988],"genre_scores_gemma":[0.9384343,0.0018355486,0.05830269,0.00027856795,0.00007991707,0.0002283522,0.00024646398,0.00002687257,0.0005672946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99347883,0.0017981156,0.0017271268,0.0008970978,0.0008666293,0.0012321864],"domain_scores_gemma":[0.98823434,0.000828976,0.00089190464,0.008325448,0.001206712,0.00051262206],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017566957,0.00056706986,0.0011671631,0.0008253575,0.00070832355,0.0006723649,0.010849932,0.00037856254,0.00023852436],"category_scores_gemma":[0.00018084342,0.0005914696,0.0004311225,0.0048115053,0.00055420527,0.0011113893,0.001755401,0.0008269615,0.0004370802],"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.00007596722,0.0031336609,0.0069053657,0.000096256335,0.004329644,0.000013962532,0.0011665522,0.4608427,0.00094389386,0.32454446,0.041553102,0.15639442],"study_design_scores_gemma":[0.0007560463,0.000070262715,0.010810864,0.000066275206,0.00026319228,0.000023010705,0.0001400055,0.93748605,0.00014742595,0.00025232066,0.049393088,0.0005914839],"about_ca_topic_score_codex":0.0020085254,"about_ca_topic_score_gemma":0.0064607896,"teacher_disagreement_score":0.8713863,"about_ca_system_score_codex":0.00088007073,"about_ca_system_score_gemma":0.0009302329,"threshold_uncertainty_score":0.9996537},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06751761,0.028541563,0.26860675,0.107958026,0.0021768534,0.008642715,0.0047367387,0.015942818,0.4958769],"genre_scores_gemma":[0.73542047,0.0053963833,0.2556941,0.00058487867,0.000108862514,0.0014261431,0.0006405824,0.0000843473,0.00064421806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962824,0.00022763188,0.001301713,0.00054824643,0.00030277163,0.0013372678],"domain_scores_gemma":[0.98926085,0.00053106353,0.00027192628,0.009024088,0.00057076284,0.0003412862],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056655216,0.0006772689,0.00072453864,0.00036238384,0.0011970872,0.00026340768,0.007647347,0.0005861288,0.00028283146],"category_scores_gemma":[0.00020390857,0.0007987823,0.00034606116,0.0012044763,0.0007350973,0.00063122145,0.0008051966,0.0010003333,0.000821972],"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.000056083296,0.0018174876,0.0015843654,0.00010787343,0.0009507901,0.00000181654,0.00050070934,0.0044311993,0.00522844,0.37493664,0.36068836,0.24969625],"study_design_scores_gemma":[0.0012907716,0.00007467764,0.0006079282,0.0000850201,0.00011780562,0.00008884177,0.00022005972,0.09887849,0.0012088877,0.0060401233,0.8904512,0.0009362068],"about_ca_topic_score_codex":0.00017272086,"about_ca_topic_score_gemma":0.0054800743,"teacher_disagreement_score":0.6679029,"about_ca_system_score_codex":0.0009278266,"about_ca_system_score_gemma":0.00036774206,"threshold_uncertainty_score":0.999956},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045766827,0.0010959597,0.833104,0.03939743,0.0010474953,0.0015993916,0.0001465597,0.00173299,0.07610935],"genre_scores_gemma":[0.8223942,0.000750249,0.17457327,0.0012659746,0.00020071295,0.0002010551,0.00007014969,0.00003159791,0.0005128105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99412125,0.000989575,0.001269512,0.0010071086,0.0010362454,0.0015763325],"domain_scores_gemma":[0.9913202,0.00057601917,0.00046220253,0.006112052,0.0007849562,0.00074455014],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015521967,0.0005834238,0.0006075381,0.0003961159,0.0014613047,0.0011380858,0.0076744743,0.00032447604,0.0004786256],"category_scores_gemma":[0.00023213055,0.0006508075,0.00022817959,0.0023283,0.0002544618,0.0017178883,0.0023144763,0.0011231258,0.0018203883],"study_design_candidate":"design_other","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.00002312246,0.00037842887,0.007055023,0.000014615128,0.00014571528,0.0000068652125,0.00063424633,0.015412143,0.000685042,0.14770375,0.046469398,0.78147167],"study_design_scores_gemma":[0.0014189784,0.00016516162,0.047931783,0.00023557722,0.000046589037,0.00032306515,0.00025480893,0.6384144,0.00076867105,0.002793946,0.30600876,0.0016382758],"about_ca_topic_score_codex":0.0016478453,"about_ca_topic_score_gemma":0.011473862,"teacher_disagreement_score":0.7798334,"about_ca_system_score_codex":0.0015515975,"about_ca_system_score_gemma":0.000965674,"threshold_uncertainty_score":0.99989885},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21957122,0.008247483,0.7206076,0.017358908,0.0015867157,0.0020808012,0.00009659544,0.00089992164,0.029550795],"genre_scores_gemma":[0.8192417,0.004842594,0.17468162,0.00026013952,0.00024967027,0.00009867534,0.000092277034,0.000028985769,0.00050432305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948297,0.0008533216,0.0014120117,0.0008004573,0.00094831974,0.0011561543],"domain_scores_gemma":[0.9918131,0.0002351208,0.0007617364,0.0064295903,0.00032999154,0.00043045246],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013398293,0.0005638154,0.0006792226,0.00024471345,0.0008108951,0.00038876355,0.008759294,0.0004018083,0.00020262833],"category_scores_gemma":[0.000035784873,0.000593573,0.00023964488,0.0013471843,0.0005382286,0.0011356549,0.001994019,0.0011429689,0.00039700884],"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.000076564575,0.0017877541,0.0030380052,0.0000694342,0.00031930144,0.000011249014,0.0007423731,0.2102979,0.0012645993,0.0656907,0.033986762,0.68271536],"study_design_scores_gemma":[0.00083478424,0.0001178842,0.002916372,0.0001265075,0.000030503876,0.00007504706,0.00013410377,0.88739216,0.0022898042,0.00037967606,0.1050421,0.0006610379],"about_ca_topic_score_codex":0.00014617342,"about_ca_topic_score_gemma":0.00062638376,"teacher_disagreement_score":0.68205434,"about_ca_system_score_codex":0.00070575695,"about_ca_system_score_gemma":0.00055787154,"threshold_uncertainty_score":0.99965155},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22465187,0.0076203886,0.7576935,0.0004614051,0.0013824389,0.0019148382,0.00054151326,0.0012480862,0.004485912],"genre_scores_gemma":[0.9163439,0.0029066138,0.07975875,0.00007783641,0.00015272347,0.000207906,0.00026790006,0.00007802378,0.0002063459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746364,0.00009707476,0.00079908577,0.00052812917,0.00021874189,0.0008933494],"domain_scores_gemma":[0.99811786,0.00024351422,0.00022094071,0.0008069355,0.0002821481,0.00032857672],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002898283,0.000549108,0.00058723456,0.000223911,0.0005052869,0.0003623707,0.0005667922,0.0003918617,0.00005327421],"category_scores_gemma":[0.00004897533,0.0006319329,0.00009489865,0.0005759373,0.0001940803,0.00080532394,0.0001706523,0.00042318393,0.000023386767],"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.000037338486,0.00007600022,0.00037456784,0.000046100926,0.00018490365,0.000002824891,0.0002250149,0.9796525,0.00024423588,0.0031144267,0.0053167623,0.010725285],"study_design_scores_gemma":[0.0013418634,0.000081024125,0.0004082744,0.00016387715,0.00008526975,0.00013763676,0.00015210459,0.97555405,0.00010663616,0.00007560391,0.021227468,0.0006662186],"about_ca_topic_score_codex":0.000057268844,"about_ca_topic_score_gemma":0.000087434804,"teacher_disagreement_score":0.69169205,"about_ca_system_score_codex":0.00045242166,"about_ca_system_score_gemma":0.00007233211,"threshold_uncertainty_score":0.9996132},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37677172,0.013241823,0.47509527,0.0043626674,0.0017065216,0.009560456,0.0035536203,0.0044813813,0.11122653],"genre_scores_gemma":[0.9159792,0.0017424354,0.081273004,0.000027187825,0.000060848364,0.0005790009,0.00017844202,0.00004849147,0.00011137724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765587,0.0001729998,0.0010149588,0.00034209012,0.00025886192,0.000555212],"domain_scores_gemma":[0.9968859,0.00012523776,0.00030119828,0.0021044428,0.000446946,0.00013625355],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037341673,0.00038590774,0.00058332627,0.0002767492,0.00019588628,0.00006687191,0.0013907527,0.00026074392,0.000042185566],"category_scores_gemma":[0.00005728403,0.00041521818,0.00010890772,0.0007676322,0.0002365376,0.00069304317,0.00009320455,0.00044022375,0.000014602316],"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.0003584766,0.001754122,0.0094241155,0.0009487535,0.00096512923,0.000006249889,0.002681455,0.5975666,0.027556408,0.15683825,0.04687076,0.1550297],"study_design_scores_gemma":[0.00974493,0.0010561099,0.011571534,0.0049443827,0.00052597,0.0005935053,0.0063734255,0.5832817,0.04844143,0.013821072,0.31341612,0.006229827],"about_ca_topic_score_codex":0.00053198007,"about_ca_topic_score_gemma":0.0023708825,"teacher_disagreement_score":0.5392075,"about_ca_system_score_codex":0.0008791314,"about_ca_system_score_gemma":0.00021330563,"threshold_uncertainty_score":0.99982995},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5605433,0.0005755211,0.41419095,0.0009537147,0.00029321483,0.0014045382,0.00013118194,0.0024852413,0.019422345],"genre_scores_gemma":[0.91339916,0.0012663243,0.08463928,0.00004881383,0.00008203565,0.00024391335,0.000107815984,0.00006947818,0.00014317836],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971173,0.00020843689,0.00097290205,0.00050275953,0.00042307482,0.00077554665],"domain_scores_gemma":[0.9966485,0.00021822528,0.00023748797,0.002394479,0.00027226613,0.00022906368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026456555,0.0005813645,0.00060664583,0.00042452148,0.00038385144,0.00019821616,0.0016098873,0.0003588455,0.00025620847],"category_scores_gemma":[0.000045672525,0.0006223469,0.00013042253,0.0011441241,0.00019886249,0.0008961345,0.00024071924,0.0007643397,0.00032466694],"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.00016393317,0.0006560064,0.0019317281,0.00004714914,0.00019296641,0.0000051517063,0.00034260208,0.38131827,0.018887201,0.0055347774,0.003431741,0.5874885],"study_design_scores_gemma":[0.002482893,0.00013892466,0.016224243,0.00040002394,0.00007438134,0.00012251634,0.00013607505,0.92368805,0.018614022,0.0043864166,0.032153435,0.0015790331],"about_ca_topic_score_codex":0.0001391728,"about_ca_topic_score_gemma":0.0040957015,"teacher_disagreement_score":0.5859094,"about_ca_system_score_codex":0.0013065581,"about_ca_system_score_gemma":0.00013277863,"threshold_uncertainty_score":0.99962276},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4431237,0.0042857323,0.38887164,0.0053127636,0.0015504579,0.0037925877,0.0017362478,0.016268702,0.13505816],"genre_scores_gemma":[0.93998295,0.0024373862,0.05591244,0.00013989896,0.00015607575,0.00035786474,0.00029512166,0.00009940212,0.0006188605],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965953,0.00027389984,0.0010670074,0.00054469076,0.00043157025,0.0010875013],"domain_scores_gemma":[0.99488425,0.00027640743,0.00025868975,0.00385963,0.00030494833,0.00041609933],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002175096,0.00074980967,0.00073934253,0.00027585798,0.0005689807,0.00024141997,0.003253422,0.00043281558,0.0010479682],"category_scores_gemma":[0.00010235171,0.0008540351,0.0002848624,0.00075874955,0.00035363555,0.00072672195,0.00050464476,0.0008672932,0.0013832294],"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.00019581085,0.0024932644,0.0054051434,0.00022545495,0.0013001076,0.000014833014,0.0010698884,0.046130553,0.082632944,0.028726673,0.21375014,0.61805516],"study_design_scores_gemma":[0.0027110183,0.00018739753,0.0056093372,0.00029370474,0.00019790311,0.00012607384,0.0002669074,0.46528098,0.05255951,0.003033538,0.46655306,0.0031805693],"about_ca_topic_score_codex":0.00014083127,"about_ca_topic_score_gemma":0.0013887465,"teacher_disagreement_score":0.6148746,"about_ca_system_score_codex":0.00097551174,"about_ca_system_score_gemma":0.00015973428,"threshold_uncertainty_score":0.99986523},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4967344,0.0058404026,0.4123751,0.0025337092,0.0004521239,0.0018031312,0.0011076065,0.0030019379,0.07615159],"genre_scores_gemma":[0.9439326,0.0029817547,0.052402157,0.00013239584,0.000026474909,0.0001634458,0.00023853863,0.000036974885,0.00008567425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99689054,0.0002515432,0.0014362113,0.00041790435,0.0003141625,0.0006896306],"domain_scores_gemma":[0.99603933,0.00029092416,0.00035516592,0.0027555928,0.00037117666,0.00018779654],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000460948,0.00048072677,0.000918121,0.0008495097,0.00016365279,0.00008404544,0.0027442584,0.00029393303,0.0003430752],"category_scores_gemma":[0.000078909405,0.0005616479,0.000275538,0.003009001,0.00027373905,0.000588155,0.00034941445,0.0006816072,0.00007248042],"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.000089592795,0.0015687455,0.00955385,0.00015376208,0.0025648044,0.0000063831735,0.0022002691,0.7679817,0.019546442,0.038228214,0.010688278,0.14741796],"study_design_scores_gemma":[0.0017381782,0.00012930142,0.014017478,0.00053662836,0.0008726002,0.00002410474,0.0011339267,0.9118972,0.035369925,0.005106411,0.0270177,0.0021565396],"about_ca_topic_score_codex":0.00037172044,"about_ca_topic_score_gemma":0.006951769,"teacher_disagreement_score":0.44719818,"about_ca_system_score_codex":0.00072792394,"about_ca_system_score_gemma":0.00013279534,"threshold_uncertainty_score":0.9996835},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027048087,0.001869332,0.93520004,0.03825893,0.00046323639,0.0017085365,0.00025095386,0.0003105113,0.019233672],"genre_scores_gemma":[0.75342596,0.0012812534,0.24207838,0.00063887605,0.00018944798,0.00030875328,0.00007566424,0.000030184736,0.0019714986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995668,0.00066338386,0.0012473433,0.00072705996,0.0006552891,0.0010389024],"domain_scores_gemma":[0.9906315,0.0015117335,0.0006255015,0.005369145,0.0014823256,0.00037979608],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001204524,0.00048072924,0.000625226,0.00023844617,0.000785211,0.0005416886,0.010286429,0.00028275832,0.00019951919],"category_scores_gemma":[0.00038795092,0.0004207167,0.00033977797,0.0014235282,0.0005782253,0.0009723054,0.002138796,0.00078620453,0.00017898822],"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.00020604733,0.0010814524,0.0001054731,0.00002983077,0.00044824928,0.0000014014437,0.002251734,0.01045803,0.0007244067,0.2287878,0.25657368,0.4993319],"study_design_scores_gemma":[0.0034745373,0.00072500884,0.001862693,0.00037479223,0.000111131776,0.00008496902,0.0007980497,0.56864965,0.0038590878,0.00837839,0.41054434,0.0011373754],"about_ca_topic_score_codex":0.00069742335,"about_ca_topic_score_gemma":0.0030880931,"teacher_disagreement_score":0.75072116,"about_ca_system_score_codex":0.0006457826,"about_ca_system_score_gemma":0.0011595335,"threshold_uncertainty_score":0.99982446},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6287994,0.008528464,0.32261544,0.0026650736,0.00035863748,0.0048042093,0.00062067754,0.0014343573,0.030173782],"genre_scores_gemma":[0.9124646,0.0016598655,0.08505581,0.000059278012,0.000039370196,0.00046796972,0.00020402398,0.000031539093,0.000017547696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797785,0.0002116236,0.00083381654,0.00028226656,0.00030486245,0.00038956624],"domain_scores_gemma":[0.99780643,0.00020685002,0.00022397215,0.0012237881,0.00043881923,0.0001001458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009168753,0.0002927679,0.0003956263,0.00025112755,0.00015158359,0.00005016423,0.00074492214,0.00021477691,0.000059884296],"category_scores_gemma":[0.000092816466,0.00035367132,0.00008456073,0.00044890126,0.00014207738,0.000606094,0.00010565607,0.00028611376,0.0000077500135],"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.0000571682,0.0005331501,0.0012784963,0.00018109124,0.00016295262,3.3601887e-7,0.0007555407,0.499973,0.011877149,0.025117693,0.0029508322,0.45711258],"study_design_scores_gemma":[0.0011463474,0.00004087173,0.003922895,0.00017290644,0.000058354086,0.0000087304115,0.00015024083,0.9588561,0.007969749,0.023368882,0.0038727985,0.00043213693],"about_ca_topic_score_codex":0.00008798696,"about_ca_topic_score_gemma":0.0009728293,"teacher_disagreement_score":0.45888308,"about_ca_system_score_codex":0.0005133214,"about_ca_system_score_gemma":0.00014266459,"threshold_uncertainty_score":0.9998915},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37022382,0.0018280573,0.22095619,0.043201398,0.0020538552,0.0040351143,0.00053235696,0.0007871835,0.356382],"genre_scores_gemma":[0.99157435,0.00043639087,0.0071469587,0.00047516366,0.00006372011,0.00006494166,0.000015645424,0.000006629872,0.00021617948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751776,0.0004210167,0.0007027916,0.00036080542,0.00043345164,0.0005641506],"domain_scores_gemma":[0.9969271,0.00018581441,0.00040626407,0.0021043222,0.00028625393,0.00009026893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005999604,0.0002612236,0.0002851449,0.000080305166,0.00054812647,0.00033401017,0.004977391,0.00013879446,0.000049530812],"category_scores_gemma":[0.000032838758,0.00018126635,0.00013596352,0.001586939,0.00025384012,0.00063803105,0.00040112325,0.00052406336,0.00005284754],"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.000044767057,0.0014820967,0.007321514,0.000061544066,0.0001392023,0.0000069279313,0.0011747966,0.11544649,0.00022500756,0.34610844,0.04452901,0.48346022],"study_design_scores_gemma":[0.001002327,0.00016003246,0.022874543,0.00016570454,0.000030872183,0.00013230082,0.0004487238,0.90783983,0.0005717186,0.0024299312,0.063796766,0.0005472467],"about_ca_topic_score_codex":0.0003018194,"about_ca_topic_score_gemma":0.0020923887,"teacher_disagreement_score":0.7923933,"about_ca_system_score_codex":0.000212645,"about_ca_system_score_gemma":0.00036440775,"threshold_uncertainty_score":0.9249314},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037887054,0.00063214294,0.98028237,0.0037412427,0.00037637248,0.00064765033,0.00041887202,0.0010754265,0.009037232],"genre_scores_gemma":[0.5866039,0.00054145884,0.4118232,0.00039931788,0.000058887217,0.00012943333,0.00010839183,0.000017572922,0.00031785524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959073,0.00038240972,0.001398548,0.0008093231,0.0006246332,0.00087778916],"domain_scores_gemma":[0.99387115,0.00033208483,0.00077065994,0.0038098677,0.0008315394,0.00038469967],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059875345,0.00050861534,0.00065693917,0.00035012967,0.00071553286,0.00023856584,0.005043254,0.00026553034,0.00017417366],"category_scores_gemma":[0.00032582317,0.0005444707,0.00027954183,0.0009606418,0.0004388596,0.0016800067,0.0015925847,0.0005487263,0.00023101225],"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.00007072247,0.002970587,0.002170013,0.00008416251,0.0003496969,0.000009652871,0.0009938935,0.016967053,0.024062496,0.5309129,0.18926097,0.23214784],"study_design_scores_gemma":[0.0021612549,0.00020747459,0.0034418977,0.00043793797,0.00007406538,0.00028133646,0.00028172703,0.7115517,0.020001879,0.040476676,0.21943972,0.0016443061],"about_ca_topic_score_codex":0.00032843297,"about_ca_topic_score_gemma":0.0010418071,"teacher_disagreement_score":0.69458467,"about_ca_system_score_codex":0.0005924323,"about_ca_system_score_gemma":0.000615831,"threshold_uncertainty_score":0.99970067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01849169,0.0011214758,0.9602592,0.008644011,0.0012049638,0.001220062,0.00023030546,0.00068726455,0.008141056],"genre_scores_gemma":[0.7614342,0.0013988315,0.23462385,0.0008841045,0.0003095172,0.00016353908,0.0007451869,0.00003495286,0.00040580213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521595,0.0004631271,0.0012040513,0.0012848473,0.00048026696,0.0013517743],"domain_scores_gemma":[0.99177253,0.0005310495,0.0005211455,0.0064103124,0.00043820078,0.00032677193],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010381493,0.00056219596,0.00063209655,0.0002588069,0.0005651769,0.0005869674,0.008582078,0.00042440539,0.000040061273],"category_scores_gemma":[0.000115728006,0.000624815,0.00015673702,0.0015508939,0.0002470234,0.0014355193,0.0013976882,0.0006027632,0.000110006935],"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.0000496508,0.0010354237,0.0015418087,0.000023749797,0.000104810024,0.000009869926,0.00015981658,0.32775003,0.00007928391,0.12753186,0.050216813,0.4914969],"study_design_scores_gemma":[0.0011014994,0.000050163828,0.0008488409,0.000110849105,0.000024592662,0.000048788115,0.00003868761,0.9032493,0.00011556589,0.00050716684,0.093286574,0.00061797234],"about_ca_topic_score_codex":0.00044991617,"about_ca_topic_score_gemma":0.009683288,"teacher_disagreement_score":0.7429425,"about_ca_system_score_codex":0.0006221097,"about_ca_system_score_gemma":0.0004594374,"threshold_uncertainty_score":0.9996203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4554119,0.0014504822,0.4907974,0.0072672903,0.00043718,0.0023039335,0.0012683785,0.0014831843,0.039580245],"genre_scores_gemma":[0.956335,0.00068279525,0.041571416,0.00023519898,0.00006935757,0.00028036226,0.00047816656,0.000041661635,0.00030601126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750614,0.00018983672,0.0009330712,0.0004192282,0.00020064575,0.0007510571],"domain_scores_gemma":[0.99656254,0.0001480844,0.00012514547,0.0025845598,0.0002684828,0.0003111794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006599665,0.00040078818,0.0004482326,0.00025595323,0.00029989146,0.0001736273,0.0016875782,0.0002586069,0.00007007656],"category_scores_gemma":[0.000075598626,0.00045311585,0.00016151955,0.00063041935,0.00014730109,0.0006723683,0.00014500749,0.00043815532,0.00009630386],"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.00007457905,0.00091506564,0.002122211,0.000042710606,0.000101388505,0.000001398632,0.00043378116,0.87870204,0.00076354126,0.046709444,0.03708841,0.033045445],"study_design_scores_gemma":[0.0009100711,0.00003992266,0.005866871,0.000045355715,0.000040958774,0.000007085425,0.000062753614,0.95582145,0.00015776113,0.0021555335,0.0344219,0.00047032736],"about_ca_topic_score_codex":0.00014595062,"about_ca_topic_score_gemma":0.00585558,"teacher_disagreement_score":0.50092316,"about_ca_system_score_codex":0.0007203032,"about_ca_system_score_gemma":0.00023640948,"threshold_uncertainty_score":0.99979204},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001747241,0.001195607,0.96624637,0.024164269,0.0010216027,0.0013959646,0.00017258133,0.0006198422,0.0034365016],"genre_scores_gemma":[0.85456914,0.00035899522,0.14282766,0.0009225657,0.00013757174,0.00060883997,0.00008099741,0.000017205704,0.00047702598],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970617,0.00034252042,0.0007793552,0.00062714604,0.00037850344,0.000810761],"domain_scores_gemma":[0.99495876,0.0010348201,0.00043744707,0.0027943628,0.00054453226,0.00023010233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007118179,0.0004167457,0.00043103722,0.00009480316,0.0010120821,0.00061677705,0.0039535826,0.00022033261,0.000038496462],"category_scores_gemma":[0.00012024296,0.00034762826,0.00026027145,0.00063345785,0.00026286152,0.000720991,0.00027390354,0.00036616836,0.00037126685],"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.000027366641,0.00014780341,0.000041086427,0.000016257105,0.0001320487,0.0000017679048,0.00015195152,0.012389827,0.0000038203602,0.29571724,0.028632402,0.66273844],"study_design_scores_gemma":[0.0009245798,0.00007759825,0.0003845928,0.00007778959,0.00009090108,0.000109243876,0.00014531135,0.91939884,0.000015431136,0.00486115,0.07351489,0.00039966044],"about_ca_topic_score_codex":0.000057687354,"about_ca_topic_score_gemma":0.0008582247,"teacher_disagreement_score":0.907009,"about_ca_system_score_codex":0.00064224354,"about_ca_system_score_gemma":0.00044786042,"threshold_uncertainty_score":0.9998976},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016375545,0.0025554849,0.9601441,0.0006390682,0.00059826684,0.0019378825,0.0014008791,0.0009905136,0.015358252],"genre_scores_gemma":[0.894277,0.0041667386,0.09875664,0.00020165875,0.00066126353,0.00048268674,0.0011209985,0.000097949705,0.00023510013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967887,0.00018394402,0.0009254439,0.0006871099,0.00029949102,0.0011153191],"domain_scores_gemma":[0.9969112,0.00071650045,0.00032123737,0.0011309593,0.0005049227,0.00041515628],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036697657,0.0006836803,0.00079045433,0.00016359065,0.0006390926,0.00022298755,0.0010261728,0.00046028008,0.000056639085],"category_scores_gemma":[0.00008230063,0.0008043111,0.00016886227,0.0006682728,0.00043610096,0.0008634228,0.00011909354,0.0006921151,0.00006742303],"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.0001369616,0.00034095693,0.0033268766,0.00009109481,0.0008580809,0.0000061283854,0.0005179445,0.5287677,0.00011064718,0.004332026,0.030943535,0.43056804],"study_design_scores_gemma":[0.0024886893,0.00016454898,0.0036929408,0.00027512704,0.00028903768,0.000068628455,0.00034582042,0.9447983,0.00064330566,0.0012829187,0.04455959,0.0013910917],"about_ca_topic_score_codex":0.00006492568,"about_ca_topic_score_gemma":0.00045941854,"teacher_disagreement_score":0.87790143,"about_ca_system_score_codex":0.0007013607,"about_ca_system_score_gemma":0.00016382807,"threshold_uncertainty_score":0.9994408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062570706,0.0009453404,0.8147247,0.021792978,0.00041744168,0.0024715948,0.0001345175,0.0019820642,0.09496067],"genre_scores_gemma":[0.82710963,0.0020165606,0.16916004,0.0009629783,0.00007045785,0.00019618827,0.000053058728,0.000015973184,0.0004151064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674183,0.0004778769,0.0006901973,0.00074417505,0.00044161847,0.0009042905],"domain_scores_gemma":[0.994516,0.0001227157,0.0003691428,0.0040345388,0.00058019767,0.00037736085],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00069592753,0.0005323736,0.00052542594,0.00019370213,0.0022188923,0.00044800862,0.006749192,0.00019228409,0.00021354611],"category_scores_gemma":[0.000033632346,0.0005070066,0.00016446589,0.0013930962,0.00052494433,0.0015026915,0.0025922991,0.00078965083,0.00019966748],"study_design_candidate":"design_other","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.00016344298,0.0023816568,0.008480408,0.00006553145,0.00042859683,0.000010363051,0.002243872,0.0009983535,0.0017171144,0.21237606,0.038743954,0.73239064],"study_design_scores_gemma":[0.0046400465,0.00096295873,0.057548188,0.0004426835,0.00015526582,0.0006213507,0.00028107406,0.52269995,0.0047134785,0.0040203137,0.40048608,0.0034285763],"about_ca_topic_score_codex":0.00017164835,"about_ca_topic_score_gemma":0.0037699915,"teacher_disagreement_score":0.76453894,"about_ca_system_score_codex":0.00068511756,"about_ca_system_score_gemma":0.00055850967,"threshold_uncertainty_score":0.99973816},"labels":[],"label_agreement":null}]}