{"meta":{"query_hash":"169e6c46bae4","filters":{"venue":"International Journal of Wireless Information Networks"},"cohort_total":24,"direct_labels_cover":0,"predictions_cover":24,"exported":24,"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/169e6c46bae4","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+Wireless+Information+Networks"},"results":[{"id":"W123717841","doi":"10.1023/a:1023414807283","title":"Performance of Reuse Partitioning in Cellular Systems with Mobile Users","year":2003,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"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; Handover; Blocking (statistics); Call blocking; Simple (philosophy); Reuse; Channel (broadcasting); Computer network; Channel capacity; Real-time computing; Simulation","score_opus":0.0101520176504799,"score_gpt":0.24139290501734653,"score_spread":0.23124088736686663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W123717841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96599,0.0011434425,0.02683741,0.00042140766,0.0000652374,0.000041096046,0.00016064869,0.00032369676,0.0050169453],"genre_scores_gemma":[0.99772817,0.00010885737,0.0016425346,0.000027285443,0.000020685482,0.000007690307,0.00005889667,0.000016622298,0.00038925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997359,0.00084789563,0.00008451133,0.00017156628,0.00041411837,0.0011228696],"domain_scores_gemma":[0.976498,0.01837821,0.0009532866,0.001250412,0.0023648902,0.0005551451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002778065,0.0010666446,0.0012193867,0.0009480109,0.0013391746,0.0017780302,0.0010245651,0.001326549,0.0024071983],"category_scores_gemma":[0.01357849,0.00043180847,0.00038349576,0.0013298786,0.0013587206,0.0015793692,0.0015961796,0.0006318658,0.00038111128],"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.006641964,0.00031799483,0.00567808,0.00015809957,0.00017452444,0.00025797394,0.00026851715,0.93212163,0.014761094,0.004770007,0.0015126152,0.03333753],"study_design_scores_gemma":[0.00016982724,0.0010077667,0.0032035874,0.000021012414,0.00015097603,0.00029572137,0.00026577755,0.9833143,0.007847379,0.0033588295,0.0003209814,0.000043830147],"about_ca_topic_score_codex":0.010931114,"about_ca_topic_score_gemma":0.0071771163,"teacher_disagreement_score":0.010931114,"about_ca_system_score_codex":0.0019345825,"about_ca_system_score_gemma":0.001671955,"threshold_uncertainty_score":0.021734953},"labels":[],"label_agreement":null},{"id":"W1502055501","doi":"10.1023/a:1025369628593","title":"An Upper Bound on Air Interface Blocking Probability in Multiservice CDMA Networks","year":2003,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Dimensioning; Upper and lower bounds; Handover; Blocking (statistics); Function (biology); Computer network; Mathematical optimization; Algorithm; Mathematics","score_opus":0.01627495602829005,"score_gpt":0.29987233361826215,"score_spread":0.2835973775899721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502055501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05487719,0.022136519,0.86944264,0.003988205,0.0014748509,0.0002489915,0.0010262396,0.0026946713,0.04411077],"genre_scores_gemma":[0.8237718,0.015279802,0.13640487,0.0025315485,0.003679981,0.00074329006,0.0008709367,0.0012404026,0.015477385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.990816,0.0016469622,0.0003197057,0.00092200364,0.004056112,0.002239171],"domain_scores_gemma":[0.9332556,0.054570638,0.001670988,0.0033460374,0.005245634,0.0019110381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009586612,0.0044503375,0.0050018383,0.004033765,0.0033129295,0.008802746,0.006113587,0.0033165482,0.0121146785],"category_scores_gemma":[0.04400837,0.0026028967,0.0015963331,0.0041805957,0.00359826,0.007659399,0.0063321227,0.007686869,0.0025076938],"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.0024362407,0.00069974986,0.0034768747,0.0023046515,0.00039971306,0.0006543095,0.000965811,0.5446105,0.031031279,0.24275027,0.027627038,0.14304355],"study_design_scores_gemma":[0.000075460404,0.00021621799,0.0013365361,0.00030058256,0.00026260415,0.0005068489,0.00013711864,0.89853126,0.005656754,0.08582564,0.0070347763,0.00011621271],"about_ca_topic_score_codex":0.004601067,"about_ca_topic_score_gemma":0.0057780715,"teacher_disagreement_score":0.0121146785,"about_ca_system_score_codex":0.00645298,"about_ca_system_score_gemma":0.0040558595,"threshold_uncertainty_score":0.050699472},"labels":[],"label_agreement":null},{"id":"W1564851929","doi":"10.1023/a:1009589512000","title":"Carrier-Sense Protocols for Packet-Switched Smart Antenna Basestations","year":2000,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Network packet; Aloha; Throughput; Polling; Space-division multiple access; Transmission (telecommunications); Protocol (science); Channel (broadcasting); Real-time computing; Base station; Wireless; Telecommunications","score_opus":0.015284564670947706,"score_gpt":0.28918756617921393,"score_spread":0.27390300150826624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564851929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06307503,0.002161187,0.9260276,0.00078835,0.00047348233,0.00029821912,0.0000723794,0.000868419,0.006235304],"genre_scores_gemma":[0.91608906,0.0012629897,0.07645305,0.00038362725,0.00023592029,0.0003016986,0.00009980743,0.000048279693,0.0051256367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990767,0.00020886425,0.000082766506,0.00011270346,0.00030521836,0.00021369927],"domain_scores_gemma":[0.9978897,0.0009467143,0.00021579363,0.00041829373,0.00043588554,0.00009364904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001884807,0.000603341,0.0007063083,0.0008871572,0.0011205694,0.0015967208,0.0011232134,0.0009452087,0.0013934704],"category_scores_gemma":[0.0041056513,0.00037425788,0.0003021631,0.0008195177,0.0011804383,0.0016789857,0.0019462829,0.0013265415,0.00039109308],"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.0014547311,0.00035333083,0.0016080674,0.00034644507,0.00020176033,0.00068934157,0.001553484,0.20497407,0.08068457,0.4048869,0.01005913,0.29318812],"study_design_scores_gemma":[0.00024181326,0.00044455993,0.00047204836,0.000052061954,0.00018868713,0.00037785375,0.00027984453,0.8645123,0.023384321,0.09585497,0.014111037,0.00008051748],"about_ca_topic_score_codex":0.001779234,"about_ca_topic_score_gemma":0.0022884489,"teacher_disagreement_score":0.001884807,"about_ca_system_score_codex":0.0006683736,"about_ca_system_score_gemma":0.0008966031,"threshold_uncertainty_score":0.009967923},"labels":[],"label_agreement":null},{"id":"W179006473","doi":"10.1023/a:1011301403812","title":"Letter: An Improved Decision-Feedback Receiver for CDMA IS-95 Reverse Link","year":2001,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); Ciena (Canada)","funders":"","keywords":"Computer science; Rayleigh fading; Additive white Gaussian noise; Code division multiple access; Multiuser detection; Fading; Block (permutation group theory); Joint (building); Algorithm; Performance improvement; Telecommunications; Decoding methods; Channel (broadcasting); Mathematics","score_opus":0.01938684976589332,"score_gpt":0.3011806497201832,"score_spread":0.2817937999542899,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W179006473","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0718051,0.004222738,0.1557151,0.6324912,0.10258608,0.00030309305,0.0007521576,0.0027814524,0.029343152],"genre_scores_gemma":[0.58535945,0.00348872,0.074380614,0.13733311,0.08858845,0.0001606477,0.00055500865,0.000337175,0.10979678],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991178,0.0002221958,0.0000812486,0.0001066462,0.00035906542,0.00011307458],"domain_scores_gemma":[0.9971372,0.0015499054,0.00010439626,0.0001731949,0.00094080914,0.000094565985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012481647,0.0005786201,0.00077509216,0.0003195446,0.0009935171,0.0015277162,0.00083724153,0.008756834,0.007165936],"category_scores_gemma":[0.008755729,0.00032545536,0.00044987298,0.00023524974,0.00076207495,0.00089022424,0.0003746995,0.0028694335,0.003521979],"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.004630798,0.00048546962,0.0051699593,0.00090604037,0.00019616562,0.029721418,0.00094808894,0.007010782,0.059761457,0.026811466,0.6371215,0.2272369],"study_design_scores_gemma":[0.0009052267,0.002559752,0.0070901886,0.0003711873,0.00072596874,0.042444218,0.0006677792,0.20764865,0.10757066,0.038709972,0.59099907,0.00030733415],"about_ca_topic_score_codex":0.0011071818,"about_ca_topic_score_gemma":0.0015778284,"teacher_disagreement_score":0.008756834,"about_ca_system_score_codex":0.0010735609,"about_ca_system_score_gemma":0.00070761197,"threshold_uncertainty_score":0.023972452},"labels":[],"label_agreement":null},{"id":"W2005672442","doi":"10.1007/s10776-012-0194-0","title":"Anonymous Indoor Navigation System on Handheld Mobile Devices for Visually Impaired","year":2012,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CNIB Foundation; University of Toronto","funders":"","keywords":"Computer science; Navigation system; Real-time computing; Computer vision; Mobile device; Visually impaired; Kalman filter; Tracking system; Tracking (education); Wireless; Artificial intelligence; Location tracking; Embedded system; Human–computer interaction; Telecommunications","score_opus":0.006454158641832048,"score_gpt":0.23847921321851634,"score_spread":0.2320250545766843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005672442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88135266,0.00033902467,0.09633001,0.00016268755,0.0002714345,0.00018320572,0.0008611466,0.00805492,0.012444873],"genre_scores_gemma":[0.9724689,0.00010201118,0.015065625,0.000077478595,0.000029164408,0.00007299044,0.00026070693,0.000052383362,0.011870726],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976104,0.00004850072,0.0000117535155,0.00005426365,0.00007589788,0.000048459427],"domain_scores_gemma":[0.99970007,0.000029001234,0.000022648777,0.000048880087,0.00016054731,0.00003887973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017871519,0.00043718418,0.0004962528,0.0003873993,0.00060118496,0.00038088975,0.0006727983,0.00047484206,0.0054372377],"category_scores_gemma":[0.00035535512,0.00012717745,0.00024415273,0.0002444588,0.00011516573,0.0003392712,0.0006451482,0.00022302306,0.0014372119],"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.005307045,0.0008627976,0.05620591,0.0004837041,0.00018050258,0.0043447125,0.0016530859,0.005817936,0.36077985,0.0023227553,0.026924238,0.53511745],"study_design_scores_gemma":[0.0009333201,0.0069310293,0.26243025,0.00029118673,0.0016430202,0.010103,0.003089404,0.248306,0.3829526,0.002626746,0.08019524,0.00049826107],"about_ca_topic_score_codex":0.005417015,"about_ca_topic_score_gemma":0.008033043,"teacher_disagreement_score":0.0054372377,"about_ca_system_score_codex":0.00029518892,"about_ca_system_score_gemma":0.0005858282,"threshold_uncertainty_score":0.018189311},"labels":[],"label_agreement":null},{"id":"W2006595325","doi":"10.1023/b:ijwi.0000034540.01589.55","title":"A Distributed Packet Scheduling Scheme with Interference Avoidance for Non Real-Time Applications in CDMA Networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Computer network; Code division multiple access; Network packet; Base station; Multipath propagation; Real-time computing; Spread spectrum; Cellular network; Channel (broadcasting)","score_opus":0.011063121801409602,"score_gpt":0.27381564987373425,"score_spread":0.26275252807232463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006595325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083200425,0.00049897144,0.9118859,0.00021148704,0.00040499258,0.00016403255,0.00004437442,0.0012112772,0.002378559],"genre_scores_gemma":[0.79116845,0.00015730328,0.20554319,0.00015266189,0.00019070876,0.00015253718,0.00007611269,0.00008248099,0.0024766051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990876,0.00024387574,0.000067422385,0.00016536415,0.00031016633,0.00012560868],"domain_scores_gemma":[0.9981084,0.0005753055,0.00012892163,0.00046469932,0.00054802693,0.00017461185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015850179,0.0006148841,0.0010269515,0.0007553516,0.001421487,0.0009619674,0.0022418373,0.00061054755,0.0015464386],"category_scores_gemma":[0.0025087055,0.0003662764,0.00037669085,0.000748982,0.00061552203,0.0009331941,0.0011416744,0.00087750005,0.00036884396],"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.0034323772,0.001361984,0.002090014,0.00021523754,0.00020597562,0.0004054209,0.00035745357,0.25652993,0.15756828,0.03655838,0.005225566,0.5360493],"study_design_scores_gemma":[0.00022701242,0.00039073284,0.00043638475,0.0000069768075,0.000069802256,0.00015726581,0.000034963705,0.97568434,0.015092969,0.005624407,0.0022447882,0.000030404064],"about_ca_topic_score_codex":0.0014352417,"about_ca_topic_score_gemma":0.0027230964,"teacher_disagreement_score":0.0022418373,"about_ca_system_score_codex":0.00096213043,"about_ca_system_score_gemma":0.0014499043,"threshold_uncertainty_score":0.008382499},"labels":[],"label_agreement":null},{"id":"W2012848175","doi":"10.1007/s10776-008-0081-x","title":"Low-Interference Service Management Approach for Mobile Networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Institut National de la Recherche Scientifique; Université du Québec à Montréal; Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Admission control; Computer network; Call Admission Control; Quality of service; Reservation; Bandwidth (computing); Wireless network; Telecommunications; Wireless","score_opus":0.020662748803130106,"score_gpt":0.27183467386362065,"score_spread":0.2511719250604905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012848175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014062192,0.0006025005,0.9736014,0.00045708974,0.00016451637,0.00010754616,0.00003315419,0.00041087045,0.010560709],"genre_scores_gemma":[0.759215,0.0008538072,0.22540042,0.00036704587,0.00044827585,0.00019673856,0.00011937749,0.00009831756,0.013301084],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.00016552997,0.000027642369,0.000081734186,0.00028098395,0.00011742031],"domain_scores_gemma":[0.99947435,0.0001701949,0.00003516819,0.00006921293,0.00020543367,0.00004574072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912425,0.00063100795,0.0006912351,0.0008691732,0.0011931588,0.0016880987,0.0020609156,0.0006668774,0.0024022816],"category_scores_gemma":[0.0013909427,0.00018992121,0.00045198333,0.0008059853,0.0006053085,0.0014318397,0.0009301472,0.0011863111,0.00070972624],"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.0003264059,0.000533222,0.0014437457,0.00028169842,0.00013057326,0.0004954251,0.0005476774,0.25479433,0.03158812,0.26636317,0.010618502,0.43287706],"study_design_scores_gemma":[0.00001605494,0.00009641532,0.00017247988,0.000011294275,0.000041259467,0.00012187735,0.00008281959,0.95689845,0.0027601845,0.034955993,0.004827409,0.000015747266],"about_ca_topic_score_codex":0.002598548,"about_ca_topic_score_gemma":0.0041656885,"teacher_disagreement_score":0.002598548,"about_ca_system_score_codex":0.0012940081,"about_ca_system_score_gemma":0.0009895359,"threshold_uncertainty_score":0.009388685},"labels":[],"label_agreement":null},{"id":"W2015065328","doi":"10.1007/s10776-012-0180-6","title":"Minimizing Power Cost in QoS Constrained Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"","keywords":"Time division multiple access; Computer science; Quality of service; Schedule; Reuse; Network packet; Computer network; Wireless sensor network; Frame (networking); Wireless; Efficient energy use; Energy consumption; Distributed computing; Mathematical optimization; Telecommunications","score_opus":0.009535124389270861,"score_gpt":0.24240332955357896,"score_spread":0.2328682051643081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015065328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.101573475,0.0025248372,0.8864971,0.0014262502,0.00025660175,0.00014486694,0.00020620716,0.00022967877,0.0071409964],"genre_scores_gemma":[0.9283208,0.0014463455,0.06409132,0.00018492891,0.00018189699,0.00013084055,0.00008857421,0.00017083128,0.005384424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901354,0.0003664356,0.00005173539,0.00013525545,0.00028148128,0.00015149382],"domain_scores_gemma":[0.9972579,0.001994411,0.00020233497,0.00013532767,0.00030084144,0.00010912446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569676,0.001193854,0.0015880844,0.00063867477,0.0005923855,0.0011993805,0.0018271409,0.0011105351,0.0024588935],"category_scores_gemma":[0.006174382,0.0007321872,0.0003599912,0.0016122974,0.00077024323,0.0022943672,0.0009959674,0.0007770498,0.00019625937],"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.00018773203,0.00007493139,0.00052831613,0.00020320907,0.00004293171,0.00010326862,0.00006847226,0.93006283,0.003905171,0.0236437,0.0013254997,0.039853938],"study_design_scores_gemma":[0.000014518646,0.000055418805,0.00021430512,0.000011073723,0.000015558924,0.00004673425,0.000026449561,0.9849199,0.00082286017,0.01333658,0.00053015613,0.000006533254],"about_ca_topic_score_codex":0.0021686223,"about_ca_topic_score_gemma":0.0029221561,"teacher_disagreement_score":0.0024588935,"about_ca_system_score_codex":0.0011687997,"about_ca_system_score_gemma":0.00079212646,"threshold_uncertainty_score":0.00848031},"labels":[],"label_agreement":null},{"id":"W2017163858","doi":"10.1007/s10776-013-0234-4","title":"Accurate Trilateration for Passive RFID Localization in Smart Homes","year":2013,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Université du Québec à Chicoutimi","keywords":"Trilateration; Computer science; Radio-frequency identification; Context (archaeology); Smart environment; Home automation; Fuzzy logic; Software deployment; Identification (biology); Computer security; Smart camera; Embedded system; Human–computer interaction; Real-time computing; Internet of Things; Artificial intelligence; Telecommunications; Software engineering","score_opus":0.004875365659693107,"score_gpt":0.21316589547723985,"score_spread":0.20829052981754675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017163858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030658273,0.00053436094,0.96452945,0.00012353128,0.00016498232,0.00002436536,0.000084304425,0.001177979,0.002702735],"genre_scores_gemma":[0.597585,0.0010402186,0.3928769,0.0002664941,0.0001611434,0.00009943173,0.00040137843,0.00019386546,0.0073755197],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99931836,0.00014672546,0.000038130624,0.00013602305,0.00029025142,0.0000705718],"domain_scores_gemma":[0.99948287,0.00012731335,0.00008033489,0.00012124066,0.0001706786,0.000017595441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615038,0.00064670265,0.0007377913,0.00062461436,0.00049076707,0.00085682963,0.00080931385,0.0008447539,0.0024992158],"category_scores_gemma":[0.0015901232,0.00040469307,0.00038303554,0.0010267107,0.00038060936,0.001452773,0.0011924318,0.0009310694,0.0017909127],"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.0012359708,0.00014296162,0.002322276,0.00041817973,0.00006356104,0.00033692867,0.00055489095,0.060492843,0.24079506,0.00947307,0.0065283845,0.6776358],"study_design_scores_gemma":[0.00009613262,0.0005902539,0.003431188,0.0001064619,0.00008560003,0.001545667,0.0003241399,0.8199529,0.15352854,0.0070327213,0.013212011,0.000094329465],"about_ca_topic_score_codex":0.0009887664,"about_ca_topic_score_gemma":0.0014547318,"teacher_disagreement_score":0.0024992158,"about_ca_system_score_codex":0.0002816901,"about_ca_system_score_gemma":0.0005022862,"threshold_uncertainty_score":0.0083607435},"labels":[],"label_agreement":null},{"id":"W2025958958","doi":"10.1007/s10776-009-0089-x","title":"CDMA-SFBC Downlink Performance","year":2009,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Telecommunications link; Rayleigh fading; Code division multiple access; Bit error rate; Phase-shift keying; Quadrature amplitude modulation; Electronic engineering; Transmission (telecommunications); Algorithm; Channel (broadcasting); Fading; Telecommunications; Engineering","score_opus":0.004342349623463817,"score_gpt":0.22103686293412644,"score_spread":0.21669451331066264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025958958","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81971586,0.0034633956,0.092100054,0.0023523814,0.000522225,0.00013543831,0.0017033592,0.0030022454,0.07700514],"genre_scores_gemma":[0.9797753,0.00051712693,0.012061673,0.00036390912,0.00013108939,0.000037312617,0.0006767334,0.00011375761,0.0063231653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766785,0.00045131726,0.00008145709,0.0002199572,0.0007320637,0.0008473457],"domain_scores_gemma":[0.9919121,0.0028518434,0.00028978227,0.00081591244,0.0038218682,0.00030839603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017804743,0.0010836709,0.0011649688,0.0012265028,0.0018692252,0.0019198579,0.0005592763,0.0019119086,0.007400057],"category_scores_gemma":[0.008560544,0.00027009493,0.00028746377,0.0013628737,0.0007530754,0.0013898106,0.0012738337,0.0009504261,0.0020924332],"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.009289449,0.0010821788,0.02448272,0.0007767623,0.00040769708,0.00128523,0.00080155925,0.3882479,0.21227854,0.020133998,0.022733057,0.31848085],"study_design_scores_gemma":[0.00028624688,0.0014949226,0.017265946,0.00014586578,0.0002624906,0.0023047759,0.00053294416,0.86574924,0.09526979,0.009018307,0.0074648075,0.00020474024],"about_ca_topic_score_codex":0.012158883,"about_ca_topic_score_gemma":0.015924271,"teacher_disagreement_score":0.012158883,"about_ca_system_score_codex":0.0017825535,"about_ca_system_score_gemma":0.0033534868,"threshold_uncertainty_score":0.024755657},"labels":[],"label_agreement":null},{"id":"W2033131707","doi":"10.1007/s10776-005-4784-y","title":"A Blind Adaptive Technique for Cancelling ICI in OFDM-WPAN Systems","year":2005,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"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; Orthogonal frequency-division multiplexing; Frequency offset; Time division multiple access; Subcarrier; Frequency-hopping spread spectrum; Wireless; Carrier frequency offset; Electronic engineering; Real-time computing; Computer network; Channel (broadcasting); Telecommunications","score_opus":0.013352465234026351,"score_gpt":0.265488784201678,"score_spread":0.25213631896765165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033131707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005393465,0.00033645466,0.9921435,0.00007471441,0.00014176547,0.00002528442,0.00002434317,0.0003361535,0.0015244045],"genre_scores_gemma":[0.17291456,0.00094360096,0.81604105,0.00030928096,0.0003529483,0.00012563461,0.00014670801,0.00011668875,0.009049559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.000060037204,0.00002225813,0.00005089779,0.00020379046,0.000038953298],"domain_scores_gemma":[0.9993616,0.00027686008,0.000054075554,0.00007935935,0.0002031204,0.000024989062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004388428,0.0006334716,0.00048443815,0.0005313534,0.0006343047,0.00061503064,0.0006872857,0.0010162116,0.0036382799],"category_scores_gemma":[0.0020555935,0.0003244897,0.00048173257,0.0006673205,0.00054857385,0.00085323513,0.00071428256,0.0012193698,0.001502752],"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.0005769617,0.00016614296,0.00042533036,0.0003020661,0.00012423859,0.00024757802,0.00014439637,0.04334466,0.29960564,0.0147601655,0.0034842845,0.6368185],"study_design_scores_gemma":[0.00010562033,0.00036193617,0.0011510301,0.000062648076,0.00016635595,0.0009165018,0.000044802033,0.83950335,0.13484022,0.00776932,0.014982435,0.000095887255],"about_ca_topic_score_codex":0.001036897,"about_ca_topic_score_gemma":0.002492225,"teacher_disagreement_score":0.0036382799,"about_ca_system_score_codex":0.00024896226,"about_ca_system_score_gemma":0.00066051167,"threshold_uncertainty_score":0.012171209},"labels":[],"label_agreement":null},{"id":"W2042106536","doi":"10.1023/b:ijwi.0000031813.76079.2a","title":"An Improved Round Robin Packet Scheduler for Wireless Networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"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; Computer network; Weighted round robin; Network packet; Quality of service; Scheduling (production processes); Wireless network; Maximum throughput scheduling; Wireless; Fairness measure; Distributed computing; Round-robin scheduling; Throughput; Fair-share scheduling; Mathematical optimization; Telecommunications","score_opus":0.00537595054861443,"score_gpt":0.23548659324910384,"score_spread":0.23011064270048942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042106536","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05086588,0.0014846462,0.9380749,0.00031991638,0.0008530424,0.00017588263,0.00016098178,0.005106804,0.0029578586],"genre_scores_gemma":[0.52942896,0.000561725,0.46278006,0.00032799973,0.00055204594,0.00016725497,0.00021921679,0.0004502276,0.005512455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871135,0.0004068022,0.00006976584,0.0001644067,0.000459057,0.00018856223],"domain_scores_gemma":[0.9978941,0.00078101637,0.00012663836,0.00040759522,0.00062718487,0.00016350303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024160636,0.0007738715,0.0014125468,0.000684363,0.0008322107,0.0009983211,0.0025540811,0.0005071389,0.003605278],"category_scores_gemma":[0.004545507,0.00050049066,0.0003833952,0.000779111,0.00043828535,0.0010408052,0.0008284043,0.0012813323,0.0008910838],"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.0045508477,0.00076691917,0.0014016159,0.0002918889,0.00018959478,0.0002904038,0.00021736741,0.4415863,0.06385157,0.02810216,0.02010744,0.438644],"study_design_scores_gemma":[0.00012807552,0.0001650806,0.00014138513,0.00000363341,0.00004007115,0.00004368793,0.0000072312755,0.99232227,0.0037515794,0.0015688909,0.001809186,0.000018970286],"about_ca_topic_score_codex":0.0047410917,"about_ca_topic_score_gemma":0.008141592,"teacher_disagreement_score":0.0047410917,"about_ca_system_score_codex":0.0010931507,"about_ca_system_score_gemma":0.002656543,"threshold_uncertainty_score":0.012777507},"labels":[],"label_agreement":null},{"id":"W2086715374","doi":"10.1007/s10776-006-0054-x","title":"Analysis of Traffic Distribution and Blocking Probability in Future Wireless Networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université Laval","funders":"","keywords":"Computer science; Handover; Computer network; Queueing theory; Blocking (statistics); Quality of service; Poisson distribution; Wireless network; Cellular traffic; Wireless; Cellular network; Channel (broadcasting); Telecommunications; Statistics","score_opus":0.0031761495967508138,"score_gpt":0.20028548828671022,"score_spread":0.19710933868995942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086715374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36133236,0.0015064729,0.62331533,0.0010318527,0.00006532455,0.000052831,0.00026364138,0.00033703845,0.012095078],"genre_scores_gemma":[0.98099834,0.0008812865,0.014040382,0.000051764728,0.00011226645,0.0000362077,0.00016056938,0.00008840413,0.0036307133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992065,0.00020705239,0.00002141327,0.00008471666,0.0002637672,0.00021656441],"domain_scores_gemma":[0.99310404,0.004737908,0.0005297887,0.00031840146,0.0010632011,0.00024663357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028542003,0.00057399756,0.0007674829,0.0017246503,0.000795802,0.001203075,0.0018336455,0.0009074956,0.0026803545],"category_scores_gemma":[0.010298735,0.00076970033,0.00058287417,0.0014837211,0.0012186674,0.0023471073,0.0006671196,0.0012167409,0.00035808573],"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.0000980211,0.000045311168,0.0028532203,0.000051043968,0.000032166146,0.00012463251,0.0001223496,0.87377065,0.0026845504,0.10888537,0.0011550011,0.0101777455],"study_design_scores_gemma":[0.0000022743986,0.000008985731,0.00060742174,0.000004233474,0.000008441056,0.00007037989,0.000018561303,0.9890611,0.00029219093,0.009653472,0.0002670485,0.000005909555],"about_ca_topic_score_codex":0.0049622757,"about_ca_topic_score_gemma":0.00408498,"teacher_disagreement_score":0.0049622757,"about_ca_system_score_codex":0.0025625536,"about_ca_system_score_gemma":0.0009854865,"threshold_uncertainty_score":0.018592715},"labels":[],"label_agreement":null},{"id":"W2089882011","doi":"10.1007/s10776-011-0167-8","title":"Extended Sum-of-Sinusoids-Based Simulation for Rician Fading Channels in Vehicular Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Rician fading; Non-line-of-sight propagation; Computer science; Vehicular ad hoc network; Convergence (economics); Wireless ad hoc network; Range (aeronautics); Fading; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.014939923757322584,"score_gpt":0.2411287280778672,"score_spread":0.2261888043205446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089882011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54945576,0.00038394987,0.43446162,0.00032794027,0.00016757747,0.00009260033,0.00033068258,0.0009050081,0.013874931],"genre_scores_gemma":[0.98266464,0.000107401036,0.016236696,0.000030200705,0.000012199443,0.000031924843,0.00010610514,0.000036070724,0.0007747317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965584,0.00014067374,0.000021210868,0.000031740718,0.000101256264,0.000049187296],"domain_scores_gemma":[0.99846494,0.0010721186,0.0000662548,0.000097666074,0.0002429315,0.00005605058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054573186,0.0004298546,0.0008667434,0.00045597114,0.00042504966,0.00077853166,0.00088625407,0.0009634532,0.0012806643],"category_scores_gemma":[0.002730733,0.00028843727,0.0005463114,0.00056041585,0.00046775656,0.0007627302,0.0007183498,0.0007588038,0.0001891306],"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.000027691376,0.00001437188,0.00024167144,0.000010061828,0.000008776988,0.0000258552,0.000031405052,0.9967077,0.00038090118,0.0011182989,0.00006551108,0.0013677081],"study_design_scores_gemma":[0.0000031259224,0.0000068361255,0.000025978366,8.8692383e-7,0.0000015934786,0.0000029854598,0.000004853923,0.9995388,0.00012900495,0.0002350869,0.00004928502,0.0000015672756],"about_ca_topic_score_codex":0.008179751,"about_ca_topic_score_gemma":0.0033684736,"teacher_disagreement_score":0.008179751,"about_ca_system_score_codex":0.00055943866,"about_ca_system_score_gemma":0.0005958896,"threshold_uncertainty_score":0.01626426},"labels":[],"label_agreement":null},{"id":"W2114398437","doi":"10.1007/s10776-007-0061-6","title":"Enhancing Fairness and Throughput of TCP in Heterogeneous Wireless Access Networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"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; TCP Westwood plus; TCP Friendly Rate Control; TCP global synchronization; TCP acceleration; CUBIC TCP; Zeta-TCP; TCP tuning; Network congestion; Wireless network; TCP Vegas; Throughput; Wireless; Network packet; Telecommunications","score_opus":0.007394912556597304,"score_gpt":0.25585527978806094,"score_spread":0.24846036723146364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114398437","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50129193,0.0017529465,0.48942345,0.0005838153,0.00034066068,0.00007360373,0.00004739342,0.0005965345,0.0058896123],"genre_scores_gemma":[0.9903556,0.00009175875,0.008955759,0.00003679464,0.000091592025,0.00001015934,0.0000064145383,0.000025127181,0.00042681044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976792,0.0010035817,0.00009230455,0.0002568783,0.0005301441,0.0004379246],"domain_scores_gemma":[0.98421013,0.011707646,0.0007667934,0.0012641846,0.0014577378,0.0005933785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054677213,0.0008889727,0.001249557,0.00086680247,0.0014885765,0.0020502526,0.0015676602,0.0009778081,0.0010100867],"category_scores_gemma":[0.01899982,0.0005257324,0.00036026293,0.0007748182,0.0014499576,0.0028289333,0.0019163687,0.0015425092,0.00016300616],"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.003379495,0.00084151176,0.009319791,0.0001810324,0.00017777,0.0004584777,0.0006330746,0.687536,0.091004744,0.06867808,0.0015040349,0.136286],"study_design_scores_gemma":[0.000052908625,0.00019215843,0.0009097149,0.0000065306112,0.000071410606,0.000081886865,0.00003647951,0.9741053,0.010636415,0.013483524,0.0003994162,0.000024254237],"about_ca_topic_score_codex":0.0020759325,"about_ca_topic_score_gemma":0.0020877963,"teacher_disagreement_score":0.0054677213,"about_ca_system_score_codex":0.0016624517,"about_ca_system_score_gemma":0.0012238602,"threshold_uncertainty_score":0.028916478},"labels":[],"label_agreement":null},{"id":"W2270922278","doi":"10.1007/s10776-015-0285-9","title":"User Cooperation for 5G Wireless Access Networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Telecommunications link; User equipment; Radio access technology; Radio resource management; Cellular network; Wireless; Radio access network; Wireless network; Exploit; Telecommunications; Base station; Mobile station; Computer security","score_opus":0.043325415032968786,"score_gpt":0.32117919947867063,"score_spread":0.27785378444570186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2270922278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09483842,0.0032525368,0.8776685,0.0014393334,0.000299671,0.00018526908,0.00020496098,0.000400915,0.021710362],"genre_scores_gemma":[0.9656899,0.0009520141,0.027025767,0.00022995127,0.00012454751,0.0001422848,0.00009040188,0.000034656616,0.00571047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973507,0.0012162342,0.00006945545,0.00025209866,0.0005319707,0.00057955185],"domain_scores_gemma":[0.9966478,0.0020850783,0.0001619565,0.00030660137,0.0006738676,0.00012466284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025567317,0.0010417461,0.0014020744,0.00065512664,0.0015296304,0.0012670398,0.0014622346,0.0014699782,0.004663509],"category_scores_gemma":[0.00504829,0.00057592767,0.0007686738,0.001005324,0.0011672871,0.0016537666,0.0022783806,0.0010131458,0.0006622097],"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.0009303875,0.00017952775,0.0018716065,0.00054098654,0.00020724036,0.0011259874,0.0010285332,0.50275826,0.015976992,0.37599912,0.013718165,0.08566319],"study_design_scores_gemma":[0.000040727093,0.00024635732,0.0005320633,0.000052969113,0.000106244945,0.00037751958,0.00020262541,0.9026108,0.002234004,0.08931592,0.004229386,0.00005140042],"about_ca_topic_score_codex":0.0035207658,"about_ca_topic_score_gemma":0.006654266,"teacher_disagreement_score":0.004663509,"about_ca_system_score_codex":0.0015303545,"about_ca_system_score_gemma":0.0021234036,"threshold_uncertainty_score":0.015600979},"labels":[],"label_agreement":null},{"id":"W2290175051","doi":"10.1023/a:1012378931278","title":"A Network-Based Dynamic Channel Assignment Scheme for TDMA Cellular Systems","year":2001,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"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; Computer network; Blocking (statistics); Base station; Time division multiple access; Call blocking; Interference (communication); Channel (broadcasting); Cellular network; Channel allocation schemes; Telecommunications; Handover; Wireless","score_opus":0.01871754756683175,"score_gpt":0.2768519602391897,"score_spread":0.2581344126723579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290175051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034732442,0.00043922104,0.958478,0.00017488377,0.00022254226,0.00012027028,0.000069082,0.00060744036,0.0051560225],"genre_scores_gemma":[0.82628906,0.00029004432,0.1684796,0.00011644631,0.00011065427,0.00017453909,0.000115723844,0.000043491316,0.0043804743],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995728,0.00010640699,0.000020004038,0.00007676219,0.00014227319,0.00008177124],"domain_scores_gemma":[0.9992919,0.00020705312,0.000050804072,0.00015279403,0.00022332209,0.00007409771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052862195,0.00037381076,0.0004967374,0.00052473764,0.0009820954,0.0007539658,0.0012193623,0.00049898255,0.002294686],"category_scores_gemma":[0.0015367351,0.00019396111,0.00020027225,0.00075955765,0.00050702435,0.00081813545,0.0010083085,0.0006699163,0.00049295166],"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.000986634,0.0003064045,0.0008588075,0.00015142454,0.00008121359,0.0002184943,0.00025187255,0.3116809,0.0841775,0.0719846,0.0061371173,0.5231651],"study_design_scores_gemma":[0.00006534829,0.00016364745,0.00027527017,0.000009775289,0.000041448795,0.0002297156,0.00003174297,0.9736675,0.008262387,0.010423287,0.0067955954,0.000034229954],"about_ca_topic_score_codex":0.0024365634,"about_ca_topic_score_gemma":0.0035383552,"teacher_disagreement_score":0.0024365634,"about_ca_system_score_codex":0.0008559048,"about_ca_system_score_gemma":0.0008789887,"threshold_uncertainty_score":0.007676482},"labels":[],"label_agreement":null},{"id":"W2292278363","doi":"10.1007/s10776-016-0296-1","title":"Performance Analysis of the Double-Antenna SDC System Over N-Nakagami Fading Channels","year":2016,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Nakagami distribution; Fading; Computer science; Antenna (radio); Probability density function; Algorithm; Channel (broadcasting); Telecommunications; Cumulative distribution function; Statistics; Topology (electrical circuits); Mathematics; Combinatorics","score_opus":0.018247433421348484,"score_gpt":0.25520143591972844,"score_spread":0.23695400249837995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292278363","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7327953,0.00239585,0.23563923,0.0010194838,0.00015266937,0.000102820246,0.00046584758,0.0007549481,0.026673775],"genre_scores_gemma":[0.9962871,0.000203529,0.0024391836,0.000036512876,0.000019957211,0.000011506799,0.000049276994,0.00001655526,0.0009363919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.00044549297,0.00006851685,0.00018106906,0.00040030046,0.00048396375],"domain_scores_gemma":[0.99370027,0.0034144619,0.00048219154,0.0003873223,0.001831071,0.00018453889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371736,0.0009656087,0.001004994,0.00094948855,0.001052371,0.0017957473,0.00058948627,0.0010349024,0.004167736],"category_scores_gemma":[0.0043215067,0.00029037782,0.00051835633,0.0011990262,0.0010845435,0.00081037916,0.0011245421,0.00060364493,0.0005706599],"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.001417276,0.00009352906,0.009616589,0.00029546215,0.00020991224,0.00066411245,0.00035404522,0.9052726,0.037930418,0.0150724,0.0013215939,0.02775216],"study_design_scores_gemma":[0.000017616234,0.00022504438,0.002009152,0.000018977646,0.000071283044,0.0002923664,0.00009776456,0.99108875,0.004595691,0.0011936799,0.00035535815,0.000034361034],"about_ca_topic_score_codex":0.010817025,"about_ca_topic_score_gemma":0.0076638875,"teacher_disagreement_score":0.010817025,"about_ca_system_score_codex":0.002251093,"about_ca_system_score_gemma":0.0017555242,"threshold_uncertainty_score":0.021508098},"labels":[],"label_agreement":null},{"id":"W2509143211","doi":"10.1007/s10776-016-0318-z","title":"Robustness, Stability, and Gains of Utility Maximization Algorithms for Mobile Ad Hoc Networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Asynchronous communication; Computer network; Network topology; Mobile ad hoc network; Robustness (evolution); Distributed computing; Utility maximization; Wireless ad hoc network; Network congestion; Algorithm; Wireless; Network packet","score_opus":0.019867308456306663,"score_gpt":0.26511562237535974,"score_spread":0.24524831391905308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509143211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15266149,0.0015690348,0.8353472,0.0009583546,0.00010428561,0.00013625622,0.00012367123,0.00032793122,0.008771803],"genre_scores_gemma":[0.97557384,0.0005200596,0.022141602,0.000072597824,0.000099602636,0.00009519962,0.000061594765,0.00008703402,0.001348588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697256,0.0015908935,0.0001280094,0.0003913607,0.0005823588,0.00033480185],"domain_scores_gemma":[0.9723188,0.02345564,0.001423616,0.000968957,0.001428433,0.0004044736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005877309,0.0014123713,0.0011136836,0.0014029437,0.0008598947,0.0023697894,0.001637567,0.0012637326,0.0017535464],"category_scores_gemma":[0.033934444,0.00065965677,0.0006619605,0.0013040637,0.0027521648,0.0034655372,0.002456649,0.0019889732,0.0003307327],"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.00067258393,0.00010236747,0.0011583698,0.00010178592,0.00008753307,0.00006244001,0.00024135188,0.89443415,0.0029311816,0.06809531,0.0010145955,0.031098273],"study_design_scores_gemma":[0.000028522862,0.00010434363,0.00022454916,0.000012856481,0.00001550909,0.000028777042,0.00003665986,0.96106446,0.00072537916,0.037538435,0.00020818049,0.000012371695],"about_ca_topic_score_codex":0.0018003089,"about_ca_topic_score_gemma":0.00083223963,"teacher_disagreement_score":0.005877309,"about_ca_system_score_codex":0.0019089682,"about_ca_system_score_gemma":0.0011300364,"threshold_uncertainty_score":0.03108257},"labels":[],"label_agreement":null},{"id":"W2603479549","doi":"10.1007/s10776-017-0349-0","title":"Adaptive Wireless Biomedical Capsule Tracking Based on Magnetic Sensing","year":2017,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Gastrointestinal Bleeding Diagnosis and Treatment","field":"Medicine","cited_by":17,"is_retracted":false,"has_abstract":false,"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; Tracking (education); Recursive least squares filter; Orientation (vector space); Controller (irrigation); Wireless; Control theory (sociology); Transmission (telecommunications); Position (finance); Artificial intelligence; Computer vision; Adaptive filter; Algorithm; Telecommunications; Mathematics","score_opus":0.019531568710090513,"score_gpt":0.2834242699049492,"score_spread":0.26389270119485864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603479549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04088841,0.0012522703,0.95152086,0.00033714026,0.00029869014,0.000054074837,0.000058301237,0.00040427345,0.0051860237],"genre_scores_gemma":[0.8120322,0.0012885492,0.1802559,0.0004156123,0.00029122725,0.00010057665,0.00012660684,0.00005072551,0.005438658],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997434,0.000065810826,0.000013118781,0.000069198424,0.00009260232,0.0000158687],"domain_scores_gemma":[0.9995968,0.00018674548,0.00007140599,0.000033466073,0.00008934292,0.00002229551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028685408,0.00042484087,0.00043706998,0.0003796521,0.00021719272,0.00040096717,0.000520718,0.00061042944,0.0007476039],"category_scores_gemma":[0.0011618265,0.00020123197,0.00029204253,0.00041248737,0.0002501417,0.0006430161,0.00053547136,0.00030672402,0.00036635235],"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.001048392,0.00023609835,0.004484217,0.00048571732,0.00013807,0.00050260784,0.00020511483,0.06707974,0.47666106,0.005869873,0.0032145327,0.4400746],"study_design_scores_gemma":[0.00005699133,0.0004525263,0.0047217547,0.00003037498,0.00009922749,0.001041719,0.00003562388,0.9399529,0.047038544,0.0021769549,0.004337326,0.0000559875],"about_ca_topic_score_codex":0.00039650977,"about_ca_topic_score_gemma":0.0006313045,"teacher_disagreement_score":0.0007476039,"about_ca_system_score_codex":0.00016685408,"about_ca_system_score_gemma":0.00017471702,"threshold_uncertainty_score":0.0025009513},"labels":[],"label_agreement":null},{"id":"W2786877580","doi":"10.1007/s10776-018-0388-1","title":"Energy-Efficient Deployment of Relay Nodes in Wireless Sensor Networks Using Evolutionary Techniques","year":2018,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Software deployment; Relay; Wireless sensor network; Heuristics; Differential evolution; Evolutionary algorithm; Key distribution in wireless sensor networks","score_opus":0.009742355587108606,"score_gpt":0.24691120336052544,"score_spread":0.23716884777341685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786877580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12718193,0.00053438527,0.86954606,0.00017094449,0.000034170578,0.000046160403,0.000013268902,0.00009949779,0.0023735228],"genre_scores_gemma":[0.84794194,0.00041126306,0.14981264,0.00004383113,0.00001803658,0.000082928724,0.000024684277,0.000029601311,0.0016352574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998355,0.00006806616,0.000008361687,0.00002524674,0.00004373584,0.000019091583],"domain_scores_gemma":[0.9994986,0.0003168944,0.00005993454,0.000032550066,0.00007621875,0.00001573598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059705164,0.00035376087,0.00043627908,0.00045734012,0.00030376704,0.0003474273,0.0006696912,0.0006223574,0.00055411534],"category_scores_gemma":[0.0023075202,0.00030564718,0.00034770378,0.0004121684,0.000383039,0.00070884445,0.0004576249,0.00034445987,0.00010379372],"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.00004659607,0.000042969725,0.0006954978,0.000050864754,0.000032148786,0.00008180977,0.000098102275,0.94103867,0.012328423,0.008179449,0.00021769821,0.03718774],"study_design_scores_gemma":[0.0000057594366,0.000031732267,0.00013543872,0.000004325813,0.0000075406615,0.00002630306,0.000013801632,0.99675685,0.0010535729,0.0017779762,0.00018382829,0.0000027503777],"about_ca_topic_score_codex":0.00070604787,"about_ca_topic_score_gemma":0.0008968218,"teacher_disagreement_score":0.00070604787,"about_ca_system_score_codex":0.00031596754,"about_ca_system_score_gemma":0.00025028863,"threshold_uncertainty_score":0.0031574965},"labels":[],"label_agreement":null},{"id":"W3161358203","doi":"10.1023/a:1014834100392","title":"Connection Admission Control for PCS-to-Internet Protocol Internetworking","year":2002,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"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; Computer network; Internetworking; UMTS frequency bands; Network packet; The Internet; Quality of service; Admission control; Scalability; Wireless network; Wireless; Distributed computing; Telecommunications; World Wide Web","score_opus":0.013302794239198504,"score_gpt":0.25473521976752667,"score_spread":0.24143242552832817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161358203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14195715,0.0013157021,0.83034575,0.0011872823,0.000821201,0.0004176102,0.00010998728,0.0036891934,0.020156085],"genre_scores_gemma":[0.978448,0.00015045986,0.018149985,0.00009010669,0.00016899887,0.00006966159,0.000040689323,0.000057667065,0.0028244164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856526,0.00028405563,0.00006835251,0.00018036038,0.00048586438,0.00041616682],"domain_scores_gemma":[0.99681747,0.0013759057,0.0001916692,0.0003353844,0.0010823823,0.0001971488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017170552,0.00063805905,0.0009117724,0.0011798987,0.0020604332,0.0024357268,0.0015105193,0.00069417054,0.0034878398],"category_scores_gemma":[0.0066912253,0.0003111505,0.00025794198,0.0008646865,0.001139268,0.001254653,0.001148785,0.002034666,0.0003972841],"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.0019382915,0.0009838805,0.0036235799,0.00018481772,0.00012474827,0.00046398432,0.00064161565,0.30299544,0.041841168,0.13184896,0.019720744,0.49563274],"study_design_scores_gemma":[0.00003872082,0.00007923342,0.00045007525,0.000007482274,0.000037030633,0.000051904048,0.000033238775,0.9804011,0.0036720869,0.013533908,0.0016752405,0.00002001925],"about_ca_topic_score_codex":0.010449848,"about_ca_topic_score_gemma":0.012727877,"teacher_disagreement_score":0.010449848,"about_ca_system_score_codex":0.0020975322,"about_ca_system_score_gemma":0.0018573172,"threshold_uncertainty_score":0.02077806},"labels":[],"label_agreement":null},{"id":"W321574646","doi":"10.1023/a:1023418908192","title":"A Moment-Generating Function (MGF) Derivative-Based Unified Analysis of Incoherent Diversity Reception of M-ary Orthogonal Signals over Independent and Correlated Fading Channels","year":2003,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Fading; Rician fading; Nakagami distribution; Fading distribution; Mathematics; Keying; Binary number; Rayleigh fading; Phase-shift keying; Frequency-shift keying; Diversity combining; Diversity scheme; Bit error rate; Applied mathematics; Algorithm; Computer science; Statistics; Telecommunications; Demodulation; Channel (broadcasting); Arithmetic; Decoding methods","score_opus":0.012302706043829,"score_gpt":0.23660237038015136,"score_spread":0.22429966433632237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W321574646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030833092,0.0006585091,0.96341527,0.00020792229,0.000053708412,0.000012992974,0.000040539806,0.000080436024,0.0046975273],"genre_scores_gemma":[0.8813262,0.0019075496,0.10523262,0.00025159804,0.0003179651,0.000055547756,0.00016981589,0.00023742282,0.0105012795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996649,0.00009650913,0.000009582591,0.000030354595,0.0001555581,0.00004320228],"domain_scores_gemma":[0.99943596,0.0002807374,0.000088007066,0.000052456136,0.00011653751,0.00002630867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008276275,0.00080566015,0.0008002162,0.0008078391,0.00032393733,0.0009460516,0.0008696168,0.0008350035,0.0010265147],"category_scores_gemma":[0.001961149,0.00038955372,0.0007711172,0.0008026471,0.0008327926,0.0013512367,0.0005948871,0.00089878845,0.00027417456],"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.000102038335,0.000046260746,0.00079543283,0.0001480169,0.000070987044,0.0005759484,0.00024805393,0.5348072,0.03363988,0.39849952,0.0018842156,0.029182414],"study_design_scores_gemma":[0.0000018021984,0.0000104214305,0.00023417862,0.0000056592075,0.0000069227717,0.000081472266,0.000008021745,0.982288,0.0008110288,0.016113231,0.00042836924,0.0000108359945],"about_ca_topic_score_codex":0.00095375656,"about_ca_topic_score_gemma":0.0010373935,"teacher_disagreement_score":0.0010265147,"about_ca_system_score_codex":0.0007352431,"about_ca_system_score_gemma":0.0005774425,"threshold_uncertainty_score":0.005334556},"labels":[],"label_agreement":null},{"id":"W92530893","doi":"10.1023/a:1009596207401","title":"A Distributed Fair Queueing (DFQ) Architecture for Wireless ATM Local Access Networks","year":2000,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode; Quality of service; Network packet; Wi-Fi; Scheduling (production processes); Local area network; Queueing theory; Data transmission; Base station; Wireless; Wireless network; Telecommunications","score_opus":0.006397050090726133,"score_gpt":0.24134544357864943,"score_spread":0.2349483934879233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W92530893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042084012,0.0006880582,0.9494032,0.00056735094,0.00047651352,0.00015130296,0.00014204788,0.003128456,0.0033590063],"genre_scores_gemma":[0.7255379,0.00042836482,0.26702413,0.00033465316,0.00033386386,0.00017935528,0.00020897886,0.00014475931,0.005808067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.00013554048,0.00004457723,0.00012113189,0.0002059631,0.00009677981],"domain_scores_gemma":[0.9988746,0.00029827308,0.00004116555,0.00025366838,0.00040967713,0.00012266368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020498391,0.00046814172,0.00068618223,0.0005826562,0.0015076846,0.0016450218,0.0032468399,0.0011137219,0.0038765601],"category_scores_gemma":[0.0034455506,0.000341379,0.00038490893,0.0006177756,0.0008126039,0.0019899758,0.00118278,0.0012472585,0.00064787414],"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.0018525115,0.0007977787,0.002508404,0.00027159287,0.00014286955,0.00027504866,0.0005632598,0.28428882,0.07338896,0.16312808,0.022470463,0.45031217],"study_design_scores_gemma":[0.00014740165,0.00020744665,0.00019992726,0.000015060654,0.000057462592,0.000054956145,0.000020156516,0.95244133,0.008098286,0.030524999,0.008194469,0.000038500966],"about_ca_topic_score_codex":0.006760418,"about_ca_topic_score_gemma":0.008460179,"teacher_disagreement_score":0.006760418,"about_ca_system_score_codex":0.0019524957,"about_ca_system_score_gemma":0.002052666,"threshold_uncertainty_score":0.014166415},"labels":[],"label_agreement":null}]}