{"meta":{"query_hash":"7081f37b14cf","filters":{"venue":"Telecommunication Systems"},"cohort_total":87,"direct_labels_cover":0,"predictions_cover":87,"exported":87,"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/7081f37b14cf","api":"https://metacan.xera.ac/api/v1/cohort?venue=Telecommunication+Systems"},"results":[{"id":"W135955415","doi":"10.1023/a:1023482618917","title":"Indoor Ad Hoc Proximity-Location Sensing for Service Provider Selection","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mitel (Canada); Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Service provider; Service discovery; Service (business); Computer network; Bluetooth; Selection (genetic algorithm); World Wide Web; Telecommunications; Web service; Wireless; Business; Artificial intelligence","score_opus":0.036826472432804375,"score_gpt":0.2670752308371945,"score_spread":0.2302487584043901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135955415","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.018662356,0.00492102,0.96484774,0.0052839345,0.00036913765,0.0023267204,0.0000026933656,0.0019264853,0.0016599296],"genre_scores_gemma":[0.8508617,0.00023040101,0.1480112,0.00029025713,0.000018244285,0.00037763375,0.000020952042,0.000023384457,0.00016617202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979675,0.0004986682,0.00057626644,0.0003871432,0.00023152407,0.0003388881],"domain_scores_gemma":[0.99568594,0.0003571334,0.0004603568,0.002409588,0.0010185558,0.00006845211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011388541,0.0002072969,0.00026225203,0.00023958932,0.0005957696,0.00037287653,0.0017270431,0.00021323598,0.0000012713067],"category_scores_gemma":[0.00038756628,0.00021099664,0.000056661167,0.0014341094,0.0000455613,0.001033364,0.00021395717,0.00029159558,0.000047299243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042193096,0.00040893286,0.0010258621,0.0007527125,0.00014040044,3.5436878e-7,0.0035520864,0.002025927,0.0136061385,0.6707925,0.0026038657,0.30504903],"study_design_scores_gemma":[0.00276151,0.00038030656,0.0022343786,0.0004288967,0.000051614286,0.00019314757,0.002903078,0.47539422,0.045128323,0.01701004,0.45196694,0.0015475405],"about_ca_topic_score_codex":0.00007899342,"about_ca_topic_score_gemma":0.00008352044,"teacher_disagreement_score":0.8321994,"about_ca_system_score_codex":0.00018193321,"about_ca_system_score_gemma":0.00023240897,"threshold_uncertainty_score":0.8604194},"labels":[],"label_agreement":null},{"id":"W1486673646","doi":"10.1023/a:1019199013546","title":"MMPP models for multimedia traffic","year":2000,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Computer science; Queueing theory; Poisson distribution; Algorithm; Superposition principle; Markov process; Matching (statistics); Markov chain; Probability density function; Statistics; Computer network; Mathematics; Machine learning","score_opus":0.031963002252674275,"score_gpt":0.2595972951370367,"score_spread":0.22763429288436243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486673646","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.6673067,0.004914426,0.10427697,0.0035187113,0.001024032,0.005229959,0.000037049416,0.0036706678,0.21002147],"genre_scores_gemma":[0.99428725,0.000045938577,0.0019453281,0.00032057412,0.0004367687,0.0002475793,0.00013609097,0.000037824604,0.0025426182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990479,0.00003563484,0.00037062968,0.00020316786,0.000130702,0.0002119755],"domain_scores_gemma":[0.998596,0.00016952924,0.00020368556,0.00086834846,0.0001512734,0.000011131291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063352246,0.000138157,0.00022972918,0.00014989292,0.00027047694,0.0001635624,0.0005915627,0.0000654629,0.0002387156],"category_scores_gemma":[0.00005542183,0.0001364935,0.00010294015,0.0003573386,0.00004099896,0.0010117565,0.000043378815,0.00009277593,0.0006387958],"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.000072884,0.000113549686,0.000029863757,0.00013070024,0.00007134312,3.4270352e-7,0.00018787246,0.85125726,0.00012261287,0.036536757,0.0028209565,0.10865586],"study_design_scores_gemma":[0.0003439154,0.000003147613,0.000016424789,0.000029787852,0.000043969565,8.761729e-7,0.00017234145,0.8257892,0.0000050235144,0.002928142,0.17050762,0.00015955063],"about_ca_topic_score_codex":0.00011589618,"about_ca_topic_score_gemma":0.00003364931,"teacher_disagreement_score":0.32698056,"about_ca_system_score_codex":0.000038493687,"about_ca_system_score_gemma":0.000008071578,"threshold_uncertainty_score":0.821064},"labels":[],"label_agreement":null},{"id":"W1524685153","doi":"10.1023/a:1013330625017","title":"Call Blocking Performance Study for PCS Networks under More Realistic Mobility Assumptions","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":25,"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)","funders":"","keywords":"Computer science; Call blocking; Blocking (statistics); Handover; Variance (accounting); Base station; Call Admission Control; Exponential distribution; Channel (broadcasting); Wireless network; Computer network; Wireless; Telecommunications; Statistics; Mathematics","score_opus":0.10511257464534451,"score_gpt":0.333402672051051,"score_spread":0.2282900974057065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1524685153","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.09189668,0.003490766,0.894513,0.0022722464,0.00042352412,0.004225719,0.00000894476,0.00085004204,0.0023190656],"genre_scores_gemma":[0.99207234,0.0006342984,0.004708353,0.00009002158,0.00010726255,0.0015285695,0.00003557088,0.000033790813,0.000789805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965732,0.0009996874,0.0008405587,0.0005155994,0.00052375766,0.00054719613],"domain_scores_gemma":[0.9917524,0.0012967952,0.0003508521,0.005846006,0.00059427123,0.00015966839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022473536,0.0002433659,0.0003701456,0.00019263555,0.0010099262,0.00047490792,0.0046496815,0.00014759251,0.000013780013],"category_scores_gemma":[0.000114429735,0.00024491074,0.00009468847,0.0009558762,0.00012543194,0.0005764667,0.0010059732,0.00056489033,0.000051776457],"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.000022038554,0.0025419209,0.012837246,0.00016085959,0.0002144162,0.000001300371,0.0047150636,0.90679353,0.00004810786,0.019486064,0.009446608,0.043732837],"study_design_scores_gemma":[0.0005128645,0.00011573362,0.016791457,0.000056974375,0.000012683072,0.000011121461,0.00036381464,0.9779177,0.0000038603666,0.000033438067,0.0039318744,0.00024850466],"about_ca_topic_score_codex":0.00024294932,"about_ca_topic_score_gemma":0.00011969995,"teacher_disagreement_score":0.90017563,"about_ca_system_score_codex":0.00032117643,"about_ca_system_score_gemma":0.000045511366,"threshold_uncertainty_score":0.99871707},"labels":[],"label_agreement":null},{"id":"W1529846964","doi":"10.1023/a:1016541127634","title":"Stability and Fairness of a Rate Allocation Scheme","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","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":"Nortel (Canada)","funders":"","keywords":"Computer science; Max-min fairness; Robustness (evolution); Resource allocation; Scheme (mathematics); Mathematical optimization; Distributed computing; Computer network","score_opus":0.03644284711681931,"score_gpt":0.22775897739515932,"score_spread":0.19131613027834002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529846964","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.30936047,0.009617669,0.66957283,0.0034672418,0.00034544696,0.00088093086,0.0000030672898,0.00043863605,0.006313681],"genre_scores_gemma":[0.9969436,0.00017503178,0.002656064,0.00003769077,0.000018364708,0.000049725593,0.0000021011479,0.000004135188,0.000113273636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989478,0.00033414972,0.00032228424,0.00017315519,0.00011559543,0.00010700538],"domain_scores_gemma":[0.9983661,0.00020971938,0.00018665171,0.0010139402,0.00017712876,0.00004644823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007031881,0.00007625187,0.00015803153,0.000043225697,0.00008344908,0.000066408415,0.0005943492,0.000046694888,0.000015289092],"category_scores_gemma":[0.000038990187,0.00007337255,0.00002263947,0.00024304136,0.000056578574,0.00028032088,0.0001071944,0.00008131911,0.000020238887],"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.000013424872,0.0003317609,0.005484649,0.00017410301,0.00007535232,6.0331934e-7,0.0037911693,0.00046033185,0.0055742194,0.48571056,0.00095396617,0.49742985],"study_design_scores_gemma":[0.00039023653,0.000043202457,0.0026196516,0.00003572687,0.000004616504,0.0000068731406,0.00013067744,0.99196285,0.0002618471,0.00015418397,0.004271585,0.00011853568],"about_ca_topic_score_codex":0.000046150377,"about_ca_topic_score_gemma":0.000008896573,"teacher_disagreement_score":0.9915025,"about_ca_system_score_codex":0.000022742297,"about_ca_system_score_gemma":0.000013732457,"threshold_uncertainty_score":0.29920456},"labels":[],"label_agreement":null},{"id":"W1553011432","doi":"10.1023/a:1020998515404","title":"Optimizing Frequency Hopping in GSM Cellular Phone Networks","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":5,"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 Mortgage and Housing Corporation; Concordia University","funders":"","keywords":"Computer science; Frequency-hopping spread spectrum; Quality of service; Computer network; Cellular network; Reuse; Telephony; Distributed computing; Telecommunications","score_opus":0.050869769044502626,"score_gpt":0.264719500990039,"score_spread":0.21384973194553636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553011432","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.009628567,0.046332218,0.9090042,0.002568663,0.00047762008,0.0009796812,9.73298e-7,0.00068660965,0.030321449],"genre_scores_gemma":[0.96655273,0.0033240768,0.029266987,0.00010486009,0.00008631016,0.00023065675,0.00001373716,0.000031188967,0.00038946266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963174,0.0013058032,0.0008598798,0.00043745703,0.0004614828,0.0006180167],"domain_scores_gemma":[0.9940757,0.00057045696,0.0003164723,0.0046865502,0.00020302742,0.00014774979],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0017093826,0.00022603749,0.0003633001,0.00041321595,0.00035194715,0.000478604,0.005425803,0.0001875771,0.000052584433],"category_scores_gemma":[0.00007573357,0.00024782986,0.000077131874,0.0019016493,0.00008813764,0.00090955885,0.0011365366,0.0008580231,0.00027687394],"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.000010389549,0.0010701896,0.0059126564,0.00016329323,0.00013839902,0.000048621027,0.012053617,0.6983448,0.0077907047,0.14989032,0.007964007,0.116613],"study_design_scores_gemma":[0.0003909132,0.000017602524,0.0004070072,0.00015582709,0.0000017039098,0.000014424032,0.00012980631,0.99430966,0.00007921662,0.00010108451,0.004121066,0.0002716705],"about_ca_topic_score_codex":0.0004084324,"about_ca_topic_score_gemma":0.00006985297,"teacher_disagreement_score":0.95692414,"about_ca_system_score_codex":0.000311974,"about_ca_system_score_gemma":0.00003491572,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W1574322650","doi":"10.1023/a:1016672623865","title":"Optimizing the Number of Robots for Web Search Engines","year":2001,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"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 Saskatchewan","funders":"","keywords":"Computer science; Independent and identically distributed random variables; Queueing theory; Queue; Robot; Exponential distribution; Distributed computing; Random variable; Computer network; Mathematics; Artificial intelligence; Statistics","score_opus":0.04113889129523763,"score_gpt":0.3025665715157439,"score_spread":0.2614276802205063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574322650","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.7695522,0.0027337845,0.1409624,0.005428164,0.0006878231,0.002503382,0.000008974931,0.00067864143,0.07744467],"genre_scores_gemma":[0.9968374,0.000057203197,0.0018855492,0.00011119901,0.00029756868,0.00009931411,0.000026795975,0.000023985916,0.0006610269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917877,0.000055464996,0.00033490127,0.000121331635,0.000142351,0.00016715412],"domain_scores_gemma":[0.99822396,0.00034575595,0.0002667691,0.0008371688,0.00032067354,0.0000056767117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771222,0.00009813261,0.00019480771,0.00010218276,0.00025258135,0.00010272472,0.0006730184,0.000040103037,0.000054488686],"category_scores_gemma":[0.00013417429,0.00007465574,0.000088878725,0.00054081355,0.000055079054,0.00043243685,0.00014825833,0.00009260209,0.0000884497],"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.00016102957,0.00020906932,0.015337137,0.0006321905,0.00034286693,9.692297e-7,0.00065800827,0.53587294,0.008893417,0.42552477,0.00212412,0.010243488],"study_design_scores_gemma":[0.0009336463,0.000007553063,0.00089148077,0.00022729563,0.00019244896,0.000014157175,0.0037177578,0.74606055,0.00026168482,0.0034056816,0.24386273,0.00042503784],"about_ca_topic_score_codex":0.00020096454,"about_ca_topic_score_gemma":0.000023490853,"teacher_disagreement_score":0.42211908,"about_ca_system_score_codex":0.000023687822,"about_ca_system_score_gemma":0.000010537924,"threshold_uncertainty_score":0.30443728},"labels":[],"label_agreement":null},{"id":"W1590097060","doi":"10.1023/a:1016593111704","title":"Performance Analysis of a Mobile Communication Network: Unidirectional Tandem Case with Phase Type Service","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tandem; Convergence (economics); Node (physics); Poisson distribution; Handover; Channel (broadcasting); Cellular network; Topology (electrical circuits); Applied mathematics; Mathematical optimization; Algorithm; Computer network; Mathematics; Statistics; Combinatorics; Physics","score_opus":0.023507878524684868,"score_gpt":0.25328216500280176,"score_spread":0.2297742864781169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590097060","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.85019994,0.012657615,0.12367192,0.000040249626,0.00026453528,0.0015492403,0.000047524856,0.0010244016,0.010544567],"genre_scores_gemma":[0.9927077,0.0010565395,0.0056857993,0.000008852715,0.00002893554,0.00018416,0.0001961134,0.00003912778,0.00009271348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879634,0.00013365042,0.00059149286,0.00014107638,0.00015198808,0.00018545921],"domain_scores_gemma":[0.9977685,0.00015257591,0.00027751247,0.0012812326,0.00046456003,0.000055626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035476554,0.00016626845,0.00038428188,0.0002492285,0.0001925038,0.000029327492,0.00032944244,0.00009321005,0.0000698033],"category_scores_gemma":[0.000009026494,0.00016655143,0.00004196239,0.0029417425,0.000037326,0.0003126747,0.000042043204,0.0001657862,0.00001646976],"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.00000885072,0.00007936611,0.0007647657,0.00007022166,0.0004384739,9.4512797e-7,0.0006254481,0.99622285,0.00028297017,0.00010931624,0.00012277008,0.0012740138],"study_design_scores_gemma":[0.0004395884,0.00007118886,0.00009385037,0.00008860925,0.00026409514,0.00016683972,0.00044900793,0.99564195,0.00008689396,7.4919836e-7,0.0025191926,0.00017801233],"about_ca_topic_score_codex":0.00014275816,"about_ca_topic_score_gemma":0.00030721983,"teacher_disagreement_score":0.1425078,"about_ca_system_score_codex":0.0001460403,"about_ca_system_score_gemma":0.000011036436,"threshold_uncertainty_score":0.679177},"labels":[],"label_agreement":null},{"id":"W1607625045","doi":"10.1023/a:1012290229844","title":"A Typology for Multi-Technology, Multi-Service Broadband Network Synthesis","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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","funders":"","keywords":"Computer science; Service (business); Prime (order theory); Synchronous optical networking; Notation; Computer network; Distributed computing","score_opus":0.07496590149218849,"score_gpt":0.2865175715434353,"score_spread":0.21155167005124684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607625045","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.2062524,0.03764735,0.66264546,0.034489788,0.0040058084,0.010922166,0.00007150508,0.009632765,0.034332763],"genre_scores_gemma":[0.9707209,0.00009568971,0.026220577,0.0008732066,0.0004419818,0.00076750753,0.00003217907,0.00006114757,0.00078684697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986737,0.00006681022,0.0004876949,0.00030750423,0.00009197722,0.00037235545],"domain_scores_gemma":[0.9975774,0.00030774742,0.0005224976,0.0012391508,0.00033997622,0.000013201209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214157,0.00020479945,0.00039064442,0.00031993556,0.00049466523,0.00012361827,0.00095851166,0.00019735155,0.00012027236],"category_scores_gemma":[0.00048277344,0.00020659986,0.00009651155,0.0011445986,0.00008571963,0.00045243863,0.0002532032,0.00017736935,0.0006842801],"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.00031929393,0.0024795393,0.025023615,0.002407095,0.0019085844,0.0000098782,0.0008672095,0.10614932,0.0055529703,0.73528343,0.033496205,0.086502835],"study_design_scores_gemma":[0.0007986401,0.00000562062,0.00023444106,0.000115208386,0.0001745127,0.0000059061845,0.0009232031,0.73678774,0.000036310477,0.0008026421,0.25974938,0.00036639263],"about_ca_topic_score_codex":0.0002719458,"about_ca_topic_score_gemma":0.00053965254,"teacher_disagreement_score":0.7644685,"about_ca_system_score_codex":0.000055068085,"about_ca_system_score_gemma":0.00000455334,"threshold_uncertainty_score":0.8795265},"labels":[],"label_agreement":null},{"id":"W1608751590","doi":"10.1023/a:1019140005852","title":"A discrete time-limited vacation model for the fair share scheduler","year":2000,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Polling system; Markov chain; Queue; Polling; Phase-type distribution; Computer network; Real-time computing","score_opus":0.030308378674501712,"score_gpt":0.26330166792244863,"score_spread":0.23299328924794693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608751590","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.14847304,0.005463124,0.730797,0.018957116,0.00047363364,0.008788198,0.00013087834,0.0031786286,0.08373842],"genre_scores_gemma":[0.9898811,0.00004210101,0.0008922013,0.0006284181,0.00030450994,0.0005061729,0.0003561898,0.000041766107,0.0073475474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.000044671666,0.0003752761,0.0002163632,0.0001640778,0.00020302436],"domain_scores_gemma":[0.99797684,0.00024349362,0.00028684092,0.0012485913,0.00023475943,0.000009482607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077525416,0.00015496538,0.00019328373,0.00011461156,0.00058171904,0.0002828471,0.0008512093,0.00006758508,0.0003759612],"category_scores_gemma":[0.00012220413,0.000118182055,0.00011337244,0.00047240945,0.00004556899,0.00092675444,0.00009414833,0.00012706715,0.000922095],"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.00014828893,0.00009032662,0.00018335818,0.00016715871,0.00020527653,1.3437925e-7,0.0003277331,0.9019267,0.00060864165,0.061097212,0.007275616,0.027969535],"study_design_scores_gemma":[0.0002325484,0.0000022671852,0.00010574049,0.00004224708,0.00009165102,5.829883e-7,0.00015496562,0.91887397,0.000006739859,0.0023851339,0.077953845,0.00015033103],"about_ca_topic_score_codex":0.000099545396,"about_ca_topic_score_gemma":0.000023540588,"teacher_disagreement_score":0.8414081,"about_ca_system_score_codex":0.000049881703,"about_ca_system_score_gemma":0.000012139066,"threshold_uncertainty_score":0.9998558},"labels":[],"label_agreement":null},{"id":"W1664409763","doi":"10.1007/s11235-015-0049-y","title":"Forward of special issue on “Optical Network Architectures, Systems and Applications”","year":2015,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","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":"Shared Services Canada","funders":"","keywords":"Computer science","score_opus":0.018728437088514998,"score_gpt":0.2500047834921546,"score_spread":0.23127634640363962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664409763","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06190128,0.06979173,0.40814334,0.0008762369,0.003973898,0.008820986,0.00008008191,0.006782736,0.43962973],"genre_scores_gemma":[0.9859169,0.00039213814,0.010846213,0.000012352641,0.0022969008,0.0003562911,0.000020150368,0.000046367266,0.00011269883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988496,0.00006755571,0.0004618708,0.00016225004,0.00020701613,0.0002517206],"domain_scores_gemma":[0.9984266,0.00030313205,0.00009369942,0.0009797061,0.000089840236,0.00010702333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034241684,0.0001681993,0.000342461,0.000086394066,0.00005699292,0.00003751425,0.00044683315,0.00016553058,0.0000027564245],"category_scores_gemma":[0.000066970235,0.0001583979,0.000028961047,0.0002978034,0.00014528481,0.000044338147,0.00011329781,0.00029536686,0.000053793858],"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.00002228266,0.000028643697,0.00021419571,0.00014272655,0.00004704724,5.275104e-7,0.00010152639,0.8860794,0.000043171745,0.067614056,0.008394153,0.03731229],"study_design_scores_gemma":[0.0005885492,0.0001892695,0.00030515587,0.00022856113,0.000029884855,0.000038731654,0.0007541746,0.11744211,0.00013725161,0.0031449792,0.8767079,0.00043339562],"about_ca_topic_score_codex":0.000010712177,"about_ca_topic_score_gemma":0.0000060699267,"teacher_disagreement_score":0.9240156,"about_ca_system_score_codex":0.00008978971,"about_ca_system_score_gemma":0.000012184131,"threshold_uncertainty_score":0.6459279},"labels":[],"label_agreement":null},{"id":"W1875833779","doi":"10.1007/s11235-011-9646-6","title":"Advances in security and multimodality for pervasive computing environments","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Access Control and Trust","field":"Social Sciences","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 Guelph","funders":"","keywords":"Computer science; Multimodality; Ubiquitous computing; Computer security; Data science; Human–computer interaction; World Wide Web","score_opus":0.04879315626411868,"score_gpt":0.32980059878870394,"score_spread":0.28100744252458526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1875833779","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.879879,0.016142564,0.00860073,0.00043539813,0.0003590639,0.0026564943,0.000021152418,0.00011943754,0.09178614],"genre_scores_gemma":[0.99799585,0.0012551534,0.0005852426,0.000021669923,0.00003768947,0.00006306219,0.0000051367647,0.000004606402,0.000031582895],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9991001,0.00031477457,0.00021087208,0.00012643066,0.000095131734,0.00015268444],"domain_scores_gemma":[0.9993444,0.00022866292,0.0001396323,0.0002183118,0.000025954003,0.00004304125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931782,0.000058616173,0.00013502788,0.000031693533,0.00032489374,0.00003145788,0.00027647658,0.000056252116,0.00000840952],"category_scores_gemma":[0.000091542344,0.000058477694,0.00002032373,0.00006572014,0.00012781152,0.00032585202,0.000059042985,0.00007188195,0.000004562113],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068987036,0.00032016047,0.6333312,0.00011953828,0.000026466178,6.367765e-7,0.17543426,0.000057644218,0.00004133396,0.09063897,0.000020421088,0.09994036],"study_design_scores_gemma":[0.0042225407,0.00013246947,0.6045288,0.00025032504,0.00004306874,0.000002623354,0.123627275,0.029308375,0.00008670829,0.014144149,0.22279303,0.0008606705],"about_ca_topic_score_codex":0.0052675563,"about_ca_topic_score_gemma":0.0022653483,"teacher_disagreement_score":0.22277261,"about_ca_system_score_codex":0.000055482695,"about_ca_system_score_gemma":0.000017747338,"threshold_uncertainty_score":0.7963005},"labels":[],"label_agreement":null},{"id":"W189013490","doi":"10.1023/a:1023434702987","title":"Estimating Hop Counts in Position Based Routing Schemes for Ad Hoc Networks","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Indoor and Outdoor Localization Technologies","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 Ottawa","funders":"","keywords":"Computer science; Scalability; Hop (telecommunications); Node (physics); Computer network; Wireless ad hoc network; Compass; Greedy algorithm; Routing (electronic design automation); Global Positioning System; Algorithm; Telecommunications; Wireless","score_opus":0.015835638832868083,"score_gpt":0.24578064244265807,"score_spread":0.22994500360978998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W189013490","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.007279091,0.0040578227,0.9816628,0.000029421795,0.00036465362,0.00040200903,0.0000037351572,0.00064505596,0.0055554016],"genre_scores_gemma":[0.9841659,0.000060737668,0.015534361,0.000020116051,0.000016340597,0.00010826857,0.000045398647,0.000020662801,0.000028206923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994646,0.000040641593,0.00023434995,0.0000708687,0.00005408868,0.0001355033],"domain_scores_gemma":[0.99950415,0.000093841554,0.0000505539,0.00029194186,0.00004735678,0.000012183819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030123245,0.000075693584,0.00010764332,0.0000825865,0.00006982992,0.000038482143,0.00014200894,0.000097615106,0.000008161948],"category_scores_gemma":[0.00009113671,0.000083159546,0.000021727492,0.00019116909,0.00001253944,0.00006624371,0.000008174726,0.00010172322,0.000012804098],"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.0000050721924,0.000026109356,0.0012673261,0.00019596626,0.000019753064,4.0053604e-7,0.00017943916,0.9547175,0.00041941163,0.016181188,0.0014425064,0.025545307],"study_design_scores_gemma":[0.00022270862,0.0000072792523,0.00004901163,0.000095353906,0.0000031842847,0.0000016530533,0.00012587219,0.98385376,0.00063388824,0.000056735505,0.014852239,0.00009830041],"about_ca_topic_score_codex":0.0000024942192,"about_ca_topic_score_gemma":0.000004064655,"teacher_disagreement_score":0.9768868,"about_ca_system_score_codex":0.000098779834,"about_ca_system_score_gemma":0.000011790147,"threshold_uncertainty_score":0.33911481},"labels":[],"label_agreement":null},{"id":"W1967725483","doi":"10.1007/s11235-008-9132-y","title":"Privacy within pervasive communications","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":5,"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 Ottawa","funders":"","keywords":"Computer science; Eavesdropping; Computer network; Computer security; Encryption; Routing protocol; Link-state routing protocol; Dynamic Source Routing; Zone Routing Protocol; Policy-based routing; Network packet; Geographic routing","score_opus":0.05488458193807471,"score_gpt":0.2782180728036282,"score_spread":0.22333349086555349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967725483","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.10452863,0.004824684,0.86696076,0.0033482094,0.00057047146,0.00067619584,0.0000037115892,0.0010344824,0.018052869],"genre_scores_gemma":[0.97425056,0.00029154215,0.024324946,0.00017110539,0.000046638717,0.00006285738,0.000024979521,0.000013683284,0.00081371865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980622,0.0004921656,0.00064499496,0.00027650702,0.00029787052,0.00022627207],"domain_scores_gemma":[0.995856,0.00025076835,0.00038588862,0.0031069873,0.00031304933,0.00008732925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006979488,0.00015617644,0.00027070564,0.00014188858,0.0006531379,0.000160758,0.0052363686,0.00008113436,0.000009628238],"category_scores_gemma":[0.000090670124,0.00014605415,0.00011595781,0.00052365585,0.00013241042,0.0004795906,0.00093658257,0.0003184814,0.00031091436],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019995346,0.00016185809,0.00070459803,0.0000145186405,0.00009445217,0.0000042280562,0.018908354,0.0040267594,0.00011138167,0.97198623,0.002801421,0.0011841721],"study_design_scores_gemma":[0.00020649172,0.000032134336,0.00076647545,0.00004761539,0.0000102233,0.00017498004,0.0005376715,0.965731,0.000056408568,0.000021287186,0.03217672,0.00023897008],"about_ca_topic_score_codex":0.0001237557,"about_ca_topic_score_gemma":0.00004425166,"teacher_disagreement_score":0.97196496,"about_ca_system_score_codex":0.00009133452,"about_ca_system_score_gemma":0.00010374555,"threshold_uncertainty_score":0.9730563},"labels":[],"label_agreement":null},{"id":"W1969700711","doi":"10.1007/s11235-008-9101-5","title":"Grid job scheduling using Route with Genetic Algorithm support","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Distributed and Parallel Computing Systems","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":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Genetic algorithm; Grid; Scheduling (production processes); Distributed computing; Algorithm; Mathematical optimization; Machine learning","score_opus":0.042155660598263915,"score_gpt":0.25884430792951163,"score_spread":0.2166886473312477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969700711","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.07511117,0.0008938618,0.92076147,0.00008166845,0.00057570275,0.00034711623,0.000009397504,0.0004345134,0.0017850877],"genre_scores_gemma":[0.7702487,0.000043736138,0.22917153,0.000046687364,0.00019449677,0.000023684583,0.000030421605,0.000020166764,0.00022054433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977843,0.0003514859,0.00060474855,0.00040893056,0.00044184367,0.00040868943],"domain_scores_gemma":[0.99710107,0.00010172044,0.00037946206,0.0020004862,0.00027406198,0.00014320888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053504645,0.00023287538,0.00035344908,0.00014070347,0.0005729841,0.0002569319,0.0020147602,0.0000965175,0.0000043548057],"category_scores_gemma":[0.000013010065,0.00020959212,0.00006783,0.00067117,0.00007484759,0.000395305,0.00030946577,0.0002380655,0.00011981604],"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.00002727142,0.00048292187,0.07070435,0.00030333982,0.0005229905,0.00032514302,0.009422169,0.8744719,0.0010422682,0.008809945,0.0042228173,0.029664867],"study_design_scores_gemma":[0.00054484815,0.000109369146,0.00752418,0.00014366316,0.000012402701,0.0025383162,0.00010782416,0.96872175,0.000046572084,0.00001724561,0.019794581,0.00043924738],"about_ca_topic_score_codex":0.00059256546,"about_ca_topic_score_gemma":0.0000053649615,"teacher_disagreement_score":0.69513756,"about_ca_system_score_codex":0.00013441943,"about_ca_system_score_gemma":0.00027556816,"threshold_uncertainty_score":0.85469186},"labels":[],"label_agreement":null},{"id":"W1969840971","doi":"10.1007/s11235-011-9536-y","title":"Special issue on wireless multimedia networks and security services","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"E-commerce and Technology Innovations","field":"Business, Management and Accounting","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 Ottawa","funders":"","keywords":"Computer science; Multimedia; Wireless; Wireless network; Telecommunications; Computer security; Computer network","score_opus":0.02506627903067232,"score_gpt":0.2366425069781398,"score_spread":0.21157622794746747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969840971","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.63303185,0.00033874894,0.00014057032,0.002080569,0.0015900319,0.0008001754,0.000004427975,0.0007314997,0.36128217],"genre_scores_gemma":[0.9942641,0.00007400603,0.00008662113,0.0009182006,0.0043722424,0.00005653179,0.00007158146,0.00001971138,0.00013697268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992143,0.000024082556,0.00030505264,0.00017850925,0.000100137004,0.00017791433],"domain_scores_gemma":[0.998839,0.000048530044,0.00026181695,0.00069695164,0.00014451673,0.000009158775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032358995,0.00013840625,0.00018233174,0.00021628905,0.00027580158,0.00011950009,0.0005183988,0.00015718705,0.00017244101],"category_scores_gemma":[0.000012506062,0.00013364026,0.000023524399,0.00042859875,0.00011390533,0.00046851434,0.00022521883,0.000264998,0.00041707043],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116814714,0.0008980974,0.23751988,0.00065282744,0.00022401511,0.000008275676,0.0030691554,0.000056832632,0.0000985718,0.57356423,0.07669169,0.10709962],"study_design_scores_gemma":[0.0010376036,0.000035095338,0.056831334,0.00027139398,0.00006973899,0.000008423802,0.0048069065,0.047243524,0.000057159796,0.001939841,0.88708067,0.00061829103],"about_ca_topic_score_codex":0.0021022647,"about_ca_topic_score_gemma":0.0005540044,"teacher_disagreement_score":0.810389,"about_ca_system_score_codex":0.000015552221,"about_ca_system_score_gemma":0.000004187051,"threshold_uncertainty_score":0.54496914},"labels":[],"label_agreement":null},{"id":"W1971063377","doi":"10.1007/s11235-014-9939-7","title":"A hybrid approach for cost-effective media streaming based on prediction of demand in community networks","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"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; Community network; The Internet; Computer network; Content delivery network; Server; World Wide Web","score_opus":0.0302040441044305,"score_gpt":0.24506371259843354,"score_spread":0.21485966849400304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971063377","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.05610498,0.0001479285,0.9410849,0.00003072924,0.0001526127,0.0013883873,0.000012182423,0.00009726926,0.0009810176],"genre_scores_gemma":[0.9965814,0.0000107353935,0.0023902012,0.000053278032,0.00003759445,0.00079429155,0.00011718447,0.0000096502445,0.0000056755807],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751174,0.0016207239,0.00037388323,0.00017099155,0.00016170595,0.00016098039],"domain_scores_gemma":[0.99598217,0.002233104,0.00024466307,0.0013666527,0.00013094825,0.00004246232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002857208,0.000115407114,0.00025922302,0.00017360644,0.00018332504,0.0000596027,0.0009435202,0.000063669766,1.8201706e-7],"category_scores_gemma":[0.00021138917,0.00011264218,0.000063047395,0.0001987017,0.00003613881,0.00016061631,0.00011129994,0.0003277446,7.269522e-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.00013747707,0.0010122752,0.009991726,0.0002879495,0.00004974009,2.2925906e-7,0.0019966797,0.8499938,0.000618509,0.009769602,0.00035180568,0.12579021],"study_design_scores_gemma":[0.0008445375,0.0001658171,0.0074430476,0.00015478385,0.0000063802368,0.000002210271,0.0001311674,0.99083793,0.0000998745,0.000055977915,0.00017461544,0.000083630584],"about_ca_topic_score_codex":0.00054430246,"about_ca_topic_score_gemma":0.000034129505,"teacher_disagreement_score":0.9404764,"about_ca_system_score_codex":0.000103535116,"about_ca_system_score_gemma":0.000021024449,"threshold_uncertainty_score":0.45934147},"labels":[],"label_agreement":null},{"id":"W1979114316","doi":"10.1007/s11235-009-9171-z","title":"Cross-layer resource allocation for real-time services in OFDM-based cognitive radio systems","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":23,"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; PHY; Quality of service; Physical layer; Orthogonal frequency-division multiplexing; Computer network; Cognitive radio; Network packet; Resource allocation; Telecommunications link; Throughput; Transmitter power output; Wireless; Channel (broadcasting); Transmitter; Telecommunications","score_opus":0.01425218832265736,"score_gpt":0.2697380619960559,"score_spread":0.25548587367339853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979114316","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.43770662,0.010166441,0.5231794,0.00031108686,0.00070015294,0.008373987,0.00013515957,0.0034547048,0.015972419],"genre_scores_gemma":[0.99565357,0.00024608622,0.0022044678,0.000035078083,0.00012845558,0.0005052955,0.00091732596,0.00007053723,0.00023918194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982732,0.00020165171,0.0007334781,0.00026290186,0.00019580855,0.0003329471],"domain_scores_gemma":[0.9982612,0.00042364324,0.00024005244,0.0007513123,0.0002540678,0.00006968972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006032985,0.00024328101,0.00037229407,0.00022381562,0.0001374946,0.0001595373,0.00043693438,0.00020214755,0.0000052747487],"category_scores_gemma":[0.00002948273,0.00028033042,0.000052451207,0.0004949921,0.00002962013,0.0003707846,0.000017599194,0.00017044651,0.000036321628],"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.000051457566,0.000041412717,0.00037027473,0.00021292618,0.000018004606,3.4836557e-7,0.0003368622,0.99453026,0.0023716425,0.00031619027,0.00013596134,0.001614649],"study_design_scores_gemma":[0.0011223536,0.000052072977,0.0025467118,0.00056257413,0.000015323474,0.0000036277474,0.00028437603,0.9917897,0.0005582095,0.00001375163,0.0027602108,0.0002910709],"about_ca_topic_score_codex":0.00009504677,"about_ca_topic_score_gemma":0.000021227517,"teacher_disagreement_score":0.5579469,"about_ca_system_score_codex":0.00032161604,"about_ca_system_score_gemma":0.000026610676,"threshold_uncertainty_score":0.9999649},"labels":[],"label_agreement":null},{"id":"W1985786677","doi":"10.1007/s11235-009-9231-4","title":"Requirements for enforcing digital rights management in multicast content distribution","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Digital Rights Management and Security","field":"Computer Science","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":"Concordia University","funders":"","keywords":"Multicast; Computer science; Unicast; IP multicast; Pragmatic General Multicast; Protocol Independent Multicast; Computer network; Xcast; Source-specific multicast; Multicast address; The Internet; Distributed computing; Computer security; World Wide Web","score_opus":0.06297148114170335,"score_gpt":0.2896429582849583,"score_spread":0.22667147714325492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985786677","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.038965397,0.00027957643,0.8793623,0.0010451324,0.0004786089,0.0032236553,0.000030657706,0.00044464448,0.07617004],"genre_scores_gemma":[0.99690604,0.000016114116,0.0018285023,0.000050787512,0.000018928617,0.00009733469,0.00019487947,0.0000040917985,0.0008833016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99867445,0.000043324453,0.000489164,0.00027457188,0.0002390242,0.00027944872],"domain_scores_gemma":[0.99870163,0.00006143346,0.00016583873,0.00092875125,0.00008548968,0.00005684241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039676338,0.00013766669,0.00017749172,0.000114808325,0.00015299204,0.00068622595,0.0011290743,0.000039057424,7.7631154e-7],"category_scores_gemma":[0.000015935904,0.00011952857,0.000060850456,0.00027129604,0.000019646413,0.0015682444,0.00018230999,0.00006513592,0.00003352937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001540776,0.00027189156,0.000120777804,0.000032499425,0.000026414853,0.0000029947603,0.00028028263,0.00009296246,0.000022788481,0.94740623,0.0006587682,0.05106896],"study_design_scores_gemma":[0.0059694867,0.0005529812,0.025637995,0.0005650053,0.000034266603,0.000011324184,0.0005309815,0.40480933,0.00042527055,0.06291923,0.49726436,0.0012797957],"about_ca_topic_score_codex":0.000032637126,"about_ca_topic_score_gemma":0.000011841628,"teacher_disagreement_score":0.95794064,"about_ca_system_score_codex":0.00018082134,"about_ca_system_score_gemma":0.0000066745674,"threshold_uncertainty_score":0.6617293},"labels":[],"label_agreement":null},{"id":"W1986033668","doi":"10.1007/s11235-009-9227-0","title":"TPGF: geographic routing in wireless multimedia sensor networks","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":172,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer science; Equal-cost multi-path routing; Multipath routing; Computer network; Geographic routing; Static routing; Shortest path problem; Link-state routing protocol; Routing (electronic design automation); Policy-based routing; Dynamic Source Routing; Greedy algorithm; Distributed computing; Routing protocol; Algorithm; Theoretical computer science","score_opus":0.014037885730958476,"score_gpt":0.23997533759176318,"score_spread":0.2259374518608047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986033668","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.29891866,0.0024952178,0.68743,0.0014212866,0.0011707561,0.0009394724,0.0000013168743,0.0013577543,0.006265494],"genre_scores_gemma":[0.98653585,0.00030247934,0.012601232,0.00025147237,0.00013332661,0.000035954487,0.000021789865,0.000020748428,0.00009713404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698865,0.00067948195,0.00080878695,0.00051395997,0.0003680764,0.0006410512],"domain_scores_gemma":[0.99653506,0.00044775652,0.00037986378,0.0023514354,0.00015021909,0.00013567728],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001190846,0.00026894562,0.0004040842,0.00036378918,0.00022786397,0.00029457104,0.002336328,0.00023080518,0.0000023737284],"category_scores_gemma":[0.00004230183,0.00027890963,0.00009533467,0.0015173326,0.000059356138,0.0003960935,0.00023941592,0.0005682928,0.000032677985],"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.000010863286,0.00030661118,0.012591638,0.000012306755,0.000022572562,0.000019198294,0.0008980723,0.8732754,0.0006744936,0.04464371,0.00018215556,0.06736298],"study_design_scores_gemma":[0.00043236546,0.00003774378,0.019356934,0.00014873756,0.0000031877091,0.000024677885,0.00008646538,0.97904265,0.000055175242,0.000022133268,0.0004855939,0.0003043088],"about_ca_topic_score_codex":0.0003265166,"about_ca_topic_score_gemma":0.00007635717,"teacher_disagreement_score":0.6876172,"about_ca_system_score_codex":0.00012687195,"about_ca_system_score_gemma":0.000033976838,"threshold_uncertainty_score":0.9999663},"labels":[],"label_agreement":null},{"id":"W1986263636","doi":"10.1007/s11235-010-9410-3","title":"Adaptive pulse-shaped OFDM with application to in-home power line communications","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Guard interval; Computer science; Orthogonal frequency-division multiplexing; Overhead (engineering); Guard (computer science); Power-line communication; Narrowband; Wideband; Electronic engineering; Channel (broadcasting); Telecommunications; Power (physics); Physics","score_opus":0.03875840730126047,"score_gpt":0.2516759414928734,"score_spread":0.21291753419161297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986263636","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.28869504,0.02374804,0.34604612,0.0018840065,0.0006017415,0.009139319,0.00019324661,0.0041057854,0.3255867],"genre_scores_gemma":[0.9806957,0.00061843725,0.016980523,0.000073280455,0.000018498176,0.0013397587,0.00010215298,0.00007996146,0.000091685375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829614,0.00022692366,0.00070960517,0.0002457687,0.00018764504,0.0003339308],"domain_scores_gemma":[0.994178,0.0001628515,0.00013953011,0.0051185484,0.00024012302,0.00016095086],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005381812,0.0002693991,0.00035553554,0.00041477196,0.00016842452,0.00004661679,0.0023126872,0.00012970413,0.00004445938],"category_scores_gemma":[0.000021569784,0.00026609332,0.00004869215,0.0011442988,0.000096391785,0.00029810032,0.00034756807,0.00044534894,0.00034236303],"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.0023335947,0.012429552,0.08688332,0.0010018899,0.0027030075,0.000027659959,0.14455494,0.117387846,0.08168662,0.3859582,0.011319133,0.15371424],"study_design_scores_gemma":[0.0046121245,0.0014171986,0.17099512,0.0011547197,0.00016068907,0.000119637254,0.009201702,0.64836746,0.0021166562,0.0013220675,0.15669023,0.003842418],"about_ca_topic_score_codex":0.0007850453,"about_ca_topic_score_gemma":0.0012322813,"teacher_disagreement_score":0.6920007,"about_ca_system_score_codex":0.00021971783,"about_ca_system_score_gemma":0.00003861557,"threshold_uncertainty_score":0.99997914},"labels":[],"label_agreement":null},{"id":"W1986977526","doi":"10.1007/s11235-008-9067-3","title":"Using interval phase margin assignment to self-tune a PI AQM controller for TCP traffic","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"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 Ottawa","funders":"","keywords":"Active queue management; PID controller; Phase margin; Computer science; Control theory (sociology); Controller (irrigation); Router; Transmission Control Protocol; Queue; Network packet; Network congestion; Real-time computing; Computer network; Amplifier; Control engineering; Control (management); Bandwidth (computing); Engineering; Operational amplifier","score_opus":0.05239183572412472,"score_gpt":0.3348011836580148,"score_spread":0.2824093479338901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986977526","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.023345208,0.0008462667,0.97125405,0.001151269,0.00064435106,0.0018017358,0.0000052137416,0.00046628338,0.00048563018],"genre_scores_gemma":[0.9517534,0.000013377533,0.046936456,0.00046965826,0.00022541889,0.00026355265,0.000007723877,0.00002275337,0.00030765796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779356,0.00026280712,0.00076562725,0.00039157542,0.00030512272,0.0004812943],"domain_scores_gemma":[0.9975397,0.00056301506,0.0002983453,0.0011148469,0.0002545389,0.00022953878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023389312,0.00021929907,0.00040285988,0.00019568448,0.00028256275,0.0002610153,0.0014314511,0.000104936415,0.0000067198885],"category_scores_gemma":[0.00004343201,0.00021272684,0.00013551417,0.00041860796,0.000023012595,0.00026043615,0.00016381807,0.0001621066,0.000054318865],"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.00036924332,0.0010725389,0.000039942963,0.00007144378,0.0002854902,0.000005176544,0.0029848854,0.039296202,0.003185506,0.033083957,0.0059649665,0.9136406],"study_design_scores_gemma":[0.0036647706,0.00025262154,0.000035716817,0.000081650905,0.000028131799,0.000024007506,0.00022343324,0.90283567,0.00008337482,0.000024348154,0.09248047,0.00026582478],"about_ca_topic_score_codex":0.000020974643,"about_ca_topic_score_gemma":0.000022090377,"teacher_disagreement_score":0.9284082,"about_ca_system_score_codex":0.00028240943,"about_ca_system_score_gemma":0.000086891174,"threshold_uncertainty_score":0.86747485},"labels":[],"label_agreement":null},{"id":"W1994692987","doi":"10.1007/s11235-005-4324-1","title":"Efficient Radio Resource Management in Integrated WLAN/CDMA Mobile Networks","year":2005,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":9,"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; Radio resource management; Code division multiple access; Telecommunications; Remote radio head; Cognitive radio; Wireless; Wireless network","score_opus":0.02007660434439112,"score_gpt":0.280660829037119,"score_spread":0.26058422469272785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994692987","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.037789952,0.021186994,0.8827342,0.0030068443,0.00036753932,0.0040654317,0.000003555162,0.001307009,0.049538516],"genre_scores_gemma":[0.9832722,0.00076134875,0.013782856,0.0001212108,0.00007688701,0.0008921949,0.000042842694,0.000030330839,0.0010201348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603945,0.0014499533,0.0008891577,0.0004830218,0.00054846663,0.00058997574],"domain_scores_gemma":[0.9940056,0.00043852304,0.0002712033,0.0049711564,0.00016376922,0.00014974864],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0024681587,0.0002413536,0.00034231422,0.0004898323,0.0002662595,0.00038118177,0.0056221117,0.0001510886,0.000018350836],"category_scores_gemma":[0.000021717586,0.0002383068,0.00007472056,0.0020162037,0.00009242546,0.00021124935,0.0015115647,0.0007205296,0.00022137116],"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.000010764954,0.00023575095,0.00022117808,0.000017205592,0.00002953743,0.0000029395255,0.0005973542,0.8962832,0.000021700956,0.019672358,0.0021275966,0.08078038],"study_design_scores_gemma":[0.00047744004,0.000023797189,0.0009954338,0.00010765563,0.0000024783844,0.000014359367,0.00035919002,0.8411589,0.000009461981,0.000009078273,0.15663734,0.00020482372],"about_ca_topic_score_codex":0.0001824124,"about_ca_topic_score_gemma":0.00009197659,"teacher_disagreement_score":0.94548225,"about_ca_system_score_codex":0.0006443778,"about_ca_system_score_gemma":0.00005500536,"threshold_uncertainty_score":0.99975795},"labels":[],"label_agreement":null},{"id":"W1995404435","doi":"10.1007/s11235-011-9644-8","title":"Lightpath scheduling and routing for green data centres","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Cloud Computing and Resource Management","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":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Schedule; Renewable energy; Scheduling (production processes); Energy consumption; Green computing; Energy (signal processing); Distributed computing; Computer network; Cloud computing; Operations management; Operating system","score_opus":0.10049306773293076,"score_gpt":0.27804953779779007,"score_spread":0.1775564700648593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995404435","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.20467746,0.0049665603,0.77412754,0.0016945293,0.0006110058,0.0012597304,0.000010031502,0.0008718552,0.011781262],"genre_scores_gemma":[0.94322264,0.000015837959,0.056328505,0.00004693466,0.000069781185,0.000017027613,0.000008121657,0.000008864413,0.00028230555],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898654,0.00011902113,0.00027475096,0.00031575543,0.000111790476,0.00019211303],"domain_scores_gemma":[0.9973144,0.0001375233,0.00017477486,0.0022606943,0.00005958729,0.000053014162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009620657,0.00009430694,0.00013456817,0.000063810716,0.00028365216,0.00013260603,0.002403349,0.000036512425,7.7089413e-7],"category_scores_gemma":[0.000041833315,0.00008445601,0.000020380092,0.00014107715,0.00002305491,0.000050931736,0.0018232381,0.000078148274,0.000008914373],"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.000028765216,0.0004213969,0.01355514,0.00060518784,0.0003384907,0.0000053237704,0.031339772,0.00268468,0.0003831644,0.46814626,0.0018954634,0.48059633],"study_design_scores_gemma":[0.0002367694,0.000028956818,0.0014741897,0.0000875047,0.0000098068585,0.000009192041,0.00046516128,0.98197633,0.000043227446,0.00027345287,0.015250913,0.00014449874],"about_ca_topic_score_codex":0.0006438763,"about_ca_topic_score_gemma":0.000017936924,"teacher_disagreement_score":0.9792916,"about_ca_system_score_codex":0.00001855255,"about_ca_system_score_gemma":0.000014567671,"threshold_uncertainty_score":0.44660604},"labels":[],"label_agreement":null},{"id":"W1998365594","doi":"10.1007/s11235-007-9036-2","title":"Traffic analysis of heterogeneous mobile cellular networks using “wrap-up” cell structure","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"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 Manitoba; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Handover; Base station; Heterogeneous network; Blocking (statistics); Cellular network; Homogeneous; Cluster (spacecraft); Base (topology); Call blocking; Computer network; Boundary (topology); Algorithm; Telecommunications; Wireless network; Mathematics","score_opus":0.027046420497914433,"score_gpt":0.29403849984749963,"score_spread":0.2669920793495852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998365594","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.5032473,0.0071567683,0.48856378,0.00001491043,0.00020264849,0.0004756552,0.0000060278558,0.0001410739,0.00019180634],"genre_scores_gemma":[0.99042565,0.000321796,0.008954157,0.000021935188,0.000052991356,0.000026812466,0.00008498522,0.00002963797,0.00008202498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996408,0.00086664956,0.0011198029,0.00042917652,0.00062888325,0.00054748845],"domain_scores_gemma":[0.99264914,0.00068250136,0.0007411453,0.005245643,0.0005033907,0.00017816597],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019479928,0.00024865277,0.0006111516,0.0008789473,0.00031979877,0.00020366613,0.004754646,0.00024885524,0.000026695576],"category_scores_gemma":[0.000017752132,0.00025411957,0.0002461669,0.004345578,0.00013382136,0.00030970553,0.00085651095,0.0004980921,0.000006465188],"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.000008571289,0.00008469222,0.00036442216,0.000025659818,0.00024720517,0.0000016261478,0.0007139681,0.98583215,0.0050424472,0.00040438166,0.000036498997,0.0072383545],"study_design_scores_gemma":[0.00022425118,0.0000413032,0.0003333192,0.00002490739,0.0000925418,0.00000895386,0.00017974181,0.9945218,0.0030511268,0.000004945451,0.0012847369,0.00023237574],"about_ca_topic_score_codex":0.00018024846,"about_ca_topic_score_gemma":0.00013832348,"teacher_disagreement_score":0.48717833,"about_ca_system_score_codex":0.00020753166,"about_ca_system_score_gemma":0.00009021915,"threshold_uncertainty_score":0.9999911},"labels":[],"label_agreement":null},{"id":"W2000653449","doi":"10.1007/s11235-009-9277-3","title":"Survivability and reliability of a composite-star transport network with disconnected core switches","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Survivability; Computer science; Dimensioning; Network topology; Reliability (semiconductor); Computer network; Node (physics); Star network; Core (optical fiber); Path protection; Distributed computing; Topology (electrical circuits); Wavelength-division multiplexing; Telecommunications; Ring network; Engineering","score_opus":0.01218598253207773,"score_gpt":0.2221237896788715,"score_spread":0.20993780714679378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000653449","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.9903571,0.00040476865,0.0074821063,0.000057478563,0.000091568894,0.00043207244,0.000011107225,0.00066291884,0.00050085434],"genre_scores_gemma":[0.9764425,0.00009395376,0.023326585,0.0000023078087,0.000020547568,0.000055691915,0.000027396334,0.000025226722,0.0000057683746],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99906355,0.00003537578,0.00041225142,0.00017354092,0.000113900904,0.00020138695],"domain_scores_gemma":[0.99809086,0.00039426927,0.000088320296,0.0012651503,0.00010963436,0.000051764757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039215412,0.00015650029,0.0003484276,0.000030857576,0.00007051918,0.00001057915,0.00035900928,0.00014380277,0.0000044671783],"category_scores_gemma":[0.000053384058,0.00012850718,0.000026462641,0.00030382077,0.00031238486,0.00012089322,0.000048549464,0.00044054998,0.0000012258192],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119474986,0.00013738197,0.69079167,0.00070712744,0.00008938229,0.0000010185731,0.0005484407,0.27371624,0.02501927,0.007127071,0.000060339473,0.0016826129],"study_design_scores_gemma":[0.0009334361,0.00019964488,0.78979737,0.00029085128,0.0000734737,0.000028117161,0.0007953196,0.20070519,0.0014996587,0.00262835,0.002274328,0.0007742661],"about_ca_topic_score_codex":0.000078460165,"about_ca_topic_score_gemma":0.00068281713,"teacher_disagreement_score":0.09900571,"about_ca_system_score_codex":0.000025383866,"about_ca_system_score_gemma":0.0000102198255,"threshold_uncertainty_score":0.52403706},"labels":[],"label_agreement":null},{"id":"W2005100786","doi":"10.1007/s11235-011-9490-8","title":"A self-optimized random access protocol for an infrastructure-less mission critical wireless networking system","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","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":"University of Ottawa","funders":"","keywords":"Retransmission; Computer science; Computer network; Throughput; Node (physics); Network packet; Wireless network; Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.08347031809098576,"score_gpt":0.34575105494359165,"score_spread":0.2622807368526059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005100786","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.00029081694,0.000075667005,0.88823074,0.00004814612,0.00074270787,0.105168305,0.0000026231553,0.0012786739,0.004162319],"genre_scores_gemma":[0.63066936,0.0000064250926,0.110926114,0.00006257481,0.00042720567,0.25781173,0.0000144859905,0.000060310707,0.000021816115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995858,0.0013699234,0.0010849086,0.00067153695,0.00040291165,0.00061268423],"domain_scores_gemma":[0.99466234,0.0007469661,0.00058994803,0.0031825085,0.00051670935,0.00030152113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001963832,0.00035887535,0.0006527593,0.00014875099,0.0006011069,0.00084479887,0.005139691,0.00029339685,0.000006933794],"category_scores_gemma":[0.00004453746,0.00031509082,0.00013734418,0.0005327699,0.000073913274,0.0015237483,0.0008041609,0.00035861746,0.000010009057],"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.005101355,0.0033319897,0.004141932,0.01288562,0.00079456146,0.000037385373,0.024426088,0.04065545,0.0007303118,0.6943649,0.018211426,0.195319],"study_design_scores_gemma":[0.003917392,0.00016070162,0.0001313919,0.000577075,0.00002281459,0.00006915749,0.00024260957,0.9815577,0.00017977906,0.00032294533,0.012399611,0.00041881937],"about_ca_topic_score_codex":0.00012825071,"about_ca_topic_score_gemma":0.000010288889,"teacher_disagreement_score":0.94090223,"about_ca_system_score_codex":0.00023595792,"about_ca_system_score_gemma":0.00016997219,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W2007377721","doi":"10.1007/s11235-014-9872-9","title":"Delay and capacity analysis of structured P2P overlay for lookup service","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Peer-to-Peer Network Technologies","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":"University of Waterloo","funders":"","keywords":"Computer science; Overlay; Overlay network; Computer network; Chord (peer-to-peer); Session (web analytics); Queueing theory; Telephony; Service (business); Set (abstract data type); Voice over IP; Distributed computing; Operating system; The Internet","score_opus":0.026995648221897484,"score_gpt":0.2590519572022861,"score_spread":0.2320563089803886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007377721","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.35588938,0.0003141276,0.641111,0.0013762572,0.00012881192,0.00045913903,0.000019148758,0.00031338245,0.00038874862],"genre_scores_gemma":[0.9255304,0.000013022966,0.07415351,0.00016354634,0.000015853027,0.00007196752,0.000014275407,0.000007362456,0.000030082118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987614,0.00017443484,0.00039770125,0.0002810789,0.00019192144,0.0001934749],"domain_scores_gemma":[0.99661577,0.00041928096,0.00029209538,0.0022766818,0.00033710428,0.000059058428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008411009,0.00012729508,0.0003950008,0.00035088178,0.000114381204,0.000097545795,0.0019258534,0.00011163494,0.0000010858987],"category_scores_gemma":[0.00013622058,0.000119900884,0.000061950486,0.0015593821,0.00004170823,0.00018889659,0.00047011755,0.00010043437,0.0000033649756],"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.000067702844,0.00024268196,0.03906867,0.0007474073,0.0035775711,5.631909e-7,0.011145948,0.09947235,0.029453939,0.653127,0.008309132,0.154787],"study_design_scores_gemma":[0.00035030578,0.00009520334,0.03661897,0.00004227863,0.00016881837,0.0000068101645,0.0001229143,0.93420357,0.0014908123,0.0016093252,0.024998995,0.00029202236],"about_ca_topic_score_codex":0.00055835955,"about_ca_topic_score_gemma":0.00078673556,"teacher_disagreement_score":0.8347312,"about_ca_system_score_codex":0.00004572745,"about_ca_system_score_gemma":0.000016755004,"threshold_uncertainty_score":0.48894164},"labels":[],"label_agreement":null},{"id":"W2011008386","doi":"10.1007/s11235-009-9254-x","title":"Geographic server distribution model for key revocation","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Agent-Based Network Management","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Revocation; Revocation list; Public key infrastructure; Key (lock); Key distribution; Key management; Computer security; Authentication (law); Computer network; Public-key cryptography; Scalability; Forward secrecy; Certificate authority; Encryption; Database","score_opus":0.023962465543065352,"score_gpt":0.25688488850102087,"score_spread":0.2329224229579555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011008386","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.025232561,0.00021417934,0.97115755,0.00094621937,0.00049946934,0.0012304902,0.000011942379,0.00032880474,0.00037876656],"genre_scores_gemma":[0.9767026,0.00007423569,0.021399476,0.00012488532,0.00008023686,0.0009649207,0.0003247325,0.000014347713,0.00031457792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986032,0.00013461908,0.0004270648,0.00033524702,0.0002428291,0.00025701112],"domain_scores_gemma":[0.9965633,0.00013104909,0.00028586638,0.0026665765,0.00027642233,0.00007677665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013781065,0.0001395028,0.0001554189,0.00009471598,0.0002851009,0.00024239511,0.0017715527,0.00009644853,0.000003662504],"category_scores_gemma":[0.000047359783,0.00014339203,0.000084359184,0.0004138443,0.00003336632,0.00049133744,0.00028193844,0.00019346375,0.000046221157],"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.000011522407,0.00017170042,0.0010142553,0.00015078874,0.000054064705,2.6437345e-7,0.00051334436,0.06675956,0.0012920103,0.8960987,0.014136939,0.019796867],"study_design_scores_gemma":[0.00025738834,0.000020868036,0.0012257718,0.000019972287,0.0000098820965,0.000002380132,0.000018553825,0.96286684,0.00008364279,0.001298204,0.034037784,0.00015873555],"about_ca_topic_score_codex":0.00012722275,"about_ca_topic_score_gemma":0.000116367875,"teacher_disagreement_score":0.95147,"about_ca_system_score_codex":0.000088040884,"about_ca_system_score_gemma":0.000055693494,"threshold_uncertainty_score":0.58473575},"labels":[],"label_agreement":null},{"id":"W2012403106","doi":"10.1007/s11235-008-9134-9","title":"A localized algorithm for bi-connectivity of connected mobile robots","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":32,"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 Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Robot; Network partition; Wireless ad hoc network; Mobile robot; Partition (number theory); Algorithm; Computer network; Fault tolerance; Topology (electrical circuits); Distributed computing; Wireless; Artificial intelligence; Network packet; Telecommunications; Mathematics","score_opus":0.04359173874023514,"score_gpt":0.27444694863381325,"score_spread":0.2308552098935781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012403106","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.0074210837,0.0012605153,0.98862803,0.000057130244,0.0003184505,0.000915417,0.000016600554,0.00021996719,0.0011628337],"genre_scores_gemma":[0.92142,0.00017225614,0.07766264,0.0000487549,0.000053678737,0.00035014338,0.00003624444,0.000014216564,0.00024207213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983953,0.00028456087,0.0005757139,0.00028078546,0.00021602989,0.0002475709],"domain_scores_gemma":[0.9967875,0.0007746599,0.00039998846,0.0015486862,0.00039209434,0.00009708999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064937345,0.00015096093,0.00043151647,0.00010453353,0.00024346501,0.000040438354,0.0011320016,0.000121757825,0.0000064409137],"category_scores_gemma":[0.000018277744,0.0001451154,0.00010559159,0.00042216876,0.000105071726,0.000240306,0.00018647009,0.00012370513,0.000013724498],"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.000086938766,0.0013006781,0.0010838425,0.00024455215,0.00033536777,0.000017310545,0.0042212736,0.006945646,0.0011744205,0.040529158,0.013087765,0.93097305],"study_design_scores_gemma":[0.0008660689,0.00014838099,0.00013777883,0.000043741555,0.000008763824,0.00008328782,0.00006856377,0.9870015,0.00022340186,0.00020852362,0.011032219,0.0001777981],"about_ca_topic_score_codex":0.00020447341,"about_ca_topic_score_gemma":0.0000058694127,"teacher_disagreement_score":0.9800558,"about_ca_system_score_codex":0.00004795675,"about_ca_system_score_gemma":0.00014741703,"threshold_uncertainty_score":0.59176344},"labels":[],"label_agreement":null},{"id":"W2018043799","doi":"10.1007/s11235-011-9454-z","title":"Self-stability of slotted ALOHA by limiting the number of retransmission trials in infrastructure-less wireless networks","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Networks and Protocols","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 Ottawa","funders":"","keywords":"Retransmission; Computer science; Computer network; Aloha; Node (physics); Network packet; Base station; Wireless network; Cellular network; Throughput; Wireless; Real-time computing; Telecommunications; Engineering","score_opus":0.06134997674246556,"score_gpt":0.29417435158494687,"score_spread":0.2328243748424813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018043799","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.5648236,0.001715393,0.4138465,0.0002515773,0.00044544804,0.011649079,0.000015118269,0.00026181887,0.0069914875],"genre_scores_gemma":[0.99327,0.0001942839,0.005775233,0.000022826229,0.000033439137,0.0006766572,0.000008432286,0.000014097298,0.0000050292106],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940127,0.003421265,0.0017479246,0.00026640043,0.00029483016,0.00025688627],"domain_scores_gemma":[0.99494934,0.0015084824,0.0013456927,0.0019076617,0.00023043957,0.000058384914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007349532,0.0001775519,0.00075268967,0.000054581757,0.00011016102,0.00005226382,0.0022484602,0.00020692247,0.000017859773],"category_scores_gemma":[0.000109020235,0.00012466141,0.00012476768,0.00075831596,0.00009348102,0.00026559885,0.00027043515,0.00037702383,0.0000012794413],"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.0005672456,0.0018179818,0.5998521,0.0022380664,0.00045558045,0.0000028194813,0.043453265,0.0063017663,0.00851715,0.10172485,0.0034932091,0.231576],"study_design_scores_gemma":[0.0022080573,0.00014642086,0.053324282,0.0012984595,0.000040168998,0.000021940887,0.001263626,0.92305785,0.013238012,0.0012947683,0.0034906475,0.0006157373],"about_ca_topic_score_codex":0.0005920024,"about_ca_topic_score_gemma":0.000023817689,"teacher_disagreement_score":0.9167561,"about_ca_system_score_codex":0.000054804088,"about_ca_system_score_gemma":0.00007539901,"threshold_uncertainty_score":0.5083545},"labels":[],"label_agreement":null},{"id":"W2025529612","doi":"10.1007/s11235-014-9927-y","title":"Improving the communication path reliability of WiMAX mesh network using multi sponsor technique","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc 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":"Université de Montréal","funders":"Universiti Teknologi Malaysia","keywords":"Computer science; Wireless mesh network; WiMAX; Computer network; Mesh networking; Switched mesh; Reliability (semiconductor); Order One Network Protocol; Optical mesh network; Node (physics); Distributed computing; Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.023034058227306545,"score_gpt":0.26079216453422815,"score_spread":0.23775810630692162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025529612","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.013408474,0.0011557353,0.98278064,0.00022569258,0.00019371742,0.001415425,0.0000016078632,0.00026440856,0.00055430643],"genre_scores_gemma":[0.7968632,0.000081423816,0.20261657,0.000061350576,0.000058432244,0.00025724698,0.000007355428,0.000019714671,0.000034693687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99495745,0.003129404,0.0009206171,0.0003441212,0.0003172542,0.0003311641],"domain_scores_gemma":[0.9899333,0.001373308,0.0010096079,0.007231066,0.00038774838,0.000064938926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0077446317,0.0001992587,0.00036642485,0.00006455975,0.00051501166,0.0001604128,0.0044920826,0.00016505472,0.0000034057923],"category_scores_gemma":[0.00033431494,0.00015879376,0.000100771445,0.0007681621,0.00019449991,0.00045765628,0.001244595,0.00047376196,0.000008949281],"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.000115575,0.0012267976,0.027466757,0.0009310686,0.00020337437,0.000001286196,0.0076622358,0.36450097,0.03619635,0.4202289,0.0032751695,0.13819152],"study_design_scores_gemma":[0.00020721837,0.00003840815,0.0018339711,0.00017717697,0.000013033242,0.000018862487,0.00007635351,0.9921829,0.0005008209,0.0004738706,0.0042892834,0.00018807568],"about_ca_topic_score_codex":0.001260827,"about_ca_topic_score_gemma":0.00004288812,"teacher_disagreement_score":0.7834547,"about_ca_system_score_codex":0.00015554643,"about_ca_system_score_gemma":0.00009159771,"threshold_uncertainty_score":0.8347482},"labels":[],"label_agreement":null},{"id":"W2030448615","doi":"10.1007/s11235-009-9259-5","title":"Reputation and trust management in heterogeneous peer-to-peer networks","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Access Control and Trust","field":"Social Sciences","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reputation; Computer science; Peer-to-peer; Order (exchange); Service (business); Convergence (economics); Trust management (information system); Value (mathematics); Quality of service; Quality (philosophy); Computer security; Internet privacy; Computer network; Business; Machine learning","score_opus":0.01918972680887801,"score_gpt":0.3170157698547243,"score_spread":0.29782604304584626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030448615","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.8487054,0.0008633746,0.0034585393,0.01082975,0.0011539991,0.0019463786,0.000004150968,0.00022995287,0.13280846],"genre_scores_gemma":[0.9960685,0.00012478934,0.0005194128,0.00013952849,0.00012601593,0.00014849483,0.00001407603,0.000009952476,0.0028492624],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879414,0.00023515132,0.00027487995,0.00017178203,0.00031902816,0.00020499274],"domain_scores_gemma":[0.9990769,0.000099451616,0.00010454574,0.0004544871,0.00017241738,0.00009221517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016701974,0.00007885015,0.0001329954,0.00011222937,0.00031410382,0.00022923628,0.0004075693,0.00009960851,0.000027629472],"category_scores_gemma":[0.0001108361,0.00008012867,0.000020268628,0.00027858655,0.00006734753,0.00017335199,0.00009553575,0.00019019526,0.00003180049],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011998692,0.00035972608,0.10705805,0.00008558721,0.00017020573,0.000024054645,0.03658513,0.02268014,0.00022807367,0.27513817,0.004218782,0.5533321],"study_design_scores_gemma":[0.0012753779,0.00004747265,0.09783108,0.00006247642,0.000035361594,0.000012436589,0.009567486,0.041585684,0.000012563962,0.000954854,0.8480982,0.0005169891],"about_ca_topic_score_codex":0.0032517998,"about_ca_topic_score_gemma":0.0063583152,"teacher_disagreement_score":0.84387946,"about_ca_system_score_codex":0.000050484356,"about_ca_system_score_gemma":0.00001653783,"threshold_uncertainty_score":0.49157703},"labels":[],"label_agreement":null},{"id":"W2031974753","doi":"10.1007/s11235-014-9923-2","title":"DualEMC: energy efficient mobile multimedia communication with cloud","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Green IT and Sustainability","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":"Simon Fraser University","funders":"","keywords":"Computer science; Cloud computing; Multimedia; Telecommunications; Operating system","score_opus":0.005079646552156269,"score_gpt":0.19651404455756205,"score_spread":0.1914343980054058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031974753","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.8543478,0.009506262,0.09140008,0.0001834656,0.0005747423,0.001375788,0.000012874775,0.002060668,0.04053828],"genre_scores_gemma":[0.99745405,0.00016870715,0.0015430397,0.000016728893,0.00006348351,0.0004147731,0.00008461074,0.00004201906,0.00021260224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865794,0.00035637894,0.00038364012,0.00015448366,0.0001994034,0.00024814822],"domain_scores_gemma":[0.9972955,0.00028795976,0.00009125402,0.0020453727,0.00018803723,0.000091905116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006748323,0.00017571764,0.0002461654,0.00008858746,0.00017604356,0.00006694232,0.00063443254,0.00010137333,0.000018459512],"category_scores_gemma":[0.000026857972,0.00015780718,0.00004096974,0.0002579135,0.00009394486,0.00008134505,0.00008587382,0.00019368266,0.00004797473],"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.000050049053,0.00039170316,0.0044288207,0.00048607698,0.0001672773,9.646513e-7,0.0055699386,0.8520745,0.0008984901,0.01793396,0.004999592,0.112998605],"study_design_scores_gemma":[0.00049320154,0.00006390807,0.0014729032,0.000056003864,0.000015526257,0.000009500466,0.0010528597,0.8270613,0.00033827667,0.00005062101,0.1691037,0.00028219144],"about_ca_topic_score_codex":0.00040629986,"about_ca_topic_score_gemma":0.00013524242,"teacher_disagreement_score":0.1641041,"about_ca_system_score_codex":0.0001685378,"about_ca_system_score_gemma":0.000019603624,"threshold_uncertainty_score":0.64351904},"labels":[],"label_agreement":null},{"id":"W2035643157","doi":"10.1007/s11235-011-9540-2","title":"Framework for MIMO cross-layer secure communication based on STBC","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":11,"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; Physical layer; Computer network; MIMO; Space–time block code; Communication source; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.07330059585761008,"score_gpt":0.3183980370406202,"score_spread":0.24509744118301013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035643157","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.04244114,0.009198665,0.8350788,0.00074223726,0.00078789913,0.005316354,0.00021299331,0.008467277,0.09775468],"genre_scores_gemma":[0.8909954,0.0005768765,0.10630018,0.00017096795,0.000044780605,0.001520579,0.00020823976,0.00012380704,0.00005916592],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794894,0.00037621282,0.0007914342,0.00025701532,0.00027102663,0.00035537587],"domain_scores_gemma":[0.9931345,0.00091102195,0.00026319516,0.005214963,0.00036336092,0.00011297499],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010355437,0.00032573435,0.00038593088,0.0002599496,0.00036072108,0.00016504293,0.0024054607,0.00041453083,0.00008870555],"category_scores_gemma":[0.00016149927,0.00035940943,0.0001474949,0.00038611185,0.00013652125,0.0003085367,0.00014932545,0.0006771414,0.00011519947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034686673,0.0013958814,0.0057835183,0.0013602412,0.0004020252,0.0000013186149,0.011952685,0.034255255,0.002565491,0.9011402,0.026730258,0.014066224],"study_design_scores_gemma":[0.0019214863,0.00037997478,0.007981885,0.001543498,0.000083037405,0.0000123950085,0.00093623163,0.6793838,0.02587628,0.021218354,0.25866848,0.001994569],"about_ca_topic_score_codex":0.00010042954,"about_ca_topic_score_gemma":0.000026764044,"teacher_disagreement_score":0.87992185,"about_ca_system_score_codex":0.00022451156,"about_ca_system_score_gemma":0.000036552778,"threshold_uncertainty_score":0.9998858},"labels":[],"label_agreement":null},{"id":"W2036541283","doi":"10.1007/s11235-006-5523-0","title":"Practical Integrated Design Strategies for Opaque and All-Optical DWDM Networks: Optimization Models and Solution Procedures","year":2006,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Nortel (Canada)","funders":"Office of Naval Research","keywords":"Wavelength-division multiplexing; Computer science; Traverse; Network planning and design; Opacity; Optical amplifier; Routing (electronic design automation); Electronic engineering; Computer network; Optics; Wavelength; Engineering; Materials science; Optoelectronics","score_opus":0.04383239515587312,"score_gpt":0.28062731376971994,"score_spread":0.23679491861384683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036541283","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.0013006581,0.0031550922,0.9929031,0.00026782378,0.000055974826,0.00088181783,0.000003008605,0.0009234155,0.0005091097],"genre_scores_gemma":[0.6104213,0.0010975797,0.38807696,0.000008174448,0.00003538764,0.00027227768,0.000048886857,0.000028702761,0.000010712683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989645,0.00007345353,0.00038690402,0.00020303646,0.00009239981,0.00027971272],"domain_scores_gemma":[0.99890405,0.0005065791,0.000075932585,0.00033782213,0.0001281023,0.000047541973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031275937,0.00019285014,0.00023376304,0.000078110075,0.00012692918,0.00021194865,0.0001589883,0.00024681524,7.7515847e-7],"category_scores_gemma":[0.00010811638,0.00018346928,0.00001872232,0.00017069957,0.00014551824,0.0006692712,0.00006173749,0.00023877616,7.1153437e-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.00002012223,0.000017991377,0.0000064646283,0.000065650216,0.000023784907,2.7199457e-7,0.000023302424,0.9065005,0.00027262417,0.09159424,0.000780779,0.00069424603],"study_design_scores_gemma":[0.00022297684,0.000056853798,0.000015493391,0.00006750752,0.000030602994,0.000035534365,0.00035394303,0.9931521,0.00006590027,0.005477612,0.00032313023,0.00019838799],"about_ca_topic_score_codex":0.00002193143,"about_ca_topic_score_gemma":0.000026040243,"teacher_disagreement_score":0.60912067,"about_ca_system_score_codex":0.00008584582,"about_ca_system_score_gemma":0.000034374796,"threshold_uncertainty_score":0.748166},"labels":[],"label_agreement":null},{"id":"W2036971530","doi":"10.1007/s11235-009-9246-x","title":"Developing wireless sensor network applications in a virtual environment","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Alberta","funders":"Uniwersytet Warszawski; University of Alberta","keywords":"Emulation; Computer science; Wireless sensor network; Virtualization; Component (thermodynamics); Wireless ad hoc network; Wireless; Wireless network; Underlay; Distributed computing; Field (mathematics); Key distribution in wireless sensor networks; Computer network; Embedded system; Operating system; Telecommunications","score_opus":0.01665370197306319,"score_gpt":0.23871841784618358,"score_spread":0.2220647158731204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036971530","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.113637276,0.00027939942,0.88259184,0.0005870083,0.0004490302,0.0006239499,0.0000011546588,0.00031042218,0.0015199203],"genre_scores_gemma":[0.942759,0.00014156569,0.056254018,0.00008401381,0.00015517756,0.00037354068,0.000024945279,0.000023999575,0.00018374335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979242,0.0002946971,0.0006001555,0.00043924458,0.00029881072,0.00044286484],"domain_scores_gemma":[0.9968102,0.0004167523,0.0002699595,0.0023471625,0.000059168196,0.00009676983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008037586,0.0002053638,0.00026894684,0.0001437478,0.00028509903,0.00018449254,0.0021066698,0.00017506382,0.000005648364],"category_scores_gemma":[0.0000131641345,0.0002112239,0.000048802154,0.0007098354,0.000080413745,0.00024350874,0.00050782337,0.00054068636,0.00011840985],"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.000002284589,0.00010392114,0.003200019,0.000010919764,0.0000143021125,0.0000016813024,0.00046126972,0.35688603,0.0016723865,0.62690353,0.000110271074,0.01063335],"study_design_scores_gemma":[0.0005119003,0.000032985194,0.00685764,0.000095155214,0.000005864213,0.00004012874,0.00031857454,0.8615607,0.00052270986,0.00035446818,0.12899852,0.0007013771],"about_ca_topic_score_codex":0.00010247954,"about_ca_topic_score_gemma":0.00013137166,"teacher_disagreement_score":0.8291217,"about_ca_system_score_codex":0.00015085428,"about_ca_system_score_gemma":0.00007104708,"threshold_uncertainty_score":0.86134607},"labels":[],"label_agreement":null},{"id":"W2037713727","doi":"10.1007/s11235-013-9725-y","title":"Passive filterless core networks based on advanced modulation and electrical compensation technologies","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Optical Network Technologies","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep regional de Lanaudiere; Ciena (Canada); CBC (Canada); McGill University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network topology; Network architecture; Passive optical network; Compensation (psychology); Electronic engineering; Computer network; Wavelength-division multiplexing; Materials science; Engineering","score_opus":0.014294218574203252,"score_gpt":0.22041655977589536,"score_spread":0.2061223412016921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037713727","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.83911544,0.0027025435,0.14196368,0.0012122365,0.0003817752,0.00258334,0.00000591524,0.009163126,0.0028719637],"genre_scores_gemma":[0.9920018,0.00030748517,0.007129526,0.000022972516,0.000019343963,0.00042516558,0.000049322345,0.000032150005,0.000012240328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990373,0.000051903633,0.00033126006,0.00018517893,0.00014075077,0.00025355766],"domain_scores_gemma":[0.99858683,0.00036805606,0.00009009796,0.00082339754,0.00009906944,0.000032561777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000104592924,0.00018336577,0.00023517202,0.00016616874,0.00011219694,0.00009682504,0.0003605145,0.00026273492,0.000006470026],"category_scores_gemma":[0.000083788334,0.00017296712,0.00002589529,0.0003876437,0.00009064751,0.0001867849,0.00006403863,0.00037236395,0.000036893885],"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.0000064466726,0.000024878305,0.0010795244,0.000030301107,0.000015829295,3.2650658e-7,0.000019638474,0.8066952,0.0010366677,0.00807803,0.0007522911,0.18226087],"study_design_scores_gemma":[0.0002349598,0.00006670447,0.011373487,0.000070428236,0.0000049240507,0.0000025299862,0.0001268334,0.9868672,0.0001776296,0.00049234525,0.00039652165,0.00018645434],"about_ca_topic_score_codex":0.0000134424345,"about_ca_topic_score_gemma":0.0000036531228,"teacher_disagreement_score":0.18207441,"about_ca_system_score_codex":0.00013298476,"about_ca_system_score_gemma":0.0000052448945,"threshold_uncertainty_score":0.70533943},"labels":[],"label_agreement":null},{"id":"W2039305231","doi":"10.1007/s11235-009-9228-z","title":"Modelling the energy cost of a fully operational wireless sensor network","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":43,"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 Guelph","funders":"","keywords":"Computer science; Wireless sensor network; Key distribution in wireless sensor networks; Energy consumption; Scope (computer science); Wireless; Computer network; Pipeline (software); Wireless network; Energy (signal processing); Real-time computing; Telecommunications","score_opus":0.025801449848215356,"score_gpt":0.23951020922352545,"score_spread":0.2137087593753101,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039305231","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.008074853,0.0016539431,0.9850369,0.0014375659,0.00030260623,0.00024995208,0.0000016294517,0.00016329908,0.0030792633],"genre_scores_gemma":[0.9818212,0.00029676163,0.016945101,0.00036580302,0.0002022658,0.00004264117,0.000021020307,0.000012761289,0.00029249518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774873,0.0005677478,0.000641971,0.0002839686,0.00042748573,0.00033007545],"domain_scores_gemma":[0.9967851,0.00041581434,0.00037772005,0.002015023,0.00033910584,0.00006722465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007943139,0.00017553051,0.00027712312,0.00007121399,0.00038598123,0.00019800806,0.0022415516,0.00010661354,0.0000029582804],"category_scores_gemma":[0.000010289032,0.00013765795,0.00008252274,0.00071058987,0.00007177265,0.00024750552,0.00018117414,0.00020566495,0.000009204298],"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.0000038775124,0.000037798938,0.0000141995815,0.0000023182397,0.000011125256,4.0254096e-7,0.00016842378,0.7280889,0.00016421496,0.26818112,0.00052955095,0.0027980693],"study_design_scores_gemma":[0.00016304331,0.000036158697,0.0000435514,0.00006483517,0.000005007936,0.000022798196,0.00004969222,0.9874967,0.00023419465,0.00017222618,0.011561465,0.00015033346],"about_ca_topic_score_codex":0.0002993448,"about_ca_topic_score_gemma":0.000013072243,"teacher_disagreement_score":0.9737463,"about_ca_system_score_codex":0.00006543395,"about_ca_system_score_gemma":0.00007613517,"threshold_uncertainty_score":0.56135285},"labels":[],"label_agreement":null},{"id":"W2040863069","doi":"10.1007/s11235-013-9710-5","title":"An optimal dynamic resources partitioning auction model for virtual private networks","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Private network; Integer programming; Computer network; Quality of service; Bandwidth (computing); The Internet; Revenue; Profit (economics); Common value auction; Distributed computing; Mathematical optimization; Algorithm; Microeconomics","score_opus":0.014093821176280113,"score_gpt":0.246152479983199,"score_spread":0.2320586588069189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040863069","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.04612992,0.00045869398,0.95125216,0.0005305063,0.00028406727,0.0007310115,0.0000016721174,0.00049951754,0.00011242956],"genre_scores_gemma":[0.9710921,0.000051166633,0.02733316,0.00012628727,0.00012285319,0.0008752604,0.000042190346,0.000018554438,0.00033844935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854815,0.00023867136,0.00043100156,0.00031667645,0.00016373924,0.000301749],"domain_scores_gemma":[0.9980129,0.00016178262,0.00024915815,0.0012419147,0.0002201901,0.000114079296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056411535,0.00014893625,0.00019204585,0.00007835271,0.00044383528,0.00056136434,0.0012216906,0.00010996551,0.0000066143916],"category_scores_gemma":[0.000015447216,0.0001489776,0.000060276936,0.00020482334,0.00004401092,0.0010765635,0.00009741007,0.00016413972,0.000039188406],"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.00000728513,0.000035942176,0.000022968437,0.000004039874,0.000014316804,4.7397435e-8,0.00038714803,0.9096984,0.00007550984,0.016537301,0.00037238438,0.07284463],"study_design_scores_gemma":[0.0003375103,0.000091359354,0.00026389165,0.000028594393,0.000007449373,0.000006342927,0.00011433291,0.99722856,0.0000040285813,0.00021800373,0.0015235277,0.00017637757],"about_ca_topic_score_codex":0.000029084644,"about_ca_topic_score_gemma":0.00001152548,"teacher_disagreement_score":0.92496216,"about_ca_system_score_codex":0.000073092284,"about_ca_system_score_gemma":0.000030398769,"threshold_uncertainty_score":0.60751307},"labels":[],"label_agreement":null},{"id":"W2047008061","doi":"10.1007/s11235-009-9229-y","title":"Sensitivity of SWAN QoS model in MANETs with proactive and reactive routing: a simulation study","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Sensitivity (control systems); Computer network; Quality of service; Routing (electronic design automation)","score_opus":0.027580221553595293,"score_gpt":0.280097441937171,"score_spread":0.2525172203835757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047008061","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.67609113,0.000053582313,0.3214548,0.00007476653,0.000016226164,0.0013280284,7.3588967e-7,0.00006572295,0.000914987],"genre_scores_gemma":[0.9964112,0.000004287905,0.003486236,0.000016097118,0.000012305768,0.000045351735,0.0000027246974,0.0000067399806,0.000015039622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983051,0.00069424737,0.00033794311,0.00028695306,0.0002240261,0.00015174533],"domain_scores_gemma":[0.99807334,0.00033973157,0.00032496394,0.0010611725,0.00016173751,0.00003904769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011902598,0.00012447122,0.0002643437,0.000109406894,0.000069131645,0.00005930363,0.0003289696,0.000054785472,1.14016686e-7],"category_scores_gemma":[0.000031092473,0.00011296498,0.000013720904,0.0003842657,0.00002880224,0.0004990981,0.00011708227,0.00016753716,6.695517e-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.00006939626,0.00069212704,0.009251773,0.000010880419,0.000033663568,0.00000462608,0.013912569,0.95528984,0.000751928,0.0051480564,0.000004855742,0.014830267],"study_design_scores_gemma":[0.00047292517,0.00022345826,0.06554267,0.00005210328,0.000006289492,0.00000916325,0.0006480381,0.9327199,0.000112768554,0.00009869142,0.0000042906736,0.00010971254],"about_ca_topic_score_codex":0.0003546558,"about_ca_topic_score_gemma":0.00022654116,"teacher_disagreement_score":0.32032007,"about_ca_system_score_codex":0.000096359254,"about_ca_system_score_gemma":0.00004935809,"threshold_uncertainty_score":0.46065784},"labels":[],"label_agreement":null},{"id":"W2051305419","doi":"10.1007/s11235-009-9223-4","title":"Neural-based approach for localization of sensors in indoor environment","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Norleaf Networks (Canada); University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Gradient descent; Artificial neural network; Received signal strength indication; Signal strength; Wireless sensor network; Algorithm; Position (finance); SIGNAL (programming language); Real-time computing; Transmitter; Wireless; Artificial intelligence; Computer network; Telecommunications; Acoustics","score_opus":0.01718536148226756,"score_gpt":0.2235563385749642,"score_spread":0.20637097709269664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051305419","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.022493264,0.00091249566,0.97375923,0.00005540732,0.000054246357,0.0009017027,0.000010674518,0.00037561278,0.0014373801],"genre_scores_gemma":[0.99586457,0.00008557831,0.0037654524,0.000022651297,0.000009732946,0.00010175254,0.00011664158,0.000016507496,0.000017139751],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918574,0.00005392717,0.00041785176,0.00010237079,0.000102052996,0.00013807204],"domain_scores_gemma":[0.99930227,0.000054479147,0.00008554404,0.000506564,0.000033662815,0.000017468621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021976649,0.00010627617,0.00019635895,0.000191965,0.000035429337,0.000013797471,0.00025497895,0.000119890065,0.0000029821967],"category_scores_gemma":[0.000026632275,0.00010945577,0.000037477756,0.00023123839,0.000030197554,0.00006585221,0.000010463046,0.0000835149,0.000002401239],"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.0000070528217,0.0000447253,0.00088837376,0.00008809789,0.0000044140693,5.5589325e-8,0.00010216129,0.9943187,0.0007404758,0.00096934836,0.000090754096,0.0027457988],"study_design_scores_gemma":[0.00044998594,0.000041204814,0.0006014482,0.000021714795,0.000004744119,7.818828e-7,0.00021285436,0.9870227,0.009484986,0.000043813696,0.0020033391,0.0001124155],"about_ca_topic_score_codex":0.000011987239,"about_ca_topic_score_gemma":0.0000010587115,"teacher_disagreement_score":0.97337127,"about_ca_system_score_codex":0.00009068091,"about_ca_system_score_gemma":0.000007034805,"threshold_uncertainty_score":0.44634765},"labels":[],"label_agreement":null},{"id":"W2057140658","doi":"10.1007/s11235-013-9825-8","title":"Robust FIPP p-cycles against dual link failures","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":9,"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é de Montréal; Concordia University","funders":"","keywords":"Computer science; Column generation; Heuristics; Scalability; Bandwidth (computing); Mathematical optimization; Dual (grammatical number); Path (computing); Mathematics; Computer network","score_opus":0.024583501418219803,"score_gpt":0.22385627995636753,"score_spread":0.19927277853814773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057140658","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.6622718,0.039719865,0.13892232,0.0076068994,0.0020653605,0.0045112264,0.000032890537,0.026081469,0.11878815],"genre_scores_gemma":[0.96846753,0.0010072696,0.029823875,0.000031629446,0.00011659398,0.00029367217,0.000032463086,0.000049248967,0.00017773935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989871,0.00005002268,0.0003863676,0.0001453776,0.00013115682,0.00029998145],"domain_scores_gemma":[0.9984445,0.00019791945,0.00006205695,0.001153104,0.00008277302,0.00005966312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119981916,0.00017614507,0.00022545291,0.000089723246,0.00010669176,0.00010976657,0.0005708663,0.00018215779,0.00003439045],"category_scores_gemma":[0.00006766553,0.00016862502,0.000042526364,0.00024465495,0.000088283254,0.00029972283,0.00014449196,0.00034824296,0.00069401937],"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.0000016697352,0.000025490212,0.00040132928,0.00011113826,0.000075649674,0.0000015102235,0.0001722269,0.88141346,0.0038334418,0.008061542,0.015895627,0.090006895],"study_design_scores_gemma":[0.00047182365,0.000044908462,0.0039329184,0.00023470169,0.000015926058,0.000021201628,0.0015663407,0.79483825,0.0008862906,0.001325662,0.19579317,0.00086879864],"about_ca_topic_score_codex":0.0000449542,"about_ca_topic_score_gemma":0.000016265463,"teacher_disagreement_score":0.30619568,"about_ca_system_score_codex":0.00008990057,"about_ca_system_score_gemma":0.0000059975214,"threshold_uncertainty_score":0.89204466},"labels":[],"label_agreement":null},{"id":"W2059205812","doi":"10.1007/s11235-009-9264-8","title":"Security analysis of pure DDP-based cipher proper for multimedia and ubiquitous device","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Cryptographic Implementations and Security","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":"Acadia University","funders":"","keywords":"Computer science; Block cipher; Key (lock); Cipher; Stream cipher; Block (permutation group theory); Computer security; Cryptography; Encryption; Theoretical computer science","score_opus":0.025108699165250638,"score_gpt":0.30916497456235037,"score_spread":0.2840562753970997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059205812","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.8160915,0.00041922712,0.18110931,0.0006009707,0.00023387147,0.0010922984,0.00006225377,0.0001110588,0.00027953857],"genre_scores_gemma":[0.9724214,0.00001414436,0.027214559,0.000062396946,0.000020046138,0.0001830811,0.000069361355,0.000006589237,0.000008406048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998901,0.00013518553,0.0004114782,0.00022484266,0.00017355965,0.00015394825],"domain_scores_gemma":[0.99778086,0.00031923057,0.00025843288,0.001216947,0.00035995405,0.000064558095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085027266,0.00010392705,0.00026100196,0.000298443,0.00016839016,0.00011259016,0.00076442835,0.00007862855,0.000014380603],"category_scores_gemma":[0.00005785303,0.00009255179,0.00009778016,0.0009811547,0.000068018446,0.00019103914,0.00012050521,0.00013985958,0.0000013113875],"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.00015199084,0.003095228,0.23312154,0.0018505248,0.0047401357,0.0000026029386,0.06295992,0.002610672,0.09676004,0.4523742,0.004501336,0.13783182],"study_design_scores_gemma":[0.00083746953,0.000078040706,0.02030895,0.000017767747,0.00023481595,0.0000028029658,0.00054282043,0.9580352,0.0012055205,0.00031558843,0.018172255,0.0002488214],"about_ca_topic_score_codex":0.00040284358,"about_ca_topic_score_gemma":0.0020240399,"teacher_disagreement_score":0.9554245,"about_ca_system_score_codex":0.000011733767,"about_ca_system_score_gemma":0.000056691468,"threshold_uncertainty_score":0.37741524},"labels":[],"label_agreement":null},{"id":"W2060335015","doi":"10.1007/s11235-013-9744-8","title":"Applying control theoretic approach to mitigate SIP overload","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Australian Government","keywords":"Retransmission; Computer science; Server; Computer network; Session Initiation Protocol; Upstream (networking); Distributed computing","score_opus":0.009430546678706114,"score_gpt":0.2018993082853096,"score_spread":0.1924687616066035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060335015","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.55737585,0.010031521,0.147211,0.0005777732,0.0017266821,0.010504527,0.000029613671,0.0026307227,0.26991227],"genre_scores_gemma":[0.9967824,0.000082089675,0.00056212663,0.0001144599,0.00009204497,0.002207593,0.000011564891,0.000027810576,0.000119909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998988,0.00012708333,0.00030887494,0.00014631887,0.00016618159,0.0002635878],"domain_scores_gemma":[0.99876606,0.00013435651,0.000042128253,0.00086530595,0.00006752091,0.00012459794],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028654124,0.00014299691,0.00020959524,0.00008510743,0.00012797398,0.00013151018,0.0006005821,0.000087168555,0.000025482268],"category_scores_gemma":[0.000029043971,0.00013097528,0.000044808847,0.00022849474,0.000047977737,0.00016645294,0.000048282247,0.00019934734,0.0008298162],"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.000019393325,0.00027043096,0.0027914196,0.0011488667,0.0002747016,0.0000012722445,0.008523553,0.8125642,0.05088845,0.07838676,0.027843272,0.017287664],"study_design_scores_gemma":[0.0007311102,0.000037601032,0.0047557415,0.0001615859,0.000022956361,0.000035491918,0.0019116699,0.9298875,0.0008891793,0.00037302016,0.060571555,0.0006226217],"about_ca_topic_score_codex":0.00014520885,"about_ca_topic_score_gemma":0.0000032888902,"teacher_disagreement_score":0.4394065,"about_ca_system_score_codex":0.00006131618,"about_ca_system_score_gemma":0.000009009261,"threshold_uncertainty_score":0.99994814},"labels":[],"label_agreement":null},{"id":"W2064074744","doi":"10.1007/s11235-009-9146-0","title":"Computationally efficient method for analyzing guard channel schemes","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Guard (computer science); Channel (broadcasting); Markov chain; Call Admission Control; Computation; Quality of service; Wireless; Markov model; Computer network; Mathematical optimization; Wireless network; Algorithm; Telecommunications; Mathematics","score_opus":0.04590116726333987,"score_gpt":0.35865278270314693,"score_spread":0.31275161543980706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064074744","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.0009184309,0.002462856,0.98823833,0.00566306,0.0001232412,0.00091659644,0.00000407078,0.00039073356,0.001282651],"genre_scores_gemma":[0.6832115,0.000084449544,0.3160398,0.00020328538,0.00006891914,0.00018234298,0.00005041845,0.000013216225,0.00014603614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722743,0.0007728785,0.0006828902,0.00041601044,0.0004778312,0.00042298308],"domain_scores_gemma":[0.9947135,0.0012564084,0.00036308766,0.0027611295,0.000774031,0.0001318663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002685997,0.00019509446,0.000335716,0.0003288695,0.0005578368,0.00046571204,0.0040120226,0.000108644264,0.0000028815045],"category_scores_gemma":[0.00015339196,0.00019787789,0.00012977616,0.0010065113,0.000040555293,0.0003056852,0.00042843437,0.00028956973,0.000045089502],"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.000019740171,0.00030132636,0.000047514324,0.000046464604,0.00006260814,5.638654e-7,0.0012487003,0.45080125,0.0013732285,0.43208182,0.0030924687,0.11092434],"study_design_scores_gemma":[0.00041950948,0.00006689333,0.0010739235,0.000058983183,0.000005155087,0.000011916978,0.00006555861,0.9814481,0.00021112726,0.0013708159,0.015052182,0.00021584351],"about_ca_topic_score_codex":0.000027948297,"about_ca_topic_score_gemma":0.000003451483,"teacher_disagreement_score":0.6822931,"about_ca_system_score_codex":0.00017061543,"about_ca_system_score_gemma":0.00013911394,"threshold_uncertainty_score":0.8069226},"labels":[],"label_agreement":null},{"id":"W2072697263","doi":"10.1007/s11235-007-9038-0","title":"A model of user behavior in multi-service priced networks","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Quality of service; Context (archaeology); Service (business); Mobile QoS; User satisfaction; Class (philosophy); Stability (learning theory); Computer network; Distributed computing; Human–computer interaction; Service provider; Artificial intelligence; Machine learning","score_opus":0.05834147422572645,"score_gpt":0.2891169473300427,"score_spread":0.23077547310431623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072697263","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.0754702,0.00070474,0.922377,0.00016521587,0.0001473015,0.0004824359,7.2946585e-7,0.00013033375,0.00052207464],"genre_scores_gemma":[0.97596735,0.000046658042,0.023528218,0.00017078574,0.000020415931,0.00009561479,0.0000046830733,0.000010043292,0.00015622537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859875,0.0001454663,0.0006160501,0.00020503819,0.00018079212,0.00025390767],"domain_scores_gemma":[0.9979679,0.00021008318,0.00027554645,0.0012561328,0.00022246475,0.000067852256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012272876,0.00011519238,0.0002292619,0.00014421022,0.000058421425,0.00004642834,0.0014235966,0.000113126844,0.0000016161072],"category_scores_gemma":[0.000014362303,0.000116415635,0.000042198004,0.0006717878,0.000021078684,0.00025348592,0.00017905282,0.0002055677,0.000011761839],"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.000043916247,0.0007000668,0.012921757,0.000044621498,0.000029954172,0.0000035991673,0.0016937887,0.8192031,0.001888979,0.056192454,0.00016427148,0.107113525],"study_design_scores_gemma":[0.0006108846,0.000014985925,0.011460464,0.00003668937,0.0000054924403,0.0000040429777,0.00006923144,0.9873399,0.00001859977,0.000008063292,0.00031483133,0.00011679314],"about_ca_topic_score_codex":0.00020093335,"about_ca_topic_score_gemma":0.00058941357,"teacher_disagreement_score":0.90049714,"about_ca_system_score_codex":0.000062270294,"about_ca_system_score_gemma":0.000054213033,"threshold_uncertainty_score":0.47472918},"labels":[],"label_agreement":null},{"id":"W2076540262","doi":"10.1007/s11235-013-9838-3","title":"Distributed probabilistic medium access with multipacket reception and Markovian traffic","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Networks and Protocols","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 Alberta","funders":"","keywords":"Burstiness; Computer science; Computer network; Probabilistic logic; Queueing theory; Throughput; Bandwidth (computing); Wireless network; Markov process; Distributed computing; Wireless; Network packet; Telecommunications","score_opus":0.025424940920095118,"score_gpt":0.2667409556676241,"score_spread":0.241316014747529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076540262","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.37835667,0.0010825791,0.57197106,0.0094415285,0.00049073214,0.035091847,0.000026981861,0.0015664964,0.0019721114],"genre_scores_gemma":[0.9896151,0.000050163966,0.003977907,0.000050605104,0.000051864732,0.0061142193,0.00005521598,0.000013199576,0.000071723],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998567,0.00035693732,0.00033429253,0.00029810268,0.00020537611,0.00023833048],"domain_scores_gemma":[0.99801517,0.00021112534,0.00022988787,0.0012109192,0.00020980531,0.00012306754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004536471,0.00015425863,0.00021249571,0.000062888495,0.0002051032,0.00085557956,0.0013097262,0.00008662477,0.000017763809],"category_scores_gemma":[0.000027876082,0.00011854193,0.000019602923,0.00040731567,0.000079650024,0.00096917234,0.00027475553,0.00017349116,0.00003818439],"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.0001984844,0.0013213984,0.03800457,0.0019757168,0.00036151402,0.000010050574,0.0074254605,0.08294764,0.0012564105,0.0321387,0.061528612,0.77283144],"study_design_scores_gemma":[0.0012208404,0.0002485839,0.07621026,0.00041733505,0.000012597887,0.000071566545,0.00018272507,0.90010476,0.000056940396,0.00034169856,0.020563256,0.00056944677],"about_ca_topic_score_codex":0.00027680706,"about_ca_topic_score_gemma":0.0000817723,"teacher_disagreement_score":0.8171571,"about_ca_system_score_codex":0.000059249345,"about_ca_system_score_gemma":0.00004762413,"threshold_uncertainty_score":0.82503736},"labels":[],"label_agreement":null},{"id":"W2078839847","doi":"10.1007/s11235-011-9452-1","title":"EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing protocol for wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Distributed computing; Wireless ad hoc network; Routing protocol; Link-state routing protocol; Dynamic Source Routing; Zone Routing Protocol; Ad hoc wireless distribution service; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.05016412436585522,"score_gpt":0.29562037130960084,"score_spread":0.24545624694374563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078839847","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.001334312,0.0001613304,0.9218663,0.000055319706,0.00028807443,0.07519954,0.00001258642,0.00069981,0.00038272617],"genre_scores_gemma":[0.7701488,0.000003246127,0.03019801,0.00008519919,0.00011739872,0.19926938,0.000105352556,0.00004991144,0.000022658858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965956,0.00072587735,0.0009635607,0.00067379425,0.00034396732,0.00069720775],"domain_scores_gemma":[0.99459225,0.0003617089,0.00077802426,0.0036400128,0.0003904152,0.0002375602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018478596,0.00035199997,0.00044711708,0.00011061193,0.0006087346,0.00042513292,0.0035562767,0.00022602653,0.000010444003],"category_scores_gemma":[0.000038411017,0.0003426584,0.00014190075,0.00067233376,0.0000855563,0.00043697143,0.00042361827,0.00040112867,0.000018379415],"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.00025503567,0.0013026018,0.0007565119,0.00024412086,0.000076240794,0.00000391747,0.0024187106,0.85692596,0.00013261028,0.020399328,0.0011406059,0.11634435],"study_design_scores_gemma":[0.0014737265,0.00027006902,0.00049008,0.00024251237,0.000009055742,0.000011049224,0.000081282175,0.9866503,0.0001278513,0.000028599574,0.0102185225,0.00039694487],"about_ca_topic_score_codex":0.00007972011,"about_ca_topic_score_gemma":0.00003383078,"teacher_disagreement_score":0.8916683,"about_ca_system_score_codex":0.00020668523,"about_ca_system_score_gemma":0.00014001154,"threshold_uncertainty_score":0.99990255},"labels":[],"label_agreement":null},{"id":"W2080988740","doi":"10.1007/s11235-007-9030-8","title":"On the advantages of optimal end-to-end QoS budget partitioning","year":2007,"lang":"en","type":"article","venue":"Telecommunication Systems","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":"University of Waterloo; Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Dimensioning; Computer science; Quality of service; Robustness (evolution); Path (computing); End-to-end principle; Mathematical optimization; Distributed computing; Computer network","score_opus":0.016654074295836173,"score_gpt":0.26304994832943734,"score_spread":0.24639587403360116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080988740","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.06679782,0.0007285663,0.9176032,0.0042333957,0.0005690693,0.0005611005,0.0000037541988,0.0002177981,0.009285294],"genre_scores_gemma":[0.9946476,0.000032459295,0.004561862,0.00037452037,0.00010361174,0.000060668754,0.0000045013685,0.000008093963,0.00020668432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986248,0.00024985033,0.00042496168,0.00018633026,0.0002876893,0.00022638279],"domain_scores_gemma":[0.9969468,0.0012877698,0.00022102294,0.0013236874,0.00014555002,0.00007515371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017444486,0.000107935346,0.00016724208,0.000095153664,0.00022173852,0.00009594393,0.0013535195,0.00004739747,0.000028226605],"category_scores_gemma":[0.0000844166,0.00008220274,0.000051947918,0.00038146065,0.000051341583,0.00015512001,0.0001481471,0.00016739397,0.000109142056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031621832,0.000110236135,0.00041027152,0.000013324688,0.000046730653,0.0000019777553,0.0017540826,0.027772136,0.0010092293,0.8442472,0.0043839575,0.1202192],"study_design_scores_gemma":[0.002595234,0.0012177591,0.024471873,0.0009888166,0.000070140544,0.0001533219,0.0035761327,0.64885014,0.007665998,0.0015737134,0.30729932,0.0015375633],"about_ca_topic_score_codex":0.00004786765,"about_ca_topic_score_gemma":0.000024426035,"teacher_disagreement_score":0.92784977,"about_ca_system_score_codex":0.00004044489,"about_ca_system_score_gemma":0.00003562504,"threshold_uncertainty_score":0.33521307},"labels":[],"label_agreement":null},{"id":"W2081944040","doi":"10.1007/s11235-014-9892-5","title":"Optimized handover strategy with hybrid satisfaction mechanisms","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Queen's University","funders":"Qatar University","keywords":"Handover; Macrocell; Computer science; Femtocell; Computer network; Wireless; Key (lock); Operator (biology); High data rate; Interference (communication); Battery (electricity); Distributed computing; Real-time computing; Telecommunications; Base station; Computer security; Channel (broadcasting)","score_opus":0.00990513920874415,"score_gpt":0.20581401594742396,"score_spread":0.19590887673867982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081944040","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.17216028,0.0016362086,0.8047203,0.000052441585,0.0011455852,0.0014348166,0.000020451054,0.0017321539,0.0170978],"genre_scores_gemma":[0.9954504,0.00015733417,0.0037627527,0.000025181314,0.000126212,0.00020500115,0.0000677708,0.000070575355,0.00013479496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831736,0.00034351097,0.0004734249,0.0002465448,0.0002872644,0.0003318951],"domain_scores_gemma":[0.99803007,0.00018463664,0.00014723191,0.0014117036,0.00012380484,0.00010255513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007963093,0.00026372678,0.00039598855,0.00009030121,0.00015991581,0.00016436438,0.00039219804,0.00012132475,0.000066101595],"category_scores_gemma":[0.000019460596,0.00024764263,0.000059732083,0.00019683134,0.000046433765,0.00032374778,0.000055710123,0.00035046428,0.000111975605],"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.00016372041,0.00009000748,0.00062527467,0.0003335336,0.00025192843,0.0000018779474,0.00041062714,0.9623254,0.0028632544,0.013646085,0.001900137,0.017388167],"study_design_scores_gemma":[0.0031619223,0.00019113225,0.0032159116,0.000152984,0.00008316141,0.000082983985,0.00023816898,0.9793984,0.0029087765,0.0010459874,0.008795553,0.0007249708],"about_ca_topic_score_codex":0.00037764027,"about_ca_topic_score_gemma":0.00018991865,"teacher_disagreement_score":0.8232901,"about_ca_system_score_codex":0.00020240447,"about_ca_system_score_gemma":0.000020743213,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W2083928447","doi":"10.1007/s11235-010-9278-2","title":"Telecommunications network design with multiple technologies","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":19,"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; Network planning and design; Telecommunications network; Multi-commodity flow problem; Set (abstract data type); Computer network; Channel (broadcasting); Network architecture; Transmission (telecommunications); Minimum-cost flow problem; Flow network; Mathematical optimization; Distributed computing; Telecommunications","score_opus":0.01832450444789481,"score_gpt":0.22878185489332895,"score_spread":0.21045735044543412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083928447","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.027951978,0.0067873104,0.9301166,0.0008611101,0.00057048287,0.001853833,0.0000087263625,0.02240628,0.0094436845],"genre_scores_gemma":[0.6338171,0.0006051812,0.36502427,0.000006716589,0.000030214682,0.0004232362,0.000014112929,0.000048901642,0.000030276724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987276,0.000072445466,0.00040012746,0.00019770645,0.00014947668,0.00045263025],"domain_scores_gemma":[0.9959893,0.00080266217,0.000099817975,0.0029415698,0.000119289914,0.00004736003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036462696,0.00024875897,0.00028932156,0.00011996049,0.00030049268,0.00008937777,0.0016368554,0.0002988396,0.000008293979],"category_scores_gemma":[0.0001818295,0.00021686805,0.00003507065,0.00076504616,0.0003155518,0.00023739696,0.00021751651,0.0011037946,0.00009436613],"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.000012826753,0.00004702218,0.0018914631,0.00003169786,0.00008277008,0.0000013115284,0.00006718084,0.94724494,0.005059236,0.01648341,0.003120976,0.025957143],"study_design_scores_gemma":[0.0008871304,0.00016011583,0.0017087484,0.00017900791,0.000048398455,0.00013650127,0.0014360762,0.7940969,0.0035677282,0.003700088,0.1928304,0.0012489406],"about_ca_topic_score_codex":0.000011439502,"about_ca_topic_score_gemma":0.00013788373,"teacher_disagreement_score":0.6058651,"about_ca_system_score_codex":0.000060063594,"about_ca_system_score_gemma":0.000019942296,"threshold_uncertainty_score":0.8843622},"labels":[],"label_agreement":null},{"id":"W2085676958","doi":"10.1007/s11235-009-9253-y","title":"Special issue on “security for multimedia and ubiquitous applications”","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Cloud Computing and Remote Desktop Technologies","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Multimedia; Computer security; World Wide Web","score_opus":0.014320279174947227,"score_gpt":0.2699012029040273,"score_spread":0.2555809237290801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085676958","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.23979615,0.002683966,0.61472434,0.023431921,0.016298195,0.011985617,0.000059780206,0.009044887,0.081975155],"genre_scores_gemma":[0.9396944,0.00007669967,0.05556519,0.00009847489,0.0039484673,0.00024531232,0.0000114819595,0.000014567427,0.0003454279],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990799,0.000053800355,0.0002603715,0.00029897172,0.00012720675,0.0001797912],"domain_scores_gemma":[0.99758,0.0004512797,0.00015478136,0.0016397488,0.000121501675,0.000052678144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004960246,0.000119126926,0.0001674216,0.000103809914,0.0002918033,0.00018288982,0.0014062249,0.00015231757,0.0000021612761],"category_scores_gemma":[0.00010152435,0.000108430024,0.00003762213,0.00020578215,0.00009295927,0.00007148045,0.0002905223,0.00030184147,0.000052583615],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064858577,0.00013147523,0.00008089638,0.00005371341,0.00001577723,3.1189342e-7,0.0008351885,0.000031254418,0.0014310322,0.11787478,0.018975731,0.86056334],"study_design_scores_gemma":[0.00033494463,0.00007842712,0.0004950289,0.000018310422,0.0000033387578,0.000027127528,0.00011850899,0.10486361,0.0011340681,0.003346924,0.88937575,0.0002039828],"about_ca_topic_score_codex":0.00003458897,"about_ca_topic_score_gemma":0.000015611624,"teacher_disagreement_score":0.8704,"about_ca_system_score_codex":0.000020514075,"about_ca_system_score_gemma":0.000024461257,"threshold_uncertainty_score":0.4421648},"labels":[],"label_agreement":null},{"id":"W2091055510","doi":"10.1007/s11235-013-9814-y","title":"Design and modeling of reliable networks (foreword)","year":2013,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Survivability; Computer science; Multicast; Reliability (semiconductor); Resilience (materials science); Anycast; Process (computing); Network planning and design; Operations research; Computer network; Telecommunications; Routing (electronic design automation); Engineering","score_opus":0.022330693506446772,"score_gpt":0.21604329662151792,"score_spread":0.19371260311507116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091055510","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.18963684,0.014721569,0.7915794,0.000039147548,0.00026890746,0.0006025859,4.257024e-7,0.00023202016,0.002919097],"genre_scores_gemma":[0.9946059,0.0016111435,0.003641261,0.0000061804108,0.00002673452,0.00006229614,0.0000029615787,0.0000126250625,0.000030901392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994608,0.00004869605,0.0002412223,0.000064825246,0.00006597469,0.00011847462],"domain_scores_gemma":[0.9993821,0.00008220926,0.000035004596,0.00040631185,0.000057762445,0.000036655936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002475955,0.000068328554,0.00013039063,0.00004211692,0.00005611027,0.000031963296,0.0002086542,0.00007034903,0.0000087027565],"category_scores_gemma":[0.000007663508,0.00006382578,0.000013350273,0.00011343583,0.000026675158,0.00014946637,0.00003578497,0.00011677251,0.0000148094405],"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":[8.3392945e-7,0.000004597358,0.00012033264,0.00004222221,0.000008101422,2.9311348e-8,0.0002178015,0.998077,0.0003848393,0.00027920646,0.0004749931,0.00039004537],"study_design_scores_gemma":[0.0000689214,0.0000096214635,0.00009583857,0.00006356871,0.0000032092887,0.0000040606787,0.00015859156,0.99898547,0.00011589741,0.0000741538,0.00035092936,0.000069726215],"about_ca_topic_score_codex":0.00019916598,"about_ca_topic_score_gemma":0.0000023468344,"teacher_disagreement_score":0.8049691,"about_ca_system_score_codex":0.000014799527,"about_ca_system_score_gemma":0.0000052355526,"threshold_uncertainty_score":0.26027396},"labels":[],"label_agreement":null},{"id":"W2092420525","doi":"10.1007/s11235-006-5522-1","title":"A Sequential Algorithm for Constructing Delay-Constrained Multirings for Multipoint-to-Multipoint Communications","year":2006,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Polytechnique Montréal","funders":"","keywords":"Computer science; Multicast; Scalability; Convergence (economics); Network packet; Topology (electrical circuits); Reliability (semiconductor); Algorithm; Distributed computing; Set (abstract data type); Relaxation (psychology); Network topology; Ring (chemistry); Computer network; Mathematics","score_opus":0.022023687839889238,"score_gpt":0.268245008322115,"score_spread":0.24622132048222578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092420525","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028240352,0.0007959882,0.98976964,0.0001447933,0.00044114835,0.004164762,0.00023427902,0.0009861209,0.00063921744],"genre_scores_gemma":[0.44542196,0.00004994615,0.55108964,0.000020574402,0.00017332993,0.0024842834,0.0006029523,0.00009201619,0.00006529569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979506,0.000104688625,0.0010010805,0.00030688703,0.00014974774,0.00048700452],"domain_scores_gemma":[0.9967143,0.0008533836,0.00027175326,0.0015774182,0.00047445347,0.00010869627],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005285729,0.0003129119,0.00042455437,0.00021513607,0.00043373575,0.00013473471,0.00088258367,0.00017856206,0.0000036064189],"category_scores_gemma":[0.000098773526,0.00037607487,0.00014422809,0.00035090244,0.00012269242,0.00028555217,0.00014442476,0.00021563515,0.000015651882],"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.000019810032,0.00006921435,0.000080769285,0.00014469912,0.00009401788,2.2410187e-7,0.00039945167,0.8996455,0.008909195,0.004186233,0.0008229549,0.085627906],"study_design_scores_gemma":[0.0015447609,0.00003288727,0.000023550056,0.00012748435,0.000034544028,0.000025051148,0.00047177225,0.97095877,0.0017298913,0.00012030485,0.024525203,0.0004057861],"about_ca_topic_score_codex":0.0001453704,"about_ca_topic_score_gemma":0.00012928569,"teacher_disagreement_score":0.44259793,"about_ca_system_score_codex":0.00032514808,"about_ca_system_score_gemma":0.000039052542,"threshold_uncertainty_score":0.9998691},"labels":[],"label_agreement":null},{"id":"W2092868439","doi":"10.1007/s11235-008-9102-4","title":"Software agent-based directed diffusion in wireless sensor network","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":32,"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 Guelph; Acadia University","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Efficient energy use; Sensor node; Bandwidth (computing); Node (physics); Energy consumption; Distributed computing; Key distribution in wireless sensor networks; Mobile agent; Wireless; Wireless network; Telecommunications","score_opus":0.02400863825753082,"score_gpt":0.23250289206027308,"score_spread":0.20849425380274225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092868439","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.5684885,0.001474744,0.42500106,0.0004002271,0.00097266363,0.0006399249,0.0000024829626,0.0018832404,0.0011372212],"genre_scores_gemma":[0.96450716,0.00024918435,0.034409635,0.00017588434,0.00011324613,0.00010232599,0.00005146101,0.00003671546,0.0003544106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967648,0.00095251325,0.0007168652,0.0005131106,0.0004736485,0.00057910447],"domain_scores_gemma":[0.9961632,0.0006365507,0.00035535297,0.0025227817,0.00018839454,0.00013374472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005909636,0.00027059278,0.0004203514,0.00023164754,0.0004392172,0.00010985539,0.0020124726,0.00020013351,0.0000065152963],"category_scores_gemma":[0.000060061244,0.00027412616,0.000091654714,0.0015831222,0.000094768046,0.0002440054,0.00037013265,0.00038596426,0.000080035476],"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.000023971672,0.00040148315,0.04419412,0.000043471806,0.000021299715,0.000056016164,0.0006954159,0.941677,0.00068236334,0.0036358992,0.0026181198,0.005950859],"study_design_scores_gemma":[0.0007404061,0.00003555427,0.023179185,0.000221469,0.0000033531892,0.000047216075,0.000028142114,0.9691267,0.00016839182,0.00000978209,0.0060509876,0.0003888219],"about_ca_topic_score_codex":0.0004415377,"about_ca_topic_score_gemma":0.0001254485,"teacher_disagreement_score":0.39601868,"about_ca_system_score_codex":0.00022283876,"about_ca_system_score_gemma":0.00009921528,"threshold_uncertainty_score":0.9999711},"labels":[],"label_agreement":null},{"id":"W2095289231","doi":"10.1007/s11235-005-6630-z","title":"Class-Based Packet Scheduling to Improve QoS for IP Video","year":2005,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":7,"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; Packet loss; Computer network; Router; Quality of service; Network packet; Video quality; Scheduling (production processes); Real-time computing","score_opus":0.03758752649982211,"score_gpt":0.30165557560640177,"score_spread":0.26406804910657966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095289231","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.011683814,0.00085554516,0.9713903,0.012606282,0.0004858354,0.0008391725,0.0000060012594,0.0014217116,0.00071132125],"genre_scores_gemma":[0.8336399,0.000018465664,0.16466801,0.00058100827,0.00012119492,0.0006594072,0.0000053391577,0.000014645597,0.00029199754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850863,0.0001209699,0.0004482508,0.00038345074,0.00021965939,0.00031903535],"domain_scores_gemma":[0.9965615,0.00033284925,0.00021688259,0.0025656107,0.00022954066,0.00009356319],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007521053,0.00016413102,0.00023719837,0.00021921445,0.00030860363,0.00032548077,0.0027794905,0.00012880968,0.0000021939445],"category_scores_gemma":[0.0002424611,0.00015195622,0.00008479663,0.000414089,0.000027608126,0.00032172145,0.00042487957,0.00018753122,0.00013802988],"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.000038688606,0.00022779468,0.0002831865,0.00013273323,0.00004632521,4.3241485e-7,0.0006657045,0.03337242,0.033264607,0.116157666,0.018795319,0.79701513],"study_design_scores_gemma":[0.0005881573,0.0001401357,0.00010489342,0.00015545824,0.0000059462004,0.0000041411818,0.00016524215,0.6185802,0.040665824,0.00059424865,0.33866638,0.0003293486],"about_ca_topic_score_codex":0.000027855007,"about_ca_topic_score_gemma":0.000010850044,"teacher_disagreement_score":0.8219561,"about_ca_system_score_codex":0.00012374054,"about_ca_system_score_gemma":0.000081774924,"threshold_uncertainty_score":0.6196595},"labels":[],"label_agreement":null},{"id":"W2100906340","doi":"10.1007/s11235-010-9373-4","title":"CAPEX/OPEX effective optical wide area network design","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":10,"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é de Sherbrooke; Concordia University; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Dimensioning; Computer science; Network planning and design; Provisioning; Operating expense; Heuristic; Computer network; Rounding; Focus (optics)","score_opus":0.015090022257215044,"score_gpt":0.23175449461817518,"score_spread":0.21666447236096015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100906340","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.039719597,0.0022874016,0.9343949,0.00019455067,0.0011591932,0.001536014,0.000002583501,0.0039295657,0.01677619],"genre_scores_gemma":[0.86410606,0.00016589617,0.13505004,0.000022837778,0.00011487299,0.00042379522,0.0000101771275,0.00005477488,0.00005157646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986562,0.00010307981,0.0003750859,0.00019724779,0.00015277298,0.0005155828],"domain_scores_gemma":[0.99684155,0.0014862255,0.00006252909,0.0014132184,0.00008512798,0.000111343565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062247174,0.00022498114,0.0003160276,0.000063705535,0.00014390564,0.00007120103,0.0007822108,0.0002862809,0.00002026316],"category_scores_gemma":[0.00036469492,0.00021593347,0.000051618932,0.00037821985,0.00015232104,0.00017203354,0.00014568502,0.0009102217,0.00020404908],"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.000016276941,0.000035256337,0.0008748633,0.000046488785,0.00008866159,0.0000038790163,0.00007808813,0.9426096,0.0072608064,0.019346524,0.005609003,0.024030566],"study_design_scores_gemma":[0.00082690286,0.0001753646,0.006386171,0.00024116658,0.00006491372,0.0000926941,0.00026029046,0.8755938,0.0043740342,0.0051833238,0.10554362,0.001257735],"about_ca_topic_score_codex":0.0000073583806,"about_ca_topic_score_gemma":0.00002131622,"teacher_disagreement_score":0.8243864,"about_ca_system_score_codex":0.00010396186,"about_ca_system_score_gemma":0.000012779367,"threshold_uncertainty_score":0.88055116},"labels":[],"label_agreement":null},{"id":"W2123693629","doi":"10.1007/s11235-015-0001-1","title":"Mobility for heterogeneous SmallNets","year":2015,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","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":"InterDigital (Canada)","funders":"","keywords":"Computer science; Computer network; Cellular network; Mobility management; Mobility model; Proxy Mobile IPv6; Mobile IP; Protocol (science); Core network; Distributed computing; Mobile computing","score_opus":0.048735622328409944,"score_gpt":0.26464150844606654,"score_spread":0.2159058861176566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123693629","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.89151174,0.028921157,0.054969884,0.00014953165,0.0045597497,0.004944007,0.0001157156,0.002842346,0.0119858775],"genre_scores_gemma":[0.9978423,0.00008209284,0.00093182427,0.000026987265,0.00021056175,0.00064540794,0.00009179807,0.000055006632,0.000113996655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985071,0.00019991495,0.0005306498,0.0002260266,0.00019422645,0.00034210068],"domain_scores_gemma":[0.99759674,0.00021062553,0.00009178083,0.0017020857,0.00023101059,0.00016775208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012300409,0.00020353387,0.00032483187,0.000056464727,0.000091837355,0.0000836692,0.0006555874,0.00017261266,0.000009159759],"category_scores_gemma":[0.000081346836,0.00021923105,0.000092772374,0.00016412948,0.000050569564,0.00015065432,0.000102185455,0.00019945006,0.00007591056],"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.0002417712,0.00074882,0.0052462225,0.0016262906,0.00046340236,0.0000034376003,0.005593315,0.93288374,0.0013778673,0.0036809617,0.0280512,0.020082995],"study_design_scores_gemma":[0.0018118537,0.00015780977,0.0007569107,0.00006886138,0.000052643147,0.00005160931,0.00039606422,0.73784065,0.0014542888,0.0009506631,0.25576946,0.00068919285],"about_ca_topic_score_codex":0.0001343584,"about_ca_topic_score_gemma":0.00018084618,"teacher_disagreement_score":0.22771825,"about_ca_system_score_codex":0.0003471885,"about_ca_system_score_gemma":0.00003562642,"threshold_uncertainty_score":0.89399827},"labels":[],"label_agreement":null},{"id":"W2139079053","doi":"10.1007/s11235-009-9201-x","title":"A new structure-preserving method of sampling for predicting self-similar traffic","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":11,"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 à Montréal","funders":"","keywords":"Computer science; Autoregressive integrated moving average; Sampling (signal processing); Internet traffic; Data mining; Self-similarity; Systematic sampling; Stratified sampling; Bandwidth (computing); Traffic generation model; Real-time computing; The Internet; Time series; Statistics; Machine learning; Computer network; Telecommunications; Detector; Mathematics","score_opus":0.027796069818095452,"score_gpt":0.29910364441144,"score_spread":0.27130757459334454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139079053","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.0042298497,0.0015734915,0.9914767,0.0010232663,0.00025123497,0.00064324995,0.000004076257,0.00045291902,0.0003452069],"genre_scores_gemma":[0.58409667,0.000020117755,0.4156321,0.00006427815,0.00011665175,0.000016085765,0.000005560633,0.000006960741,0.000041548938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983956,0.00026827006,0.000583337,0.00027934366,0.00022039715,0.00025306008],"domain_scores_gemma":[0.99727136,0.00070950686,0.00040218807,0.0013069857,0.00021260949,0.000097337965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009205797,0.00014941319,0.000322622,0.000108864886,0.00019089665,0.00013624868,0.0017800038,0.00010144091,0.000004048807],"category_scores_gemma":[0.000084133055,0.00014692648,0.0000940266,0.00037186325,0.0000074535715,0.00031920013,0.000098218574,0.00016002721,0.000001412005],"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.000017660974,0.000047895795,0.000077555655,0.00006069975,0.00007519888,1.6823707e-7,0.0020578995,0.14704438,0.0014681068,0.040725216,0.0011297077,0.8072955],"study_design_scores_gemma":[0.000623897,0.00009859174,0.00029497955,0.00009068241,0.000023560146,0.00001573986,0.00010154379,0.9896876,0.00014807498,0.00074515416,0.008017047,0.00015312378],"about_ca_topic_score_codex":0.000025108353,"about_ca_topic_score_gemma":0.0000104913815,"teacher_disagreement_score":0.8426432,"about_ca_system_score_codex":0.000048430808,"about_ca_system_score_gemma":0.00012581058,"threshold_uncertainty_score":0.5991488},"labels":[],"label_agreement":null},{"id":"W2140861183","doi":"10.1007/s11235-008-9082-4","title":"Resource planning and incentive engineering for a congested wireless access point: an integrated multiple time scale control mechanism","year":2008,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Networks and Protocols","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":"University of British Columbia","funders":"","keywords":"Computer science; Resource allocation; Incentive; Wireless network; Computer network; Resource management (computing); Wireless; Resource (disambiguation); Distributed computing; Telecommunications","score_opus":0.03034391270146051,"score_gpt":0.26884124174864144,"score_spread":0.23849732904718093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140861183","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.08689088,0.0003230808,0.9061253,0.0001994857,0.00008074,0.0058135935,0.000019179291,0.0004381749,0.00010953485],"genre_scores_gemma":[0.9896606,0.000011030066,0.006975881,0.000096119,0.000058761754,0.0030467222,0.000047201782,0.000026324871,0.00007736115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985206,0.0002975583,0.00040066394,0.00033783136,0.00015526514,0.00028805627],"domain_scores_gemma":[0.99793375,0.0005905425,0.00024919285,0.00089890545,0.00020008079,0.00012756133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006317555,0.0001911816,0.00035218714,0.00011823363,0.00030480963,0.00032311288,0.0013399777,0.00012538342,0.000001283672],"category_scores_gemma":[0.000038088743,0.00018386681,0.000039738887,0.00029458242,0.000043189317,0.00080331013,0.00023549139,0.00020199314,0.0000043538103],"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.0029620344,0.0029241957,0.060918715,0.0024816948,0.0019730371,0.00012542399,0.09857724,0.4168412,0.111542344,0.1336656,0.018246384,0.14974211],"study_design_scores_gemma":[0.0013892732,0.00010757873,0.0010812018,0.00021970246,0.000005806912,0.000035590812,0.00010191421,0.99024004,0.0006510427,0.00003603191,0.0058955853,0.00023622272],"about_ca_topic_score_codex":0.00012101449,"about_ca_topic_score_gemma":0.000008675015,"teacher_disagreement_score":0.90276974,"about_ca_system_score_codex":0.00006082759,"about_ca_system_score_gemma":0.000042826363,"threshold_uncertainty_score":0.7497871},"labels":[],"label_agreement":null},{"id":"W2142892844","doi":"10.1007/s11235-009-9176-7","title":"Energy efficient virtual MIMO communication for wireless sensor networks","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"MIMO; Computer science; Multi-user MIMO; 3G MIMO; Computer network; Wireless sensor network; Efficient energy use; Node (physics); Routing protocol; Wireless; Routing (electronic design automation); Telecommunications; Channel (broadcasting); Electrical engineering","score_opus":0.011025988795414915,"score_gpt":0.23106753519249673,"score_spread":0.22004154639708182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142892844","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.0044577257,0.0040325294,0.98693264,0.00011850565,0.00035118317,0.00075261353,0.000012876366,0.0008914947,0.0024504596],"genre_scores_gemma":[0.99102336,0.000688484,0.0071648876,0.000060000526,0.00013116703,0.00030424687,0.00032726742,0.00006636322,0.00023421957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984194,0.00019671555,0.0007079559,0.00020750937,0.0001405928,0.00032783317],"domain_scores_gemma":[0.99759656,0.00028850243,0.00020952782,0.0015808998,0.0002356577,0.00008882478],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043948952,0.00024458647,0.00034436415,0.00014411582,0.00025693697,0.00009634176,0.0006399737,0.00019545028,0.0000037145956],"category_scores_gemma":[0.000023379645,0.000271562,0.00008208169,0.0003439628,0.00003643386,0.00016461778,0.000039695424,0.00017340448,0.000013002482],"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.000011686478,0.000039200888,0.0000058997334,0.000020672658,0.00002295973,1.0504285e-7,0.00017686948,0.969114,0.0014546919,0.015232253,0.00067020307,0.013251468],"study_design_scores_gemma":[0.00039382125,0.000054716777,0.000038007798,0.00010906258,0.000015487278,0.00001072301,0.00035799117,0.9907162,0.00046244846,0.00005430382,0.0074971793,0.00029002235],"about_ca_topic_score_codex":0.000033615568,"about_ca_topic_score_gemma":0.000018735453,"teacher_disagreement_score":0.98656565,"about_ca_system_score_codex":0.00024740605,"about_ca_system_score_gemma":0.000015050964,"threshold_uncertainty_score":0.99997365},"labels":[],"label_agreement":null},{"id":"W2146117534","doi":"10.1007/s11235-010-9299-x","title":"A Lyapunov-Krasovskii stability analysis for game-theoretic based power control in optical links","year":2010,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Optical Network Technologies","field":"Engineering","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 Toronto","funders":"","keywords":"Computer science; Control theory (sociology); SIGNAL (programming language); Stability (learning theory); Lyapunov function; Power control; Power (physics); Control (management); Nonlinear system; Physics; Artificial intelligence","score_opus":0.012030461090934334,"score_gpt":0.23838988076704568,"score_spread":0.22635941967611134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146117534","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.73435706,0.0003981097,0.2588417,0.0006199904,0.00029459887,0.0014056765,0.00003367413,0.0012625478,0.0027866403],"genre_scores_gemma":[0.9856707,0.000014063093,0.013824167,0.000033836608,0.000024553823,0.00035796844,0.00003226926,0.000037076752,0.0000053701247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998498,0.000109076806,0.00062987494,0.00023667219,0.00015580651,0.0003705591],"domain_scores_gemma":[0.996575,0.001360136,0.00007160165,0.0017839045,0.00013361294,0.00007574334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011952451,0.000196238,0.00050006504,0.00027914706,0.00004703017,0.00007783619,0.0007280605,0.0005125707,0.00006150282],"category_scores_gemma":[0.000456193,0.00018985626,0.00015690537,0.0008336358,0.00018906052,0.00008737545,0.00005141094,0.00089824846,0.000023647575],"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.00025352082,0.000904483,0.114993304,0.0006909482,0.0013478326,0.000003924123,0.00086925586,0.55444896,0.02517762,0.2946253,0.00047996643,0.006204852],"study_design_scores_gemma":[0.00078655966,0.000044627406,0.010173481,0.00002001358,0.000097791075,0.0000010923192,0.00014777218,0.9859383,0.00040078515,0.00048280216,0.0016642159,0.00024252862],"about_ca_topic_score_codex":0.000018699267,"about_ca_topic_score_gemma":0.00013903281,"teacher_disagreement_score":0.43148935,"about_ca_system_score_codex":0.00011002755,"about_ca_system_score_gemma":0.000024345356,"threshold_uncertainty_score":0.77421135},"labels":[],"label_agreement":null},{"id":"W2208872871","doi":"10.1007/s11235-015-0101-y","title":"Efficient handover with optimized localized routing for Proxy Mobile IPv6","year":2015,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Carleton University","funders":"","keywords":"Proxy Mobile IPv6; Computer network; Computer science; Mobility management; Handover; Packet loss; Mobile IP; Routing protocol; Triangular routing; Routing (electronic design automation); Network packet; Link-state routing protocol","score_opus":0.0211095199397109,"score_gpt":0.24973764169309998,"score_spread":0.2286281217533891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2208872871","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.3799808,0.011489929,0.5829046,0.00007807685,0.0019359263,0.011121954,0.00006333746,0.002604289,0.00982111],"genre_scores_gemma":[0.9896019,0.000029606183,0.007697285,0.000019687923,0.00016026794,0.002126437,0.000085017746,0.00009023261,0.000189582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805653,0.00023143456,0.00063663576,0.00028688504,0.000331072,0.00045743253],"domain_scores_gemma":[0.9975927,0.00029366897,0.0001868938,0.0014030704,0.00035114313,0.0001725607],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015865014,0.00028531396,0.0005181106,0.00008434087,0.00015162987,0.00014468534,0.00056707056,0.00016466042,0.0000093872095],"category_scores_gemma":[0.00007446271,0.00025397484,0.00008778168,0.000318111,0.00007401749,0.0001092787,0.000105966545,0.00026533072,0.00003826902],"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.00022503253,0.000106675725,0.0002407656,0.0001714309,0.000085804924,5.0716426e-7,0.001502632,0.9956254,0.000092279486,0.00035266083,0.0009850651,0.0006117401],"study_design_scores_gemma":[0.0046822946,0.00012100363,0.000025713582,0.00013800248,0.00004848803,0.00001471301,0.00076522183,0.97068495,0.00033727306,0.000019739824,0.022823539,0.0003390755],"about_ca_topic_score_codex":0.00012587737,"about_ca_topic_score_gemma":0.000031473213,"teacher_disagreement_score":0.6096211,"about_ca_system_score_codex":0.00041575462,"about_ca_system_score_gemma":0.00007170549,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W2314484518","doi":"10.1007/s11235-016-0156-4","title":"ICT and renewable energy: a way forward to the next generation telecom base stations","year":2016,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":86,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Renewable energy; Information and Communications Technology; Computer science; Telecommunications; Efficient energy use; Environmental economics; Scope (computer science); Greenhouse gas; Business; Electrical engineering; Engineering; Economics; World Wide Web","score_opus":0.04285820960863718,"score_gpt":0.22756587370632989,"score_spread":0.1847076640976927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314484518","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.07514183,0.004413044,0.894425,0.00756887,0.0015690593,0.0010503846,0.00004373683,0.0011389672,0.014649149],"genre_scores_gemma":[0.9944431,0.0008647159,0.0014805101,0.00017874823,0.00023308893,0.0005306021,0.000037022448,0.000043894725,0.0021882716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989621,0.00014927407,0.00033296258,0.0001726254,0.00016331549,0.00021973126],"domain_scores_gemma":[0.9984954,0.0001640646,0.000055029752,0.001121105,0.000074952964,0.00008947239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004172726,0.0001482982,0.00014446856,0.00013046773,0.00022049372,0.0001524692,0.00038978,0.000049757844,0.00003101245],"category_scores_gemma":[0.000042582302,0.0000997267,0.000028901986,0.0002698442,0.000022236243,0.00026494026,0.00011499798,0.000052011645,0.00007833082],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069127536,0.0000319502,0.00033343004,0.00004383855,0.00015033061,7.461561e-7,0.0006929835,0.65665406,0.032164834,0.008453637,0.25882727,0.042639997],"study_design_scores_gemma":[0.00030238877,0.000032388052,0.0008987847,0.000055308996,0.000021811327,0.0000063673538,0.00022731011,0.19473596,0.0026990408,0.00005232702,0.8007253,0.00024306487],"about_ca_topic_score_codex":0.000914728,"about_ca_topic_score_gemma":0.0020611957,"teacher_disagreement_score":0.91930133,"about_ca_system_score_codex":0.00015175153,"about_ca_system_score_gemma":0.00001264715,"threshold_uncertainty_score":0.40667367},"labels":[],"label_agreement":null},{"id":"W2512081383","doi":"10.1007/s11235-016-0216-9","title":"Towards the fulfillment of 5G network requirements: technologies and challenges","year":2016,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Key (lock); Low latency (capital markets); Telecommunications; Latency (audio); Energy consumption; Network architecture; The Internet; Computer network; Computer security; World Wide Web","score_opus":0.06635043406672611,"score_gpt":0.25849279917490464,"score_spread":0.19214236510817853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512081383","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04804371,0.79901296,0.08644364,0.028406097,0.0006983736,0.0024180622,0.00003393445,0.010126514,0.024816703],"genre_scores_gemma":[0.82308865,0.17483637,0.0018034801,0.0000042794622,0.000009850578,0.00021597587,0.0000015168073,0.000018924067,0.000020984015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999041,0.00009459184,0.0004142753,0.0001187721,0.00014014552,0.00019118475],"domain_scores_gemma":[0.99732083,0.00029040573,0.00016327282,0.0021301587,0.000081083504,0.000014232458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044782204,0.00013855136,0.00022196966,0.00007540167,0.000106725674,0.00001565657,0.0011762241,0.00011682209,0.000003045412],"category_scores_gemma":[0.00010357117,0.00008227463,0.000026853078,0.00019279247,0.00029805608,0.00015957085,0.00033600416,0.00012918691,0.000008159355],"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.000004300244,0.000019261137,0.00021942091,0.00013939329,0.000094658004,1.1496647e-7,0.00032932576,0.0028873445,0.0048792996,0.09333176,0.00045920283,0.89763594],"study_design_scores_gemma":[0.002256603,0.0003570484,0.013229907,0.0028737145,0.000071712646,0.000060125873,0.03607851,0.010682772,0.081442736,0.03756567,0.81374323,0.0016379958],"about_ca_topic_score_codex":0.000008495178,"about_ca_topic_score_gemma":0.000014139937,"teacher_disagreement_score":0.89599794,"about_ca_system_score_codex":0.000079674755,"about_ca_system_score_gemma":0.000007817859,"threshold_uncertainty_score":0.3355062},"labels":[],"label_agreement":null},{"id":"W2570766309","doi":"10.1007/s11235-016-0264-1","title":"SDN-based wireless user management system","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Quality of service; Wireless network; Throughput; IEEE 802.11; Session (web analytics); Wireless; Service set; Wi-Fi; Telecommunications; World Wide Web","score_opus":0.031282637210681204,"score_gpt":0.28629062051109405,"score_spread":0.25500798330041285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570766309","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.006405827,0.00037124637,0.9080002,0.001273028,0.0011230315,0.00819981,0.0000045653182,0.001028874,0.07359345],"genre_scores_gemma":[0.98595583,0.000018968542,0.009203201,0.000084502295,0.000097009186,0.0038195641,0.000006274958,0.000019471408,0.00079519214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829143,0.00029770104,0.00043110523,0.00034355363,0.0003311435,0.00030505043],"domain_scores_gemma":[0.9928911,0.000084225125,0.0005547622,0.0062412377,0.00012883871,0.0000998775],"candidate_categories":["scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009661214,0.00017813045,0.00027044522,0.00008659372,0.0010649576,0.0014163397,0.0055537317,0.0000964127,0.000003754184],"category_scores_gemma":[0.000005819269,0.00016485747,0.00007707924,0.00012813325,0.000058323174,0.0005061706,0.0006981191,0.00016282145,0.00021229073],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020166526,0.0001557622,0.008676554,0.0008477704,0.00011190497,0.000025755231,0.00018628164,0.0055992007,0.00008569355,0.9077305,0.005792209,0.07076819],"study_design_scores_gemma":[0.001181134,0.00005309593,0.020023003,0.0009663302,0.000014378178,0.00001757687,0.000099221696,0.70924395,0.0002601632,0.00006698961,0.2675785,0.0004956732],"about_ca_topic_score_codex":0.0002653846,"about_ca_topic_score_gemma":0.000018324343,"teacher_disagreement_score":0.97955,"about_ca_system_score_codex":0.00012817238,"about_ca_system_score_gemma":0.000039169256,"threshold_uncertainty_score":0.99982667},"labels":[],"label_agreement":null},{"id":"W2571084045","doi":"10.1007/s11235-016-0268-x","title":"Neighbor discovery and routing schemes for mobile ad-hoc networks with beamwidth adaptive smart antennas","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Neighbor Discovery Protocol; Beamwidth; Wireless ad hoc network; Node (physics); Distributed computing; Directional antenna; Topology control; Geographic routing; Throughput; Routing protocol; Adaptive quality of service multi-hop routing; Routing (electronic design automation); Dynamic Source Routing; Wireless; Wireless network; Telecommunications; The Internet; Key distribution in wireless sensor networks","score_opus":0.023712279909021822,"score_gpt":0.2625323440612145,"score_spread":0.23882006415219267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571084045","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.017951578,0.012916855,0.96566427,0.00022925544,0.0003373214,0.001723155,0.000007150565,0.00021468133,0.0009557516],"genre_scores_gemma":[0.96968585,0.0009867869,0.02766998,0.000065262524,0.00013447437,0.000925286,0.000015808846,0.000035686717,0.00048088047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982517,0.00016316258,0.00042757165,0.0005144463,0.0002094393,0.00043367708],"domain_scores_gemma":[0.99507,0.0004577051,0.0007336367,0.0034203148,0.00020426033,0.000114092865],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008557087,0.0002510237,0.00039108272,0.000055759323,0.0011655879,0.0015047952,0.0023693612,0.00012485821,9.185047e-7],"category_scores_gemma":[0.00004723402,0.00021148231,0.00006245085,0.00013111599,0.00018290435,0.001759914,0.0008439482,0.0002652374,0.00000419784],"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.0006581642,0.00057620544,0.043808755,0.00033497676,0.0008893177,0.00001710578,0.004824118,0.022188593,0.00047876057,0.22142226,0.003175433,0.7016263],"study_design_scores_gemma":[0.0010877596,0.00046522944,0.004980304,0.00042039258,0.000026766875,0.000041146955,0.00041014055,0.95535785,0.000060961447,0.00012940315,0.036549464,0.0004705668],"about_ca_topic_score_codex":0.00007527403,"about_ca_topic_score_gemma":0.00014142453,"teacher_disagreement_score":0.95173424,"about_ca_system_score_codex":0.00007671567,"about_ca_system_score_gemma":0.000073338255,"threshold_uncertainty_score":0.99953175},"labels":[],"label_agreement":null},{"id":"W2591806793","doi":"10.1007/s11235-017-0298-z","title":"A compendium of optimization techniques for green radio resource management","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced MIMO Systems Optimization","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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Compendium; Efficient energy use; Telecommunications; Wireless; Relay; Radio resource management; Key (lock); Resource (disambiguation); Resource allocation; Wireless network; Computer network; Power (physics); Computer security; Electrical engineering","score_opus":0.020101798694785195,"score_gpt":0.2657967257931304,"score_spread":0.2456949270983452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591806793","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.00012932834,0.00056732824,0.9714285,0.00006829169,0.00013539204,0.001496994,0.00001713316,0.0004381771,0.025718816],"genre_scores_gemma":[0.84739286,0.00024572544,0.15092832,0.000004113476,0.000070601374,0.0005639077,0.00012818536,0.00006510749,0.00060119526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906963,0.000053202853,0.0004923489,0.00013295998,0.00010479024,0.00014709283],"domain_scores_gemma":[0.99773306,0.00005709406,0.00036773464,0.0016863181,0.00012174026,0.00003405863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003940551,0.00013365614,0.00025732722,0.00013077194,0.0002433032,0.00006508194,0.00079426164,0.00008619717,0.0000036723793],"category_scores_gemma":[0.000020872081,0.00014899804,0.000049659557,0.00006992701,0.000046770543,0.0002685353,0.00009074379,0.00006725933,0.0000034852471],"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.000016079503,0.00002694116,0.00008724008,0.0008082543,0.00009082597,2.4990885e-7,0.00022763562,0.9809822,0.00080423086,0.0073834276,0.0009255231,0.008647385],"study_design_scores_gemma":[0.0005760646,0.000048359976,0.00014379177,0.00041587008,0.000046564805,0.000009248245,0.0004572959,0.94981146,0.0042617815,0.000107338354,0.04379181,0.00033040077],"about_ca_topic_score_codex":0.000060769442,"about_ca_topic_score_gemma":0.000007740056,"teacher_disagreement_score":0.8472635,"about_ca_system_score_codex":0.00010513817,"about_ca_system_score_gemma":0.0000051358206,"threshold_uncertainty_score":0.6075964},"labels":[],"label_agreement":null},{"id":"W27050043","doi":"10.1023/a:1026175115474","title":"Experimenting with Feature Interaction Management in SIP Environment","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","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":"Université de Sherbrooke","funders":"","keywords":"Computer science; Component (thermodynamics); Telephony; Context (archaeology); Computer network; Architecture; Distributed computing","score_opus":0.011440126448695482,"score_gpt":0.22069128595994994,"score_spread":0.20925115951125445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27050043","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.8263732,0.016229497,0.018991906,0.00010750436,0.0013671118,0.003125298,0.0000041733183,0.0008172342,0.13298407],"genre_scores_gemma":[0.99709296,0.00038737344,0.0018560836,0.000012581523,0.000028695726,0.0003144225,0.000020357616,0.000034651348,0.00025288644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99891406,0.00020364253,0.00029365052,0.00018453304,0.00017011202,0.00023398834],"domain_scores_gemma":[0.99895275,0.000047851216,0.00007777014,0.00086932676,0.000013043194,0.00003928641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044487262,0.00016588514,0.00018163565,0.00009637635,0.00006609679,0.00006251363,0.00023213476,0.000080421705,0.00003371842],"category_scores_gemma":[0.0000037134878,0.00016666487,0.00002737367,0.00017122796,0.000020739675,0.0001898076,0.000048096616,0.0002878775,0.000048600385],"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.0001409834,0.00097058003,0.019558107,0.0012362627,0.0006802196,0.000028692275,0.011134921,0.9229013,0.0049663708,0.014808583,0.003359493,0.020214496],"study_design_scores_gemma":[0.0054805675,0.00018925383,0.016393302,0.0010776584,0.00012926944,0.00013157036,0.019219141,0.23869398,0.009606574,0.00017872993,0.7068704,0.0020295766],"about_ca_topic_score_codex":0.000033804867,"about_ca_topic_score_gemma":0.000040650495,"teacher_disagreement_score":0.7035109,"about_ca_system_score_codex":0.0004344951,"about_ca_system_score_gemma":0.0000037766274,"threshold_uncertainty_score":0.67963964},"labels":[],"label_agreement":null},{"id":"W2756470574","doi":"10.1007/s11235-017-0384-2","title":"Pricing strategies and categories for LTE networks","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Wireless Network Optimization","field":"Engineering","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":"Mount Allison University","funders":"","keywords":"Computer science; Quality of service; Operator (biology); Revenue; Dynamic pricing; Pricing strategies; The Internet; Computer network; Service (business); Service provider; Order (exchange); World Wide Web; Business; Marketing","score_opus":0.01994829504468875,"score_gpt":0.26146672756077216,"score_spread":0.2415184325160834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756470574","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.010621048,0.00478493,0.97899294,0.000040658688,0.00037058067,0.00048152974,0.0000020618438,0.00034557984,0.0043606507],"genre_scores_gemma":[0.9914562,0.002420037,0.0056987084,0.000004421613,0.0001295231,0.00016254428,0.00003190201,0.000035754038,0.000060876264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945587,0.000023148976,0.00021129237,0.00009931509,0.000049227685,0.0001611719],"domain_scores_gemma":[0.9988461,0.00013681702,0.00012912147,0.00080202596,0.000053112577,0.00003281103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018667102,0.000108684166,0.0001568727,0.000032226777,0.0004994939,0.0004884291,0.000322022,0.00007278877,9.563965e-7],"category_scores_gemma":[0.000029556491,0.00011459511,0.000017114977,0.00003604788,0.000056285695,0.0007014695,0.000053017826,0.00009422286,0.0000014708334],"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.0000032251535,0.000002671839,0.00023503638,0.00006849529,0.000018370707,7.499986e-8,0.00020326472,0.98062235,0.00008047614,0.009519376,0.00012254942,0.009124103],"study_design_scores_gemma":[0.00019746223,0.000010230297,0.0009741891,0.000046502402,0.000008413177,0.0000032178943,0.00054352573,0.9909731,0.000047975736,0.00027631526,0.006777823,0.00014120377],"about_ca_topic_score_codex":0.00003435398,"about_ca_topic_score_gemma":0.00003754115,"teacher_disagreement_score":0.9808352,"about_ca_system_score_codex":0.000037644124,"about_ca_system_score_gemma":0.0000092453,"threshold_uncertainty_score":0.4709933},"labels":[],"label_agreement":null},{"id":"W2760547342","doi":"10.1007/s11235-017-0395-z","title":"An auto-learning approach for network intrusion detection","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Network Security and Intrusion Detection","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":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Intrusion detection system; Artificial intelligence; Machine learning","score_opus":0.029718583362985284,"score_gpt":0.27887151467913823,"score_spread":0.24915293131615296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760547342","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.0101180915,0.0002963171,0.98436224,0.000121350124,0.00093987247,0.00060266495,5.620715e-7,0.00048891554,0.003069983],"genre_scores_gemma":[0.9643858,0.00010856921,0.034341235,0.000032399967,0.0006955,0.00023916482,0.000021329013,0.000017789082,0.00015821226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833614,0.00043125582,0.00036711327,0.00037144645,0.0001999524,0.00029411458],"domain_scores_gemma":[0.9963601,0.00009803526,0.00057742593,0.0026692643,0.00020106544,0.000094107316],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001750605,0.00014656437,0.0002081055,0.00007964258,0.0032252609,0.0011604305,0.0023952867,0.00017056524,0.0000031551522],"category_scores_gemma":[0.00009961971,0.00014744852,0.0000728835,0.00016158035,0.00005153818,0.0014075082,0.0003607667,0.00031865147,0.000016620143],"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.00009762805,0.00027334914,0.00090903277,0.00013312006,0.00006450254,5.42938e-7,0.0016033116,0.123361155,0.011445001,0.07209105,0.0011919504,0.7888294],"study_design_scores_gemma":[0.0002749361,0.00019613189,0.0014239878,0.000026270007,0.0000057164057,0.000012957666,0.00004729791,0.9528068,0.00043760426,0.00059935165,0.043988887,0.00018005734],"about_ca_topic_score_codex":0.00021002005,"about_ca_topic_score_gemma":0.000035557034,"teacher_disagreement_score":0.95426774,"about_ca_system_score_codex":0.000082909835,"about_ca_system_score_gemma":0.000028826415,"threshold_uncertainty_score":0.99987644},"labels":[],"label_agreement":null},{"id":"W2765850923","doi":"10.1007/s11235-017-0392-2","title":"Optimized design and availability analysis of large-scale shared backup path protected networks","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Software-Defined Networks and 5G","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 Alberta","funders":"China Scholarship Council","keywords":"Computer science; Backup; Path (computing); Scale (ratio); Computer network; Distributed computing; Database","score_opus":0.033620218258588144,"score_gpt":0.27401224416872905,"score_spread":0.24039202591014092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765850923","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.009719149,0.0013884351,0.98732,0.0001606562,0.000112964204,0.0008222407,0.000009872791,0.00017563206,0.00029105775],"genre_scores_gemma":[0.7364022,0.00021159639,0.26308346,0.000025632307,0.00002163202,0.00015086855,0.000027141152,0.000010664313,0.00006679678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978225,0.00070308335,0.0005861412,0.0004003965,0.00021732473,0.00027050928],"domain_scores_gemma":[0.99398905,0.0004749494,0.0007863449,0.0043545887,0.0002969496,0.000098144665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002228907,0.00016600145,0.00056870887,0.00014288299,0.00056650065,0.00046041224,0.002227681,0.00014444836,0.000015617143],"category_scores_gemma":[0.00018067873,0.00014997744,0.0001158507,0.00057858176,0.000100102836,0.0004561019,0.0007064229,0.00019535961,0.0000052913297],"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.0003732636,0.0012278185,0.119990654,0.00032196002,0.0033918656,0.000006040754,0.006924947,0.81317085,0.00053769985,0.009339209,0.005191785,0.03952389],"study_design_scores_gemma":[0.00055252964,0.000037949918,0.059872128,0.000049214803,0.000094638795,0.000001836678,0.000029645247,0.93867636,0.000008362727,0.000041599793,0.00048229063,0.00015341952],"about_ca_topic_score_codex":0.0002796889,"about_ca_topic_score_gemma":0.000030129167,"teacher_disagreement_score":0.7266831,"about_ca_system_score_codex":0.000040109047,"about_ca_system_score_gemma":0.000042525644,"threshold_uncertainty_score":0.6115902},"labels":[],"label_agreement":null},{"id":"W2800157453","doi":"10.1007/s11235-018-0453-1","title":"An improved energy detection receiver for toa estimate in mm-Wave system","year":2018,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Time of arrival; Ranging; Multipath propagation; Energy (signal processing); Extremely high frequency; Rake receiver; Real-time computing; Telecommunications; Algorithm; Electronic engineering; Wireless; Physics; Channel (broadcasting)","score_opus":0.02953481474883658,"score_gpt":0.26041912343603935,"score_spread":0.23088430868720278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800157453","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.091351144,0.00039492478,0.90480787,0.000016230617,0.00059441186,0.00050433836,0.000009977672,0.0005973939,0.0017237325],"genre_scores_gemma":[0.99361306,0.000045173845,0.00564784,0.000015205211,0.00016358755,0.00036481582,0.00005086603,0.000050228617,0.00004918924],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989019,0.00012746573,0.0004810725,0.00018408812,0.00008476288,0.00022073506],"domain_scores_gemma":[0.99862033,0.00005600302,0.000098314325,0.00097227865,0.00018748098,0.00006560698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005340401,0.0001466182,0.00020438415,0.00018867734,0.00013009935,0.00007802955,0.00030091018,0.00012626384,0.0000073334095],"category_scores_gemma":[0.000026420692,0.0001562992,0.000038940176,0.00018524974,0.000021384769,0.00022357996,0.000031107535,0.00009559441,0.000024591493],"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.000084613195,0.00006772863,0.000053787648,0.00062383746,0.00007775223,6.164228e-7,0.0018995323,0.048344363,0.86889493,0.0008970047,0.0002271455,0.078828685],"study_design_scores_gemma":[0.00035906574,0.00008086987,0.000048937363,0.00008741542,0.00000831095,0.00001109596,0.00032753675,0.9348251,0.061911397,0.000029959625,0.0021395856,0.0001707186],"about_ca_topic_score_codex":0.0003820365,"about_ca_topic_score_gemma":0.00059380644,"teacher_disagreement_score":0.902262,"about_ca_system_score_codex":0.00026024107,"about_ca_system_score_gemma":0.000013809187,"threshold_uncertainty_score":0.63736963},"labels":[],"label_agreement":null},{"id":"W3015911510","doi":"10.1023/a:1023447105713","title":"Connectivity Based k-Hop Clustering in Wireless Networks","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":176,"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 Ottawa","funders":"","keywords":"Computer science; Node (physics); Cluster analysis; Wireless ad hoc network; Mobile ad hoc network; Cluster (spacecraft); Algorithm; Theoretical computer science; Topology (electrical circuits); Computer network; Artificial intelligence; Mathematics; Combinatorics; Wireless","score_opus":0.022311129572233277,"score_gpt":0.25128018265264523,"score_spread":0.22896905308041196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015911510","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.018045273,0.00077504833,0.97172874,0.00013151072,0.00050758803,0.0005317816,3.6836641e-7,0.00027187075,0.0080078],"genre_scores_gemma":[0.9939584,0.00004937573,0.005500231,0.00015970804,0.00003445326,0.00021932702,0.0000047142726,0.000018825096,0.000054981356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973475,0.0012233291,0.0004925672,0.00036021334,0.00020039178,0.0003760257],"domain_scores_gemma":[0.99669766,0.000597503,0.00022769353,0.002304463,0.00008695541,0.00008573985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018281828,0.00017072805,0.00029781583,0.0001291826,0.0001446936,0.00021155279,0.0014966514,0.00013733089,0.0000089202795],"category_scores_gemma":[0.000056594767,0.00018450816,0.00005105522,0.0008197335,0.000036081718,0.00039009302,0.0002092761,0.00036259613,0.000029183964],"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.000010966499,0.00026363623,0.013927807,0.00006260701,0.000022562273,0.0000097317225,0.00044342742,0.8098402,0.00027736946,0.15066774,0.00058091735,0.023893028],"study_design_scores_gemma":[0.0004574725,0.000021504968,0.0017796889,0.00008890291,0.0000015848419,0.000014384982,0.000040578398,0.9930007,0.000076480035,0.00007201241,0.00424111,0.00020561332],"about_ca_topic_score_codex":0.00022326793,"about_ca_topic_score_gemma":0.00039071456,"teacher_disagreement_score":0.9759131,"about_ca_system_score_codex":0.00019872707,"about_ca_system_score_gemma":0.00007887458,"threshold_uncertainty_score":0.7524024},"labels":[],"label_agreement":null},{"id":"W3043001543","doi":"10.1007/s11235-020-00688-4","title":"A cloud dynamic online double auction mechanism (DODAM) for sustainable pricing","year":2020,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":19,"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":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Cloud computing; Computer science; Double auction; Revenue; Cloud service provider; Service provider; Service (business); Environmental economics; Cloud computing security; Microeconomics; Business; Marketing; Common value auction; Finance; Economics","score_opus":0.025437831384888095,"score_gpt":0.27365959471546786,"score_spread":0.24822176333057977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043001543","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.014307043,0.0006784995,0.97137916,0.01098288,0.00011596505,0.0013867186,0.0000044212957,0.00090159953,0.00024372393],"genre_scores_gemma":[0.96791965,0.00007734629,0.030777348,0.00026631684,0.0000692278,0.00053403777,0.000039284758,0.00001707113,0.0002997431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986811,0.00007949173,0.0004300596,0.00037198208,0.00013614855,0.00030116225],"domain_scores_gemma":[0.997827,0.00009694747,0.00027971953,0.0013835817,0.00033232622,0.00008040949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055214716,0.00013953516,0.00023751672,0.00011448818,0.00045229302,0.00014637553,0.0017113503,0.00016236499,0.000002120826],"category_scores_gemma":[0.000050131537,0.00014617742,0.0000657108,0.0007278357,0.000034904217,0.0002911308,0.00043397193,0.00024211936,0.000021679218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001579176,0.00010089067,0.000009405206,0.000115974,0.000023707566,6.5472716e-7,0.0008961332,0.00048585626,0.0011007104,0.993776,0.00070296833,0.002771858],"study_design_scores_gemma":[0.0009528075,0.00017353406,0.00002632526,0.00002135063,0.000013789065,0.000027269882,0.001734774,0.9030761,0.0013349225,0.017614078,0.07476145,0.00026356522],"about_ca_topic_score_codex":0.00013556791,"about_ca_topic_score_gemma":0.000019940184,"teacher_disagreement_score":0.97616196,"about_ca_system_score_codex":0.00013778306,"about_ca_system_score_gemma":0.00007405041,"threshold_uncertainty_score":0.59609425},"labels":[],"label_agreement":null},{"id":"W3163159606","doi":"10.1023/a:1026118914566","title":"Rendezvous Point Relocation in Protocol Independent Multicast-Sparse Mode","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Multicast; Rendezvous; Protocol Independent Multicast; Computer network; Distance Vector Multicast Routing Protocol; Distributed computing; Pragmatic General Multicast; Source-specific multicast; Xcast; Implementation; Relocation; IP multicast; Operating system","score_opus":0.0292030369908016,"score_gpt":0.30707659546490035,"score_spread":0.2778735584740987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163159606","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.006362566,0.00041253946,0.8853221,0.00078536494,0.0006735142,0.07241356,0.000013927776,0.00064729253,0.033369154],"genre_scores_gemma":[0.9448081,0.000007649143,0.0059932233,0.00004747004,0.000019154957,0.048777185,0.00001210073,0.000015940139,0.0003191665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997092,0.0008332038,0.0008921586,0.00043330088,0.00040096114,0.0003483544],"domain_scores_gemma":[0.99688953,0.00010122876,0.00038109222,0.0023051286,0.00021754994,0.00010548211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014862284,0.00019882031,0.00030379737,0.00018286008,0.00014274317,0.00026146715,0.0013781199,0.00014429208,0.000007309829],"category_scores_gemma":[0.00013476785,0.00019336549,0.000053370888,0.00070123805,0.000031011576,0.0006344082,0.00014739322,0.0003021761,0.00015074822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065938155,0.0020293365,0.008266799,0.00053344993,0.0000775043,0.00003553387,0.008491004,0.0452399,0.0039055557,0.8948225,0.0046297624,0.03190275],"study_design_scores_gemma":[0.0047379076,0.00017567477,0.009433272,0.0006409917,0.0000073561496,0.00027944834,0.0011841389,0.74334925,0.0016175129,0.0017782763,0.23568156,0.0011145715],"about_ca_topic_score_codex":0.00065890286,"about_ca_topic_score_gemma":0.00016753901,"teacher_disagreement_score":0.93844557,"about_ca_system_score_codex":0.00029349758,"about_ca_system_score_gemma":0.00013968648,"threshold_uncertainty_score":0.7885216},"labels":[],"label_agreement":null},{"id":"W34444373","doi":"10.1023/a:1025890110119","title":"An Evaluation of Scenario Notations and Construction Approaches for Telecommunication Systems Development","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":67,"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 Calgary; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.20919534485317898,"score_gpt":0.34679617494381604,"score_spread":0.13760083009063706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34444373","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.02916698,0.00341772,0.9653514,0.000038534938,0.00029331725,0.0012634596,0.0000029446508,0.00022901007,0.00023664288],"genre_scores_gemma":[0.52868,0.00005115032,0.47072953,0.0000021565634,0.00000752624,0.00048407246,0.000027505544,0.00001021038,0.000007816792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702764,0.001471302,0.00066779903,0.0003057408,0.00033970797,0.00018781057],"domain_scores_gemma":[0.9961809,0.0009258206,0.00048987934,0.0016470866,0.0006950139,0.0000613293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052966056,0.00016338869,0.00028312765,0.00021285648,0.00029990953,0.00013393942,0.0008010052,0.00011251085,6.1035524e-7],"category_scores_gemma":[0.00085800816,0.00017136437,0.000029249355,0.00035468958,0.000087488304,0.0006905138,0.00007796478,0.00012572753,0.0000016320685],"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.000006924041,0.00012946656,0.00064585573,0.00022909703,0.00007431297,3.0067604e-8,0.003960387,0.54172367,0.0014376006,0.328323,0.000013815175,0.123455815],"study_design_scores_gemma":[0.0014361704,0.00015688167,0.0047833235,0.00022191195,0.00007325172,0.00007830757,0.004167267,0.97174954,0.0055035716,0.0063969996,0.004800526,0.00063224015],"about_ca_topic_score_codex":0.00002705404,"about_ca_topic_score_gemma":0.000009886147,"teacher_disagreement_score":0.49951306,"about_ca_system_score_codex":0.00020695258,"about_ca_system_score_gemma":0.00023479493,"threshold_uncertainty_score":0.6988036},"labels":[],"label_agreement":null},{"id":"W4294843225","doi":"10.1007/s11235-022-00953-8","title":"Energy-and-delay-aware scheduling and load balancing in vehicular fog networks","year":2022,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Server; Scheduling (production processes); Queueing theory; Computer network; Queue; Efficient energy use; Relay; Computation; Load balancing (electrical power); Real-time computing; Distributed computing; Mathematical optimization; Algorithm","score_opus":0.007910283920160698,"score_gpt":0.20017341438313613,"score_spread":0.19226313046297544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294843225","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.8298202,0.11108418,0.055217702,0.00018744761,0.0006439794,0.0006222703,0.000008587713,0.0007152479,0.0017003849],"genre_scores_gemma":[0.9976677,0.001427262,0.0003796638,0.00006184362,0.00008054809,0.00023193078,0.00005090465,0.000057489455,0.000042679712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984633,0.00030326218,0.00043308595,0.00022501145,0.00023416292,0.00034120958],"domain_scores_gemma":[0.99897754,0.00014019808,0.0000820519,0.00067363266,0.000038069444,0.00008850251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009414904,0.00018702834,0.0003003839,0.00011915521,0.00024440433,0.000083580315,0.00033708834,0.000099763834,0.000012283594],"category_scores_gemma":[0.000010094009,0.00022462757,0.00003393104,0.00036091296,0.000027585013,0.00013520004,0.00032752394,0.000487139,0.0000021162118],"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.0000038763246,0.000010195944,0.0018401744,0.000040082115,0.000029942346,0.000007703351,0.00025694032,0.99381596,0.0001372313,0.00044342078,0.0001783048,0.0032361723],"study_design_scores_gemma":[0.00037932015,0.000015997552,0.0005228102,0.00008010612,0.000010863042,0.00011724311,0.00047232263,0.9824426,0.000008567959,0.000026351949,0.015693562,0.00023022367],"about_ca_topic_score_codex":0.00036520345,"about_ca_topic_score_gemma":0.00022741678,"teacher_disagreement_score":0.16784747,"about_ca_system_score_codex":0.0003666501,"about_ca_system_score_gemma":0.00002642932,"threshold_uncertainty_score":0.9160046},"labels":[],"label_agreement":null},{"id":"W4368339546","doi":"10.1007/s11235-023-01003-7","title":"Uplink SINR and rate analysis in massive MIMO systems with two-layer linear receiver","year":2023,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"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é de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"MIMO; Telecommunications link; Computer science; Algorithm; Minimum mean square error; Context (archaeology); Signal-to-interference-plus-noise ratio; Interference (communication); Signal-to-noise ratio (imaging); Topology (electrical circuits); Statistics; Mathematics; Telecommunications; Power (physics); Channel (broadcasting); Physics","score_opus":0.02024055640679409,"score_gpt":0.2619348126572844,"score_spread":0.24169425625049032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368339546","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.5186481,0.0076044486,0.46107143,0.00028886498,0.00086933526,0.003544228,0.000064914806,0.0031068136,0.0048018787],"genre_scores_gemma":[0.99660844,0.0007199121,0.0015696122,0.0000064810984,0.000057831556,0.0003070548,0.00019749327,0.000072972936,0.00046020088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982856,0.00030376617,0.00065814453,0.00029187623,0.00014906518,0.0003115796],"domain_scores_gemma":[0.9983254,0.00024444595,0.00016714905,0.0010112735,0.00016582635,0.00008591983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007590473,0.00024432674,0.00052563846,0.00075937115,0.00010312811,0.00009791654,0.00029851607,0.00012944452,0.0000052719415],"category_scores_gemma":[0.00003691525,0.00023218844,0.000043068394,0.0027313943,0.000041630912,0.00032437223,0.0000644716,0.00024149878,0.00010391544],"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.000009920528,0.000008784318,0.004095532,0.00013652923,0.00021749601,0.000004582214,0.00052363094,0.9934582,0.0010009329,0.00029887477,0.00009202956,0.00015348659],"study_design_scores_gemma":[0.0005121401,0.000019472023,0.002732192,0.00017598805,0.0000880839,0.00000979429,0.0011510762,0.9944173,0.000097756136,0.0000067534884,0.00050447305,0.0002849619],"about_ca_topic_score_codex":0.0006389038,"about_ca_topic_score_gemma":0.0003191982,"teacher_disagreement_score":0.47796035,"about_ca_system_score_codex":0.00019691716,"about_ca_system_score_gemma":0.000019374407,"threshold_uncertainty_score":0.946837},"labels":[],"label_agreement":null},{"id":"W4379619406","doi":"10.1007/s11235-023-01024-2","title":"Energy efficiency analysis and optimization for reconfigurable intelligent surface aided DF relay cooperation with minimum-rate guarantee","year":2023,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Wireless Communication Technologies","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":"McGill University","funders":"","keywords":"Relay; Computer science; Robustness (evolution); Mathematical optimization; Rayleigh fading; Transmitter power output; Optimization problem; Benchmark (surveying); Upper and lower bounds; Channel state information; Bounded function; Fractional programming; Efficient energy use; Channel (broadcasting); Power (physics); Fading; Wireless; Mathematics; Telecommunications; Algorithm; Nonlinear programming","score_opus":0.019246476167659305,"score_gpt":0.24278388016770786,"score_spread":0.22353740400004854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379619406","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.07319377,0.0021856534,0.921716,0.0002232659,0.00007497945,0.0005567743,0.00002062113,0.0016404478,0.00038850072],"genre_scores_gemma":[0.9769003,0.0077432287,0.01410181,0.000011987674,0.000008783285,0.0003634191,0.00047879873,0.00005154216,0.0003401342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868524,0.00015096506,0.00054549513,0.00025139743,0.00011691496,0.0002499622],"domain_scores_gemma":[0.99775267,0.00044625704,0.00018237862,0.001318498,0.0002649578,0.000035250236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056219194,0.00020683177,0.00035585935,0.00042432072,0.0002787613,0.000117128504,0.00052820443,0.00014268512,0.000008765555],"category_scores_gemma":[0.000076477234,0.00019865987,0.000048753485,0.0021174832,0.00008153866,0.0002725736,0.00005622475,0.00014240152,0.000012117925],"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.000014196842,0.000013848744,0.000078560915,0.000044693246,0.00015938107,1.5360493e-7,0.00025039038,0.9917734,0.0026200025,0.0017127545,0.00016295307,0.0031696244],"study_design_scores_gemma":[0.0002769355,0.000056453937,0.000051142488,0.00005132962,0.00006196291,0.0000025843706,0.00089577516,0.9870646,0.008485737,0.000034125398,0.0027783718,0.00024097659],"about_ca_topic_score_codex":0.000067024615,"about_ca_topic_score_gemma":0.00012004869,"teacher_disagreement_score":0.9076142,"about_ca_system_score_codex":0.00011132403,"about_ca_system_score_gemma":0.00002118489,"threshold_uncertainty_score":0.81011146},"labels":[],"label_agreement":null},{"id":"W4405878689","doi":"10.1007/s11235-024-01230-6","title":"Particle filter-based BLE and IMU fusion algorithm for indoor localization","year":2024,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Computer science; Inertial measurement unit; Particle filter; Real-time computing; Global Positioning System; Multipath propagation; Sensor fusion; Software deployment; Filter (signal processing); Artificial intelligence; Computer vision; Telecommunications","score_opus":0.017443368843393498,"score_gpt":0.24564807171723022,"score_spread":0.2282047028738367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405878689","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.007757901,0.007917869,0.9811232,0.00014775332,0.00035997972,0.00054159394,0.000031484953,0.001797232,0.00032300074],"genre_scores_gemma":[0.99555624,0.0003389385,0.003487111,0.000032038144,0.000047748857,0.0002632781,0.00012069605,0.000039775416,0.00011416571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927974,0.000037860824,0.00028237695,0.00014083822,0.000093555944,0.00016565545],"domain_scores_gemma":[0.9993434,0.00013932832,0.000027050435,0.00038598254,0.00006992111,0.00003432251],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024660822,0.00011742634,0.00013631642,0.00010816494,0.00012895075,0.00016548835,0.00017285178,0.00011940823,0.000012799096],"category_scores_gemma":[0.000023830451,0.0001129209,0.000032819462,0.00029867626,0.00004039391,0.00015344196,0.00003299832,0.00009241179,0.000026626602],"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.000017908647,0.000091161506,0.0010343714,0.0021041222,0.00014884479,0.0000032836494,0.0014647712,0.15515164,0.009002605,0.020664303,0.012556659,0.7977603],"study_design_scores_gemma":[0.00023576814,0.000030097384,0.000034356843,0.00010211841,0.0000130608105,0.0000037561044,0.00019558442,0.9287125,0.014275754,0.00012893233,0.05613817,0.00012992903],"about_ca_topic_score_codex":0.000023445278,"about_ca_topic_score_gemma":0.0000065121367,"teacher_disagreement_score":0.98779833,"about_ca_system_score_codex":0.00006865508,"about_ca_system_score_gemma":0.000017212333,"threshold_uncertainty_score":0.46047807},"labels":[],"label_agreement":null},{"id":"W4406514094","doi":"10.1007/s11235-024-01252-0","title":"Controller placement in software defined emerging networks: a review and future directions","year":2025,"lang":"en","type":"review","venue":"Telecommunication Systems","topic":"Software-Defined Networks and 5G","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Controller (irrigation); Software-defined networking; Software; Distributed computing; Operating system","score_opus":0.024164734008553186,"score_gpt":0.302870662385678,"score_spread":0.2787059283771248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406514094","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.5579271e-8,0.95913976,0.03644709,0.0004931495,0.0007110644,0.0023779715,0.000009840185,0.00036092816,0.0004601658],"genre_scores_gemma":[0.0000020437035,0.9937676,0.0030671568,0.0003196558,0.00020807525,0.0020129087,0.00010686142,0.000032511503,0.0004831554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961291,0.0011860015,0.001403404,0.0006540631,0.00021531177,0.00041210913],"domain_scores_gemma":[0.9955738,0.0013560245,0.0007516017,0.002081636,0.00013746222,0.000099468154],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013433114,0.00050718745,0.0023085221,0.00040637254,0.0002810298,0.00024444747,0.0017245568,0.00033933602,0.000009853781],"category_scores_gemma":[0.00014838735,0.00043240027,0.00026920607,0.0020301454,0.000030246394,0.00021113055,0.000725792,0.0007273701,0.000016800335],"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":[9.837551e-7,0.00003661292,0.000008799219,0.017892955,0.0001027369,0.0000011822823,0.000046927726,0.00008739595,9.151647e-10,0.0021577408,0.007540715,0.9721239],"study_design_scores_gemma":[0.00024938473,0.000015176918,0.00000676614,0.047943097,0.00027572233,0.000034085468,0.0000117005575,0.0017316637,9.0838015e-10,0.000016099935,0.9493646,0.0003516974],"about_ca_topic_score_codex":0.000081752514,"about_ca_topic_score_gemma":0.000043844317,"teacher_disagreement_score":0.97177225,"about_ca_system_score_codex":0.00024148132,"about_ca_system_score_gemma":0.00022798814,"threshold_uncertainty_score":0.9998128},"labels":[],"label_agreement":null},{"id":"W4411413308","doi":"10.1007/s11235-025-01320-z","title":"A survey on task scheduling and optimization techniques for IoT-enabled UAV with Edge / Fog computing","year":2025,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"IoT and Edge/Fog Computing","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":"University of Alberta","funders":"","keywords":"Computer science; Edge computing; Fog computing; Scheduling (production processes); Internet of Things; Task (project management); Distributed computing; Real-time computing; Mathematical optimization; Embedded system; Systems engineering","score_opus":0.0274451208042549,"score_gpt":0.2853320525996257,"score_spread":0.2578869317953708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411413308","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.009381649,0.0005832718,0.9864355,0.00035510852,0.00076729944,0.00085365894,7.9697355e-7,0.00045403134,0.0011687388],"genre_scores_gemma":[0.70026124,0.000024675981,0.2991276,0.00016058586,0.0001770753,0.0000616847,0.00003649961,0.000017867504,0.00013276274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984355,0.00035997623,0.000420334,0.00037278756,0.00013978338,0.00027164503],"domain_scores_gemma":[0.9974221,0.0009143685,0.00026439395,0.0009799891,0.00037146776,0.00004765388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018505638,0.00017857795,0.00028638466,0.00025510084,0.0005786923,0.00044979356,0.0008966278,0.00009917278,1.2379294e-7],"category_scores_gemma":[0.00014665136,0.00016270654,0.000031003816,0.0006728838,0.00003977645,0.00017814994,0.00033392542,0.0001822745,0.0000019640283],"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.00037014094,0.0008359328,0.05620762,0.0018113827,0.0006026786,0.000004166559,0.0076701483,0.4849345,0.0014656627,0.05900803,0.017155405,0.36993432],"study_design_scores_gemma":[0.0004324581,0.00011326288,0.0026193021,0.0005222629,0.0000071257587,0.000004523678,0.000046074725,0.99261767,0.0003328043,0.000084924184,0.0030043493,0.00021526947],"about_ca_topic_score_codex":0.00017295635,"about_ca_topic_score_gemma":0.0000138791665,"teacher_disagreement_score":0.6908796,"about_ca_system_score_codex":0.00009582719,"about_ca_system_score_gemma":0.0001249471,"threshold_uncertainty_score":0.663498},"labels":[],"label_agreement":null},{"id":"W4412354176","doi":"10.1007/s11235-025-01326-7","title":"AI-enhanced IoT sensors for real-time crop monitoring: an era towards self-monitored agriculture","year":2025,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Smart Agriculture and AI","field":"Agricultural and Biological Sciences","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Ste. Anne's Hospital","funders":"","keywords":"Computer science; Internet of Things; Agriculture; Precision agriculture; Real-time computing; Data science; Agricultural engineering; Embedded system","score_opus":0.017501269627387687,"score_gpt":0.2734536762787722,"score_spread":0.2559524066513845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412354176","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.989339,0.000519299,0.000016565564,0.0024924162,0.00064128696,0.0011669664,0.00004961156,0.0006598631,0.0051149786],"genre_scores_gemma":[0.9930406,0.0002360882,0.00072041183,0.00011005157,0.0010762732,0.0003718963,0.00037102366,0.0000030836773,0.004070566],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816304,0.00030298982,0.0005016274,0.00041949135,0.00023297349,0.00037986613],"domain_scores_gemma":[0.998535,0.000236486,0.00022209978,0.00036366947,0.0005140786,0.00012868138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004032326,0.00027977122,0.00039349243,0.00002838416,0.0006392644,0.00029019895,0.00088340533,0.00030112147,0.000019957124],"category_scores_gemma":[0.000034339904,0.000109897504,0.00016069062,0.000684828,0.000033880784,0.00020152284,0.0001080685,0.0002440831,0.000055421668],"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.000051520725,0.00033131897,0.0016595008,0.000049282586,0.000109003806,5.2331984e-7,0.0005269654,0.00012899497,0.9686305,0.0005482063,0.015736194,0.012228018],"study_design_scores_gemma":[0.0011570189,0.0007850326,0.32484254,0.00040979832,0.00019210068,0.00001706451,0.005155823,0.0011085861,0.12013968,0.00023915885,0.54460853,0.0013446386],"about_ca_topic_score_codex":0.0008469089,"about_ca_topic_score_gemma":0.00006958907,"teacher_disagreement_score":0.8484908,"about_ca_system_score_codex":0.00012101558,"about_ca_system_score_gemma":0.000028740817,"threshold_uncertainty_score":0.49167696},"labels":[],"label_agreement":null},{"id":"W4417508086","doi":"10.1007/s11235-025-01388-7","title":"URLMoE: leveraging multi-head attention and expert specialization for robust malicious URL classification","year":2025,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Spam and Phishing Detection","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":"St. Francis Xavier University","funders":"","keywords":"Malware; Benchmark (surveying); Identification (biology); Convolutional neural network; Fuse (electrical); Exploit; Focus (optics); Botnet","score_opus":0.10146214857723526,"score_gpt":0.32591079909918613,"score_spread":0.22444865052195087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417508086","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.011950524,0.0015827747,0.9822439,0.0013983337,0.0009618011,0.000745393,0.000002036212,0.00031147007,0.00080374273],"genre_scores_gemma":[0.9635779,0.00028056803,0.034586675,0.00017348563,0.00011976379,0.00029984294,0.00005505006,0.000013683861,0.000893029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986792,0.0002374353,0.000416495,0.00035389178,0.00014087674,0.00017210198],"domain_scores_gemma":[0.9983782,0.00016639351,0.00023250909,0.0009340445,0.0002475982,0.000041252246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007246355,0.00013452572,0.00017258328,0.00024157764,0.000477873,0.00043378613,0.00059658405,0.00012106874,0.000001363506],"category_scores_gemma":[0.00009212298,0.00014553702,0.000047315745,0.0004667583,0.00003181772,0.0005587037,0.000121647674,0.000107417945,0.000008682809],"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.00010902389,0.0007309037,0.023853399,0.0007577983,0.00024957673,9.382666e-7,0.011359238,0.0057418123,0.07454673,0.37538925,0.014424021,0.4928373],"study_design_scores_gemma":[0.0008488863,0.000036796668,0.045516882,0.00016865361,0.0000125312245,0.000010077888,0.00042377083,0.909163,0.00046901967,0.00035524459,0.042772487,0.00022265379],"about_ca_topic_score_codex":0.0003830769,"about_ca_topic_score_gemma":0.000095705036,"teacher_disagreement_score":0.9516274,"about_ca_system_score_codex":0.0001650238,"about_ca_system_score_gemma":0.000043011405,"threshold_uncertainty_score":0.59348273},"labels":[],"label_agreement":null},{"id":"W614394594","doi":"10.1007/s11235-015-0050-5","title":"Survey of WDM network reconfiguration: topology migrations and their impact on service disruptions","year":2015,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Shared Services Canada","funders":"","keywords":"Control reconfiguration; Computer science; Computer network; Network topology; Topology (electrical circuits); Service (business); Wavelength-division multiplexing; Distributed computing; Telecommunications; Embedded system; Electrical engineering; Optoelectronics; Business","score_opus":0.05611650200315641,"score_gpt":0.29828258354369497,"score_spread":0.24216608154053856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W614394594","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.9159708,0.015761063,0.053914078,0.0012647945,0.00070873526,0.0010860448,0.00015952518,0.0015100536,0.009624919],"genre_scores_gemma":[0.9976607,0.00036510255,0.0016825536,0.000019565281,0.000039137405,0.000060399332,0.00012987976,0.000019917698,0.000022772043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911433,0.00018219187,0.00035994902,0.000107782434,0.00006323157,0.00017253142],"domain_scores_gemma":[0.99826986,0.000570748,0.00009166571,0.00077760813,0.0002238584,0.00006627862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043477854,0.00014376687,0.00026303084,0.000064285734,0.00007341427,0.000025408353,0.00027926045,0.00012986282,0.0000060723],"category_scores_gemma":[0.00012563329,0.00011286792,0.000023826393,0.0004780902,0.00007200464,0.000121554316,0.000050644474,0.00018969501,0.0000191708],"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.000022438559,0.000039051523,0.006596927,0.000036119327,0.0000945591,1.6077608e-7,0.0005600514,0.97412866,0.00021900212,0.007820942,0.004217362,0.006264751],"study_design_scores_gemma":[0.00070381793,0.00037795163,0.15465523,0.00019221191,0.000023912438,0.000038182992,0.0022248793,0.82936925,0.00020185526,0.0027422577,0.0088726925,0.00059778115],"about_ca_topic_score_codex":0.00037864392,"about_ca_topic_score_gemma":0.0012001945,"teacher_disagreement_score":0.14805831,"about_ca_system_score_codex":0.000080097525,"about_ca_system_score_gemma":0.000022178156,"threshold_uncertainty_score":0.46026203},"labels":[],"label_agreement":null},{"id":"W771759389","doi":"10.1007/s11235-015-0058-x","title":"Cooperative multiple access in cognitive radios to enhance QoS for cell edge primary users: asynchronous algorithm and convergence","year":2015,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","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 British Columbia","funders":"","keywords":"Computer science; Cognitive radio; Quality of service; Computer network; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Maximization; Algorithm; Mathematical optimization; Telecommunications; Wireless; Mathematics","score_opus":0.04279724462638288,"score_gpt":0.3152881808405191,"score_spread":0.2724909362141362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W771759389","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.06822269,0.0026031248,0.9252622,0.00029515338,0.00043704634,0.0019055454,0.000019157816,0.000094473195,0.001160601],"genre_scores_gemma":[0.97445637,0.00024809656,0.024427837,0.00032074784,0.00012954482,0.0002779491,0.000030726525,0.000018090845,0.00009061296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982396,0.00034298803,0.00041337195,0.00048388893,0.00018517199,0.00033497284],"domain_scores_gemma":[0.99774605,0.00078587397,0.0001785059,0.0005911293,0.0005019659,0.00019649461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080167834,0.0001974598,0.00035334856,0.00015541344,0.00016906546,0.00037375852,0.0008495855,0.00007843526,0.0000012285553],"category_scores_gemma":[0.00015197726,0.00020525516,0.000032075226,0.0005550224,0.000062919025,0.0007925845,0.0004216178,0.00018043561,0.000015042038],"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.00045426976,0.0013315515,0.017804028,0.00042508755,0.00021641911,0.00003864301,0.050288472,0.007468126,0.0052068764,0.0025375038,0.008214553,0.90601444],"study_design_scores_gemma":[0.002702914,0.00047022587,0.0051419334,0.00048640216,0.00001771149,0.0000580416,0.0017970522,0.9731143,0.009609724,0.00008468975,0.0057328213,0.0007841776],"about_ca_topic_score_codex":0.00031164277,"about_ca_topic_score_gemma":0.00017280917,"teacher_disagreement_score":0.9656462,"about_ca_system_score_codex":0.00024998852,"about_ca_system_score_gemma":0.0001961054,"threshold_uncertainty_score":0.8370063},"labels":[],"label_agreement":null}]}