{"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6342333,0.00026674426,0.3633401,0.00013557382,0.0006515587,0.00018004954,0.0000012323882,0.000018186885,0.0011732244],"genre_scores_gemma":[0.9938534,0.00062071305,0.005368961,0.000044813853,0.00006153493,0.000022095703,0.0000068712084,0.00000712507,0.000014465281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747545,0.00019230787,0.0010777058,0.000085694985,0.00094696775,0.00022187024],"domain_scores_gemma":[0.99683636,0.00019949279,0.0010422189,0.0005115215,0.0013262294,0.00008418779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012959,0.00012325706,0.00023951373,0.00051721005,0.00005647315,0.00022280125,0.0020988106,0.00008307287,0.000011482843],"category_scores_gemma":[0.00007511876,0.00010647411,0.000059560363,0.0005920203,0.00007464036,0.0034339037,0.00017463641,0.0004238893,0.0000051291204],"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.00006808339,0.000058241647,0.014338916,0.000018183666,0.00005196268,0.000008526727,0.0007354285,0.9692416,0.000032455173,0.0083093075,0.00021032036,0.0069269314],"study_design_scores_gemma":[0.0010366185,0.00019276104,0.0018135195,0.0004810195,0.0000038403805,0.00012083831,0.00028201062,0.9920198,0.0008288595,0.000031251202,0.0030526822,0.00013680772],"about_ca_topic_score_codex":0.000014417523,"about_ca_topic_score_gemma":0.0000035308203,"teacher_disagreement_score":0.35962012,"about_ca_system_score_codex":0.0001757053,"about_ca_system_score_gemma":0.00020240733,"threshold_uncertainty_score":0.4341888},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19278526,0.00018647179,0.80216867,0.0012183317,0.0017851507,0.0002965268,0.0000018478975,0.00006574978,0.0014920082],"genre_scores_gemma":[0.9906564,0.00027044307,0.007788875,0.0009777021,0.000244461,0.000019920157,0.0000128875,0.000016336886,0.00001300244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99579203,0.00068942894,0.0015610097,0.00024176812,0.0012353248,0.00048042127],"domain_scores_gemma":[0.9958088,0.0005049629,0.0010204192,0.00085955235,0.0015735455,0.00023275544],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027930064,0.00027452887,0.0003509647,0.00067953794,0.00015026375,0.00068242836,0.0037457943,0.00022832022,0.000038158145],"category_scores_gemma":[0.00020209893,0.00025942,0.00014919968,0.00077948667,0.00009564656,0.0053772083,0.0003105877,0.0012870294,0.000019774498],"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.00011403244,0.00023519393,0.0030777936,0.0000068557597,0.000051794264,0.000014020498,0.0008948569,0.9048097,0.000008375061,0.022829881,0.0002795657,0.06767793],"study_design_scores_gemma":[0.0012761957,0.000154464,0.005954468,0.00028078558,0.0000034987563,0.00014043898,0.00014658817,0.98625207,0.00017026081,0.0010114766,0.004353974,0.0002557563],"about_ca_topic_score_codex":0.000030911815,"about_ca_topic_score_gemma":0.000055120254,"teacher_disagreement_score":0.7978711,"about_ca_system_score_codex":0.00057127496,"about_ca_system_score_gemma":0.00023136436,"threshold_uncertainty_score":0.9999858},"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":"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.004083765,0.000022728878,0.9840738,0.0016546161,0.0009051241,0.008102683,0.000039147315,0.000070833,0.0010472792],"genre_scores_gemma":[0.9531876,0.00015656272,0.030794889,0.0033442865,0.0019961346,0.0100735035,0.00010831781,0.000034045832,0.0003046611],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974038,0.000084370266,0.0012852565,0.00014728334,0.0007459019,0.0003333866],"domain_scores_gemma":[0.9966236,0.00029708908,0.00093306234,0.0003048335,0.0016520497,0.00018936269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008601001,0.00021662156,0.0003084407,0.00026244202,0.00016870142,0.0007175694,0.0012033213,0.00014162861,0.00013887646],"category_scores_gemma":[0.00007286499,0.00019141186,0.00025659768,0.00032058367,0.000054105767,0.003908796,0.00007209161,0.00032567442,0.000019841176],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070843846,0.00014994253,0.0006563763,0.00003568608,0.00023085634,0.000037948,0.001153728,0.06377291,0.000030357323,0.022451483,0.018135052,0.8926372],"study_design_scores_gemma":[0.0022810681,0.00026835955,0.0008930017,0.0003253136,0.000011716086,0.000284302,0.000051552386,0.8002602,0.00012458283,0.0015020665,0.19372623,0.00027161994],"about_ca_topic_score_codex":0.0000098343335,"about_ca_topic_score_gemma":0.0000060262387,"teacher_disagreement_score":0.95327896,"about_ca_system_score_codex":0.00012146301,"about_ca_system_score_gemma":0.00024375485,"threshold_uncertainty_score":0.78055495},"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":"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.007657157,0.00017768827,0.9750898,0.013610927,0.002612657,0.0003067761,0.000010246042,0.00006278253,0.00047199387],"genre_scores_gemma":[0.8400784,0.0052901306,0.13333908,0.016757166,0.0040864875,0.000055929188,0.00010664911,0.00004265453,0.00024349563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967142,0.00012870609,0.0014256199,0.00019641915,0.001134261,0.0004008041],"domain_scores_gemma":[0.9938344,0.0006421455,0.0012202355,0.0007726687,0.0032684766,0.00026211856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015066216,0.00022908542,0.00030911417,0.0004587154,0.00020489097,0.00087619165,0.00436375,0.00021883857,0.0000825201],"category_scores_gemma":[0.00019436977,0.00021104897,0.00025158515,0.00050377654,0.0000839142,0.007675288,0.0004482326,0.00066154235,0.00004154395],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042945537,0.000083656174,0.000246662,0.000005998298,0.00013402874,0.000011576286,0.0007551508,0.047559652,0.00003228833,0.003639868,0.08560165,0.8615],"study_design_scores_gemma":[0.0013924008,0.00013105008,0.00042790588,0.00011004583,0.000006298808,0.00015667209,0.0000430863,0.7087789,0.00005723297,0.0009587446,0.28776106,0.00017658292],"about_ca_topic_score_codex":0.0000141667915,"about_ca_topic_score_gemma":0.000009938417,"teacher_disagreement_score":0.8613234,"about_ca_system_score_codex":0.0002670111,"about_ca_system_score_gemma":0.00020522244,"threshold_uncertainty_score":0.8606327},"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":"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.40504387,0.0002912787,0.58762985,0.000048732276,0.0052690944,0.00035610862,0.000040749386,0.00031737002,0.0010029249],"genre_scores_gemma":[0.9982958,0.000052538206,0.00057330343,0.00010559963,0.00079515466,0.000041124324,0.00011159833,0.000017534516,0.0000073611336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856573,0.000016405442,0.00075169455,0.000042512973,0.0004011726,0.00022249919],"domain_scores_gemma":[0.9987039,0.00010969666,0.0004163105,0.00008899188,0.000609941,0.00007113646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038716925,0.00015064831,0.00019258376,0.0003098921,0.00006877501,0.00013155525,0.00033770115,0.00017026257,0.000011383961],"category_scores_gemma":[0.000032883145,0.00013306514,0.00011990091,0.0001384391,0.000024479936,0.0016921873,0.000022744265,0.00020283478,0.00001698106],"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.00029643433,0.00007301041,0.0030290175,0.00019493462,0.00035810415,0.0000047194985,0.0014506454,0.825131,0.00016513198,0.0109131355,0.005429967,0.15295391],"study_design_scores_gemma":[0.0025230313,0.00037831962,0.001962939,0.0008270628,0.00006045905,0.00031561765,0.003093134,0.9493661,0.010783647,0.00006281164,0.030166551,0.00046032554],"about_ca_topic_score_codex":0.0000012841897,"about_ca_topic_score_gemma":6.5062625e-7,"teacher_disagreement_score":0.59325194,"about_ca_system_score_codex":0.00027354885,"about_ca_system_score_gemma":0.00002418633,"threshold_uncertainty_score":0.54262394},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027229048,0.00007526388,0.9700444,0.001502296,0.00027756774,0.00054531696,0.000014180648,0.00006183711,0.00025012015],"genre_scores_gemma":[0.92849064,0.0005688659,0.070152804,0.00016396359,0.00028887726,0.00014283249,0.00016536457,0.000017002494,0.000009623668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972016,0.00008040693,0.0012884793,0.00021333454,0.0007668106,0.000449327],"domain_scores_gemma":[0.99553275,0.00046521096,0.0012065987,0.0005679727,0.002045861,0.00018161892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010550179,0.0002576429,0.00037597108,0.00052158546,0.00016408156,0.00058760855,0.003125976,0.00017824472,0.0000066458733],"category_scores_gemma":[0.00008769456,0.00022724249,0.00013525436,0.0009536266,0.00012182771,0.003614648,0.0003720945,0.00075498264,0.0000096829135],"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.00021370026,0.0001325438,0.0013697637,0.000014599501,0.000097478136,0.000006320859,0.00046787073,0.95160943,0.000045651534,0.025017925,0.00017565978,0.020849057],"study_design_scores_gemma":[0.0024167553,0.00016185224,0.002210715,0.0005885213,0.0000067252804,0.00007357302,0.00013998881,0.9924066,0.00014080717,0.0008324299,0.00075719744,0.00026483735],"about_ca_topic_score_codex":0.000025680487,"about_ca_topic_score_gemma":0.00003240581,"teacher_disagreement_score":0.9012616,"about_ca_system_score_codex":0.0005560147,"about_ca_system_score_gemma":0.0003756409,"threshold_uncertainty_score":0.926668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035754344,0.00014414442,0.99070257,0.00052501174,0.0012928206,0.0004862449,0.000004292026,0.0000744929,0.0031950076],"genre_scores_gemma":[0.9440078,0.0026505035,0.051493715,0.0009998804,0.00054816576,0.0001420653,0.0000772135,0.000016143269,0.00006447757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997032,0.00011506021,0.0012472094,0.00018456155,0.0010131324,0.0004080686],"domain_scores_gemma":[0.9952203,0.00027698505,0.0010255717,0.00062152045,0.0026700604,0.00018557248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000922502,0.0002316094,0.00031510906,0.0004861153,0.00023858319,0.00039607447,0.0047130696,0.00015377661,0.000015445932],"category_scores_gemma":[0.000026710184,0.00021593699,0.00020866566,0.00064273167,0.000083197236,0.0035436233,0.0007539952,0.0005541488,0.000012736323],"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.00013864994,0.00014299742,0.00012372287,0.000026471147,0.00019734271,0.00001114418,0.00055469794,0.80277354,0.0000027048127,0.008851626,0.005400835,0.18177626],"study_design_scores_gemma":[0.0012362102,0.00010000628,0.00040093332,0.000111818656,0.000008165018,0.00030185928,0.00014518911,0.9871774,0.000056918547,0.000099660116,0.010149484,0.00021238637],"about_ca_topic_score_codex":0.00000541123,"about_ca_topic_score_gemma":0.0000015437076,"teacher_disagreement_score":0.9404324,"about_ca_system_score_codex":0.00022823327,"about_ca_system_score_gemma":0.00012236078,"threshold_uncertainty_score":0.8805655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08949125,0.00028678874,0.89635444,0.000722095,0.01035702,0.00022771317,0.000004231323,0.00008597939,0.002470491],"genre_scores_gemma":[0.9882116,0.00028530217,0.008646335,0.0012734303,0.0014964736,0.000011916147,0.000025766325,0.000022889952,0.000026300086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956771,0.00020867203,0.0019006964,0.00019052395,0.0011915655,0.0008314127],"domain_scores_gemma":[0.99607944,0.00050985493,0.0016260804,0.00037907079,0.0010529592,0.0003525949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015485669,0.0003641618,0.0005052667,0.00081740133,0.00010989814,0.00048995216,0.001898985,0.0003233032,0.00004770314],"category_scores_gemma":[0.0000997898,0.00034797698,0.00024789115,0.0007425523,0.00013430999,0.005505418,0.0003201756,0.0009486244,0.000023530944],"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.00011388526,0.00016769637,0.0062152483,0.000005391507,0.00011913608,0.000052783635,0.0012589179,0.9071584,0.000022650425,0.01781052,0.0016212744,0.065454096],"study_design_scores_gemma":[0.0019089901,0.00006279721,0.0038954956,0.00031527082,0.000012290601,0.00064003735,0.0004120669,0.9845678,0.00013757858,0.000019840321,0.0076026022,0.00042518927],"about_ca_topic_score_codex":0.00001306031,"about_ca_topic_score_gemma":0.0000067086053,"teacher_disagreement_score":0.8987203,"about_ca_system_score_codex":0.00040333022,"about_ca_system_score_gemma":0.00013146146,"threshold_uncertainty_score":0.99989724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034422092,0.00006611101,0.96254903,0.00035445287,0.0019046335,0.00027062773,0.0000080464715,0.00008743659,0.00033756197],"genre_scores_gemma":[0.9984217,0.00035052912,0.0005972204,0.0002522562,0.00020719167,0.00004136354,0.00010737727,0.000011984137,0.00001035571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986833,0.000014901942,0.000843811,0.000046631158,0.00025699637,0.00015437607],"domain_scores_gemma":[0.9986128,0.00007409192,0.00031646632,0.00006926512,0.0008917636,0.000035610185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016239514,0.00012234898,0.00017112606,0.00047793862,0.000036106885,0.00021678086,0.000274385,0.00014744587,0.00005377681],"category_scores_gemma":[0.00008373741,0.00011176509,0.000072686846,0.00020608515,0.000025282094,0.0026076154,0.000019398807,0.0001664936,0.0000145372505],"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.000033935135,0.0000111128675,0.00089980895,0.000018719495,0.00005104768,0.0000012609684,0.00035491187,0.9086109,0.000027447832,0.002283393,0.0070913816,0.08061609],"study_design_scores_gemma":[0.001004769,0.000037060876,0.0014321656,0.000089004476,0.00000607737,0.000017261558,0.00033081628,0.9888878,0.0014403646,0.0009537607,0.005671134,0.00012980985],"about_ca_topic_score_codex":0.000007255457,"about_ca_topic_score_gemma":0.0000072900298,"teacher_disagreement_score":0.9639996,"about_ca_system_score_codex":0.00017541437,"about_ca_system_score_gemma":0.000026813634,"threshold_uncertainty_score":0.45576483},"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":"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.13529314,0.00039596224,0.85129476,0.00068212784,0.0016756598,0.00012842813,0.000006183816,0.00037091476,0.010152835],"genre_scores_gemma":[0.9902235,0.0032933028,0.005596598,0.00048977585,0.00034250703,0.000003404188,0.000027544935,0.000009855963,0.000013498378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985226,0.000016769201,0.00083109754,0.000039315873,0.00043299372,0.00015725897],"domain_scores_gemma":[0.9986624,0.000048443817,0.00038941784,0.00018958289,0.0006385744,0.00007155822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025297658,0.00014015357,0.00017920345,0.000299111,0.00004664606,0.000100332414,0.00080090825,0.000104937615,0.000035141606],"category_scores_gemma":[0.000022773362,0.00013534354,0.000091686336,0.00016309443,0.00003094132,0.0026552968,0.000033001746,0.0004450533,0.000019226234],"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.000034390265,0.00001635638,0.0001655629,0.000005343898,0.00004426397,0.000002288754,0.0002178302,0.42804843,0.0000940306,0.0015679915,0.0028203842,0.5669831],"study_design_scores_gemma":[0.0008485364,0.00013393511,0.005348332,0.00027416676,0.000012728029,0.00020966514,0.00009466128,0.93276316,0.0044208514,0.0007516334,0.054815058,0.00032726844],"about_ca_topic_score_codex":4.869443e-7,"about_ca_topic_score_gemma":3.111277e-7,"teacher_disagreement_score":0.85493034,"about_ca_system_score_codex":0.00020179049,"about_ca_system_score_gemma":0.000024671881,"threshold_uncertainty_score":0.55191493},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006309405,0.00055343454,0.9909623,0.00012556057,0.0006138991,0.00043123876,0.000015026249,0.00009349842,0.0008956327],"genre_scores_gemma":[0.9717912,0.0011422554,0.02633853,0.00007467746,0.00044438342,0.00015127886,0.000025443951,0.000021238795,0.000010958275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833226,0.000026751364,0.0010947682,0.000054068907,0.00031140356,0.00018072742],"domain_scores_gemma":[0.99842453,0.00015270986,0.000514731,0.00015015468,0.0007019474,0.000055940996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050063,0.00014948384,0.00024053939,0.00051911577,0.000033646123,0.000085216045,0.0006152593,0.00014159098,0.0000064270866],"category_scores_gemma":[0.000030758423,0.00015468823,0.000087624314,0.00017907191,0.000030254021,0.0017928317,0.000037254722,0.0004183691,0.0000027329463],"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.00011162088,0.0000171801,0.00004405513,0.000015285768,0.00004804061,0.000001115028,0.00034545807,0.9418741,0.00020153282,0.0034061973,0.0005325064,0.0534029],"study_design_scores_gemma":[0.0009245585,0.000044286717,0.000039386312,0.0004334384,0.000006370404,0.000058357204,0.0002718411,0.9739176,0.0045176325,0.00022851529,0.01938216,0.00017587056],"about_ca_topic_score_codex":0.000010807582,"about_ca_topic_score_gemma":0.000020369764,"teacher_disagreement_score":0.9654818,"about_ca_system_score_codex":0.0005933515,"about_ca_system_score_gemma":0.00004685724,"threshold_uncertainty_score":0.6308003},"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":"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.052358948,0.00019141275,0.94244456,0.00014504927,0.0041580107,0.00034034555,0.000022182714,0.00017829775,0.00016120431],"genre_scores_gemma":[0.9780314,0.00078274094,0.01835699,0.00033467184,0.002045997,0.000039465885,0.00033342122,0.00006788331,0.000007416944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752957,0.000031004707,0.0013659677,0.00013930131,0.00049264496,0.00044154242],"domain_scores_gemma":[0.9973422,0.000109293076,0.0007599387,0.00024543365,0.0013249778,0.00021814159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047198794,0.00033903585,0.00039424308,0.0003658277,0.000119161894,0.00036127862,0.0007746199,0.00030373016,0.000022273358],"category_scores_gemma":[0.000032677388,0.0003437855,0.00020637394,0.00029703404,0.0000671262,0.004909525,0.000041580104,0.0005433089,0.000005301096],"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.00020453223,0.000050289193,0.00007257038,0.000016295835,0.00018860432,0.0000040754085,0.00021955078,0.9311524,0.00012390963,0.0028500713,0.0004386055,0.06467907],"study_design_scores_gemma":[0.0027498333,0.00015540632,0.00015695585,0.00018719421,0.000033071366,0.0000941405,0.00015928916,0.993264,0.00051533687,0.00057823485,0.0017429678,0.00036354558],"about_ca_topic_score_codex":0.0000047782205,"about_ca_topic_score_gemma":0.000011984302,"teacher_disagreement_score":0.9256725,"about_ca_system_score_codex":0.0005590226,"about_ca_system_score_gemma":0.00009262174,"threshold_uncertainty_score":0.9999014},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4828905,0.00020408415,0.5161333,0.000028050117,0.00056768453,0.00008485338,0.00001627972,0.000022036504,0.000053189826],"genre_scores_gemma":[0.99858874,0.00031826377,0.0004340687,0.000010094218,0.0003680852,0.000004678126,0.0002660939,0.000008550661,0.0000014230967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982355,0.000036479392,0.0012123805,0.000067633235,0.0002993604,0.00014862054],"domain_scores_gemma":[0.9986489,0.00007275141,0.0006198903,0.00009151126,0.00052729313,0.000039647326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041197852,0.00013894739,0.00033921536,0.00045037022,0.000025055226,0.000061567356,0.00019022416,0.0001481373,0.0000063770553],"category_scores_gemma":[0.0000149765665,0.00013780908,0.00010900264,0.0006828822,0.00003821388,0.0011582602,0.000023221022,0.00026315762,1.921654e-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.00004281568,0.000022024378,0.0067619234,0.000019876494,0.00019715002,0.0000020481111,0.00015145398,0.96004504,0.000005994298,0.00054623664,0.000068488895,0.03213697],"study_design_scores_gemma":[0.0005230607,0.000013982662,0.0148479715,0.000104610335,0.00007393017,0.000018703908,0.00011489155,0.9839752,0.000023157249,0.000029482737,0.0001638912,0.00011115354],"about_ca_topic_score_codex":0.000011830503,"about_ca_topic_score_gemma":0.00008009168,"teacher_disagreement_score":0.51569927,"about_ca_system_score_codex":0.00024588712,"about_ca_system_score_gemma":0.000018383262,"threshold_uncertainty_score":0.5619691},"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":"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.13591287,0.001029564,0.85934776,0.000032455926,0.0028883086,0.00038295262,0.000009885612,0.000060243503,0.00033597468],"genre_scores_gemma":[0.99573445,0.00032459883,0.0031173613,0.00014026968,0.00052303803,0.000023628487,0.00009329968,0.000038151575,0.000005183884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973748,0.000053426444,0.0015535316,0.00010471728,0.00053095707,0.0003825878],"domain_scores_gemma":[0.99782205,0.00024410144,0.0008094438,0.0001687675,0.00083604123,0.00011959962],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000838617,0.0002597388,0.00041175875,0.00066059676,0.000045205987,0.000083233965,0.0005441067,0.00027313476,0.000035543108],"category_scores_gemma":[0.00007131468,0.00026805364,0.00026442212,0.0003457836,0.000046504258,0.0015030857,0.000036102334,0.0004684476,0.0000029674045],"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.00037305756,0.000043599433,0.00028961056,0.000031088497,0.00015247565,0.000013289254,0.00057188724,0.91697294,0.000011806883,0.00022858872,0.00019414873,0.08111754],"study_design_scores_gemma":[0.0024906741,0.000112532616,0.0013734915,0.00041668594,0.00003370585,0.000023161312,0.00009207225,0.99246365,0.00026805743,0.00016316517,0.0023153462,0.00024748032],"about_ca_topic_score_codex":0.0000038345706,"about_ca_topic_score_gemma":0.000010358084,"teacher_disagreement_score":0.8598216,"about_ca_system_score_codex":0.000291614,"about_ca_system_score_gemma":0.000058709607,"threshold_uncertainty_score":0.9999772},"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":"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.18842106,0.0003154947,0.80876744,0.00026326312,0.0018043986,0.00010306062,0.0000010140241,0.000023330793,0.0003009661],"genre_scores_gemma":[0.9971665,0.0005128892,0.0013068852,0.000520843,0.00046879565,0.0000030967992,0.00000495224,0.000007868048,0.000008162141],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973008,0.000066426466,0.0015277392,0.00013788448,0.0006581488,0.00030899592],"domain_scores_gemma":[0.99726844,0.00036597316,0.0012723184,0.00018420821,0.0007820066,0.0001270441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013863039,0.00018605776,0.00036068825,0.00045682766,0.0000455995,0.00030417487,0.0013547876,0.00016196992,0.000008375657],"category_scores_gemma":[0.00003694027,0.00017360706,0.00011122306,0.00040819336,0.00007905179,0.003363549,0.0002631939,0.00040945236,0.00000129408],"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.0001645413,0.00004856688,0.0037673002,0.000011330573,0.00008578918,0.000048384187,0.0005799563,0.3608658,0.000016616716,0.010364978,0.00011401063,0.6239327],"study_design_scores_gemma":[0.0015836667,0.00008385789,0.0048325667,0.00032773695,0.000010988484,0.00034310098,0.000120331875,0.99106663,0.00042960892,0.00034396545,0.0006469159,0.00021063186],"about_ca_topic_score_codex":0.000021226484,"about_ca_topic_score_gemma":0.00007886147,"teacher_disagreement_score":0.80874544,"about_ca_system_score_codex":0.00011026808,"about_ca_system_score_gemma":0.000082609266,"threshold_uncertainty_score":0.70794904},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039064763,0.00025365368,0.98743045,0.0024645596,0.0042145927,0.00025670318,0.0000029264227,0.000065029766,0.0014055842],"genre_scores_gemma":[0.99119127,0.0010902352,0.004176373,0.0022694063,0.0010724548,0.00002909896,0.00006391466,0.000012675002,0.000094558396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977054,0.00013316116,0.0011246568,0.00013182871,0.0006459566,0.0002589704],"domain_scores_gemma":[0.9935918,0.00023996325,0.0010356578,0.00034993823,0.0045661167,0.00021653276],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013281985,0.00019899126,0.00027852913,0.00033798753,0.00013309215,0.0013398109,0.0029251354,0.00013805047,0.000012289194],"category_scores_gemma":[0.00016401598,0.0001804972,0.00015105514,0.00044286787,0.000051800955,0.007710055,0.00028767288,0.0003712829,0.000009301362],"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.00017702901,0.00007269867,0.00057175336,0.000005581932,0.0001439905,0.000004336749,0.0007782947,0.5446261,0.000010341149,0.09608327,0.04737455,0.31015202],"study_design_scores_gemma":[0.0016441226,0.000103417224,0.0002562539,0.00010239264,0.000009644564,0.00007726735,0.000053746433,0.941845,0.00012653001,0.00028567045,0.055288978,0.0002069568],"about_ca_topic_score_codex":0.000004190586,"about_ca_topic_score_gemma":0.00001193802,"teacher_disagreement_score":0.9872848,"about_ca_system_score_codex":0.0002445181,"about_ca_system_score_gemma":0.00026904925,"threshold_uncertainty_score":0.9996969},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019510689,0.0006822306,0.9897465,0.0034295463,0.0032338065,0.0004457218,0.0000063053803,0.00007558911,0.0004291972],"genre_scores_gemma":[0.98297554,0.0004308079,0.01465404,0.0008006632,0.0008767664,0.00008782622,0.00007868607,0.000019528545,0.00007615447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641067,0.00018004741,0.0014300441,0.00016702712,0.0013014588,0.000510753],"domain_scores_gemma":[0.9948543,0.00050791947,0.0014600169,0.0005773113,0.0023885088,0.00021194709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018674623,0.00024120293,0.00035357493,0.00047511567,0.00021068336,0.00088664296,0.0034444241,0.00018788241,0.000014157963],"category_scores_gemma":[0.00008286358,0.0002265576,0.0002331187,0.0005380447,0.00006784377,0.0027761708,0.00032942,0.0005225093,0.00001754681],"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.00016589768,0.00008236058,0.00017469873,0.00001529959,0.00013695171,0.000015133691,0.00012976075,0.94559115,0.000023676937,0.013044323,0.0060927463,0.034528017],"study_design_scores_gemma":[0.001528511,0.00013102237,0.00012946562,0.00024601506,0.000008126914,0.00009675931,0.000054818134,0.9683398,0.000028918292,0.00044122353,0.028779697,0.00021563427],"about_ca_topic_score_codex":0.000008044997,"about_ca_topic_score_gemma":0.0000029843018,"teacher_disagreement_score":0.98102444,"about_ca_system_score_codex":0.0004785241,"about_ca_system_score_gemma":0.00028590206,"threshold_uncertainty_score":0.9238751},"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":"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.2242652,0.000075719,0.7712078,0.0010012385,0.0023691994,0.00008834653,0.000003406549,0.000025956542,0.0009631095],"genre_scores_gemma":[0.9986111,0.00063255435,0.00030011774,0.00021657499,0.00017746736,0.0000037508526,0.0000024693904,0.000003950113,0.000052012707],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980139,0.000088868495,0.00097206223,0.0000790981,0.00069169566,0.00015438822],"domain_scores_gemma":[0.9966611,0.0001658291,0.0013669066,0.00039325978,0.0013547692,0.000058118796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763352,0.00012184712,0.00026134148,0.00051480567,0.000121191755,0.0001679149,0.0022571874,0.00006251141,0.00002398913],"category_scores_gemma":[0.000030101957,0.00007011932,0.0002600409,0.00094991596,0.00006058025,0.0026184197,0.00039944804,0.00018113379,0.000004881259],"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.00029092506,0.00009265218,0.034503464,0.00003487143,0.0032463965,0.0000051676075,0.004185362,0.3135876,0.000917856,0.15821593,0.0014288067,0.48349097],"study_design_scores_gemma":[0.00086274947,0.000025653948,0.020575713,0.00046477377,0.000061381674,0.000033775195,0.000050200062,0.97577804,0.00037052756,0.000009220252,0.0016611404,0.00010679143],"about_ca_topic_score_codex":0.0000026367381,"about_ca_topic_score_gemma":0.000003912698,"teacher_disagreement_score":0.7743459,"about_ca_system_score_codex":0.00020982735,"about_ca_system_score_gemma":0.00007463261,"threshold_uncertainty_score":0.41944534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021669725,0.00085609907,0.97464067,0.00042660953,0.0018881306,0.00038662492,0.000021105767,0.000036067024,0.000074967036],"genre_scores_gemma":[0.9751067,0.003091353,0.021156624,0.00015923174,0.0004021627,0.00003963049,0.000020888834,0.000011874123,0.000011535848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974167,0.00009187423,0.001384817,0.0001803581,0.0006486139,0.00027765566],"domain_scores_gemma":[0.9953336,0.00054184144,0.0015417871,0.0003276959,0.002115132,0.00013996077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013003362,0.00019966252,0.00036270596,0.00021962347,0.00007748202,0.00018451238,0.0011260305,0.00018377254,0.000035226716],"category_scores_gemma":[0.000112358975,0.00015101997,0.00016644991,0.00024580694,0.00014412262,0.003694847,0.0002824841,0.00020341185,6.592044e-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.00016895827,0.000064698266,0.0011726281,0.000017513054,0.000095332456,0.0000018160724,0.0002082714,0.23122197,0.0000116373485,0.0028003748,0.0008003044,0.7634365],"study_design_scores_gemma":[0.001568133,0.00021378508,0.0013762998,0.00019373427,0.000015557696,0.00006640344,0.00005023637,0.99134165,0.00018978654,0.00052338035,0.0042900643,0.00017097156],"about_ca_topic_score_codex":0.0000014320722,"about_ca_topic_score_gemma":0.0000054403167,"teacher_disagreement_score":0.95348406,"about_ca_system_score_codex":0.00013935767,"about_ca_system_score_gemma":0.00012529387,"threshold_uncertainty_score":0.6158415},"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":"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.8300314,0.000078925266,0.14944749,0.010149145,0.0047771474,0.00036194603,0.000020438205,0.000052791755,0.005080702],"genre_scores_gemma":[0.99537927,0.000047089467,0.0029050808,0.000794997,0.00080852024,0.0000020865791,0.000029681405,0.000012208701,0.00002107093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809307,0.000024691419,0.00068452535,0.000091294874,0.000905544,0.00020090184],"domain_scores_gemma":[0.99741495,0.0001236261,0.0010210329,0.00019843529,0.0010477531,0.00019421664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003685084,0.0001680738,0.00029199864,0.0003033923,0.00017743149,0.00028408255,0.00030311864,0.00009080314,0.00006093945],"category_scores_gemma":[0.00022538136,0.00013383434,0.0001878428,0.000052113497,0.0001265608,0.000680485,0.000044442866,0.0003947517,0.000019765588],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016444279,0.0006778976,0.021702755,0.000033150936,0.00038587936,0.0009654174,0.0003595064,0.0197906,0.0002031137,0.0008416966,0.004967423,0.94842815],"study_design_scores_gemma":[0.0058462564,0.0020936776,0.10665591,0.002882615,0.00015215915,0.0013747338,0.00023095746,0.878236,0.00063710974,0.000055447657,0.0016394575,0.00019565673],"about_ca_topic_score_codex":0.000026154825,"about_ca_topic_score_gemma":0.000002119097,"teacher_disagreement_score":0.9482325,"about_ca_system_score_codex":0.00024117784,"about_ca_system_score_gemma":0.00014115861,"threshold_uncertainty_score":0.5457606},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.173679,0.00018271383,0.822789,0.00019651791,0.002482918,0.000111006055,0.0000036113618,0.000072272924,0.00048296255],"genre_scores_gemma":[0.96247816,0.0003208623,0.035798233,0.00039085708,0.0009550857,0.0000067599385,0.0000142863155,0.000022925022,0.000012829767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955662,0.0002121829,0.002124839,0.00024900862,0.0013546989,0.0004931111],"domain_scores_gemma":[0.9947707,0.00026371502,0.002107754,0.00042968048,0.0022711605,0.00015700354],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010265611,0.00032835733,0.0004987127,0.0011046398,0.0001255583,0.00019015626,0.001857955,0.00030043448,0.000016313434],"category_scores_gemma":[0.00004447347,0.00031264196,0.00023718,0.00096538826,0.00026414735,0.001713633,0.00044461907,0.0005148033,0.0000027393805],"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.0001480558,0.00017488407,0.0014788598,0.000007001016,0.00009354733,0.00002987854,0.00033485444,0.93300927,0.00019097884,0.013276818,0.00035096536,0.050904904],"study_design_scores_gemma":[0.0007267569,0.00013927087,0.00087396277,0.0005864623,0.000014112452,0.0002899238,0.000090302055,0.9933479,0.0026283613,0.000059640442,0.0009533922,0.00028991626],"about_ca_topic_score_codex":0.000087746805,"about_ca_topic_score_gemma":0.000015296073,"teacher_disagreement_score":0.78879917,"about_ca_system_score_codex":0.0005734905,"about_ca_system_score_gemma":0.0002094333,"threshold_uncertainty_score":0.9999326},"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":"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.00050827704,0.00002453667,0.9858366,0.0027953913,0.0036966645,0.0062880227,0.0000033224046,0.000089591354,0.00075758883],"genre_scores_gemma":[0.9873605,0.000013179368,0.004868088,0.002924893,0.0017394949,0.0028963108,0.000005826784,0.000012496596,0.00017923287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976411,0.00007928499,0.0011782473,0.00016054921,0.0006400442,0.0003007672],"domain_scores_gemma":[0.9969144,0.00029053164,0.0010661556,0.00019428685,0.0013009893,0.00023365102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246505,0.00020812596,0.00029158048,0.00038589732,0.00008382564,0.0005612245,0.0013844987,0.00013199136,0.000105544044],"category_scores_gemma":[0.00013231524,0.00018309677,0.0002274962,0.0002397786,0.000024339004,0.0023168414,0.00010096975,0.000303581,0.000041801697],"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.00039464992,0.000066364955,0.00018823332,0.000008524166,0.0001450294,0.000007100872,0.00045027,0.12340967,0.0000072209646,0.01368756,0.036839463,0.8247959],"study_design_scores_gemma":[0.0030100357,0.00028295952,0.00007238347,0.00020080665,0.0000111842355,0.00012271666,0.000024465104,0.8188772,0.000041162122,0.00017428453,0.17701954,0.00016322234],"about_ca_topic_score_codex":0.0000027258875,"about_ca_topic_score_gemma":0.0000024339924,"teacher_disagreement_score":0.9868522,"about_ca_system_score_codex":0.00017949505,"about_ca_system_score_gemma":0.000041528656,"threshold_uncertainty_score":0.74664694},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47286192,0.00007684517,0.52664715,0.000008602724,0.00022155758,0.000074134434,0.000009845916,0.000022346476,0.00007756825],"genre_scores_gemma":[0.9972117,0.00034444133,0.0022473827,0.00004839358,0.00003025629,0.0000055202036,0.00010029484,0.000009491153,0.0000025544275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980954,0.0001041594,0.001064848,0.00006819962,0.00055282644,0.00011455821],"domain_scores_gemma":[0.9976373,0.0001526624,0.0011527056,0.0001267293,0.00086259586,0.00006801572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005675636,0.00015002358,0.00033703248,0.0009033076,0.0000777412,0.00003648153,0.00025010356,0.0001310671,0.00008937719],"category_scores_gemma":[0.000057614536,0.0001554735,0.000136283,0.00054346654,0.000054396216,0.0011177397,0.00008461172,0.0002975345,2.6422524e-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.00013497214,0.00003721026,0.009122179,0.000020849317,0.0008434356,6.707362e-7,0.00062676833,0.9704853,0.0025691856,0.00089867046,0.000033196662,0.015227531],"study_design_scores_gemma":[0.0009206515,0.00008934666,0.012380424,0.00021317262,0.00018666105,0.000005517739,0.00027803698,0.9761304,0.009364828,0.00016089609,0.00010867599,0.00016135776],"about_ca_topic_score_codex":0.000009519192,"about_ca_topic_score_gemma":0.0000065141194,"teacher_disagreement_score":0.5243998,"about_ca_system_score_codex":0.00021560462,"about_ca_system_score_gemma":0.000040754607,"threshold_uncertainty_score":0.63400257},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008860937,0.00017864288,0.98501116,0.0027825308,0.002372607,0.0002857966,0.000020727188,0.00011885305,0.0003687276],"genre_scores_gemma":[0.9937348,0.00028291444,0.0023369521,0.0019088492,0.0015394652,0.00003193709,0.000099614925,0.000015467696,0.000050050272],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972025,0.00009416128,0.0012827025,0.00019928413,0.00077124214,0.00045007956],"domain_scores_gemma":[0.99713326,0.00037996363,0.0009261211,0.00027543277,0.0010593999,0.00022584062],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006367991,0.0002885218,0.0003939061,0.00024525306,0.00019339421,0.0009970482,0.0025810658,0.00022182793,0.00007546455],"category_scores_gemma":[0.00003042174,0.00025602413,0.00031767,0.00041610363,0.000096263284,0.003798387,0.00015335358,0.00060023845,0.0000105983145],"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.0001924682,0.000026239464,0.000070631424,0.00000392837,0.00010031963,0.000009183492,0.00010689584,0.48978588,3.857453e-7,0.0046696877,0.0031386607,0.5018957],"study_design_scores_gemma":[0.0019006617,0.00010330869,0.0004131967,0.00018394468,0.000023284487,0.00023320895,0.000038668706,0.95546395,0.000012468111,0.00066759955,0.04069748,0.00026226064],"about_ca_topic_score_codex":0.00001232836,"about_ca_topic_score_gemma":0.00001606919,"teacher_disagreement_score":0.98487383,"about_ca_system_score_codex":0.00019313917,"about_ca_system_score_gemma":0.00015921539,"threshold_uncertainty_score":0.9999892},"labels":[],"label_agreement":null}]}