{"meta":{"query_hash":"364f5a8b1d41","filters":{"venue":"Globecom"},"cohort_total":100,"direct_labels_cover":0,"predictions_cover":100,"exported":100,"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/364f5a8b1d41","api":"https://metacan.xera.ac/api/v1/cohort?venue=Globecom"},"results":[{"id":"W1963622137","doi":"10.1109/glocom.2006.882","title":"WLC45-6: A Family of Low Complexity Adaptive Binary Linear Block Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Block code; Linear code; Concatenated error correction code; Hamming code; Algorithm; Mathematics; Turbo code; Expander code; Cyclic code; Computer science; Theoretical computer science; Decoding methods","score_opus":0.023263842875162977,"score_gpt":0.24859833233207118,"score_spread":0.2253344894569082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963622137","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.8250386,0.0024997322,0.14165816,0.000090837835,0.00014032549,0.00045840436,0.00022634676,0.0023216812,0.027565911],"genre_scores_gemma":[0.9274585,0.00011130703,0.0722502,0.000022163349,0.000033728895,0.000019030173,0.000031158026,0.00002686607,0.00004701328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992853,0.000029587274,0.00028056523,0.00011559241,0.00011734904,0.00017162815],"domain_scores_gemma":[0.9992871,0.00005768581,0.00006153728,0.00048821323,0.00007363752,0.00003179719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000062158244,0.00014176972,0.00022523258,0.000070498914,0.000043665634,0.0000057800244,0.0003068847,0.000071187584,0.000016143866],"category_scores_gemma":[0.0000072715065,0.00015599105,0.00005974235,0.00019371124,0.0001259869,0.00009353868,0.00009136971,0.00015353927,0.00002386937],"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.00016574407,0.0010786935,0.005069066,0.00077971775,0.00020057103,0.00003436153,0.00053434464,0.5298665,0.3059886,0.08883524,0.044046227,0.023400916],"study_design_scores_gemma":[0.0014238601,0.00033385085,0.0729001,0.00048431315,0.00004523472,0.000018570203,0.000360277,0.5345404,0.33039317,0.035705883,0.022384226,0.0014101081],"about_ca_topic_score_codex":0.0002305332,"about_ca_topic_score_gemma":0.000072720766,"teacher_disagreement_score":0.10241992,"about_ca_system_score_codex":0.00006756612,"about_ca_system_score_gemma":0.000011948678,"threshold_uncertainty_score":0.63611305},"labels":[],"label_agreement":null},{"id":"W1968732129","doi":"10.1109/glocom.2006.748","title":"WLC23-4: Performance Enhancement of Medium Access Control for UWB WPAN","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","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 Victoria; University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Personal area network; Distributed computing; Wireless; Schedule; Access control; Wireless network; Computation; Power control; Network topology; Heuristic; Power (physics); Engineering; Telecommunications; Algorithm","score_opus":0.008378572416027385,"score_gpt":0.22922027241461856,"score_spread":0.22084169999859118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968732129","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.8801938,0.00085182086,0.10511103,0.0006273935,0.0002980759,0.0004865614,0.00003417377,0.00037601354,0.012021077],"genre_scores_gemma":[0.99731785,0.00009248274,0.0021770094,0.00003413057,0.000033958637,0.00017221444,0.000022377031,0.000014438796,0.00013553473],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99940753,0.0000066007783,0.00024255994,0.000086065564,0.00006875953,0.00018850267],"domain_scores_gemma":[0.9993928,0.000061924366,0.000043893135,0.0004367838,0.000047703357,0.000016896429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007777767,0.000092667455,0.00016139542,0.00006559463,0.000042126816,0.0000114223085,0.0005050726,0.00007005463,0.00004896548],"category_scores_gemma":[0.000011485267,0.0000940702,0.000041625644,0.00011570891,0.000041330528,0.0000951684,0.00003480445,0.00007575172,0.00001386204],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026152798,0.0012490634,0.12026734,0.0018035686,0.00082822813,0.0000027209792,0.0005461127,0.04807622,0.36359072,0.03659917,0.14221725,0.2845581],"study_design_scores_gemma":[0.0029225566,0.00020456573,0.035497308,0.00007865418,0.00008657917,0.0000062732784,0.000036162433,0.061700862,0.71507883,0.0048100995,0.17905957,0.0005185133],"about_ca_topic_score_codex":0.000046699373,"about_ca_topic_score_gemma":0.00007510843,"teacher_disagreement_score":0.35148814,"about_ca_system_score_codex":0.000046182944,"about_ca_system_score_gemma":0.00001326259,"threshold_uncertainty_score":0.38360715},"labels":[],"label_agreement":null},{"id":"W1969710891","doi":"10.1109/glocom.2006.426","title":"QRP02-3: SAM: A New Bandwidth Constraint Model for Diff-Serv-Aware MPLS Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","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":"Carleton University","funders":"","keywords":"Bandwidth (computing); Computer science; Multiprotocol Label Switching; Constraint (computer-aided design); Computer network; Dynamic bandwidth allocation; Bandwidth management; Distributed computing; Quality of service; Engineering","score_opus":0.012389702287074153,"score_gpt":0.21609680070158935,"score_spread":0.2037070984145152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969710891","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.0016164788,0.00042583921,0.9922769,0.0026308757,0.0008191045,0.0004520429,0.000017905595,0.0004096664,0.001351196],"genre_scores_gemma":[0.9568459,0.000016053316,0.037156697,0.001690082,0.001175635,0.0000638622,0.000028028928,0.000020153395,0.003003604],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822754,0.00003705757,0.00037330552,0.0005370572,0.0002127766,0.00061227864],"domain_scores_gemma":[0.9988586,0.00015107477,0.00012508241,0.00055372197,0.0001000521,0.0002115193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019236747,0.00025827275,0.00031029494,0.000051599724,0.0001993408,0.00024838533,0.0007997742,0.00014235862,0.000033525444],"category_scores_gemma":[0.000010832822,0.00024390614,0.00019157279,0.00022337968,0.00005546646,0.00024661014,0.00012078788,0.00015852014,0.000029880051],"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.000028632036,0.000076601864,0.00037785078,0.000008836091,0.00002975488,0.0000069582948,0.00007472259,0.32602122,0.000008842418,0.122198015,0.1359379,0.41523066],"study_design_scores_gemma":[0.0013505521,0.000049434144,0.00030079056,0.000023043463,0.000019157776,0.000013870351,0.0000062954664,0.97123826,0.0000051951474,0.012613568,0.014088627,0.00029119334],"about_ca_topic_score_codex":0.00011968606,"about_ca_topic_score_gemma":0.00028704476,"teacher_disagreement_score":0.9552294,"about_ca_system_score_codex":0.00006088653,"about_ca_system_score_gemma":0.00019755126,"threshold_uncertainty_score":0.9946203},"labels":[],"label_agreement":null},{"id":"W1974581592","doi":"10.1109/glocom.2006.251","title":"NGL02-3: Price-Sensitive Application Adaptation in Deadline-Based Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Computer science; Transfer (computing); Adaptation (eye); Scheme (mathematics); Real-time computing; Computer network; Traffic intensity; Control (management); Operating system","score_opus":0.005018598314116307,"score_gpt":0.19122718687787707,"score_spread":0.18620858856376077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974581592","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.010078945,0.00013343866,0.98624897,0.0010079122,0.00017980464,0.0002558583,0.0000010063536,0.00019765951,0.0018964302],"genre_scores_gemma":[0.9852437,0.0000032160149,0.013827345,0.00055474683,0.00021573021,0.000050981365,0.000024833387,0.000006493171,0.00007297245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898934,0.00007181947,0.00023942727,0.00031793283,0.00013159068,0.00024989335],"domain_scores_gemma":[0.9993899,0.000113011,0.000100153055,0.00028245448,0.00007064323,0.0000438533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020693683,0.00011612324,0.000125968,0.00007505162,0.000062737745,0.000067045534,0.00025878235,0.00007646765,0.0000037957611],"category_scores_gemma":[0.0000075408875,0.00012084148,0.000042356223,0.00048237233,0.00001942723,0.00017257566,0.000028624185,0.00011549222,0.000047315723],"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.000015523572,0.00007520955,0.0012812956,0.0000021182177,0.0000029319651,0.0000073605943,0.000038715818,0.64796525,0.000020763502,0.041413642,0.0007706583,0.30840653],"study_design_scores_gemma":[0.0005878127,0.000020721418,0.014813174,0.000010615647,0.000003151202,0.0000021614485,0.000010054723,0.9806211,0.00003055677,0.0009643041,0.0028050607,0.00013131829],"about_ca_topic_score_codex":0.00024527992,"about_ca_topic_score_gemma":0.0008961533,"teacher_disagreement_score":0.9751647,"about_ca_system_score_codex":0.00007947703,"about_ca_system_score_gemma":0.00006332269,"threshold_uncertainty_score":0.49277726},"labels":[],"label_agreement":null},{"id":"W1976401000","doi":"10.1109/glocom.2006.62","title":"CTH05-5: Evaluation of Bit Error Rate for Packet Combining with Constellation Rearrangement","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Bit error rate; Network packet; Computer science; Algorithm; Constellation; Logarithm; Telecommunications link; Erlang (programming language); Piecewise; Mathematics; Theoretical computer science; Computer network; Decoding methods","score_opus":0.03176887121044083,"score_gpt":0.2841361770211035,"score_spread":0.2523673058106627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976401000","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.6442046,0.000602818,0.3277568,0.00014745549,0.00010875592,0.0014873433,0.00004540437,0.00066738477,0.024979413],"genre_scores_gemma":[0.97739655,0.000024158096,0.022343593,0.000009239697,0.000015252981,0.0000700116,0.00010071135,0.000021369415,0.0000190937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993829,0.000043478627,0.0002229888,0.00008924004,0.00015438139,0.000107026],"domain_scores_gemma":[0.99935174,0.00007270562,0.00008733923,0.00028127758,0.00019216069,0.00001475465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004177192,0.00008972984,0.00012606292,0.00006242714,0.0000376738,0.000009942748,0.00009346159,0.00003806477,0.00003261244],"category_scores_gemma":[0.000013193139,0.000089149886,0.00002487188,0.00011522501,0.000032634078,0.00009977112,0.000013883607,0.00004642003,0.0000026581451],"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.00012051342,0.00014447884,0.006957575,0.00031554516,0.00012449008,4.855508e-7,0.00033961973,0.8045229,0.05531809,0.014417915,0.010864591,0.106873825],"study_design_scores_gemma":[0.0028431152,0.00018083521,0.009768963,0.00024996363,0.00014101883,0.0000029094106,0.00020239518,0.73077846,0.2271174,0.015737008,0.012523769,0.0004541415],"about_ca_topic_score_codex":0.000027246224,"about_ca_topic_score_gemma":0.00006812614,"teacher_disagreement_score":0.33319193,"about_ca_system_score_codex":0.00009400822,"about_ca_system_score_gemma":0.000017194874,"threshold_uncertainty_score":0.36354268},"labels":[],"label_agreement":null},{"id":"W1979865924","doi":"10.1109/glocom.2006.268","title":"NIS02-2: A Secure Routing Protocol for Heterogeneous Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Université du Québec","funders":"","keywords":"Computer network; Wireless Routing Protocol; Computer science; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Dynamic Source Routing; Distributed computing; Interior gateway protocol; Hierarchical routing; Static routing; Optimized Link State Routing Protocol; Routing (electronic design automation)","score_opus":0.012125390599099933,"score_gpt":0.25441847625364933,"score_spread":0.2422930856545494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979865924","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.0020857828,0.000023952836,0.9515357,0.00034963607,0.00047333766,0.04279209,0.0000054168945,0.0006883945,0.0020456987],"genre_scores_gemma":[0.6435913,0.0000010702399,0.19472603,0.0011775127,0.0026023642,0.15607393,0.000039516766,0.00012951843,0.0016587984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746954,0.00009673374,0.00048372237,0.0007394128,0.000305998,0.0009045895],"domain_scores_gemma":[0.99849766,0.00018299343,0.00024369301,0.0008106317,0.00014055915,0.00012445323],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027123466,0.0003295355,0.00030427735,0.00007492152,0.00033584496,0.00034074415,0.0009506581,0.00020630255,0.000017320614],"category_scores_gemma":[0.000020479518,0.00031417856,0.00021118054,0.00042401167,0.00005017219,0.0001855103,0.00028179766,0.00020771177,0.00002464228],"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.000023457804,0.000115508956,0.0003726401,0.000020628788,0.00001425031,0.000035552024,0.000039195278,0.9771161,0.000059867252,0.013008066,0.005009467,0.004185249],"study_design_scores_gemma":[0.001040255,0.00010487473,0.00012539614,0.000056590055,0.0000061734377,0.00007210614,0.000003704735,0.9540036,0.0010676178,0.00056074554,0.0425658,0.00039316743],"about_ca_topic_score_codex":0.000095847,"about_ca_topic_score_gemma":0.0001082549,"teacher_disagreement_score":0.75680965,"about_ca_system_score_codex":0.00010616562,"about_ca_system_score_gemma":0.000047515598,"threshold_uncertainty_score":0.99993104},"labels":[],"label_agreement":null},{"id":"W1985384853","doi":"10.1109/glocom.2006.267","title":"NIS02-1: Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wormhole; Computer science; Computer network; Wireless ad hoc network; Countermeasure; Network packet; Distance-vector routing protocol; Routing protocol; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless; Wireless network; Computer security; Telecommunications; Engineering","score_opus":0.007356705943957545,"score_gpt":0.22036796923443552,"score_spread":0.21301126329047798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985384853","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.5913818,0.0048603625,0.4000034,0.0004677055,0.00037705223,0.00027827083,0.000006108315,0.00021668643,0.0024086032],"genre_scores_gemma":[0.9963286,0.0002131136,0.002669904,0.00029220807,0.00012506668,0.000024804416,0.000015175293,0.000012041419,0.0003191069],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981203,0.000101448306,0.00036734898,0.0006048219,0.0002918435,0.0005142084],"domain_scores_gemma":[0.9988806,0.00008422497,0.00012424603,0.00075205904,0.000057415906,0.0001014503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039831008,0.00021885251,0.0003814648,0.0001915051,0.00009488409,0.00028747122,0.00072138145,0.00013504182,0.000023886127],"category_scores_gemma":[0.000004953717,0.00021838995,0.000106908694,0.0018612357,0.00007108702,0.00039367692,0.00028834853,0.00023783842,0.00002522627],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037162456,0.00029207557,0.65012425,0.000026792462,0.00024180557,0.0002264725,0.00028075094,0.12023966,0.000045153105,0.0054502846,0.02075564,0.20227994],"study_design_scores_gemma":[0.00047906357,0.00003242201,0.35023963,0.00003107919,0.000047684167,0.000010456367,0.000009711444,0.64014834,0.000012949198,0.00042982804,0.008259449,0.00029935982],"about_ca_topic_score_codex":0.00021203843,"about_ca_topic_score_gemma":0.0065451115,"teacher_disagreement_score":0.5199087,"about_ca_system_score_codex":0.00009818244,"about_ca_system_score_gemma":0.000033490956,"threshold_uncertainty_score":0.8905684},"labels":[],"label_agreement":null},{"id":"W1987640939","doi":"10.1109/glocom.2006.657","title":"WLC08-1: Error Rate Analysis for Coded Multicarrier Systems over Quasi-Static Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","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 British Columbia","funders":"","keywords":"Orthogonal frequency-division multiplexing; Computer science; Subcarrier; Bit error rate; Electronic engineering; Fading; QAM; Interleaving; Spectral efficiency; Quadrature amplitude modulation; Channel (broadcasting); Algorithm; Telecommunications; Engineering","score_opus":0.01629084616820636,"score_gpt":0.25109651432534474,"score_spread":0.23480566815713838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987640939","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.5575723,0.00096620555,0.4369427,0.0002837926,0.0005334939,0.00071434013,0.00018122756,0.0011822889,0.001623641],"genre_scores_gemma":[0.9959211,0.000016351698,0.0030579008,0.000029815434,0.000049264054,0.00028183608,0.00012098276,0.000039521736,0.00048324914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890745,0.000046594167,0.00038680126,0.00020539404,0.000088436354,0.0003653016],"domain_scores_gemma":[0.9988543,0.00024150326,0.00006571796,0.0007272059,0.00006228607,0.000049033508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019482136,0.00019023831,0.00037363285,0.00030176714,0.0001169782,0.00006713607,0.0003719595,0.00014235746,0.000035120975],"category_scores_gemma":[0.00005513413,0.00019822003,0.00015989502,0.0006795021,0.000043594882,0.00009855959,0.000035079767,0.00013382954,0.000036832538],"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.000017976017,0.00013935883,0.0077557373,0.00018995408,0.0014145453,0.000005134967,0.00039254763,0.96192026,0.007927999,0.01136799,0.007940785,0.00092768174],"study_design_scores_gemma":[0.0005856829,0.000025634152,0.0026868891,0.000021452232,0.00038122982,0.0000028866807,0.0001820264,0.9782444,0.0011753386,0.00080541585,0.015577401,0.0003116475],"about_ca_topic_score_codex":0.000499652,"about_ca_topic_score_gemma":0.0004209512,"teacher_disagreement_score":0.43834877,"about_ca_system_score_codex":0.00013062505,"about_ca_system_score_gemma":0.0000108946915,"threshold_uncertainty_score":0.80831784},"labels":[],"label_agreement":null},{"id":"W1988470794","doi":"10.1109/glocom.2006.92","title":"CTH10-6: Diagonal Block Space-Time Code Design for Continuous-Phase Modulation","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of British Columbia","funders":"","keywords":"Continuous phase modulation; Diagonal; Algorithm; Computer science; Upper and lower bounds; Modulation (music); Fading; Block code; Coding (social sciences); Code (set theory); Space–time code; Time domain; Power (physics); Control theory (sociology); Electronic engineering; Mathematics; Telecommunications; Decoding methods; Physics; Engineering","score_opus":0.01464805664415205,"score_gpt":0.2618840590123122,"score_spread":0.24723600236816015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988470794","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.031724658,0.00030842627,0.9642227,0.00016721572,0.00006957456,0.000588419,0.0000905299,0.001371468,0.0014569735],"genre_scores_gemma":[0.83592767,0.000030166171,0.16319309,0.000022051909,0.00009291927,0.00017275005,0.00012185652,0.000049425373,0.00039005096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924695,0.000028055294,0.00025236473,0.00014655516,0.00009764597,0.0002284173],"domain_scores_gemma":[0.9992972,0.00014677233,0.00005682731,0.00039016278,0.00006775814,0.00004125543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119653356,0.00015780612,0.00019276272,0.000067932175,0.00007769698,0.000030706182,0.00020947582,0.00008986005,0.00003262771],"category_scores_gemma":[0.00002621123,0.00018041326,0.00006292034,0.000109317225,0.00002933994,0.0001495324,0.000029125871,0.00008913431,0.000044167573],"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.000072776376,0.0002558832,0.00023970897,0.000060893162,0.000053795626,0.0000025459108,0.00006927496,0.72438073,0.12153763,0.009370649,0.101853184,0.042102903],"study_design_scores_gemma":[0.001161414,0.00007621364,0.0005165204,0.000029176872,0.000016927717,0.0000052738824,0.0000060733905,0.831653,0.0916692,0.013114252,0.061388016,0.00036391837],"about_ca_topic_score_codex":0.000013359064,"about_ca_topic_score_gemma":0.000011192001,"teacher_disagreement_score":0.80420303,"about_ca_system_score_codex":0.00010384511,"about_ca_system_score_gemma":0.000011012203,"threshold_uncertainty_score":0.73570395},"labels":[],"label_agreement":null},{"id":"W1998348540","doi":"10.1109/glocom.2006.833","title":"WLC37-5: On Partial Transmit Sequences to Reduce PAR in OFDM Systems","year":2006,"lang":"fr","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","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":"Orthogonal frequency-division multiplexing; Redundancy (engineering); Computer science; Reduction (mathematics); Computational complexity theory; Multiplexing; Scheme (mathematics); Embedding; Frequency-division multiplexing; Algorithm; Mathematics; Channel (broadcasting); Telecommunications","score_opus":0.015244369436984219,"score_gpt":0.24536318506453814,"score_spread":0.23011881562755393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998348540","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.913374,0.009716399,0.0021735243,0.009675104,0.0181087,0.00088769465,0.00017611409,0.00039896852,0.045489516],"genre_scores_gemma":[0.9911052,0.000104846236,0.0009107539,0.00007019624,0.0020135322,0.0001159031,0.000014011074,0.000056564702,0.005608999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99763834,0.00014016037,0.000666815,0.00046354815,0.00033606024,0.0007550446],"domain_scores_gemma":[0.99923354,0.00007077703,0.00006077342,0.0004021958,0.000037478818,0.00019524127],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002905498,0.0003489317,0.00041020388,0.00020810841,0.000077210905,0.00011837366,0.00029988334,0.00025964697,0.00030921807],"category_scores_gemma":[0.00002796885,0.00041175567,0.00011291161,0.00059450296,0.000087130735,0.00020079716,0.000020694204,0.00036243832,0.0018655418],"study_design_candidate":"not_applicable","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.000048027487,0.00018758475,0.0016309649,0.00030868448,0.00004805897,0.00013152217,0.0005886754,0.8978213,0.0073960354,0.0170325,0.06758315,0.0072234813],"study_design_scores_gemma":[0.0013018507,0.00028616004,0.015225903,0.0014103753,0.00006865074,0.00016143973,0.0004942137,0.017230172,0.03567774,0.0014373836,0.92548496,0.0012211844],"about_ca_topic_score_codex":0.011750387,"about_ca_topic_score_gemma":0.0006464137,"teacher_disagreement_score":0.88059115,"about_ca_system_score_codex":0.0006505041,"about_ca_system_score_gemma":0.00007519358,"threshold_uncertainty_score":0.9998334},"labels":[],"label_agreement":null},{"id":"W1998603051","doi":"10.1109/glocom.2006.823","title":"WLC36-1: On the Optimality of Beamforming in MIMO Fading Ad-Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Channel state information; Transmitter; MIMO; Rayleigh fading; Beamforming; Fading; Wireless ad hoc network; Computer science; Interference (communication); Channel (broadcasting); Channel capacity; Multi-user MIMO; Computer network; Telecommunications; Wireless","score_opus":0.007976712373596593,"score_gpt":0.20610684025193954,"score_spread":0.19813012787834294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998603051","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.29798937,0.002215334,0.67597765,0.00009006835,0.00059829163,0.0005374045,0.000012968967,0.00029758178,0.022281315],"genre_scores_gemma":[0.99394846,0.000051380666,0.0058049294,0.000017671628,0.000068482404,0.000017022181,0.000010315094,0.000024368412,0.00005734363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924463,0.000023640709,0.00031188445,0.00011709699,0.00008257189,0.00022017614],"domain_scores_gemma":[0.9995827,0.000091484464,0.000058847323,0.0002288591,0.000019558025,0.000018514562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019740751,0.00011969441,0.00016433641,0.000055415305,0.00003712305,0.00001269676,0.00012876978,0.000069751906,0.000020156627],"category_scores_gemma":[0.000019211579,0.00010187877,0.000040818562,0.00024292359,0.000018921653,0.000111088244,0.000022121929,0.00013909582,0.000007717952],"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.0000048649645,0.0000105265135,0.0007759571,0.00001953281,0.0000047431126,0.0000013145058,0.0000549968,0.9956818,0.00022356371,0.0010311253,0.0002803471,0.0019111951],"study_design_scores_gemma":[0.00035272693,0.000024464583,0.0024871884,0.00018224702,0.0000067382844,0.0000034987572,0.00014769964,0.9918951,0.0015668073,0.0004525443,0.0026636936,0.00021732859],"about_ca_topic_score_codex":0.00005582787,"about_ca_topic_score_gemma":0.00015353641,"teacher_disagreement_score":0.6959591,"about_ca_system_score_codex":0.00012301479,"about_ca_system_score_gemma":0.0000050630533,"threshold_uncertainty_score":0.41544956},"labels":[],"label_agreement":null},{"id":"W1999623030","doi":"10.1109/glocom.2006.606","title":"SPCp1-04: Bit Mapping and Error Insertion for FEC Based PAPR Reduction in OFDM Signals","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","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":"Dalhousie University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Bit error rate; Reduction (mathematics); Forward error correction; Computer science; Algorithm; Redundancy (engineering); Additive white Gaussian noise; Error detection and correction; Decoding methods; Electronic engineering; Mathematics; Telecommunications; White noise; Channel (broadcasting); Engineering","score_opus":0.017114801214399858,"score_gpt":0.22652296278153006,"score_spread":0.2094081615671302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999623030","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.98360103,0.00038137182,0.012412249,0.00045475547,0.00072192674,0.0003925002,0.000017770357,0.00029146046,0.0017269035],"genre_scores_gemma":[0.9946326,0.000010131739,0.004742629,0.000026550857,0.0002643583,0.00007558087,0.00003850044,0.000029073797,0.00018058984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991641,0.000022120645,0.00028350757,0.00019838908,0.00009552474,0.00023632945],"domain_scores_gemma":[0.9997173,0.000030626295,0.00004201949,0.00013942154,0.000029912,0.000040722534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017204329,0.00013943421,0.00015649159,0.00020472513,0.000056514167,0.000036100315,0.000058648828,0.000099596145,0.000042111802],"category_scores_gemma":[0.000022393075,0.00016206187,0.00004506453,0.00024064163,0.000026054187,0.00017598236,0.000009915379,0.00009696524,0.000017675779],"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.00009362882,0.00016506569,0.01009131,0.0006458925,0.000050225615,0.000007990201,0.0003251054,0.3799905,0.5491467,0.00072766363,0.036301844,0.0224541],"study_design_scores_gemma":[0.005304993,0.00017752105,0.17918208,0.00051331904,0.00006603009,0.00009219513,0.0007868072,0.4899676,0.14705566,0.009035856,0.16624764,0.0015702976],"about_ca_topic_score_codex":0.00019766146,"about_ca_topic_score_gemma":0.00006239122,"teacher_disagreement_score":0.40209103,"about_ca_system_score_codex":0.0001584249,"about_ca_system_score_gemma":0.000015767566,"threshold_uncertainty_score":0.6608691},"labels":[],"label_agreement":null},{"id":"W2001824121","doi":"10.1109/glocom.2006.649","title":"WLC06-5: A Novel Nonlinear Joint Transmitter-Receiver Processing Algorithm for the Downlink of Multi-User MIMO Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of Alberta","funders":"","keywords":"Transmitter; MIMO; Computer science; Telecommunications link; Algorithm; Base station; Multi-user MIMO; Joint (building); Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.01512560698265545,"score_gpt":0.22826863910454223,"score_spread":0.2131430321218868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001824121","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.0009275536,0.0021216264,0.9948098,0.000047417496,0.00049304974,0.0009493537,0.00025356794,0.0002212454,0.00017640607],"genre_scores_gemma":[0.32994503,0.000054256587,0.6672517,0.000045903696,0.0007810462,0.00037671972,0.00015578017,0.00018156519,0.0012080037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988406,0.000012307898,0.00051771925,0.00020462472,0.0001369355,0.00028781738],"domain_scores_gemma":[0.999373,0.00005981237,0.00011967306,0.0002486515,0.00016256447,0.000036294878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015860607,0.00021430266,0.0003006182,0.00006664969,0.00009070108,0.00004470789,0.0001693061,0.000113377224,0.0000053376734],"category_scores_gemma":[0.000010125755,0.00016862695,0.00010768643,0.00019377573,0.00003829694,0.00018530549,0.0000130345115,0.00010999921,0.0000073339097],"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.0000057615193,0.00008539358,0.000041778843,0.0004943989,0.00004972519,9.971592e-7,0.00020372384,0.9685331,0.007173339,0.00008651181,0.00047329575,0.022851989],"study_design_scores_gemma":[0.0011265856,0.000017195352,0.00016597964,0.00015403828,0.000043221284,0.000011286224,0.00012723701,0.9795749,0.0029249522,0.000007329677,0.01564315,0.0002041284],"about_ca_topic_score_codex":0.00019811657,"about_ca_topic_score_gemma":0.00006087636,"teacher_disagreement_score":0.3290175,"about_ca_system_score_codex":0.00008419785,"about_ca_system_score_gemma":0.000022407767,"threshold_uncertainty_score":0.6876407},"labels":[],"label_agreement":null},{"id":"W2004340808","doi":"10.1109/glocom.2006.703","title":"WLC15-6: A QoS-Based MAC Protocol for Ad Hoc WLANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Distributed coordination function; Computer network; Computer science; Wireless ad hoc network; Inter-Access Point Protocol; Quality of service; IEEE 802.11; Service set; IEEE 802.11s; Ad hoc wireless distribution service; Vehicular ad hoc network; IEEE 802.11e-2005; Protocol (science); IEEE 802.1X; Optimized Link State Routing Protocol; Throughput; Wi-Fi; Wireless; Wireless network; Telecommunications; Wi-Fi array; Wireless mesh network","score_opus":0.021446948319641022,"score_gpt":0.3059649959355978,"score_spread":0.2845180476159568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004340808","genre_codex":"methods","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000086479115,0.000012248485,0.6334136,0.0013452525,0.00016179297,0.36202732,0.000016627635,0.0002985603,0.0026381048],"genre_scores_gemma":[0.0014445478,1.1548934e-7,0.07923797,0.0006993559,0.00042812293,0.91739696,0.000009347436,0.000017959474,0.0007656434],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985479,0.000050171933,0.00028793837,0.00042490877,0.00021845817,0.00047060044],"domain_scores_gemma":[0.99900347,0.00009801691,0.00012179238,0.000607874,0.00008196675,0.0000868765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391466,0.00019241856,0.0002022752,0.00005336424,0.000167711,0.000251384,0.00083898974,0.00009835054,0.000057227746],"category_scores_gemma":[0.0000065827035,0.00016764422,0.00013808254,0.00027446818,0.00003123652,0.0001941306,0.000102613296,0.000100459256,0.00006772278],"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.000437265,0.00091341534,0.003852475,0.0005312732,0.00003330365,0.000054907072,0.0000988664,0.004757957,0.0004722374,0.088624805,0.6158693,0.28435424],"study_design_scores_gemma":[0.0023570126,0.00029084308,0.0012242078,0.000075592645,0.000002876425,0.0000037466186,0.0000014670981,0.075907804,0.0012180316,0.008238022,0.91039145,0.00028892292],"about_ca_topic_score_codex":0.000049031456,"about_ca_topic_score_gemma":0.00012824226,"teacher_disagreement_score":0.5553696,"about_ca_system_score_codex":0.000050469145,"about_ca_system_score_gemma":0.00013460731,"threshold_uncertainty_score":0.6836333},"labels":[],"label_agreement":null},{"id":"W2013173551","doi":"10.1109/glocom.2006.747","title":"WLC23-3: Multiuser Performance of Balanced UWB Transmitted-Reference System in Multipath","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Simon Fraser University","funders":"","keywords":"Multipath propagation; Computer science; Multipath interference; Ultra-wideband; Interference (communication); Electronic engineering; Communications system; Multiuser detection; Wideband; Telecommunications; Computer network; Real-time computing; Code division multiple access; Engineering; Channel (broadcasting)","score_opus":0.005941723893070796,"score_gpt":0.18460363589806325,"score_spread":0.17866191200499246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013173551","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.98977005,0.00045701736,0.0010229043,0.00002151013,0.00007036506,0.00015448053,0.00001776875,0.000462707,0.008023174],"genre_scores_gemma":[0.99688554,0.00008222169,0.0028842003,0.0000056606964,0.000009152515,0.000053113843,0.000017498287,0.000018709887,0.00004392678],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99919623,0.000019491912,0.0003458755,0.00012593607,0.00008528608,0.00022720266],"domain_scores_gemma":[0.9993236,0.000043200882,0.00003810459,0.0005444509,0.000031264346,0.00001934569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007626303,0.00013171596,0.00022264633,0.00013197128,0.000026449918,0.0000060205416,0.00040801306,0.00013252228,0.0000125493225],"category_scores_gemma":[0.0000055028404,0.00013529873,0.000033034103,0.0003056081,0.00004315556,0.00008661827,0.000022597937,0.00020830534,0.000038271686],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008225583,0.00053071306,0.666424,0.0016432372,0.000096680866,0.000016562886,0.0008581398,0.13085312,0.12466081,0.011248166,0.0013051946,0.06228112],"study_design_scores_gemma":[0.002236289,0.00007740601,0.5271239,0.00041877007,0.000022735014,0.000022380931,0.00028898322,0.3995698,0.06095732,0.00009944547,0.008594877,0.00058809476],"about_ca_topic_score_codex":0.00045319507,"about_ca_topic_score_gemma":0.0006131764,"teacher_disagreement_score":0.2687167,"about_ca_system_score_codex":0.00009339487,"about_ca_system_score_gemma":0.000010945734,"threshold_uncertainty_score":0.5517322},"labels":[],"label_agreement":null},{"id":"W2015196856","doi":"10.1109/glocom.2006.541","title":"SPC02-4: Channel Estimation for OFDM-Based SPRAS-MIMO System","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Waterloo","funders":"","keywords":"MIMO; Orthogonal frequency-division multiplexing; MIMO-OFDM; Channel (broadcasting); Computer science; Channel state information; Frequency domain; Weighting; Precoding; Electronic engineering; Algorithm; Control theory (sociology); Telecommunications; Engineering; Wireless; Artificial intelligence","score_opus":0.007958958664258832,"score_gpt":0.22605529092804902,"score_spread":0.2180963322637902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015196856","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.0048139207,0.0003230856,0.9877791,0.00010515422,0.00015027059,0.0004315816,0.000041243795,0.0023211935,0.00403445],"genre_scores_gemma":[0.8914044,0.0000039625647,0.10807013,0.000022887976,0.00006043744,0.00023507349,0.00011716767,0.000038928116,0.000047021756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993532,0.000013827952,0.00024071347,0.0001181268,0.00008757705,0.00018655503],"domain_scores_gemma":[0.9993585,0.00007178814,0.00005373986,0.00043166924,0.00005447561,0.000029872237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009511684,0.00013260492,0.00015124556,0.000078465695,0.00007299088,0.000025439927,0.00021461242,0.00007731668,0.000005753738],"category_scores_gemma":[0.000013639857,0.0001492155,0.000071718,0.000121890414,0.000017761866,0.00012362651,0.000018604911,0.00007258273,0.00003230875],"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.00001456052,0.00005072878,0.0000845132,0.0006114522,0.000020512423,0.0000015817428,0.000027050568,0.9405003,0.0031376642,0.023751453,0.012411764,0.019388406],"study_design_scores_gemma":[0.00035772973,0.000020788817,0.000324754,0.000098864046,0.00001199612,0.0000022885304,0.000020553114,0.94055134,0.047602013,0.0021227263,0.0086700255,0.00021693953],"about_ca_topic_score_codex":0.00004626193,"about_ca_topic_score_gemma":0.000030780997,"teacher_disagreement_score":0.8865905,"about_ca_system_score_codex":0.00018865569,"about_ca_system_score_gemma":0.000010834266,"threshold_uncertainty_score":0.60848314},"labels":[],"label_agreement":null},{"id":"W2015949613","doi":"10.1109/glocom.2006.559","title":"SPC05-4: Successively Structured Gaussian CEO Problem","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Distributed Sensor Networks and Detection Algorithms","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":"Concordia University","funders":"","keywords":"Gaussian; Rate distortion; Relay; Mathematical optimization; Rate–distortion theory; Fusion center; Coding (social sciences); Computer science; Dirty paper coding; Distortion (music); Mathematics; Topology (electrical circuits); Beamforming; Bandwidth (computing); Telecommunications; Wireless; Statistics; MIMO; Combinatorics; Precoding; Cognitive radio","score_opus":0.004476794363137375,"score_gpt":0.19999432365176195,"score_spread":0.19551752928862456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015949613","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.009292767,0.00021232525,0.9484221,0.0015801574,0.0015775181,0.00026793723,0.000041814914,0.0008230497,0.03778238],"genre_scores_gemma":[0.94932467,0.0000050814874,0.04855915,0.00028897094,0.00039685803,0.000010163858,0.000030862688,0.00001297654,0.001371246],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857324,0.00004384555,0.000270927,0.00042253928,0.00027623496,0.00041321293],"domain_scores_gemma":[0.9992077,0.000021354976,0.0001261017,0.0004528763,0.00007851114,0.000113463706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000088147564,0.0001799612,0.00017161835,0.000072445204,0.00020035665,0.00039780236,0.0006590555,0.00009704371,0.00009138934],"category_scores_gemma":[0.000005194435,0.0001596852,0.00008676258,0.00056833494,0.000039088045,0.00035568594,0.0001438228,0.00015814518,0.00013809063],"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.000043073123,0.00033934903,0.004260514,0.00004629642,0.00008229536,0.00030789673,0.00016287956,0.012352283,0.0011472121,0.3724457,0.22914094,0.37967154],"study_design_scores_gemma":[0.0021647615,0.00023187879,0.14550228,0.000055480323,0.000027022068,0.00032245964,0.000042094387,0.14779888,0.006183759,0.11481356,0.58141017,0.0014476333],"about_ca_topic_score_codex":0.00036301944,"about_ca_topic_score_gemma":0.00016161738,"teacher_disagreement_score":0.94003195,"about_ca_system_score_codex":0.000058017882,"about_ca_system_score_gemma":0.00004204753,"threshold_uncertainty_score":0.6511773},"labels":[],"label_agreement":null},{"id":"W2016739648","doi":"10.1109/glocom.2006.792","title":"WLC30-6: Admission Control in Power Constrained OFDM/TDMA Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Manitoba","funders":"","keywords":"Computer science; Wireless mesh network; Router; Computer network; Network packet; Sleep mode; Mesh networking; Switched mesh; Markov decision process; Time division multiple access; Shared mesh; Markov process; Power (physics); Wireless; Wireless network; Power consumption; Telecommunications","score_opus":0.002707240748214062,"score_gpt":0.18765943726305678,"score_spread":0.1849521965148427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016739648","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.108792014,0.00067011156,0.87600493,0.00014251577,0.00081817206,0.000497266,0.000021168136,0.00077037106,0.012283451],"genre_scores_gemma":[0.99754107,0.000074397525,0.0018196634,0.0001062669,0.00018740671,0.000028327555,0.000067085544,0.000059703107,0.00011605523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864924,0.000041728923,0.00041624272,0.0002489458,0.00015326633,0.0004905883],"domain_scores_gemma":[0.9994652,0.00008334704,0.000061688275,0.00024895105,0.000041284013,0.000099488425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00011395513,0.00025459606,0.00032025244,0.00009671079,0.00005178538,0.000035179168,0.00015372402,0.00019800392,0.00018952714],"category_scores_gemma":[0.000011419183,0.00027383506,0.00006275745,0.0003615177,0.0000458057,0.000187419,0.000022199267,0.00025112942,0.000024049781],"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.00002763826,0.0000335536,0.0029246807,0.000011199511,0.000011868203,0.0000262343,0.000019274887,0.9857362,0.00047524384,0.0021455442,0.0039271396,0.0046614343],"study_design_scores_gemma":[0.0016898426,0.000020861933,0.0039617415,0.0000785458,0.000009253741,0.0000087357685,0.00002359756,0.9912977,0.00015118181,0.00032386862,0.0021086615,0.0003259996],"about_ca_topic_score_codex":0.000034007877,"about_ca_topic_score_gemma":0.00012094536,"teacher_disagreement_score":0.88874906,"about_ca_system_score_codex":0.00015470538,"about_ca_system_score_gemma":0.000020591004,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W2017810375","doi":"10.1109/glocom.2006.557","title":"SPC05-2: Turbo Coded MC-CDM Communications with Spatial Multiplexing","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Computer science; Turbo code; MIMO; Bit error rate; Fading; Single antenna interference cancellation; Electronic engineering; Decoding methods; Multiplexing; Spatial multiplexing; Orthogonal frequency-division multiplexing; Turbo; Interference (communication); Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.00884352238903985,"score_gpt":0.2200734737169966,"score_spread":0.21122995132795674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017810375","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.03908478,0.0017316756,0.8926585,0.00083247846,0.00014146048,0.0007018878,0.00009978822,0.0052808323,0.059468605],"genre_scores_gemma":[0.87204266,0.00012990007,0.12737988,0.00005148452,0.00004546451,0.00007910728,0.0001338534,0.00004855985,0.000089104564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991813,0.000039157898,0.00026807724,0.0001402364,0.00013239055,0.00023888673],"domain_scores_gemma":[0.9981947,0.00009934573,0.000060929262,0.0015328053,0.00006495831,0.000047242742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007127418,0.00018009928,0.00018186515,0.00007722654,0.00015893363,0.000040928062,0.0007368549,0.0000755582,0.000036475456],"category_scores_gemma":[0.000009278089,0.00018037079,0.000040486924,0.00020091434,0.000113088056,0.00017932338,0.00016018585,0.00026646373,0.000047098223],"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.0001525955,0.0011078127,0.04167736,0.0003750811,0.00039627013,0.00003964993,0.0015857004,0.3489665,0.06973677,0.07183384,0.042923678,0.42120475],"study_design_scores_gemma":[0.0023050366,0.000114855764,0.025179816,0.0003095458,0.00005572926,0.00005054533,0.00020269844,0.53471977,0.11242866,0.008567832,0.31431064,0.001754841],"about_ca_topic_score_codex":0.0006741199,"about_ca_topic_score_gemma":0.0021809565,"teacher_disagreement_score":0.83295786,"about_ca_system_score_codex":0.00012283785,"about_ca_system_score_gemma":0.000014174254,"threshold_uncertainty_score":0.7355307},"labels":[],"label_agreement":null},{"id":"W2022345288","doi":"10.1109/glocom.2006.892","title":"WLC47-5: Modeling Wireless TCP Connection Arrival Process","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","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 Calgary","funders":"","keywords":"Computer network; Computer science; Wireless network; Wireless; Quality of service; Telecommunications","score_opus":0.00761181839861558,"score_gpt":0.2139359930435849,"score_spread":0.20632417464496933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022345288","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.24747203,0.00012210982,0.7467668,0.00087034533,0.0005896083,0.000108121356,0.0000010804555,0.00041653868,0.003653367],"genre_scores_gemma":[0.99779975,0.0000046089303,0.0012187544,0.00025941312,0.00041301732,0.000022285,0.0000045011802,0.000008323471,0.00026934687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988653,0.00003779384,0.0002244343,0.000352644,0.0002261596,0.00029366228],"domain_scores_gemma":[0.99942976,0.000042386964,0.00006319202,0.0002867194,0.00011123855,0.00006672809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014380687,0.00013452274,0.00014821472,0.000051048177,0.0001687004,0.00015710945,0.00046032155,0.00006775289,0.000019161376],"category_scores_gemma":[0.000008817979,0.00013156979,0.0000603268,0.00026776717,0.000019439563,0.00034659487,0.00004920669,0.00012097774,0.00008408561],"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.000026107284,0.00015516377,0.0013399589,0.000021743841,0.000024888184,0.000026221938,0.0001653978,0.40338102,0.00016314347,0.2010991,0.0034335372,0.39016372],"study_design_scores_gemma":[0.00042283398,0.00002287615,0.00015435001,0.00001498651,0.000005833049,0.000017711667,0.000020967425,0.99027663,0.00009208721,0.0075824447,0.0012168888,0.00017239791],"about_ca_topic_score_codex":0.000099606965,"about_ca_topic_score_gemma":0.000071696624,"teacher_disagreement_score":0.7503277,"about_ca_system_score_codex":0.00003799061,"about_ca_system_score_gemma":0.000065573055,"threshold_uncertainty_score":0.536526},"labels":[],"label_agreement":null},{"id":"W2023369145","doi":"10.1109/glocom.2006.683","title":"WLC12-4: Reliable and Energy Efficient Transport Layer for Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Computer science; Sink (geography); Energy consumption; Wireless sensor network; Reliability (semiconductor); Computer network; Transport layer; Real-time computing; Layer (electronics); Engineering","score_opus":0.0067392011128158515,"score_gpt":0.1960580406264807,"score_spread":0.18931883951366485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023369145","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.06748083,0.0008527077,0.9254718,0.0004913431,0.000859872,0.00013318755,0.000006233311,0.00034350404,0.004360563],"genre_scores_gemma":[0.9472631,0.000042812015,0.049030665,0.00049249345,0.000392886,0.000041008745,0.000030219104,0.000033514825,0.002673293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979464,0.000028552275,0.00037453914,0.0006920703,0.00025897718,0.0006994989],"domain_scores_gemma":[0.9989144,0.00012578427,0.000114884,0.00060566055,0.00010280026,0.00013647838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023704805,0.00026991987,0.00029372767,0.00009266908,0.00024666186,0.000116064046,0.00050606206,0.00017215492,0.000008250283],"category_scores_gemma":[0.0000046203977,0.0002591905,0.00012246118,0.0003909721,0.00007074771,0.00011295735,0.00009910961,0.000119469136,0.0000054464913],"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.000014498821,0.0000949443,0.001002829,0.000008680605,0.000010752718,0.000017091104,0.00002212437,0.914358,0.000112490896,0.07593816,0.0046149264,0.0038054741],"study_design_scores_gemma":[0.00058782415,0.00005760252,0.0020845255,0.000023642106,0.0000137558745,0.000023906821,0.0000054436873,0.8934284,0.00052973576,0.0002974822,0.10262611,0.00032157835],"about_ca_topic_score_codex":0.00046181108,"about_ca_topic_score_gemma":0.00016944938,"teacher_disagreement_score":0.87978226,"about_ca_system_score_codex":0.000053505,"about_ca_system_score_gemma":0.000031093474,"threshold_uncertainty_score":0.99998605},"labels":[],"label_agreement":null},{"id":"W2028496278","doi":"10.1109/glocom.2006.566","title":"SPC06-5: Turbo Equalization with Integrated SNR Estimation","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Windsor","funders":"","keywords":"Computer science; Turbo; Equalization (audio); Turbo equalizer; Subspace topology; Signal-to-noise ratio (imaging); Algorithm; Turbo code; Decoding methods; A priori and a posteriori; Telecommunications; Low-density parity-check code; Artificial intelligence; Engineering","score_opus":0.003590231735359154,"score_gpt":0.19585164730102816,"score_spread":0.192261415565669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028496278","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.037218366,0.00018173411,0.950791,0.000055152403,0.000042170304,0.00015230585,0.000007764477,0.0017939723,0.009757517],"genre_scores_gemma":[0.90903324,0.000026677642,0.09052465,0.000020579997,0.000017792412,0.000030903924,0.00022084574,0.00002794119,0.000097376935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995108,0.000017641456,0.00016890548,0.00008977406,0.00009323783,0.000119638404],"domain_scores_gemma":[0.9995649,0.00002263705,0.000037952163,0.00029954308,0.00005452989,0.00002042331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000045670487,0.00011084384,0.00009665427,0.000067569206,0.00004235683,0.000029219565,0.00013700423,0.00005320654,0.00003955782],"category_scores_gemma":[0.000009281984,0.00010239957,0.000015027414,0.0002627007,0.00002422036,0.00020916338,0.000016119833,0.00009363216,0.00003446045],"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.000015825317,0.000060472674,0.0012142275,0.0000654396,0.000022597556,0.000003515292,0.00011720948,0.8455101,0.006493002,0.029172154,0.007820457,0.109505],"study_design_scores_gemma":[0.0005014816,0.00005730077,0.004748671,0.00014178376,0.00001832383,0.000013632195,0.00005569084,0.8312856,0.12185938,0.013153677,0.02762427,0.0005402086],"about_ca_topic_score_codex":0.00009305393,"about_ca_topic_score_gemma":0.00011125666,"teacher_disagreement_score":0.87181485,"about_ca_system_score_codex":0.00010639562,"about_ca_system_score_gemma":0.0000089017085,"threshold_uncertainty_score":0.41757333},"labels":[],"label_agreement":null},{"id":"W2039357626","doi":"10.1109/glocom.2006.492","title":"WSN05-5: On Node Population in a Multi-Level 802.15.4 Sensor Network","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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 Manitoba","funders":"","keywords":"Node (physics); Cluster (spacecraft); Reliability (semiconductor); Wireless sensor network; Computer science; Computer network; Population; Event (particle physics); Bridge (graph theory); Topology (electrical circuits); Distributed computing; Engineering; Physics","score_opus":0.02679933560933868,"score_gpt":0.24562200378888574,"score_spread":0.21882266817954707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039357626","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.52921796,0.00022756688,0.46317554,0.0010103111,0.0017157597,0.00032628098,0.000008466652,0.0005381232,0.0037799873],"genre_scores_gemma":[0.88948834,0.000004985681,0.10886665,0.0005684647,0.00032268593,0.000011963913,0.00003255135,0.000022369075,0.00068200415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977871,0.00014661161,0.0004254736,0.0006126748,0.00035838826,0.0006697616],"domain_scores_gemma":[0.9988808,0.00013327181,0.00014689515,0.00071200106,0.00004673731,0.0000802899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026849454,0.00025101897,0.00026225642,0.0001485452,0.00013806281,0.00013422787,0.0006173175,0.00016137253,0.000015087327],"category_scores_gemma":[0.000023507544,0.000253664,0.00008793699,0.0008114156,0.000026660191,0.00020431967,0.0001686104,0.0002515001,0.00015283935],"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.000010118635,0.00017449386,0.027562294,0.0000040607456,0.0000039413585,0.000045121396,0.00003278862,0.94594485,0.00003936878,0.016761238,0.0024569458,0.0069647934],"study_design_scores_gemma":[0.00063810096,0.000028805469,0.351016,0.00006525834,0.0000025720917,0.000011242785,0.000003393881,0.6456653,0.000072597475,0.00046712926,0.0017415009,0.00028810438],"about_ca_topic_score_codex":0.0016420361,"about_ca_topic_score_gemma":0.0024107087,"teacher_disagreement_score":0.36027035,"about_ca_system_score_codex":0.00018035556,"about_ca_system_score_gemma":0.000021193138,"threshold_uncertainty_score":0.99999154},"labels":[],"label_agreement":null},{"id":"W2040783219","doi":"10.1109/glocom.2006.854","title":"WLC41-2: Adaptive Regenerate and Forward Cooperative Diversity System based on Quadrature Signaling","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","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 Waterloo","funders":"","keywords":"Relay; Power consumption; Computer science; Quadrature (astronomy); Cooperative diversity; Signal-to-noise ratio (imaging); Upper and lower bounds; Channel (broadcasting); Control theory (sociology); Power (physics); Topology (electrical circuits); Mathematical optimization; Electronic engineering; Telecommunications; Mathematics; Engineering; Fading; Physics; Artificial intelligence","score_opus":0.021268076425171145,"score_gpt":0.22222829303427608,"score_spread":0.20096021660910493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040783219","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.059618264,0.0014976279,0.90737915,0.0031237379,0.00050775765,0.00043774568,0.000029892528,0.0005621144,0.026843728],"genre_scores_gemma":[0.99137956,0.000016777649,0.00756009,0.0005662924,0.00007937821,0.000008919493,0.000011596868,0.0000066675507,0.0003706942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875,0.00026918136,0.000172391,0.0003813916,0.00020834884,0.00021871127],"domain_scores_gemma":[0.99902225,0.00012575551,0.00008860381,0.00049010804,0.00019363068,0.00007965698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027970248,0.00018007013,0.00019572211,0.0001004609,0.0008943944,0.00020659185,0.000556245,0.000069635586,0.000012978873],"category_scores_gemma":[0.0000116957235,0.00016130194,0.000052314368,0.00047249167,0.000050116414,0.00024757654,0.00056453596,0.00019627303,0.00001802088],"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.000121805846,0.00019302304,0.0030824384,0.000033060423,0.0000598622,0.000068688,0.0012685547,0.048660725,0.0015433518,0.90160614,0.019659558,0.023702767],"study_design_scores_gemma":[0.0009826792,0.00022141727,0.0043623433,0.000170037,0.000015284822,0.000007857028,0.00013479669,0.9861137,0.002983014,0.00023171355,0.004335185,0.00044194114],"about_ca_topic_score_codex":0.000054753207,"about_ca_topic_score_gemma":0.00013847345,"teacher_disagreement_score":0.93745303,"about_ca_system_score_codex":0.00012881831,"about_ca_system_score_gemma":0.000043768276,"threshold_uncertainty_score":0.6879049},"labels":[],"label_agreement":null},{"id":"W2041989762","doi":"10.1109/glocom.2006.733","title":"WLC21-1: Improved High-rate Space-Time-Frequency Block Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Queen's University","funders":"","keywords":"Physics; Computer science","score_opus":0.0037906946120488984,"score_gpt":0.19713860817463147,"score_spread":0.19334791356258257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041989762","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.699647,0.005126436,0.15195894,0.0018099569,0.0007785347,0.0014412738,0.00026407273,0.017370664,0.121603094],"genre_scores_gemma":[0.94020313,0.00016741884,0.058440246,0.000045261622,0.000093150134,0.000060345363,0.000057531986,0.000061644634,0.0008712699],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991045,0.00003614883,0.0002834667,0.0001805571,0.00008858834,0.00030676334],"domain_scores_gemma":[0.9989926,0.0000672725,0.000058458547,0.0007701783,0.00005669236,0.000054795364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010068382,0.00021280207,0.00022823387,0.00007955732,0.000081059414,0.000041941294,0.00040708808,0.00011177964,0.000102143524],"category_scores_gemma":[0.000018783127,0.00023085812,0.00005695924,0.00021286323,0.000052903328,0.00018328887,0.000077657554,0.00020069155,0.00023628965],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012357066,0.00013372002,0.0009461078,0.00010596089,0.00007818443,0.000013816704,0.00006856956,0.022712713,0.89285314,0.037793826,0.034261435,0.011020168],"study_design_scores_gemma":[0.001410072,0.0001341503,0.0120102875,0.0001517879,0.00006108637,0.000027047132,0.00004021323,0.0880908,0.7200243,0.10018785,0.07590869,0.0019537243],"about_ca_topic_score_codex":0.00039446843,"about_ca_topic_score_gemma":0.00013213155,"teacher_disagreement_score":0.2405561,"about_ca_system_score_codex":0.00013800291,"about_ca_system_score_gemma":0.000013738713,"threshold_uncertainty_score":0.94141203},"labels":[],"label_agreement":null},{"id":"W2042864373","doi":"10.1109/glocom.2006.777","title":"WLC28-3: SNR Estimators for UWB BPSK Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Estimator; Phase-shift keying; Bandwidth (computing); Mean squared error; Computer science; Keying; Binary number; Algorithm; Bit error rate; Electronic engineering; Ultra-wideband; Mathematics; Telecommunications; Statistics; Engineering; Decoding methods","score_opus":0.004268870453155159,"score_gpt":0.18512087810689035,"score_spread":0.1808520076537352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042864373","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.5337098,0.011621493,0.35130286,0.0015421624,0.0026863858,0.0017713531,0.00019483095,0.007884392,0.08928671],"genre_scores_gemma":[0.99161386,0.000016564496,0.007507461,0.000015414305,0.000057494944,0.00017890679,0.00003858074,0.000031457,0.0005402394],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99939495,0.0000085537995,0.00020696795,0.00010738022,0.000054653654,0.00022747433],"domain_scores_gemma":[0.99928814,0.000074618605,0.000024708621,0.0005584255,0.000029001038,0.000025130006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006327577,0.000113500464,0.00014876042,0.000077499884,0.00007057848,0.000032322983,0.0003420881,0.00011619114,0.000013173564],"category_scores_gemma":[0.000018813129,0.00011987774,0.000050084425,0.0001487856,0.000030274936,0.00005696823,0.00002744485,0.000097509626,0.000104337196],"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.000015539008,0.00021921446,0.0127122,0.0004743828,0.00022160322,0.000008417118,0.00015939581,0.15483049,0.010448692,0.24998255,0.54471755,0.026209975],"study_design_scores_gemma":[0.00064684096,0.000043115437,0.002370886,0.00004892566,0.000041354102,0.000042087122,0.00007662521,0.12913884,0.004322291,0.008973448,0.8538391,0.0004564762],"about_ca_topic_score_codex":0.00018816566,"about_ca_topic_score_gemma":0.000086547116,"teacher_disagreement_score":0.45790407,"about_ca_system_score_codex":0.00007513962,"about_ca_system_score_gemma":0.000009499775,"threshold_uncertainty_score":0.48884726},"labels":[],"label_agreement":null},{"id":"W2044052036","doi":"10.1109/glocom.2006.809","title":"WLC33-5: Second Order Statistics of Non-identical Nakagami Fading Channels with Maximal-Ratio Combining","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nakagami distribution; Fade; Fading; Envelope (radar); Independent and identically distributed random variables; Statistics; Order statistic; Correctness; Mathematics; Maximal-ratio combining; Level crossing; Sample (material); Algorithm; Computer science; Topology (electrical circuits); Telecommunications; Random variable; Physics; Combinatorics; Engineering","score_opus":0.017043265798598252,"score_gpt":0.25634433680148916,"score_spread":0.2393010710028909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044052036","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.04361298,0.00013129268,0.9494901,0.00028562665,0.00021418594,0.00014834422,0.000010108179,0.000064762135,0.0060426053],"genre_scores_gemma":[0.90401524,0.000020500725,0.09496984,0.00017033135,0.000048978083,0.000009868063,0.000019105162,0.000011079467,0.00073506165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987624,0.00008046885,0.00037555624,0.00026850085,0.00024037219,0.00027267713],"domain_scores_gemma":[0.9987668,0.00015491086,0.00015664747,0.0005563208,0.00029972344,0.000065626205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498548,0.00015605568,0.00023738276,0.000089242596,0.00019983195,0.00018850487,0.0006836453,0.00004554265,0.00016153933],"category_scores_gemma":[0.000028873199,0.00014429686,0.000029794577,0.00053117174,0.00008910708,0.00031820868,0.0003217609,0.00016523081,0.000035645186],"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.00004308065,0.000540243,0.012621247,0.00011568983,0.00012756992,0.00006886743,0.0027729794,0.008442399,0.0051385458,0.90671676,0.023950262,0.03946238],"study_design_scores_gemma":[0.0021774953,0.00040814443,0.035445746,0.00023007186,0.000029696592,0.00005734712,0.00011373828,0.9345436,0.0057217735,0.0063326396,0.01415037,0.0007893876],"about_ca_topic_score_codex":0.000030137573,"about_ca_topic_score_gemma":0.00025631112,"teacher_disagreement_score":0.9261012,"about_ca_system_score_codex":0.000043153657,"about_ca_system_score_gemma":0.00009008453,"threshold_uncertainty_score":0.5884255},"labels":[],"label_agreement":null},{"id":"W2045761076","doi":"10.1109/glocom.2006.822","title":"WLC35-6: Relay-Assisted Spatial Multiplexing in Wireless Fixed Relay Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Carleton University","funders":"","keywords":"Relay; Spatial multiplexing; Computer science; MIMO; Multiplexing; Computer network; Wireless; Antenna diversity; Diversity gain; Decoding methods; Electronic engineering; Telecommunications; Power (physics); Channel (broadcasting); Engineering","score_opus":0.019401949209997955,"score_gpt":0.2464339209211083,"score_spread":0.22703197171111034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045761076","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.1093398,0.00096492073,0.87818474,0.0019680492,0.0007809967,0.00030709105,0.0000021770109,0.00038407271,0.008068134],"genre_scores_gemma":[0.9866971,0.00013155394,0.012190699,0.0003271459,0.00016192383,0.000025968553,0.000025736746,0.000014106177,0.00042580135],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982275,0.00028160622,0.00045846382,0.00042027113,0.00019579516,0.0004164005],"domain_scores_gemma":[0.9986346,0.00020456866,0.00013695878,0.00086699205,0.00008435795,0.00007254627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040899016,0.0001953755,0.0002435982,0.0001222485,0.0002570312,0.00019440566,0.0010840241,0.00011917875,0.000044151806],"category_scores_gemma":[0.000034665252,0.00020051713,0.00007918907,0.00079725595,0.000049161856,0.0003165269,0.00054572674,0.00038070965,0.000056097],"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.00006198224,0.00064972206,0.07110257,0.000019085182,0.00003799543,0.00013583833,0.00082066946,0.10399887,0.0025990666,0.10395635,0.0187315,0.69788635],"study_design_scores_gemma":[0.00081610575,0.00002401884,0.13929573,0.00007359032,0.0000023677558,0.000010468239,0.00000878753,0.8492877,0.00016417552,0.00013157277,0.009910253,0.00027524526],"about_ca_topic_score_codex":0.00054641295,"about_ca_topic_score_gemma":0.005216967,"teacher_disagreement_score":0.87735724,"about_ca_system_score_codex":0.00015678773,"about_ca_system_score_gemma":0.00005371111,"threshold_uncertainty_score":0.81768507},"labels":[],"label_agreement":null},{"id":"W2047939401","doi":"10.1109/glocom.2006.111","title":"CTH14-1: On the Integrated Cross-Noise Component in Correlation Receivers","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","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":"Autocorrelation; Gaussian noise; Noise (video); Component (thermodynamics); Probability density function; SIGNAL (programming language); Cross-correlation; Convergence (economics); Gaussian; Uncorrelated; Noise measurement; Algorithm; Value noise; Statistics; Computer science; Mathematics; Noise floor; Physics; Noise reduction; Artificial intelligence","score_opus":0.006992885321791408,"score_gpt":0.20504542589527777,"score_spread":0.19805254057348637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047939401","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.9752607,0.00016645856,0.0010856898,0.0010079488,0.00018061216,0.00016693176,0.000008714519,0.00041748045,0.021705508],"genre_scores_gemma":[0.9993703,0.00003704557,0.00028494044,0.000053521784,0.00000974894,0.000028865068,0.000045834488,0.0000123550935,0.00015742696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99948317,0.00003430866,0.00018118144,0.00009091769,0.0000658265,0.00014456885],"domain_scores_gemma":[0.99938285,0.00012278235,0.000023867979,0.0004375815,0.000020794303,0.000012110394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009875973,0.00009458757,0.00008642886,0.00009349348,0.000057853897,0.000025934083,0.00029766292,0.00009346669,0.00007340845],"category_scores_gemma":[0.000029503984,0.000076868615,0.000027132875,0.0003103492,0.00006135731,0.000050321367,0.000022152972,0.00029863714,0.00019187234],"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.000056999805,0.00032659774,0.13610266,0.00001767121,0.00005140743,0.000012318745,0.000523757,0.7181694,0.014640183,0.054284077,0.05085024,0.0249647],"study_design_scores_gemma":[0.0011910944,0.00006306548,0.62524515,0.00010845982,0.000014786358,0.000013604939,0.0003639484,0.2236861,0.00734954,0.007931348,0.13353385,0.000499056],"about_ca_topic_score_codex":0.0004893392,"about_ca_topic_score_gemma":0.0005793794,"teacher_disagreement_score":0.4944833,"about_ca_system_score_codex":0.00017799855,"about_ca_system_score_gemma":0.000007794325,"threshold_uncertainty_score":0.3134611},"labels":[],"label_agreement":null},{"id":"W2048100384","doi":"10.1109/glocom.2006.760","title":"WLC25-4: Dynamic 802.15.3 WPAN Scheduling using Maximal Matching","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Scheduling (production processes); Computer network; Asynchronous communication; Dynamic priority scheduling; Reuse; Distributed computing; Schedule; Real-time computing; Mathematical optimization; Engineering; Mathematics","score_opus":0.013281791150846796,"score_gpt":0.26212024020954494,"score_spread":0.24883844905869815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048100384","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.24705921,0.00014492558,0.7494867,0.00034733105,0.000364183,0.00092835724,0.0000028001987,0.0002605665,0.0014059494],"genre_scores_gemma":[0.7580025,0.000001983701,0.24129637,0.00019598445,0.00026185176,0.00010112262,0.00000470982,0.000019123729,0.00011632224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983716,0.00006749057,0.00031928724,0.00044203986,0.00026325838,0.000536346],"domain_scores_gemma":[0.9991688,0.00004690091,0.00013288915,0.0005230622,0.000042951706,0.00008538499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002870753,0.00020498368,0.00022116199,0.000079961515,0.00029834473,0.00044887397,0.00080303324,0.0000999385,0.000033843546],"category_scores_gemma":[0.0000045318125,0.00020357712,0.00010246416,0.00035919293,0.00003228823,0.00052248297,0.0003455043,0.00022226184,0.00008264955],"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.00005760311,0.00047465853,0.013576598,0.00023620618,0.00009316765,0.0004181401,0.0006959665,0.49208838,0.022739165,0.2722527,0.0013585727,0.19600883],"study_design_scores_gemma":[0.00046661086,0.00003645484,0.0038859027,0.00013715078,0.00000793894,0.000078772355,0.000022635035,0.9646274,0.0006645386,0.025712062,0.0039050502,0.00045552055],"about_ca_topic_score_codex":0.0006262309,"about_ca_topic_score_gemma":0.00012550713,"teacher_disagreement_score":0.5109433,"about_ca_system_score_codex":0.00010670109,"about_ca_system_score_gemma":0.000072744835,"threshold_uncertainty_score":0.83016336},"labels":[],"label_agreement":null},{"id":"W2051621878","doi":"10.1109/glocom.2006.402","title":"OPN08-03: Backup Path Re-optimizations for Shared Path Protection in Multi-domain Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Université de Montréal; Concordia University","funders":"","keywords":"Backup; Computer science; Path (computing); Distributed computing; Scalability; Computer network; Path protection; Routing (electronic design automation); Domain (mathematical analysis); Mathematics; Wavelength-division multiplexing; Operating system","score_opus":0.015431761070927606,"score_gpt":0.22572243381568208,"score_spread":0.21029067274475446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051621878","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.0060308343,0.00039038548,0.9903759,0.00015375878,0.00023506925,0.00095333514,0.00003858686,0.0011685141,0.0006536231],"genre_scores_gemma":[0.3139525,0.00006776743,0.68494457,0.000025473359,0.00013334908,0.00060410553,0.000118580334,0.00006499488,0.000088663226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886954,0.00001541943,0.0003288313,0.0002561908,0.000079902515,0.00045014656],"domain_scores_gemma":[0.9995807,0.000059279944,0.000039832546,0.00024635193,0.0000368268,0.00003701786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000101781385,0.00019881883,0.0002103472,0.00008913267,0.000083708466,0.0000408076,0.00016095475,0.00022936122,0.000029672774],"category_scores_gemma":[0.00006387481,0.00021112131,0.00006205244,0.00044188704,0.00003994922,0.00017380988,0.000049211645,0.0002506922,0.000016894195],"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.0000107268,0.000045548855,0.00028831366,0.000024766197,0.0000069145763,0.0000043748055,0.000012470779,0.9909839,0.0001290404,0.0016620838,0.0018069765,0.0050248844],"study_design_scores_gemma":[0.00062805135,0.000037758444,0.0015924592,0.000059198348,0.0000058776104,0.0000020479822,0.00005893798,0.98702085,0.000036835056,0.006727346,0.0035680886,0.0002625595],"about_ca_topic_score_codex":0.00002932451,"about_ca_topic_score_gemma":0.00033272165,"teacher_disagreement_score":0.30792168,"about_ca_system_score_codex":0.00019301564,"about_ca_system_score_gemma":0.0000073693586,"threshold_uncertainty_score":0.86092776},"labels":[],"label_agreement":null},{"id":"W2057938077","doi":"10.1109/glocom.2006.873","title":"WLC44-3: Reduced-Complexity Decoding of Raptor Codes over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Fountain code; Fading; Raptor code; Decoding methods; Computer science; Luby transform code; Tornado code; Binary erasure channel; Algorithm; Erasure; Online codes; Channel (broadcasting); Theoretical computer science; Concatenated error correction code; Computer network; Block code; Channel capacity","score_opus":0.032573212726410575,"score_gpt":0.28419459446730794,"score_spread":0.2516213817408974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057938077","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.573306,0.0001347303,0.41534668,0.00027919735,0.0010106704,0.00020048632,0.0000068973864,0.00093174475,0.008783601],"genre_scores_gemma":[0.8826319,0.0000042259862,0.11695584,0.000078122306,0.00014525418,0.000010320594,0.0000031161185,0.0000144135975,0.0001568091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99835235,0.0000800796,0.00041269956,0.00044893468,0.0003057059,0.00040023436],"domain_scores_gemma":[0.998748,0.00014638901,0.00025733677,0.00067999156,0.00010476054,0.00006349292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004792549,0.00019822708,0.00030722906,0.00018311777,0.00014823292,0.000110263325,0.0010368768,0.000088607216,0.00003770705],"category_scores_gemma":[0.000081362705,0.00020619232,0.00013020677,0.00047198046,0.00008322316,0.00044446974,0.00038333712,0.00016337339,0.000020269263],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005766845,0.0007685424,0.040343035,0.0002686083,0.00011772209,0.000085407555,0.0032735348,0.0011691423,0.2709716,0.53658265,0.06436612,0.08199597],"study_design_scores_gemma":[0.0008378192,0.0002461589,0.032432258,0.0004044958,0.000029041914,0.00010076817,0.00007215068,0.13460556,0.6791796,0.14360301,0.0072501916,0.0012389637],"about_ca_topic_score_codex":0.0011943753,"about_ca_topic_score_gemma":0.000110551424,"teacher_disagreement_score":0.40820798,"about_ca_system_score_codex":0.00011851316,"about_ca_system_score_gemma":0.000051957733,"threshold_uncertainty_score":0.8408278},"labels":[],"label_agreement":null},{"id":"W2061359222","doi":"10.1109/glocom.2006.1010","title":"WSNp1-5: Analysis of a New 802.11 Distributed Media Access Control Protocol","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Distributed coordination function; Computer science; Throughput; Overhead (engineering); Reset (finance); Protocol (science); Computer network; Access control; Process (computing); Distributed computing; IEEE 802.11; Wireless; Operating system","score_opus":0.018911170265732146,"score_gpt":0.29897076324412875,"score_spread":0.2800595929783966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061359222","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.0020107396,0.000012430481,0.9149882,0.00055892864,0.0000885488,0.0815083,0.000098079,0.00015737767,0.00057738385],"genre_scores_gemma":[0.7479269,6.6991436e-7,0.008861071,0.0004262203,0.0005528708,0.24191387,0.00012159952,0.000021978041,0.00017485452],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9981582,0.000097040174,0.00052495324,0.00040414033,0.00038561068,0.00043005013],"domain_scores_gemma":[0.9985059,0.0001535434,0.00032000555,0.00074614387,0.00012775202,0.00014664998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029313608,0.00019460505,0.00051770784,0.00018143222,0.00007815449,0.000269042,0.0015509553,0.000103696286,0.00015207227],"category_scores_gemma":[0.000026626765,0.00016501812,0.00024816935,0.0022468804,0.000043134016,0.0005383132,0.00027926028,0.0001016472,0.000011964991],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031859725,0.0010820066,0.550504,0.00015256155,0.0014085814,0.00009623432,0.00033338956,0.0799214,0.00028614406,0.08087033,0.16020548,0.12482127],"study_design_scores_gemma":[0.0051331613,0.00013495814,0.6461914,0.00008505074,0.00034105088,0.000004050262,0.0000065357804,0.24428608,0.0011690576,0.00804343,0.093946345,0.0006588381],"about_ca_topic_score_codex":0.0021117264,"about_ca_topic_score_gemma":0.0016403563,"teacher_disagreement_score":0.90612715,"about_ca_system_score_codex":0.000043869466,"about_ca_system_score_gemma":0.00014884229,"threshold_uncertainty_score":0.67292434},"labels":[],"label_agreement":null},{"id":"W2061750841","doi":"10.1109/glocom.2006.145","title":"GEN01-3: Robust Decoding for Channels with Impulse Noise","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Power Line Communications and Noise","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 British Columbia","funders":"","keywords":"Impulse noise; Computer science; Decoding methods; Gaussian noise; Viterbi decoder; Narrowband; Electronic engineering; Bit error rate; Noise measurement; Algorithm; Telecommunications; Engineering; Noise reduction; Artificial intelligence","score_opus":0.012217212111369856,"score_gpt":0.2059443856994251,"score_spread":0.19372717358805525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061750841","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.5793377,0.0025251834,0.38864684,0.00041900307,0.0006603413,0.00066613755,0.000098467804,0.0007721105,0.026874222],"genre_scores_gemma":[0.9696318,0.000045585613,0.029591424,0.000036061894,0.00020569231,0.00007289111,0.00006122794,0.00003682868,0.00031852457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947226,0.0000060244984,0.00013928127,0.000105960506,0.000052762894,0.00022371786],"domain_scores_gemma":[0.9995037,0.000031919517,0.000019579418,0.00036383927,0.000036640602,0.000044355253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000706533,0.00011570345,0.00011071116,0.000052653788,0.000087364635,0.000040872794,0.00019350402,0.00003986922,0.00002489253],"category_scores_gemma":[0.000005790984,0.000107018765,0.000043953998,0.00011698928,0.000014913199,0.00007081364,0.000029697054,0.00006286075,0.000022488055],"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.00007338889,0.00020717423,0.004654713,0.00017512352,0.00012841442,0.000009691018,0.00021002263,0.85638833,0.0044094976,0.0065281037,0.10214864,0.0250669],"study_design_scores_gemma":[0.002308341,0.0001474884,0.0068053068,0.00010894447,0.00007810648,0.00003744845,0.00008816576,0.6950902,0.0070900526,0.0015196669,0.28577173,0.000954583],"about_ca_topic_score_codex":0.000054779153,"about_ca_topic_score_gemma":0.00016785985,"teacher_disagreement_score":0.39029405,"about_ca_system_score_codex":0.00004040664,"about_ca_system_score_gemma":0.000011409902,"threshold_uncertainty_score":0.43640986},"labels":[],"label_agreement":null},{"id":"W2063531717","doi":"10.1109/glocom.2006.701","title":"WLC15-4: Enhanced Per-Flow Admission Control and QoS Provisioning in IEEE 802.11e Wireless LANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Quality of service; Computer science; Computer network; Provisioning; Admission control; Wireless Multimedia Extensions; Access control; Channel (broadcasting); IEEE 802; IEEE 802.11e-2005; Call Admission Control; Resource allocation; Wireless; Wireless network; Wi-Fi array; Telecommunications","score_opus":0.0055791159151229765,"score_gpt":0.23003036839482058,"score_spread":0.2244512524796976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063531717","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.3359179,0.00036964432,0.653911,0.0014199805,0.0006181501,0.0046605063,0.00000975003,0.00026920214,0.002823889],"genre_scores_gemma":[0.9900919,0.000010194259,0.008394503,0.00027808378,0.00031284802,0.00062709633,0.0000036735335,0.000013356389,0.00026835053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841255,0.000111179426,0.00032126153,0.00048352254,0.00023576798,0.00043570768],"domain_scores_gemma":[0.99923575,0.000112952526,0.00010727158,0.00037692083,0.000046281148,0.00012080826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002987679,0.00019797815,0.00028737934,0.00007828156,0.00015065198,0.0002317188,0.00045677475,0.00012202356,0.000021007962],"category_scores_gemma":[0.000010223905,0.00017115196,0.000050393843,0.00024204154,0.000034098506,0.00034613285,0.000108976354,0.00020821228,0.000025745336],"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.0002497602,0.0006408887,0.04223415,0.0002320309,0.00003436796,0.0001986363,0.0014460543,0.017239638,0.048424985,0.013918311,0.01590265,0.85947853],"study_design_scores_gemma":[0.007117672,0.00054232875,0.053904407,0.0007753798,0.000012801757,0.000041356216,0.000053207616,0.89519227,0.012422981,0.0039552697,0.024860863,0.001121448],"about_ca_topic_score_codex":0.00034681885,"about_ca_topic_score_gemma":0.00031347072,"teacher_disagreement_score":0.87795264,"about_ca_system_score_codex":0.000049097216,"about_ca_system_score_gemma":0.000079702935,"threshold_uncertainty_score":0.6979374},"labels":[],"label_agreement":null},{"id":"W2067856487","doi":"10.1109/glocom.2006.261","title":"NIS01-1: An Efficient Key Management Scheme for Heterogeneous Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Security in Wireless Sensor 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":"Université du Québec","funders":"","keywords":"Wireless sensor network; Computer science; Key management; Overhead (engineering); Scheme (mathematics); Key (lock); Computer network; Distributed computing; Key distribution in wireless sensor networks; Homogeneous; Computer security; Telecommunications; Wireless network; Wireless; Encryption","score_opus":0.008986656461933522,"score_gpt":0.22726327122442055,"score_spread":0.21827661476248703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067856487","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.13837911,0.0004189448,0.8560055,0.00039029276,0.0013522466,0.00077278673,0.000011190611,0.0006181147,0.0020518347],"genre_scores_gemma":[0.79107404,0.000016746391,0.20704085,0.0007094294,0.0006832524,0.00008234878,0.00004537207,0.000039788956,0.00030821064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752396,0.00007666936,0.00040581264,0.00079245056,0.00035526993,0.0008458469],"domain_scores_gemma":[0.9983227,0.000088773064,0.00013904841,0.0011826318,0.00010095373,0.0001658692],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002720135,0.00030597497,0.00027516458,0.00010216484,0.00027357193,0.00034567245,0.0011841747,0.00014753087,0.000015240863],"category_scores_gemma":[0.000005033948,0.00031954754,0.00016621864,0.00035105005,0.000057447643,0.00015016836,0.00033816358,0.00015289278,0.00006248673],"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.000026475604,0.0003406609,0.00023112477,0.000030951604,0.000050040977,0.00010799283,0.00009922233,0.91932523,0.000047237423,0.06017073,0.006032775,0.013537576],"study_design_scores_gemma":[0.0006627528,0.00009674521,0.0005077039,0.000021710417,0.000015293472,0.000047849084,0.000015509237,0.9755934,0.00031321927,0.0011130482,0.021212537,0.00040026556],"about_ca_topic_score_codex":0.00007217031,"about_ca_topic_score_gemma":0.00005804953,"teacher_disagreement_score":0.6526949,"about_ca_system_score_codex":0.00011609347,"about_ca_system_score_gemma":0.000013743085,"threshold_uncertainty_score":0.9999257},"labels":[],"label_agreement":null},{"id":"W2072334110","doi":"10.1109/glocom.2006.633","title":"WLC04-1: A Distributed BER-Based Power Control Algorithm for WCDMA Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Power control; Computer science; Signal-to-interference ratio; Bit error rate; Telecommunications link; Transmitter power output; Code division multiple access; Interference (communication); Quality of service; Signal-to-noise ratio (imaging); Algorithm; Spread spectrum; Convergence (economics); Power (physics); Real-time computing; Electronic engineering; Computer network; Engineering; Telecommunications; Transmitter; Decoding methods; Channel (broadcasting)","score_opus":0.012495300912548543,"score_gpt":0.2584105794732239,"score_spread":0.24591527856067533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072334110","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.00067615043,0.00066707726,0.9938789,0.0024004078,0.00037885824,0.0007869775,0.000224384,0.00029878833,0.0006884805],"genre_scores_gemma":[0.9531875,0.000003515981,0.04575367,0.00020236563,0.00015051561,0.00023333263,0.0001619185,0.000019528043,0.00028765178],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803895,0.00020995521,0.0003764641,0.0003906005,0.00041935247,0.0005646659],"domain_scores_gemma":[0.99747026,0.0005625736,0.00013677702,0.0013687027,0.00033722896,0.00012444028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053936604,0.00017838058,0.00027198115,0.00009631175,0.0002489138,0.00043336122,0.0018587909,0.00011015947,0.0000136183135],"category_scores_gemma":[0.00003914306,0.00017000623,0.00012804761,0.00050410535,0.00006920269,0.00023167371,0.00019935325,0.00017398008,0.00006784824],"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.0001226881,0.0020576864,0.0041928743,0.00015126754,0.00027105174,0.00007916283,0.0001426167,0.1313782,0.00059215206,0.23234822,0.44336617,0.1852979],"study_design_scores_gemma":[0.0015517054,0.00007232983,0.0017539546,0.00002356353,0.000004729119,0.000005177946,0.00000724971,0.92281765,0.00006609101,0.0005370061,0.0729694,0.00019113996],"about_ca_topic_score_codex":0.00035684605,"about_ca_topic_score_gemma":0.000034733297,"teacher_disagreement_score":0.95251137,"about_ca_system_score_codex":0.00016567613,"about_ca_system_score_gemma":0.000156741,"threshold_uncertainty_score":0.69326526},"labels":[],"label_agreement":null},{"id":"W2073066647","doi":"10.1109/glocom.2006.309","title":"NISp1-02: Security Issues in the IEEE 802.15.3 WPANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Bluetooth and Wireless Communication Technologies","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":"Université du Québec","funders":"","keywords":"Computer science; Computer security; IEEE 802; Security analysis; IEEE 802.15; IEEE 802.11w-2009; Wireless; Wireless network; Computer network; IEEE 802.11; Telecommunications","score_opus":0.010755598412822752,"score_gpt":0.24673143735906095,"score_spread":0.2359758389462382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073066647","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.8499422,0.006893908,0.022699889,0.09628415,0.000385776,0.00043870998,0.000010435104,0.0012675835,0.022077339],"genre_scores_gemma":[0.9946355,0.00020039384,0.004352928,0.00067373697,0.000029629886,0.000020682637,0.0000020521434,0.0000031078462,0.000081959704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992044,0.000087844965,0.00016420502,0.00019450921,0.00014145575,0.00020758418],"domain_scores_gemma":[0.9988362,0.00009927776,0.000048537622,0.0009705766,0.000029002438,0.000016389318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025981246,0.00009457289,0.000109391156,0.0000671053,0.00011841533,0.00016148367,0.0017530314,0.000073742514,0.000004000894],"category_scores_gemma":[0.000026629781,0.0000695271,0.00002854657,0.0003464491,0.000101269165,0.00023497407,0.000271522,0.00019976111,0.000042106494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025699896,0.00019561594,0.011595246,0.000017016233,0.0000055953824,0.0000150825545,0.0023072925,0.00005103874,0.00012427318,0.872393,0.06235233,0.050940923],"study_design_scores_gemma":[0.0007759378,0.000119241085,0.13235533,0.000050946226,0.000007097776,0.00005803266,0.001441463,0.023963662,0.0066300654,0.4964772,0.33747536,0.0006456651],"about_ca_topic_score_codex":0.001104435,"about_ca_topic_score_gemma":0.0010012607,"teacher_disagreement_score":0.37591583,"about_ca_system_score_codex":0.000015939902,"about_ca_system_score_gemma":0.000017010872,"threshold_uncertainty_score":0.32575977},"labels":[],"label_agreement":null},{"id":"W2073962778","doi":"10.1109/glocom.2006.717","title":"WLC18-3: Frequency-Domain Equalization Techniques for DS-UWB Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Ultra-Wideband Communications Technology","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Equalization (audio); Frequency domain; Computer science; Bit error rate; Domain (mathematical analysis); Time domain; Blind equalization; Electronic engineering; Computational complexity theory; Algorithm; Mathematics; Decoding methods; Engineering","score_opus":0.007263845968909205,"score_gpt":0.21580889864764186,"score_spread":0.20854505267873266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073962778","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.04074779,0.0036408505,0.87739426,0.00048628563,0.00046791797,0.0011509464,0.000089029316,0.0051729395,0.07084999],"genre_scores_gemma":[0.952315,0.0000648448,0.046670046,0.000026446249,0.00009237868,0.00044839588,0.00015209257,0.000042700798,0.00018812269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992471,0.000023733744,0.00029643322,0.00013113876,0.00007403527,0.00022755931],"domain_scores_gemma":[0.99924505,0.00006403028,0.0000443733,0.0005687155,0.00005645534,0.000021389076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014050212,0.00013171083,0.00016394265,0.00012328231,0.000085388594,0.000038287984,0.00034365407,0.00017193939,0.000012827207],"category_scores_gemma":[0.00002122035,0.00014238762,0.000047967253,0.00022869353,0.000035406734,0.000094788345,0.000025466383,0.00009547389,0.000027088889],"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.00000595406,0.00010753757,0.0025547494,0.00023452466,0.000066692795,0.0000026238608,0.00011187302,0.0025062757,0.07883335,0.8573694,0.04955546,0.008651546],"study_design_scores_gemma":[0.0010039549,0.00017160647,0.0013250079,0.00018862075,0.000067500056,0.00006399115,0.00031511605,0.018815681,0.06195522,0.27273834,0.64218724,0.0011677165],"about_ca_topic_score_codex":0.0002782197,"about_ca_topic_score_gemma":0.00018230332,"teacher_disagreement_score":0.91156715,"about_ca_system_score_codex":0.00013308063,"about_ca_system_score_gemma":0.000012170743,"threshold_uncertainty_score":0.5806399},"labels":[],"label_agreement":null},{"id":"W2074818683","doi":"10.1109/glocom.2006.593","title":"SPC11-3: Group-Based Block Linear Successive Interference Cancellation For DS-CDMA","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Single antenna interference cancellation; Beamforming; Interference (communication); Code division multiple access; Computer science; Smart antenna; Block (permutation group theory); Multiuser detection; Electronic engineering; Computational complexity theory; Telecommunications; Algorithm; Engineering; Mathematics; Directional antenna; Antenna (radio); Decoding methods","score_opus":0.021712208850863834,"score_gpt":0.28888064626403426,"score_spread":0.2671684374131704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074818683","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.017198553,0.0002794163,0.9762006,0.0031061887,0.0002853328,0.00046837877,0.0000137576535,0.00021381932,0.0022340014],"genre_scores_gemma":[0.9532462,0.000010587929,0.04575703,0.00019763925,0.00020627996,0.000103694976,0.00005233909,0.000013781714,0.00041247043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984803,0.00011937749,0.00031464087,0.00039807477,0.00028764995,0.00039992746],"domain_scores_gemma":[0.9980008,0.00046650018,0.00015330625,0.001025079,0.0002735165,0.00008077708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030792147,0.00015453693,0.00017265881,0.00011578859,0.0002264522,0.00021270142,0.0016137509,0.00008736957,0.000021770536],"category_scores_gemma":[0.000051337607,0.00015256775,0.00008107835,0.00049202837,0.0000722813,0.0003047601,0.00033146358,0.00018720773,0.000054627002],"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.00031275768,0.0013228775,0.020545384,0.00031489626,0.00010087596,0.000033384273,0.0005789405,0.30772725,0.007394523,0.32425436,0.10523906,0.2321757],"study_design_scores_gemma":[0.00063341705,0.00008908708,0.0032718848,0.00004149447,0.0000036718588,0.000001683196,0.000005783534,0.96849096,0.002604498,0.002118752,0.022530425,0.00020834328],"about_ca_topic_score_codex":0.0006656058,"about_ca_topic_score_gemma":0.0011233485,"teacher_disagreement_score":0.9360476,"about_ca_system_score_codex":0.00014811505,"about_ca_system_score_gemma":0.00013865138,"threshold_uncertainty_score":0.6221532},"labels":[],"label_agreement":null},{"id":"W2078220749","doi":"10.1109/glocom.2006.443","title":"QRP05-4: Internet Traffic Identification using Machine Learning","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Unsupervised learning; Cluster analysis; Artificial intelligence; Machine learning; Naive Bayes classifier; Supervised learning; Identification (biology); The Internet; Internet traffic; Classifier (UML); Conceptual clustering; Data mining; Fuzzy clustering; Artificial neural network; Support vector machine; Canopy clustering algorithm","score_opus":0.012768759855586146,"score_gpt":0.23331017150130598,"score_spread":0.22054141164571983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078220749","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.43887702,0.00019973877,0.5598423,0.00009645935,0.00027406806,0.00004550978,7.923471e-7,0.00019105918,0.00047309085],"genre_scores_gemma":[0.9923888,0.0000023822274,0.005857526,0.000060600687,0.00015586104,0.000002044436,0.000024411553,0.000011281117,0.0014971239],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985534,0.00009496763,0.00040988097,0.00040725432,0.00024857622,0.0002859428],"domain_scores_gemma":[0.99945885,0.000033617413,0.00019144513,0.00019965287,0.00007080091,0.00004563892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037867608,0.00015379538,0.0001817855,0.00012956404,0.00012827001,0.0003697673,0.000635619,0.00006202914,0.00006884916],"category_scores_gemma":[0.000020682357,0.00014796223,0.00013559143,0.0003298314,0.000026234591,0.00032561828,0.00013889794,0.00020155832,0.00016409003],"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.000009552646,0.00025778695,0.0035193043,0.00003188341,0.00009973971,0.00005892316,0.0014591194,0.6296059,0.002006378,0.32285127,0.002753315,0.037346847],"study_design_scores_gemma":[0.0001331176,0.00001694571,0.0007090103,0.000015885162,0.000014957961,0.0000232882,0.000020215522,0.99413395,0.0003543381,0.00003361639,0.004379265,0.00016540191],"about_ca_topic_score_codex":0.00037644268,"about_ca_topic_score_gemma":0.000427967,"teacher_disagreement_score":0.55398476,"about_ca_system_score_codex":0.00008321288,"about_ca_system_score_gemma":0.00002147731,"threshold_uncertainty_score":0.60337245},"labels":[],"label_agreement":null},{"id":"W2079266395","doi":"10.1109/glocom.2006.43","title":"CTH02-3: Simple Concatenated Codes Using Differential PSK","year":2006,"lang":"en","type":"article","venue":"Globecom","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 British Columbia","funders":"","keywords":"Concatenated error correction code; Algorithm; EXIT chart; Serial concatenated convolutional codes; Turbo code; Computer science; Block code; Decoding methods; Linear code; Additive white Gaussian noise; Low-density parity-check code; Theoretical computer science; Channel (broadcasting); Telecommunications","score_opus":0.011917770827242316,"score_gpt":0.24484559271418693,"score_spread":0.2329278218869446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079266395","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.6954787,0.0003555214,0.29790425,0.000025059364,0.000121991565,0.00014718148,0.00003569979,0.0019177585,0.004013889],"genre_scores_gemma":[0.9895534,0.000046328925,0.010136002,0.000018217823,0.000061960134,0.000012563421,0.00008963338,0.000037744536,0.000044162207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933213,0.000021809374,0.00022259392,0.00011274629,0.0000905195,0.0002201895],"domain_scores_gemma":[0.99949205,0.000031744497,0.00003711983,0.00037028492,0.00003410266,0.00003470493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000030376114,0.00014099608,0.00016462474,0.00005873315,0.00007935787,0.000033626107,0.00023829154,0.00007550959,0.00011997217],"category_scores_gemma":[0.0000059766317,0.00015040435,0.000044020348,0.00013897424,0.000043784396,0.00011969554,0.0000657105,0.00012827168,0.000024270868],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024977273,0.00020663512,0.009596876,0.00015189282,0.00012786167,0.000019844401,0.00014919153,0.15942796,0.7558935,0.020836744,0.021612944,0.031951558],"study_design_scores_gemma":[0.0008405273,0.000026591022,0.010362857,0.000056295812,0.000038810926,0.000018778124,0.000054241642,0.5188071,0.41286808,0.017279768,0.038785063,0.0008619018],"about_ca_topic_score_codex":0.00025521053,"about_ca_topic_score_gemma":0.000077511875,"teacher_disagreement_score":0.3593791,"about_ca_system_score_codex":0.000109009576,"about_ca_system_score_gemma":0.0000065536437,"threshold_uncertainty_score":0.61333114},"labels":[],"label_agreement":null},{"id":"W2080699736","doi":"10.1109/glocom.2006.794","title":"WLC31-2: Capacity of MIMO Rician Fading Channels with Transmitter and Receiver Channel State Information","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems 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":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Rician fading; MIMO; Transmitter; Channel state information; Fading; Channel (broadcasting); Channel capacity; Computer science; Ergodic theory; Topology (electrical circuits); Precoding; Mathematics; Telecommunications; Electronic engineering; Control theory (sociology); Wireless; Engineering; Mathematical analysis","score_opus":0.005304989565263642,"score_gpt":0.16771552703550066,"score_spread":0.162410537470237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080699736","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.33944455,0.00008462965,0.65692925,0.000026703092,0.00015165185,0.00023895616,0.00003884603,0.00013830436,0.0029471442],"genre_scores_gemma":[0.99636745,0.00002162259,0.0034585032,0.000019583398,0.000033928492,0.000011312004,0.000025462456,0.000015539139,0.00004659694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994359,0.000010105922,0.00022960664,0.00007778999,0.00008200164,0.00016459436],"domain_scores_gemma":[0.9997451,0.000011469757,0.00006277659,0.00009684132,0.000053114836,0.000030725667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005877332,0.0001206987,0.00015269645,0.00009515822,0.000034217122,0.00002051838,0.000044602693,0.000046855188,0.000006079436],"category_scores_gemma":[0.000002778672,0.000113697024,0.000016781318,0.00015073185,0.000025117695,0.00065721176,0.000005812713,0.00006368909,0.000006414324],"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.000012093572,0.000007005676,0.000573013,0.00018665844,0.000018525352,8.344368e-7,0.0017879346,0.9943284,0.00055513554,0.00008257956,0.00024859016,0.002199245],"study_design_scores_gemma":[0.00400658,0.00023059071,0.019008689,0.00063034333,0.00008162613,0.00007022926,0.0007416976,0.9189901,0.043633137,0.002495987,0.008738018,0.0013729992],"about_ca_topic_score_codex":0.00023771187,"about_ca_topic_score_gemma":0.00009977346,"teacher_disagreement_score":0.65692294,"about_ca_system_score_codex":0.00004486886,"about_ca_system_score_gemma":0.0000039454458,"threshold_uncertainty_score":0.46364298},"labels":[],"label_agreement":null},{"id":"W2083185260","doi":"10.1109/glocom.2006.806","title":"WLC33-2: On Relaying in Cooperative Static Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Relay; Computer science; Signal-to-noise ratio (imaging); Channel (broadcasting); Maximal-ratio combining; Outage probability; Power (physics); Electronic engineering; Computer network; Topology (electrical circuits); Telecommunications; Engineering; Fading; Electrical engineering; Physics","score_opus":0.027398959412582292,"score_gpt":0.2714228325759955,"score_spread":0.24402387316341317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083185260","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.38234803,0.0016986768,0.46431503,0.017584143,0.0015185772,0.0009769885,0.000006445543,0.00063800055,0.13091412],"genre_scores_gemma":[0.9951265,0.00007957516,0.0029447307,0.001049909,0.000049283753,0.000023349492,0.000005324189,0.00000627143,0.00071507227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989827,0.00017046134,0.00022383865,0.00025572535,0.00013699378,0.00023028272],"domain_scores_gemma":[0.9992169,0.00015006182,0.000050549534,0.00048440474,0.000060419545,0.000037628044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024907026,0.00011677022,0.00013795834,0.00011075885,0.00015151643,0.00014757211,0.0006015228,0.000033144588,0.00003916787],"category_scores_gemma":[0.000036084257,0.000109930996,0.000028258844,0.00057024346,0.00002569304,0.00025350027,0.00020275434,0.00018017089,0.00016695725],"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.0000144135465,0.00032445448,0.002442281,0.00000839818,0.000011385071,0.000046139998,0.0017210434,0.03695279,0.00064657046,0.87836945,0.01748329,0.0619798],"study_design_scores_gemma":[0.0029317355,0.00044534204,0.039764054,0.00042251823,0.000005941762,0.000021447662,0.00020404611,0.8385954,0.003795455,0.01684601,0.095758855,0.0012091834],"about_ca_topic_score_codex":0.00004626668,"about_ca_topic_score_gemma":0.00020570021,"teacher_disagreement_score":0.86152345,"about_ca_system_score_codex":0.000100621284,"about_ca_system_score_gemma":0.00004073722,"threshold_uncertainty_score":0.44828558},"labels":[],"label_agreement":null},{"id":"W2083443394","doi":"10.1109/glocom.2006.418","title":"QRP01-1: Optimal Routing of Dynamically Priced Network Services","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Victoria","funders":"","keywords":"Bottleneck; Computer science; Heuristics; Quality of service; Computer network; Bandwidth (computing); Tabu search; Service (business); Mathematical optimization; Distributed computing; Algorithm; Mathematics","score_opus":0.002343904617799321,"score_gpt":0.17905921532048918,"score_spread":0.17671531070268987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083443394","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.1723289,0.00041883223,0.81728053,0.0008181717,0.0005861686,0.00017718658,0.0000029886319,0.00035537384,0.0080318265],"genre_scores_gemma":[0.9553422,0.0000033906033,0.04387872,0.00023988778,0.00030938748,0.0000057250845,0.000007599582,0.0000067079636,0.00020639972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987753,0.00005172451,0.0003270971,0.00028154044,0.00021134784,0.00035298383],"domain_scores_gemma":[0.9992382,0.00009042512,0.00017148837,0.00035905326,0.000084298576,0.000056528588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022258423,0.00012929071,0.00020272718,0.000027672699,0.00009552186,0.00008604033,0.0007316386,0.00006634048,0.0000151923905],"category_scores_gemma":[0.0000036055421,0.0001225763,0.00007866586,0.00033838162,0.000027883509,0.00020049229,0.0001701432,0.00009789334,0.000044542114],"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.00003502788,0.00017304833,0.012477025,0.00004208213,0.000059771617,0.000025206926,0.00015278666,0.34937826,0.00023523331,0.4212691,0.003282003,0.21287046],"study_design_scores_gemma":[0.0004464218,0.000045400226,0.019083502,0.000040525752,0.000011407388,0.000007932148,0.000010296555,0.9755367,0.000015463085,0.0015608404,0.0030676203,0.0001739153],"about_ca_topic_score_codex":0.000120543875,"about_ca_topic_score_gemma":0.0001047686,"teacher_disagreement_score":0.7830133,"about_ca_system_score_codex":0.000023942817,"about_ca_system_score_gemma":0.000042809243,"threshold_uncertainty_score":0.49985164},"labels":[],"label_agreement":null},{"id":"W2095346903","doi":"10.1109/glocom.2006.799","title":"WLC32-1: ARQ for MIMO OFDM Systems with Non-Linear Preprocessing","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Computer science; Orthogonal frequency-division multiplexing; Automatic repeat request; Fading; Transmitter; MIMO; Channel (broadcasting); Algorithm; Selective Repeat ARQ; Transmission (telecommunications); Throughput; Channel state information; MIMO-OFDM; Hybrid automatic repeat request; Computer network; Telecommunications; Wireless","score_opus":0.008702311227695643,"score_gpt":0.23626518467503577,"score_spread":0.22756287344734014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095346903","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.029229395,0.0010614664,0.9585547,0.000038821137,0.000095798416,0.0004970891,0.000019794074,0.0013098973,0.009193035],"genre_scores_gemma":[0.9142214,0.000026946353,0.08499342,0.000013803434,0.00010556746,0.00022752839,0.000035748708,0.000053932814,0.00032161947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930906,0.0000080459085,0.0002221338,0.00015597093,0.000093904,0.000210854],"domain_scores_gemma":[0.9992972,0.00004666042,0.00005773634,0.0004893314,0.00007707927,0.00003197002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007914327,0.00014398342,0.00017784316,0.000051583123,0.00008129286,0.00004014294,0.00024146923,0.000066323155,0.000003338448],"category_scores_gemma":[0.000007260164,0.00013584473,0.000031695905,0.00013664943,0.000029619556,0.0001704673,0.000028049235,0.00009777327,0.0000113158585],"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.000059370934,0.00013932055,0.0029838216,0.001504345,0.00008487588,0.0000059858803,0.0002155682,0.94298315,0.013080242,0.004639028,0.014717833,0.019586464],"study_design_scores_gemma":[0.0010447339,0.00009875336,0.0011157116,0.00053096935,0.00003532985,0.000026842423,0.000148071,0.83215094,0.058560446,0.0016454441,0.103876516,0.0007662307],"about_ca_topic_score_codex":0.00007639261,"about_ca_topic_score_gemma":0.000037561713,"teacher_disagreement_score":0.88499206,"about_ca_system_score_codex":0.00007794888,"about_ca_system_score_gemma":0.000014596607,"threshold_uncertainty_score":0.5539588},"labels":[],"label_agreement":null},{"id":"W2095376975","doi":"10.1109/glocom.2006.978","title":"WSN15-3: Optimal Resource Allocation for Homogeneous Wireless Multicast","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","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":"Multicast; Computer science; Computer network; Distributed computing; Source-specific multicast; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Wireless network; Wireless ad hoc network; Asynchronous communication; Resource allocation; Wireless","score_opus":0.008572975009139411,"score_gpt":0.2243540668526798,"score_spread":0.21578109184354038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095376975","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.057589646,0.00017461223,0.93835455,0.0006402805,0.0002863906,0.00045267193,0.000008300348,0.00027612582,0.0022173934],"genre_scores_gemma":[0.89687127,0.0000029250104,0.10141285,0.00026615104,0.00040698392,0.000110815425,0.000030497484,0.000018933975,0.0008795928],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863714,0.000040981213,0.0002581005,0.000450798,0.00019926275,0.00041370397],"domain_scores_gemma":[0.99894536,0.00013333272,0.00009423864,0.0006618469,0.000086347194,0.000078856836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020192008,0.00015507593,0.00015877819,0.000045615612,0.00016067948,0.00016674394,0.000804868,0.00009202485,0.000011369402],"category_scores_gemma":[0.000013208607,0.0001605988,0.00008620373,0.00022760681,0.000040981307,0.00018080034,0.00018321155,0.00008659702,0.00007151799],"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.00007389891,0.00058034423,0.0013085041,0.00006448582,0.000055564222,0.00009238264,0.00042268776,0.1794103,0.0026037262,0.21695168,0.1299856,0.4684508],"study_design_scores_gemma":[0.0005937396,0.00008850003,0.0015636616,0.000015929905,0.000009974316,0.000052013904,0.000011986241,0.86814994,0.0019346365,0.0009587865,0.12633903,0.00028180884],"about_ca_topic_score_codex":0.00011195499,"about_ca_topic_score_gemma":0.00009451428,"teacher_disagreement_score":0.8392816,"about_ca_system_score_codex":0.00007686598,"about_ca_system_score_gemma":0.00004206439,"threshold_uncertainty_score":0.65490294},"labels":[],"label_agreement":null},{"id":"W2096017667","doi":"10.1109/glocom.2006.610","title":"SPCp1-08: Adaptive Learning of Transmission Control Policies for MIMO Fading Channels under Delay Constraint","year":2006,"lang":"en","type":"article","venue":"Globecom","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 British Columbia","funders":"","keywords":"Fading; Markov decision process; Computer science; MIMO; Mathematical optimization; Transmission (telecommunications); Convergence (economics); Markov process; Constraint (computer-aided design); Q-learning; Transmitter; Channel (broadcasting); Power control; Reinforcement learning; Resource allocation; Wireless; Power (physics); Mathematics; Telecommunications; Computer network; Artificial intelligence; Statistics","score_opus":0.00894306168979507,"score_gpt":0.21723389741076962,"score_spread":0.20829083572097457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096017667","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.02174369,0.0005474622,0.9755318,0.00005906375,0.00015595615,0.000337242,0.000025323188,0.00021137862,0.0013880564],"genre_scores_gemma":[0.98489326,0.000043460997,0.014723789,0.000023248234,0.00013445558,0.000022531476,0.00003558671,0.000041561147,0.00008208824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914753,0.000022754672,0.0002874755,0.00014157391,0.00009857823,0.0003020624],"domain_scores_gemma":[0.9995803,0.00014560136,0.00007459773,0.00008302121,0.00006976541,0.000046699006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008279132,0.00016603485,0.000257712,0.00007466569,0.000082805804,0.000014582153,0.000075875454,0.000098190416,0.000024744948],"category_scores_gemma":[0.000008617758,0.00017460265,0.0000832527,0.0001335551,0.000054551267,0.00010965101,0.0000067368287,0.00011616829,0.000002831653],"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.000030391086,0.000011856152,0.000101545775,0.000033998153,0.000031318392,8.3499646e-7,0.00013443825,0.9867941,0.003304661,0.004962086,0.00019448074,0.0044002775],"study_design_scores_gemma":[0.0011770609,0.000065188484,0.00020529657,0.000093012546,0.000029506406,0.0000052693495,0.00018869665,0.9902669,0.0043673124,0.001400572,0.0019943637,0.00020682934],"about_ca_topic_score_codex":0.000038660553,"about_ca_topic_score_gemma":0.000009642111,"teacher_disagreement_score":0.9631496,"about_ca_system_score_codex":0.00008176102,"about_ca_system_score_gemma":0.000014016196,"threshold_uncertainty_score":0.71200895},"labels":[],"label_agreement":null},{"id":"W2096668092","doi":"10.1109/glocom.2006.709","title":"WLC17-1: Performance Analysis of a Reservation Based Connection Admission Scheme in 802.16 Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":18,"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; Reservation; Wireless broadband; IEEE 802; Call Admission Control; Scheme (mathematics); IEEE 802.11e-2005; Broadband networks; Service (business); Revenue; Bandwidth (computing); Admission control; Differentiated services; Wireless network; Wireless; Broadband; Telecommunications; Mathematics","score_opus":0.006523415383979554,"score_gpt":0.20416830415924136,"score_spread":0.19764488877526182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096668092","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.5555498,0.00016369262,0.44335407,0.000018322116,0.0000887754,0.000093874296,0.000002714255,0.00011158062,0.00061718625],"genre_scores_gemma":[0.9919442,0.00007630178,0.0075231153,0.000015898455,0.000059430637,0.000015881395,0.00031486407,0.000019089015,0.00003124397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915546,0.000025069594,0.0003466502,0.00015139906,0.0001308951,0.00019050449],"domain_scores_gemma":[0.999581,0.00004628749,0.00008389456,0.00019950116,0.000060187063,0.00002913142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013680878,0.000117590884,0.00022624548,0.00033255122,0.000033955912,0.000010178187,0.000075570606,0.00010617174,0.00007408217],"category_scores_gemma":[0.00001740703,0.00013135927,0.000056504174,0.0019579425,0.000013563978,0.00022308106,0.000012499207,0.00011236716,0.0000018275877],"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.000022042283,0.000020691745,0.08135906,0.000023407496,0.000022915892,3.930776e-7,0.0000058068267,0.915617,0.00032918138,0.000052131254,0.00026629496,0.002281098],"study_design_scores_gemma":[0.0003185296,0.000014397092,0.0937604,0.00005021752,0.000039189592,1.4363818e-7,0.000006025456,0.9045495,0.0008077676,0.000023720931,0.0003151645,0.000114941045],"about_ca_topic_score_codex":0.00011694228,"about_ca_topic_score_gemma":0.00057658716,"teacher_disagreement_score":0.4363944,"about_ca_system_score_codex":0.00019783825,"about_ca_system_score_gemma":0.000011280471,"threshold_uncertainty_score":0.53566754},"labels":[],"label_agreement":null},{"id":"W2097387210","doi":"10.1109/glocom.2006.851","title":"WLC40-5: Efficient Approximations for Call Admission Control Performance Evaluations in Multi-Service Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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 British Columbia","funders":"","keywords":"Quality of service; Computer science; Call Admission Control; Blocking (statistics); Call blocking; Markov chain; Admission control; Markov process; Channel (broadcasting); Mathematical optimization; Computer network; Mathematics; Wireless network; Wireless; Machine learning","score_opus":0.03997982443639401,"score_gpt":0.32555945131505976,"score_spread":0.2855796268786657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097387210","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.024445025,0.00045661817,0.9697381,0.0034073503,0.00014966907,0.0011253398,0.000008892904,0.00013758504,0.0005313684],"genre_scores_gemma":[0.93551403,0.000026131904,0.06331885,0.00028560133,0.00006377826,0.000502681,0.000047238074,0.00001333348,0.00022837504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981316,0.00021301727,0.00044581006,0.0003662577,0.00035500445,0.00048833917],"domain_scores_gemma":[0.9979427,0.0004406251,0.00012423219,0.0009957468,0.0003909672,0.000105717285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009979865,0.00015237075,0.000189548,0.00017507664,0.0003504818,0.00015860717,0.0014000348,0.00010476561,0.000013801281],"category_scores_gemma":[0.00008110855,0.00014865058,0.00006225796,0.00103939,0.000033777687,0.0002559417,0.00027837098,0.0002509184,0.000039065537],"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.000013395786,0.00029523668,0.0019546577,0.000021324237,0.000004853298,4.1206434e-7,0.00010150603,0.97130793,0.000058255293,0.0050859395,0.0011004092,0.0200561],"study_design_scores_gemma":[0.0016200447,0.000026992757,0.044951458,0.000044040047,0.0000036206764,0.0000020683412,0.000007812644,0.9485992,0.000035319463,0.00013708581,0.0044183168,0.00015399605],"about_ca_topic_score_codex":0.00022923865,"about_ca_topic_score_gemma":0.0008514298,"teacher_disagreement_score":0.911069,"about_ca_system_score_codex":0.00019237965,"about_ca_system_score_gemma":0.0001743146,"threshold_uncertainty_score":0.6061795},"labels":[],"label_agreement":null},{"id":"W2098903679","doi":"10.1109/glocom.2006.687","title":"WLC13-2: Reduced-Outage-Probability Algorithms for Cross-Layer Call Admission Control in CDMA Beamforming Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Beamforming; Computer science; Power control; Telecommunications link; Code division multiple access; Outage probability; Physical layer; Context (archaeology); Algorithm; Power (physics); Computer network; Fading; Telecommunications; Wireless; Decoding methods","score_opus":0.04385464867416883,"score_gpt":0.3344374596736958,"score_spread":0.290582810999527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098903679","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.12849964,0.0010423326,0.8643355,0.0017521343,0.0006727038,0.0018399965,0.00003295282,0.00028343007,0.0015413334],"genre_scores_gemma":[0.9708662,0.000012585457,0.027760185,0.000096269694,0.00021530644,0.00034096296,0.000022712282,0.000020805155,0.0006649463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971002,0.000289629,0.00072554586,0.00063700124,0.0004973389,0.00075031514],"domain_scores_gemma":[0.99719083,0.0005462078,0.00018442851,0.0015903765,0.00030592637,0.00018222914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017428655,0.00022659538,0.0003719945,0.00015238469,0.00029592548,0.00054034236,0.002070557,0.00018981856,0.000008933856],"category_scores_gemma":[0.00017411532,0.00021175538,0.00012577904,0.00056092395,0.000095526746,0.0006378842,0.0004920191,0.000346465,0.000030116802],"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.00055005244,0.0027337878,0.13176616,0.00095252186,0.00013976778,0.00009536357,0.0012471412,0.43589902,0.013754276,0.15438499,0.03860546,0.21987148],"study_design_scores_gemma":[0.001695208,0.00006745557,0.013553593,0.000092076465,0.000003040057,0.000009766003,0.000013303445,0.96102506,0.00043327227,0.0032735707,0.019546049,0.000287582],"about_ca_topic_score_codex":0.0015016663,"about_ca_topic_score_gemma":0.00026326164,"teacher_disagreement_score":0.8423666,"about_ca_system_score_codex":0.00041909938,"about_ca_system_score_gemma":0.00022575619,"threshold_uncertainty_score":0.8635134},"labels":[],"label_agreement":null},{"id":"W2103375672","doi":"10.1109/glocom.2006.320","title":"NXG01-3: Rate Allocation under Network End-to-End Quality-of-Service Requirements","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Quality of service; End-to-end principle; Computer network; Probabilistic logic; End-to-end delay; Bandwidth (computing); Bandwidth allocation; Queue; Network delay; Queuing delay; Mathematical optimization; Network packet; Distributed computing","score_opus":0.03039839090807506,"score_gpt":0.27930735120166794,"score_spread":0.24890896029359288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103375672","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.05855669,0.00032576115,0.920802,0.0116914185,0.0012728528,0.0003588202,0.0000054154116,0.00028155802,0.006705497],"genre_scores_gemma":[0.98356867,0.000004838355,0.010352017,0.0049679433,0.0004033849,0.000024466433,0.000019501838,0.000010238321,0.00064892566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981482,0.00021702121,0.00050454715,0.0004030897,0.00033411433,0.00039303143],"domain_scores_gemma":[0.99872166,0.00016156575,0.0002060419,0.0006166661,0.00019327903,0.00010077881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080020254,0.00016596563,0.00023732452,0.00005468799,0.00013040757,0.000100608246,0.0007442621,0.000072616116,0.000075096534],"category_scores_gemma":[0.000014138154,0.00016804811,0.000067591805,0.0007343603,0.000024476127,0.00028768,0.00016684284,0.00009331279,0.00022698035],"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.00004843845,0.00016464069,0.0026643274,0.000026062127,0.00006239628,0.0000039659158,0.000121793644,0.13241576,0.00086863496,0.62815213,0.01681931,0.21865255],"study_design_scores_gemma":[0.005678602,0.00047031135,0.36186874,0.00030740877,0.00011222769,0.000013735997,0.00012700116,0.3679453,0.001004663,0.12158944,0.13875686,0.0021257051],"about_ca_topic_score_codex":0.0008823853,"about_ca_topic_score_gemma":0.0015155001,"teacher_disagreement_score":0.925012,"about_ca_system_score_codex":0.00006202226,"about_ca_system_score_gemma":0.00008981941,"threshold_uncertainty_score":0.68528026},"labels":[],"label_agreement":null},{"id":"W2104679346","doi":"10.1109/glocom.2006.293","title":"NIS06-3: A Game Theoretic Approach to Detect Network Intrusions: The Cooperative Intruders Scenario","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Security and Intrusion Detection","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":"Concordia University","funders":"","keywords":"Computer science; Game theory; Network packet; Intrusion detection system; Router; Computer network; Node (physics); Sampling (signal processing); Distributed computing; Constraint (computer-aided design); Computer security; Engineering; Mathematics; Telecommunications; Mathematical economics","score_opus":0.008616222734882701,"score_gpt":0.2110690335392339,"score_spread":0.2024528108043512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104679346","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.022906587,0.00064795715,0.9458863,0.00346997,0.0012955344,0.000885202,0.0000030900496,0.0004055257,0.024499813],"genre_scores_gemma":[0.97339153,0.0000474726,0.021996519,0.003178524,0.0009281086,0.00011223539,0.000005962136,0.00001924658,0.0003203818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977654,0.00034173974,0.0003582783,0.0005776031,0.00036158925,0.0005953647],"domain_scores_gemma":[0.9986111,0.00018582186,0.00010624896,0.0008477403,0.00012031031,0.000128782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006594994,0.00025888014,0.00024068737,0.0000825069,0.0006632787,0.00047469273,0.0012930167,0.0001215088,0.00006549587],"category_scores_gemma":[0.00007018421,0.00017915998,0.000108901055,0.0014202702,0.00016543326,0.00030217756,0.0006322791,0.0003987182,0.00026564268],"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.000076057484,0.00014239406,0.00008880382,0.0000133915255,0.000042579035,0.000010734852,0.0019721813,0.095395125,0.00015401989,0.723931,0.09780995,0.08036377],"study_design_scores_gemma":[0.0009809514,0.0005790862,0.00262468,0.00011158764,0.00004002791,0.00018483248,0.00022125358,0.44368964,0.0012913027,0.2382412,0.3109566,0.001078863],"about_ca_topic_score_codex":0.0003386765,"about_ca_topic_score_gemma":0.00033163434,"teacher_disagreement_score":0.950485,"about_ca_system_score_codex":0.000112367794,"about_ca_system_score_gemma":0.00008039342,"threshold_uncertainty_score":0.73059314},"labels":[],"label_agreement":null},{"id":"W2105054553","doi":"10.1109/glocom.2006.488","title":"WSN05-1: A Dual Busy-Tone MAC Scheme Supporting Voice/Data Traffic in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","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":"Computer science; Computer network; Wireless ad hoc network; Dual (grammatical number); Scheme (mathematics); Tone (literature); Wireless; Telecommunications","score_opus":0.020796519274252162,"score_gpt":0.2905020568914703,"score_spread":0.26970553761721816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105054553","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.780299,0.0026582847,0.20637257,0.0021196546,0.0010513655,0.0053899004,0.00004869349,0.00079272414,0.0012678113],"genre_scores_gemma":[0.9756638,0.000069703005,0.021888763,0.00042472608,0.00079205516,0.0006140691,0.00017790665,0.000043089098,0.00032593677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965886,0.00014760112,0.00079709553,0.0010077282,0.00036596152,0.001093023],"domain_scores_gemma":[0.9977051,0.00014786291,0.00031372797,0.0016069465,0.00006370757,0.00016264369],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009944492,0.00035022252,0.00046665256,0.00012226733,0.00018702116,0.00040778134,0.0021569903,0.00023288648,0.00004615063],"category_scores_gemma":[0.000017388735,0.00035210594,0.00009197579,0.0009861082,0.000076480894,0.00082725025,0.0011269491,0.00050834735,0.00008584896],"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.00008768723,0.00063190534,0.014231778,0.000098628734,0.00004606165,0.00071500614,0.0002699109,0.03480266,0.00015633563,0.007630993,0.040773477,0.90055555],"study_design_scores_gemma":[0.001270024,0.000088175024,0.010013698,0.00016094377,0.000007304067,0.00007040494,0.000038672453,0.9608021,0.000052985415,0.00045216188,0.026444282,0.0005992427],"about_ca_topic_score_codex":0.00025888972,"about_ca_topic_score_gemma":0.0024409108,"teacher_disagreement_score":0.92599946,"about_ca_system_score_codex":0.00009038878,"about_ca_system_score_gemma":0.00015058147,"threshold_uncertainty_score":0.99989307},"labels":[],"label_agreement":null},{"id":"W2107043707","doi":"10.1109/glocom.2006.707","title":"WLC16-4: Low-Complexity Turbo Equalization for Alamouti Space-Time Block Coded EDGE Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Space–time block code; Computer science; Turbo code; Algorithm; Convolutional code; Turbo; MIMO; Block code; Equalization (audio); Decoding methods; Bit error rate; Fading; Spectral efficiency; Enhanced Data Rates for GSM Evolution; Electronic engineering; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.016017114974753336,"score_gpt":0.24307899905729566,"score_spread":0.22706188408254233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107043707","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.11439315,0.0024017617,0.8587612,0.0002668689,0.00073108193,0.0023318985,0.0003461047,0.0066080065,0.014159915],"genre_scores_gemma":[0.9824207,0.000039270762,0.016020024,0.000022152752,0.00016599084,0.00019024126,0.00031610383,0.00007201777,0.00075352186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.000044085427,0.00038974342,0.0001965151,0.00014066148,0.0003051593],"domain_scores_gemma":[0.99898934,0.0001242848,0.000096109834,0.00063748483,0.00009959578,0.000053199703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014469611,0.00021443823,0.00028082432,0.00008759295,0.000112474394,0.0000630391,0.00034129157,0.00013229185,0.00002460528],"category_scores_gemma":[0.000031865882,0.00024201913,0.00007639182,0.00019140233,0.000052640054,0.00016769746,0.000060837963,0.00011173143,0.000068157555],"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.000059908678,0.0003286575,0.0007785021,0.0013878916,0.00011599453,0.0000042736265,0.00031329368,0.5311255,0.09428799,0.21307203,0.15388013,0.0046458347],"study_design_scores_gemma":[0.0012113913,0.00005856946,0.0011180377,0.00023235896,0.00004342343,0.000012612432,0.000055079563,0.7917738,0.10382908,0.013974003,0.08665649,0.0010351593],"about_ca_topic_score_codex":0.00012102611,"about_ca_topic_score_gemma":0.00004343457,"teacher_disagreement_score":0.8680275,"about_ca_system_score_codex":0.0002070967,"about_ca_system_score_gemma":0.000013445053,"threshold_uncertainty_score":0.98692536},"labels":[],"label_agreement":null},{"id":"W2107893226","doi":"10.1109/glocom.2006.855","title":"WLC41-3: On the Performance of Cooperative Wireless Fixed Relays in Asymmetric Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":19,"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":"Relay; Computer science; Hop (telecommunications); Computer network; Reliability (semiconductor); Wireless; Node (physics); Wireless network; Outage probability; Signal strength; Expression (computer science); Relay channel; Bit error rate; Topology (electrical circuits); Telecommunications; Channel (broadcasting); Engineering; Electrical engineering; Power (physics); Fading","score_opus":0.0250920193219738,"score_gpt":0.24538923958885522,"score_spread":0.22029722026688142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107893226","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.9628316,0.00044058746,0.009198644,0.003705703,0.0002886219,0.00030048136,0.0000021068727,0.000061658175,0.023170581],"genre_scores_gemma":[0.99843746,0.00021080166,0.00039055123,0.00035584427,0.000035270907,0.00003210289,0.0000028042436,0.00000487828,0.0005302607],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989877,0.00019116646,0.00025996272,0.00019875607,0.00017299326,0.00018947422],"domain_scores_gemma":[0.9988934,0.00026195066,0.00009517426,0.0006193066,0.00010773212,0.000022474838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042504666,0.000112540656,0.00016162593,0.0001825879,0.00015635186,0.000060366543,0.0009673334,0.000038520455,0.000030024534],"category_scores_gemma":[0.000030581177,0.000080394624,0.00003789086,0.001807612,0.00005365226,0.00018072873,0.0002508853,0.00019936136,0.000035458357],"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.00003627893,0.0005022281,0.017779225,0.000016690028,0.000022746595,0.0000068401937,0.001494334,0.017882057,0.0015619708,0.7727929,0.014366,0.17353876],"study_design_scores_gemma":[0.0008255937,0.00032951077,0.08929162,0.00017475335,0.0000034330342,0.0000054076922,0.000052384567,0.87605983,0.022944398,0.00031533113,0.009632675,0.00036504836],"about_ca_topic_score_codex":0.00003209333,"about_ca_topic_score_gemma":0.00007708164,"teacher_disagreement_score":0.8581778,"about_ca_system_score_codex":0.000058418096,"about_ca_system_score_gemma":0.000035722427,"threshold_uncertainty_score":0.32783976},"labels":[],"label_agreement":null},{"id":"W2110919149","doi":"10.1109/glocom.2006.365","title":"OPN02-2: Inter-Group Shared Protection (I-GSP): A Scalable Solution for Survivable WDM Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Optical Network Technologies","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 Waterloo","funders":"","keywords":"Scalability; Computer science; Integer programming; Linear programming; Routing (electronic design automation); Distributed computing; Computer network; Upper and lower bounds; Scheme (mathematics); Integer (computer science); Wavelength-division multiplexing; Path (computing); Mathematical optimization; Mathematics; Algorithm","score_opus":0.011024601558332889,"score_gpt":0.20488982435621084,"score_spread":0.19386522279787793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110919149","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.007810975,0.00055857864,0.98631763,0.00014950382,0.0005316442,0.00075345626,0.000019303483,0.0021889359,0.0016699717],"genre_scores_gemma":[0.8953332,0.00003862332,0.10317843,0.000024685318,0.00041886274,0.00054258,0.00010634378,0.00007235752,0.00028492362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987702,0.000012182408,0.0002907421,0.00026711661,0.0000950069,0.0005647669],"domain_scores_gemma":[0.9995244,0.000054703272,0.00004206922,0.00028822338,0.00004878603,0.000041791147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013828372,0.00020921999,0.00022349016,0.00007135483,0.0001266875,0.00007124228,0.0002016023,0.0002416461,0.00003009987],"category_scores_gemma":[0.000043936147,0.0002202925,0.00008434182,0.0003286063,0.00005037007,0.00028017146,0.00007476143,0.00023660633,0.000035586647],"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.00008570358,0.00010698336,0.0004628259,0.00016208309,0.00005610244,0.000004115614,0.000007728108,0.8060898,0.0050096163,0.008831548,0.026784072,0.1523994],"study_design_scores_gemma":[0.00035782054,0.00009095608,0.00051641266,0.00006026213,0.000013783784,0.0000048526563,0.000016298694,0.9589042,0.0006264213,0.014716628,0.024394304,0.00029808364],"about_ca_topic_score_codex":0.00012247087,"about_ca_topic_score_gemma":0.00030031,"teacher_disagreement_score":0.8875222,"about_ca_system_score_codex":0.00023207557,"about_ca_system_score_gemma":0.0000047813705,"threshold_uncertainty_score":0.89832675},"labels":[],"label_agreement":null},{"id":"W2113774834","doi":"10.1109/glocom.2006.1011","title":"WSNp1-6: Applying Peer-to-Peer Asynchronous Publish Subscribe Message Middleware to Mobile Ah Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Opportunistic and Delay-Tolerant Networks","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 Guelph","funders":"","keywords":"Computer science; Computer network; Asynchronous communication; Mobile ad hoc network; Middleware (distributed applications); Wireless ad hoc network; Node (physics); Network packet; Message oriented middleware; Distributed computing; Message broker; Message passing; Mobile computing; Wireless; Operating system; Software architecture","score_opus":0.012065312311818682,"score_gpt":0.2307891886440039,"score_spread":0.21872387633218524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113774834","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.010011443,0.00092403457,0.9584199,0.0023078558,0.0023210393,0.0012918237,0.000043467437,0.00067795167,0.024002442],"genre_scores_gemma":[0.950822,0.000015022564,0.03538059,0.0034860743,0.0013348248,0.00065367337,0.000150929,0.00005964082,0.008097278],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955693,0.0001043947,0.0006755979,0.0011397033,0.0011616176,0.0013493891],"domain_scores_gemma":[0.9969506,0.00015844009,0.00016768265,0.0014416968,0.00056561886,0.000715953],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00093495206,0.0004927953,0.00055627775,0.00021707169,0.00043024562,0.0014150215,0.0020363515,0.00028295204,0.00020925462],"category_scores_gemma":[0.000024311965,0.000498027,0.00019871283,0.0012628294,0.00006066859,0.000757604,0.0009358419,0.00044823767,0.00048013937],"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.000038916514,0.00024039345,0.0023595332,0.000021811333,0.000039096503,0.00032239474,0.0004163492,0.028916493,0.000014416758,0.008187201,0.5529825,0.40646085],"study_design_scores_gemma":[0.0006640543,0.0002924796,0.0014414486,0.00008226137,0.000029092187,0.00007794322,0.00016039285,0.2983468,0.0000259869,0.001363793,0.6965182,0.0009975957],"about_ca_topic_score_codex":0.00033901242,"about_ca_topic_score_gemma":0.00028204435,"teacher_disagreement_score":0.9408105,"about_ca_system_score_codex":0.00021228656,"about_ca_system_score_gemma":0.00018534821,"threshold_uncertainty_score":0.99974716},"labels":[],"label_agreement":null},{"id":"W2116958798","doi":"10.1109/glocom.2006.127","title":"CTH16-5: On Selecting the Number of Receiver Diversity Antennas in Ricean Fading Cochannel Interference","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","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":"University of Alberta","funders":"","keywords":"Fading; Interference (communication); Maximal-ratio combining; Signal-to-interference ratio; Antenna (radio); Bit error rate; Computer science; Electronic engineering; Antenna diversity; Diversity combining; Diversity gain; Signal-to-noise ratio (imaging); Power (physics); Telecommunications; Mathematics; Engineering; Physics","score_opus":0.01091214499077551,"score_gpt":0.220901513383937,"score_spread":0.20998936839316149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116958798","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.88670444,0.00006609557,0.09473523,0.000031218162,0.00038263807,0.0001882101,0.000010138309,0.00014913379,0.017732875],"genre_scores_gemma":[0.99913514,0.000010171866,0.0006567604,0.000010981323,0.00004270413,0.0000026007403,0.0000045578645,0.000012458304,0.00012459977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994273,0.000027351263,0.0001833795,0.000117539494,0.00007560233,0.00016879718],"domain_scores_gemma":[0.9996898,0.000070944916,0.000053907013,0.00013237692,0.000038187674,0.000014756009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011655623,0.000099195655,0.00012975324,0.000049575545,0.00007450964,0.000009805914,0.00014478153,0.000045353212,0.000024642251],"category_scores_gemma":[0.000025873884,0.00008749716,0.000027263193,0.00027579037,0.000017728213,0.00011679151,0.000069186244,0.00013470829,0.000024589139],"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.000021146683,0.000038143105,0.11665675,0.00006883937,0.000020516127,0.0000069006137,0.0016967511,0.8768122,0.0018493168,0.0008430859,0.0009063911,0.0010799208],"study_design_scores_gemma":[0.0023877071,0.00009717968,0.13292997,0.0012930789,0.000052618187,0.000055542652,0.0032371415,0.83565915,0.018555703,0.004067313,0.0004888849,0.001175736],"about_ca_topic_score_codex":0.00057372503,"about_ca_topic_score_gemma":0.00032700156,"teacher_disagreement_score":0.11243071,"about_ca_system_score_codex":0.00013638342,"about_ca_system_score_gemma":0.0000038126407,"threshold_uncertainty_score":0.35680306},"labels":[],"label_agreement":null},{"id":"W2120504056","doi":"10.1109/glocom.2006.544","title":"SPC03-1: On Decoding, Mutual Information, and Antenna Selection Diversity for Quasi-Orthogonal STBC with Minimum Decoding Complexity","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Decoding methods; Computer science; Block code; Code (set theory); Algorithm; List decoding; Space–time block code; Selection (genetic algorithm); Theoretical computer science; Artificial intelligence; Concatenated error correction code","score_opus":0.016816892028235254,"score_gpt":0.23017986332708687,"score_spread":0.21336297129885162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120504056","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.46190572,0.000041768122,0.53609973,0.000055187633,0.000042832973,0.0002633653,0.000059622824,0.0005432867,0.0009884667],"genre_scores_gemma":[0.943211,0.000042515003,0.056489322,0.000058322395,0.000034192137,0.000025477995,0.000110377485,0.000013695333,0.00001504966],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932635,0.000015212369,0.00021745179,0.000115688614,0.00012425576,0.00020103858],"domain_scores_gemma":[0.9995247,0.00008180481,0.00007716748,0.00017329447,0.00009657044,0.000046425168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107725624,0.00015167186,0.00015408314,0.00011435275,0.00035096082,0.000048271886,0.0001490757,0.000063822576,0.000011084132],"category_scores_gemma":[0.000017698489,0.00015658152,0.000031239364,0.00014095729,0.00006398515,0.0005197907,0.000088173554,0.00012712563,0.0000058911783],"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.0012996029,0.00072043954,0.44457328,0.0010263037,0.00037432983,0.000006612459,0.0028933696,0.03082207,0.0037370948,0.27371034,0.036613584,0.20422298],"study_design_scores_gemma":[0.0033763524,0.00085008825,0.16856785,0.00023158624,0.00007079051,0.00006344189,0.00048047627,0.7698685,0.011723797,0.015628027,0.027708516,0.0014305625],"about_ca_topic_score_codex":0.00008648583,"about_ca_topic_score_gemma":0.0005567762,"teacher_disagreement_score":0.73904645,"about_ca_system_score_codex":0.00012989054,"about_ca_system_score_gemma":0.000010474785,"threshold_uncertainty_score":0.6385209},"labels":[],"label_agreement":null},{"id":"W2122062742","doi":"10.1109/glocom.2006.921","title":"WLCp2-10: Configurable Acknowledgment Delay (CAD) Mechanism for Asymmetric Space-Internet Links","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer science; CAD; The Internet; Channel (broadcasting); Mechanism (biology); Throughput; Computer network; Telecommunications; Wireless; Engineering","score_opus":0.010154925712233,"score_gpt":0.22084814556312668,"score_spread":0.21069321985089368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122062742","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.0015533938,0.0005997326,0.9602605,0.0025905655,0.0015633408,0.00051298644,0.000013876488,0.00038466472,0.032520954],"genre_scores_gemma":[0.94448465,0.000017279348,0.020153802,0.000915017,0.0006051862,0.00014224167,0.000022673514,0.000022029568,0.033637125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824375,0.0000534699,0.00035019335,0.00054215034,0.0002585289,0.0005519134],"domain_scores_gemma":[0.9987472,0.00019080554,0.00014156968,0.0004969009,0.00028680015,0.00013667719],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003044088,0.00024163703,0.0002827733,0.00014818356,0.00013639824,0.00026938453,0.0008520032,0.00021330277,0.00017559319],"category_scores_gemma":[0.000039491093,0.00022840557,0.00016982386,0.00043570204,0.00002653839,0.00021744418,0.00011804675,0.0002065913,0.00077844295],"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.000018047776,0.000108706925,0.000034762346,0.000011178741,0.000034189092,0.000010556904,0.0000255331,0.00038505308,0.000048919967,0.74661505,0.1523222,0.10038581],"study_design_scores_gemma":[0.002320209,0.00032305697,0.00014104831,0.000043156382,0.000044238,0.000026378326,0.000011998188,0.5846174,0.002801834,0.034561563,0.37457788,0.00053127523],"about_ca_topic_score_codex":0.000118016986,"about_ca_topic_score_gemma":0.0001394045,"teacher_disagreement_score":0.94293123,"about_ca_system_score_codex":0.0001072764,"about_ca_system_score_gemma":0.00009093535,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W2123414183","doi":"10.1109/glocom.2006.79","title":"CTH08-5: Efficient Encoding and Termination of Low-Density Parity-Check Convolutional Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Error Correcting Code 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 Alberta","funders":"","keywords":"Encoder; Low-density parity-check code; Computer science; Algorithm; Convolutional code; Encoding (memory); Serial concatenated convolutional codes; Block code; Code (set theory); Computational complexity theory; Decoding methods; Linear code; Theoretical computer science; Artificial intelligence","score_opus":0.0077699166176391395,"score_gpt":0.2334236396745022,"score_spread":0.22565372305686304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123414183","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.78563243,0.00007883663,0.21163999,0.00018785901,0.00019379253,0.00010609584,0.0000037939656,0.00024180599,0.0019153879],"genre_scores_gemma":[0.9697585,0.0000029300024,0.030102488,0.00003701068,0.000033864162,0.0000041645444,0.0000034633306,0.0000039664815,0.00005362717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99904937,0.00005395859,0.00022561867,0.00026926232,0.00023250461,0.00016928205],"domain_scores_gemma":[0.99933296,0.00011513614,0.00013578932,0.00025341247,0.00012913642,0.00003356875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038898023,0.0001006261,0.00014872481,0.0000912717,0.000108434804,0.000049197926,0.000276197,0.00006049601,0.0000035606472],"category_scores_gemma":[0.00006550657,0.00010472936,0.00003878451,0.00018979597,0.00008355064,0.0001318576,0.00022386537,0.00009406996,0.0000048756137],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037903133,0.0010150608,0.34242114,0.00036673897,0.00003832494,0.00005954363,0.0017772361,0.0015152796,0.1301071,0.47664824,0.007657379,0.038356055],"study_design_scores_gemma":[0.00044687014,0.00010264619,0.5902965,0.00016544978,0.000013079107,0.00009204391,0.000042043313,0.2566004,0.13359565,0.017876016,0.00037379836,0.00039550668],"about_ca_topic_score_codex":0.0004303041,"about_ca_topic_score_gemma":0.00010336064,"teacher_disagreement_score":0.4587722,"about_ca_system_score_codex":0.00007112699,"about_ca_system_score_gemma":0.000041118852,"threshold_uncertainty_score":0.42707396},"labels":[],"label_agreement":null},{"id":"W2123959614","doi":"10.1109/glocom.2006.28","title":"CAM04-5: Toward Understanding the Behavior of BGP During Large-Scale Power Outages","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Blackout; Computer science; Computer network; Prefix; Routing protocol; The Internet; Metric (unit); Border Gateway Protocol; Routing (electronic design automation); Network mapping; Distributed computing; Power (physics); Computer security; Static routing; Electric power system; Engineering; World Wide Web","score_opus":0.01302629165740183,"score_gpt":0.21943234846117934,"score_spread":0.20640605680377752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123959614","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.29859516,0.000485123,0.6925926,0.0018866466,0.0007842736,0.00031442585,0.000012865127,0.00021887427,0.005110024],"genre_scores_gemma":[0.99809873,0.000005110185,0.0011761874,0.00009914211,0.000088477944,0.000023038507,0.0000013904702,0.0000068764157,0.0005010511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989722,0.000048969057,0.00022197538,0.00022802697,0.00022991073,0.00029894864],"domain_scores_gemma":[0.99939144,0.00005898606,0.000094283176,0.00037648212,0.000036583882,0.00004224216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019855314,0.000114354014,0.00014848314,0.000040058032,0.0001768428,0.00008808386,0.00055869005,0.00005018229,0.00005075889],"category_scores_gemma":[0.0000048790193,0.000085816064,0.00009318802,0.00020233492,0.000050717856,0.00015970638,0.00013519934,0.00011014387,0.000022053451],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086152344,0.0011592543,0.118202455,0.00007999415,0.0001580206,0.00021576318,0.0067035104,0.0077299033,0.0027423874,0.78413254,0.017365618,0.061424416],"study_design_scores_gemma":[0.013544435,0.00065260695,0.7415377,0.0003926943,0.00044661277,0.00035962203,0.01058495,0.13137482,0.005780731,0.033911653,0.057981666,0.0034325095],"about_ca_topic_score_codex":0.000039859064,"about_ca_topic_score_gemma":0.00010567292,"teacher_disagreement_score":0.7502209,"about_ca_system_score_codex":0.00006482543,"about_ca_system_score_gemma":0.000030998825,"threshold_uncertainty_score":0.34994775},"labels":[],"label_agreement":null},{"id":"W2124008741","doi":"10.1109/glocom.2006.798","title":"WLC31-6: Performance Analysis of Multiuser MIMO CDMA Systems in Fast-Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Concordia University","funders":"","keywords":"Fading; Code division multiple access; Multiuser detection; Computer science; Base station; MIMO; Electronic engineering; Fading distribution; Interference (communication); Diversity scheme; Channel (broadcasting); Channel state information; Transmit diversity; Telecommunications; Engineering; Wireless; Rayleigh fading","score_opus":0.02172007756425612,"score_gpt":0.26920409665511025,"score_spread":0.24748401909085413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124008741","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.9296778,0.00084987987,0.06597391,0.000252348,0.00023113856,0.00023763029,0.000004542551,0.00008684326,0.0026859385],"genre_scores_gemma":[0.9968756,0.00007121767,0.0025938917,0.000016758582,0.000044482746,0.000034280853,0.000011955808,0.00000778292,0.0003440665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982348,0.00018748887,0.00047389138,0.00030994017,0.0004090567,0.0003848404],"domain_scores_gemma":[0.998253,0.0001771014,0.00016128755,0.0012108828,0.00014151045,0.000056257144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065068586,0.00012661063,0.0003512772,0.00069413055,0.000082984276,0.00013087894,0.0017490546,0.00007556636,0.000013325361],"category_scores_gemma":[0.00001802627,0.00012497997,0.000097433556,0.0032787123,0.00005206369,0.00041305705,0.0005300802,0.00018723734,0.000029781611],"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.0000065953004,0.00013720257,0.11432815,0.00004406686,0.00010263212,0.0000052654764,0.0005007398,0.86727303,0.00034223497,0.005363158,0.00053076894,0.011366125],"study_design_scores_gemma":[0.00020055754,0.000014480632,0.124273606,0.00004355539,0.000011551783,0.0000012218678,0.000027335604,0.8742975,0.00023987613,0.0000240302,0.00075467373,0.00011161509],"about_ca_topic_score_codex":0.00247871,"about_ca_topic_score_gemma":0.0005317636,"teacher_disagreement_score":0.06719779,"about_ca_system_score_codex":0.00011582907,"about_ca_system_score_gemma":0.000043533404,"threshold_uncertainty_score":0.50965357},"labels":[],"label_agreement":null},{"id":"W2124448858","doi":"10.1109/glocom.2006.957","title":"WSN11-6: Throughput Performance of Cooperative Diversity in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Throughput; Cooperative diversity; Relay; Wireless ad hoc network; Blocking (statistics); Fading; Mobile ad hoc network; Diversity gain; Protocol (science); Transmission (telecommunications); Optimized Link State Routing Protocol; Interference (communication); Distributed computing; Wireless; Routing protocol; Telecommunications; Network packet; Channel (broadcasting)","score_opus":0.02444884634170552,"score_gpt":0.2521722302363591,"score_spread":0.22772338389465357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124448858","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.9289232,0.012116119,0.05157076,0.00023591434,0.00024409532,0.0002934149,0.0000027202302,0.0000898149,0.0065239677],"genre_scores_gemma":[0.9926668,0.004421867,0.0024852543,0.00013801495,0.000028107343,0.00001348745,0.0000062886756,0.000003950328,0.00023623958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990362,0.00011672738,0.00024504645,0.00023686982,0.0001432674,0.00022188434],"domain_scores_gemma":[0.9991488,0.00007543256,0.00008946778,0.00053050084,0.00012314592,0.00003263908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024470745,0.00011877968,0.00019422344,0.000062633575,0.0002456301,0.00004186286,0.0009121812,0.000051692452,0.00004184168],"category_scores_gemma":[0.0000070914525,0.00011542516,0.000043667562,0.0006424221,0.00007565253,0.00041132586,0.0012552646,0.0001706623,0.000014951446],"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.000094012335,0.00087719725,0.21710931,0.000041537212,0.000046435434,0.000019822932,0.004994016,0.17725697,0.00042698925,0.044938464,0.012917371,0.5412779],"study_design_scores_gemma":[0.0016021234,0.00042993488,0.24716304,0.00015097867,0.000008128632,0.000007994883,0.000108419204,0.69860595,0.001333587,0.00036119978,0.049648974,0.00057966966],"about_ca_topic_score_codex":0.000023887427,"about_ca_topic_score_gemma":0.0005074715,"teacher_disagreement_score":0.54069823,"about_ca_system_score_codex":0.00007572835,"about_ca_system_score_gemma":0.000038647115,"threshold_uncertainty_score":0.47069013},"labels":[],"label_agreement":null},{"id":"W2125909126","doi":"10.1109/glocom.2006.992","title":"WSN17-5: A Novel Admission Control for Asynchronous Active Link Protected Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Concordia University","funders":"","keywords":"Computer science; Asynchronous communication; Wireless ad hoc network; Quality of service; Power control; Admission control; Computer network; Convergence (economics); Distributed computing; Algorithm; Power (physics); Wireless","score_opus":0.01740020952178397,"score_gpt":0.27214640560205877,"score_spread":0.2547461960802748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125909126","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.0018025937,0.0015339272,0.98859227,0.0050036125,0.00020578394,0.0017083174,0.000020046127,0.000356665,0.0007768119],"genre_scores_gemma":[0.91328335,0.00006259625,0.08491492,0.0002859333,0.0003913563,0.0006445259,0.000045739882,0.00003070563,0.00034089966],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978941,0.0001759441,0.00037021236,0.00052358373,0.00035713997,0.0006789833],"domain_scores_gemma":[0.9973834,0.0005593509,0.00019926514,0.0012976197,0.00037925626,0.00018106449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045076615,0.0002275809,0.000290096,0.00011366896,0.0003829771,0.0002602284,0.0019144327,0.00020798546,0.000023764573],"category_scores_gemma":[0.00012557187,0.00021303113,0.00013387323,0.00059678266,0.00007205844,0.00038208024,0.00045439618,0.00043935076,0.000031440588],"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.00035643842,0.0006494227,0.00016122084,0.000044445438,0.00008369882,0.000009212967,0.00019015811,0.04977621,0.002967521,0.017031223,0.01222846,0.916502],"study_design_scores_gemma":[0.0024849002,0.0002067436,0.006292418,0.000047283003,0.0000075606954,0.000010801291,0.0000066469083,0.9346705,0.0003807618,0.0013547846,0.054255486,0.00028211102],"about_ca_topic_score_codex":0.000058202346,"about_ca_topic_score_gemma":0.00012184065,"teacher_disagreement_score":0.9162199,"about_ca_system_score_codex":0.0002512729,"about_ca_system_score_gemma":0.00027317242,"threshold_uncertainty_score":0.86871576},"labels":[],"label_agreement":null},{"id":"W2128002369","doi":"10.1109/glocom.2006.149","title":"GEN02-1: Hierarchical Iterative Algorithm for a Coupled Constrained OSNR Nash Game","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Game theory; Mathematical optimization; Computer science; Iterative method; Best response; Constraint (computer-aided design); Channel (broadcasting); Normal-form game; Algorithm; Mathematics; Repeated game; Mathematical economics; Telecommunications","score_opus":0.006190928254146906,"score_gpt":0.2106949013831338,"score_spread":0.20450397312898688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128002369","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.19397604,0.000733767,0.7904339,0.0007426552,0.0006778816,0.00096870534,0.0002569442,0.00349168,0.008718416],"genre_scores_gemma":[0.74264973,0.00001631574,0.25642943,0.00007924579,0.0003310133,0.00013169044,0.000079100486,0.000045842917,0.00023760133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894124,0.000010280447,0.0002583222,0.00021818136,0.00011696881,0.00045503146],"domain_scores_gemma":[0.9994693,0.00018852143,0.000021304792,0.00021519492,0.000046897047,0.000058821846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000076642085,0.00020352326,0.00026170106,0.000063978725,0.00005035645,0.00006241962,0.00019215101,0.00018146815,0.00006771088],"category_scores_gemma":[0.00003844551,0.000197284,0.00009570353,0.00018204174,0.00016775668,0.00007249285,0.00004591688,0.00021792999,0.000053776326],"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.000079520534,0.00040940772,0.0007826703,0.00023878682,0.0004931756,0.0001910907,0.000290165,0.037645284,0.008218443,0.25882387,0.07805859,0.614769],"study_design_scores_gemma":[0.0008918447,0.000076609904,0.00046430406,0.000021225464,0.000018316905,0.000015987649,0.000027536196,0.96150917,0.00083374046,0.017633718,0.018198937,0.00030862467],"about_ca_topic_score_codex":0.000011499288,"about_ca_topic_score_gemma":0.00002273877,"teacher_disagreement_score":0.9238639,"about_ca_system_score_codex":0.00007886019,"about_ca_system_score_gemma":0.00001603565,"threshold_uncertainty_score":0.80450076},"labels":[],"label_agreement":null},{"id":"W2129431522","doi":"10.1109/glocom.2006.673","title":"WLC10-6: Higher Layer Performance Study of Power-Controlled Hierarchical Constellation-Based Multi-user Opportunistic Scheduling","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Round-robin scheduling; Network packet; Computer network; Real-time computing; Queueing theory; Fair-share scheduling; Distributed computing; Mathematical optimization; Mathematics; Quality of service","score_opus":0.014775687259093546,"score_gpt":0.23286438515197744,"score_spread":0.2180886978928839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129431522","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.8442007,0.00012934045,0.15120772,0.000019304103,0.00040545414,0.00065342715,0.000009769492,0.000305244,0.0030690888],"genre_scores_gemma":[0.9861031,0.000007917979,0.013481535,0.000023312003,0.00008310183,0.000021310512,0.000037775044,0.00004770937,0.0001942422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.00004883799,0.00053032127,0.00020963406,0.00021879212,0.00027340348],"domain_scores_gemma":[0.9993125,0.00014941437,0.00010962353,0.00028118552,0.000083653154,0.00006360811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012836292,0.00021520033,0.00039285255,0.000111567555,0.00007755168,0.000021827263,0.00013114,0.00009387504,0.0001807334],"category_scores_gemma":[0.000012910755,0.00021511289,0.00006264925,0.00024127483,0.0000440463,0.000116474796,0.000020827922,0.00017397395,0.000015794498],"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.00008307736,0.00021696027,0.023891933,0.000027311587,0.00003567829,0.0000050098465,0.000031286607,0.974508,0.00037847913,0.00024738425,0.00007410344,0.0005008046],"study_design_scores_gemma":[0.0066317488,0.00008463971,0.017190771,0.000038032762,0.00003872207,8.4622627e-7,0.000030532847,0.97511077,0.00021948572,0.000017789163,0.0003979236,0.00023872296],"about_ca_topic_score_codex":0.000014967252,"about_ca_topic_score_gemma":0.000018888475,"teacher_disagreement_score":0.14190245,"about_ca_system_score_codex":0.000070305934,"about_ca_system_score_gemma":0.00003113007,"threshold_uncertainty_score":0.8772049},"labels":[],"label_agreement":null},{"id":"W2129989347","doi":"10.1109/glocom.2006.482","title":"WSN04-1: Deployment for Information Oriented Sensing Coverage in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","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":"Queen's University","funders":"","keywords":"Wireless sensor network; Software deployment; Computer science; Key distribution in wireless sensor networks; Wireless; Mobile wireless sensor network; Field (mathematics); Real-time computing; Computer network; Wireless network; Distributed computing; Telecommunications","score_opus":0.005216369165350171,"score_gpt":0.20200087988342708,"score_spread":0.1967845107180769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129989347","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.176032,0.000040783074,0.82107383,0.00024907992,0.0008504543,0.0003674621,0.0000050784565,0.00026434,0.0011169888],"genre_scores_gemma":[0.9642145,0.000013614369,0.03483667,0.0005276986,0.00019566483,0.000016295948,0.00008598732,0.000018011542,0.00009153874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804413,0.00007836925,0.0005628004,0.00035950606,0.00030903725,0.00064616726],"domain_scores_gemma":[0.9988814,0.00018826533,0.00020960766,0.0005042451,0.00013810945,0.00007838907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032138728,0.0002378785,0.00026136448,0.0001982377,0.00015649991,0.00023564878,0.00038033983,0.00015015033,0.0000022260494],"category_scores_gemma":[0.000019814872,0.00024865207,0.00009418359,0.0007148356,0.000032596185,0.0007238269,0.0001638936,0.00017664165,0.000017573233],"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.000026607517,0.00007033326,0.0016708871,0.000013994155,0.000008004795,0.000015395404,0.00009446252,0.922592,0.00008471116,0.034368448,0.0018270813,0.03922809],"study_design_scores_gemma":[0.0010855672,0.000041017018,0.0038720157,0.000052794334,0.0000047888902,0.000015641574,0.000014976507,0.97984725,0.0005633708,0.00019053447,0.014014377,0.0002976602],"about_ca_topic_score_codex":0.00042763192,"about_ca_topic_score_gemma":0.0003577451,"teacher_disagreement_score":0.7881825,"about_ca_system_score_codex":0.0002411878,"about_ca_system_score_gemma":0.000043305572,"threshold_uncertainty_score":0.99999654},"labels":[],"label_agreement":null},{"id":"W2132334733","doi":"10.1109/glocom.2006.618","title":"WLC01-4: MIMO Precoder Design Based on Spatial and Path Correlation Information for Frequency-Selective Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"MIMO; Spatial correlation; Fading; Precoding; Channel (broadcasting); Path (computing); Uncorrelated; Channel capacity; Algorithm; Computer science; Correlation; Mathematics; Path loss; Topology (electrical circuits); Control theory (sociology); Electronic engineering; Telecommunications; Statistics; Engineering; Wireless; Computer network; Artificial intelligence; Geometry","score_opus":0.006626735969828236,"score_gpt":0.19207043379357563,"score_spread":0.1854436978237474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132334733","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.0010357095,0.000042278964,0.9953486,0.00001937574,0.00045895664,0.0008899084,0.000041938158,0.00022592551,0.0019373284],"genre_scores_gemma":[0.9456861,0.000003120594,0.05369418,0.000033930253,0.00012505939,0.00016385202,0.00023772576,0.000023195978,0.000032827316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937576,0.000023011824,0.00023708226,0.00011265128,0.000081877,0.00016960352],"domain_scores_gemma":[0.99961424,0.00009506606,0.00007181058,0.000101958714,0.00008720513,0.000029735158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010668984,0.00013931129,0.000121670724,0.000100519195,0.00007330764,0.000042872878,0.000039651637,0.0001024237,0.000010091484],"category_scores_gemma":[0.00004540114,0.00014948339,0.000024722178,0.000105193394,0.000009568355,0.00048318508,0.0000039460624,0.00006355687,0.000015399703],"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.000024582483,0.00000909996,0.0003139549,0.00004035654,0.000005298168,1.4436667e-7,0.000089745605,0.99436253,0.00012177755,0.00024164015,0.0013282278,0.0034626327],"study_design_scores_gemma":[0.00070656347,0.000096537915,0.00094852434,0.00003700908,0.000010455423,0.000001260026,0.000011638918,0.99478,0.0014542075,0.0013804198,0.00040892354,0.00016446764],"about_ca_topic_score_codex":0.00010263878,"about_ca_topic_score_gemma":0.00003421182,"teacher_disagreement_score":0.9446504,"about_ca_system_score_codex":0.00014734594,"about_ca_system_score_gemma":0.000018411509,"threshold_uncertainty_score":0.60957557},"labels":[],"label_agreement":null},{"id":"W2133798603","doi":"10.1109/glocom.2006.265","title":"NIS01-5: A Novel Voting Mechanism for Compromised Node Revocation in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Node (physics); Revocation; Computer security; Mobile ad hoc network; Wireless; Engineering; Telecommunications; Network packet; Overhead (engineering)","score_opus":0.012599220609024553,"score_gpt":0.22932695867421815,"score_spread":0.2167277380651936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133798603","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.028849205,0.00022050749,0.9683221,0.0006046914,0.0006148367,0.0007756523,0.0000045933944,0.00021371192,0.0003947033],"genre_scores_gemma":[0.89602023,0.000015431762,0.102826305,0.000510507,0.0002533226,0.00020479114,0.000032859552,0.000024028024,0.00011253015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808025,0.00005040732,0.00048059042,0.0005940685,0.00021163073,0.0005830439],"domain_scores_gemma":[0.9988567,0.00016746261,0.00022201941,0.0005558194,0.00012564636,0.00007229972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004699079,0.00021995846,0.0002879443,0.0000855594,0.00014545351,0.00016989527,0.0008472999,0.00015658699,0.0000043576374],"category_scores_gemma":[0.000018896506,0.00024083938,0.00009208342,0.00049281615,0.000024406876,0.00032588042,0.00021474058,0.00020416969,0.000013412911],"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.00005778173,0.0003983722,0.0011759005,0.000067993875,0.000021443602,0.000013524767,0.00018004117,0.064954236,0.0036843475,0.80936474,0.004088485,0.11599311],"study_design_scores_gemma":[0.0014664571,0.000043773878,0.0033799547,0.00007224588,0.000005865019,0.00000814588,0.000007126419,0.9828145,0.00022073752,0.010832724,0.0008735257,0.0002749808],"about_ca_topic_score_codex":0.00013753916,"about_ca_topic_score_gemma":0.00076665025,"teacher_disagreement_score":0.9178602,"about_ca_system_score_codex":0.00016165125,"about_ca_system_score_gemma":0.000058462912,"threshold_uncertainty_score":0.98211443},"labels":[],"label_agreement":null},{"id":"W2134166585","doi":"10.1109/glocom.2006.864","title":"WLC42-6: Non-Linear Precoding for OFDM Systems in Spatially-Correlated Frequency-Selective Fading MIMO Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","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":"University of Alberta","funders":"","keywords":"Precoding; Fading; Orthogonal frequency-division multiplexing; MIMO; Transmitter; MIMO-OFDM; Channel (broadcasting); Zero-forcing precoding; Computer science; Spatial correlation; Electronic engineering; Control theory (sociology); Channel state information; Telecommunications; Engineering; Wireless","score_opus":0.009497136022408759,"score_gpt":0.22356467940193409,"score_spread":0.21406754337952533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134166585","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.053725645,0.00075963925,0.93580335,0.000014368846,0.0025541286,0.001632333,0.000050562012,0.0005146439,0.004945352],"genre_scores_gemma":[0.9888634,0.000016779491,0.009953191,0.0000057831157,0.00042928435,0.0002789583,0.00010923878,0.00009039699,0.00025295804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843436,0.000030864358,0.000593254,0.00032548167,0.000112842325,0.0005031851],"domain_scores_gemma":[0.99939984,0.000104251754,0.00011770876,0.0002103702,0.000111735986,0.000056118588],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020526322,0.00027210408,0.0003870665,0.00022913919,0.00008206415,0.000048341564,0.00015742189,0.00021320934,0.000007894332],"category_scores_gemma":[0.000058792633,0.00031204312,0.00007159322,0.00045670941,0.000014034984,0.000334464,0.000019338391,0.00018728746,0.000032081727],"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.000008962728,0.00001888902,0.0013167713,0.00017022851,0.00002417679,0.0000049951846,0.00020496575,0.99290955,0.004385143,0.00029300136,0.00038498864,0.00027831068],"study_design_scores_gemma":[0.00095130806,0.000039975752,0.00029718524,0.0002941956,0.000015559435,0.000009939472,0.00006298208,0.99366575,0.0035443672,0.00041628827,0.00033341555,0.0003690185],"about_ca_topic_score_codex":0.0013418257,"about_ca_topic_score_gemma":0.0004924948,"teacher_disagreement_score":0.93513775,"about_ca_system_score_codex":0.0005333181,"about_ca_system_score_gemma":0.000028171791,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W2136804070","doi":"10.1109/glocom.2006.666","title":"WLC09-5: Outage and Error Rate of Cellular Systems Using MRC in the Presence of Multiple Interferers and Correlated Rayleigh Fading","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Rayleigh fading; Maximal-ratio combining; Interference (communication); Fading; Phase-shift keying; Mathematics; Signal-to-noise ratio (imaging); Bit error rate; Statistics; Carrier-to-noise ratio; Electronic engineering; Algorithm; Telecommunications; Computer science; Engineering; Decoding methods; Channel (broadcasting)","score_opus":0.03566997457825327,"score_gpt":0.26993111526056873,"score_spread":0.23426114068231546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136804070","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.9317848,0.0013895364,0.06617069,0.00010933714,0.000081354105,0.00028558463,0.0000034532438,0.000015661153,0.00015955302],"genre_scores_gemma":[0.99831825,0.000038019967,0.0015819767,0.000007281446,0.00000960156,0.000006301039,0.0000020388964,0.0000055266014,0.00003097755],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985784,0.0004888255,0.00035481126,0.00020371155,0.00017575177,0.0001984693],"domain_scores_gemma":[0.998503,0.0006260224,0.00017126303,0.00059164315,0.000077795565,0.000030274883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009171757,0.00009507591,0.00020077052,0.00011610707,0.00006961168,0.0000913029,0.0008550633,0.000057538564,0.000001242877],"category_scores_gemma":[0.0000672535,0.00007523116,0.000022039192,0.00043169683,0.00015898244,0.00023019318,0.0004959462,0.00018314658,6.3437346e-7],"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.00017576937,0.00057681534,0.43862745,0.00087036093,0.00011488439,0.00008871497,0.017426897,0.29662284,0.1967014,0.04011604,0.0009238427,0.007754974],"study_design_scores_gemma":[0.00038744288,0.000026037023,0.010434181,0.00015838486,0.0000031932593,0.000008669168,0.00041655084,0.98694706,0.0013015097,0.00016898132,0.00007101233,0.00007695025],"about_ca_topic_score_codex":0.003238832,"about_ca_topic_score_gemma":0.00014256446,"teacher_disagreement_score":0.69032425,"about_ca_system_score_codex":0.000027213906,"about_ca_system_score_gemma":0.00002821823,"threshold_uncertainty_score":0.4896167},"labels":[],"label_agreement":null},{"id":"W2138511162","doi":"10.1109/glocom.2006.952","title":"WSN11-1: Distributed Cross-Layer Optimization of Wireless Sensor Networks: A Game Theoretic Approach","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":59,"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":"Cross-layer optimization; Computer science; Mathematical optimization; Nash equilibrium; Physical layer; Layer (electronics); Optimization problem; Dual (grammatical number); Distributed computing; Wireless sensor network; Process (computing); Stability (learning theory); Set (abstract data type); Distributed algorithm; Wireless; Wireless network; Computer network; Mathematics; Algorithm; Telecommunications","score_opus":0.00556253653233551,"score_gpt":0.20820420437680368,"score_spread":0.20264166784446816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138511162","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.044567425,0.0003770996,0.9515205,0.000008660206,0.00023320445,0.00027901545,0.000062962994,0.0004665314,0.0024845987],"genre_scores_gemma":[0.9597121,0.00013859435,0.03892887,0.000010722581,0.00021973113,0.000031623844,0.00082378875,0.000077126555,0.00005745145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998624,0.00004274828,0.000476135,0.0002636241,0.00018954808,0.00040393506],"domain_scores_gemma":[0.9992787,0.000060045946,0.0001249246,0.00035378133,0.000121210986,0.0000613262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000104189494,0.00025992948,0.00031899856,0.00006843193,0.000058180918,0.00005367286,0.000185074,0.0001828304,0.00005848366],"category_scores_gemma":[0.000013039856,0.0002732769,0.00008328145,0.0005587356,0.00012012619,0.0002069493,0.00003960553,0.00016151731,0.000006002929],"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.000021370322,0.000051820232,0.0017293934,0.000060269198,0.000022195642,0.0000021448184,0.00002103724,0.99497133,0.000079273465,0.0021869722,0.00040786352,0.0004463169],"study_design_scores_gemma":[0.00053146563,0.000013597927,0.0013958889,0.000032081472,0.00002374512,0.000007423576,0.000016508779,0.996861,0.00045109677,0.00024110706,0.00015242171,0.00027367583],"about_ca_topic_score_codex":0.000016280432,"about_ca_topic_score_gemma":0.0000036548067,"teacher_disagreement_score":0.9151447,"about_ca_system_score_codex":0.00011407741,"about_ca_system_score_gemma":0.000011180609,"threshold_uncertainty_score":0.9999719},"labels":[],"label_agreement":null},{"id":"W2139517527","doi":"10.1109/glocom.2006.489","title":"WSN05-2: Distributed Medium Access Control in Pulse-Based Time-Hopping UWB Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless; Time-hopping; Frame (networking); Ultra-wideband; Distributed algorithm; Transmission (telecommunications); Wireless sensor network; Wireless network; Access control; Communication source; Distributed computing; Pulse (music); Telecommunications; Pulse-amplitude modulation","score_opus":0.004667674310808734,"score_gpt":0.2027009196458525,"score_spread":0.19803324533504377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139517527","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.41283536,0.0025206995,0.56188035,0.005825366,0.00069409714,0.0010586996,0.00021864475,0.00387321,0.0110935345],"genre_scores_gemma":[0.99903774,0.000021408441,0.00028041337,0.00013575045,0.000064118496,0.00010628429,0.00028778458,0.000035995512,0.00003050924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880403,0.000052843454,0.00038678438,0.00019425729,0.00011000877,0.00045205143],"domain_scores_gemma":[0.99898005,0.00018623342,0.000053110056,0.00069227896,0.000040294795,0.000048043497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014874902,0.00020382798,0.0003023794,0.00016057391,0.00007028879,0.00007059735,0.0008556255,0.000240258,0.000113061375],"category_scores_gemma":[0.000023592658,0.00022560803,0.00006182191,0.00061568327,0.00006835534,0.00014378664,0.000065825676,0.0003923159,0.000049985956],"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.000040872164,0.00022780227,0.042178236,0.00004927503,0.00007862427,0.00003348813,0.000015439226,0.91488504,0.005426519,0.0019306792,0.019144,0.015989993],"study_design_scores_gemma":[0.0018425633,0.000016853606,0.027491955,0.00007264878,0.000025872292,0.0000074929667,0.000012084277,0.950455,0.0020050732,0.00047759755,0.017177187,0.00041565392],"about_ca_topic_score_codex":0.00035962186,"about_ca_topic_score_gemma":0.0012477501,"teacher_disagreement_score":0.5862024,"about_ca_system_score_codex":0.00019498175,"about_ca_system_score_gemma":0.000029233604,"threshold_uncertainty_score":0.9200029},"labels":[],"label_agreement":null},{"id":"W2139970961","doi":"10.1109/glocom.2006.137","title":"CTHp1-3: A Simple Integral Form of Lognormal Characteristic Functions Convenient for Numerical Computation","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Electromagnetic Scattering and Analysis","field":"Physics and Astronomy","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computation; Log-normal distribution; Simple (philosophy); Characteristic function (probability theory); Function (biology); Numerical integration; Mathematics; Applied mathematics; Expression (computer science); Closed-form expression; Numerical analysis; Computer science; Probability density function; Mathematical analysis; Algorithm; Statistics","score_opus":0.005415059572164994,"score_gpt":0.23080531262897028,"score_spread":0.2253902530568053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139970961","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.6349561,0.0000071028244,0.3638191,0.00009668769,0.000060166927,0.00008014632,0.00009444134,0.000015590764,0.00087064324],"genre_scores_gemma":[0.9979043,1.0287424e-7,0.0008809144,0.000019608824,0.00019520086,0.00003247453,0.000616073,0.000007542389,0.00034378134],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938184,0.000011459524,0.00022802642,0.00012923514,0.00006801899,0.00018140743],"domain_scores_gemma":[0.99967283,0.000046634243,0.0001049681,0.00008211689,0.00006268545,0.000030779513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000046381207,0.000089207846,0.00017285277,0.00004150654,0.00007183326,0.000020131185,0.000058677928,0.000017958164,0.00020815039],"category_scores_gemma":[0.000002515986,0.00008317056,0.00014564735,0.00011057831,0.000024106894,0.00004030799,0.000015385565,0.00004836279,0.000012298404],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003048729,0.0025673257,0.5705086,0.00019133429,0.0007568448,0.000002786171,0.00061213435,0.005963838,0.01980241,0.03854939,0.053419407,0.30732104],"study_design_scores_gemma":[0.005670874,0.0021802897,0.40548918,0.00009158562,0.0010441022,0.000012411723,0.0010355819,0.43359798,0.0102074845,0.11350945,0.025760796,0.0014002625],"about_ca_topic_score_codex":0.00085197686,"about_ca_topic_score_gemma":0.000010323724,"teacher_disagreement_score":0.42763415,"about_ca_system_score_codex":0.000015848063,"about_ca_system_score_gemma":0.000023367498,"threshold_uncertainty_score":0.33915973},"labels":[],"label_agreement":null},{"id":"W2141426766","doi":"10.1109/glocom.2006.574","title":"SPC08-1: An Adaptive-Scaling Tone Reservation Algorithm for PAR Reduction in OFDM Systems","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"PAPR reduction in OFDM","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 Alberta","funders":"","keywords":"Clipper (electronics); Orthogonal frequency-division multiplexing; Algorithm; Computer science; Reduction (mathematics); Clipping (morphology); Reservation; Computational complexity theory; Scaling; Tone (literature); Mathematics; Electronic engineering; Telecommunications; Channel (broadcasting); Engineering; Computer network","score_opus":0.021808346853552905,"score_gpt":0.26139859356401135,"score_spread":0.23959024671045845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141426766","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.7209185,0.00087221677,0.2683238,0.00012139574,0.004306683,0.0009693735,0.00007721494,0.00079956785,0.0036112391],"genre_scores_gemma":[0.9692358,0.000019488547,0.02852119,0.0000051907987,0.0014249762,0.00019884431,0.00014923133,0.00005407924,0.0003912495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989418,0.000035577687,0.00037028195,0.00022727539,0.00014936985,0.0002757062],"domain_scores_gemma":[0.99958146,0.000020751535,0.000053371037,0.00022657219,0.00007022018,0.00004762849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026715177,0.00014438236,0.00018179353,0.00015226776,0.00006839918,0.000050811926,0.000108758584,0.00012070304,0.00000999982],"category_scores_gemma":[0.000011313951,0.00017114056,0.000042185147,0.00027780025,0.000021787495,0.0004033165,0.000011194847,0.00011925492,0.000017629915],"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.00004496682,0.00013929905,0.0005454134,0.00013379785,0.000037436323,0.0000052526693,0.00023932954,0.9225689,0.021028861,0.003094239,0.013946095,0.0382164],"study_design_scores_gemma":[0.0007084492,0.00007347265,0.006504695,0.000078838224,0.000013951109,0.00003023523,0.0004957844,0.96981734,0.00694945,0.001238819,0.013766106,0.00032285642],"about_ca_topic_score_codex":0.0010892618,"about_ca_topic_score_gemma":0.00008722728,"teacher_disagreement_score":0.24831726,"about_ca_system_score_codex":0.00022918302,"about_ca_system_score_gemma":0.000014888149,"threshold_uncertainty_score":0.69789094},"labels":[],"label_agreement":null},{"id":"W2141975720","doi":"10.1109/glocom.2006.932","title":"WSN02-2: Adaptive Network Resource Management in IEEE 802.11 Wireless Random Access MAC","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Quality of service; Wireless network; Resource management (computing); Random access; Distributed computing; Wireless; Telecommunications","score_opus":0.01692017319709029,"score_gpt":0.25860530064437004,"score_spread":0.24168512744727974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141975720","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.021567645,0.0012810145,0.91160935,0.001475775,0.0015530087,0.011981514,0.000010620989,0.0006273101,0.049893737],"genre_scores_gemma":[0.9508775,0.000115698705,0.029759938,0.004704142,0.0026743226,0.0072697303,0.00003175557,0.00009558716,0.004471323],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99733233,0.00024609818,0.0005011261,0.0006934848,0.0004074443,0.0008194901],"domain_scores_gemma":[0.9987095,0.00015099315,0.00018398375,0.0008084664,0.000039388924,0.000107674845],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006142947,0.00030008474,0.0003967585,0.00011844934,0.0001832111,0.00047416767,0.0020037584,0.00012688342,0.000044076845],"category_scores_gemma":[0.0000018535981,0.00028610192,0.00011926517,0.0010235047,0.000054626435,0.000522431,0.0006680831,0.0002441308,0.000059994123],"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.00044162513,0.00036265698,0.015680112,0.00008106427,0.00006450499,0.0005921538,0.00017055639,0.20798284,0.000007563129,0.09030159,0.50396496,0.18035036],"study_design_scores_gemma":[0.013948943,0.00023370342,0.08813234,0.00087572477,0.00004607506,0.000037598416,0.00006809914,0.2637329,0.00039582892,0.031168625,0.5992997,0.0020604138],"about_ca_topic_score_codex":0.00070525735,"about_ca_topic_score_gemma":0.0008700371,"teacher_disagreement_score":0.92930984,"about_ca_system_score_codex":0.00011777072,"about_ca_system_score_gemma":0.000033904507,"threshold_uncertainty_score":0.9999591},"labels":[],"label_agreement":null},{"id":"W2142059412","doi":"10.1109/glocom.2006.249","title":"NGL02-1: Multi-Stage Investment Decision under Contingent Demand for Networking Planning","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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":"Bell (Canada); University of Waterloo","funders":"","keywords":"Stochastic programming; Investment (military); Computer science; Operations research; The Internet; Service (business); Investment decisions; Process (computing); Plan (archaeology); Installation; Business; Mathematical optimization; Production (economics); Economics; Engineering; Microeconomics; Marketing","score_opus":0.044006623806988505,"score_gpt":0.2933518968994105,"score_spread":0.249345273092422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142059412","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.31089267,0.0007602518,0.67982715,0.00022249292,0.00070216507,0.0004905205,0.0000049123973,0.00028106288,0.0068187877],"genre_scores_gemma":[0.9809125,0.0000027350454,0.012799159,0.0031455404,0.0018822748,0.00004627377,0.00007651339,0.000049195954,0.0010857912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858093,0.000014224472,0.0003933199,0.0003893029,0.00018890388,0.0004333391],"domain_scores_gemma":[0.99911827,0.00017747871,0.0003201763,0.00027164706,0.000096015545,0.000016415363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940526,0.00023067462,0.0002764785,0.00017306303,0.0003931143,0.00025549144,0.00022411034,0.00007412428,0.00005405871],"category_scores_gemma":[0.00007716262,0.00022003594,0.00015669448,0.00031013723,0.00004055613,0.00050172635,0.0001642089,0.000092923096,0.000065437845],"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.00027089135,0.0003135513,0.052536964,0.00015619386,0.0001731548,0.000035355508,0.000059430997,0.7324971,0.00053888984,0.1877916,0.01479416,0.010832697],"study_design_scores_gemma":[0.0033949804,0.000017178549,0.0142171895,0.00029170612,0.0003063997,0.000001751557,0.00045539896,0.35784587,0.00014371934,0.17352962,0.44896647,0.00082967605],"about_ca_topic_score_codex":0.00025133474,"about_ca_topic_score_gemma":0.00032846848,"teacher_disagreement_score":0.67001987,"about_ca_system_score_codex":0.00008081469,"about_ca_system_score_gemma":0.000008676055,"threshold_uncertainty_score":0.8972806},"labels":[],"label_agreement":null},{"id":"W2142743095","doi":"10.1109/glocom.2006.711","title":"WLC17-3: Performance of IEEE802.16 Random Access Protocol - Transient Queueing Analysis","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","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 Ottawa","funders":"","keywords":"Computer science; Computer network; Retransmission; Random access; Exponential backoff; Queueing theory; Orthogonal frequency-division multiple access; Code division multiple access; Queue; Real-time computing; Orthogonal frequency-division multiplexing; Throughput; Network packet; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.005882493184886254,"score_gpt":0.23656939638632618,"score_spread":0.23068690320143992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142743095","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.24970633,0.00005904614,0.7301901,0.000013354841,0.00011544234,0.012585884,0.000011574302,0.00032767878,0.006990615],"genre_scores_gemma":[0.9892152,0.000015813192,0.0034845367,0.000008581081,0.00008524339,0.0070609646,0.000034942004,0.000029109942,0.000065604494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989749,0.000021511787,0.00040791993,0.00017027966,0.00017752398,0.00024782927],"domain_scores_gemma":[0.9995502,0.000029453362,0.00008498574,0.00024346948,0.0000547283,0.00003715934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009516657,0.00016454984,0.00033256842,0.00017419794,0.000050756138,0.000025637093,0.00018420476,0.000066647175,0.00011643736],"category_scores_gemma":[0.000003262818,0.00016440434,0.00012183026,0.00097151235,0.000027883922,0.00035122197,0.00001975125,0.000092938724,0.0000050336535],"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.000056971963,0.000024633267,0.009919379,0.00012104629,0.00008525481,8.912787e-7,0.000024857645,0.98571974,0.00023439094,0.000041645613,0.00031437047,0.0034567968],"study_design_scores_gemma":[0.0015333918,0.0000212229,0.0136277145,0.000049132093,0.000118139,9.623789e-7,0.0000051047873,0.9738042,0.0076654796,0.000035595767,0.0029145074,0.0002245593],"about_ca_topic_score_codex":0.000091488764,"about_ca_topic_score_gemma":0.00018510214,"teacher_disagreement_score":0.73950887,"about_ca_system_score_codex":0.000097605,"about_ca_system_score_gemma":0.000011158506,"threshold_uncertainty_score":0.6704214},"labels":[],"label_agreement":null},{"id":"W2143082264","doi":"10.1109/glocom.2006.224","title":"MMC05-4: On the Optimality of Threshold Scheduling Policies for Video Transmission in Markovian Fading Wireless Channels with Channel-Aware ARQ","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of British Columbia","funders":"","keywords":"Computer science; Fading; Rayleigh fading; Scheduling (production processes); Network packet; Markov decision process; Computer network; Markov process; Hybrid automatic repeat request; Wireless; Channel (broadcasting); Mathematical optimization; Automatic repeat request; Transmission (telecommunications); Real-time computing; Mathematics; Telecommunications","score_opus":0.01158624219229102,"score_gpt":0.22072065439865168,"score_spread":0.20913441220636067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143082264","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.41111186,0.00020653753,0.5868736,0.0002990506,0.00012131421,0.0006019314,0.000024304816,0.00015390865,0.00060750183],"genre_scores_gemma":[0.99572986,0.000045714947,0.003815899,0.00005482379,0.00014185344,0.00009602778,0.000032619173,0.00006078778,0.00002240742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882966,0.000023344619,0.0003396839,0.00022973276,0.00017787374,0.00039969827],"domain_scores_gemma":[0.9994344,0.00014102679,0.00008515676,0.00024253842,0.00005319086,0.000043664193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020002245,0.00024079204,0.00029304,0.000121256875,0.000103145845,0.000029625422,0.0001992262,0.000092392576,0.000009470391],"category_scores_gemma":[0.0000069260695,0.00018568442,0.00006644424,0.0003953719,0.00005019273,0.0001623627,0.000017202217,0.00017627161,9.796605e-7],"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.00007521481,0.000033462267,0.00032157922,0.00011354377,0.000014591413,0.0000018366061,0.00021468541,0.99647987,0.00046852752,0.0013084899,0.000085772495,0.00088242977],"study_design_scores_gemma":[0.00061567815,0.00006025328,0.00053506537,0.00045738873,0.000012106063,0.0000023817477,0.00018122634,0.9864803,0.010448918,0.0008171741,0.00014868646,0.00024080888],"about_ca_topic_score_codex":0.00007539246,"about_ca_topic_score_gemma":0.00009817379,"teacher_disagreement_score":0.58461803,"about_ca_system_score_codex":0.00010882641,"about_ca_system_score_gemma":0.000015573933,"threshold_uncertainty_score":0.7571991},"labels":[],"label_agreement":null},{"id":"W2143516379","doi":"10.1109/glocom.2006.504","title":"WSN07-5: Performance of Directional MAC Protocols in Ad-Hoc Networks over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fading; Computer network; Directional antenna; Throughput; Additive white Gaussian noise; Wireless ad hoc network; Omnidirectional antenna; Channel (broadcasting); Transmission (telecommunications); Mobile ad hoc network; Antenna (radio); Wireless; Telecommunications; Network packet","score_opus":0.010105763568384897,"score_gpt":0.24281592680255232,"score_spread":0.23271016323416743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143516379","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.67794615,0.0016927462,0.28571597,0.0003459062,0.0025660857,0.016096393,0.000009657094,0.0005981808,0.015028891],"genre_scores_gemma":[0.99158686,0.000027496151,0.005221651,0.00009610179,0.00031339328,0.002319344,0.000004877126,0.000014800576,0.0004154905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835694,0.000061302955,0.0004286006,0.00039604073,0.00030384565,0.0004532791],"domain_scores_gemma":[0.99917847,0.00007323254,0.0001741267,0.0004622443,0.000056026245,0.00005589705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035646866,0.00017401774,0.00025241077,0.000110900306,0.000075817254,0.000079397585,0.00067785237,0.00011126133,0.00007356624],"category_scores_gemma":[0.0000067372166,0.00017766755,0.00007323988,0.0006929157,0.000045257424,0.0004983748,0.00025569132,0.00022491436,0.000019852378],"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.00009694424,0.0003970096,0.15102135,0.0001041029,0.000024319004,0.000031675227,0.0002073139,0.69324356,0.00025476233,0.010549069,0.012665803,0.13140407],"study_design_scores_gemma":[0.00066083873,0.00012947126,0.12166288,0.00020074629,0.0000021318176,0.000014274558,0.0000019544993,0.85512286,0.0005060116,0.0008193297,0.020621546,0.0002579488],"about_ca_topic_score_codex":0.00007793879,"about_ca_topic_score_gemma":0.000111525624,"teacher_disagreement_score":0.31364065,"about_ca_system_score_codex":0.00011784638,"about_ca_system_score_gemma":0.000051620733,"threshold_uncertainty_score":0.7245072},"labels":[],"label_agreement":null},{"id":"W2143548765","doi":"10.1109/glocom.2006.779","title":"WLC28-5: Impact of Frequency Offset and Timing Offset on the Performance of SC-FDE UWB","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Carrier frequency offset; Frequency offset; SC-FDE; Offset (computer science); Computer science; Sampling (signal processing); Orthogonal frequency-division multiplexing; Nyquist rate; Channel (broadcasting); Electronic engineering; Telecommunications; Engineering","score_opus":0.008824964835665782,"score_gpt":0.21542920250505107,"score_spread":0.2066042376693853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143548765","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.99272144,0.0004073322,0.00006479694,0.00015798335,0.000026866674,0.000086135595,0.000037578873,0.00008072712,0.006417141],"genre_scores_gemma":[0.9991132,0.00014112263,0.0006713369,0.000010085852,0.000009847674,0.000008680764,0.000012110368,0.000011001253,0.00002258723],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9994954,0.000016851374,0.00021260737,0.00007122425,0.00007191863,0.00013198747],"domain_scores_gemma":[0.99928564,0.00009488459,0.000055138833,0.00052164687,0.000028610026,0.000014069021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009662022,0.00009564413,0.00014325924,0.00007865788,0.000047108635,0.0000057651164,0.00027549878,0.000069064874,0.000046838744],"category_scores_gemma":[0.00002471879,0.000070696544,0.000046198435,0.00018000828,0.00008923092,0.000055348024,0.000034784058,0.00014528364,0.000009696104],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059297738,0.00043680394,0.64035577,0.00032724888,0.0004000045,0.0000031567797,0.0007873246,0.043647207,0.20038585,0.0338426,0.034087047,0.045667678],"study_design_scores_gemma":[0.00085137994,0.00065025187,0.76569045,0.0003901799,0.000079161495,0.000055414657,0.00015789786,0.0971774,0.12638876,0.005334355,0.0026163082,0.0006084227],"about_ca_topic_score_codex":0.00034361536,"about_ca_topic_score_gemma":0.00008400187,"teacher_disagreement_score":0.1253347,"about_ca_system_score_codex":0.00004204586,"about_ca_system_score_gemma":0.000013907101,"threshold_uncertainty_score":0.28829214},"labels":[],"label_agreement":null},{"id":"W2143590706","doi":"10.1109/glocom.2006.944","title":"WSN09-5: Anonymous Peer-to-peer Communication Protocol over Mobile Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Routing protocol; Anonymity; Optimized Link State Routing Protocol; Flooding (psychology); Distributed computing; Computer security; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.007961364483059051,"score_gpt":0.26371763497554884,"score_spread":0.2557562704924898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143590706","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.020794576,0.00039108723,0.93755424,0.002370585,0.0004173212,0.024755921,0.0000075010266,0.0006764465,0.013032327],"genre_scores_gemma":[0.9656043,0.0000021936528,0.016351242,0.0007206205,0.00020354275,0.011448291,0.00003325378,0.000021254937,0.0056153093],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979089,0.00012682375,0.00046319127,0.00046085514,0.00059215724,0.00044806406],"domain_scores_gemma":[0.9985242,0.00006830177,0.00017150858,0.00077377626,0.0003561825,0.00010603975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006636502,0.0002199558,0.0002580255,0.000097158045,0.00021537674,0.0004167952,0.0014626014,0.00012034913,0.00017416754],"category_scores_gemma":[0.000025156924,0.00020067899,0.0001609512,0.0004946436,0.000037122285,0.0003063906,0.00047176497,0.00026623326,0.0002320871],"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.00005124848,0.00063056767,0.0011195443,0.000029094592,0.000087798486,0.000034167555,0.0015669743,0.2649361,0.000049737457,0.10436174,0.4827803,0.14435273],"study_design_scores_gemma":[0.00031659805,0.000086117616,0.0011699285,0.000024231756,0.00000794952,0.0000065353033,0.00002659618,0.54398656,0.000028805765,0.00006660559,0.45405737,0.0002227225],"about_ca_topic_score_codex":0.00010866612,"about_ca_topic_score_gemma":0.00077302114,"teacher_disagreement_score":0.94480973,"about_ca_system_score_codex":0.00010970004,"about_ca_system_score_gemma":0.00004085964,"threshold_uncertainty_score":0.8183451},"labels":[],"label_agreement":null},{"id":"W2144853961","doi":"10.1109/glocom.2006.125","title":"CTH16-3: Optimum Detection of Binary Signals in Rayleigh Fading Channels with Imperfect Channel Estimates","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Toronto","funders":"","keywords":"Additive white Gaussian noise; Antipodal point; Algorithm; Detector; Rayleigh fading; Channel (broadcasting); Mathematics; Binary number; Gaussian noise; Fading; Modulation (music); Statistics; Computer science; White noise; Telecommunications; Physics; Decoding methods; Acoustics","score_opus":0.00805228373916755,"score_gpt":0.22515179017055467,"score_spread":0.21709950643138712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144853961","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.84217966,0.0010729259,0.15462878,0.00002179184,0.0000762623,0.000307036,0.000007776393,0.00074787054,0.0009579306],"genre_scores_gemma":[0.99157035,0.000116150615,0.008121509,0.0000056091453,0.000029417546,0.00008911293,0.000012826124,0.000043315576,0.000011680709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991899,0.000024555888,0.00028920197,0.00015006421,0.00010591705,0.00024034198],"domain_scores_gemma":[0.99944913,0.00008686872,0.00006815198,0.0003259964,0.00004147574,0.000028363673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000121125624,0.00017938379,0.00025302317,0.00023497353,0.000043500135,0.000015052514,0.0002066477,0.00008596859,0.000011781227],"category_scores_gemma":[0.000010715514,0.000178221,0.000038493265,0.0003940683,0.000043297074,0.00023258493,0.000048140853,0.00016090005,0.0000054057728],"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.000016631777,0.00003574979,0.000505761,0.000065561486,0.000011238844,0.0000043693003,0.00008390054,0.75515187,0.24193312,0.00005527285,0.000035426336,0.0021010921],"study_design_scores_gemma":[0.00031337165,0.00011049695,0.0021050733,0.0001767754,0.000007247333,0.000010197366,0.00004417696,0.25387418,0.7417825,0.0012610249,0.00007700999,0.00023798145],"about_ca_topic_score_codex":0.000215412,"about_ca_topic_score_gemma":0.000075738935,"teacher_disagreement_score":0.5012777,"about_ca_system_score_codex":0.00011664529,"about_ca_system_score_gemma":0.000007640202,"threshold_uncertainty_score":0.72676414},"labels":[],"label_agreement":null},{"id":"W2145300968","doi":"10.1109/glocom.2006.591","title":"SPC11-1: A Soft-Output Tree/Trellis Multiuser Equalizer for an Iterative FEC-coded DS-CDMA system in Frequency Selective Fading","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Queen's University","funders":"","keywords":"Trellis (graph); Algorithm; Fading; Trellis modulation; Computer science; Rayleigh fading; Space–time trellis code; Convolutional code; Tree (set theory); Code division multiple access; Mathematics; Decoding methods; Telecommunications; Low-density parity-check code; Error floor","score_opus":0.02041663534886946,"score_gpt":0.27285796115227984,"score_spread":0.2524413258034104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145300968","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.12495913,0.0007881529,0.85365486,0.00003699894,0.00018534162,0.0015235109,0.0001509489,0.0025280502,0.016172998],"genre_scores_gemma":[0.9200181,0.000018646922,0.07894994,0.000025009982,0.00008313709,0.0005784064,0.000110801404,0.00009069494,0.00012526424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983722,0.00011270043,0.00055070996,0.0003563998,0.00014949313,0.00045848038],"domain_scores_gemma":[0.99886733,0.00021832374,0.00011389533,0.0005893692,0.00014047732,0.00007058899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021084692,0.00033043523,0.00041466884,0.0002461237,0.00012202662,0.000073800154,0.00040697557,0.00018421703,0.0000069107878],"category_scores_gemma":[0.000040521012,0.00035745575,0.00009786688,0.00040463827,0.000040641004,0.000573109,0.000049026483,0.00026723798,0.000017045686],"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.00040309087,0.0014820959,0.024908146,0.0023254121,0.00054089905,0.0000911407,0.023650018,0.33606592,0.20517977,0.23794113,0.013570593,0.1538418],"study_design_scores_gemma":[0.004326552,0.00038020057,0.0064355857,0.0008655313,0.000077284065,0.000030756062,0.0016163038,0.77454334,0.17506227,0.025605692,0.008730544,0.0023259479],"about_ca_topic_score_codex":0.0007857799,"about_ca_topic_score_gemma":0.0023324445,"teacher_disagreement_score":0.79505897,"about_ca_system_score_codex":0.00075779326,"about_ca_system_score_gemma":0.000025125839,"threshold_uncertainty_score":0.99988776},"labels":[],"label_agreement":null},{"id":"W2145975143","doi":"10.1109/glocom.2006.128","title":"CTH16-6: Adaptive Coding and Modulation for Hybrid ARQ Systems over Partially Observable Nakagami-m Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Link adaptation; Computer science; Fading; Hybrid automatic repeat request; Channel state information; Observable; Algorithm; Automatic repeat request; Adaptive coding; Transmitter; Coding (social sciences); Telecommunications link; Markov process; Channel (broadcasting); Decoding methods; Computer network; Wireless; Mathematics; Telecommunications; Statistics","score_opus":0.014154824316424909,"score_gpt":0.20651242688273236,"score_spread":0.19235760256630746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145975143","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.13531627,0.0006249743,0.86187994,0.000014687392,0.0008726668,0.00048928795,0.000035462428,0.00032373407,0.00044299947],"genre_scores_gemma":[0.9922028,0.000055173157,0.0068095084,0.000011291635,0.00051283976,0.000088650326,0.00009907307,0.00005303112,0.000167629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906933,0.000015783264,0.00026317968,0.00022047419,0.000111011956,0.0003202265],"domain_scores_gemma":[0.9996195,0.00007640816,0.000069244,0.00013070226,0.00005514304,0.00004902193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010189761,0.00017719151,0.00021196858,0.000054988242,0.000120579214,0.00008457914,0.000062005805,0.000072876304,0.0000048081474],"category_scores_gemma":[0.00001127481,0.00020507307,0.000036335816,0.00011781626,0.000015407779,0.00038480424,0.000020928563,0.00007314165,0.000003720796],"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.000012596782,0.000006284158,0.00044623239,0.00006201959,0.000017484545,0.0000017333127,0.000030555962,0.99344224,0.0007232647,0.0030542084,0.0012031965,0.0010002151],"study_design_scores_gemma":[0.00044880054,0.00002110804,0.0011266386,0.00008687734,0.000015538337,0.0000044194226,0.00001958761,0.994527,0.0007084771,0.00085742486,0.0019568382,0.0002272791],"about_ca_topic_score_codex":0.00006348722,"about_ca_topic_score_gemma":0.000028235772,"teacher_disagreement_score":0.8568865,"about_ca_system_score_codex":0.00014028815,"about_ca_system_score_gemma":0.0000071163804,"threshold_uncertainty_score":0.8362637},"labels":[],"label_agreement":null},{"id":"W2146989178","doi":"10.1109/glocom.2006.925","title":"WSN01-1: Frame Aggregation and Optimal Frame Size Adaptation for IEEE 802.11n WLANs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":221,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Frame (networking); Computer network; Protocol data unit; Throughput; Network packet; Channel (broadcasting); Network allocation vector; Local area network; Physical layer; Protocol (science); IEEE 802.11; Multiple Access with Collision Avoidance for Wireless; Wireless; Telecommunications","score_opus":0.012616918525001648,"score_gpt":0.24113368319086875,"score_spread":0.2285167646658671,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146989178","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.04619729,0.00012231317,0.9495425,0.00092553213,0.000300591,0.0024036737,0.000013919588,0.00014478188,0.00034938648],"genre_scores_gemma":[0.74571013,0.000010655762,0.251491,0.00045240205,0.00058243476,0.001391863,0.000016923052,0.00001630092,0.00032825235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989111,0.00003963318,0.00023081062,0.00034442925,0.00017218539,0.00030186502],"domain_scores_gemma":[0.9992101,0.00024717566,0.00012079303,0.0002779263,0.00007958253,0.00006437607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021427455,0.00014355779,0.00016013422,0.00003440103,0.00016433962,0.00028023604,0.0002938747,0.0001274774,0.000012341153],"category_scores_gemma":[0.00001882736,0.00013916599,0.00005609511,0.00017248644,0.000032953627,0.00041346875,0.000052879823,0.000103855644,0.000015995769],"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.00017956013,0.00033634002,0.0043625054,0.00019845126,0.000064764514,0.000021468191,0.0016018633,0.08596311,0.0015357063,0.18928218,0.041596565,0.6748575],"study_design_scores_gemma":[0.0011918166,0.00027540867,0.008472971,0.000079623394,0.000011944331,0.000013550519,0.000029942501,0.927363,0.0014397921,0.030081019,0.030655297,0.00038567916],"about_ca_topic_score_codex":0.00017619923,"about_ca_topic_score_gemma":0.00007917708,"teacher_disagreement_score":0.84139985,"about_ca_system_score_codex":0.000032689688,"about_ca_system_score_gemma":0.000043353117,"threshold_uncertainty_score":0.56750244},"labels":[],"label_agreement":null},{"id":"W2149284565","doi":"10.1109/glocom.2006.637","title":"WLC04-5: Bandwidth Allocation in 4G Heterogeneous Wireless Access Networks: A Noncooperative Game Theoretical Approach","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":38,"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; Quality of service; Bandwidth allocation; Oligopoly; Wireless network; Dynamic bandwidth allocation; Nash equilibrium; Bandwidth (computing); Game theory; Wireless; Cournot competition; Mathematical optimization; Telecommunications; Microeconomics; Economics","score_opus":0.010846706878348442,"score_gpt":0.25745472051387647,"score_spread":0.24660801363552803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149284565","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.034872405,0.00022532798,0.95494926,0.00047603002,0.00022277016,0.0030656222,0.0000031199593,0.00017935656,0.0060061147],"genre_scores_gemma":[0.9923729,0.00002098585,0.0049880682,0.00045020552,0.00036818074,0.0016772117,0.000026879548,0.000020756772,0.00007482687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976921,0.0002822561,0.00045402057,0.0006737831,0.00029849372,0.0005993237],"domain_scores_gemma":[0.9989336,0.000121038014,0.000118790485,0.00062248745,0.00009307602,0.00011101069],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042855486,0.0002821852,0.00035266715,0.00009441036,0.000091506045,0.00062721816,0.0013849088,0.00018364633,0.00003660126],"category_scores_gemma":[0.00000858513,0.0002459903,0.00008882457,0.00076724635,0.00014685631,0.0005695852,0.0004090974,0.0002890226,0.00002154093],"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.00008157378,0.0006087906,0.005366945,0.000036568814,0.00002619966,0.00007891927,0.00031156847,0.44933808,0.000042331918,0.4860997,0.0023181264,0.05569119],"study_design_scores_gemma":[0.00077591115,0.0000865083,0.0027869162,0.000057052395,0.000004472699,0.000035909245,0.000007137251,0.98572266,0.00031292383,0.008805218,0.0010348554,0.0003704349],"about_ca_topic_score_codex":0.00023588621,"about_ca_topic_score_gemma":0.00018729245,"teacher_disagreement_score":0.95750046,"about_ca_system_score_codex":0.00011015839,"about_ca_system_score_gemma":0.00008575045,"threshold_uncertainty_score":0.9999992},"labels":[],"label_agreement":null},{"id":"W2152003941","doi":"10.1109/glocom.2006.655","title":"WLC07-5: The Effects of Mobility on the Bit Error Rate Performance of Ad Hoc Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","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 Alberta","funders":"","keywords":"Wireless ad hoc network; Rician fading; Computer science; Bit error rate; Node (physics); Computer network; Waypoint; Mobility model; Mobile ad hoc network; Transmission (telecommunications); Fading; Wireless; Real-time computing; Channel (broadcasting); Telecommunications; Network packet; Physics","score_opus":0.006192139619971153,"score_gpt":0.2025820259056817,"score_spread":0.19638988628571055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152003941","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.9812602,0.00092487887,0.015058439,0.0005050186,0.000681688,0.00065866794,0.000002327987,0.00006360229,0.0008451845],"genre_scores_gemma":[0.99902904,0.00010947057,0.00024062104,0.0002980223,0.00010629126,0.00006543343,0.000001652293,0.000010969884,0.0001384757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824464,0.00032654917,0.00039524736,0.00034680628,0.00030987276,0.00037688576],"domain_scores_gemma":[0.99692285,0.0011348355,0.00030052615,0.0015060956,0.00009532149,0.000040342416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092026807,0.00019946689,0.00028490473,0.000029012064,0.00016180081,0.000045259694,0.0016571367,0.00009015623,0.000014138226],"category_scores_gemma":[0.00003313537,0.000112990514,0.00012803388,0.00057745166,0.00023436404,0.00015841756,0.00034368527,0.00029343966,0.000016833534],"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.00051389955,0.0020229681,0.0403126,0.00096700364,0.00027066644,0.00003561326,0.001476818,0.35994595,0.0037771075,0.13363338,0.0548911,0.4021529],"study_design_scores_gemma":[0.0004841305,0.00052080216,0.15306365,0.000216076,0.000021147294,0.000004431223,0.000013050825,0.8344563,0.008107507,0.0010716772,0.0018101649,0.00023105202],"about_ca_topic_score_codex":0.00009271172,"about_ca_topic_score_gemma":0.00008580012,"teacher_disagreement_score":0.47451034,"about_ca_system_score_codex":0.00004177326,"about_ca_system_score_gemma":0.000048452213,"threshold_uncertainty_score":0.46076193},"labels":[],"label_agreement":null},{"id":"W2152408207","doi":"10.1109/glocom.2006.570","title":"SPC07-3: An Iterative QR-SIC Receiver for Concatenated Space Frequency Coding Schemes in Severe Multipath Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","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 Calgary","funders":"","keywords":"Multipath propagation; Computer science; Single antenna interference cancellation; Orthogonal frequency-division multiplexing; Algorithm; Fading; MIMO; Turbo code; Diversity scheme; QR decomposition; Electronic engineering; MIMO-OFDM; Channel (broadcasting); Decoding methods; Telecommunications; Engineering; Physics","score_opus":0.016520590186403783,"score_gpt":0.2632228287976637,"score_spread":0.2467022386112599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152408207","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.7075291,0.0013327902,0.28021553,0.00032802776,0.0003798594,0.0016983134,0.00018997528,0.0025705004,0.005755872],"genre_scores_gemma":[0.933864,0.00010414004,0.06541308,0.00003609249,0.00005576959,0.0001835915,0.00015111038,0.000048108686,0.00014408905],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990486,0.00004403693,0.00028994895,0.00022850379,0.00008436481,0.0003045596],"domain_scores_gemma":[0.9993003,0.0000954284,0.00006597812,0.00039842929,0.000091470065,0.00004842039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012161057,0.00020809392,0.00023955556,0.00012909881,0.00007720739,0.00004625268,0.00029159331,0.00012350816,0.00003619799],"category_scores_gemma":[0.000039146275,0.00023022263,0.00004441233,0.000246004,0.000041088522,0.00051121996,0.00004013914,0.00020031589,0.000015013348],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019596845,0.0009070588,0.02785992,0.00088822487,0.00023215434,0.00008381433,0.008500659,0.2742971,0.44470525,0.15048431,0.015946317,0.075899236],"study_design_scores_gemma":[0.0039397627,0.0002028462,0.007009191,0.0006271756,0.000027164542,0.000021931795,0.00070504803,0.4746817,0.44950873,0.0384144,0.022892063,0.0019699747],"about_ca_topic_score_codex":0.00020430629,"about_ca_topic_score_gemma":0.00028147566,"teacher_disagreement_score":0.2263349,"about_ca_system_score_codex":0.00023898738,"about_ca_system_score_gemma":0.000013991591,"threshold_uncertainty_score":0.93882066},"labels":[],"label_agreement":null},{"id":"W2153578293","doi":"10.1109/glocom.2006.821","title":"WLC35-5: User-Aided Adaptive TDMA for Real-Time Services in an OFDM Based Cellular System","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"University of Calgary","funders":"","keywords":"Time division multiple access; Computer science; Orthogonal frequency-division multiplexing; Computer network; Channel (broadcasting); Channel allocation schemes; Spectral efficiency; Cellular network; Resource allocation; Real-time computing; Scheme (mathematics); Link adaptation; Distributed computing; Fading; Wireless; Telecommunications; Mathematics","score_opus":0.004712355726665208,"score_gpt":0.18881867967896956,"score_spread":0.18410632395230436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153578293","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.5177224,0.00022305717,0.4761184,0.00002341082,0.000330248,0.0010049016,0.00010876809,0.0012862359,0.0031826058],"genre_scores_gemma":[0.9520507,0.0000055948985,0.047084052,0.0000145074255,0.00019790798,0.000103087244,0.00036693498,0.000079669364,0.00009753872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988888,0.000038734604,0.00033288635,0.00026306577,0.00012223153,0.00035429027],"domain_scores_gemma":[0.999446,0.00006463168,0.00006927117,0.00029650712,0.00006404451,0.000059545237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001052123,0.00021638983,0.00027452686,0.00010458462,0.000053456573,0.00003667115,0.00017582907,0.0001294114,0.000017151353],"category_scores_gemma":[0.0000018395881,0.00024775774,0.000051957704,0.00027167954,0.0000120124605,0.0003072833,0.000015946262,0.00007607381,0.00003128617],"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.000036926354,0.000027983315,0.0006453588,0.00017914375,0.0000071571644,0.00000810607,0.000032812302,0.99379504,0.003958063,0.0007736366,0.00022116551,0.0003145836],"study_design_scores_gemma":[0.0007997724,0.00004676542,0.001148334,0.00013867175,0.000014219718,8.084699e-7,0.00008610234,0.9932156,0.003694222,0.00010078157,0.0004958,0.00025887246],"about_ca_topic_score_codex":0.0002738827,"about_ca_topic_score_gemma":0.00065109745,"teacher_disagreement_score":0.43432832,"about_ca_system_score_codex":0.00025941423,"about_ca_system_score_gemma":0.00001518466,"threshold_uncertainty_score":0.9999975},"labels":[],"label_agreement":null},{"id":"W2155705529","doi":"10.1109/glocom.2006.702","title":"WLC15-5: QoS Provisioning in the Absence of ARQ in Cellular Fixed Relay Networks through Inter-Cell Coordination","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Automatic repeat request; Network packet; Quality of service; Overhead (engineering); Throughput; Scheduling (production processes); Selective Repeat ARQ; Relay; Hybrid automatic repeat request; Wireless; Telecommunications link; Engineering; Telecommunications","score_opus":0.01656261650233108,"score_gpt":0.24803011527130744,"score_spread":0.23146749876897638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155705529","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.16860014,0.0017796691,0.81386113,0.0022357148,0.00033777748,0.0004655798,7.1332323e-7,0.000056309174,0.012662944],"genre_scores_gemma":[0.99364054,0.00010318972,0.005788673,0.00022333194,0.000045641355,0.000020342843,0.000006909942,0.0000050144986,0.00016636297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986686,0.0003243918,0.00039725855,0.00023875652,0.00016270319,0.00020829246],"domain_scores_gemma":[0.9988923,0.00025522854,0.00015062834,0.0006178274,0.000070203234,0.00001382579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000698898,0.00011266413,0.00015339136,0.000077799545,0.000093690025,0.00008739453,0.0011284205,0.000057482954,0.000012230234],"category_scores_gemma":[0.000035158166,0.00009092322,0.0000423926,0.00090292725,0.00004588061,0.000351415,0.00030211385,0.00027291078,0.000007899603],"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.00006647958,0.002198813,0.10894481,0.000110359,0.000020582249,0.000104506726,0.022740765,0.22836207,0.014036494,0.4110111,0.03809765,0.17430638],"study_design_scores_gemma":[0.00092820276,0.00008516592,0.025826704,0.00024069003,0.000002439422,0.000004511738,0.0002491989,0.95627147,0.0018611024,0.0020009372,0.0122533925,0.0002762015],"about_ca_topic_score_codex":0.00024161003,"about_ca_topic_score_gemma":0.0006953573,"teacher_disagreement_score":0.8250404,"about_ca_system_score_codex":0.000064218046,"about_ca_system_score_gemma":0.000033105283,"threshold_uncertainty_score":0.37077412},"labels":[],"label_agreement":null},{"id":"W2158099903","doi":"10.1109/glocom.2006.706","title":"WLC16-3: Performance Analysis and Optimal Signal Designs for Minimum Decoding Complexity ABBA Codes","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Decoding methods; Space–time block code; Block code; Algorithm; QAM; Upper and lower bounds; Computer science; Quadrature amplitude modulation; List decoding; Mathematics; Discrete mathematics; Theoretical computer science; Bit error rate; Concatenated error correction code","score_opus":0.032836028145906034,"score_gpt":0.2674403080796431,"score_spread":0.23460427993373706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158099903","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.39591616,0.00026317418,0.60259765,0.000021295915,0.000014419784,0.00013906848,0.000033624234,0.00037035294,0.00064424204],"genre_scores_gemma":[0.7592615,0.00009708955,0.2404432,0.000013702077,0.000027007323,0.00005299824,0.000060086248,0.000017761024,0.000026686512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924093,0.000017896687,0.0002552703,0.00016217005,0.00008308117,0.00024065175],"domain_scores_gemma":[0.9994387,0.00013054452,0.000051137253,0.00028915727,0.00004446174,0.00004601952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000133888,0.0001551661,0.00025480852,0.00014846314,0.00015844566,0.000044893543,0.00021415693,0.00006327207,0.000030422585],"category_scores_gemma":[0.0000062144277,0.00017201112,0.000078383906,0.00028367972,0.00008428367,0.00018374318,0.000053642085,0.00009546016,0.0000027798567],"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.00014413378,0.00022870867,0.116074294,0.0005867382,0.0010494047,0.0000048000584,0.0004463861,0.68899596,0.057935946,0.016391966,0.006604756,0.11153692],"study_design_scores_gemma":[0.00028380167,0.000043126416,0.017961629,0.000020268399,0.00011883541,0.000003232824,0.000033092365,0.9203417,0.057500824,0.0013482283,0.0020257772,0.00031953014],"about_ca_topic_score_codex":0.000049970924,"about_ca_topic_score_gemma":0.00014003563,"teacher_disagreement_score":0.3633453,"about_ca_system_score_codex":0.00007374725,"about_ca_system_score_gemma":0.0000069168677,"threshold_uncertainty_score":0.701441},"labels":[],"label_agreement":null},{"id":"W2161515511","doi":"10.1109/glocom.2006.982","title":"WSN16-1: A Weighted Clustering Algorithm Using Local Cluster-heads Election for QoS in MANETs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","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 Guelph","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Quality of service; Network packet; Routing protocol; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Network topology; Topology (electrical circuits); Algorithm; Wireless; Mathematics; Artificial intelligence","score_opus":0.009823099420125637,"score_gpt":0.24271082640668218,"score_spread":0.23288772698655655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161515511","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.012695092,0.00018488876,0.98437643,0.00017334326,0.0014229722,0.0005736437,0.0000035870082,0.00018702341,0.00038303982],"genre_scores_gemma":[0.5579807,0.000007881847,0.4399074,0.00040353014,0.0013264419,0.0001139721,0.000025214804,0.00003812046,0.00019674907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998144,0.00007533968,0.0004117151,0.0005353107,0.00021644044,0.0006172235],"domain_scores_gemma":[0.9992384,0.00008518522,0.00011420109,0.00042841994,0.00006207727,0.000071763505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030334824,0.00021075759,0.0002453657,0.00016218256,0.00013679669,0.00015779372,0.0004989187,0.00015567197,0.000010603872],"category_scores_gemma":[0.000004757085,0.00022797602,0.000082722254,0.00058256224,0.000033282406,0.00042748224,0.00023385203,0.00018335413,0.000015987815],"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.00004740464,0.00023709817,0.0011032359,0.0000582367,0.000020781621,0.000056598434,0.00014474221,0.10660882,0.0004549556,0.0025645609,0.0076349466,0.88106865],"study_design_scores_gemma":[0.00095387927,0.00008022694,0.0013972785,0.000048261114,0.0000060441,0.00008094733,0.0000067493784,0.98755944,0.00054626976,0.0019433695,0.00712445,0.00025310932],"about_ca_topic_score_codex":0.0012386865,"about_ca_topic_score_gemma":0.0018533731,"teacher_disagreement_score":0.88095057,"about_ca_system_score_codex":0.000382438,"about_ca_system_score_gemma":0.00006466338,"threshold_uncertainty_score":0.92965925},"labels":[],"label_agreement":null},{"id":"W2163614426","doi":"10.1109/glocom.2006.840","title":"WLC38-6: Minimax Linear Precoding for MISO Broadcast Channels with Bounded Uncertainty","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Precoding; Telecommunications link; Base station; Computer science; Mathematical optimization; Channel (broadcasting); Transmission (telecommunications); Channel state information; Bounded function; Zero-forcing precoding; Transmitter power output; Optimization problem; Control theory (sociology); MIMO; Mathematics; Wireless; Telecommunications; Transmitter","score_opus":0.009438924203018647,"score_gpt":0.21786655028168822,"score_spread":0.20842762607866958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163614426","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.034980137,0.0004436973,0.95844966,0.000060173246,0.00067974365,0.0008153749,0.00007212576,0.0006566963,0.0038424141],"genre_scores_gemma":[0.9241776,0.0000114403665,0.07342034,0.000026709135,0.00065331283,0.00016006459,0.00017260386,0.00009651019,0.0012814592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990481,0.000010458883,0.00026252432,0.00022925863,0.000093731025,0.0003559277],"domain_scores_gemma":[0.9995357,0.00005114944,0.000059534636,0.00021780247,0.00008044137,0.000055402405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007807317,0.00020559206,0.00022383762,0.000065262175,0.00012300133,0.000071072514,0.00011543382,0.00008787477,0.000022556143],"category_scores_gemma":[0.000015825228,0.00019811442,0.000053082673,0.00016807317,0.000030039257,0.00018591878,0.000013944188,0.00007518196,0.000023301069],"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.000029349158,0.00001721528,0.00015860779,0.00011614801,0.000024481476,0.0000022186784,0.00010564493,0.9946865,0.00058426475,0.00026276943,0.0024504666,0.0015623259],"study_design_scores_gemma":[0.0016796418,0.00011394437,0.000078925674,0.00014323744,0.000034710214,0.00002589947,0.00012423102,0.92008513,0.004679554,0.0006055512,0.071892075,0.0005371213],"about_ca_topic_score_codex":0.00011037939,"about_ca_topic_score_gemma":0.00017234226,"teacher_disagreement_score":0.8891974,"about_ca_system_score_codex":0.00016146355,"about_ca_system_score_gemma":0.000023190361,"threshold_uncertainty_score":0.80788714},"labels":[],"label_agreement":null},{"id":"W2164848417","doi":"10.1109/glocom.2006.877","title":"WLC45-1: Turbo Coded Type-II H-ARQ Scheme with Incremental Redundancy Using Sub-Block Recovery","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Selective Repeat ARQ; Computer science; Turbo code; Hybrid automatic repeat request; Algorithm; Turbo; Convolutional code; Automatic repeat request; Retransmission; Error detection and correction; Decoding methods; Computer network; Engineering; Telecommunications link","score_opus":0.010488746395528582,"score_gpt":0.22535041489163574,"score_spread":0.21486166849610716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164848417","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.97407436,0.0010511777,0.012975735,0.000049867685,0.00015417315,0.0002757986,0.000021653817,0.0013566957,0.010040538],"genre_scores_gemma":[0.9112903,0.000121575475,0.08822835,0.000036404337,0.000076924356,0.000015684494,0.000060247377,0.00006475625,0.00010578147],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99905133,0.00002420794,0.00027698145,0.00019204494,0.00016747814,0.00028796028],"domain_scores_gemma":[0.99920046,0.00002390135,0.000071567774,0.00058626675,0.000068682486,0.00004910703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007595254,0.00021452992,0.00020926031,0.00009118086,0.00015954948,0.000036012752,0.00028159315,0.0000957292,0.000046016678],"category_scores_gemma":[0.000009442687,0.00022272811,0.000041414463,0.00031807832,0.00005544142,0.00027665694,0.00012688986,0.00022333775,0.000025358235],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026823962,0.00044351112,0.011470832,0.00027605324,0.00028272995,0.00004959357,0.00023385765,0.11744302,0.82244545,0.0035851623,0.025352968,0.018148588],"study_design_scores_gemma":[0.0016729141,0.00031098802,0.003742759,0.00049268635,0.00006151413,0.00013700995,0.000101583595,0.059139013,0.8978002,0.0033057164,0.031606656,0.0016289668],"about_ca_topic_score_codex":0.00018845459,"about_ca_topic_score_gemma":0.00015061726,"teacher_disagreement_score":0.07535474,"about_ca_system_score_codex":0.0003116412,"about_ca_system_score_gemma":0.000031117324,"threshold_uncertainty_score":0.90825886},"labels":[],"label_agreement":null},{"id":"W2165072660","doi":"10.1109/glocom.2006.985","title":"WSN16-4: Logical Topology Design and Interface Assignment for Multi-Channel Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","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 British Columbia","funders":"","keywords":"Computer network; Computer science; Logical topology; Router; Wireless mesh network; Topology (electrical circuits); Network topology; Interface (matter); Distributed computing; Mesh networking; Goodput; Wireless network; Switched mesh; Channel (broadcasting); Wireless; Throughput; Engineering; Telecommunications; Parallel computing","score_opus":0.032760701758184,"score_gpt":0.2707320205910452,"score_spread":0.23797131883286118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165072660","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.002452923,0.0005178884,0.9947415,0.00055898033,0.0007309607,0.0007002362,0.0000023803498,0.00017543066,0.00011968905],"genre_scores_gemma":[0.88528585,0.000034929948,0.11355275,0.00038090494,0.00023016274,0.00015807975,0.0000046517953,0.000015322687,0.00033733965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981768,0.00015614646,0.0003207712,0.0006209948,0.00013465749,0.0005906422],"domain_scores_gemma":[0.9989592,0.00031112568,0.00011511952,0.00043704774,0.000054107593,0.00012341558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043218804,0.00023490489,0.00030391323,0.0000388285,0.00017593938,0.00014816054,0.00066100113,0.00020335913,0.000015734508],"category_scores_gemma":[0.00001223426,0.00021081172,0.000070834,0.00014106213,0.00011117097,0.00017496521,0.00040884654,0.00017702539,0.0000120731065],"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.00021030853,0.0010337415,0.0013554594,0.000053943353,0.00013923182,0.00009821792,0.00046350702,0.48850018,0.00066107506,0.28666285,0.10626049,0.114560984],"study_design_scores_gemma":[0.0008397174,0.00023340681,0.0007696225,0.00001590692,0.000009653099,0.000031848936,0.000014422692,0.9903214,0.0004861943,0.0052413275,0.0017833966,0.00025308703],"about_ca_topic_score_codex":0.000068307054,"about_ca_topic_score_gemma":0.000055197896,"teacher_disagreement_score":0.88283294,"about_ca_system_score_codex":0.00008396089,"about_ca_system_score_gemma":0.000026389895,"threshold_uncertainty_score":0.8596653},"labels":[],"label_agreement":null},{"id":"W2166045751","doi":"10.1109/glocom.2006.115","title":"CTH14-5: Probability Density Functions of Logarithmic Likelihood Ratios in Phase Shift Keying BICM","year":2006,"lang":"en","type":"article","venue":"Globecom","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":"Institut National de la Recherche Scientifique","funders":"","keywords":"Phase-shift keying; Algorithm; Computer science; Demodulation; Keying; Binary number; Channel (broadcasting); Modulation (music); Probabilistic logic; Encoder; Bit error rate; Transmission (telecommunications); Probability density function; Logarithm; Decoding methods; Amplitude and phase-shift keying; Electronic engineering; Mathematics; Telecommunications; Statistics; Arithmetic; Engineering; Physics; Artificial intelligence","score_opus":0.011303235933100649,"score_gpt":0.24638204009543999,"score_spread":0.23507880416233934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166045751","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.77432156,0.00023433461,0.22284155,0.000096669864,0.00007179199,0.00037718186,0.000024515548,0.00059633737,0.0014360679],"genre_scores_gemma":[0.98123467,0.000025089183,0.01856942,0.000011147167,0.000022804377,0.00006575913,0.00004177284,0.000018310715,0.000011042083],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990991,0.000045114455,0.00040668278,0.00015406888,0.00009911016,0.00019593723],"domain_scores_gemma":[0.9992224,0.00006186989,0.00006272477,0.0005706623,0.000050863015,0.000031503867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016779275,0.00013007568,0.00021155186,0.000117270894,0.00004543985,0.000012102863,0.00020674386,0.000084504434,0.0000318224],"category_scores_gemma":[0.00003518112,0.00015025976,0.000051865085,0.00031119797,0.000055079283,0.00018695621,0.00006543157,0.00020996091,0.000014018378],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021828777,0.005317345,0.27797478,0.0012969697,0.00016633129,0.000034122997,0.002708956,0.22621474,0.21555246,0.018312782,0.008978133,0.2432251],"study_design_scores_gemma":[0.006382906,0.00032346798,0.28012994,0.0004417386,0.000080313905,0.000024234909,0.00035117197,0.111310594,0.38512567,0.20368077,0.010206775,0.0019424225],"about_ca_topic_score_codex":0.00041177685,"about_ca_topic_score_gemma":0.0019770486,"teacher_disagreement_score":0.24128267,"about_ca_system_score_codex":0.00016958622,"about_ca_system_score_gemma":0.00002346917,"threshold_uncertainty_score":0.6127415},"labels":[],"label_agreement":null},{"id":"W2170206121","doi":"10.1109/glocom.2006.951","title":"WSN10-6: An Energy Consumption Study of Wireless Sensor Networks with Delay-Constrained Traffic","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Energy Efficient Wireless Sensor Networks","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":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Computer network; Traffic flow (computer networking); Wireless; Network delay; Energy (signal processing); Linear programming; Real-time computing; Mathematical optimization; Network packet; Algorithm; Engineering; Telecommunications; Mathematics","score_opus":0.008983945914421487,"score_gpt":0.21093189603225743,"score_spread":0.20194795011783595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170206121","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.7121498,0.00008542412,0.2866715,0.000027501208,0.00022971752,0.00017312562,0.000002510708,0.0002920154,0.0003684304],"genre_scores_gemma":[0.99063295,0.0000116767205,0.008950696,0.00006706267,0.00016677301,0.00002089096,0.000026339694,0.00003184082,0.00009175307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731046,0.00028390618,0.0005605294,0.00075456395,0.0005043444,0.0005861865],"domain_scores_gemma":[0.9981996,0.00013541903,0.00032362674,0.001012395,0.00017727312,0.00015168256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023937269,0.00034714857,0.00044356257,0.00017104906,0.00018325832,0.0001372664,0.0008590197,0.0001563111,0.000018042645],"category_scores_gemma":[0.0000028226084,0.00031025062,0.0000720335,0.00066098355,0.00016982105,0.0003405123,0.00012234201,0.0001913825,0.0000047674807],"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.000050466282,0.0011935584,0.0039405483,0.0000063999855,0.000041668467,0.000100986006,0.00018052227,0.9705056,0.0001160127,0.006347893,0.00013013146,0.017386219],"study_design_scores_gemma":[0.001850156,0.0008311083,0.008097691,0.00003984569,0.00003576624,0.00010298285,0.00016846643,0.988071,0.00020339404,0.000016405778,0.00014164636,0.00044151794],"about_ca_topic_score_codex":0.000672764,"about_ca_topic_score_gemma":0.0028533407,"teacher_disagreement_score":0.27848318,"about_ca_system_score_codex":0.00006414469,"about_ca_system_score_gemma":0.00005566979,"threshold_uncertainty_score":0.999935},"labels":[],"label_agreement":null}]}