{"meta":{"query_hash":"70e00eb543d9","filters":{"venue":"2015 IEEE Global Communications Conference (GLOBECOM)"},"cohort_total":104,"direct_labels_cover":0,"predictions_cover":104,"exported":104,"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/70e00eb543d9","api":"https://metacan.xera.ac/api/v1/cohort?venue=2015+IEEE+Global+Communications+Conference+%28GLOBECOM%29"},"results":[{"id":"W1807776025","doi":"10.1109/glocom.2015.7416961","title":"Multi-Objective Optimization for Power Efficient Full-Duplex Wireless Communication Systems","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Telecommunications link; Transmitter power output; Base station; Optimization problem; Wireless; Minification; Resource allocation; Power (physics)","score_opus":0.06590949104925675,"score_gpt":0.30601834052608,"score_spread":0.24010884947682326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1807776025","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.1690458,0.009859571,0.80129546,0.0020122058,0.0018120724,0.0044579003,0.0015272953,0.0024452894,0.0075443913],"genre_scores_gemma":[0.90433085,0.0010437802,0.092097335,0.000057925514,0.000038978495,0.0012859256,0.0009504542,0.000092445465,0.00010230582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965291,0.0006122662,0.0011182961,0.00050598464,0.00050283276,0.0007315155],"domain_scores_gemma":[0.990185,0.00046701942,0.00038422205,0.0062002093,0.0022952051,0.00046829885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00096757367,0.00061035645,0.0006781499,0.00021962624,0.00072356104,0.00044413685,0.004371716,0.00040120212,0.00003818241],"category_scores_gemma":[0.0002956526,0.0006949608,0.00019590888,0.0010413212,0.0005374364,0.0005324079,0.00071001914,0.00059569604,0.00021894157],"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.00004054459,0.00037361126,0.0001364247,0.000039955827,0.00013382258,3.359982e-7,0.00088685064,0.9750891,0.00034285517,0.014942434,0.007215682,0.00079842797],"study_design_scores_gemma":[0.0017301594,0.000082412495,0.0002585454,0.00017223008,0.000086481195,0.000023420009,0.0026397728,0.9869852,0.000066958804,0.000032416952,0.007206324,0.0007160521],"about_ca_topic_score_codex":0.0005611564,"about_ca_topic_score_gemma":0.0009879166,"teacher_disagreement_score":0.73528504,"about_ca_system_score_codex":0.0014574452,"about_ca_system_score_gemma":0.0004566674,"threshold_uncertainty_score":0.99955016},"labels":[],"label_agreement":null},{"id":"W2197615926","doi":"10.1109/glocom.2014.7417271","title":"Pilot Contamination Mitigation for Wideband Massive MMO: Number of Cells vs Multipath","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Institut National de la Recherche Scientifique","funders":"","keywords":"Wideband; Beamforming; Multipath propagation; Computer science; Bandwidth (computing); Channel (broadcasting); Electronic engineering; Computer network; Telecommunications; Engineering","score_opus":0.02724949388973499,"score_gpt":0.2935808569011098,"score_spread":0.26633136301137483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2197615926","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.012497221,0.00012908386,0.9740676,0.00023758282,0.00064593164,0.0009971479,0.00027533545,0.00025935227,0.010890738],"genre_scores_gemma":[0.9441223,0.00017644082,0.054989,0.000034787216,0.00004476249,0.00022679409,0.00025351642,0.000031196247,0.00012116843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854183,0.00016192983,0.0006154756,0.0002318665,0.00017306919,0.00027583932],"domain_scores_gemma":[0.99718994,0.00033048601,0.00029500312,0.0012434402,0.0008365255,0.00010460244],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031119087,0.00025038063,0.0003652906,0.000058176036,0.00015720607,0.00005490739,0.0007312339,0.00011646285,0.000027686721],"category_scores_gemma":[0.0001782239,0.0002855675,0.00007854576,0.00026348434,0.00015604234,0.00042832413,0.00007411603,0.00014115045,0.000062635605],"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.000410472,0.0013879105,0.020093221,0.0017079711,0.00064405834,0.0000011348998,0.0024978481,0.432826,0.12366833,0.3191037,0.044307653,0.05335167],"study_design_scores_gemma":[0.0023021412,0.00018550028,0.0013684549,0.00030235611,0.00009722218,0.000005383554,0.00027906612,0.9657253,0.016962655,0.0045683584,0.0075917514,0.0006117941],"about_ca_topic_score_codex":0.00011862295,"about_ca_topic_score_gemma":0.00049141305,"teacher_disagreement_score":0.9316251,"about_ca_system_score_codex":0.00026677412,"about_ca_system_score_gemma":0.000065722714,"threshold_uncertainty_score":0.99995965},"labels":[],"label_agreement":null},{"id":"W2273658040","doi":"10.1109/glocom.2015.7417166","title":"Cross-Layer Optimization of Fast Video Delivery in Cache-Enabled Relaying Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cache; Scheduling (production processes); Exploit; Computer network; Optimization problem; Cross-layer optimization; Convex optimization; Constrained optimization problem; Minification; Reduction (mathematics); Distributed computing; Real-time computing; Regular polygon; Wireless; Mathematical optimization; Wireless network; Algorithm","score_opus":0.08311168232316223,"score_gpt":0.31933122107673595,"score_spread":0.2362195387535737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273658040","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.088820055,0.0024338216,0.8858709,0.0014819968,0.00081802666,0.0004620445,0.000038248512,0.0002918042,0.019783145],"genre_scores_gemma":[0.97860086,0.0004952145,0.020379148,0.00022444018,0.000030749063,0.00003849808,0.00004678104,0.000011898293,0.00017241322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737847,0.00049343647,0.0007731621,0.00047156238,0.0004195978,0.00046380112],"domain_scores_gemma":[0.9952274,0.00017652412,0.00037505236,0.0029189498,0.0010658542,0.00023624564],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010364224,0.0002834271,0.00042175694,0.00016179227,0.0002231203,0.00036676566,0.0038059517,0.00020841694,0.000017095876],"category_scores_gemma":[0.00017778268,0.00029628404,0.000119800934,0.0010694751,0.00023895338,0.0012586577,0.0011740056,0.00043811576,0.00004567087],"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.00009531707,0.00057034247,0.058097225,0.000022865841,0.000082804574,0.000012387433,0.00094743405,0.8739213,0.0001852137,0.04207869,0.0051661297,0.018820286],"study_design_scores_gemma":[0.0010109579,0.00006145751,0.0027761373,0.00011999504,0.000017507704,0.000019086252,0.0002592207,0.99397683,0.000029661978,0.0008071944,0.00059601106,0.00032594136],"about_ca_topic_score_codex":0.0034365146,"about_ca_topic_score_gemma":0.0011182285,"teacher_disagreement_score":0.8897808,"about_ca_system_score_codex":0.00040439022,"about_ca_system_score_gemma":0.0005483745,"threshold_uncertainty_score":0.9999489},"labels":[],"label_agreement":null},{"id":"W2288266351","doi":"10.1109/glocom.2015.7417769","title":"Code-Aided Time Synchronization of Turbo-Coded Square-QAM-Modulated Transmissions: Closed-Form Cramer-Rao Lower Bounds","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Turbo code; Algorithm; QAM; Cramér–Rao bound; Quadrature amplitude modulation; Computer science; Synchronization (alternating current); Decoding methods; Square (algebra); Mathematics; Estimation theory; Theoretical computer science; Bit error rate; Telecommunications; Channel (broadcasting)","score_opus":0.0410538419408233,"score_gpt":0.3066830266069725,"score_spread":0.2656291846661492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288266351","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.11805563,0.009821058,0.75978565,0.0051786834,0.0011477887,0.0038892676,0.0017439573,0.007800862,0.092577085],"genre_scores_gemma":[0.9559992,0.0022255413,0.040602665,0.00008213164,0.00002636515,0.00016057992,0.00062047766,0.00007780393,0.00020525385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969229,0.0003393684,0.0012248997,0.00039731304,0.0005576416,0.00055784575],"domain_scores_gemma":[0.99297935,0.00019575465,0.00037443492,0.0047080624,0.0013518487,0.00039052503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005322592,0.0005380411,0.0007254802,0.0002079352,0.00028496937,0.00013237618,0.0032586425,0.00041297337,0.00017750626],"category_scores_gemma":[0.00020358333,0.0005895906,0.00017828468,0.0011974084,0.00058593915,0.00086920103,0.00039024372,0.00059612223,0.0002494871],"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.0007961099,0.005353688,0.0044379896,0.0009929201,0.0017473793,0.000019373361,0.0072323047,0.09581113,0.049313646,0.105780624,0.16487837,0.5636365],"study_design_scores_gemma":[0.0023215637,0.00030030933,0.0009785475,0.0007294671,0.00016489085,0.000034036944,0.00048228656,0.8969279,0.011670392,0.028960424,0.05588833,0.0015418527],"about_ca_topic_score_codex":0.00024041372,"about_ca_topic_score_gemma":0.0002902165,"teacher_disagreement_score":0.83794355,"about_ca_system_score_codex":0.00080967305,"about_ca_system_score_gemma":0.00044630832,"threshold_uncertainty_score":0.99965554},"labels":[],"label_agreement":null},{"id":"W2288408808","doi":"10.1109/glocom.2014.7417620","title":"Best-Relay Selection for Multi-Hop Vehicular Communication in Highways","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Relay; Computer science; Hop (telecommunications); Pairwise error probability; Transmission (telecommunications); Computer network; Telecommunications; Power (physics); Decoding methods","score_opus":0.1116707322582937,"score_gpt":0.35454843155558163,"score_spread":0.24287769929728792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288408808","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.008281237,0.0024182117,0.9710137,0.009845078,0.00033403572,0.0011476433,0.000026607708,0.0005890013,0.0063444697],"genre_scores_gemma":[0.79601127,0.002943091,0.19984078,0.00050872547,0.000030141648,0.0004022472,0.00009331262,0.000017101129,0.00015333758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964703,0.0013111475,0.00080107327,0.00057880214,0.00029282825,0.00054586545],"domain_scores_gemma":[0.992843,0.0005417023,0.0003639447,0.004960417,0.0010967386,0.00019420753],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0015698639,0.00036322285,0.00044596093,0.00019258713,0.00095551944,0.00044474666,0.0065825973,0.00023244541,0.000018554876],"category_scores_gemma":[0.00038893273,0.00039786877,0.00015037593,0.0013205898,0.00026970977,0.0009463107,0.0013371137,0.0005549539,0.00017469547],"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.00002440554,0.0010334607,0.0052549765,0.00002912262,0.000057988425,2.5454256e-7,0.0007799181,0.0024874494,0.0009867607,0.87136453,0.008819589,0.10916155],"study_design_scores_gemma":[0.0013349594,0.000109277775,0.00272935,0.00015737167,0.000020108204,0.000009069513,0.000085916596,0.9333645,0.00019246507,0.00259828,0.058934692,0.00046402361],"about_ca_topic_score_codex":0.00032909415,"about_ca_topic_score_gemma":0.0085813925,"teacher_disagreement_score":0.93087703,"about_ca_system_score_codex":0.00046569746,"about_ca_system_score_gemma":0.0002938882,"threshold_uncertainty_score":0.9998473},"labels":[],"label_agreement":null},{"id":"W2288611833","doi":"10.1109/glocom.2015.7417371","title":"An Adaptive Frame Length Aggregation Scheme in Vehicular Delay-Tolerant Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Frame (networking); Throughput; Transmission (telecommunications); Computer network; Scheme (mathematics); Transmission delay; Data aggregator; Wireless; Data transmission; Real-time computing; Topology (electrical circuits); Telecommunications; Wireless sensor network; Engineering; Mathematics; Electrical engineering","score_opus":0.0895136670358828,"score_gpt":0.32265924731258694,"score_spread":0.23314558027670412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288611833","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.01477896,0.0019004509,0.9673634,0.0018545125,0.00071198976,0.0005656036,0.000037971735,0.00036358554,0.012423531],"genre_scores_gemma":[0.92425704,0.00042777878,0.07425613,0.0006678493,0.00010624512,0.00008951971,0.00013216806,0.00001911556,0.00004414289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99610895,0.0008090723,0.0008698439,0.00077634654,0.0006444729,0.0007912856],"domain_scores_gemma":[0.99337506,0.0001707221,0.0003975202,0.00440651,0.00095258025,0.00069762353],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001260563,0.00046172153,0.0005606908,0.00014569037,0.00033693097,0.0005125471,0.005042687,0.00041276927,0.000021589338],"category_scores_gemma":[0.000033523287,0.0004821906,0.0001174999,0.0011898271,0.00037479048,0.0015982937,0.00080079417,0.0008271867,0.00016302771],"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.00023101903,0.0019684613,0.014286005,0.000016635915,0.00017354512,0.00014785922,0.0019699754,0.032578647,0.000027529188,0.57871574,0.016362168,0.3535224],"study_design_scores_gemma":[0.0009432257,0.0002279939,0.00077273673,0.00011583176,0.000020674082,0.00005799004,0.0003399822,0.9802313,0.00000438062,0.012650798,0.004082962,0.00055215904],"about_ca_topic_score_codex":0.001175921,"about_ca_topic_score_gemma":0.0014976197,"teacher_disagreement_score":0.94765264,"about_ca_system_score_codex":0.00047901095,"about_ca_system_score_gemma":0.0009982901,"threshold_uncertainty_score":0.99976295},"labels":[],"label_agreement":null},{"id":"W2288710413","doi":"10.1109/glocom.2015.7417534","title":"Energy-Efficient and Fault-Tolerant Evolution Models for Large-Scale Wireless Sensor Networks: A Complex Networks-Based Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless sensor network; Fault tolerance; Computer science; Distributed computing; Network topology; Efficient energy use; Energy (signal processing); Node (physics); Cluster analysis; Topology (electrical circuits); Computer network; Engineering; Artificial intelligence; Mathematics","score_opus":0.0657653160746157,"score_gpt":0.30902912364703494,"score_spread":0.24326380757241922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288710413","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.0042068087,0.00074569584,0.9860876,0.00044319365,0.00010183503,0.00073616963,0.00036149143,0.00024560955,0.007071578],"genre_scores_gemma":[0.94817823,0.000036044916,0.04966175,0.0001383879,0.00019012956,0.00045604137,0.0012445858,0.000033167325,0.00006168357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718505,0.00043125343,0.00068627874,0.0006261854,0.00032955623,0.0007416708],"domain_scores_gemma":[0.9959658,0.0001662351,0.00039509154,0.0021460375,0.0009385059,0.00038837604],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000700069,0.00046100898,0.00066833006,0.00009683325,0.00062403694,0.0002597553,0.0013469594,0.000157651,0.000020911553],"category_scores_gemma":[0.000005886082,0.00047425897,0.00024330425,0.0006500377,0.00029607693,0.00019295626,0.00048724582,0.00029027,0.0000043799632],"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.0000830303,0.00087135663,0.0027402642,0.000010325603,0.00013596806,1.9111481e-7,0.00011198566,0.73580956,0.000009155448,0.2397669,0.013907897,0.0065533957],"study_design_scores_gemma":[0.0012018633,0.00005803101,0.00018607517,0.000050051665,0.00015097359,0.0000022203187,0.0006869839,0.98160493,0.000004194771,0.00978451,0.0057750302,0.00049511826],"about_ca_topic_score_codex":0.0013240532,"about_ca_topic_score_gemma":0.00061306334,"teacher_disagreement_score":0.9439714,"about_ca_system_score_codex":0.00029625028,"about_ca_system_score_gemma":0.0002834937,"threshold_uncertainty_score":0.99977094},"labels":[],"label_agreement":null},{"id":"W2288747342","doi":"10.1109/glocom.2015.7417764","title":"Globally Aware Network Flow Allocation Optimization Based on Multipath Routing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multipath routing; Computer science; Computer network; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Equal-cost multi-path routing; Static routing; Multipath propagation; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Mathematical optimization; Routing protocol; Channel (broadcasting); Mathematics","score_opus":0.06270134270456333,"score_gpt":0.3044923533574463,"score_spread":0.24179101065288294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288747342","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.0000899255,0.00027307347,0.9637901,0.0050515714,0.0010938187,0.00078199944,0.000048430946,0.00071334327,0.028157722],"genre_scores_gemma":[0.7053251,0.00008512105,0.2926777,0.0013093369,0.00015569861,0.00013588624,0.0002337176,0.000020884032,0.000056546654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957152,0.00089005305,0.00080889935,0.00083136186,0.00092751905,0.00082697615],"domain_scores_gemma":[0.991642,0.00029416368,0.00052095146,0.0055724382,0.001434908,0.0005355298],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014643767,0.0004924685,0.0004503402,0.00008490068,0.00061219087,0.00078247767,0.006534431,0.0003005205,0.00003437663],"category_scores_gemma":[0.0002812054,0.00052843033,0.00014158334,0.0015828956,0.00021006097,0.000991397,0.0011116024,0.0004918375,0.00031659863],"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.000023723622,0.00022231007,0.0015718248,0.000005019225,0.000021733207,0.00000275282,0.00009796126,0.9160894,0.0000012162433,0.042153206,0.021923028,0.017887821],"study_design_scores_gemma":[0.000982656,0.00014837125,0.0005864771,0.00015862743,0.00002578792,0.000010557726,0.00006513591,0.98956436,0.0000057085963,0.001959869,0.005970276,0.00052215985],"about_ca_topic_score_codex":0.00036448563,"about_ca_topic_score_gemma":0.0007316347,"teacher_disagreement_score":0.7052352,"about_ca_system_score_codex":0.00091302645,"about_ca_system_score_gemma":0.0012167342,"threshold_uncertainty_score":0.9997167},"labels":[],"label_agreement":null},{"id":"W2288792628","doi":"10.1109/glocom.2015.7417797","title":"Mitigating Datacenter Incast Congestion Using RTO Randomization","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Microsoft (Canada)","funders":"","keywords":"Computer science; Computer network; Goodput; Network packet; Interval (graph theory); Timeout; Distributed computing; Throughput; Real-time computing; Wireless; Operating system; Mathematics","score_opus":0.12549917090952759,"score_gpt":0.3416904648624643,"score_spread":0.2161912939529367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288792628","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.09316245,0.000645587,0.8773735,0.0055263825,0.0010797078,0.00066034484,0.000036062567,0.0005672898,0.020948643],"genre_scores_gemma":[0.93164647,0.000034768862,0.067643724,0.0003624583,0.00008560148,0.000021496468,0.000055040426,0.000011563701,0.0001388944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973917,0.0006252283,0.00057368336,0.0004942971,0.0004878609,0.0004272199],"domain_scores_gemma":[0.9956327,0.00012342836,0.00036247334,0.0029427146,0.0006520074,0.00028666007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001090307,0.00027714486,0.00032455454,0.00010561562,0.000488339,0.000619039,0.0035472547,0.000111785164,0.000008856032],"category_scores_gemma":[0.00021675351,0.0002779339,0.00008760953,0.0007548919,0.00020609393,0.0002807709,0.0020679904,0.00026328344,0.0001429947],"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.00030124956,0.0020489343,0.028290037,0.00015689006,0.0006098817,0.000044009117,0.0066130036,0.098112114,0.0010319743,0.5832,0.06595164,0.21364027],"study_design_scores_gemma":[0.0021000984,0.00004236271,0.00063386234,0.00013782633,0.00003678612,0.000041913532,0.00036869486,0.98280203,0.000032100972,0.0028799882,0.010567002,0.00035730662],"about_ca_topic_score_codex":0.00063901214,"about_ca_topic_score_gemma":0.00021485543,"teacher_disagreement_score":0.8846899,"about_ca_system_score_codex":0.0004082014,"about_ca_system_score_gemma":0.00030337492,"threshold_uncertainty_score":0.9999673},"labels":[],"label_agreement":null},{"id":"W2288964172","doi":"10.1109/glocom.2015.7417879","title":"Irregular Multidimensional Constellations for Orthogonal STBCs","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Constellation; Block code; Transmitter; Computer science; Algorithm; Space–time block code; Constellation diagram; MIMO; Antenna diversity; Block (permutation group theory); Mathematics; Reliability (semiconductor); Transmit diversity; Block Error Rate; Theoretical computer science; Topology (electrical circuits); Bit error rate; Telecommunications; Decoding methods; Fading; Antenna (radio); Combinatorics; Physics; Telecommunications link; Beamforming","score_opus":0.10742490645497338,"score_gpt":0.3489757898366548,"score_spread":0.2415508833816814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288964172","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.008197772,0.004141697,0.93332076,0.003336512,0.00072353834,0.001716626,0.001215699,0.0025567373,0.044790633],"genre_scores_gemma":[0.8252475,0.0005370573,0.17307459,0.00013917674,0.000042340325,0.00033651307,0.00044978727,0.0000410306,0.00013196793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809307,0.00017141043,0.000656802,0.0002985398,0.00033867132,0.00044151492],"domain_scores_gemma":[0.9950965,0.00023131973,0.00016064037,0.003058474,0.0011108541,0.00034222286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004233529,0.00035565853,0.00038963443,0.0001102841,0.0003331871,0.00008441742,0.0018254644,0.00021789924,0.000048026628],"category_scores_gemma":[0.00016235812,0.00040578734,0.0001366367,0.0004537163,0.00046304797,0.0004513144,0.0003858779,0.00034273593,0.00016109033],"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.00007879417,0.0005370416,0.0021120897,0.00008093641,0.00029845332,0.0000020210948,0.00046059178,0.032712217,0.0024129015,0.77745616,0.11516613,0.06868267],"study_design_scores_gemma":[0.001499833,0.00008544641,0.0006138056,0.00011876127,0.000075183416,0.000042191197,0.0005586759,0.5201805,0.0012129387,0.031973165,0.44268847,0.0009510297],"about_ca_topic_score_codex":0.000047473546,"about_ca_topic_score_gemma":0.00028966673,"teacher_disagreement_score":0.81704974,"about_ca_system_score_codex":0.00044573832,"about_ca_system_score_gemma":0.00036370457,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W2289009894","doi":"10.1109/glocom.2015.7417139","title":"Downlink Performance and User Scheduling of HetNet with Large-Scale Antenna Arrays","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Telecommunications link; Precoding; Computer science; Heterogeneous network; MIMO; Scheduling (production processes); Base station; Channel state information; Macro; Multi-user MIMO; Small cell; Computer network; Channel (broadcasting); Mathematical optimization; Wireless network; Wireless; Telecommunications; Mathematics","score_opus":0.03260289107479505,"score_gpt":0.2681368544031861,"score_spread":0.23553396332839102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289009894","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.1879782,0.0019636254,0.7956778,0.00027618607,0.0002558591,0.00053394487,0.00019246181,0.00039119582,0.012730748],"genre_scores_gemma":[0.8917142,0.0008588439,0.10720729,0.00002181141,0.00002222543,0.000035207842,0.000067090885,0.000022263708,0.000051072475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988096,0.0000709908,0.0004097976,0.00020834433,0.00018957899,0.00031170537],"domain_scores_gemma":[0.9977418,0.00003644987,0.00014443189,0.0013498504,0.0005408432,0.00018661655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002772602,0.0002357839,0.0003334327,0.000064254185,0.00012173997,0.000053399082,0.00067817676,0.00011725377,0.000009805143],"category_scores_gemma":[0.000031189327,0.00022695857,0.00002801539,0.00038949001,0.00019991332,0.00054407277,0.00015752592,0.00022438983,0.000030559906],"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.00018568216,0.00047714476,0.121960156,0.0005738654,0.0003283694,0.0000035283756,0.0036907566,0.8478363,0.0022593397,0.0115370015,0.004923203,0.0062246635],"study_design_scores_gemma":[0.001108544,0.00009353999,0.001250843,0.00026752512,0.00004075959,0.000035838657,0.0013753228,0.9907861,0.00024937835,0.00014650915,0.0042634155,0.00038223484],"about_ca_topic_score_codex":0.00005553049,"about_ca_topic_score_gemma":0.00049232296,"teacher_disagreement_score":0.703736,"about_ca_system_score_codex":0.00014094099,"about_ca_system_score_gemma":0.00011893108,"threshold_uncertainty_score":0.92551017},"labels":[],"label_agreement":null},{"id":"W2289104935","doi":"10.1109/glocom.2015.7417494","title":"Cloud Assisted Resource Management for Hyper-Dense Small Cell Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Resource allocation; Cloud computing; Computer network; Overhead (engineering); Cellular network; Distributed computing; Resource management (computing); Base station; Wireless network; Small cell; Wireless; Telecommunications","score_opus":0.07208343718790726,"score_gpt":0.28500247249935423,"score_spread":0.21291903531144696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289104935","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.0012814115,0.0023403857,0.89296967,0.00034924335,0.0009018503,0.0012428348,0.00012920218,0.0007826952,0.10000268],"genre_scores_gemma":[0.8839624,0.00059996505,0.11275856,0.00013570591,0.00015446154,0.00044607866,0.0003643357,0.00007336323,0.0015051241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982359,0.00016901967,0.000582815,0.0003277145,0.00018240712,0.0005021697],"domain_scores_gemma":[0.9965653,0.00011549537,0.00016737799,0.0024108486,0.00044953692,0.00029144192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043175978,0.0003430915,0.00035941208,0.000077790435,0.00021719353,0.00014295294,0.0015522237,0.0002067325,0.000010984575],"category_scores_gemma":[0.00004013127,0.00039245258,0.00010239665,0.0004637666,0.00011330558,0.0002026647,0.00029537862,0.00024470524,0.000113021626],"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.00010139383,0.00027705266,0.0004581494,0.00018528134,0.00017673198,0.0000041530056,0.0002925925,0.78577787,0.0000791396,0.020264363,0.16778745,0.024595845],"study_design_scores_gemma":[0.0019378962,0.00008908617,0.00013062674,0.00013975808,0.00013874743,0.000023498756,0.0012345262,0.7401416,0.0000751174,0.0011367052,0.2542226,0.00072985527],"about_ca_topic_score_codex":0.000055834007,"about_ca_topic_score_gemma":0.0004331411,"teacher_disagreement_score":0.882681,"about_ca_system_score_codex":0.0005581171,"about_ca_system_score_gemma":0.00007185071,"threshold_uncertainty_score":0.9998527},"labels":[],"label_agreement":null},{"id":"W2289132816","doi":"10.1109/glocom.2015.7417836","title":"A Hierarchical Architecture for Distributed EPCglobal Discovery Services","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Architecture; Service discovery; World Wide Web; Distributed computing; Computer network; Web service; Geography","score_opus":0.06012163465902565,"score_gpt":0.3265022655987379,"score_spread":0.26638063093971226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289132816","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.007814534,0.0006326411,0.93732756,0.045832936,0.00066281453,0.0009905915,0.0012871012,0.0012309892,0.0042208005],"genre_scores_gemma":[0.7817089,0.00005554001,0.21647547,0.0009318782,0.000079233716,0.0003193229,0.00029514942,0.000015871336,0.00011863478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99674225,0.00028495994,0.0006087432,0.00082170696,0.00062238483,0.0009199352],"domain_scores_gemma":[0.9925972,0.00028372562,0.00024384406,0.0054944213,0.00082947576,0.00055129465],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006420354,0.00047166244,0.00053007546,0.000140041,0.00041681854,0.0010015134,0.012131034,0.00029123764,0.0000030640097],"category_scores_gemma":[0.0003040786,0.0004476166,0.00017898284,0.0015455277,0.00042433574,0.0009920564,0.003790239,0.0005004858,0.0001574266],"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.00013909086,0.0005820668,0.0033919164,0.000053390988,0.00016370477,0.000010097337,0.0007021803,0.0020935151,0.00011888804,0.7502738,0.13816804,0.10430329],"study_design_scores_gemma":[0.0021204033,0.0005910708,0.004519078,0.00023534845,0.000077881145,0.00013884176,0.00061540515,0.11162206,0.00024946473,0.39637083,0.48191866,0.0015409526],"about_ca_topic_score_codex":0.00040926627,"about_ca_topic_score_gemma":0.0024995953,"teacher_disagreement_score":0.77389437,"about_ca_system_score_codex":0.00048447918,"about_ca_system_score_gemma":0.0007004244,"threshold_uncertainty_score":0.9997976},"labels":[],"label_agreement":null},{"id":"W2289194323","doi":"10.1109/glocom.2015.7417760","title":"Mobile Virtual Network Admission Control and Resource Allocation for Wireless Network Virtualization: A Robust Optimization Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"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","keywords":"Computer science; Admission control; Computer network; Quality of service; Wireless network; Resource allocation; Call Admission Control; Virtualization; Distributed computing; Network virtualization; Wireless; Cloud computing; Telecommunications","score_opus":0.054192109748510776,"score_gpt":0.28409936454623097,"score_spread":0.2299072547977202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289194323","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.00025939275,0.0027206508,0.99060607,0.001275773,0.00046236828,0.0013804205,0.000045611316,0.000454011,0.002795688],"genre_scores_gemma":[0.5985789,0.00072874676,0.39775205,0.0010202255,0.00043036125,0.00072562724,0.00053028896,0.000036345093,0.00019746898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968178,0.00062289555,0.0007129874,0.00073481386,0.00045129657,0.00066020776],"domain_scores_gemma":[0.99518883,0.00039031333,0.00046747184,0.002446581,0.0009972655,0.00050956156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013207564,0.00040577777,0.00050157495,0.000064737666,0.00081935275,0.0005991382,0.002528893,0.00031398438,0.000006498138],"category_scores_gemma":[0.00016803732,0.00041282986,0.000099100034,0.0011320912,0.00025032533,0.0008188951,0.0006896976,0.0002686386,0.00001088635],"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.00007460612,0.00015367885,0.0007351366,0.000010868814,0.000043053955,3.4854605e-7,0.00026365003,0.80096114,0.0000015180492,0.1284754,0.052641686,0.016638903],"study_design_scores_gemma":[0.0016996845,0.00032489104,0.00011111445,0.00008988156,0.000055736156,0.000021963519,0.00021757105,0.9656973,0.0000014373243,0.0031752994,0.028155582,0.0004495599],"about_ca_topic_score_codex":0.00007225058,"about_ca_topic_score_gemma":0.000071421375,"teacher_disagreement_score":0.5983195,"about_ca_system_score_codex":0.00023396692,"about_ca_system_score_gemma":0.0005270817,"threshold_uncertainty_score":0.99983233},"labels":[],"label_agreement":null},{"id":"W2289285750","doi":"10.1109/glocom.2015.7417509","title":"Enhancing the Performance of Amplify-and-Forward Cognitive Relay Networks: A Multiple-Relay Scenario","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Underlay; Relay; Cognitive radio; Computer science; Interference (communication); Transmitter; Node (physics); Throughput; Transmission (telecommunications); Transmitter power output; Computer network; Constraint (computer-aided design); Optimization problem; Cognitive network; Signal-to-noise ratio (imaging); Mathematical optimization; Power (physics); Telecommunications; Wireless; Engineering; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.04684814527069362,"score_gpt":0.29047147242384425,"score_spread":0.24362332715315063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289285750","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.32574284,0.0048369793,0.65416014,0.003594656,0.00079801615,0.00093793246,0.00005102735,0.00026663067,0.009611762],"genre_scores_gemma":[0.9871277,0.0014936163,0.010797366,0.00036990942,0.000081778264,0.000032531858,0.00002391624,0.000014000244,0.000059188973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997248,0.00055597996,0.0006893691,0.00049220026,0.00043756148,0.00057692407],"domain_scores_gemma":[0.9952899,0.0009516886,0.00043725665,0.0020301675,0.000995162,0.00029580327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012852729,0.00034065385,0.0004631496,0.00007559103,0.00061801623,0.0003132728,0.002432357,0.00017018733,0.00000607741],"category_scores_gemma":[0.00032529514,0.0002787957,0.00010759698,0.00085321994,0.00072026794,0.0006603678,0.0012215558,0.00063786196,0.00004284336],"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.00069508323,0.0016769854,0.13560954,0.00015966676,0.0013406684,0.00003722164,0.016615339,0.028265882,0.0007540884,0.27193624,0.014074131,0.5288352],"study_design_scores_gemma":[0.0011215417,0.00023004416,0.008237403,0.00040970749,0.000079948826,0.000109187196,0.00090196973,0.9849821,0.0002391285,0.0006723712,0.0025440906,0.00047255002],"about_ca_topic_score_codex":0.00066735316,"about_ca_topic_score_gemma":0.0026762849,"teacher_disagreement_score":0.9567162,"about_ca_system_score_codex":0.00019574052,"about_ca_system_score_gemma":0.000494995,"threshold_uncertainty_score":0.99996644},"labels":[],"label_agreement":null},{"id":"W2289328635","doi":"10.1109/glocom.2015.7417310","title":"A Learning-Based Distributed Spectrum Sensing Mechanism for IEEE 802.22 Wireless Regional Area Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Cognitive radio; Computer science; False alarm; Wireless; Reliability (semiconductor); Bandwidth (computing); Majority rule; Wireless network; Computer network; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.07211096035085904,"score_gpt":0.2967678010923424,"score_spread":0.22465684074148337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289328635","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.0049157445,0.00027166473,0.98032415,0.0101031,0.00094573194,0.0006794601,0.00009018072,0.0005589624,0.002110994],"genre_scores_gemma":[0.96777344,0.00015726827,0.030555341,0.00082468503,0.00023618757,0.000035694047,0.00031996978,0.000031099917,0.00006634162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631804,0.000598853,0.00068317575,0.00082881935,0.0005675778,0.001003512],"domain_scores_gemma":[0.9943546,0.0006022048,0.0004936121,0.0025541368,0.0014428872,0.00055253424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008779871,0.00052595884,0.00061911275,0.0001257458,0.0009399042,0.00073286897,0.0027128074,0.00027974168,0.000008401619],"category_scores_gemma":[0.00018232763,0.00056565,0.00026765306,0.0010969492,0.0003516031,0.0005105319,0.00047059127,0.00069802185,0.00003698069],"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.0003655216,0.0009192727,0.0010284628,0.000045692745,0.0004219228,0.00006770012,0.00071745645,0.082011804,0.00026125528,0.7655334,0.072103776,0.07652372],"study_design_scores_gemma":[0.0013330585,0.00023672529,0.00013269992,0.00015084611,0.000054673877,0.00008821136,0.00022562109,0.9631383,0.00013285801,0.028072093,0.0057886927,0.0006462378],"about_ca_topic_score_codex":0.000394528,"about_ca_topic_score_gemma":0.0017405768,"teacher_disagreement_score":0.96285766,"about_ca_system_score_codex":0.0007124097,"about_ca_system_score_gemma":0.0009573956,"threshold_uncertainty_score":0.9996795},"labels":[],"label_agreement":null},{"id":"W2289434109","doi":"10.1109/glocom.2015.7417670","title":"Massive MIMO-Enabled Wireless Backhauls for Full-Duplex Small Cells","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Backhaul (telecommunications); Telecommunications link; MIMO; Computer network; Base station; Computer science; Wireless; Wireless network; Small cell; Duplex (building); Telecommunications","score_opus":0.08982215824629151,"score_gpt":0.29785780213789564,"score_spread":0.20803564389160412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289434109","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.6979225,0.007892976,0.2123408,0.012244544,0.0043265633,0.006605113,0.0044882977,0.004592098,0.049587075],"genre_scores_gemma":[0.9447466,0.0013753499,0.05122142,0.00020258664,0.00011886843,0.0009780023,0.00068381825,0.00010890328,0.00056444504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965852,0.00036134952,0.0010635207,0.0005592981,0.00041879105,0.0010118296],"domain_scores_gemma":[0.99078643,0.00053623586,0.00030176612,0.006100729,0.0015838705,0.0006909895],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006663335,0.0006926718,0.0007824917,0.00017332182,0.0005247653,0.00038092397,0.0055867983,0.00043066402,0.00010787254],"category_scores_gemma":[0.00018758666,0.00078329025,0.00027011955,0.00089979504,0.0005173115,0.00053529243,0.00082600897,0.000680325,0.0008663206],"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.00026481051,0.0013985562,0.00086200744,0.00042073755,0.0009814776,0.000009451272,0.0022867937,0.4653449,0.029528987,0.11471963,0.3566364,0.027546216],"study_design_scores_gemma":[0.002027924,0.00012697405,0.00019275023,0.00015074667,0.00014148177,0.000021033991,0.001379538,0.88683885,0.0020156917,0.0007247788,0.10529314,0.0010870679],"about_ca_topic_score_codex":0.0004895916,"about_ca_topic_score_gemma":0.0039449176,"teacher_disagreement_score":0.42149395,"about_ca_system_score_codex":0.0009339753,"about_ca_system_score_gemma":0.0006444484,"threshold_uncertainty_score":0.9999116},"labels":[],"label_agreement":null},{"id":"W2289678590","doi":"10.1109/glocom.2015.7417230","title":"Minimizing Deployment Cost of Cloud-Based Web Application with Guaranteed QoS","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Computer science; Quality of service; Software deployment; Server; Distributed computing; Workload; Task (project management); Database; Cloud testing; Web service; Computer network; Operating system; Cloud computing security; World Wide Web; Engineering","score_opus":0.06126879896818959,"score_gpt":0.3023149399367901,"score_spread":0.2410461409686005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289678590","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.05675862,0.00061358,0.906063,0.0077165915,0.0005420095,0.0013957069,0.000049479026,0.0006205209,0.026240487],"genre_scores_gemma":[0.9477397,0.000015219781,0.051551208,0.00041942814,0.00005181648,0.00012994443,0.000020479561,0.000013594808,0.000058581205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975317,0.00032752124,0.0005912812,0.0005082263,0.00063581043,0.00040547087],"domain_scores_gemma":[0.99443775,0.00013996325,0.00047718856,0.003982862,0.0007047488,0.00025746183],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007590735,0.0003001186,0.00038207293,0.000119920995,0.00025310658,0.00018529686,0.004564126,0.00009818004,0.0000037798156],"category_scores_gemma":[0.000047330363,0.0002694755,0.00009476931,0.0009776384,0.0003174364,0.00007551653,0.00092263444,0.00022636683,0.00008776709],"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.00041431712,0.0044825114,0.035124425,0.0002498195,0.0005980814,0.000020967473,0.0026282528,0.11305897,0.0011284177,0.5813267,0.06656652,0.19440101],"study_design_scores_gemma":[0.0019510856,0.00023352995,0.00087946287,0.00017751305,0.000057772333,0.00001778624,0.0004508701,0.94342774,0.00035803718,0.0011178439,0.050863434,0.00046494533],"about_ca_topic_score_codex":0.0005874915,"about_ca_topic_score_gemma":0.0005265594,"teacher_disagreement_score":0.89098114,"about_ca_system_score_codex":0.00030864213,"about_ca_system_score_gemma":0.00065285026,"threshold_uncertainty_score":0.99997574},"labels":[],"label_agreement":null},{"id":"W2289733106","doi":"10.1109/glocom.2015.7417607","title":"Interweave Cognitive Networks with Co-Operative Sensing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cognitive radio; Node (physics); Rayleigh fading; Computer science; Fading; Decoding methods; Beacon; Primary (astronomy); Poisson distribution; Computer network; Interference (communication); Algorithm; Topology (electrical circuits); Wireless; Telecommunications; Mathematics; Statistics; Physics; Combinatorics; Channel (broadcasting)","score_opus":0.06688517206427402,"score_gpt":0.3380000698475612,"score_spread":0.2711148977832872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289733106","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.008575563,0.0008370305,0.9177896,0.0028095848,0.00037444127,0.0005145667,0.000041368035,0.00034803167,0.06870981],"genre_scores_gemma":[0.9633965,0.00023747912,0.035160605,0.00087310054,0.00012382177,0.000013918731,0.00007413488,0.000020219435,0.000100231504],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696565,0.00069961254,0.0004843185,0.0006799116,0.0004732855,0.0006972368],"domain_scores_gemma":[0.99520105,0.00037145367,0.00028995116,0.002040296,0.0016038358,0.00049343216],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005992878,0.00044856156,0.00050192565,0.00010123413,0.0005501477,0.0008357874,0.0020320707,0.0001591791,0.000015133311],"category_scores_gemma":[0.00011447768,0.0004064197,0.0000991822,0.0009475179,0.00063202484,0.00093892927,0.00071398274,0.00061820494,0.00016305252],"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.000622,0.001167623,0.009577956,0.000028079654,0.0012327583,0.00054128567,0.008434764,0.006084267,0.000103636354,0.21762897,0.037485074,0.7170936],"study_design_scores_gemma":[0.0019178677,0.00045200536,0.0014215863,0.000490412,0.0000832899,0.00068112486,0.0022479217,0.9831582,0.0001672898,0.003587565,0.0048049064,0.0009878769],"about_ca_topic_score_codex":0.0004176894,"about_ca_topic_score_gemma":0.002249365,"teacher_disagreement_score":0.9770739,"about_ca_system_score_codex":0.00041980864,"about_ca_system_score_gemma":0.0006982647,"threshold_uncertainty_score":0.99983877},"labels":[],"label_agreement":null},{"id":"W2289792134","doi":"10.1109/glocom.2015.7417185","title":"A QoS Monitor Selection Mechanism for Cellular Data Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Overhead (engineering); Computer network; Scheme (mathematics); Matching (statistics); Service (business); Transmission (telecommunications); Distributed computing; Real-time computing; Telecommunications","score_opus":0.22816114131245774,"score_gpt":0.39075797479910207,"score_spread":0.16259683348664433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289792134","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.0004987964,0.0012711312,0.9824367,0.008530149,0.001043458,0.0011915248,0.00013883223,0.00055824954,0.0043311473],"genre_scores_gemma":[0.8067556,0.0008105782,0.19061708,0.00031797535,0.000286999,0.00041114184,0.00047911803,0.00002930208,0.00029223046],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99580806,0.00095913355,0.0007464015,0.0008903461,0.000738226,0.0008578065],"domain_scores_gemma":[0.9835611,0.00046123084,0.0003850181,0.01251892,0.0024950572,0.0005786782],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019922422,0.00039410457,0.00044874538,0.00014239861,0.0007820078,0.0009184466,0.021336744,0.00030919822,0.000014475794],"category_scores_gemma":[0.00040425351,0.00042414406,0.00011169198,0.0014909666,0.00028785926,0.0016781746,0.006018003,0.0006667318,0.00018889741],"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.000052243275,0.00055496214,0.0005281213,0.000020429788,0.00014181562,0.000001803594,0.00023277721,0.0028484527,0.00023905124,0.78950435,0.15967302,0.04620298],"study_design_scores_gemma":[0.0008001159,0.0001097623,0.000074352116,0.00004519114,0.000027662889,0.000017761387,0.00012406854,0.9404365,0.00017381481,0.019564329,0.038194355,0.00043209814],"about_ca_topic_score_codex":0.00063600973,"about_ca_topic_score_gemma":0.0011480488,"teacher_disagreement_score":0.93758804,"about_ca_system_score_codex":0.0005520859,"about_ca_system_score_gemma":0.0010390062,"threshold_uncertainty_score":0.99982107},"labels":[],"label_agreement":null},{"id":"W2290061260","doi":"10.1109/glocom.2015.7417541","title":"Soft Input Soft Output MMSE-SQRD Based Turbo Equalization for MIMO-OFDM Systems under Imperfect Channel Estimation","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Minimum mean square error; Equalization (audio); MIMO; Turbo; Channel (broadcasting); Computer science; Algorithm; Control theory (sociology); Single antenna interference cancellation; Bit error rate; Orthogonal frequency-division multiplexing; Turbo code; Multiuser detection; Detector; Decoding methods; Mathematics; Engineering; Telecommunications; Statistics; Artificial intelligence","score_opus":0.10174419812301343,"score_gpt":0.3386342963510567,"score_spread":0.23689009822804324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290061260","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.0021350007,0.0023290757,0.9867955,0.00096427056,0.00067135406,0.0016584067,0.00044600974,0.0022141752,0.0027862391],"genre_scores_gemma":[0.9532517,0.00040257437,0.04355408,0.00020048862,0.000069662514,0.0011089917,0.0012244856,0.00009092562,0.00009709609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712527,0.00039224312,0.0009838914,0.0004356927,0.0004621538,0.0006007213],"domain_scores_gemma":[0.99387,0.00056514126,0.00037812776,0.0037493785,0.0010982376,0.0003390847],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008502451,0.0005474597,0.0006009881,0.0002239718,0.00040150573,0.00031435306,0.0025328433,0.00039125534,0.000007671565],"category_scores_gemma":[0.00042695046,0.0006171752,0.00015534626,0.00069714803,0.0002689779,0.00084571465,0.0003205021,0.00040808241,0.00014412869],"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.00007543503,0.0003533194,0.00030071943,0.00032728878,0.00016673177,7.145388e-7,0.0005613016,0.8975407,0.00063729,0.043145202,0.029282978,0.027608357],"study_design_scores_gemma":[0.0009600813,0.00009822999,0.00009633117,0.0002248199,0.00006691382,0.000008564506,0.00040504738,0.97452796,0.0007964279,0.008580969,0.013561008,0.00067363406],"about_ca_topic_score_codex":0.00027083405,"about_ca_topic_score_gemma":0.00034631157,"teacher_disagreement_score":0.9511167,"about_ca_system_score_codex":0.0010807415,"about_ca_system_score_gemma":0.00043120817,"threshold_uncertainty_score":0.99962795},"labels":[],"label_agreement":null},{"id":"W2290220234","doi":"10.1109/glocom.2015.7417519","title":"Optimal Power Allocation for CR MIMO Energy Harvesting Coexisting Systems","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Energy harvesting; Mathematical optimization; Cognitive radio; Computer science; Throughput; MIMO; Optimization problem; Energy (signal processing); Efficient energy use; Lift (data mining); Power (physics); Maximization; Algorithm; Wireless; Channel (broadcasting); Mathematics; Telecommunications; Engineering; Electrical engineering","score_opus":0.08267918218134668,"score_gpt":0.30248647408990875,"score_spread":0.21980729190856207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290220234","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.0227292,0.0060772034,0.86353606,0.0006912007,0.00344629,0.0007536365,0.000269028,0.0023057011,0.100191675],"genre_scores_gemma":[0.953678,0.00018039394,0.044629764,0.00007196299,0.00020597919,0.00035962404,0.00030841958,0.000070034046,0.00049579865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754155,0.00023361992,0.00079838675,0.0003971425,0.00035153187,0.0006777997],"domain_scores_gemma":[0.9958268,0.00041568174,0.0002583863,0.0020399923,0.0010672277,0.0003919537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007558374,0.00042939812,0.00045677513,0.00008955349,0.00036199446,0.00043273962,0.0018834374,0.0002913016,0.000008460319],"category_scores_gemma":[0.00043872884,0.0004996041,0.00010238881,0.0005028442,0.0002313148,0.0005311328,0.00027559279,0.00032588374,0.000050832474],"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.00002021925,0.000101486,0.00077992264,0.00007464817,0.00013650162,0.0000022647343,0.00024492093,0.82300377,0.00029850952,0.12979564,0.039846558,0.005695562],"study_design_scores_gemma":[0.0006074269,0.00006461418,0.00016741954,0.00028266737,0.00005149263,0.00003666663,0.0004628795,0.9145632,0.00010057659,0.0005258119,0.08254854,0.0005887274],"about_ca_topic_score_codex":0.0012036768,"about_ca_topic_score_gemma":0.0009202887,"teacher_disagreement_score":0.93094885,"about_ca_system_score_codex":0.00060837826,"about_ca_system_score_gemma":0.00029843135,"threshold_uncertainty_score":0.99974555},"labels":[],"label_agreement":null},{"id":"W2290254866","doi":"10.1109/glocom.2015.7417111","title":"An Energy-Efficient Backpressure Routing and Scheduling Algorithm for Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Network packet; Efficient energy use; Scheduling (production processes); Maximum throughput scheduling; Distributed computing; Energy consumption; Algorithm; Fair-share scheduling; Round-robin scheduling; Mathematical optimization; Engineering; Quality of service; Mathematics","score_opus":0.049831922094446014,"score_gpt":0.3060800277587588,"score_spread":0.2562481056643128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290254866","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.008804324,0.001628824,0.98501843,0.0011219829,0.00086955936,0.00039308693,0.000059685684,0.00050568115,0.001598424],"genre_scores_gemma":[0.6751998,0.00019975418,0.32397687,0.00025593766,0.0001456137,0.00007410594,0.00007497452,0.000024189507,0.00004873872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633324,0.0005943776,0.00069393666,0.00094366365,0.0005216978,0.00091311045],"domain_scores_gemma":[0.9934857,0.00035696043,0.00040620647,0.0037997703,0.001242861,0.0007085056],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00111021,0.00048926874,0.0005380091,0.00010712869,0.0007575255,0.000834943,0.0042478954,0.00033398462,0.0000030591493],"category_scores_gemma":[0.00006794008,0.0005143824,0.000118714845,0.00079985365,0.00038960445,0.00058201654,0.0011230165,0.00039981666,0.00001087935],"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.000017479493,0.00041721243,0.00042408644,0.000008643294,0.00007053477,0.0000047257026,0.00037219908,0.6038859,0.00006140747,0.19543439,0.0011121898,0.19819126],"study_design_scores_gemma":[0.00086672546,0.000119481265,0.00010842546,0.000090242684,0.000038597376,0.000041751635,0.00040354297,0.99359196,0.0000739229,0.0006667769,0.0034117608,0.00058680313],"about_ca_topic_score_codex":0.00047517623,"about_ca_topic_score_gemma":0.00036343175,"teacher_disagreement_score":0.6663955,"about_ca_system_score_codex":0.00025504423,"about_ca_system_score_gemma":0.00036654287,"threshold_uncertainty_score":0.99973077},"labels":[],"label_agreement":null},{"id":"W2290331499","doi":"10.1109/glocom.2015.7417463","title":"Distributed Space Time Coding for Bit-Interleaved Coded Modulation in Two-Way Relaying Communications","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rician fading; Computer science; Decoding methods; Algorithm; Rayleigh fading; Relay; Bit error rate; Coding (social sciences); Space–time code; Fading; Theoretical computer science; Mathematics; Statistics","score_opus":0.1402441959210119,"score_gpt":0.37247229194772247,"score_spread":0.23222809602671057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290331499","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.0069983597,0.0018172077,0.9454224,0.027975721,0.0004516628,0.0016815225,0.00025504062,0.0006743036,0.014723745],"genre_scores_gemma":[0.8991396,0.0010749748,0.09829761,0.0003243258,0.000035807072,0.00032286954,0.0005927382,0.00002367937,0.00018842284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959939,0.0012498362,0.001042883,0.00063988054,0.0004089394,0.0006645349],"domain_scores_gemma":[0.9890608,0.00079390855,0.00051999744,0.0076839738,0.0015686811,0.00037264105],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018627853,0.00043585035,0.0005909232,0.00023903218,0.0008538756,0.0006280294,0.008824962,0.00016362888,0.00001867077],"category_scores_gemma":[0.0006495472,0.00048874074,0.00016316876,0.001817703,0.00040971508,0.0013030424,0.002940831,0.0005965209,0.00022417183],"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.00010019441,0.0009559697,0.005150686,0.000029588717,0.00013133835,0.0000026288967,0.0027246724,0.004191793,0.0024515803,0.8914253,0.026467044,0.066369176],"study_design_scores_gemma":[0.0021157227,0.000072977746,0.0017053024,0.00021703854,0.000024383313,0.000015145063,0.0003172202,0.96183336,0.00010629269,0.012745981,0.020270105,0.0005764693],"about_ca_topic_score_codex":0.00029422747,"about_ca_topic_score_gemma":0.0039297715,"teacher_disagreement_score":0.95764154,"about_ca_system_score_codex":0.0010493345,"about_ca_system_score_gemma":0.00057432865,"threshold_uncertainty_score":0.9997564},"labels":[],"label_agreement":null},{"id":"W2290379373","doi":"10.1109/glocom.2015.7417872","title":"On Channel Reuse for Cloud Network Users","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Cloud computing; Interference (communication); Reuse; Service (business); Simple (philosophy); Channel allocation schemes; Assignment problem; Distributed computing; Wireless; Mathematical optimization; Mathematics; Telecommunications; Engineering","score_opus":0.17470084676440947,"score_gpt":0.3604966858107308,"score_spread":0.18579583904632133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290379373","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.0024848338,0.0032598418,0.89482844,0.04242818,0.0029177489,0.0015606937,0.00010010053,0.00089626835,0.051523887],"genre_scores_gemma":[0.9275361,0.0017508371,0.066804826,0.0027632134,0.00022807035,0.0003145268,0.00009424678,0.000023257224,0.0004849554],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971768,0.00064497255,0.00057759957,0.00055623887,0.0003890794,0.000655254],"domain_scores_gemma":[0.98904765,0.00052677264,0.0002995702,0.008435434,0.0012375972,0.0004529936],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012736148,0.00036426962,0.00040568382,0.000082309845,0.0008022551,0.00048083637,0.010841371,0.00016636477,0.00001731988],"category_scores_gemma":[0.00060986605,0.00037091578,0.00015337815,0.0010518389,0.0002546064,0.0006166528,0.0024668972,0.00039750137,0.00032192477],"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.000033248787,0.00017656328,0.000117210686,0.0000041847425,0.00003942977,6.553993e-7,0.00042477556,0.0015598838,0.0000075734592,0.65637106,0.3311514,0.010114047],"study_design_scores_gemma":[0.0021324116,0.00044333757,0.00046197438,0.00020113218,0.00003766,0.000019314746,0.00022707292,0.44029766,0.000049286908,0.16807544,0.38709036,0.00096434745],"about_ca_topic_score_codex":0.00005265975,"about_ca_topic_score_gemma":0.0006118124,"teacher_disagreement_score":0.9250512,"about_ca_system_score_codex":0.0004097739,"about_ca_system_score_gemma":0.00059631467,"threshold_uncertainty_score":0.9998743},"labels":[],"label_agreement":null},{"id":"W2290617295","doi":"10.1109/glocom.2015.7417275","title":"Dual Decomposition Method for Energy-Efficient Resource Allocation in D2D Communications Underlying Cellular Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec à Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Resource allocation; Cellular network; Quality of service; Efficient energy use; Spectral efficiency; Dual (grammatical number); Resource management (computing); Mathematical optimization; Channel allocation schemes; Optimization problem; Channel (broadcasting); Computer network; Distributed computing; Wireless; Algorithm; Mathematics; Engineering; Telecommunications","score_opus":0.0915133012168476,"score_gpt":0.35624767789879275,"score_spread":0.26473437668194516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290617295","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.0005943034,0.0029423123,0.98547417,0.0009578678,0.00034263794,0.00082391495,0.000088706474,0.00044712116,0.008328984],"genre_scores_gemma":[0.8043768,0.0003547993,0.19355285,0.00008437513,0.000046740774,0.00048192014,0.0010127285,0.000046639318,0.00004316083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974088,0.00058364443,0.0008843972,0.00037346492,0.0002427426,0.00050692965],"domain_scores_gemma":[0.99537146,0.00038710344,0.00025001043,0.0031380565,0.00060815655,0.00024518548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010232052,0.00035922273,0.00042044546,0.00018988052,0.0003422555,0.0001566999,0.0016857947,0.0002802286,0.000005579641],"category_scores_gemma":[0.000071949704,0.00044200176,0.00009939766,0.0008711212,0.00016516562,0.00035652405,0.0003491338,0.00034562915,0.000021101849],"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.00002243227,0.00016284795,0.00009088542,0.000025692514,0.000041451756,5.1966e-7,0.00034162906,0.9499419,0.00055615033,0.03543915,0.0028039718,0.010573424],"study_design_scores_gemma":[0.0008867983,0.00003908128,0.000044276476,0.00012224085,0.000046062545,0.00001285667,0.0008701271,0.9817755,0.00018905659,0.0019585686,0.013634178,0.00042121546],"about_ca_topic_score_codex":0.00046627593,"about_ca_topic_score_gemma":0.002014278,"teacher_disagreement_score":0.80378246,"about_ca_system_score_codex":0.0011959743,"about_ca_system_score_gemma":0.00018642006,"threshold_uncertainty_score":0.9998032},"labels":[],"label_agreement":null},{"id":"W2290622669","doi":"10.1109/glocom.2015.7417612","title":"On Resource Allocation for Downlink Power Minimization in OFDMA Small Cells in a Cloud-RAN","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Macrocell; Telecommunications link; Transmitter power output; Quality of service; Computer science; C-RAN; Radio access network; Computer network; Optimization problem; Resource allocation; Orthogonal frequency-division multiple access; Cloud computing; Power control; Cellular network; Mathematical optimization; Power (physics); Orthogonal frequency-division multiplexing; Base station; Mathematics; Transmitter; Algorithm; Mobile station","score_opus":0.05364715362380884,"score_gpt":0.2894909691462616,"score_spread":0.23584381552245276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290622669","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.07120767,0.0018008843,0.8787228,0.0031343757,0.0018047919,0.0045046746,0.00062806,0.00088166015,0.037315123],"genre_scores_gemma":[0.98036665,0.00025320877,0.018281551,0.0001216299,0.00003922398,0.00045251456,0.00033598806,0.000041606392,0.000107621265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814665,0.00022329413,0.0007237438,0.00033203416,0.00017964812,0.00039461855],"domain_scores_gemma":[0.9976357,0.00022438433,0.00016756722,0.0014423815,0.00037372898,0.00015621417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048771643,0.00029797037,0.00035639628,0.00022067582,0.00007515855,0.0000796407,0.0009905973,0.0002497397,0.000012898561],"category_scores_gemma":[0.00022462825,0.00034984545,0.00005659873,0.00075249537,0.00008031817,0.00028691962,0.00009837518,0.00027071754,0.00006560552],"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.000099956946,0.000279115,0.00091704284,0.000054989898,0.000023404702,0.0000010170703,0.0011335545,0.9675746,0.0005103519,0.015412495,0.010657882,0.0033355996],"study_design_scores_gemma":[0.0033895287,0.00015167055,0.0006368395,0.00046169822,0.000027953976,0.000004573397,0.0012919573,0.96708983,0.000649417,0.0049712243,0.020550959,0.0007743182],"about_ca_topic_score_codex":0.00028875496,"about_ca_topic_score_gemma":0.004072997,"teacher_disagreement_score":0.909159,"about_ca_system_score_codex":0.00088342594,"about_ca_system_score_gemma":0.00016497434,"threshold_uncertainty_score":0.99989533},"labels":[],"label_agreement":null},{"id":"W2290702929","doi":"10.1109/glocom.2015.7417592","title":"Lightweight Security and Privacy-Preserving Scheme for V2G Connection","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vehicle-to-grid; Computer science; Scheme (mathematics); Computer security; Authentication (law); Grid; Computer network; Electricity; Smart grid; Trusted third party; Confidentiality; Pseudonym; Power (physics); Electric vehicle; Engineering; Electrical engineering","score_opus":0.0677478186504631,"score_gpt":0.3236808569134698,"score_spread":0.25593303826300673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290702929","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.07141516,0.0036461654,0.8561962,0.049603835,0.0005919533,0.0017276695,0.00015687259,0.0013477878,0.015314356],"genre_scores_gemma":[0.88206285,0.00033212194,0.11687582,0.0002709205,0.00003941117,0.0003237512,0.00003759436,0.00000948927,0.000048015794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813485,0.0001784024,0.00044075915,0.0005860481,0.00023659064,0.00042335544],"domain_scores_gemma":[0.9943235,0.00018875964,0.00024406385,0.0040636105,0.0008945818,0.00028552098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007956985,0.00026335602,0.00032051053,0.00010333963,0.0005959806,0.0003000794,0.0046771094,0.00029082023,0.000008598947],"category_scores_gemma":[0.00030935963,0.00027434077,0.00007448976,0.0006711427,0.0003624779,0.0007846853,0.0021983911,0.0003446644,0.000049070015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011115766,0.00021900481,0.0016051945,0.000019173493,0.00003892289,5.1070305e-7,0.00058386027,0.0000028687025,0.00011793088,0.96815604,0.02179441,0.0074509466],"study_design_scores_gemma":[0.0010883909,0.00013148153,0.00065598794,0.000041461808,0.00002769263,0.000052548326,0.00038613335,0.3031731,0.0005526751,0.5209883,0.17239884,0.0005033685],"about_ca_topic_score_codex":0.0002915753,"about_ca_topic_score_gemma":0.00058942434,"teacher_disagreement_score":0.8106477,"about_ca_system_score_codex":0.00018550226,"about_ca_system_score_gemma":0.00032269405,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W2290758895","doi":"10.1109/glocom.2015.7417236","title":"Communication-Efficient Decentralized Change Detection for Cognitive Wireless Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Fusion center; Cognitive radio; Computer science; False alarm; Wireless; Key (lock); Change detection; Metric (unit); Constraint (computer-aided design); Constant false alarm rate; Real-time computing; Computer network; Wireless sensor network; Energy consumption; Scheme (mathematics); Distributed computing; Telecommunications; Algorithm; Artificial intelligence; Computer security; Engineering","score_opus":0.10753653324572643,"score_gpt":0.3354080833985692,"score_spread":0.22787155015284277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290758895","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.003451396,0.0022688345,0.9858849,0.0022823806,0.001126302,0.001369076,0.00019894264,0.00056479074,0.0028533635],"genre_scores_gemma":[0.98117006,0.0009978708,0.016208297,0.0005305651,0.00009957939,0.0006747004,0.00025351226,0.000019867795,0.000045558052],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997123,0.00055805704,0.00063709693,0.00057058095,0.00043012173,0.0006811412],"domain_scores_gemma":[0.9937247,0.00037836947,0.00043251444,0.0029279115,0.0020317065,0.0005048026],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008541613,0.00037173976,0.00042096956,0.000101491016,0.0007848891,0.00060246774,0.0034627446,0.00025980154,0.000011571254],"category_scores_gemma":[0.00015884166,0.00039528607,0.0001814834,0.0013393748,0.0003403029,0.00062580436,0.0007962134,0.00039149454,0.00009502425],"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.00033881422,0.0018784475,0.000569244,0.00003169021,0.00033477522,0.00000443495,0.001787544,0.0068612164,0.00004604224,0.1770287,0.012889101,0.79823],"study_design_scores_gemma":[0.0017933517,0.00013562654,0.00067527674,0.00008523501,0.000052529682,0.000031909345,0.00053539994,0.9739573,0.00009936522,0.0023904417,0.019757027,0.00048651831],"about_ca_topic_score_codex":0.00048538853,"about_ca_topic_score_gemma":0.0010707817,"teacher_disagreement_score":0.97771865,"about_ca_system_score_codex":0.0004468566,"about_ca_system_score_gemma":0.0002501338,"threshold_uncertainty_score":0.9998499},"labels":[],"label_agreement":null},{"id":"W2290852076","doi":"10.1109/glocom.2015.7417852","title":"Movement Prediction in Vehicular Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Kalman filter; Reliability (semiconductor); Hidden Markov model; Movement (music); Reduction (mathematics); Filter (signal processing); Extended Kalman filter; Markov chain; Artificial intelligence; Machine learning; Power (physics); Mathematics","score_opus":0.04307966333898192,"score_gpt":0.2713759324600797,"score_spread":0.22829626912109777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290852076","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.38809973,0.028869543,0.3158977,0.0047748587,0.006590383,0.004109745,0.0005622137,0.0042523313,0.24684349],"genre_scores_gemma":[0.99562687,0.0010103226,0.002517608,0.0002020841,0.00011673866,0.00015748708,0.0002405134,0.00003373961,0.00009465611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978412,0.00023896323,0.0006102462,0.0003061549,0.00037815177,0.0006252904],"domain_scores_gemma":[0.99701077,0.00004944369,0.00008873419,0.0022223839,0.0002726943,0.00035595175],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066660764,0.0003337985,0.00035672524,0.00009344138,0.000109467306,0.00013531598,0.0014677482,0.00026456904,0.00005741701],"category_scores_gemma":[0.000043835276,0.00037911948,0.000086723936,0.0007059619,0.00014888665,0.00037631427,0.00030660065,0.0005804966,0.0002841523],"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.000009484959,0.00010261806,0.007023761,0.000009618058,0.0000530385,0.0000059410763,0.00009644595,0.9447603,0.000029902863,0.0042002825,0.039228357,0.0044802106],"study_design_scores_gemma":[0.0007604942,0.000040024835,0.005080611,0.00008919658,0.000028923598,0.000012284416,0.0001703837,0.9638943,0.000019457186,0.002017546,0.027554475,0.00033231167],"about_ca_topic_score_codex":0.000413961,"about_ca_topic_score_gemma":0.0030878885,"teacher_disagreement_score":0.60752714,"about_ca_system_score_codex":0.0009698365,"about_ca_system_score_gemma":0.00016819026,"threshold_uncertainty_score":0.99986607},"labels":[],"label_agreement":null},{"id":"W2290855852","doi":"10.1109/glocom.2015.7417308","title":"Cognitive MU-MIMO Scheduling in Circular Array Based Heterogeneous Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Codebook; Computer science; MIMO; Scheduling (production processes); Spectral efficiency; Wireless; Telecommunications link; Cognitive radio; Computer network; Schedule; Heterogeneous network; Wireless network; Distributed computing; Telecommunications; Algorithm; Engineering","score_opus":0.05973339818328947,"score_gpt":0.3023882915081686,"score_spread":0.24265489332487913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290855852","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.01220578,0.0032181954,0.9744655,0.00017766433,0.000553984,0.0006644957,0.000085754444,0.0005143921,0.008114255],"genre_scores_gemma":[0.97756135,0.00027335942,0.02153246,0.00011126639,0.000056242974,0.00016677652,0.00024073619,0.000045671975,0.000012117803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997996,0.00028740868,0.0006235109,0.00034059116,0.00023450292,0.00051798776],"domain_scores_gemma":[0.9973368,0.00013755752,0.00014605792,0.0015331695,0.0005608977,0.00028549854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041785615,0.00035758747,0.0004172636,0.00012777951,0.00013097606,0.00012217672,0.001085341,0.00024753448,0.00002487189],"category_scores_gemma":[0.00017717153,0.00043106716,0.00008383446,0.0007353461,0.00016892861,0.00039068153,0.00011838118,0.00043553303,0.00014019701],"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.000014328844,0.00007724845,0.003019415,0.000021044096,0.00003723887,0.0000052363735,0.00011551101,0.9946753,0.000107638145,0.00037362162,0.00016833383,0.001385124],"study_design_scores_gemma":[0.0011339594,0.000031870873,0.00026233864,0.0002555769,0.000033014807,0.000021121696,0.00041447303,0.99586624,0.00023085163,0.00045627033,0.0008175159,0.0004767908],"about_ca_topic_score_codex":0.00021390969,"about_ca_topic_score_gemma":0.0013991527,"teacher_disagreement_score":0.9653556,"about_ca_system_score_codex":0.00066413573,"about_ca_system_score_gemma":0.00023363512,"threshold_uncertainty_score":0.9998141},"labels":[],"label_agreement":null},{"id":"W2290869909","doi":"10.1109/glocom.2015.7416992","title":"Energy-Efficient Virtual Link Reconfiguration for Off-Peak Time","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control reconfiguration; Energy consumption; Computer science; Heuristic; Energy (signal processing); Distributed computing; The Internet; Computer network; Virtual machine; Real-time computing; Embedded system; Engineering; Operating system; Mathematics","score_opus":0.07031926283592606,"score_gpt":0.3028435882840499,"score_spread":0.23252432544812385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290869909","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.0012792093,0.001851509,0.9585349,0.010387204,0.0012491978,0.00055930135,0.00015631535,0.0006699482,0.025312401],"genre_scores_gemma":[0.94320774,0.00042822625,0.05272791,0.0012304322,0.00029540295,0.00029745657,0.00033875208,0.000028438857,0.0014456365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974214,0.000325209,0.0006467548,0.00059840915,0.0004404362,0.0005677798],"domain_scores_gemma":[0.99420726,0.00037034816,0.00033774052,0.0034644506,0.0012092374,0.00041098974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080918026,0.0003448453,0.00039537565,0.00010102257,0.0004412646,0.000503198,0.004248147,0.00023282658,0.00003899924],"category_scores_gemma":[0.00021061141,0.0003481894,0.00015912208,0.0007330418,0.00020893259,0.00052510615,0.00069527444,0.00023082132,0.00048547762],"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.00004409419,0.00032322147,0.000103956714,0.000005549424,0.00006135742,0.0000016479329,0.00033419428,0.003342006,0.0000839476,0.45916378,0.15613742,0.3803988],"study_design_scores_gemma":[0.0008730419,0.0002477825,0.00020035722,0.00004865781,0.000026741971,0.000023165925,0.00006529127,0.77232146,0.00008279629,0.013165636,0.21248244,0.0004626291],"about_ca_topic_score_codex":0.00022992332,"about_ca_topic_score_gemma":0.00027822505,"teacher_disagreement_score":0.9419285,"about_ca_system_score_codex":0.0003308737,"about_ca_system_score_gemma":0.000808251,"threshold_uncertainty_score":0.999897},"labels":[],"label_agreement":null},{"id":"W2290883389","doi":"10.1109/glocom.2015.7417241","title":"Secure MIMO AF Relaying Design: An Intercept Probability Constrained Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Eavesdropping; MIMO; Artificial noise; Robustness (evolution); Computer science; Channel state information; Secure transmission; Transmission (telecommunications); Interference alignment; Channel (broadcasting); Signal-to-noise ratio (imaging); Precoding; Computer network; Wireless; Mathematical optimization; Transmitter; Mathematics; Telecommunications","score_opus":0.17274338810332737,"score_gpt":0.335392778933646,"score_spread":0.16264939083031862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290883389","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.041640818,0.002386924,0.80433583,0.0021176685,0.00050072384,0.0027491227,0.00037512602,0.0059482576,0.13994552],"genre_scores_gemma":[0.77681875,0.00034867093,0.22205974,0.000099173005,0.000032426193,0.00032562658,0.00024787974,0.000043783257,0.00002393547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643964,0.0011072517,0.0008944921,0.0005075404,0.0004551246,0.0005959733],"domain_scores_gemma":[0.9920769,0.00017575432,0.00020657036,0.0060624727,0.00092756725,0.0005507815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014933968,0.00052808045,0.0005846798,0.00013247256,0.00030622043,0.00032809982,0.0047415392,0.00041669465,0.00006070652],"category_scores_gemma":[0.00022284464,0.0005875666,0.00013104186,0.0007316754,0.00080423534,0.0009883626,0.0007370969,0.0009457467,0.00014096372],"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.00039466174,0.006061824,0.009045357,0.0007335648,0.0010712498,0.00001585098,0.029410878,0.03795535,0.004892102,0.57149804,0.20858641,0.13033469],"study_design_scores_gemma":[0.0019481496,0.0003406726,0.0008539076,0.0002870148,0.00014538686,0.00016563643,0.0059059616,0.8951044,0.0010564217,0.054366447,0.03760982,0.0022161943],"about_ca_topic_score_codex":0.00029590336,"about_ca_topic_score_gemma":0.00048749815,"teacher_disagreement_score":0.85714906,"about_ca_system_score_codex":0.00081984745,"about_ca_system_score_gemma":0.00046239712,"threshold_uncertainty_score":0.9996576},"labels":[],"label_agreement":null},{"id":"W2290906325","doi":"10.1109/glocom.2015.7417239","title":"Prioritized Access in a Channel-Hopping Cognitive Network with Spectrum Sensing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Cognitive radio; Network packet; Channel (broadcasting); Transmission (telecommunications); Node (physics); Bandwidth (computing); Bandwidth allocation; Channel allocation schemes; Wireless; Telecommunications; Engineering","score_opus":0.08780904613142254,"score_gpt":0.3341840749583336,"score_spread":0.24637502882691104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290906325","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.034663517,0.0017892626,0.89218664,0.009982924,0.0008073935,0.0011572648,0.000030351948,0.0005522522,0.058830373],"genre_scores_gemma":[0.97950184,0.00034633544,0.019207954,0.0006458734,0.00018640069,0.000019147328,0.000031787116,0.000022161737,0.000038518712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643874,0.0006796546,0.0006008892,0.00075251027,0.0005199342,0.0010082858],"domain_scores_gemma":[0.9961659,0.00037317717,0.0003408485,0.0019585798,0.0007470018,0.00041452836],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00094572187,0.00044459515,0.000613722,0.00016759515,0.00044166725,0.0010692844,0.002776597,0.0001574886,0.000007664584],"category_scores_gemma":[0.00013907801,0.00044345736,0.00009215755,0.0023056532,0.00036733306,0.0013634212,0.0013568632,0.0006317981,0.000059424965],"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.0016199176,0.002264224,0.061082177,0.00014306729,0.0011202341,0.0012664127,0.010515813,0.020713797,0.00008618631,0.44236344,0.022847451,0.43597728],"study_design_scores_gemma":[0.0046495665,0.00028289016,0.013254137,0.0016652332,0.000081459955,0.00051218347,0.0011113336,0.9203531,0.000065613836,0.054082707,0.002429385,0.0015123752],"about_ca_topic_score_codex":0.0012649172,"about_ca_topic_score_gemma":0.0141813895,"teacher_disagreement_score":0.9448383,"about_ca_system_score_codex":0.00054358714,"about_ca_system_score_gemma":0.0009457899,"threshold_uncertainty_score":0.9999677},"labels":[],"label_agreement":null},{"id":"W2290975760","doi":"10.1109/glocom.2015.7417481","title":"Spatial Modulation in MIMO Cognitive Radio Networks with Channel Estimation Errors and Primary Interference Constraint","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"","keywords":"Pairwise error probability; Cognitive radio; Rayleigh fading; MIMO; Transmitter; Algorithm; Interference (communication); Constraint (computer-aided design); Upper and lower bounds; Computer science; Expression (computer science); Mathematics; Fading; Antenna diversity; Channel (broadcasting); Statistics; Control theory (sociology); Telecommunications; Artificial intelligence; Wireless","score_opus":0.04442127510991538,"score_gpt":0.28075959781208804,"score_spread":0.23633832270217264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290975760","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.07539867,0.0016898275,0.9148029,0.000698286,0.00014457814,0.0006965951,0.0000779537,0.0007282518,0.0057629407],"genre_scores_gemma":[0.9777789,0.0012580574,0.020444436,0.000042887874,0.000011634794,0.00018483517,0.00024643014,0.000024944611,0.00000789189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848026,0.00017317077,0.00049545406,0.00029814223,0.00020428494,0.0003486815],"domain_scores_gemma":[0.99776965,0.00018111404,0.00017685107,0.001343433,0.00037738628,0.00015155616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002844449,0.0003274217,0.00038007103,0.000157834,0.00013028638,0.00009973636,0.0010186826,0.00021627564,0.0000071546224],"category_scores_gemma":[0.00013495989,0.00034282656,0.000028019784,0.0005276895,0.0007458153,0.0005975518,0.00036401188,0.0005468991,0.000016302758],"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.00018854068,0.00028671866,0.01286258,0.00008352871,0.00013814539,0.0000068078134,0.0015372304,0.6524065,0.000121432415,0.012965247,0.00069276657,0.31871048],"study_design_scores_gemma":[0.0011063576,0.00009332899,0.014816608,0.00032042566,0.00002029289,0.000033119584,0.001454905,0.9779028,0.00008311506,0.0036557466,0.000090189766,0.00042308908],"about_ca_topic_score_codex":0.00033942427,"about_ca_topic_score_gemma":0.002682079,"teacher_disagreement_score":0.9023802,"about_ca_system_score_codex":0.00049114745,"about_ca_system_score_gemma":0.00015760225,"threshold_uncertainty_score":0.99990237},"labels":[],"label_agreement":null},{"id":"W2291009813","doi":"10.1109/glocom.2015.7417804","title":"Towards Intelligent LTE Mobility Management through MME Pooling","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Pooling; Mobility management; Quality of service; Distributed computing; Overhead (engineering); Heuristic; Context (archaeology); Computer network; Mobility model; Latency (audio); Mobile computing; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.19829539549030697,"score_gpt":0.40051725490992957,"score_spread":0.2022218594196226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291009813","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.0022402864,0.002869463,0.79844344,0.016293304,0.0008868759,0.001064284,0.0000443083,0.00068724115,0.17747077],"genre_scores_gemma":[0.8279891,0.0026963144,0.16794522,0.00059774186,0.000050889437,0.00026149245,0.0000603003,0.000019288724,0.00037965385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99497813,0.0011980877,0.00094750297,0.0008199977,0.0011503574,0.00090590527],"domain_scores_gemma":[0.98594344,0.00021497937,0.0003296879,0.01146222,0.0014869664,0.00056270044],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020208356,0.0004455309,0.0004954634,0.00013288904,0.0005840708,0.00081848353,0.015926402,0.00020493615,0.000052976025],"category_scores_gemma":[0.00016808236,0.00045839953,0.00018071716,0.0018104524,0.00061027665,0.0014250566,0.007561892,0.00075651595,0.00097616646],"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.000028630577,0.00084327307,0.00069011375,0.0000336647,0.00014500054,0.000008060446,0.0010879717,0.0018221262,0.000013826578,0.85454905,0.027843202,0.112935096],"study_design_scores_gemma":[0.0014332822,0.00018973867,0.0027693124,0.00023760949,0.000057422956,0.000060653798,0.0016361417,0.5401974,0.00030454333,0.18615249,0.26567957,0.0012818698],"about_ca_topic_score_codex":0.0013621988,"about_ca_topic_score_gemma":0.0006526059,"teacher_disagreement_score":0.8257488,"about_ca_system_score_codex":0.0011170375,"about_ca_system_score_gemma":0.0008231482,"threshold_uncertainty_score":0.9998017},"labels":[],"label_agreement":null},{"id":"W2291125951","doi":"10.1109/glocom.2015.7417599","title":"A Performance Study of CPRI over Ethernet with IEEE 802.1Qbu and 802.1Qbv Enhancements","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Jitter; Ethernet; Ethernet flow control; Computer network; Computer science; Telecommunications","score_opus":0.05805133289761593,"score_gpt":0.30277372917506423,"score_spread":0.2447223962774483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291125951","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.9797206,0.00071675295,0.0056565963,0.00012904222,0.00016193005,0.0006570651,0.000042959786,0.00046841058,0.012446649],"genre_scores_gemma":[0.98313147,0.00090142305,0.015712474,0.000025985792,0.000018856503,0.00011615923,0.000012806684,0.000026850003,0.00005397573],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983784,0.00008412638,0.00046840755,0.0002960997,0.0003639433,0.00040905087],"domain_scores_gemma":[0.99724036,0.000087956985,0.00014117881,0.0020408537,0.00032216235,0.00016751084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002334049,0.00033017487,0.00042983732,0.0000713113,0.00011604628,0.000055546672,0.0013794773,0.00015358649,0.000018788223],"category_scores_gemma":[0.00004674139,0.00030175518,0.00002741984,0.00052536867,0.00045334364,0.00039202097,0.0003778054,0.00039269286,0.000040245643],"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.0010170665,0.006494066,0.46202564,0.0006417049,0.00224627,0.000030890762,0.008528163,0.15375006,0.003371951,0.035040233,0.03410374,0.2927502],"study_design_scores_gemma":[0.013674655,0.0075957235,0.08115712,0.0013145559,0.0007069216,0.000103721395,0.022031961,0.83150077,0.0023561714,0.01224458,0.022778481,0.0045353603],"about_ca_topic_score_codex":0.00012315504,"about_ca_topic_score_gemma":0.0009815721,"teacher_disagreement_score":0.6777507,"about_ca_system_score_codex":0.00019807045,"about_ca_system_score_gemma":0.00008393435,"threshold_uncertainty_score":0.99994344},"labels":[],"label_agreement":null},{"id":"W2291294793","doi":"10.1109/glocom.2015.7417108","title":"Time-Frequency Resource Conversion Based Scheduling for On-Demand Data Services","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Provisioning; Quality of service; Scheduling (production processes); Computer network; Distributed computing; Time complexity; Job shop scheduling; Dynamic priority scheduling; Mathematical optimization; Real-time computing; Algorithm; Routing (electronic design automation)","score_opus":0.0803395251705915,"score_gpt":0.31372039062506635,"score_spread":0.23338086545447484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291294793","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.012972537,0.0036206453,0.93707573,0.0028522185,0.0008433366,0.0018871977,0.0019758332,0.0018084666,0.036964044],"genre_scores_gemma":[0.84264946,0.00030621214,0.15287732,0.00034270997,0.00010874225,0.000085806685,0.0035076858,0.000054606426,0.00006745041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983603,0.00014358849,0.00042588302,0.00039494157,0.0002809884,0.00039430597],"domain_scores_gemma":[0.99519354,0.00023960746,0.00015089342,0.0037461733,0.00042012258,0.00024963488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047982438,0.00030443634,0.00031246178,0.00007546209,0.0002581857,0.00012372488,0.002925509,0.00018331433,0.000032555537],"category_scores_gemma":[0.00008930023,0.00033857455,0.000050355364,0.00040656165,0.00016360912,0.00059763645,0.0003630444,0.00024602536,0.00024424065],"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.00006626053,0.00011685402,0.0004370982,0.00010397063,0.00006389154,9.3785115e-7,0.00011505191,0.96708834,0.0001431568,0.0030061693,0.025476288,0.0033819594],"study_design_scores_gemma":[0.0009775385,0.00005375578,0.00003333757,0.00017546107,0.00004390692,0.0000023551268,0.00020150452,0.96831346,0.000096305106,0.0009972608,0.028757099,0.000347998],"about_ca_topic_score_codex":0.000040357518,"about_ca_topic_score_gemma":0.000112867514,"teacher_disagreement_score":0.8296769,"about_ca_system_score_codex":0.00031155068,"about_ca_system_score_gemma":0.00018325575,"threshold_uncertainty_score":0.9999066},"labels":[],"label_agreement":null},{"id":"W2291315001","doi":"10.1109/glocom.2015.7417730","title":"Automatic Device-Transparent RSS-Based Indoor Localization","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"RSS; Computer science; Set (abstract data type); k-nearest neighbors algorithm; Signal strength; Point (geometry); Transformation (genetics); Data mining; Mobile device; Artificial intelligence; Algorithm; Wireless; Mathematics","score_opus":0.10578393134962144,"score_gpt":0.32774544238991604,"score_spread":0.2219615110402946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291315001","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.029010098,0.0026348222,0.92275053,0.0022650273,0.0012633393,0.0010629303,0.00029770235,0.0055432995,0.03517223],"genre_scores_gemma":[0.991375,0.00023675803,0.0076091853,0.00027267588,0.000027597976,0.00013031832,0.00028737125,0.000033637723,0.000027453883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981252,0.0001543604,0.00061758596,0.00026070274,0.00039923136,0.00044292683],"domain_scores_gemma":[0.9970077,0.00007061008,0.000119863085,0.0020034125,0.0005659002,0.0002324656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030135305,0.0003480303,0.00036819742,0.0001465271,0.00022208648,0.00017214374,0.0017710028,0.0002790944,0.00012026768],"category_scores_gemma":[0.00013406029,0.00036375085,0.00008824651,0.00090231386,0.00029858478,0.00032821856,0.00013446483,0.0002880868,0.00042336446],"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.00008575946,0.0012779774,0.07523504,0.0007935213,0.0005327169,0.000021081205,0.002074068,0.38789037,0.00040510955,0.103651375,0.20248824,0.22554474],"study_design_scores_gemma":[0.00086022756,0.000051306975,0.00084246555,0.00011509879,0.000057865338,0.0000070482997,0.0004983005,0.9597991,0.0011915663,0.0027917419,0.03330599,0.00047927367],"about_ca_topic_score_codex":0.00017726123,"about_ca_topic_score_gemma":0.00093582907,"teacher_disagreement_score":0.9623649,"about_ca_system_score_codex":0.00054690323,"about_ca_system_score_gemma":0.00033252055,"threshold_uncertainty_score":0.99988145},"labels":[],"label_agreement":null},{"id":"W2291446608","doi":"10.1109/glocom.2015.7417346","title":"A Novel Massive MIMO Precoding Scheme for Next Generation Heterogeneous Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Precoding; MIMO; Computer science; Heterogeneous network; Base station; Channel state information; Computer network; Zero-forcing precoding; Quality of service; Cellular network; Scheme (mathematics); Interference (communication); Channel (broadcasting); Wireless; Wireless network; Telecommunications; Mathematics","score_opus":0.16808330798188822,"score_gpt":0.32214293676195266,"score_spread":0.15405962878006443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291446608","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.002324403,0.0021000172,0.9890348,0.0003075929,0.0010773672,0.0010188606,0.00017868025,0.0004992591,0.003459053],"genre_scores_gemma":[0.82044756,0.00037836557,0.17788361,0.00006846054,0.0002184874,0.00042380881,0.00045652152,0.000046257388,0.00007693147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.00008360873,0.0005834341,0.00032640932,0.00017551555,0.00045754868],"domain_scores_gemma":[0.99708766,0.00008541831,0.0001915561,0.0015955393,0.00078275293,0.00025705184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002862345,0.0003330589,0.00034639452,0.000071467315,0.00024800713,0.00023787924,0.0010429708,0.00023463382,0.000013934306],"category_scores_gemma":[0.00013091404,0.00038689558,0.00009803583,0.0003548234,0.000097772696,0.00066735514,0.00017221198,0.0002139101,0.000053661977],"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.000016588448,0.00007920284,0.0001440176,0.000029497405,0.00009128141,5.0335024e-7,0.00017001388,0.9736119,0.0039089094,0.005334539,0.011362209,0.005251319],"study_design_scores_gemma":[0.000792996,0.000045221408,0.000010036316,0.000059320948,0.00003519331,0.00002416009,0.00016131782,0.9905146,0.00039425862,0.00032403265,0.0072425026,0.0003963912],"about_ca_topic_score_codex":0.00008141818,"about_ca_topic_score_gemma":0.00077523425,"teacher_disagreement_score":0.81812316,"about_ca_system_score_codex":0.00065430294,"about_ca_system_score_gemma":0.00015599327,"threshold_uncertainty_score":0.9998583},"labels":[],"label_agreement":null},{"id":"W2291599761","doi":"10.1109/glocom.2015.7417507","title":"Resource Allocation Framework in 5G Multi-Hop Relay System","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Université du Québec à Montréal","funders":"","keywords":"Relay; Software deployment; Computer science; Architecture; Hop (telecommunications); Resource allocation; Computer network; LTE Advanced; Resource management (computing); Resource (disambiguation); Principal (computer security); Distributed computing; Telecommunications link; Computer security","score_opus":0.14822520384097848,"score_gpt":0.35750853897528523,"score_spread":0.20928333513430675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291599761","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.0044757593,0.005398003,0.90817195,0.018808583,0.0007982765,0.0009797642,0.000027552196,0.0009586428,0.06038148],"genre_scores_gemma":[0.88888466,0.00071135996,0.10937888,0.000534184,0.000043940778,0.0001489266,0.000047080455,0.000016222835,0.00023473105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99600005,0.0014847154,0.00085866655,0.000616012,0.0004957916,0.00054475944],"domain_scores_gemma":[0.9914351,0.00034938226,0.00035790072,0.006488149,0.0009758267,0.0003936526],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016638867,0.00036319532,0.00044263666,0.00018788931,0.00045990004,0.0004895862,0.0076305848,0.00027247897,0.000013362192],"category_scores_gemma":[0.0004943259,0.0003861285,0.00009844635,0.0019506982,0.00026552792,0.00087139884,0.0012815528,0.0007818606,0.00051232235],"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.000020890484,0.00044518805,0.0035975873,0.000019729505,0.000036978385,0.000005712923,0.0027458307,0.0014855106,0.0000741654,0.9346572,0.012873954,0.04403725],"study_design_scores_gemma":[0.001783128,0.00011059747,0.006360197,0.00076857855,0.000025591306,0.0000610507,0.0029550784,0.8519553,0.00008929671,0.0028184126,0.13206096,0.0010118235],"about_ca_topic_score_codex":0.0003239187,"about_ca_topic_score_gemma":0.002127816,"teacher_disagreement_score":0.9318388,"about_ca_system_score_codex":0.0010717551,"about_ca_system_score_gemma":0.000658722,"threshold_uncertainty_score":0.99985904},"labels":[],"label_agreement":null},{"id":"W2291697181","doi":"10.1109/glocom.2015.7417264","title":"Femto-Cloud Formation: A Coalitional Game-Theoretic Approach","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Cloud computing; Computer science; Game theory; Femto-; Mathematical economics; Computer network; Economics; Operating system","score_opus":0.07429691881509605,"score_gpt":0.3076552326631586,"score_spread":0.23335831384806255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291697181","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.0027703089,0.0008307411,0.90652126,0.014525901,0.00030124618,0.0005758545,0.00010858585,0.00080649764,0.07355961],"genre_scores_gemma":[0.8870343,0.00019598017,0.11151229,0.0005856188,0.000057341418,0.0003427668,0.00015121754,0.000009761888,0.000110723755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745536,0.00037819537,0.0006137853,0.0005408516,0.00050657924,0.0005052545],"domain_scores_gemma":[0.9935411,0.00011057563,0.00030239,0.00472899,0.00096804474,0.00034885408],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009073675,0.00031578334,0.00034689717,0.00012659784,0.0004532847,0.0003356017,0.0063371155,0.00029447846,0.000031530817],"category_scores_gemma":[0.00011333169,0.00032401033,0.000116056435,0.0011652187,0.0007861329,0.000754129,0.00134527,0.0004905482,0.00052570354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005528828,0.000315284,0.00018104269,0.000010143445,0.000020436555,8.863612e-7,0.00041298356,0.00005220561,0.0000074825725,0.97184646,0.022518009,0.004629536],"study_design_scores_gemma":[0.0009758154,0.00009025314,0.00037949675,0.000031641328,0.000030589155,0.00025289506,0.00068998046,0.39614415,0.00009061651,0.51008373,0.09063928,0.0005915664],"about_ca_topic_score_codex":0.00014436313,"about_ca_topic_score_gemma":0.00012241,"teacher_disagreement_score":0.884264,"about_ca_system_score_codex":0.0003574211,"about_ca_system_score_gemma":0.0005728378,"threshold_uncertainty_score":0.9999212},"labels":[],"label_agreement":null},{"id":"W2291762122","doi":"10.1109/glocom.2015.7417351","title":"Cloud-MERVS: An IoT Cloud-Based Error Recovery Video Streaming Scheme","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cloud computing; Computer network; Service provider; Service (business); Key (lock); Quality of service; The Internet; Scheme (mathematics); Real-time computing; Computer security; World Wide Web; Operating system","score_opus":0.12888610169530296,"score_gpt":0.35092055837383823,"score_spread":0.22203445667853527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291762122","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.2446236,0.0025057583,0.6572363,0.013940037,0.027886057,0.001347706,0.00007342967,0.0025791745,0.049807977],"genre_scores_gemma":[0.8320966,0.000048062688,0.16509543,0.0011442946,0.0012417247,0.000056698536,0.00010358947,0.00003435198,0.00017929295],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957658,0.0007762811,0.00087664195,0.00090047286,0.00071640423,0.00096438226],"domain_scores_gemma":[0.9910672,0.0002820865,0.00048641808,0.0062324526,0.0011721639,0.00075970974],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014435226,0.00054497464,0.0005722587,0.00017914611,0.00074990833,0.00088229054,0.008299291,0.00028896309,0.00001621869],"category_scores_gemma":[0.0003219147,0.00058441184,0.00020173259,0.0012581253,0.0003607366,0.0011326891,0.0017415567,0.00063077634,0.000615375],"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.00032256704,0.003915783,0.030348282,0.00013396723,0.0004310507,0.00006990593,0.003911687,0.0032090982,0.0010255324,0.15398943,0.46517134,0.33747137],"study_design_scores_gemma":[0.0021157586,0.0006687036,0.0026469876,0.0003040784,0.000063400694,0.00006645846,0.00045533245,0.8264089,0.00044000926,0.019592583,0.14559838,0.0016394014],"about_ca_topic_score_codex":0.0012723238,"about_ca_topic_score_gemma":0.0006253176,"teacher_disagreement_score":0.8231998,"about_ca_system_score_codex":0.00064915925,"about_ca_system_score_gemma":0.0017513593,"threshold_uncertainty_score":0.99966073},"labels":[],"label_agreement":null},{"id":"W2291871635","doi":"10.1109/glocom.2015.7417073","title":"HePNC: A Cross-Layer Design for MIMO Networks with Asymmetric Two-Way Relay Channel","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Relay; MIMO; Relay channel; Computer science; Channel (broadcasting); Computer network; Layer (electronics); Physics; Materials science","score_opus":0.19962204265061248,"score_gpt":0.3754777279001943,"score_spread":0.1758556852495818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291871635","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.0006884931,0.00408454,0.9738374,0.0047688438,0.0005466905,0.0012346139,0.00003250805,0.00044949717,0.01435744],"genre_scores_gemma":[0.82592845,0.0013298347,0.1708123,0.0008180404,0.00009570248,0.00047003428,0.000061779545,0.000028871436,0.0004550143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961809,0.00096649665,0.0007437141,0.00076584844,0.0005096198,0.000833415],"domain_scores_gemma":[0.98985934,0.00069992896,0.00045183665,0.005858233,0.002558869,0.00057179213],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0019680979,0.00051103916,0.0005541626,0.0002073407,0.0010263409,0.0010684894,0.007847212,0.00020745015,0.0000142903355],"category_scores_gemma":[0.00032821245,0.00046731575,0.00015113232,0.0025031895,0.000459814,0.0011936808,0.0016535159,0.0005668527,0.00014420599],"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.00043857226,0.0014702724,0.0048989286,0.00003291446,0.00045230566,0.000011202599,0.0018696924,0.14158653,0.000064189444,0.5823567,0.13168947,0.13512926],"study_design_scores_gemma":[0.0025975578,0.00038965043,0.0009898525,0.00010873571,0.000043992848,0.000053817894,0.00010142433,0.9564922,0.00008328453,0.0034712693,0.034902666,0.00076556497],"about_ca_topic_score_codex":0.00015601396,"about_ca_topic_score_gemma":0.00089726545,"teacher_disagreement_score":0.82523996,"about_ca_system_score_codex":0.00049066887,"about_ca_system_score_gemma":0.0008555106,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W2292172383","doi":"10.1109/glocom.2015.7417422","title":"A Comprehensive Reputation System to Improve the Security of Opportunistic Routing Protocols in Wireless Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Computer science; Computer network; Reliability (semiconductor); Routing protocol; Trust management (information system); Network packet; Routing (electronic design automation); Computer security; Wireless; Reputation system; Wireless network; Telecommunications","score_opus":0.083615609809657,"score_gpt":0.345561148906993,"score_spread":0.26194553909733603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292172383","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.015794484,0.00021780303,0.94760543,0.0033681437,0.0008436028,0.019757858,0.00009825792,0.00042808882,0.011886359],"genre_scores_gemma":[0.9884265,0.000020103716,0.0070764953,0.0002284471,0.000050707666,0.004141644,0.000027485361,0.000012925115,0.000015707717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631685,0.001046913,0.0010335709,0.0005492768,0.0005209604,0.00053240615],"domain_scores_gemma":[0.9927905,0.00038696508,0.0006607851,0.0044593797,0.0013789448,0.00032341],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0014474225,0.00030803852,0.0005277267,0.00007917212,0.0002358141,0.00030780138,0.0053818403,0.00017370336,0.000002367714],"category_scores_gemma":[0.0001416904,0.00027283275,0.000089001536,0.0013765541,0.00026002055,0.0004848643,0.0017599922,0.0004870964,0.000033137705],"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.000081386366,0.00040152614,0.00451906,0.00011293159,0.00006349813,0.000014224373,0.0025356761,0.014445959,0.000091884736,0.93124884,0.0050565624,0.04142842],"study_design_scores_gemma":[0.0006493197,0.00015257878,0.0015980662,0.00040480407,0.000014668792,0.000028259257,0.0012220355,0.9913387,0.000021595051,0.002565866,0.001701062,0.00030304768],"about_ca_topic_score_codex":0.0013080208,"about_ca_topic_score_gemma":0.0010902416,"teacher_disagreement_score":0.9768927,"about_ca_system_score_codex":0.00060834945,"about_ca_system_score_gemma":0.0007960034,"threshold_uncertainty_score":0.9999995},"labels":[],"label_agreement":null},{"id":"W2292416797","doi":"10.1109/glocom.2015.7417595","title":"Zoning Based MAC with Support for Recharging Process in WSN","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Zoning; Process (computing); Computer network; Computer security; Operating system; Engineering","score_opus":0.07871567800747788,"score_gpt":0.32399245179622593,"score_spread":0.24527677378874807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292416797","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.20742509,0.0019582086,0.63071716,0.0030561895,0.0015446579,0.0026788642,0.00051017164,0.003307263,0.14880238],"genre_scores_gemma":[0.95487756,0.0000555758,0.044188302,0.00010811048,0.00004726694,0.00038547983,0.0002261873,0.00004760543,0.000063902524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833405,0.00010763613,0.0004543195,0.00029674277,0.0002559939,0.000551278],"domain_scores_gemma":[0.99751085,0.00019717774,0.000120873745,0.0014668644,0.0004717478,0.00023248562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060049375,0.00030552925,0.00034861272,0.00010498214,0.00013716299,0.00013564584,0.001458201,0.00017114796,0.000018606699],"category_scores_gemma":[0.00013187305,0.00032095835,0.00004642589,0.0006515693,0.00015387306,0.00034765876,0.000096551994,0.00038851937,0.000027092186],"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.00009592326,0.00020174778,0.023829633,0.0001882098,0.00007571026,0.000008711401,0.00059257774,0.94207215,0.00008380642,0.013574125,0.010208359,0.009069047],"study_design_scores_gemma":[0.0015335731,0.000102104605,0.00081223407,0.00045315144,0.000033423188,0.000017362205,0.0004347005,0.9830843,0.00026751196,0.0013231569,0.011359893,0.0005785902],"about_ca_topic_score_codex":0.00018271126,"about_ca_topic_score_gemma":0.0026684494,"teacher_disagreement_score":0.7474525,"about_ca_system_score_codex":0.00043769306,"about_ca_system_score_gemma":0.0005126948,"threshold_uncertainty_score":0.99992424},"labels":[],"label_agreement":null},{"id":"W2292483374","doi":"10.1109/glocom.2015.7417297","title":"A Hybrid Transmission Approach for DASH over MBMS in LTE Network","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unicast; Dash; Computer science; Dynamic Adaptive Streaming over HTTP; Multicast; Computer network; Quality of experience; Transmission (telecommunications); Distributed computing; Telecommunications; Quality of service","score_opus":0.14084638621523474,"score_gpt":0.3839294724330211,"score_spread":0.24308308621778638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292483374","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.0011591831,0.0009908349,0.97321,0.0039348784,0.00028028365,0.00079754996,0.00005130509,0.0001782741,0.019397713],"genre_scores_gemma":[0.66648966,0.00019380637,0.3319084,0.00079190114,0.000069990114,0.00023126195,0.00011949183,0.000011626307,0.00018382639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718773,0.0005352891,0.0006565106,0.0005516044,0.00043605297,0.00063277985],"domain_scores_gemma":[0.9958707,0.00016977645,0.0002135857,0.0029857778,0.00043638618,0.00032373567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014996324,0.00029426723,0.0004103059,0.000075979406,0.000267215,0.00040920018,0.004422208,0.000118119926,0.00001114739],"category_scores_gemma":[0.000064321044,0.0002911581,0.00013431453,0.0006242918,0.00016133623,0.00097627373,0.0007187656,0.0003159143,0.000042957992],"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.00013439784,0.002104053,0.0042621903,0.000106435604,0.00010975499,0.000009259095,0.0018601613,0.005211862,0.00009411319,0.58248967,0.22780438,0.17581372],"study_design_scores_gemma":[0.0020326306,0.00016175296,0.0015696532,0.00010282338,0.00002644523,0.000023050721,0.00021444813,0.83155894,0.000078160665,0.055670757,0.107957594,0.00060375605],"about_ca_topic_score_codex":0.0006488839,"about_ca_topic_score_gemma":0.00023257725,"teacher_disagreement_score":0.82634705,"about_ca_system_score_codex":0.00035089866,"about_ca_system_score_gemma":0.0008011399,"threshold_uncertainty_score":0.99995404},"labels":[],"label_agreement":null},{"id":"W2292622906","doi":"10.1109/glocom.2015.7417116","title":"A Novel Spectrum Monitoring Algorithm for OFDM-Based Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cognitive radio; Orthogonal frequency-division multiplexing; Computer science; Interference (communication); Throughput; Transmission (telecommunications); Electronic engineering; Computer network; Telecommunications; Wireless; Engineering; Channel (broadcasting)","score_opus":0.08714631431027008,"score_gpt":0.32749119010513106,"score_spread":0.24034487579486097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292622906","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.00073062995,0.0014769287,0.9870833,0.00318873,0.0013936217,0.0008534153,0.00014377074,0.0004065449,0.0047230185],"genre_scores_gemma":[0.7597141,0.00016960659,0.23916249,0.00028546824,0.00038939086,0.00010916461,0.0000786072,0.000025312504,0.00006583389],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969619,0.00026992837,0.00061121525,0.0007576106,0.00047786674,0.00092146284],"domain_scores_gemma":[0.99504876,0.0006363487,0.00035438617,0.0022311786,0.0011862474,0.00054308993],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008483365,0.0004729532,0.000550637,0.00013271873,0.00062233076,0.00069716404,0.0030027912,0.0002177518,0.000007102383],"category_scores_gemma":[0.00016897818,0.00051229633,0.00022939552,0.0010600389,0.0003462186,0.00069337053,0.0006050006,0.0004817471,0.00004494264],"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.00016322681,0.0016291052,0.003761108,0.000028204502,0.000484273,0.000029049972,0.00078362727,0.0063942806,0.00014304266,0.09670825,0.012907175,0.8769687],"study_design_scores_gemma":[0.00236578,0.00021392477,0.0013064089,0.00021378514,0.00007114969,0.000064981185,0.00023954593,0.9866867,0.00021650994,0.004109446,0.0038715696,0.00064016436],"about_ca_topic_score_codex":0.00045085553,"about_ca_topic_score_gemma":0.00045682094,"teacher_disagreement_score":0.98029244,"about_ca_system_score_codex":0.00058335386,"about_ca_system_score_gemma":0.0008918907,"threshold_uncertainty_score":0.99973285},"labels":[],"label_agreement":null},{"id":"W2292635261","doi":"10.1109/glocom.2015.7417100","title":"SFET-Based Multiple Antenna Spectrum Sensing Using the Second Order Moments of Eigenvalues","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Detector; Cognitive radio; Eigenvalues and eigenvectors; False alarm; Independent and identically distributed random variables; Covariance matrix; Algorithm; Spectrum (functional analysis); Noise (video); Function (biology); Mathematics; Computer science; Statistics; Wireless; Telecommunications; Physics; Random variable; Artificial intelligence","score_opus":0.1007466253913436,"score_gpt":0.3209376719758574,"score_spread":0.22019104658451377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292635261","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.023478081,0.0005162558,0.9680314,0.0028753597,0.0008718675,0.00038786588,0.00017646827,0.00019641426,0.0034662602],"genre_scores_gemma":[0.9284415,0.000035147306,0.070971444,0.00036612985,0.000039848783,0.0000056357508,0.00002936348,0.000011067935,0.00009982043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762994,0.00046508465,0.00056899583,0.0003802859,0.00050215086,0.00045357164],"domain_scores_gemma":[0.99500847,0.00018596693,0.00039444133,0.0031848557,0.0009924946,0.00023378214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006560305,0.00027153493,0.0003382259,0.000083482824,0.0004438527,0.00032856665,0.0027482596,0.00012171794,0.000032235916],"category_scores_gemma":[0.00013128508,0.00022955029,0.00011336191,0.0012612003,0.0003984611,0.00042510068,0.0006384953,0.0002989806,0.000045244342],"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.00096073403,0.008805339,0.052096345,0.00039848464,0.0030123254,0.00013526784,0.009353427,0.18597975,0.02214867,0.2932066,0.14946786,0.2744352],"study_design_scores_gemma":[0.00070758164,0.00006645718,0.0004423967,0.000047985413,0.000020669251,0.000032255946,0.0003726498,0.98208594,0.00081673573,0.0034643642,0.011671251,0.00027171342],"about_ca_topic_score_codex":0.00091754214,"about_ca_topic_score_gemma":0.001347308,"teacher_disagreement_score":0.90496343,"about_ca_system_score_codex":0.00025190518,"about_ca_system_score_gemma":0.0005886096,"threshold_uncertainty_score":0.9360789},"labels":[],"label_agreement":null},{"id":"W2292736936","doi":"10.1109/glocom.2015.7417042","title":"Crawling ResearchGate.net to Measure Student/Supervisor Collaboration","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"scientometrics and bibliometrics research","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Upload; Crawling; Supervisor; Download; Computer science; Social network analysis; Social network (sociolinguistics); World Wide Web; Measure (data warehouse); Knowledge management; Data science; Social media; Database; Management","score_opus":0.8281249177914913,"score_gpt":0.646497618326707,"score_spread":0.1816272994647843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292736936","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.56143606,0.007183191,0.06431351,0.11039587,0.0037477557,0.0043229945,0.0014920046,0.0004904867,0.24661814],"genre_scores_gemma":[0.9895717,0.00038668347,0.0076536797,0.00051167357,0.00009804392,0.000118615186,0.000048216978,0.000017247494,0.0015941596],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9837805,0.0018084433,0.0012482422,0.0010128244,0.011122115,0.0010278573],"domain_scores_gemma":[0.96699095,0.0017274999,0.0003261551,0.005637336,0.023415925,0.0019021663],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.025488717,0.0003280505,0.0005565184,0.009205179,0.00081111625,0.0064754845,0.01380752,0.00023951188,0.0003373158],"category_scores_gemma":[0.031553973,0.00027550966,0.00013824305,0.110299,0.0004285524,0.0014178067,0.0037368152,0.0005834753,0.005149337],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018809056,0.0012539031,0.13340777,0.000009092262,0.00010186321,0.000014256516,0.0024328725,0.00062663376,0.0015520818,0.02522091,0.707171,0.12802148],"study_design_scores_gemma":[0.0041821348,0.0013817223,0.095734455,0.00014525556,0.000063321226,0.000041109957,0.03571169,0.052470826,0.0010444843,0.06327222,0.74401176,0.0019410131],"about_ca_topic_score_codex":0.001053694,"about_ca_topic_score_gemma":0.0035538923,"teacher_disagreement_score":0.42813563,"about_ca_system_score_codex":0.00095954345,"about_ca_system_score_gemma":0.0025159926,"threshold_uncertainty_score":0.9999697},"labels":[],"label_agreement":null},{"id":"W2292796461","doi":"10.1109/glocom.2014.7417468","title":"Optimal Stochastic Power Control for Energy Harvesting Systems with Statistical Delay Constraint","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Mathematical optimization; Transmitter; Computer science; Optimal control; Fading; Network packet; Energy harvesting; Power control; Markov process; Controller (irrigation); Online algorithm; Channel (broadcasting); Control theory (sociology); Power (physics); Energy (signal processing); Control (management); Mathematics; Computer network","score_opus":0.02031134921880774,"score_gpt":0.2533467546267723,"score_spread":0.23303540540796458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292796461","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.0028124014,0.00047409855,0.98443085,0.00016518497,0.00052458973,0.0004030957,0.00050142646,0.0006369664,0.010051371],"genre_scores_gemma":[0.9473114,0.000028583276,0.05187685,0.000088361005,0.000103520244,0.0002772781,0.00017823912,0.00006214417,0.00007361677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763393,0.00028303833,0.0006625457,0.00039330593,0.00030081425,0.00072633807],"domain_scores_gemma":[0.9958134,0.0014093304,0.00019126291,0.0016805562,0.0005622094,0.0003432199],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095231,0.00045155882,0.0005754963,0.000065280066,0.00034891546,0.0003308699,0.0013299265,0.00022409123,0.000023979917],"category_scores_gemma":[0.0002742142,0.00044407282,0.000071718634,0.0002490201,0.0005836052,0.00023677305,0.00011048237,0.0003664599,0.000025878695],"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.000028234968,0.000050905222,0.00013380765,0.000033504297,0.00012818679,0.0000017625254,0.000032335567,0.735001,0.000038517748,0.25909206,0.0022951504,0.0031644956],"study_design_scores_gemma":[0.0011990847,0.00016823571,0.00020999403,0.00026200118,0.00009849115,0.00008925514,0.00011944204,0.98972857,0.000006591061,0.0004957178,0.007076118,0.00054648175],"about_ca_topic_score_codex":0.00039871424,"about_ca_topic_score_gemma":0.0007364173,"teacher_disagreement_score":0.944499,"about_ca_system_score_codex":0.00026309016,"about_ca_system_score_gemma":0.00019706326,"threshold_uncertainty_score":0.9998011},"labels":[],"label_agreement":null},{"id":"W2292895141","doi":"10.1109/glocom.2015.7417366","title":"A Local Search Algorithm for Resource Allocation for Underlaying Device-to-Device Communications","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Queen's University","funders":"","keywords":"Computer science; Resource allocation; Telecommunications link; Heuristic; Mathematical optimization; Resource management (computing); Algorithm; Cellular network; Greedy algorithm; Local search (optimization); Resource (disambiguation); Interference (communication); Distributed computing; Computer network; Mathematics","score_opus":0.14070713078502664,"score_gpt":0.3676536604089858,"score_spread":0.22694652962395914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292895141","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.00018386773,0.0014261627,0.98401743,0.0030098942,0.00027759097,0.002652375,0.0005462701,0.0006519243,0.0072345124],"genre_scores_gemma":[0.5515615,0.00019393026,0.4452336,0.00026623512,0.0000716667,0.0014709538,0.0009667121,0.00007417463,0.00016122776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975605,0.0002596429,0.0008026034,0.00042826936,0.00030733796,0.00064165524],"domain_scores_gemma":[0.9930991,0.00053771905,0.00016276543,0.003940512,0.0017942103,0.00046569842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009940895,0.00039182827,0.00045837098,0.00017101361,0.0005700537,0.0002100538,0.0030588766,0.00024884066,0.0000056639014],"category_scores_gemma":[0.00022213651,0.00047103802,0.00012365024,0.00088018563,0.00025543946,0.0005275289,0.0004942633,0.000311223,0.00013160206],"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.000086756285,0.00043012647,0.00018718636,0.0002894116,0.00033143035,5.3932405e-7,0.0025037264,0.5311049,0.00055767637,0.053173475,0.054107912,0.35722685],"study_design_scores_gemma":[0.0010143457,0.00009168574,0.000026936379,0.00013527385,0.00006595355,0.000010193415,0.0029271443,0.87429845,0.00017173152,0.001436495,0.11934503,0.0004767286],"about_ca_topic_score_codex":0.00029242702,"about_ca_topic_score_gemma":0.001683798,"teacher_disagreement_score":0.55137765,"about_ca_system_score_codex":0.0012630058,"about_ca_system_score_gemma":0.0004334617,"threshold_uncertainty_score":0.99977416},"labels":[],"label_agreement":null},{"id":"W2292953767","doi":"10.1109/glocom.2015.7417299","title":"Novel Hilbert Spectrum-Based Specific Emitter Identification for Single-Hop and Relaying Scenarios","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Relay; Identification (biology); Common emitter; Entropy (arrow of time); Algorithm; Electronic engineering; Topology (electrical circuits); Engineering; Physics; Electrical engineering; Power (physics)","score_opus":0.16149136192584568,"score_gpt":0.319582731107059,"score_spread":0.1580913691812133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292953767","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.008555139,0.00044286548,0.96473503,0.021544477,0.00062379136,0.0009249464,0.00008288623,0.00034244717,0.0027483997],"genre_scores_gemma":[0.89152193,0.000045152803,0.107511096,0.00038153448,0.00008146048,0.00018430577,0.00014448368,0.000021634554,0.000108415596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717104,0.0002322264,0.00081584876,0.00079550577,0.00052096136,0.00046443735],"domain_scores_gemma":[0.9942646,0.00034848196,0.000553852,0.003460289,0.0010301127,0.00034265275],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092527707,0.0003451059,0.00034243488,0.00018603356,0.0004970995,0.00088571635,0.002928916,0.00020854104,0.000010707438],"category_scores_gemma":[0.00022923635,0.00038163905,0.00010441472,0.0007934575,0.0003234266,0.0011946858,0.0004320335,0.0002628883,0.00011858123],"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.00013703514,0.0018586903,0.007179077,0.00009782055,0.00012554193,0.0000031297716,0.0015384302,0.0040246663,0.0761488,0.8203291,0.02899311,0.05956457],"study_design_scores_gemma":[0.002659102,0.000180338,0.009134507,0.00015522767,0.00005358391,0.000073206924,0.00028619415,0.9222057,0.0037945395,0.023640877,0.036798116,0.0010186303],"about_ca_topic_score_codex":0.00018689095,"about_ca_topic_score_gemma":0.00028642948,"teacher_disagreement_score":0.918181,"about_ca_system_score_codex":0.0006580088,"about_ca_system_score_gemma":0.00043984002,"threshold_uncertainty_score":0.99986356},"labels":[],"label_agreement":null},{"id":"W2952685718","doi":"10.1109/glocom.2014.7416943","title":"Efficient Heuristic for Resource Allocation in Zero-Forcing OFDMA-SDMA Systems with Minimum Rate Constraints","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis","funders":"","keywords":"Computer science; Subcarrier; Resource allocation; Heuristics; Space-division multiple access; Spectral efficiency; Mathematical optimization; Orthogonal frequency-division multiple access; Heuristic; Maximization; Distributed computing; Orthogonal frequency-division multiplexing; Real-time computing; Computer network; Telecommunications link; Channel (broadcasting); Mathematics","score_opus":0.023505019913239892,"score_gpt":0.2597932063062153,"score_spread":0.23628818639297539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952685718","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.033228565,0.00064978725,0.95821756,0.00033731744,0.00030246066,0.0011601179,0.00011461258,0.0003686846,0.005620879],"genre_scores_gemma":[0.98626345,0.00018984622,0.012738594,0.000047128,0.000044521737,0.00043233112,0.00019644298,0.00004342942,0.000044242603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814606,0.0002510392,0.0006001698,0.00033143745,0.0001951544,0.00047612804],"domain_scores_gemma":[0.99753094,0.00039996917,0.00020506917,0.0013670716,0.000359406,0.00013756937],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005523976,0.00031565537,0.00039603421,0.000110234025,0.00021492912,0.00012691587,0.0008748588,0.00015211735,0.000007395527],"category_scores_gemma":[0.0001168877,0.00033111856,0.000046047768,0.00053754036,0.00027270988,0.00012938943,0.00009067251,0.00024248702,0.000024356044],"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.000028994255,0.00005770603,0.0005047146,0.00008314207,0.000028066312,3.6386672e-7,0.00012638647,0.9785818,0.00015164807,0.014634292,0.00087619625,0.0049266936],"study_design_scores_gemma":[0.0009583955,0.000048331414,0.00055466953,0.00042236343,0.000036683163,0.000007656178,0.00026439774,0.9944507,0.000041768602,0.00033692567,0.0025098016,0.00036833814],"about_ca_topic_score_codex":0.00007275318,"about_ca_topic_score_gemma":0.0003290721,"teacher_disagreement_score":0.9530349,"about_ca_system_score_codex":0.00039230133,"about_ca_system_score_gemma":0.00010065305,"threshold_uncertainty_score":0.9999141},"labels":[],"label_agreement":null},{"id":"W2962751476","doi":"10.1109/glocom.2015.7417132","title":"Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undersampling; Compressed sensing; Wideband; Cognitive radio; Nyquist rate; Computer science; Block (permutation group theory); Electronic engineering; Nyquist–Shannon sampling theorem; Signal-to-noise ratio (imaging); Spectrum (functional analysis); Algorithm; Sampling (signal processing); Telecommunications; Mathematics; Wireless; Engineering; Physics; Detector","score_opus":0.08158860634591454,"score_gpt":0.2961147823282241,"score_spread":0.21452617598230955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962751476","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.7698585,0.0020983387,0.18255644,0.0012565874,0.00086610194,0.0008045465,0.00013810863,0.001442635,0.04097876],"genre_scores_gemma":[0.9954983,0.0004051436,0.003949465,0.00003623809,0.000040825926,0.0000076672695,0.000028847466,0.000025092055,0.000008428633],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982599,0.00021925973,0.0005792269,0.00026481837,0.00027322688,0.00040357205],"domain_scores_gemma":[0.9976045,0.00008903888,0.000161022,0.0017722634,0.00021292815,0.0001602454],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028394777,0.00030466853,0.00046906914,0.00016007897,0.00010360344,0.00009063743,0.00097096845,0.00016628875,0.000010719814],"category_scores_gemma":[0.00005678205,0.0003445031,0.00008710898,0.00056186167,0.00047656984,0.00026392954,0.00015361804,0.00039911695,0.00003420453],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007685782,0.0025171787,0.029287875,0.00056018005,0.00077941705,0.0001029269,0.004745638,0.08299743,0.6987567,0.06668551,0.023457132,0.08934142],"study_design_scores_gemma":[0.0020960574,0.00019448601,0.014188431,0.0009968174,0.00009077775,0.000118874384,0.00091312616,0.3796447,0.48279393,0.11458709,0.0030089987,0.0013667212],"about_ca_topic_score_codex":0.002085406,"about_ca_topic_score_gemma":0.008123577,"teacher_disagreement_score":0.29664725,"about_ca_system_score_codex":0.00033550544,"about_ca_system_score_gemma":0.00011281165,"threshold_uncertainty_score":0.9999007},"labels":[],"label_agreement":null},{"id":"W2963743441","doi":"10.1109/glocom.2015.7417028","title":"Bounds on the Capacity of ASK Molecular Communication Channels with ISI","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Upper and lower bounds; Interference (communication); Ask price; Gaussian; Noise (video); Gaussian noise; Intersymbol interference; Computer science; Algorithm; Amplitude-shift keying; Mathematics; Statistical physics; Topology (electrical circuits); Physics; Combinatorics; Telecommunications; Decoding methods; Statistics; Phase-shift keying; Channel (broadcasting); Mathematical analysis; Artificial intelligence; Quantum mechanics","score_opus":0.07387584870307928,"score_gpt":0.2732127955589944,"score_spread":0.19933694685591513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963743441","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.37610093,0.010802138,0.1246071,0.02045585,0.0008150271,0.0027185027,0.00033054044,0.0012678716,0.46290204],"genre_scores_gemma":[0.9919541,0.0008027578,0.006545332,0.0003609037,0.000014491685,0.0001340969,0.00010194983,0.00003185478,0.000054516953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978627,0.00064150087,0.00050253555,0.00020564698,0.00045070704,0.00033691106],"domain_scores_gemma":[0.9927245,0.00020287983,0.00020926917,0.005987421,0.0006682397,0.00020769579],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074274756,0.00031666548,0.00035034973,0.00007620548,0.00026185144,0.00013660328,0.0035549477,0.00017368046,0.00004299305],"category_scores_gemma":[0.00009380916,0.0002562785,0.000099806144,0.0007232439,0.0006210397,0.00018774752,0.00037393658,0.0005735322,0.00011841763],"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.00017461031,0.00090000196,0.0013789482,0.0000757693,0.0006780653,0.000004086612,0.0024025112,0.050471473,0.0027805674,0.86093175,0.06925251,0.010949708],"study_design_scores_gemma":[0.005728645,0.0012177343,0.002162623,0.0015245924,0.00050850253,0.00014757957,0.004030698,0.6064779,0.017515073,0.051602963,0.30567482,0.0034088506],"about_ca_topic_score_codex":0.000280119,"about_ca_topic_score_gemma":0.0005150927,"teacher_disagreement_score":0.8093288,"about_ca_system_score_codex":0.000234477,"about_ca_system_score_gemma":0.00018161669,"threshold_uncertainty_score":0.999989},"labels":[],"label_agreement":null},{"id":"W2964346954","doi":"10.1109/glocom.2015.7417854","title":"Filtered-OFDM - Enabler for Flexible Waveform in the 5th Generation Cellular Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"PAPR reduction in OFDM","field":"Engineering","cited_by":253,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Orthogonal frequency-division multiplexing; Waveform; Computer science; Bandwidth (computing); Electronic engineering; Spectral efficiency; Guard interval; Channel (broadcasting); Enabling; Computer network; Telecommunications; Engineering; Radar","score_opus":0.2058394020014972,"score_gpt":0.346581816010288,"score_spread":0.14074241400879078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964346954","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.053877354,0.010373552,0.73628265,0.0067484993,0.0058888434,0.0038907207,0.00048441373,0.0015380239,0.18091592],"genre_scores_gemma":[0.99087,0.0005454423,0.006891255,0.00020312119,0.0003267733,0.00046084233,0.0003745996,0.000027046397,0.00030091204],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983351,0.00019103358,0.0005092239,0.00024042587,0.0002624343,0.0004617632],"domain_scores_gemma":[0.9972776,0.000096288706,0.000094814335,0.0020626967,0.00032387584,0.00014473083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008127318,0.00026884992,0.00025889926,0.00008100766,0.00022490558,0.00022173431,0.0017774224,0.00018606392,0.00004237486],"category_scores_gemma":[0.00007847098,0.00023961869,0.00008763333,0.0005309558,0.00015045983,0.00042109707,0.00013700029,0.00034833112,0.000107730586],"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.000041841085,0.00034712884,0.00094531133,0.000055449007,0.00013344847,0.0000025662837,0.0018528256,0.24798101,0.0014024209,0.06902232,0.6569262,0.02128943],"study_design_scores_gemma":[0.00081304327,0.00005666219,0.00025866553,0.000040883075,0.000036560366,0.000018663472,0.0009793977,0.8146343,0.000611301,0.0044038966,0.17774238,0.0004042366],"about_ca_topic_score_codex":0.00023322689,"about_ca_topic_score_gemma":0.0007618925,"teacher_disagreement_score":0.93699265,"about_ca_system_score_codex":0.00047793734,"about_ca_system_score_gemma":0.00016824163,"threshold_uncertainty_score":0.9771367},"labels":[],"label_agreement":null},{"id":"W4229609468","doi":"10.1109/glocom.2015.7417620","title":"Best-Relay Selection for Multi-Hop Vehicular Communication in Highways","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Fading; Computer science; Relay; Pairwise error probability; Hop (telecommunications); Transmission (telecommunications); Computer network; Underlay; Correctness; Telecommunications; Power (physics); Signal-to-noise ratio (imaging); Algorithm; Decoding methods","score_opus":0.2025807585261301,"score_gpt":0.3786076535594674,"score_spread":0.1760268950333373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229609468","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.012876023,0.007860089,0.95219946,0.015087569,0.0005975554,0.0018562691,0.00005539358,0.0008593704,0.008608254],"genre_scores_gemma":[0.78504443,0.002875757,0.21086338,0.0004120213,0.000028810873,0.00044297613,0.00011332866,0.000017779039,0.00020149189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660826,0.0011003423,0.0008142449,0.0005618805,0.00036427603,0.0005510101],"domain_scores_gemma":[0.9925963,0.0003214412,0.0003576696,0.0046649026,0.0017487502,0.0003109064],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001620499,0.00036711362,0.00044216603,0.00020243975,0.00067271315,0.00046244272,0.006588932,0.0002380874,0.000011487154],"category_scores_gemma":[0.00041542752,0.00040163664,0.00013464178,0.0015598607,0.0002750988,0.0011980849,0.0015481636,0.0005590752,0.00020192894],"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.00007436245,0.0022528386,0.011188733,0.000035845762,0.00012040428,0.0000015722374,0.0029358417,0.005978763,0.00076084526,0.8469716,0.04205223,0.08762697],"study_design_scores_gemma":[0.0020582387,0.00014060017,0.0013999054,0.00015358914,0.000023662855,0.000017406333,0.00032989838,0.93542945,0.00016697503,0.0029111241,0.05683345,0.00053570594],"about_ca_topic_score_codex":0.0004950171,"about_ca_topic_score_gemma":0.009436069,"teacher_disagreement_score":0.9294507,"about_ca_system_score_codex":0.00080068014,"about_ca_system_score_gemma":0.0007322694,"threshold_uncertainty_score":0.99984354},"labels":[],"label_agreement":null},{"id":"W4229646394","doi":"10.1109/glocom.2014.7417836","title":"A Hierarchical Architecture for Distributed EPCglobal Discovery Services","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Scalability; Computer science; PlanetLab; Identifier; Computer network; Distributed computing; Emulation; Chord (peer-to-peer); Architecture; Overlay network; Neighbor Discovery Protocol; The Internet; Internet Protocol; World Wide Web; Database","score_opus":0.030443706645368263,"score_gpt":0.2906933659029355,"score_spread":0.2602496592575672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229646394","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.013952808,0.00037452622,0.9656715,0.012765675,0.00057454087,0.0004805814,0.0007723568,0.00044218934,0.0049658497],"genre_scores_gemma":[0.97497165,0.0000868296,0.023183983,0.0010355659,0.00010658429,0.000127055,0.00033948384,0.000012080682,0.00013674797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974011,0.00043438424,0.00050266273,0.0006471178,0.00039438394,0.0006203426],"domain_scores_gemma":[0.9948928,0.00041397367,0.0002286558,0.0037804053,0.00040704114,0.00027712464],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0005319598,0.00036483372,0.00042288977,0.00007419519,0.0006339385,0.0009441584,0.0063373023,0.0001754612,0.000005777751],"category_scores_gemma":[0.000116609546,0.0003415105,0.00025765641,0.00052696734,0.00027630344,0.0008031811,0.0012715498,0.00040062136,0.0000787357],"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.00007975457,0.00043490826,0.0024034083,0.000071963645,0.00012047537,0.0000019751944,0.00024269718,0.00049216364,0.00042894736,0.91354483,0.011179119,0.07099975],"study_design_scores_gemma":[0.0021686463,0.00035658354,0.0062260106,0.0002597897,0.00010051129,0.00009609684,0.00017723489,0.6444055,0.00008199708,0.16007662,0.1848291,0.0012219198],"about_ca_topic_score_codex":0.00060388277,"about_ca_topic_score_gemma":0.0014520156,"teacher_disagreement_score":0.96101886,"about_ca_system_score_codex":0.00017317753,"about_ca_system_score_gemma":0.00024859453,"threshold_uncertainty_score":0.9999037},"labels":[],"label_agreement":null},{"id":"W4229879624","doi":"10.1109/glocom.2015.7417140","title":"Security-Enhanced Data Aggregation against Malicious Gateways in Smart Grid","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Homomorphic encryption; Data aggregator; Computer security; Cryptosystem; Cryptography; Smart grid; News aggregator; Paillier cryptosystem; Default gateway; Computer network; Information privacy; Energy consumption; Data integrity; Authentication (law); Scheme (mathematics); Encryption; Wireless sensor network; Engineering; Hybrid cryptosystem; Operating system","score_opus":0.08496835250947447,"score_gpt":0.3131640900202471,"score_spread":0.2281957375107726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229879624","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.8185305,0.007788033,0.011682144,0.0031727448,0.005035762,0.001505978,0.0017055864,0.0015749645,0.14900428],"genre_scores_gemma":[0.9945467,0.0028027555,0.0013608885,0.00015458389,0.00012676608,0.000060062663,0.00089388754,0.000023764462,0.000030554802],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976974,0.00028553425,0.00062078197,0.00044533584,0.00040374536,0.00054716296],"domain_scores_gemma":[0.9950598,0.00010690646,0.000117689684,0.004089026,0.00030763604,0.00031893994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073693256,0.00033657803,0.00038321543,0.00012582167,0.00018857683,0.00017444695,0.003809189,0.00023805707,0.000026540407],"category_scores_gemma":[0.00022259934,0.00036907746,0.00005335016,0.0008284002,0.00030565052,0.00085770694,0.00078321435,0.0006247261,0.00044489346],"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.0003397528,0.0032429409,0.046274446,0.00069943274,0.000612452,0.00012463109,0.019677116,0.10138176,0.0053984593,0.055549994,0.663245,0.10345398],"study_design_scores_gemma":[0.0027847032,0.00011480648,0.0063079274,0.0005656397,0.00007100855,0.000056802528,0.0030874298,0.82597995,0.0018887745,0.009630065,0.1477758,0.0017370915],"about_ca_topic_score_codex":0.00082943187,"about_ca_topic_score_gemma":0.013711094,"teacher_disagreement_score":0.72459817,"about_ca_system_score_codex":0.00041656397,"about_ca_system_score_gemma":0.0003203575,"threshold_uncertainty_score":0.99987614},"labels":[],"label_agreement":null},{"id":"W4231552299","doi":"10.1109/glocom.2014.7417042","title":"Crawling ResearchGate.net to Measure Student/Supervisor Collaboration","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"scientometrics and bibliometrics research","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Upload; Crawling; Supervisor; Download; Computer science; Social network analysis; World Wide Web; Social network (sociolinguistics); Measure (data warehouse); Knowledge management; Data science; Social media; Management; Database","score_opus":0.6862926154229483,"score_gpt":0.6197131306743925,"score_spread":0.0665794847485558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231552299","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.4896357,0.002797721,0.16374688,0.095266216,0.0027412027,0.0035101015,0.0009358857,0.00043913955,0.24092714],"genre_scores_gemma":[0.9901602,0.00040584055,0.0072846645,0.00064996287,0.00010491021,0.00010889825,0.00003975049,0.000016816433,0.0012289055],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9855595,0.002173019,0.0012266919,0.0010458406,0.008975592,0.0010193614],"domain_scores_gemma":[0.9741355,0.0031055731,0.00034116383,0.0061849025,0.015031321,0.0012015175],"candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.024872528,0.00032179028,0.0005584468,0.008880858,0.0011672097,0.0062662135,0.013776754,0.00023215494,0.0005615583],"category_scores_gemma":[0.029967923,0.00027024045,0.0001543001,0.09575039,0.0004180973,0.0011010724,0.003193375,0.00057507586,0.0044481615],"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.00014283562,0.0013502892,0.1520528,0.000017857486,0.00011517411,0.000005182774,0.0014684907,0.00060511276,0.0050139194,0.07648311,0.37485895,0.3878863],"study_design_scores_gemma":[0.0023620715,0.0009479846,0.17227419,0.00013195782,0.000047171234,0.000018273144,0.007858392,0.086764194,0.0010851322,0.05027614,0.6767516,0.0014828924],"about_ca_topic_score_codex":0.00068898074,"about_ca_topic_score_gemma":0.0032066,"teacher_disagreement_score":0.5005245,"about_ca_system_score_codex":0.00053884013,"about_ca_system_score_gemma":0.00096626853,"threshold_uncertainty_score":0.99997497},"labels":[],"label_agreement":null},{"id":"W4232130561","doi":"10.1109/glocom.2014.7416992","title":"Energy-Efficient Virtual Link Reconfiguration for Off-Peak Time","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control reconfiguration; Link (geometry); Computer science; Energy (signal processing); Computer network; Embedded system; Physics","score_opus":0.032084740779408615,"score_gpt":0.2778997214271295,"score_spread":0.24581498064772087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232130561","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.00096802664,0.00064520596,0.9669616,0.007894403,0.0008160831,0.00040005005,0.00008640403,0.0005332566,0.021694927],"genre_scores_gemma":[0.95460206,0.00036790504,0.042048823,0.0013053664,0.00026345198,0.00022745162,0.00023406743,0.000023031462,0.00092783314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747074,0.0003831125,0.00062992005,0.00061117095,0.00034814875,0.00055693707],"domain_scores_gemma":[0.9943935,0.0006265739,0.0003403164,0.0036507973,0.00073691114,0.00025186007],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077216513,0.00033720123,0.00039453182,0.00009461375,0.0006235462,0.00047955924,0.0042022364,0.00022482933,0.00006322238],"category_scores_gemma":[0.00019419618,0.0003407153,0.00017666213,0.0006074391,0.00020226346,0.00040598138,0.000589835,0.00022586244,0.00041981143],"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.000015761425,0.00016175053,0.000054157612,0.0000049799705,0.00003227995,2.873921e-7,0.00009577015,0.0015549443,0.000121336554,0.51498395,0.036924414,0.44605035],"study_design_scores_gemma":[0.0005366167,0.00018403516,0.0003848592,0.00004768459,0.00002158806,0.000011370645,0.000015703243,0.7820882,0.000092279,0.0112494575,0.2049861,0.00038207477],"about_ca_topic_score_codex":0.00015175811,"about_ca_topic_score_gemma":0.00024994847,"teacher_disagreement_score":0.953634,"about_ca_system_score_codex":0.0001867533,"about_ca_system_score_gemma":0.0003153752,"threshold_uncertainty_score":0.9999045},"labels":[],"label_agreement":null},{"id":"W4232845162","doi":"10.1109/glocom.2014.7417879","title":"Irregular Multidimensional Constellations for Orthogonal STBCs","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Constellation; Block code; Space–time block code; Transmitter; Computer science; Algorithm; Dimension (graph theory); Antenna diversity; Constellation diagram; MIMO; Mathematics; Block (permutation group theory); Block Error Rate; Transmit diversity; Reliability (semiconductor); Topology (electrical circuits); Theoretical computer science; Telecommunications; Bit error rate; Decoding methods; Fading; Antenna (radio); Beamforming; Pure mathematics; Combinatorics","score_opus":0.03948843951652328,"score_gpt":0.3143391360407972,"score_spread":0.27485069652427396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232845162","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.0047726845,0.0010770363,0.95830053,0.0019667845,0.00036070033,0.000959988,0.00052288076,0.0016059624,0.03043345],"genre_scores_gemma":[0.83318615,0.0005481979,0.1652406,0.000174176,0.000044381653,0.00030300164,0.00036605168,0.000039475715,0.00009796115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981418,0.00020553432,0.0006437016,0.00030710892,0.00026611183,0.00043569563],"domain_scores_gemma":[0.99530333,0.0004080876,0.00016294999,0.0032578332,0.0006638268,0.00020397225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040569756,0.00035065223,0.00039239068,0.00010408753,0.00048553717,0.00008003064,0.001811359,0.00021183085,0.00008137796],"category_scores_gemma":[0.00015067711,0.00040076795,0.00015377392,0.00037528327,0.00045251913,0.00034703116,0.0003268289,0.00033868098,0.00013674785],"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.000024057665,0.00023638508,0.0009573986,0.000066918896,0.00013921304,2.8642268e-7,0.000110855435,0.013141193,0.0033251538,0.8696817,0.02171188,0.09060492],"study_design_scores_gemma":[0.0007417207,0.00005129631,0.0010129032,0.0000970217,0.000050058596,0.000016483711,0.00010218605,0.61865276,0.0011328447,0.022711176,0.3547848,0.0006467703],"about_ca_topic_score_codex":0.000030126084,"about_ca_topic_score_gemma":0.00025781867,"teacher_disagreement_score":0.84697056,"about_ca_system_score_codex":0.0002454338,"about_ca_system_score_gemma":0.00013369991,"threshold_uncertainty_score":0.99984443},"labels":[],"label_agreement":null},{"id":"W4233047538","doi":"10.1109/glocom.2014.7417434","title":"Effective Data Rate Based Rank Adaptive Receive Antenna Selection","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Beamforming; Telecommunications link; Physical layer; Subspace topology; Antenna (radio); Interference (communication); Signal subspace; Selection algorithm; Channel (broadcasting); Algorithm; Spectral efficiency; Selection (genetic algorithm); Adaptive beamformer; Electronic engineering; Real-time computing; Computer network; Wireless; Telecommunications; Engineering; Artificial intelligence","score_opus":0.046797410871469367,"score_gpt":0.2987096779602413,"score_spread":0.2519122670887719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233047538","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.0006895017,0.0003980515,0.9772256,0.0003434113,0.00055498356,0.0009713423,0.00038181737,0.0007947765,0.018640498],"genre_scores_gemma":[0.95998967,0.0002852446,0.03864737,0.00009990347,0.00008291122,0.0001849515,0.0006152369,0.000042597265,0.000052099636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768764,0.00074679137,0.0004893704,0.00047751467,0.00018284678,0.00041584767],"domain_scores_gemma":[0.9953355,0.0004032168,0.00019580619,0.003277105,0.00062605034,0.00016228839],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00074788183,0.0003672832,0.00041791273,0.00010466268,0.0003194644,0.0001200539,0.0020686195,0.00019536713,0.000057405083],"category_scores_gemma":[0.0003197098,0.0004057334,0.00006169254,0.0007543395,0.00018558817,0.00082002964,0.00028508974,0.00039351717,0.00027510757],"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.00046476533,0.00072157755,0.0037519517,0.00034119803,0.00090084353,0.0000039813144,0.0006997638,0.69398427,0.012420963,0.043494835,0.054582782,0.1886331],"study_design_scores_gemma":[0.0008025641,0.000076604985,0.0012718271,0.00011241534,0.00006265543,0.0000075280277,0.00009580452,0.9888521,0.00037667697,0.0009136576,0.007004799,0.0004233982],"about_ca_topic_score_codex":0.00028648524,"about_ca_topic_score_gemma":0.0016871518,"teacher_disagreement_score":0.95930016,"about_ca_system_score_codex":0.000490543,"about_ca_system_score_gemma":0.00012635524,"threshold_uncertainty_score":0.9998394},"labels":[],"label_agreement":null},{"id":"W4233314385","doi":"10.1109/glocom.2014.7417804","title":"Towards Intelligent LTE Mobility Management through MME Pooling","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Pooling; Mobility management; Distributed computing; Quality of service; Overhead (engineering); Heuristic; Context (archaeology); Computer network; Mobility model; Latency (audio); Mobile computing; Artificial intelligence","score_opus":0.09431437582524692,"score_gpt":0.3706042674149917,"score_spread":0.27628989158974476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233314385","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.0016490169,0.000967755,0.8331602,0.012215367,0.0005624861,0.00075090694,0.000023873848,0.0005380955,0.15013227],"genre_scores_gemma":[0.83746403,0.00276157,0.15839055,0.0007443853,0.00005312885,0.00023559606,0.000048559406,0.000018394367,0.0002837565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949831,0.001435761,0.0009284496,0.00084372674,0.00091371767,0.00089526427],"domain_scores_gemma":[0.9858241,0.00037098365,0.00033389384,0.012224957,0.0009038387,0.0003421956],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019521223,0.00043828526,0.0004977755,0.00012526601,0.0008389163,0.0007842878,0.015930539,0.00019849194,0.000087722925],"category_scores_gemma":[0.00015582234,0.0004514332,0.00020232603,0.0015096196,0.00059695385,0.0011045007,0.006511793,0.000747658,0.0008398611],"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.000010770374,0.00045175478,0.000381945,0.000033070617,0.00008187502,0.0000014522517,0.00032803894,0.0008944593,0.000021703097,0.8265951,0.0065613277,0.16463847],"study_design_scores_gemma":[0.00070227095,0.00011274361,0.0043802685,0.00018929792,0.000037410737,0.000023565808,0.00030986278,0.65219223,0.00027412406,0.12930794,0.21161535,0.0008549262],"about_ca_topic_score_codex":0.00089318724,"about_ca_topic_score_gemma":0.0005870464,"teacher_disagreement_score":0.8358151,"about_ca_system_score_codex":0.0006297565,"about_ca_system_score_gemma":0.00031413598,"threshold_uncertainty_score":0.9999381},"labels":[],"label_agreement":null},{"id":"W4233841865","doi":"10.1109/glocom.2014.7417592","title":"Lightweight Security and Privacy-Preserving Scheme for V2G Connection","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Vehicle-to-grid; Computer science; Scheme (mathematics); Computer security; Grid; Electricity; Authentication (law); Smart grid; Computer network; Trusted third party; Confidentiality; Pseudonym; Power (physics); Electric vehicle; Engineering; Electrical engineering","score_opus":0.020678411358372777,"score_gpt":0.26778025571283154,"score_spread":0.24710184435445876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233841865","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.66551363,0.007093955,0.21749616,0.008091067,0.001840518,0.002063724,0.00043678674,0.0019152516,0.095548905],"genre_scores_gemma":[0.9858074,0.00073141477,0.013057751,0.00011523026,0.00009775592,0.00006565826,0.00006534046,0.000020040263,0.000039413404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989063,0.00008130819,0.00030992553,0.00023183247,0.00012855855,0.0003420845],"domain_scores_gemma":[0.99800456,0.00014010594,0.00007880497,0.0013829279,0.0002472419,0.00014639169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024786516,0.00022559155,0.00025830083,0.00004946593,0.00031336668,0.00015169848,0.0010719135,0.00018188097,0.00004848991],"category_scores_gemma":[0.00012320092,0.00023138628,0.00006225599,0.0002537518,0.00009843911,0.00038703825,0.0002653205,0.000279911,0.000020584774],"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.000087444416,0.00027450337,0.01815595,0.00071380864,0.0005017697,9.2891094e-7,0.0015312411,0.0009861898,0.0136812525,0.5748642,0.27951983,0.10968289],"study_design_scores_gemma":[0.00075966556,0.00008953385,0.0028036323,0.0000723799,0.000044129243,0.000020368147,0.000105199666,0.70414495,0.0012076036,0.060370978,0.22991462,0.00046696313],"about_ca_topic_score_codex":0.00009299283,"about_ca_topic_score_gemma":0.00033167787,"teacher_disagreement_score":0.70315874,"about_ca_system_score_codex":0.00012345142,"about_ca_system_score_gemma":0.000044888508,"threshold_uncertainty_score":0.9435659},"labels":[],"label_agreement":null},{"id":"W4234058392","doi":"10.1109/glocom.2014.7417139","title":"Downlink Performance and User Scheduling of HetNet with Large-Scale Antenna Arrays","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Telecommunications link; Computer science; Precoding; MIMO; Heterogeneous network; Scheduling (production processes); Base station; Macro; Channel state information; Small cell; Multi-user MIMO; Computer network; Spectral efficiency; Channel (broadcasting); Wireless; Wireless network; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.01658877974838639,"score_gpt":0.2486007455295781,"score_spread":0.2320119657811917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234058392","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.12456671,0.00060535566,0.86456007,0.00017800259,0.0001433435,0.0003292317,0.00009246058,0.00026680977,0.009258012],"genre_scores_gemma":[0.89425844,0.0008931687,0.10464765,0.000027263173,0.000023679206,0.00003244815,0.000056070006,0.000021810976,0.000039446644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.00008250583,0.0003986402,0.00021168965,0.0001501826,0.00030519508],"domain_scores_gemma":[0.99793077,0.000059883478,0.00014503112,0.0014150463,0.0003335014,0.000115748706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026343702,0.00023036705,0.0003325057,0.000060166156,0.00016928802,0.00005052963,0.00066605816,0.00011305125,0.000015506226],"category_scores_gemma":[0.00002871044,0.00022197582,0.000030822463,0.0003231895,0.00019273373,0.00042506406,0.00013342705,0.00021956915,0.00002634711],"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.00013198172,0.0004659781,0.12807332,0.0010083347,0.00033993015,0.0000012515454,0.0021206683,0.81258154,0.0063074096,0.030400401,0.0021887845,0.016380414],"study_design_scores_gemma":[0.0006726386,0.000067305205,0.002281312,0.00025612058,0.000032106687,0.000017454977,0.00033923847,0.9915957,0.00027054193,0.000119654374,0.0040403223,0.00030764873],"about_ca_topic_score_codex":0.00003697633,"about_ca_topic_score_gemma":0.00044309627,"teacher_disagreement_score":0.76969177,"about_ca_system_score_codex":0.000080926184,"about_ca_system_score_gemma":0.000047421356,"threshold_uncertainty_score":0.9051911},"labels":[],"label_agreement":null},{"id":"W4235526212","doi":"10.1109/glocom.2014.7417494","title":"Cloud Assisted Resource Management for Hyper-Dense Small Cell Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Resource allocation; Computer network; Overhead (engineering); Cellular network; Resource management (computing); Distributed computing; Wireless network; Base station; Small cell; Wireless; Radio resource management; Telecommunications","score_opus":0.03707075118912775,"score_gpt":0.26433873416422193,"score_spread":0.22726798297509418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235526212","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.0009991487,0.0008463398,0.9065104,0.00027235545,0.0006078723,0.00092617306,0.00007367886,0.00064672524,0.089117326],"genre_scores_gemma":[0.9027954,0.00053769205,0.09468447,0.00014845723,0.00014294211,0.00035612078,0.00026205013,0.000062236264,0.0010106458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982662,0.00019868839,0.00056684355,0.00033340123,0.00014329933,0.0004915376],"domain_scores_gemma":[0.996651,0.00019436028,0.00016822449,0.0025371434,0.00027170355,0.0001775864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041013584,0.00033503384,0.00035826775,0.00007264773,0.00030561953,0.00013516344,0.00152697,0.0001992527,0.000017683155],"category_scores_gemma":[0.000036826485,0.0003838683,0.00011334991,0.00038228,0.00010882188,0.00015564922,0.00024993665,0.00023904453,0.00009705166],"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.00007260823,0.00027600012,0.00048040977,0.00033854006,0.00018734857,0.0000014530814,0.00016711297,0.7955416,0.00023016694,0.0564706,0.07745543,0.06877876],"study_design_scores_gemma":[0.0010253226,0.000056261822,0.00021560039,0.000118355405,0.00009686207,0.000009854265,0.00025680408,0.7839652,0.00007149272,0.00082272256,0.21284351,0.0005180465],"about_ca_topic_score_codex":0.00003670293,"about_ca_topic_score_gemma":0.0003890909,"teacher_disagreement_score":0.9017962,"about_ca_system_score_codex":0.00031551986,"about_ca_system_score_gemma":0.00002753663,"threshold_uncertainty_score":0.9998613},"labels":[],"label_agreement":null},{"id":"W4236337290","doi":"10.1109/glocom.2014.7417481","title":"Spatial Modulation in MIMO Cognitive Radio Networks with Channel Estimation Errors and Primary Interference Constraint","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Memorial University of Newfoundland","funders":"","keywords":"Cognitive radio; Interference (communication); Computer science; MIMO; Constraint (computer-aided design); Channel (broadcasting); Co-channel interference; Spatial modulation; Modulation (music); Electronic engineering; Radio resource management; Computer network; Telecommunications; Algorithm; Mathematics; Engineering; Wireless; Physics; Wireless network; Acoustics","score_opus":0.023994403528686474,"score_gpt":0.2621863340622633,"score_spread":0.23819193053357685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236337290","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.060983546,0.00067598495,0.93132454,0.0005595616,0.00010098659,0.00053503556,0.000047502504,0.00061649235,0.005156359],"genre_scores_gemma":[0.97817236,0.0013168299,0.020027367,0.00005328788,0.000012444851,0.00017431003,0.00021241038,0.000024788416,0.0000062189624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849653,0.00020158374,0.00048650915,0.0003051441,0.00016592667,0.00034427978],"domain_scores_gemma":[0.99777645,0.0002919998,0.00017921101,0.0014120304,0.00024280425,0.000097534255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027344745,0.00032322019,0.00038202107,0.00015028795,0.00017847182,0.00009540913,0.0010102829,0.0002111587,0.000011051449],"category_scores_gemma":[0.00012681536,0.00033888975,0.00003086275,0.00044829474,0.0007323122,0.00047816613,0.00031558351,0.0005413873,0.000014145567],"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.000096519296,0.0001975594,0.009205912,0.00009870072,0.00010037421,0.0000018166303,0.00064305525,0.43728176,0.00021981452,0.022502853,0.00022796351,0.5294237],"study_design_scores_gemma":[0.0007692919,0.00007656345,0.028332423,0.0003412502,0.000018087074,0.000018811597,0.00043873084,0.9659963,0.00009914659,0.0034310906,0.00009430977,0.0003839922],"about_ca_topic_score_codex":0.00023262354,"about_ca_topic_score_gemma":0.002438328,"teacher_disagreement_score":0.9171888,"about_ca_system_score_codex":0.00029631762,"about_ca_system_score_gemma":0.000067414185,"threshold_uncertainty_score":0.9999063},"labels":[],"label_agreement":null},{"id":"W4237240213","doi":"10.1109/glocom.2014.7417073","title":"HePNC: A Cross-Layer Design for MIMO Networks with Asymmetric Two-Way Relay Channel","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Goodput; MIMO; Computer science; Linear network coding; Physical layer; Computer network; Multi-user MIMO; Relay; Channel state information; 3G MIMO; Automatic repeat request; Bottleneck; Topology (electrical circuits); Channel (broadcasting); Throughput; Telecommunications; Wireless; Telecommunications link; Hybrid automatic repeat request; Network packet; Engineering","score_opus":0.11292741998199156,"score_gpt":0.3525288146239141,"score_spread":0.23960139464192254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237240213","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.00061624596,0.0018068769,0.976673,0.004328139,0.00042943025,0.0010641435,0.00002182906,0.0004265197,0.014633819],"genre_scores_gemma":[0.8335405,0.0013677591,0.16311467,0.0010144375,0.00010069272,0.00043057895,0.000050937113,0.000027906946,0.00035251913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961129,0.0011382283,0.00072911946,0.0007852183,0.00041085042,0.0008237219],"domain_scores_gemma":[0.99020475,0.0011556912,0.00045788052,0.006195032,0.0016230606,0.00036361333],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.001900273,0.0005036815,0.00055662624,0.0001968653,0.00143191,0.0010285787,0.007821388,0.00020169443,0.000022549919],"category_scores_gemma":[0.00030641712,0.00046090232,0.00016760408,0.0021257994,0.0004495318,0.0009448647,0.0014315394,0.0005602192,0.00012562843],"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.00016424512,0.00075301284,0.0026154916,0.000029232628,0.00024372907,0.0000021379838,0.0005685036,0.067514315,0.00008858857,0.7154809,0.032278612,0.18026122],"study_design_scores_gemma":[0.0017053726,0.00030431396,0.0018822642,0.00011071056,0.000037296955,0.000028628616,0.000027614622,0.9563092,0.00009479486,0.0030861285,0.035750724,0.00066294294],"about_ca_topic_score_codex":0.00010532392,"about_ca_topic_score_gemma":0.0008148602,"teacher_disagreement_score":0.8887949,"about_ca_system_score_codex":0.00028896175,"about_ca_system_score_gemma":0.0003551469,"threshold_uncertainty_score":0.9998681},"labels":[],"label_agreement":null},{"id":"W4237921547","doi":"10.1109/glocom.2014.7417264","title":"Femto-Cloud Formation: A Coalitional Game-Theoretic Approach","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Femtocell; Femto-; Cloud computing; Computer science; Incentive; Computer network; Game theory; Quality of experience; Microeconomics; Quality of service; Base station; Economics","score_opus":0.033013490431867264,"score_gpt":0.2722268090658109,"score_spread":0.23921331863394366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237921547","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.00079484686,0.00041509213,0.8541808,0.00039045204,0.00042482454,0.00043364294,0.00014060349,0.0006543969,0.14256532],"genre_scores_gemma":[0.948788,0.00035263103,0.04968488,0.00011438409,0.00013377734,0.00021104439,0.00055686786,0.00003388361,0.00012453568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814457,0.0002747821,0.0006219358,0.00026826354,0.0002779728,0.0004124678],"domain_scores_gemma":[0.99705493,0.00012427465,0.00016206855,0.0020535835,0.000415605,0.00018955261],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992318,0.00032343753,0.00034683058,0.000084078725,0.00025315498,0.00015844483,0.001359967,0.00018454668,0.000102670936],"category_scores_gemma":[0.000093993556,0.00035730193,0.00009551173,0.000470835,0.00027477546,0.0006344783,0.00017410754,0.0002954586,0.00042167606],"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.00001691562,0.00019103785,0.00030492476,0.00022244676,0.00008000641,5.09843e-7,0.00056034396,0.17321613,0.00017725707,0.79670113,0.021999916,0.0065293997],"study_design_scores_gemma":[0.00062924,0.000029762372,0.0001646746,0.000088637484,0.00003763009,0.00006118071,0.00031122763,0.9535104,0.000080552556,0.01652229,0.028079154,0.0004852564],"about_ca_topic_score_codex":0.00003836299,"about_ca_topic_score_gemma":0.000093832874,"teacher_disagreement_score":0.94799316,"about_ca_system_score_codex":0.00038921688,"about_ca_system_score_gemma":0.00007484889,"threshold_uncertainty_score":0.9998879},"labels":[],"label_agreement":null},{"id":"W4239692971","doi":"10.1109/glocom.2014.7417029","title":"A Novel Privacy-Preserving Set Aggregation Scheme for Smart Grid Communications","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Nanyang Technological University","keywords":"Computer science; Scheme (mathematics); Random oracle; Smart grid; Data aggregator; Set (abstract data type); Distributed computing; Grid; Oracle; Information privacy; Computer network; Encryption; Computer security; Wireless sensor network; Public-key cryptography; Mathematics; Engineering","score_opus":0.101263160890229,"score_gpt":0.34499327181195727,"score_spread":0.24373011092172825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239692971","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.0018203954,0.0006387223,0.9701657,0.014810549,0.0005393591,0.0008918271,0.0009320027,0.0004923418,0.0097090565],"genre_scores_gemma":[0.4941369,0.00044772075,0.50364697,0.00058907346,0.0000707195,0.00029249577,0.0007844626,0.000014327426,0.000017343335],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717313,0.0004246757,0.00073572237,0.00065524335,0.00041098986,0.00060022547],"domain_scores_gemma":[0.984472,0.00072953437,0.00045693922,0.013062838,0.0009859613,0.0002927377],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012810046,0.00037235353,0.0004123518,0.00015714802,0.0012537211,0.0007229958,0.015939444,0.00021126177,0.000022828319],"category_scores_gemma":[0.0006822083,0.00040784565,0.00023058482,0.0011475027,0.00048380182,0.0016325379,0.0049205394,0.00043607625,0.00010957891],"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.000014018634,0.0004282557,0.0021479721,0.000037322126,0.00006270995,1.1513453e-7,0.0004441772,0.000011535569,0.0005417923,0.95163476,0.028274272,0.016403057],"study_design_scores_gemma":[0.0013485367,0.00011765181,0.003861864,0.00016035543,0.000050282382,0.000025876634,0.00015816164,0.4976329,0.00017977826,0.0917941,0.40393645,0.0007340507],"about_ca_topic_score_codex":0.0008835022,"about_ca_topic_score_gemma":0.0027155674,"teacher_disagreement_score":0.8598407,"about_ca_system_score_codex":0.00016275352,"about_ca_system_score_gemma":0.0003328598,"threshold_uncertainty_score":0.99983734},"labels":[],"label_agreement":null},{"id":"W4240363805","doi":"10.1109/glocom.2014.7417519","title":"Optimal Power Allocation for CR MIMO Energy Harvesting Coexisting Systems","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Energy harvesting; Cognitive radio; Mathematical optimization; Computer science; Throughput; Optimization problem; MIMO; Energy (signal processing); Efficient energy use; Maximization; Lift (data mining); Power (physics); Algorithm; Wireless; Channel (broadcasting); Mathematics; Engineering; Telecommunications; Electrical engineering","score_opus":0.0385688070421093,"score_gpt":0.27805966087137435,"score_spread":0.23949085382926505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240363805","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.0134160025,0.0016630068,0.91371834,0.00040300962,0.0017512202,0.00041919685,0.000115724455,0.001434785,0.0670787],"genre_scores_gemma":[0.95533615,0.00018512526,0.043126393,0.00009023696,0.00022122655,0.00033186944,0.00025712902,0.00006879763,0.0003830655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758995,0.00027574642,0.00078120356,0.00040632975,0.00027893562,0.0006678253],"domain_scores_gemma":[0.995985,0.00070481654,0.00026162298,0.0021515563,0.00065542647,0.00024159957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00072488736,0.0004219467,0.0004578874,0.00008420897,0.0005115786,0.00041334055,0.001862036,0.00028271246,0.000013578304],"category_scores_gemma":[0.00041008997,0.00049179076,0.000113715665,0.00041814204,0.00022420069,0.00041330664,0.00023433685,0.00032059714,0.000043473658],"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.000011640424,0.00008156497,0.0006601418,0.000109690154,0.00011674139,6.4536925e-7,0.000113383336,0.69922554,0.00070047966,0.2716094,0.014572033,0.012798764],"study_design_scores_gemma":[0.00039765576,0.00005068012,0.00033896233,0.00029871502,0.00004447645,0.000019336296,0.00012021951,0.91203684,0.00011890766,0.000471014,0.08558435,0.00051881734],"about_ca_topic_score_codex":0.0008048038,"about_ca_topic_score_gemma":0.0008321756,"teacher_disagreement_score":0.94192016,"about_ca_system_score_codex":0.00034744726,"about_ca_system_score_gemma":0.000116877614,"threshold_uncertainty_score":0.99975336},"labels":[],"label_agreement":null},{"id":"W4241040395","doi":"10.1109/glocom.2014.7417825","title":"A Signal Space Diversity-Based Time Division Broadcast Protocol in Two-Way Relay Systems","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Carleton University","funders":"","keywords":"Relay; Computer science; Spectral efficiency; Constellation; Antenna diversity; Expression (computer science); Transmission (telecommunications); Topology (electrical circuits); Constellation diagram; Diversity gain; Signal-to-noise ratio (imaging); Algorithm; Decoding methods; Bit error rate; Telecommunications; Mathematics; Wireless; Fading; Physics; Beamforming","score_opus":0.06137932964296516,"score_gpt":0.3382538798012566,"score_spread":0.27687455015829143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241040395","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.0026148877,0.00028300597,0.91847706,0.008006122,0.00031591684,0.020200314,0.000040565214,0.0006555901,0.049406536],"genre_scores_gemma":[0.97984546,0.000048373255,0.014349303,0.00039024363,0.000033397824,0.0050304667,0.000035102083,0.000014124958,0.00025353496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99553484,0.0020683536,0.00067342824,0.0006208236,0.0005493052,0.00055322703],"domain_scores_gemma":[0.9934386,0.00046268996,0.00038202916,0.0047733104,0.00067242864,0.0002709296],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0016049106,0.00038359006,0.0004786825,0.00020227548,0.001089827,0.000597902,0.007299024,0.00013187989,0.00008668449],"category_scores_gemma":[0.00012454446,0.00038926318,0.000121917576,0.0013713145,0.0002938414,0.0007661275,0.004211707,0.00058429857,0.0006553336],"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.000110396504,0.0019012499,0.034887265,0.0001067309,0.00008903249,0.000010373962,0.0013730197,0.021085037,0.0013948196,0.78448224,0.026656881,0.12790295],"study_design_scores_gemma":[0.0018107836,0.000120463395,0.0035738896,0.0003252468,0.0000097642815,0.0000071399395,0.00003535023,0.9374236,0.00005952388,0.0009890585,0.05513792,0.00050727173],"about_ca_topic_score_codex":0.00056588516,"about_ca_topic_score_gemma":0.00092727906,"teacher_disagreement_score":0.97723055,"about_ca_system_score_codex":0.00046384818,"about_ca_system_score_gemma":0.00033800988,"threshold_uncertainty_score":0.99985594},"labels":[],"label_agreement":null},{"id":"W4241402985","doi":"10.1109/glocom.2014.7417422","title":"A Comprehensive Reputation System to Improve the Security of Opportunistic Routing Protocols in Wireless Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Computer science; Reliability (semiconductor); Computer network; Routing protocol; Network packet; Computer security; Trust management (information system); Routing (electronic design automation); Reputation system; Wireless; Wireless network; Telecommunications","score_opus":0.044478337033916966,"score_gpt":0.3235311183297579,"score_spread":0.27905278129584093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241402985","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.009366515,0.00006209886,0.9687222,0.0019797024,0.00043299902,0.011306636,0.00004327492,0.00026508313,0.007821487],"genre_scores_gemma":[0.9888372,0.000020607253,0.006809115,0.00028704636,0.00005437145,0.003943579,0.000023159208,0.000012714868,0.00001223221],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625087,0.0012299658,0.0010129644,0.00056191353,0.0004198009,0.0005244738],"domain_scores_gemma":[0.99292296,0.0006331974,0.00067041424,0.00469362,0.0008741754,0.00020565795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013924324,0.00030255018,0.00052903127,0.00007446389,0.00032577437,0.00029527667,0.0053380723,0.00016855997,0.0000036698727],"category_scores_gemma":[0.0001315141,0.00026817207,0.00009822115,0.0011578337,0.00025312536,0.00038252442,0.0015200723,0.00047983232,0.0000286308],"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.000029822157,0.00019994254,0.0023615535,0.000098610544,0.000033315144,0.0000026974174,0.0007587559,0.0067801974,0.0001228084,0.9346971,0.001186924,0.053728297],"study_design_scores_gemma":[0.00045174174,0.00012626467,0.0031966972,0.00043920256,0.000013165213,0.000016030359,0.00035936592,0.9908639,0.000025862186,0.0024191118,0.0018113344,0.00027730755],"about_ca_topic_score_codex":0.000893841,"about_ca_topic_score_gemma":0.0009896039,"teacher_disagreement_score":0.9840837,"about_ca_system_score_codex":0.00035954328,"about_ca_system_score_gemma":0.00033303496,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W4243865180","doi":"10.1109/glocom.2015.7417306","title":"Relay Selection, Link Scheduling, and Rate Allocation in Dual-Hop Buffer-Aided Networks with Statistical Delay Constraints","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; McGill University","funders":"","keywords":"Relay; Computer science; Scheduling (production processes); Mathematical optimization; Resource allocation; Hop (telecommunications); Selection (genetic algorithm); Computer network; Fading; Relay channel; Wireless; Telecommunications; Mathematics; Channel (broadcasting); Power (physics)","score_opus":0.06811820725560093,"score_gpt":0.3225813429994276,"score_spread":0.2544631357438267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243865180","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.019170484,0.0016566232,0.9643394,0.00884908,0.00022582996,0.00062290934,0.000019581512,0.00028497717,0.0048311483],"genre_scores_gemma":[0.8849528,0.0018682895,0.112404905,0.00047304822,0.000041318028,0.00009854855,0.000079036596,0.000014603982,0.00006749214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964659,0.0013992871,0.00069517514,0.0006025096,0.0003229043,0.000514228],"domain_scores_gemma":[0.99537194,0.00046314564,0.00028742637,0.0021827985,0.0012743402,0.00042033516],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001668091,0.0003596071,0.0004149329,0.00014090165,0.00046790153,0.00053361495,0.0017082243,0.0001983396,0.00003075307],"category_scores_gemma":[0.0003500956,0.00035026597,0.00003503201,0.001313565,0.0007748679,0.0008182228,0.00088968774,0.0007293546,0.0000595233],"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.0001191215,0.0004928086,0.016875288,0.000018876695,0.00013396858,0.00002406807,0.0016225437,0.024770675,0.00013359141,0.8283707,0.005703547,0.12173482],"study_design_scores_gemma":[0.0016422913,0.0002680087,0.008856436,0.00016374876,0.000027843593,0.00019369884,0.00023037357,0.9804071,0.00001894427,0.0027818915,0.004851465,0.00055816025],"about_ca_topic_score_codex":0.0002064898,"about_ca_topic_score_gemma":0.0040279496,"teacher_disagreement_score":0.95563644,"about_ca_system_score_codex":0.00038011983,"about_ca_system_score_gemma":0.0009086922,"threshold_uncertainty_score":0.9998949},"labels":[],"label_agreement":null},{"id":"W4244365807","doi":"10.1109/glocom.2014.7417730","title":"Automatic Device-Transparent RSS-Based Indoor Localization","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"RSS; Computer science; Set (abstract data type); k-nearest neighbors algorithm; Signal strength; Point (geometry); Transformation (genetics); Data mining; Artificial intelligence; Algorithm; Pattern recognition (psychology); Wireless; Mathematics; Telecommunications","score_opus":0.047377494442520415,"score_gpt":0.30046272371446264,"score_spread":0.2530852292719422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244365807","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.015949376,0.00064666616,0.9554567,0.0012494652,0.000594056,0.00055638363,0.00011939822,0.0032682838,0.022159692],"genre_scores_gemma":[0.99166304,0.00024704036,0.007294984,0.00035067945,0.000029608385,0.000120486526,0.00024014023,0.000033165037,0.00002083929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819726,0.00018342194,0.000603381,0.00026688204,0.00031338778,0.00043564942],"domain_scores_gemma":[0.9971619,0.0001221435,0.00012088535,0.0021182727,0.00033798863,0.00013878128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002872075,0.00034181826,0.00036934705,0.00013802208,0.0003197263,0.00016333992,0.0017505146,0.00027091452,0.0002010386],"category_scores_gemma":[0.00012413692,0.0003576702,0.00009863084,0.0007471949,0.0002897906,0.00025164516,0.00011286597,0.00028284956,0.000361289],"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.000039968472,0.0008522816,0.052621424,0.000998063,0.0003768341,0.0000046407076,0.0007704068,0.24128398,0.0008252334,0.20249693,0.058302358,0.4414279],"study_design_scores_gemma":[0.00055384764,0.00003994303,0.0017835636,0.0001215132,0.00004993826,0.0000035587889,0.000120889155,0.95773935,0.001443324,0.0025403532,0.03518293,0.00042078175],"about_ca_topic_score_codex":0.000114014925,"about_ca_topic_score_gemma":0.0008384283,"teacher_disagreement_score":0.9757137,"about_ca_system_score_codex":0.00030290856,"about_ca_system_score_gemma":0.0001235786,"threshold_uncertainty_score":0.9998875},"labels":[],"label_agreement":null},{"id":"W4244770995","doi":"10.1109/glocom.2014.7417351","title":"Cloud-MERVS: An IoT Cloud-Based Error Recovery Video Streaming Scheme","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Cloud computing; Computer network; Service provider; Service (business); Key (lock); Quality of service; The Internet; Scheme (mathematics); Real-time computing; Computer security; World Wide Web; Operating system","score_opus":0.06330461506018699,"score_gpt":0.32515635108528096,"score_spread":0.261851736025094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244770995","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.14171101,0.0006731558,0.8023176,0.007864693,0.013759506,0.0007180421,0.000030399178,0.0015229825,0.031402573],"genre_scores_gemma":[0.85489506,0.00004375828,0.14231636,0.0012831467,0.0011856443,0.000046176476,0.000076589014,0.000029811785,0.00012344374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957967,0.0009083668,0.00085517345,0.00091908756,0.00057226367,0.000948423],"domain_scores_gemma":[0.9912792,0.0004655852,0.0004904808,0.006557754,0.0007295796,0.00047741988],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013822139,0.0005338243,0.0005716221,0.00016842813,0.00104379,0.000843648,0.008232339,0.00027915262,0.00002546402],"category_scores_gemma":[0.00029840012,0.00057313225,0.00022322731,0.0010514798,0.0003500457,0.00088650535,0.0014967357,0.0006191195,0.00053613196],"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.00015094921,0.0025169645,0.020767322,0.00015169445,0.00029179457,0.000016679918,0.0014868275,0.0019048378,0.001832887,0.25941747,0.14314821,0.5683144],"study_design_scores_gemma":[0.0010872207,0.0004094512,0.0040423465,0.0002448626,0.000042191787,0.000027559805,0.0000963517,0.8627004,0.00040270196,0.01371387,0.11611662,0.0011164282],"about_ca_topic_score_codex":0.0008641306,"about_ca_topic_score_gemma":0.0005643804,"teacher_disagreement_score":0.86079556,"about_ca_system_score_codex":0.00037729452,"about_ca_system_score_gemma":0.0007175234,"threshold_uncertainty_score":0.999672},"labels":[],"label_agreement":null},{"id":"W4245207943","doi":"10.1109/glocom.2014.7417599","title":"A Performance Study of CPRI over Ethernet with IEEE 802.1Qbu and 802.1Qbv Enhancements","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Jitter; Ethernet; Ethernet flow control; Computer network; Computer science; Telecommunications","score_opus":0.026932667097472256,"score_gpt":0.2785840003173586,"score_spread":0.2516513332198863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245207943","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.9715746,0.0003255288,0.014110948,0.00011743951,0.0001289055,0.0005736657,0.00002943418,0.00045064624,0.012688847],"genre_scores_gemma":[0.9835571,0.0009429935,0.015259417,0.000032291464,0.000019996009,0.000108510896,0.000010728341,0.000026402637,0.000042540196],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984517,0.000096722535,0.00045615094,0.00030083387,0.0002929294,0.00040164316],"domain_scores_gemma":[0.9972712,0.00014092127,0.00014146943,0.0021362067,0.00020338988,0.00010683229],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022193587,0.00032334117,0.00042891363,0.0000669403,0.00015782488,0.000052664785,0.0013615376,0.0001485719,0.000028991648],"category_scores_gemma":[0.00004331328,0.00029567652,0.000030003563,0.00044057277,0.0004407337,0.00030950888,0.00032541467,0.00038568003,0.000035205318],"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.00049933593,0.0042979126,0.3274742,0.000730095,0.001570348,0.00000791134,0.0034013127,0.096465535,0.0059239687,0.059070203,0.010813286,0.4897459],"study_design_scores_gemma":[0.0057600806,0.0037832751,0.0964518,0.00084590673,0.0003807142,0.000035247034,0.003986252,0.8630485,0.001720386,0.0069021266,0.014595626,0.0024900893],"about_ca_topic_score_codex":0.00008400654,"about_ca_topic_score_gemma":0.00088936154,"teacher_disagreement_score":0.76658297,"about_ca_system_score_codex":0.00011770861,"about_ca_system_score_gemma":0.000035310604,"threshold_uncertainty_score":0.9999495},"labels":[],"label_agreement":null},{"id":"W4246481782","doi":"10.1109/glocom.2014.7417230","title":"Minimizing Deployment Cost of Cloud-Based Web Application with Guaranteed QoS","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Cloud computing; Computer science; Quality of service; Server; Software deployment; Distributed computing; Workload; Task (project management); Database; Web service; Cloud testing; Computer network; Operating system; Cloud computing security; World Wide Web; Engineering","score_opus":0.02938971644611151,"score_gpt":0.27906736713505514,"score_spread":0.24967765068894363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246481782","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.037278116,0.00018639515,0.93669766,0.0050374297,0.0003026612,0.0008617905,0.000023533135,0.00042367436,0.019188737],"genre_scores_gemma":[0.94947267,0.000015658381,0.04972729,0.00053263566,0.000055480064,0.00012047408,0.000017045691,0.0000133232625,0.00004545654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997609,0.00038539158,0.00057773956,0.0005206863,0.00050811836,0.00039902676],"domain_scores_gemma":[0.99448663,0.00023313191,0.0004824119,0.0042030206,0.00043496196,0.0001598276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007282163,0.00029462433,0.000382462,0.000112977,0.00035566345,0.00017703486,0.0045303553,0.00009477888,0.0000060009593],"category_scores_gemma":[0.000043557753,0.00026471668,0.00010513107,0.00081740343,0.00030863058,0.000058441696,0.0007911457,0.00022209375,0.00007581307],"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.0001347858,0.0020278995,0.016541803,0.00020104554,0.00028452475,0.0000033894619,0.00068976614,0.047381606,0.0014390291,0.67856103,0.013774429,0.23896067],"study_design_scores_gemma":[0.0011695806,0.00016718279,0.0015937199,0.00016781385,0.00004523516,0.000008510287,0.000108971726,0.9467697,0.0003821901,0.0009129688,0.04830364,0.00037049843],"about_ca_topic_score_codex":0.0003929798,"about_ca_topic_score_gemma":0.00047302965,"teacher_disagreement_score":0.9121945,"about_ca_system_score_codex":0.00017779814,"about_ca_system_score_gemma":0.0002603311,"threshold_uncertainty_score":0.9999805},"labels":[],"label_agreement":null},{"id":"W4246526343","doi":"10.1109/glocom.2014.7417595","title":"Zoning Based MAC with Support for Recharging Process in WSN","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Throughput; Node (physics); Wireless sensor network; Enhanced Data Rates for GSM Evolution; Process (computing); Wireless; Engineering; Telecommunications","score_opus":0.03202466818726334,"score_gpt":0.294340988107321,"score_spread":0.26231631992005766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246526343","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.10368175,0.00044011077,0.8075851,0.0014962633,0.0006511519,0.0012440232,0.00018207943,0.0017181163,0.08300137],"genre_scores_gemma":[0.9564716,0.00005708815,0.04264641,0.00013651684,0.00005039048,0.00035517706,0.000187302,0.000046566653,0.00004890909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983897,0.0001261674,0.00044119288,0.00030176254,0.00020107259,0.0005400903],"domain_scores_gemma":[0.99757856,0.00033348202,0.00012135608,0.0015400999,0.00028488907,0.00014162458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057181023,0.00029822913,0.0003473594,0.00009803268,0.00019328001,0.00012844049,0.0014360512,0.00016488715,0.000030031351],"category_scores_gemma":[0.00012183985,0.00031376263,0.000051257597,0.0005372392,0.00014804522,0.00026763495,0.00008144968,0.0003808485,0.000023062015],"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.00006527163,0.00019129066,0.024407065,0.00032944325,0.00007639504,0.0000029119542,0.0003233532,0.9092566,0.0002345278,0.03638736,0.00433096,0.024394855],"study_design_scores_gemma":[0.00091476785,0.000072840725,0.0015263234,0.00043792918,0.000026265094,0.000008261316,0.000101503625,0.98423934,0.00029321766,0.0010850333,0.01082982,0.0004646715],"about_ca_topic_score_codex":0.00012083274,"about_ca_topic_score_gemma":0.002407796,"teacher_disagreement_score":0.8527899,"about_ca_system_score_codex":0.00024628371,"about_ca_system_score_gemma":0.00019847135,"threshold_uncertainty_score":0.99993145},"labels":[],"label_agreement":null},{"id":"W4246528592","doi":"10.1109/glocom.2014.7417760","title":"Mobile Virtual Network Admission Control and Resource Allocation for Wireless Network Virtualization: A Robust Optimization Approach","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Admission control; Computer network; Quality of service; Wireless network; Resource allocation; Call Admission Control; Virtualization; Distributed computing; Network virtualization; Optimization problem; Wireless; Cloud computing; Telecommunications; Algorithm","score_opus":0.02910215330905974,"score_gpt":0.26509590012331463,"score_spread":0.2359937468142549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246528592","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.000237119,0.0012819177,0.99238425,0.0011749096,0.0003746072,0.0012219792,0.00003196033,0.00043968906,0.0028535821],"genre_scores_gemma":[0.6579512,0.0006588202,0.33872604,0.0011021333,0.000402393,0.0005939662,0.00039713702,0.00003127373,0.00013704847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99679846,0.0007248024,0.00070079416,0.00075331394,0.00036964516,0.00065296656],"domain_scores_gemma":[0.995352,0.00062187813,0.00047390908,0.002568442,0.00064986525,0.0003338675],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012758548,0.00040062642,0.0005040476,0.000061509956,0.0011170901,0.00057756196,0.0025105276,0.000306723,0.0000099331855],"category_scores_gemma":[0.00015739826,0.00040792182,0.00010910461,0.0009693693,0.00024462657,0.0006584039,0.0005996276,0.00026495918,0.000009483842],"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.00004450339,0.00012220629,0.00060732244,0.000014499652,0.00003584893,1.0991457e-7,0.00012845363,0.7229861,0.0000030226386,0.22221482,0.021412183,0.032430913],"study_design_scores_gemma":[0.0012817958,0.00028792047,0.0002247494,0.00010200674,0.000053442054,0.000013562615,0.00007207092,0.96242785,0.0000017915887,0.003163926,0.0319328,0.00043806797],"about_ca_topic_score_codex":0.000049930743,"about_ca_topic_score_gemma":0.000064665415,"teacher_disagreement_score":0.65771407,"about_ca_system_score_codex":0.00014253071,"about_ca_system_score_gemma":0.00023160475,"threshold_uncertainty_score":0.9998373},"labels":[],"label_agreement":null},{"id":"W4247146374","doi":"10.1109/glocom.2014.7417612","title":"On Resource Allocation for Downlink Power Minimization in OFDMA Small Cells in a Cloud-RAN","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Macrocell; Telecommunications link; Transmitter power output; Computer science; Quality of service; C-RAN; Radio access network; Computer network; Orthogonal frequency-division multiple access; Resource allocation; Optimization problem; Cloud computing; Cellular network; Power control; Mathematical optimization; Power (physics); Orthogonal frequency-division multiplexing; Base station; Mathematics; Transmitter; Algorithm; Mobile station","score_opus":0.027926065380216955,"score_gpt":0.2692897233114155,"score_spread":0.24136365793119852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247146374","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.03695383,0.0004568062,0.93569875,0.0016161223,0.0008119277,0.0022269073,0.0002437768,0.00047795157,0.021513961],"genre_scores_gemma":[0.9813554,0.0002559238,0.01738413,0.00014776964,0.00004084496,0.00041261566,0.00028018013,0.000040097304,0.0000830299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981618,0.000259639,0.00070819736,0.00033829044,0.00014459703,0.0003874707],"domain_scores_gemma":[0.9976208,0.00036190532,0.0001690565,0.0015113562,0.00023728132,0.00009959941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046660274,0.00029235237,0.00035616744,0.00020869361,0.000102744445,0.00007579774,0.00097625767,0.00024255246,0.000019983665],"category_scores_gemma":[0.00020952264,0.0003438056,0.00006221426,0.0006335545,0.00007763652,0.00022692271,0.0000842287,0.00026545004,0.000057208636],"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.00006778636,0.00025537977,0.00087959354,0.00008736448,0.000022531563,3.5495194e-7,0.00062873994,0.94848853,0.0012588191,0.035824582,0.004663635,0.007822683],"study_design_scores_gemma":[0.001822062,0.00009594835,0.0009648057,0.00038085855,0.000019266523,0.0000019851507,0.00029586468,0.97477216,0.0006060481,0.0035563826,0.016940983,0.0005436628],"about_ca_topic_score_codex":0.00019785117,"about_ca_topic_score_gemma":0.003706976,"teacher_disagreement_score":0.94440156,"about_ca_system_score_codex":0.00052641646,"about_ca_system_score_gemma":0.00006931327,"threshold_uncertainty_score":0.9999014},"labels":[],"label_agreement":null},{"id":"W4248230856","doi":"10.1109/glocom.2014.7417463","title":"Distributed Space Time Coding for Bit-Interleaved Coded Modulation in Two-Way Relaying Communications","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rician fading; Computer science; Decoding methods; Algorithm; Rayleigh fading; Relay; Coding (social sciences); Bit error rate; Space–time code; Fading; Theoretical computer science; Mathematics; Statistics","score_opus":0.07768616555233726,"score_gpt":0.34999827078020956,"score_spread":0.2723121052278723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248230856","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.0050851814,0.0006680293,0.95939666,0.020630024,0.00028825997,0.0011780327,0.00014253145,0.0005190448,0.012092208],"genre_scores_gemma":[0.9018745,0.0011199359,0.09557768,0.00040272635,0.000038207312,0.00030266188,0.0005103927,0.00002344107,0.00015047264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958514,0.0014673623,0.0010288089,0.00065799727,0.00033487243,0.0006595498],"domain_scores_gemma":[0.9887944,0.0012833652,0.00052919646,0.008128451,0.001022026,0.00024256643],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001809328,0.00043198455,0.00059629657,0.00022858298,0.0011782788,0.0006071002,0.008818971,0.00016002671,0.00002901191],"category_scores_gemma":[0.0006130003,0.0004850144,0.00018081172,0.0015609096,0.0004027663,0.0010501407,0.0025751684,0.0005926002,0.00019641824],"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.00003708144,0.00047846526,0.0026508388,0.000025061487,0.00006897045,5.101657e-7,0.0008296736,0.0019325179,0.003187999,0.9016177,0.0064662355,0.08270493],"study_design_scores_gemma":[0.0015039011,0.00006103303,0.0033177894,0.0002349455,0.000022192631,0.000008805623,0.00009804511,0.9599011,0.00012781308,0.01212583,0.022064585,0.0005339872],"about_ca_topic_score_codex":0.00020227265,"about_ca_topic_score_gemma":0.0035936367,"teacher_disagreement_score":0.95796853,"about_ca_system_score_codex":0.0006393897,"about_ca_system_score_gemma":0.00024897096,"threshold_uncertainty_score":0.99976015},"labels":[],"label_agreement":null},{"id":"W4248441294","doi":"10.1109/glocom.2014.7417852","title":"Movement Prediction in Vehicular Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Kalman filter; Computer science; Reliability (semiconductor); Hidden Markov model; Movement (music); Reduction (mathematics); Mean squared prediction error; Extended Kalman filter; Filter (signal processing); Markov chain; Artificial intelligence; Machine learning; Power (physics); Computer vision; Mathematics","score_opus":0.01742129969525309,"score_gpt":0.24528689730667566,"score_spread":0.22786559761142258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248441294","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.23288709,0.0075290683,0.579478,0.0028436058,0.0033452804,0.0023182698,0.00023929644,0.0026882656,0.16867109],"genre_scores_gemma":[0.995734,0.001053298,0.0023817283,0.00025987925,0.0001258609,0.00014391528,0.00019765992,0.00003290045,0.000070756614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979002,0.00028562927,0.00059355376,0.0003129905,0.00029384842,0.00061378966],"domain_scores_gemma":[0.9971024,0.00008658165,0.00008919115,0.0023532843,0.00015914881,0.00020941753],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063472334,0.00032664422,0.00035664072,0.00008703136,0.00015880687,0.00012787407,0.0014460294,0.00025580399,0.00009699203],"category_scores_gemma":[0.00003998,0.00037161808,0.000097175005,0.00057661894,0.00014332792,0.00028505555,0.00025681366,0.0005706994,0.00024083554],"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.000005575387,0.00008704778,0.0062756874,0.000015529671,0.00004813871,0.0000016199715,0.000044579603,0.95659244,0.00008021835,0.0107517075,0.014422934,0.011674522],"study_design_scores_gemma":[0.0005210436,0.000033392018,0.01190762,0.00010172793,0.000026829262,0.00000658118,0.000042292966,0.9532664,0.00002506096,0.0019648836,0.031790826,0.00031334866],"about_ca_topic_score_codex":0.00026394887,"about_ca_topic_score_gemma":0.0027617633,"teacher_disagreement_score":0.7628469,"about_ca_system_score_codex":0.0005268782,"about_ca_system_score_gemma":0.000060250655,"threshold_uncertainty_score":0.9998736},"labels":[],"label_agreement":null},{"id":"W4248560030","doi":"10.1109/glocom.2014.7417541","title":"Soft Input Soft Output MMSE-SQRD Based Turbo Equalization for MIMO-OFDM Systems under Imperfect Channel Estimation","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Minimum mean square error; Equalization (audio); Turbo; MIMO; Control theory (sociology); Channel (broadcasting); Algorithm; Computer science; Orthogonal frequency-division multiplexing; Bit error rate; Single antenna interference cancellation; Multiuser detection; Turbo code; Detector; Mathematics; Decoding methods; Statistics; Engineering; Telecommunications; Artificial intelligence","score_opus":0.05480778712929119,"score_gpt":0.3169631660191675,"score_spread":0.26215537888987633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248560030","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.0019095466,0.0010712921,0.98901963,0.00086534343,0.00052897225,0.0014315265,0.00030639544,0.0021013524,0.0027659312],"genre_scores_gemma":[0.95460856,0.00041723455,0.04238764,0.00024689987,0.000073943505,0.0010455565,0.001053152,0.000089990244,0.000077017576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971636,0.0004547153,0.00096667453,0.00044472443,0.00037774252,0.0005925397],"domain_scores_gemma":[0.9938444,0.0008968841,0.00038272172,0.003938174,0.00071597175,0.00022188755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008191566,0.00053986337,0.000603213,0.00021338725,0.00054349273,0.00030140823,0.0025117316,0.00038166315,0.00001163525],"category_scores_gemma":[0.00040170565,0.0006094388,0.0001708557,0.00059376867,0.00026198564,0.00068059424,0.00027830922,0.00040228284,0.00012656003],"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.000051556566,0.0003223154,0.0002856473,0.0005068702,0.00016007184,2.6081926e-7,0.00031649345,0.82640857,0.0014915055,0.09570315,0.013266081,0.061487507],"study_design_scores_gemma":[0.00070721644,0.00008475674,0.00018930585,0.00025012312,0.00006266779,0.0000051765346,0.00013253231,0.97360915,0.0009996543,0.008413893,0.0149032455,0.00064226205],"about_ca_topic_score_codex":0.00018920231,"about_ca_topic_score_gemma":0.0003150726,"teacher_disagreement_score":0.952699,"about_ca_system_score_codex":0.0006634295,"about_ca_system_score_gemma":0.00019002847,"threshold_uncertainty_score":0.9996357},"labels":[],"label_agreement":null},{"id":"W4248624297","doi":"10.1109/glocom.2014.7417236","title":"Communication-Efficient Decentralized Change Detection for Cognitive Wireless Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Fusion center; Cognitive radio; Computer science; Wireless; Key (lock); False alarm; Change detection; Metric (unit); Constraint (computer-aided design); Computer network; Constant false alarm rate; Real-time computing; Energy consumption; Wireless sensor network; Energy (signal processing); Distributed computing; Telecommunications; Algorithm; Artificial intelligence; Engineering; Computer security","score_opus":0.051294855240025486,"score_gpt":0.3097792235893056,"score_spread":0.2584843683492801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248624297","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.0030145843,0.00093134306,0.9885074,0.0020139266,0.0008595788,0.001152803,0.00013053234,0.0005276204,0.0028622358],"genre_scores_gemma":[0.9817155,0.001044537,0.01556294,0.0006742675,0.000107330074,0.0006269986,0.00021364934,0.000019571287,0.000035185494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971032,0.0006646437,0.0006254704,0.0005876478,0.00034398458,0.00067503547],"domain_scores_gemma":[0.99424183,0.0006427875,0.00043989113,0.0031035552,0.0012595975,0.000312309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008236822,0.00036724922,0.00042423236,0.00009613523,0.0011205411,0.000578651,0.0034444307,0.00025338517,0.000018869909],"category_scores_gemma":[0.00014767866,0.00039098508,0.00020307944,0.0011284597,0.00033330696,0.0004895433,0.0006818488,0.000387574,0.00008160609],"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.00009815657,0.0007627131,0.00023435082,0.000023030396,0.0001429986,6.24157e-7,0.00041346875,0.0025392761,0.00005311245,0.19089955,0.0023353084,0.8024974],"study_design_scores_gemma":[0.0012391255,0.00011269486,0.0014296835,0.00009373767,0.000047840706,0.000017652621,0.00014613394,0.9720288,0.00012271434,0.0022839056,0.022026772,0.0004509217],"about_ca_topic_score_codex":0.00031996192,"about_ca_topic_score_gemma":0.00096806587,"teacher_disagreement_score":0.97870094,"about_ca_system_score_codex":0.00025623597,"about_ca_system_score_gemma":0.0000979869,"threshold_uncertainty_score":0.9998542},"labels":[],"label_agreement":null},{"id":"W4249025297","doi":"10.1109/glocom.2014.7417509","title":"Enhancing the Performance of Amplify-and-Forward Cognitive Relay Networks: A Multiple-Relay Scenario","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Underlay; Relay; Cognitive radio; Computer science; Transmitter; Interference (communication); Node (physics); Throughput; Transmission (telecommunications); Transmitter power output; Optimization problem; Computer network; Constraint (computer-aided design); Signal-to-noise ratio (imaging); Cognitive network; Mathematical optimization; Power (physics); Telecommunications; Engineering; Wireless; Algorithm; Mathematics; Channel (broadcasting)","score_opus":0.023892914008471284,"score_gpt":0.26984779337019676,"score_spread":0.24595487936172547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249025297","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.2148239,0.0015316886,0.7731284,0.0023156933,0.00044884282,0.0005769035,0.000024613226,0.00018014542,0.0069698165],"genre_scores_gemma":[0.987325,0.0015642574,0.010444968,0.0004666604,0.000088199195,0.000030246472,0.000020195344,0.0000138296355,0.000046623434],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724674,0.00065038074,0.0006751514,0.0005041231,0.00035344425,0.0005701716],"domain_scores_gemma":[0.9950486,0.0015566696,0.00044222033,0.0021315084,0.00063226995,0.00018873424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012373489,0.0003354526,0.0004648911,0.00007146342,0.0008566131,0.00030072904,0.00240875,0.00016529024,0.000009476734],"category_scores_gemma":[0.00030310987,0.0002746692,0.000119179036,0.00072079437,0.0007043036,0.000523461,0.001054322,0.0006303688,0.00003731113],"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.00022890478,0.00074737304,0.06360327,0.00012306703,0.00063180906,0.0000063394396,0.0044694254,0.01175422,0.0008995048,0.30843288,0.0029692347,0.606134],"study_design_scores_gemma":[0.0007043715,0.00017125937,0.014771817,0.00039913284,0.000064825486,0.000056001867,0.00023959273,0.9799222,0.0002596237,0.0005678146,0.0024536592,0.0003897557],"about_ca_topic_score_codex":0.00045566194,"about_ca_topic_score_gemma":0.0024485295,"teacher_disagreement_score":0.9681679,"about_ca_system_score_codex":0.000116038995,"about_ca_system_score_gemma":0.00020771268,"threshold_uncertainty_score":0.99997056},"labels":[],"label_agreement":null},{"id":"W4249118100","doi":"10.1109/glocom.2015.7417496","title":"Space-Time Block Codes over the Stiefel Manifold","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Block code; Phase-shift keying; Algorithm; Unitary state; Computer science; Group code; Linear code; Quadrature amplitude modulation; Space time; Code (set theory); Topology (electrical circuits); Mathematics; Decoding methods; Bit error rate; Combinatorics; Engineering","score_opus":0.05221925135801127,"score_gpt":0.30834974768578755,"score_spread":0.2561304963277763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249118100","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.10634662,0.025704814,0.15657973,0.023361718,0.0019093836,0.0047885743,0.0017065064,0.014189236,0.66541344],"genre_scores_gemma":[0.9797676,0.002252493,0.016908022,0.00022963648,0.000052866235,0.00020155817,0.000093222596,0.000049615945,0.0004449675],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997943,0.00032105827,0.0005584173,0.00027463282,0.0004183563,0.00048453914],"domain_scores_gemma":[0.9933576,0.00024108661,0.00017368239,0.005443612,0.00051336165,0.00027064097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005158563,0.00040379123,0.00039687878,0.00008057144,0.00034774296,0.00020606356,0.0045062806,0.000208161,0.00008789349],"category_scores_gemma":[0.00012199699,0.00036210223,0.00011171253,0.00059725845,0.00041300105,0.00047129928,0.00084343523,0.00061880046,0.0007501954],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005236995,0.0005375065,0.0023647917,0.00006626163,0.00041920829,0.000005659068,0.0012432021,0.017018659,0.003535258,0.30736724,0.64798194,0.019407926],"study_design_scores_gemma":[0.0013792833,0.0001266972,0.0030372506,0.00024083978,0.00015192559,0.00008768315,0.001085148,0.3971233,0.0030129603,0.038145345,0.5539041,0.0017054058],"about_ca_topic_score_codex":0.00031091136,"about_ca_topic_score_gemma":0.00056927523,"teacher_disagreement_score":0.873421,"about_ca_system_score_codex":0.00052330934,"about_ca_system_score_gemma":0.00019554661,"threshold_uncertainty_score":0.9998831},"labels":[],"label_agreement":null},{"id":"W4249562984","doi":"10.1109/glocom.2015.7417468","title":"Optimal Stochastic Power Control for Energy Harvesting Systems with Statistical Delay Constraint","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; Transmitter; Mathematical optimization; Computer science; Optimal control; Fading; Network packet; Power control; Energy harvesting; Markov process; Online algorithm; Channel (broadcasting); Time horizon; Power (physics); Control theory (sociology); Energy (signal processing); Control (management); Mathematics; Computer network","score_opus":0.03963225574957347,"score_gpt":0.2729814665412121,"score_spread":0.23334921079163862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249562984","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.00314276,0.0011091208,0.9830487,0.0001858479,0.00067373394,0.00047260054,0.0007468412,0.00067324046,0.009947207],"genre_scores_gemma":[0.94610417,0.000027830503,0.053036977,0.0000703178,0.00009608575,0.00029643893,0.00021109762,0.00006269986,0.000094380805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758536,0.00024113701,0.00067660207,0.00038478978,0.00037595487,0.000736173],"domain_scores_gemma":[0.99592006,0.0008435519,0.00018940539,0.0015995343,0.00090156536,0.0005458977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005315178,0.00045903545,0.000573135,0.000069358925,0.000250534,0.00034617123,0.0013467713,0.00023083185,0.000015129617],"category_scores_gemma":[0.00029247688,0.00045093184,0.0000648421,0.0002986707,0.0005977756,0.00030282116,0.00012949553,0.00037190496,0.000030104975],"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.000051475698,0.000067723624,0.00017039679,0.000024996894,0.00016012279,0.000006316425,0.00007355626,0.84483147,0.000018361316,0.14641349,0.0066152755,0.001566795],"study_design_scores_gemma":[0.0017019929,0.00020057047,0.00010134935,0.00023616306,0.00010724109,0.00015593601,0.0004161354,0.9894705,0.000005381285,0.0005211241,0.0064978935,0.0005857569],"about_ca_topic_score_codex":0.0005902013,"about_ca_topic_score_gemma":0.00081294804,"teacher_disagreement_score":0.9429614,"about_ca_system_score_codex":0.00045227603,"about_ca_system_score_gemma":0.0004850651,"threshold_uncertainty_score":0.99979424},"labels":[],"label_agreement":null},{"id":"W4249698913","doi":"10.1109/glocom.2014.7417538","title":"Low Complexity Hybrid ARQ Using Extended Turbo Product Codes Self-Detection","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Hybrid automatic repeat request; Cyclic redundancy check; Computer science; Error detection and correction; Turbo code; Algorithm; Throughput; Automatic repeat request; Turbo; Low-density parity-check code; Redundancy (engineering); Real-time computing; Decoding methods; Wireless; Computer network; Telecommunications link; Engineering; Telecommunications","score_opus":0.06391313434900145,"score_gpt":0.30757356344370057,"score_spread":0.24366042909469912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249698913","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.13508928,0.0003802695,0.8455301,0.0022195114,0.0011925651,0.0006843937,0.000070168375,0.0015343402,0.013299384],"genre_scores_gemma":[0.93650657,0.00009723123,0.06296609,0.00024793128,0.00009204334,0.000036803827,0.000022479291,0.00001332308,0.00001750251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669456,0.0010593918,0.00054085546,0.0007226064,0.0004135069,0.00056906295],"domain_scores_gemma":[0.99370223,0.00018859695,0.0003524485,0.0048994026,0.0006152034,0.00024213192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011658461,0.00038360208,0.00041870415,0.00015202712,0.0010402532,0.00055399013,0.0047797374,0.000091629714,0.000030202074],"category_scores_gemma":[0.00013513702,0.00040213097,0.00018891851,0.0009993006,0.0005326809,0.0008603814,0.0010601243,0.00042831316,0.00013613717],"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.000063400395,0.0012293861,0.0010378808,0.00007975116,0.00014390807,0.0000030530648,0.0004533447,0.00021353594,0.004074186,0.8148276,0.0015476671,0.17632626],"study_design_scores_gemma":[0.0011579328,0.00037582478,0.007740681,0.00019760847,0.00012663298,0.00023223499,0.00012070831,0.5814861,0.012909017,0.37862846,0.015549235,0.0014755615],"about_ca_topic_score_codex":0.00031314619,"about_ca_topic_score_gemma":0.0006079416,"teacher_disagreement_score":0.8014173,"about_ca_system_score_codex":0.00022970712,"about_ca_system_score_gemma":0.00022888416,"threshold_uncertainty_score":0.99984306},"labels":[],"label_agreement":null},{"id":"W4250302155","doi":"10.1109/glocom.2014.7417704","title":"Uplink Detection and BER Analysis for Ambient Backscatter Communication Systems","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Energy Harvesting in Wireless Networks","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Telecommunications link; Computer science; Bit error rate; Backscatter (email); Transmission (telecommunications); Signal-to-noise ratio (imaging); SIGNAL (programming language); Detection theory; Channel (broadcasting); Communications system; Electronic engineering; Encoding (memory); Wireless; Differential coding; Real-time computing; Decoding methods; Algorithm; Telecommunications; Detector; Engineering; Artificial intelligence","score_opus":0.028061042292069287,"score_gpt":0.2661723039949445,"score_spread":0.23811126170287522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250302155","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.08806223,0.0023269425,0.8985466,0.00071020913,0.0005768133,0.0006479136,0.00008738621,0.0007086284,0.008333314],"genre_scores_gemma":[0.9879613,0.0008869219,0.010367859,0.00007290459,0.00006156268,0.0003261898,0.0002033785,0.000030236606,0.000089678484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839705,0.00026835216,0.00052982615,0.00029136587,0.00016148346,0.0003519252],"domain_scores_gemma":[0.99634486,0.00036046212,0.00014205395,0.0026233383,0.00037212623,0.00015716747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006024977,0.00027744344,0.00040665816,0.0001333871,0.00039931134,0.00027699256,0.0011405725,0.0002197875,0.000010997365],"category_scores_gemma":[0.000069246176,0.00030723657,0.000117512114,0.00065401086,0.00021839117,0.00025630352,0.00022071328,0.0002848545,0.00003199569],"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.0000341262,0.00020817942,0.021867706,0.00022234317,0.0016406437,2.677797e-7,0.00037801708,0.84637845,0.0013334496,0.07169881,0.008591193,0.047646847],"study_design_scores_gemma":[0.00032559442,0.000027324088,0.008811174,0.00007185032,0.00030137994,0.000006421746,0.00006376946,0.9759746,0.000087295084,0.00058624684,0.013408922,0.0003354304],"about_ca_topic_score_codex":0.00058203604,"about_ca_topic_score_gemma":0.0035732603,"teacher_disagreement_score":0.89989907,"about_ca_system_score_codex":0.00022059854,"about_ca_system_score_gemma":0.000024457746,"threshold_uncertainty_score":0.99993795},"labels":[],"label_agreement":null},{"id":"W4251102826","doi":"10.1109/glocom.2014.7417239","title":"Prioritized Access in a Channel-Hopping Cognitive Network with Spectrum Sensing","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Cognitive radio; Channel (broadcasting); Network packet; Bandwidth (computing); Transmission (telecommunications); Node (physics); Bandwidth allocation; Cognitive network; Channel allocation schemes; Telecommunications; Wireless; Engineering","score_opus":0.042520131035953444,"score_gpt":0.3094440834311453,"score_spread":0.2669239523951919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251102826","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.022909248,0.00054762943,0.9245444,0.0065725017,0.0004575273,0.0007219844,0.0000146184875,0.0003816346,0.043850455],"genre_scores_gemma":[0.9800114,0.00036129585,0.018505486,0.0008240189,0.00020224256,0.000017568264,0.000026502048,0.000021842032,0.000029653345],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964208,0.000805909,0.00058787013,0.0007733441,0.00041470415,0.0009973482],"domain_scores_gemma":[0.99624246,0.0006308024,0.00034523822,0.0020635093,0.00046128436,0.00025668932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009089102,0.00043804155,0.0006174786,0.00015837773,0.000626487,0.0010279573,0.0027477997,0.00015268919,0.000012309797],"category_scores_gemma":[0.00012905926,0.00043746072,0.00010267795,0.0019362092,0.0003588398,0.0010663399,0.0011617197,0.00062387576,0.000050877203],"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.00046753645,0.00090388145,0.025405992,0.00010260287,0.00047476674,0.00018183129,0.0024383108,0.007567583,0.00009839724,0.476175,0.004089841,0.48209423],"study_design_scores_gemma":[0.0022914317,0.0001668757,0.019941518,0.0013129895,0.00005273822,0.00020401,0.0002183315,0.93590695,0.000057737958,0.036961794,0.0018877795,0.00099787],"about_ca_topic_score_codex":0.00083942,"about_ca_topic_score_gemma":0.012891688,"teacher_disagreement_score":0.9571021,"about_ca_system_score_codex":0.00031161943,"about_ca_system_score_gemma":0.0003744151,"threshold_uncertainty_score":0.9998077},"labels":[],"label_agreement":null},{"id":"W4251247182","doi":"10.1109/glocom.2014.7417371","title":"An Adaptive Frame Length Aggregation Scheme in Vehicular Delay-Tolerant Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":0,"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 Ottawa","funders":"Canada Research Chairs","keywords":"Computer science; Frame (networking); Throughput; Transmission (telecommunications); Computer network; Transmission delay; Scheme (mathematics); Data aggregator; Wireless; Network topology; Data transmission; Topology (electrical circuits); Real-time computing; Wireless sensor network; Telecommunications; Engineering; Mathematics","score_opus":0.04197547281050776,"score_gpt":0.29732265974550753,"score_spread":0.2553471869349998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251247182","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.012776856,0.00078600075,0.9714295,0.0016014731,0.00053279666,0.00046384026,0.000024283821,0.0003292123,0.01205602],"genre_scores_gemma":[0.92604434,0.0004476413,0.07229565,0.00084942736,0.00011467465,0.00008323089,0.000111767666,0.000018847064,0.000034446275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961032,0.0009516699,0.0008515896,0.0007954883,0.0005174033,0.0007806241],"domain_scores_gemma":[0.99363494,0.0002827296,0.0004025068,0.004644896,0.00059585966,0.00043909028],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012110482,0.0004542554,0.0005626016,0.00013732702,0.0004708917,0.00049071107,0.0050016874,0.0004018093,0.000034265475],"category_scores_gemma":[0.000030956777,0.00047482605,0.00013036128,0.0009986212,0.00036591687,0.0012569166,0.0006872218,0.0008168297,0.0001411797],"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.000071305236,0.0008354587,0.006322594,0.000012389898,0.00007771004,0.0000232151,0.0004913277,0.012887996,0.00003190996,0.5938487,0.003223772,0.38217363],"study_design_scores_gemma":[0.0006940664,0.00020044175,0.0016805192,0.00013389147,0.000019831912,0.000034557106,0.00010243454,0.9790694,0.0000056041367,0.012795767,0.004723922,0.0005395522],"about_ca_topic_score_codex":0.00079142395,"about_ca_topic_score_gemma":0.0013500745,"teacher_disagreement_score":0.9661814,"about_ca_system_score_codex":0.0002782719,"about_ca_system_score_gemma":0.00040738858,"threshold_uncertainty_score":0.99977034},"labels":[],"label_agreement":null},{"id":"W4252109019","doi":"10.1109/glocom.2014.7417607","title":"Interweave Cognitive Networks with Co-Operative Sensing","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Cognitive radio; Node (physics); Rayleigh fading; Computer science; Fading; Decoding methods; Primary (astronomy); Poisson distribution; Beacon; Computer network; Interference (communication); Algorithm; Topology (electrical circuits); Wireless; Telecommunications; Mathematics; Statistics; Physics; Combinatorics; Channel (broadcasting)","score_opus":0.03136662113133386,"score_gpt":0.31240757502692634,"score_spread":0.28104095389559247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252109019","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.0072231833,0.00031441808,0.92221767,0.002376687,0.0002702083,0.00041162077,0.000025310337,0.00030993627,0.066850945],"genre_scores_gemma":[0.9644304,0.00024786525,0.033884004,0.0011325356,0.0001346473,0.000012699972,0.0000614351,0.000019907351,0.000076496064],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692786,0.00083911454,0.00047292578,0.0006996792,0.00037217114,0.0006882798],"domain_scores_gemma":[0.99563664,0.0006489369,0.000293652,0.0021574881,0.0009665736,0.00029672854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005740507,0.00044161137,0.0005049141,0.0000951423,0.0007966927,0.0008004197,0.0020074418,0.00015411885,0.000025123467],"category_scores_gemma":[0.00010573483,0.00040046396,0.00011112913,0.00078530714,0.0006182464,0.00072341703,0.0006051447,0.00061058986,0.00013855564],"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.00016358115,0.00043511853,0.003696987,0.000019351242,0.0004894747,0.000067739784,0.0017719717,0.0020616848,0.000117125644,0.23240267,0.0060215853,0.7527527],"study_design_scores_gemma":[0.0010375254,0.00029789447,0.0025177628,0.00043717376,0.000060395894,0.00029461444,0.0004622635,0.9869933,0.00016756271,0.0027471883,0.0042541423,0.0007301906],"about_ca_topic_score_codex":0.00026941,"about_ca_topic_score_gemma":0.0020314504,"teacher_disagreement_score":0.9849316,"about_ca_system_score_codex":0.0002327778,"about_ca_system_score_gemma":0.00026097955,"threshold_uncertainty_score":0.99984473},"labels":[],"label_agreement":null},{"id":"W4253771444","doi":"10.1109/glocom.2014.7417469","title":"A Public Vehicle System with Multiple Origin-Destination Pairs on Traffic Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Transportation and Mobility Innovations","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":"McGill University","funders":"","keywords":"Taxis; Public transport; Computer science; Traffic congestion; Scheduling (production processes); Travelling salesman problem; Key (lock); Path (computing); Energy consumption; Traffic system; Transport engineering; Real-time computing; Computer network; Mathematical optimization; Engineering; Computer security","score_opus":0.05761607196773316,"score_gpt":0.2602072905555159,"score_spread":0.20259121858778273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253771444","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.37663606,0.00018911347,0.54839206,0.0034537108,0.00084604183,0.0013307922,0.0002464947,0.0037180004,0.06518775],"genre_scores_gemma":[0.9962599,0.000045837733,0.002974221,0.00011246523,0.000042416985,0.00018865419,0.00031777777,0.000026595231,0.00003209268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985146,0.0001458433,0.0004544598,0.0002631612,0.00026209894,0.0003598583],"domain_scores_gemma":[0.99742717,0.00018393772,0.00011040733,0.0015966431,0.0005130416,0.00016883262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034592283,0.00026472114,0.0002510692,0.00010560991,0.00033319584,0.00016301195,0.0008571076,0.00013843324,0.000026873517],"category_scores_gemma":[0.000052814557,0.00026054133,0.000057541354,0.0008370311,0.00017070978,0.00029770966,0.00002535448,0.00033400953,0.00013146507],"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.00003805762,0.00042111595,0.015686989,0.00011208331,0.00014376112,0.0000014812134,0.0002473784,0.43421268,0.000089711655,0.49715224,0.0052927635,0.04660174],"study_design_scores_gemma":[0.000859461,0.00008861194,0.029102502,0.00011738308,0.000033491542,0.000007692272,0.00028081285,0.9539196,0.000014929999,0.00008938093,0.015131214,0.00035492316],"about_ca_topic_score_codex":0.00010065988,"about_ca_topic_score_gemma":0.0038510165,"teacher_disagreement_score":0.6196239,"about_ca_system_score_codex":0.0003395354,"about_ca_system_score_gemma":0.00011152417,"threshold_uncertainty_score":0.9999847},"labels":[],"label_agreement":null},{"id":"W4254167297","doi":"10.1109/glocom.2014.7417366","title":"A Local Search Algorithm for Resource Allocation for Underlaying Device-to-Device Communications","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Algoma University; Queen's University","funders":"","keywords":"Computer science; Resource allocation; Telecommunications link; Heuristic; Resource management (computing); Mathematical optimization; Algorithm; Cellular network; Local search (optimization); Resource (disambiguation); Greedy algorithm; Interference (communication); Block (permutation group theory); Distributed computing; Computer network; Mathematics","score_opus":0.07882798558398227,"score_gpt":0.3457145059726765,"score_spread":0.2668865203886942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254167297","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.00016632011,0.0006521913,0.9854233,0.0027668693,0.00022112616,0.0023331733,0.00037933583,0.00062911725,0.007428518],"genre_scores_gemma":[0.5983628,0.0001828446,0.3988931,0.00030040552,0.00006944621,0.0012566821,0.00075192074,0.000066756045,0.00011604041],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975862,0.00030324177,0.00078853406,0.00043822656,0.00024966802,0.0006341213],"domain_scores_gemma":[0.9933559,0.00087122165,0.00016469587,0.0041529424,0.0011550547,0.00030021043],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095887866,0.0003863733,0.00046031125,0.00016265562,0.00078476535,0.00020132284,0.003036985,0.00024258469,0.000008758389],"category_scores_gemma":[0.00020838075,0.00046525762,0.00013649295,0.0007481738,0.0002491668,0.0004212684,0.00042793978,0.00030753057,0.00011507716],"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.000041858406,0.00028129222,0.00012685444,0.00032685974,0.00022861193,1.3555828e-7,0.000992955,0.33697975,0.00095946866,0.08730675,0.017043687,0.5557118],"study_design_scores_gemma":[0.00072062196,0.000076629585,0.00005310348,0.00014724486,0.00006023376,0.0000059175954,0.0009032837,0.86804634,0.00020802011,0.0013640285,0.12797222,0.00044235584],"about_ca_topic_score_codex":0.00020174705,"about_ca_topic_score_gemma":0.0015404982,"teacher_disagreement_score":0.5981965,"about_ca_system_score_codex":0.00076224835,"about_ca_system_score_gemma":0.00018523916,"threshold_uncertainty_score":0.99977994},"labels":[],"label_agreement":null},{"id":"W4254496179","doi":"10.1109/glocom.2014.7417116","title":"A Novel Spectrum Monitoring Algorithm for OFDM-Based Cognitive Radio Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Orthogonal frequency-division multiplexing; Cognitive radio; Computer science; Interference (communication); Throughput; Transmission (telecommunications); Electronic engineering; Computer network; Telecommunications; Wireless; Engineering; Channel (broadcasting)","score_opus":0.04618272571863639,"score_gpt":0.30587534532217087,"score_spread":0.25969261960353446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254496179","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.00066320086,0.0006284699,0.98858464,0.0029097206,0.0011006464,0.00073950645,0.000096678006,0.00039000445,0.0048871064],"genre_scores_gemma":[0.7744525,0.00017006566,0.22438797,0.00034924864,0.0004074153,0.00009684279,0.000063103755,0.00002399178,0.00004886049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701357,0.00031895048,0.0005976055,0.00077802665,0.00038086614,0.000910996],"domain_scores_gemma":[0.99514633,0.0010767024,0.00035842185,0.0023511876,0.00073114666,0.00033620268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00081383303,0.0004657198,0.000553351,0.00012522227,0.00088176504,0.00066823134,0.0029729935,0.00021115647,0.000011419159],"category_scores_gemma":[0.00015641816,0.0005051089,0.00025594566,0.00088739244,0.000337776,0.00054086687,0.00051629776,0.00047551416,0.000038516504],"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.000048380614,0.0006720742,0.0016134663,0.000020803776,0.0002115024,0.00000427703,0.00018601393,0.0024137544,0.00016813804,0.10788122,0.002389215,0.8843911],"study_design_scores_gemma":[0.001663101,0.000180331,0.0028207905,0.00023925053,0.00006570039,0.000036749057,0.000066732115,0.98574764,0.00027277356,0.0039942013,0.004310723,0.00060201675],"about_ca_topic_score_codex":0.0002993328,"about_ca_topic_score_gemma":0.00041207767,"teacher_disagreement_score":0.9833339,"about_ca_system_score_codex":0.00033445796,"about_ca_system_score_gemma":0.0003524521,"threshold_uncertainty_score":0.99974006},"labels":[],"label_agreement":null},{"id":"W4254710034","doi":"10.1109/glocom.2014.7417812","title":"Feedback Energy Reduction in Massive MIMO Systems","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Université du Québec à Montréal","funders":"","keywords":"Channel state information; Computer science; MIMO; Energy consumption; Integer programming; Reduction (mathematics); Computational complexity theory; Base station; Heuristic; Mathematical optimization; Transmitter; Linear programming; Control theory (sociology); Channel (broadcasting); Computer network; Telecommunications; Algorithm; Wireless; Mathematics; Engineering; Electrical engineering","score_opus":0.024977711833886144,"score_gpt":0.26393724408512703,"score_spread":0.2389595322512409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254710034","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.0051215068,0.002934843,0.87656945,0.00074582215,0.0026544735,0.00070063426,0.00011329874,0.0009680184,0.11019197],"genre_scores_gemma":[0.99222535,0.0009740675,0.0060665514,0.00002161618,0.000102092155,0.00018612508,0.00013819755,0.00003440468,0.00025157284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818647,0.00030485162,0.0006326303,0.00029628153,0.00018455499,0.00039523715],"domain_scores_gemma":[0.9973766,0.000073572315,0.0001666923,0.0019324594,0.0003116054,0.0001390543],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027283956,0.00029357924,0.00037789447,0.00013632793,0.00014251906,0.00012608,0.0010728416,0.00021462582,0.000022309901],"category_scores_gemma":[0.00006137873,0.0003393527,0.00005794071,0.000634605,0.00013469452,0.00048452246,0.00013214177,0.00024625374,0.0001587119],"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.000017594948,0.00013623228,0.00079752,0.000108448156,0.00006987962,0.0000013787256,0.00027260013,0.8066125,0.0017063065,0.15952677,0.014725365,0.01602542],"study_design_scores_gemma":[0.0007190371,0.00003597822,0.00041350286,0.00026170316,0.000024396586,0.000035465622,0.00064984814,0.96254444,0.00023202215,0.0023074446,0.032213733,0.0005624086],"about_ca_topic_score_codex":0.0009918888,"about_ca_topic_score_gemma":0.0012054796,"teacher_disagreement_score":0.9871039,"about_ca_system_score_codex":0.0006396704,"about_ca_system_score_gemma":0.00007335053,"threshold_uncertainty_score":0.9999058},"labels":[],"label_agreement":null},{"id":"W4255201967","doi":"10.1109/glocom.2014.7417769","title":"Code-Aided Time Synchronization of Turbo-Coded Square-QAM-Modulated Transmissions: Closed-Form Cramer-Rao Lower Bounds","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Advanced Wireless Communication Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Turbo code; Algorithm; QAM; Quadrature amplitude modulation; Cramér–Rao bound; Computer science; Synchronization (alternating current); Decoding methods; Square (algebra); Mathematics; Theoretical computer science; Estimation theory; Bit error rate; Telecommunications; Channel (broadcasting)","score_opus":0.01886021899995852,"score_gpt":0.2823955449020225,"score_spread":0.26353532590206397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255201967","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.062350325,0.0026290892,0.8704173,0.0027327905,0.00052749197,0.0019651577,0.0007012885,0.0043460154,0.05433055],"genre_scores_gemma":[0.9570505,0.0023272282,0.039567236,0.00010158566,0.000027949265,0.0001508771,0.00053397444,0.000077176366,0.00016346945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969907,0.00039352366,0.0012040839,0.0004059809,0.0004550125,0.00055074523],"domain_scores_gemma":[0.99322224,0.0003116481,0.0003786233,0.0049555907,0.0008773521,0.00025457836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051136495,0.0005309376,0.0007288267,0.00019792632,0.00038783014,0.00012681716,0.0032363744,0.00040327627,0.00027370447],"category_scores_gemma":[0.00019068626,0.0005825476,0.00019655356,0.0010202618,0.00057272357,0.0006976984,0.0003380162,0.0005892105,0.00021886665],"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.0003049681,0.002750198,0.0023532321,0.00086371414,0.00094312354,0.0000039335678,0.00227103,0.046184614,0.06564905,0.13365348,0.04156396,0.70345867],"study_design_scores_gemma":[0.001234376,0.00018732228,0.0014074859,0.00058797386,0.00011177859,0.0000147964865,0.0001121314,0.91918665,0.010642915,0.02060145,0.044849258,0.0010638838],"about_ca_topic_score_codex":0.00016687298,"about_ca_topic_score_gemma":0.00026337118,"teacher_disagreement_score":0.89470017,"about_ca_system_score_codex":0.0004939882,"about_ca_system_score_gemma":0.0001948551,"threshold_uncertainty_score":0.9996626},"labels":[],"label_agreement":null},{"id":"W4255237665","doi":"10.1109/glocom.2014.7417874","title":"Outage Analysis and Power Savings for Independent and Coherent Decode-Forward Relaying","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; National Science Foundation","keywords":"Relay; Rayleigh fading; Channel state information; Computer science; Transmission (telecommunications); Power (physics); Outage probability; Transmitter power output; Channel (broadcasting); Fading; Electronic engineering; Telecommunications; Topology (electrical circuits); Wireless; Electrical engineering; Engineering; Transmitter; Physics","score_opus":0.04587393007878394,"score_gpt":0.32479303406683196,"score_spread":0.27891910398804803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255237665","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.03651142,0.0018519749,0.9467144,0.006349536,0.00017357308,0.00056772033,0.00004193768,0.00020096885,0.007588486],"genre_scores_gemma":[0.9428583,0.002095867,0.054157212,0.00059776346,0.000014224017,0.000107440304,0.000032116317,0.0000096841595,0.00012740558],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997848,0.00044370498,0.00051944377,0.0005537545,0.0002527931,0.0003823136],"domain_scores_gemma":[0.99543005,0.00048394836,0.00027690994,0.003017804,0.0005233434,0.00026792218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010849445,0.00028602112,0.00045414225,0.00017251661,0.0008340347,0.00065492006,0.0026954536,0.0001309195,0.000026467826],"category_scores_gemma":[0.00020427008,0.00028595608,0.00012682173,0.00082620257,0.00026691152,0.00055478927,0.0018349644,0.0002880011,0.000018653363],"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.000025739417,0.00024211495,0.053140525,0.000028649507,0.00054737297,6.4627943e-7,0.0017147167,0.00010391306,0.00038094362,0.72177374,0.0034074378,0.21863419],"study_design_scores_gemma":[0.0018736579,0.0002549295,0.09238088,0.00013226287,0.00042427194,0.000027787753,0.00041858773,0.7871066,0.00011070849,0.014906551,0.101191685,0.0011720934],"about_ca_topic_score_codex":0.00010078822,"about_ca_topic_score_gemma":0.0021568907,"teacher_disagreement_score":0.90634686,"about_ca_system_score_codex":0.00013470958,"about_ca_system_score_gemma":0.00010867884,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W4255846604","doi":"10.1109/glocom.2014.7417261","title":"Context-Aware Support for Geographical Routing Protocols","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Non-line-of-sight propagation; Vehicular ad hoc network; Context (archaeology); Interior gateway protocol; Routing (electronic design automation); Packet forwarding; Link-state routing protocol; Distributed computing; Wireless ad hoc network; Wireless; Telecommunications","score_opus":0.043971332638310996,"score_gpt":0.316984131988215,"score_spread":0.273012799349904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255846604","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.015893774,0.0006136224,0.8691452,0.0042596264,0.00129643,0.030303067,0.0010321338,0.003777392,0.07367875],"genre_scores_gemma":[0.9857003,0.00006787944,0.0067111393,0.00030071344,0.00013586837,0.006653639,0.00029222263,0.00005187767,0.000086371096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976225,0.00021659929,0.00068244437,0.00038515503,0.00029600604,0.00079729164],"domain_scores_gemma":[0.9961719,0.00026253777,0.0001507164,0.0026384902,0.00045798556,0.00031839032],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007868011,0.0004041443,0.00051451556,0.000072630544,0.00038897098,0.00023765407,0.0022055828,0.00030222943,0.00008452541],"category_scores_gemma":[0.00013199022,0.00043905273,0.00022700008,0.0004090065,0.00028157097,0.00028548084,0.00028755024,0.0004906527,0.00012565864],"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.00015309436,0.00083887967,0.022962727,0.0005483461,0.0008336446,0.000005881064,0.00050373137,0.10188623,0.00064822665,0.3913797,0.22035953,0.25987998],"study_design_scores_gemma":[0.00097405916,0.00011032493,0.0012036742,0.00014865327,0.000052351326,0.00002379579,0.000092726565,0.7659695,0.00008311103,0.0023229201,0.22848034,0.0005385472],"about_ca_topic_score_codex":0.00010804323,"about_ca_topic_score_gemma":0.0014691214,"teacher_disagreement_score":0.9698065,"about_ca_system_score_codex":0.00020753847,"about_ca_system_score_gemma":0.00013108255,"threshold_uncertainty_score":0.9998061},"labels":[],"label_agreement":null},{"id":"W4256545494","doi":"10.1109/glocom.2014.7417670","title":"Massive MIMO-Enabled Wireless Backhauls for Full-Duplex Small Cells","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Backhaul (telecommunications); Telecommunications link; MIMO; Computer network; Computer science; Base station; Wireless; Wireless network; Small cell; Duplex (building); Telecommunications","score_opus":0.04298824570705668,"score_gpt":0.27427363253721593,"score_spread":0.23128538683015926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256545494","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.5191069,0.0027215977,0.41496438,0.008961965,0.0027192784,0.0045905956,0.002443478,0.0035312301,0.04096056],"genre_scores_gemma":[0.94819325,0.0013949273,0.04805983,0.00024782366,0.00012345599,0.0008866065,0.00056058995,0.000104528226,0.00042896066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662006,0.0004265823,0.0010437969,0.00057371863,0.00033499984,0.0010008208],"domain_scores_gemma":[0.99090123,0.00090051076,0.00030579884,0.0064738416,0.0009864367,0.0004321772],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00063906773,0.0006837021,0.0007878214,0.00016411711,0.0007384997,0.00036457554,0.005567933,0.0004197057,0.00017458343],"category_scores_gemma":[0.00017485817,0.0007743203,0.0003013791,0.0007550277,0.0005050997,0.00041969743,0.0007103557,0.00067287724,0.00075654814],"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.00017672057,0.0012962921,0.00082591455,0.0006971824,0.0009625288,0.0000031488905,0.0012312559,0.40861815,0.0777571,0.2827736,0.15659498,0.06906311],"study_design_scores_gemma":[0.0012683432,0.00009445564,0.00036171204,0.0001485368,0.00011587403,0.000010541698,0.0003497205,0.890521,0.0022563671,0.00061656523,0.10335087,0.00090604735],"about_ca_topic_score_codex":0.00032887876,"about_ca_topic_score_gemma":0.0035911957,"teacher_disagreement_score":0.4819028,"about_ca_system_score_codex":0.00054184865,"about_ca_system_score_gemma":0.0002589971,"threshold_uncertainty_score":0.9998124},"labels":[],"label_agreement":null},{"id":"W793298464","doi":"10.1109/glocom.2014.7417132","title":"Ultra Low-Complexity Detection of Spectrum Holes in Compressed Wideband Spectrum Sensing","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Undersampling; Compressed sensing; Wideband; Nyquist rate; Cognitive radio; Computer science; Block (permutation group theory); Electronic engineering; Nyquist–Shannon sampling theorem; Signal-to-noise ratio (imaging); Spectrum (functional analysis); Algorithm; Sampling (signal processing); Telecommunications; Mathematics; Wireless; Engineering; Physics; Detector","score_opus":0.04200556769959409,"score_gpt":0.27493841623434945,"score_spread":0.23293284853475535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W793298464","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.6077149,0.0007657054,0.35323298,0.00095156254,0.0005694901,0.0005801312,0.000077986784,0.0011573894,0.034949873],"genre_scores_gemma":[0.9956004,0.00042102105,0.0038265144,0.000045451467,0.00004386387,0.0000070671563,0.000024290144,0.000024815714,0.000006548505],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982917,0.0002561761,0.000565621,0.00027032537,0.0002190596,0.0003971518],"domain_scores_gemma":[0.9975966,0.00014563683,0.00016214412,0.0018615212,0.0001331583,0.000100920704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027097555,0.0002994118,0.00047012017,0.00015128742,0.00014353608,0.000086546876,0.0009569384,0.00016120102,0.000016820393],"category_scores_gemma":[0.000052608077,0.0003390414,0.00009634226,0.00047071403,0.0004637828,0.00020723545,0.00013133437,0.00039299182,0.000029498384],"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.00022966908,0.0010246456,0.01250134,0.00040007682,0.00033573897,0.00001573663,0.0011424284,0.031366304,0.7813586,0.07113939,0.0044714063,0.09601465],"study_design_scores_gemma":[0.0010503395,0.00011587098,0.020890916,0.00078081066,0.000059119193,0.000048642087,0.00019000725,0.47259265,0.42208463,0.07894287,0.0023376124,0.00090650725],"about_ca_topic_score_codex":0.0014257367,"about_ca_topic_score_gemma":0.0074153086,"teacher_disagreement_score":0.44122636,"about_ca_system_score_codex":0.00019666554,"about_ca_system_score_gemma":0.000046168974,"threshold_uncertainty_score":0.9999062},"labels":[],"label_agreement":null}]}