{"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009652952,0.00087880396,0.98584706,0.00021828583,0.00004422704,0.000060674658,0.0000510366,0.000074473835,0.0031724954],"genre_scores_gemma":[0.6850364,0.0019730926,0.30218866,0.00045305715,0.00015619936,0.0006288171,0.00023548651,0.00016153032,0.009166642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990146,0.00050820067,0.00003412988,0.00012512859,0.0002251623,0.00009269522],"domain_scores_gemma":[0.9987587,0.0008657266,0.00013370856,0.000042488256,0.00015682333,0.000042643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020067673,0.0017938294,0.0015429909,0.00066694635,0.00039574906,0.0015887363,0.0010582816,0.0013763969,0.002667794],"category_scores_gemma":[0.0026294421,0.0007226618,0.00064136594,0.0009805434,0.0008548407,0.001210235,0.0010687307,0.001299235,0.00043764093],"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.000024770703,0.00003989621,0.00014055619,0.00010429881,0.00004326565,0.000046014688,0.000023055258,0.981835,0.0007518393,0.0061019063,0.0005177027,0.010371612],"study_design_scores_gemma":[0.0000079997835,0.000022182387,0.00004318505,0.000006228401,0.000005116298,0.000009004353,0.000007645584,0.997384,0.00016860904,0.0019875574,0.00035523003,0.000003161615],"about_ca_topic_score_codex":0.0019622543,"about_ca_topic_score_gemma":0.0015837535,"teacher_disagreement_score":0.002667794,"about_ca_system_score_codex":0.0010083234,"about_ca_system_score_gemma":0.0011042351,"threshold_uncertainty_score":0.010612965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02970328,0.00039353536,0.9681082,0.00010055092,0.000035770398,0.000022812936,0.000029155604,0.0003315607,0.0012751435],"genre_scores_gemma":[0.73174536,0.00043386506,0.26595196,0.0001343162,0.00009309455,0.000073000265,0.000089221314,0.000035826786,0.0014433695],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992436,0.00020257781,0.000030264353,0.0001409901,0.00024435922,0.00013824624],"domain_scores_gemma":[0.9987458,0.00055196095,0.0001874864,0.00018357186,0.0002450363,0.000086150634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051869464,0.00096415763,0.00073760847,0.0004938429,0.00057040324,0.00067385903,0.00073013833,0.00059908803,0.0006617419],"category_scores_gemma":[0.002463615,0.00036659112,0.00043620405,0.0005375945,0.00048436498,0.0010473691,0.0011570802,0.0005172961,0.0003678744],"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.00058813515,0.00013368437,0.0057493593,0.00020171526,0.00013595077,0.00039365608,0.00029375494,0.35449567,0.12069224,0.01217173,0.0017532062,0.5033909],"study_design_scores_gemma":[0.0000352752,0.00042241378,0.0020054649,0.000031696232,0.00007006933,0.00040318884,0.0001418584,0.960363,0.027679149,0.0054618,0.0033344312,0.00005175139],"about_ca_topic_score_codex":0.0013115678,"about_ca_topic_score_gemma":0.0025347641,"teacher_disagreement_score":0.0013115678,"about_ca_system_score_codex":0.00042562667,"about_ca_system_score_gemma":0.0007873163,"threshold_uncertainty_score":0.0030881166},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092152186,0.001324698,0.9026126,0.00031147242,0.000049616494,0.00004129963,0.000071876326,0.0001386022,0.0032976463],"genre_scores_gemma":[0.9535554,0.0008032712,0.042084116,0.00006821996,0.000030936008,0.0000898982,0.00007023824,0.00006006855,0.0032378654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954444,0.00017168105,0.000015966707,0.00008416959,0.000095019655,0.000088799454],"domain_scores_gemma":[0.99904305,0.0006248494,0.0001219297,0.000033809545,0.00013785003,0.000038549606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013009611,0.0012792503,0.0010503272,0.00038523384,0.00030124467,0.0011942402,0.0009329586,0.001148214,0.0008774661],"category_scores_gemma":[0.0024874345,0.00047994,0.00044517152,0.0005486097,0.0007109217,0.0011743858,0.0008621883,0.0006377286,0.00016562309],"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.000042402102,0.000016297188,0.00018690727,0.000050006027,0.00002066194,0.00008327469,0.00003072531,0.98292327,0.003511381,0.0077064442,0.0002681455,0.005160572],"study_design_scores_gemma":[0.000002884452,0.000024795476,0.000041682877,0.00000194927,0.000004401269,0.000010852649,0.00000587605,0.99848723,0.00040243097,0.0009412056,0.00007412756,0.000002596969],"about_ca_topic_score_codex":0.003936471,"about_ca_topic_score_gemma":0.0021153905,"teacher_disagreement_score":0.003936471,"about_ca_system_score_codex":0.0014609304,"about_ca_system_score_gemma":0.0010273184,"threshold_uncertainty_score":0.010599792},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010450199,0.0012947413,0.98441213,0.000117962925,0.000039805254,0.000031807143,0.000056884786,0.00021573709,0.0033806232],"genre_scores_gemma":[0.6784738,0.004393622,0.31127918,0.00021545691,0.00023040103,0.00027035642,0.00033033747,0.00018492245,0.0046219197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832255,0.0004928483,0.00007014516,0.00018357334,0.0007927348,0.00013815924],"domain_scores_gemma":[0.99112284,0.0064307917,0.0006374169,0.00061718497,0.0010903904,0.00010140227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027205416,0.001403417,0.0010408702,0.0010226278,0.00044868948,0.0019695042,0.0011751665,0.0011135119,0.0018054423],"category_scores_gemma":[0.018672472,0.00056571065,0.00060452963,0.0012808827,0.0017082804,0.0021087765,0.0014397495,0.0015015011,0.0008686797],"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.00012568358,0.000042515265,0.00055514305,0.00034191785,0.000056179273,0.00012463774,0.00022025133,0.8189315,0.009110417,0.11166399,0.0013871532,0.057440627],"study_design_scores_gemma":[0.000009733284,0.000043681746,0.0001192511,0.0000381623,0.000012506415,0.00007892856,0.000019376374,0.9818034,0.0041105845,0.012984446,0.0007598764,0.000020056279],"about_ca_topic_score_codex":0.0020037787,"about_ca_topic_score_gemma":0.0025528895,"teacher_disagreement_score":0.0027205416,"about_ca_system_score_codex":0.001135497,"about_ca_system_score_gemma":0.0024886122,"threshold_uncertainty_score":0.014387727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1051309,0.00091544114,0.888506,0.0002441848,0.000029353789,0.00003387415,0.00009270243,0.00016898997,0.0048785564],"genre_scores_gemma":[0.966649,0.00058898464,0.030813798,0.000036959773,0.000025186713,0.000032663484,0.00007637325,0.000016599397,0.0017603933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953234,0.00017989536,0.00001667559,0.000058480837,0.00013844295,0.000074126634],"domain_scores_gemma":[0.9988262,0.0006282799,0.0001700623,0.000103214516,0.0002510404,0.000021316062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061024155,0.0003131623,0.0004666029,0.00051091495,0.0004992575,0.00057639164,0.0005745334,0.00038978737,0.00073800614],"category_scores_gemma":[0.0022380434,0.00017799411,0.00032675057,0.00052887574,0.0005498939,0.0006219104,0.00053558935,0.00027377022,0.00018303224],"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.00007329069,0.00003477885,0.0022808115,0.000110258065,0.000039186758,0.00044720812,0.00022973421,0.8726676,0.009033767,0.07215986,0.0013029035,0.041620728],"study_design_scores_gemma":[0.0000038263797,0.000058054513,0.00047589152,0.000008733172,0.000016126169,0.00018694047,0.000066115965,0.98420864,0.0018804964,0.011654996,0.0014245077,0.000015718286],"about_ca_topic_score_codex":0.003729932,"about_ca_topic_score_gemma":0.0044188756,"teacher_disagreement_score":0.003729932,"about_ca_system_score_codex":0.0009470549,"about_ca_system_score_gemma":0.0007082701,"threshold_uncertainty_score":0.0074164867},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16606647,0.0017052226,0.82930446,0.00018693616,0.00018855439,0.00012070541,0.00005502243,0.00047335302,0.0018992064],"genre_scores_gemma":[0.94046855,0.00034765174,0.058436435,0.000046289246,0.00004874244,0.000044817178,0.000058323432,0.000013557934,0.00053564174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994789,0.00013136219,0.00005851977,0.000075229495,0.00018033304,0.000075625416],"domain_scores_gemma":[0.9989919,0.000345692,0.00018529652,0.00013946743,0.00028167982,0.000055998928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095576386,0.00047292115,0.0004588477,0.0007963895,0.0007082489,0.00056705077,0.0010365379,0.0003895134,0.00025035284],"category_scores_gemma":[0.0026076746,0.00017070147,0.00021504085,0.0007190072,0.00040833457,0.0009501472,0.00056083075,0.00036346115,0.00007921657],"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.00063519645,0.00018390652,0.004895676,0.00021708742,0.0000921119,0.0005749614,0.0007060118,0.5351557,0.095309235,0.032019787,0.002511884,0.3276984],"study_design_scores_gemma":[0.00002931137,0.00028381703,0.0013008424,0.000020196752,0.00005488052,0.00026948322,0.0000845074,0.9750074,0.013475846,0.005709625,0.0037115873,0.00005250187],"about_ca_topic_score_codex":0.003716491,"about_ca_topic_score_gemma":0.0034595435,"teacher_disagreement_score":0.003716491,"about_ca_system_score_codex":0.000996244,"about_ca_system_score_gemma":0.00051305175,"threshold_uncertainty_score":0.0073897243},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013782094,0.00037849942,0.9829928,0.0004439677,0.000029837309,0.000033076125,0.000028056756,0.00005469383,0.0022570333],"genre_scores_gemma":[0.7917797,0.001989173,0.19977988,0.00026571736,0.00012891562,0.00031395568,0.00015348608,0.00009726524,0.0054919133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996526,0.00012345648,0.000017377666,0.00006304879,0.00011734318,0.000026139838],"domain_scores_gemma":[0.9990596,0.0004810977,0.00016218732,0.00009595078,0.00014664496,0.000054556833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006987319,0.00068105326,0.00059801555,0.00077088067,0.0005428952,0.0010474798,0.0014865092,0.0010260732,0.0008649741],"category_scores_gemma":[0.0023785469,0.0003093775,0.0007885702,0.00075726333,0.0009104164,0.0022277473,0.0010449393,0.0010404771,0.00016265154],"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.0000101444775,0.000019884097,0.0004034473,0.000038295955,0.000022310667,0.000058115307,0.000077885175,0.9152393,0.0012058744,0.07385947,0.00035434272,0.008711084],"study_design_scores_gemma":[0.0000021062672,0.00000811093,0.000052224987,0.0000031578916,0.0000045080274,0.000020012027,0.000013236506,0.9800764,0.00018201733,0.019043967,0.000589946,0.0000043221835],"about_ca_topic_score_codex":0.0018488027,"about_ca_topic_score_gemma":0.001402974,"teacher_disagreement_score":0.0018488027,"about_ca_system_score_codex":0.00122523,"about_ca_system_score_gemma":0.0005526272,"threshold_uncertainty_score":0.008889735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021413384,0.0003234538,0.9759989,0.000071257426,0.000038667724,0.000040398445,0.000037180074,0.00034462064,0.0017321039],"genre_scores_gemma":[0.64827734,0.00045167728,0.3481517,0.000052581265,0.000055639353,0.00017122754,0.00012275828,0.00016133825,0.00255567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999607,0.00013015242,0.0000135033815,0.00007744544,0.00009408051,0.00007785021],"domain_scores_gemma":[0.9996226,0.00020971727,0.00005220579,0.000028448563,0.00006318931,0.000023881159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079039147,0.0012390357,0.0011273066,0.00078540243,0.00051779265,0.00071756775,0.0006319682,0.00048717606,0.0013872967],"category_scores_gemma":[0.0013540701,0.0003291524,0.0005701765,0.0008072936,0.00043683383,0.0009537098,0.00081126625,0.0006365269,0.00013169844],"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.000032506636,0.000013792256,0.00019750495,0.000021926377,0.000019014064,0.000016080307,0.000013833276,0.96714205,0.0016929371,0.0033258,0.00040970778,0.0271149],"study_design_scores_gemma":[0.0000056142376,0.000032629796,0.0000623966,0.0000025106795,0.000008589542,0.0000128865,0.000005536218,0.9962263,0.000661623,0.0024969534,0.00047975508,0.0000052424252],"about_ca_topic_score_codex":0.002637242,"about_ca_topic_score_gemma":0.0026775238,"teacher_disagreement_score":0.002637242,"about_ca_system_score_codex":0.0009410613,"about_ca_system_score_gemma":0.0010672798,"threshold_uncertainty_score":0.0068279505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16327801,0.0009345644,0.82774544,0.00026814855,0.00015002373,0.0002542312,0.00006325455,0.005683466,0.0016228862],"genre_scores_gemma":[0.94462144,0.00011762517,0.054612815,0.00009893336,0.00006798571,0.00009243694,0.000038381066,0.00010254236,0.00024775704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772793,0.0008049715,0.00016753376,0.0005150712,0.00046490267,0.00031952385],"domain_scores_gemma":[0.9850973,0.0073148664,0.0034303893,0.0020568275,0.0015055479,0.0005949105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037604386,0.0013793127,0.0011768584,0.0014144435,0.00088208803,0.0012375336,0.0020891787,0.00068020873,0.00066101516],"category_scores_gemma":[0.01759626,0.00041435167,0.00046400202,0.00068035815,0.00085119327,0.0016536469,0.0011768821,0.0011704905,0.00026935665],"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.0023582038,0.0013232703,0.015019019,0.00035469516,0.00030881248,0.00029072977,0.00047588395,0.5367885,0.1357699,0.009934457,0.0029096073,0.29446694],"study_design_scores_gemma":[0.00011803829,0.0005256161,0.0015095742,0.000017807064,0.00009362643,0.00019307231,0.00005099477,0.9656164,0.028336762,0.0021773991,0.0013072607,0.00005339285],"about_ca_topic_score_codex":0.0010959014,"about_ca_topic_score_gemma":0.0011252022,"teacher_disagreement_score":0.0037604386,"about_ca_system_score_codex":0.0010231375,"about_ca_system_score_gemma":0.00158699,"threshold_uncertainty_score":0.019887328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012601341,0.00036708047,0.9812981,0.00021521386,0.000041674502,0.000025180143,0.000078287834,0.000064179854,0.005308892],"genre_scores_gemma":[0.38787302,0.0014564148,0.60622245,0.00016356254,0.00012982059,0.00015430727,0.00039533185,0.00009859028,0.003506574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994307,0.00020583042,0.00003702682,0.00006816804,0.000217828,0.000040426763],"domain_scores_gemma":[0.9989104,0.00038386186,0.00019727636,0.00027157285,0.00019711934,0.000039711704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060660735,0.0005102348,0.00045502864,0.00056849,0.00032044185,0.0008269377,0.000369061,0.0005521728,0.0022021038],"category_scores_gemma":[0.0038511904,0.00021794096,0.00030656002,0.0010377043,0.00087305444,0.0008193526,0.0008257248,0.00094068743,0.0008260935],"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.00012915822,0.000024836314,0.0005119216,0.00013579211,0.000023556051,0.00012342712,0.0001294591,0.4374768,0.01759088,0.46072206,0.0024094714,0.08072255],"study_design_scores_gemma":[0.000018924862,0.000049146376,0.00026215336,0.00003737109,0.000007870863,0.00016758323,0.000025161455,0.85351795,0.004898317,0.13199428,0.008998153,0.000023121356],"about_ca_topic_score_codex":0.00034496238,"about_ca_topic_score_gemma":0.00043495483,"teacher_disagreement_score":0.0022021038,"about_ca_system_score_codex":0.00053110096,"about_ca_system_score_gemma":0.00050355704,"threshold_uncertainty_score":0.007366717},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7816462,0.0010001415,0.2073138,0.00033781747,0.000091000846,0.00004193033,0.00020182758,0.00023658451,0.009130668],"genre_scores_gemma":[0.9952756,0.00012043683,0.0041828514,0.00003277547,0.000011219819,0.000010551047,0.0000507198,0.0000076025926,0.00030821477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999268,0.0003643573,0.00002382627,0.00007600536,0.000099628174,0.00016820748],"domain_scores_gemma":[0.9971795,0.0017596058,0.00031230418,0.00016975634,0.0004353602,0.00014351415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015769611,0.0007007258,0.0006848955,0.00040748884,0.0005145344,0.0008421302,0.000447386,0.00066446787,0.00072419265],"category_scores_gemma":[0.0039289603,0.000258523,0.00025726802,0.0007094848,0.0007452296,0.000801491,0.00092653226,0.00035894223,0.00013430559],"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.00017940826,0.000040129748,0.001821618,0.000027847396,0.000026058071,0.00009714517,0.000031128624,0.98686856,0.0032637704,0.002930605,0.00027220673,0.004441393],"study_design_scores_gemma":[0.000005654851,0.000065413034,0.0004854705,0.0000017625142,0.000006591215,0.000030052814,0.000025276662,0.9978295,0.000826562,0.00065966486,0.000057722453,0.0000063397915],"about_ca_topic_score_codex":0.0047353376,"about_ca_topic_score_gemma":0.0040752357,"teacher_disagreement_score":0.0047353376,"about_ca_system_score_codex":0.00088674476,"about_ca_system_score_gemma":0.00073429605,"threshold_uncertainty_score":0.009415567},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16103305,0.0011676904,0.83061665,0.00042520263,0.00012021463,0.0001773001,0.000106221654,0.00038568358,0.0059679104],"genre_scores_gemma":[0.97709346,0.00016912568,0.022108031,0.00005509316,0.000019906476,0.000036461377,0.000022505208,0.000008982534,0.00048647122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996753,0.000082102284,0.000010605878,0.000043112428,0.00007306557,0.00011587015],"domain_scores_gemma":[0.99938655,0.00023901118,0.000111020214,0.00006438643,0.00011051664,0.000088493696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005879074,0.0004061948,0.00052082003,0.00029576023,0.0007207055,0.0008665357,0.001025506,0.00036897283,0.0008739362],"category_scores_gemma":[0.0010472429,0.00014453854,0.00017187791,0.00063072896,0.0005137087,0.0007233501,0.00094236806,0.00044118415,0.00012235646],"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.00020764713,0.00011589941,0.0011887605,0.000041752126,0.00002781636,0.00017099314,0.000060679264,0.9321391,0.0076089306,0.009107931,0.00181234,0.047518134],"study_design_scores_gemma":[0.0000056536687,0.000014806617,0.00011766677,0.0000013716501,0.0000021018664,0.000010962003,0.000011674045,0.99795973,0.0005154209,0.0011404319,0.0002171072,0.0000030455599],"about_ca_topic_score_codex":0.008352619,"about_ca_topic_score_gemma":0.00966373,"teacher_disagreement_score":0.008352619,"about_ca_system_score_codex":0.001015823,"about_ca_system_score_gemma":0.0010207255,"threshold_uncertainty_score":0.016608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07390517,0.00065634825,0.8971415,0.0006310466,0.00016599522,0.00043388733,0.00037790876,0.010598412,0.016089607],"genre_scores_gemma":[0.5626863,0.00037158545,0.42633104,0.00032473097,0.00006128866,0.00022842057,0.000978848,0.0001596667,0.008858077],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993098,0.00012689871,0.00008897185,0.00013137981,0.00024268834,0.00010026622],"domain_scores_gemma":[0.99897397,0.0001324876,0.000064628264,0.00036449687,0.0003044942,0.00015988144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000780189,0.0002916797,0.00034362727,0.0009765518,0.001024956,0.0018473363,0.0016056601,0.00092623295,0.0019458308],"category_scores_gemma":[0.0013650267,0.00027134598,0.0004181901,0.0011945805,0.00056886504,0.0016850171,0.00203837,0.0009490914,0.0012135082],"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.0012075572,0.0006649871,0.007291891,0.00063358573,0.00018254665,0.0014022905,0.0015774483,0.12292286,0.11937532,0.16999051,0.031479895,0.54327106],"study_design_scores_gemma":[0.00015694606,0.00039931005,0.0033682443,0.00007080701,0.00013103434,0.00084464706,0.00045147777,0.8246488,0.03281011,0.043648683,0.093324505,0.00014549786],"about_ca_topic_score_codex":0.00690427,"about_ca_topic_score_gemma":0.00620769,"teacher_disagreement_score":0.00690427,"about_ca_system_score_codex":0.0011274499,"about_ca_system_score_gemma":0.0016894484,"threshold_uncertainty_score":0.013728201},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037807445,0.00030795534,0.99422354,0.00020956075,0.000027967026,0.000027339604,0.0000127126905,0.000095336094,0.0013148277],"genre_scores_gemma":[0.88947684,0.0007084101,0.10650943,0.00017623785,0.00017209885,0.00023863841,0.000066422566,0.00009735359,0.002554596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.0006591557,0.0000523013,0.0002816434,0.00032968516,0.00021446704],"domain_scores_gemma":[0.99858725,0.0008454805,0.00024554078,0.00006358117,0.00018556922,0.00007249504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002451796,0.0017204464,0.0016486124,0.0007420446,0.00048866414,0.0017977718,0.0014863833,0.001419495,0.0012475799],"category_scores_gemma":[0.0038091163,0.0006180359,0.00092804746,0.0006567298,0.0013856917,0.0012761932,0.0018447249,0.0018185334,0.00019597214],"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.00003773009,0.00002346735,0.00011582838,0.0000337819,0.00003520697,0.00003703577,0.000021941962,0.9770608,0.0009797516,0.012875522,0.0004100223,0.008368935],"study_design_scores_gemma":[0.000002626768,0.0000074477175,0.000015010451,0.0000017054508,0.0000027665967,0.0000033619503,0.0000021407777,0.9984296,0.000096824726,0.001357155,0.00007876961,0.0000025948584],"about_ca_topic_score_codex":0.005647063,"about_ca_topic_score_gemma":0.0025361618,"teacher_disagreement_score":0.005647063,"about_ca_system_score_codex":0.0018041538,"about_ca_system_score_gemma":0.0020108484,"threshold_uncertainty_score":0.013090134},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24063604,0.0009872329,0.7427934,0.00033967927,0.000054508655,0.000057102196,0.000053057705,0.0003237157,0.014755332],"genre_scores_gemma":[0.9845819,0.00024270524,0.014601789,0.00003506097,0.000023296601,0.00001754553,0.000007851262,0.0000106695525,0.00047920085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922526,0.00029784444,0.000019401996,0.00009608995,0.00018885963,0.00017261274],"domain_scores_gemma":[0.9983777,0.0011645225,0.000141886,0.000086259846,0.00017791925,0.000051719326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841898,0.0016877892,0.0010301224,0.0004934262,0.00048653802,0.001336469,0.0009845603,0.0010429125,0.0007756659],"category_scores_gemma":[0.0046598604,0.0002570101,0.0003676232,0.0005087696,0.00091945817,0.0012348507,0.0012393827,0.0006293278,0.00021098323],"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.00034586756,0.00015241915,0.0005920628,0.00014904165,0.00007093051,0.00033523788,0.00015274726,0.92863,0.020433431,0.014434244,0.0004348212,0.03426925],"study_design_scores_gemma":[0.000023487106,0.00021657786,0.00024257653,0.000008448305,0.000035216955,0.00012375743,0.00004424257,0.98491967,0.0061735576,0.007924805,0.0002727556,0.000014870712],"about_ca_topic_score_codex":0.0011960235,"about_ca_topic_score_gemma":0.0012738112,"teacher_disagreement_score":0.0016877892,"about_ca_system_score_codex":0.00062117167,"about_ca_system_score_gemma":0.00077027007,"threshold_uncertainty_score":0.0089069605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035516605,0.00021138662,0.96195924,0.00015544484,0.000051570256,0.000058911144,0.000017751232,0.0006244326,0.0014046333],"genre_scores_gemma":[0.90879476,0.000089284425,0.08951097,0.00008732286,0.000044500517,0.00007043425,0.00002503677,0.000017949253,0.0013597518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993975,0.00013005195,0.00004506106,0.00017875987,0.00017126795,0.00007729338],"domain_scores_gemma":[0.999137,0.00024338708,0.00017915355,0.00016081352,0.00021798443,0.00006177851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011292369,0.00040528717,0.0005820348,0.0004184896,0.00047575927,0.0005693742,0.0018025057,0.000708761,0.0008498305],"category_scores_gemma":[0.002523315,0.00016710293,0.00031116328,0.00033348377,0.0006262694,0.00080485444,0.0008644039,0.0006744813,0.000226683],"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.0003546876,0.00026225214,0.0013303063,0.00011031744,0.0000824857,0.00017905298,0.00020987708,0.60613275,0.03252512,0.03148443,0.0022549701,0.32507372],"study_design_scores_gemma":[0.000017257144,0.00009065738,0.00015442134,0.0000033524666,0.000008125099,0.00007432841,0.000008294033,0.9918148,0.0030373314,0.0040126396,0.00076522375,0.000013545299],"about_ca_topic_score_codex":0.001335738,"about_ca_topic_score_gemma":0.0013836214,"teacher_disagreement_score":0.0018025057,"about_ca_system_score_codex":0.00057416473,"about_ca_system_score_gemma":0.00076219183,"threshold_uncertainty_score":0.0059720874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24500306,0.00083121605,0.74342513,0.0002118065,0.00007593626,0.0000455799,0.00013365898,0.00022675029,0.010046819],"genre_scores_gemma":[0.9904169,0.00022245306,0.008047923,0.000034751545,0.00001636846,0.000019264151,0.000019017052,0.0000058799646,0.0012174499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997731,0.0000652362,0.000004950157,0.000031305386,0.00006975533,0.000055629396],"domain_scores_gemma":[0.9994438,0.00028359337,0.00010370708,0.00004759472,0.00007867123,0.000042741656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003785574,0.0003358177,0.0003735926,0.00023576934,0.00031810903,0.00055031077,0.00051992893,0.00040699576,0.000988903],"category_scores_gemma":[0.0008673965,0.00023423762,0.00037966986,0.00032205615,0.00061799557,0.0006550767,0.0004613052,0.00042087582,0.00018318483],"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.000046059486,0.000025800982,0.0010034345,0.00004241495,0.000019767494,0.00020813101,0.000065640146,0.9641773,0.008823233,0.01879646,0.00034393472,0.0064477273],"study_design_scores_gemma":[0.0000021089363,0.000027667,0.0003044115,0.0000021713086,0.0000042061815,0.00003796207,0.000011934364,0.996829,0.0005740441,0.002053983,0.00014893967,0.0000036566703],"about_ca_topic_score_codex":0.0026151303,"about_ca_topic_score_gemma":0.0026221953,"teacher_disagreement_score":0.0026151303,"about_ca_system_score_codex":0.0008941192,"about_ca_system_score_gemma":0.00028377862,"threshold_uncertainty_score":0.00648731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4344676,0.0011262369,0.54970497,0.00096556335,0.000117427604,0.0004431456,0.00015525964,0.001284041,0.0117357625],"genre_scores_gemma":[0.86029273,0.0002957933,0.13703658,0.00007158338,0.000032618726,0.0001498105,0.00014467053,0.00011026692,0.0018659862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947304,0.00013443157,0.000029886862,0.00007454062,0.00014777477,0.00014038563],"domain_scores_gemma":[0.9990939,0.0003881401,0.00012912278,0.000066490924,0.00021947898,0.000102848695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005647345,0.001046468,0.0010036052,0.0008796825,0.000738279,0.0011790089,0.0011713443,0.0007321708,0.001263501],"category_scores_gemma":[0.002502662,0.00040815127,0.00038371806,0.0008978259,0.0002774664,0.0009865514,0.0006114976,0.00048306404,0.00025037242],"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.0002893868,0.00017834097,0.0024736791,0.00019517782,0.000037653725,0.00021727134,0.000059707752,0.87547135,0.013776504,0.004597527,0.0025537286,0.10014979],"study_design_scores_gemma":[0.000009267278,0.000044207747,0.00050580595,0.0000048011884,0.000011683318,0.000044324173,0.000029726587,0.9967237,0.0017067883,0.0006604412,0.00025526414,0.0000040571854],"about_ca_topic_score_codex":0.0052559236,"about_ca_topic_score_gemma":0.0052387896,"teacher_disagreement_score":0.0052559236,"about_ca_system_score_codex":0.0014464615,"about_ca_system_score_gemma":0.0018482739,"threshold_uncertainty_score":0.010494828},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44819793,0.001301767,0.5456284,0.00026435172,0.00009811994,0.00007008479,0.000020241072,0.00024820358,0.004170935],"genre_scores_gemma":[0.9910823,0.00015547972,0.00827279,0.00004718654,0.000018985145,0.000024439209,0.0000041642033,0.000006526156,0.00038807502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667954,0.0010953823,0.000102651844,0.00041730722,0.00091030437,0.00079480966],"domain_scores_gemma":[0.9838108,0.0123079065,0.0013693271,0.00091403106,0.0012733343,0.00032470629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044037616,0.0015402393,0.0010110139,0.0007774378,0.00090410124,0.0014347355,0.0021017303,0.0014561289,0.0005179481],"category_scores_gemma":[0.012734825,0.00051059166,0.0006704777,0.0009851106,0.0023511013,0.0025704745,0.0027705743,0.0009749909,0.00013699154],"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.00068238704,0.00025969374,0.0030293406,0.00013896095,0.00021395892,0.00062156847,0.0004599315,0.93170315,0.007618994,0.015430701,0.0003193036,0.03952194],"study_design_scores_gemma":[0.000017489623,0.00018581997,0.00037108746,0.0000068970935,0.000047686033,0.0001698584,0.00009150668,0.99247015,0.0020560112,0.0043893643,0.00017587714,0.00001830837],"about_ca_topic_score_codex":0.0044166693,"about_ca_topic_score_gemma":0.003894569,"teacher_disagreement_score":0.0044166693,"about_ca_system_score_codex":0.001098829,"about_ca_system_score_gemma":0.000944908,"threshold_uncertainty_score":0.023289561},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048075967,0.00052644796,0.9464667,0.00023114697,0.00015448763,0.00015883363,0.00007857123,0.0023773287,0.0019306102],"genre_scores_gemma":[0.862301,0.00020605563,0.13442913,0.0001809265,0.00019821053,0.00017024795,0.00017724677,0.00005701368,0.0022803277],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989465,0.00019082878,0.000076696095,0.00028351523,0.00042490964,0.000077580335],"domain_scores_gemma":[0.9982344,0.00048267882,0.00026762733,0.0003872952,0.00047145892,0.00015647738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012142955,0.00055540475,0.00058988703,0.0009544603,0.0011953122,0.0010069185,0.0013012604,0.0007944949,0.00089040236],"category_scores_gemma":[0.0033874272,0.00024636413,0.0002874246,0.0007435767,0.00040981037,0.0013601973,0.0012431281,0.0008879284,0.00036377888],"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.0014479217,0.00050409656,0.008653665,0.00020155143,0.00012927358,0.00090495066,0.0007645137,0.03765379,0.19611622,0.045027215,0.0089438,0.699653],"study_design_scores_gemma":[0.00012185158,0.0004411234,0.0033498374,0.000022628885,0.000108531465,0.0012787187,0.00015288992,0.87664115,0.08173268,0.01312061,0.022944685,0.00008531684],"about_ca_topic_score_codex":0.00083148817,"about_ca_topic_score_gemma":0.00063583994,"teacher_disagreement_score":0.0013012604,"about_ca_system_score_codex":0.0006618006,"about_ca_system_score_gemma":0.00044363507,"threshold_uncertainty_score":0.006421864},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014843024,0.00037990112,0.98303235,0.00008181051,0.000066560206,0.00001998824,0.000020796613,0.00022793512,0.0013276897],"genre_scores_gemma":[0.6467606,0.0007337963,0.34672138,0.00017351242,0.000102026046,0.000051966977,0.0001110238,0.000048003516,0.0052978015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00014779886,0.000053837302,0.00011374,0.00023545124,0.00007055148],"domain_scores_gemma":[0.9992342,0.0002408031,0.0000783839,0.00014482586,0.0002730229,0.000028796605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065626745,0.00058305834,0.00069634477,0.00038731933,0.0004875628,0.0006059919,0.0006285899,0.00063623884,0.0009922269],"category_scores_gemma":[0.001931073,0.00029698372,0.00051847193,0.00042067506,0.0007363222,0.0010084804,0.00056914194,0.0007370998,0.00045213307],"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.00056195806,0.00010816288,0.0025089444,0.00044270844,0.00020277196,0.00072549045,0.000415096,0.4997852,0.11522459,0.05340346,0.0031945992,0.32342696],"study_design_scores_gemma":[0.000011942992,0.00009742554,0.00024206181,0.000013133822,0.000023857721,0.00019901458,0.000018214329,0.97780013,0.0175681,0.002596901,0.0014020525,0.00002714222],"about_ca_topic_score_codex":0.001445976,"about_ca_topic_score_gemma":0.0021133157,"teacher_disagreement_score":0.001445976,"about_ca_system_score_codex":0.00031644144,"about_ca_system_score_gemma":0.0008145498,"threshold_uncertainty_score":0.0034706593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028698774,0.00026580997,0.9652586,0.00018707829,0.000029341962,0.000039492963,0.000035892557,0.00012988166,0.005355088],"genre_scores_gemma":[0.9224811,0.00030862208,0.07395409,0.00009540082,0.000034899345,0.000091992,0.000038008526,0.00003561667,0.0029603953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962234,0.00014575408,0.00001555606,0.00006995852,0.00008155255,0.000064854015],"domain_scores_gemma":[0.9995865,0.00027978007,0.00004768885,0.000023566707,0.00004501185,0.000017439786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006616602,0.0006555292,0.0006655986,0.00026550962,0.00026704147,0.0009836765,0.0005228013,0.00055982434,0.001930724],"category_scores_gemma":[0.0014859162,0.00040330022,0.0003107512,0.0005256312,0.0006562812,0.00066060957,0.00072087446,0.0005331839,0.00030496315],"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.00009010379,0.00005412545,0.00023522931,0.000080626065,0.000020238012,0.00006543978,0.00006763378,0.93416643,0.0047522453,0.027636224,0.0007983622,0.032033335],"study_design_scores_gemma":[0.000009011073,0.000019140278,0.000037124824,0.0000026645905,0.0000027653716,0.000009610148,0.000008474078,0.99401045,0.0004027249,0.0053196405,0.00017574219,0.0000026288446],"about_ca_topic_score_codex":0.0011311738,"about_ca_topic_score_gemma":0.0012075008,"teacher_disagreement_score":0.001930724,"about_ca_system_score_codex":0.000695644,"about_ca_system_score_gemma":0.00068358873,"threshold_uncertainty_score":0.0064588785},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01586824,0.00051247043,0.9818625,0.00017586848,0.00013021339,0.000060915172,0.000021731765,0.00043394323,0.00093403406],"genre_scores_gemma":[0.47981745,0.0010435373,0.5162317,0.00017639594,0.00019111906,0.00021190094,0.000121005054,0.00007410179,0.0021328223],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996202,0.00007892208,0.000030269985,0.000048795147,0.00019127224,0.000030503206],"domain_scores_gemma":[0.999605,0.00017886863,0.000053020252,0.00003625442,0.00009921872,0.00002759996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007039245,0.000561993,0.00047583936,0.00047163854,0.0005360035,0.0005521544,0.0009146337,0.0005039921,0.00045901988],"category_scores_gemma":[0.0021011692,0.00023588356,0.00028805062,0.00057541847,0.00036919556,0.0009059656,0.000604669,0.00073212996,0.00011564642],"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.00027696858,0.00016513428,0.0007605578,0.00015944865,0.000054561133,0.0001277738,0.00020787894,0.45728683,0.03792537,0.027349222,0.0039485362,0.4717377],"study_design_scores_gemma":[0.000012788664,0.000059120764,0.00008550762,0.000004298972,0.0000071550216,0.00003534446,0.000007373991,0.99250305,0.0026332564,0.0035094034,0.0011369578,0.000005713698],"about_ca_topic_score_codex":0.0016691072,"about_ca_topic_score_gemma":0.0016367369,"teacher_disagreement_score":0.0016691072,"about_ca_system_score_codex":0.00049937796,"about_ca_system_score_gemma":0.0010616053,"threshold_uncertainty_score":0.003722787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010504079,0.0004921654,0.9871991,0.00010809964,0.000033326847,0.000029776005,0.000012901209,0.00004490896,0.0015756772],"genre_scores_gemma":[0.7559894,0.0010384899,0.24092351,0.00011032313,0.000078630605,0.00014113344,0.000059628263,0.000021990554,0.0016367573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916244,0.00032231028,0.000035130568,0.0000849981,0.00033408383,0.00006103011],"domain_scores_gemma":[0.99885654,0.0005014974,0.00015172028,0.00014161196,0.00031748824,0.00003119605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071324187,0.00078136235,0.0004927041,0.00044850173,0.00038442234,0.0006165504,0.00091195403,0.00072425365,0.00058071513],"category_scores_gemma":[0.0020853668,0.00020392842,0.0003120655,0.00073706853,0.00080271444,0.0007719583,0.00069490285,0.0007415398,0.0002432971],"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.0001491501,0.00007459045,0.0007751658,0.00021728546,0.000059692167,0.00027546336,0.00024225457,0.70017415,0.040950686,0.14794232,0.0010195369,0.10811977],"study_design_scores_gemma":[0.000013221584,0.00008582891,0.00006746021,0.000014643964,0.000013647073,0.00010156747,0.000015274321,0.98384964,0.0041881283,0.010338031,0.0012996625,0.00001291995],"about_ca_topic_score_codex":0.0010540416,"about_ca_topic_score_gemma":0.002049215,"teacher_disagreement_score":0.0010540416,"about_ca_system_score_codex":0.00087259867,"about_ca_system_score_gemma":0.00088089326,"threshold_uncertainty_score":0.0063311458},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06107696,0.0016439691,0.92280656,0.0010536333,0.00015334316,0.00009810415,0.000104818566,0.00021101281,0.012851608],"genre_scores_gemma":[0.9384782,0.0011897095,0.0562721,0.00022811617,0.00017833589,0.000076782104,0.000050627477,0.0000786528,0.003447488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980122,0.00062982703,0.000041903444,0.00026697284,0.00037634812,0.0006728366],"domain_scores_gemma":[0.9966853,0.0020014565,0.0002431256,0.00042235138,0.00046957767,0.00017822173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015664726,0.0010620296,0.0012248683,0.0007915372,0.0014511136,0.0018225039,0.0014307778,0.0009084247,0.0033432757],"category_scores_gemma":[0.0068359165,0.00036263984,0.00069030037,0.0017030742,0.0014147649,0.0025053762,0.0023407068,0.001048732,0.00047111305],"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.000614103,0.00015697836,0.0020663042,0.0002375229,0.000085285974,0.00043902113,0.00023897499,0.69290626,0.0077893576,0.18011135,0.007313078,0.108041815],"study_design_scores_gemma":[0.000023304268,0.000051122504,0.00022819624,0.000020554397,0.000023889948,0.0001181089,0.00009451281,0.96561384,0.002082788,0.030069333,0.0016577337,0.000016670874],"about_ca_topic_score_codex":0.007472057,"about_ca_topic_score_gemma":0.0061863433,"teacher_disagreement_score":0.007472057,"about_ca_system_score_codex":0.0019557618,"about_ca_system_score_gemma":0.0024962255,"threshold_uncertainty_score":0.014857173},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039585135,0.00032293197,0.9937937,0.000114331604,0.00003406568,0.000018489423,0.00002362277,0.000029047915,0.0017053671],"genre_scores_gemma":[0.4940271,0.0013024813,0.49769768,0.0002890888,0.00011515153,0.00038057327,0.0001938576,0.000091705915,0.005902338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961567,0.00018830204,0.000012413222,0.000046570567,0.0000843005,0.0000527612],"domain_scores_gemma":[0.99959415,0.00025627043,0.000034375204,0.000024223093,0.00006220468,0.000028835897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011058858,0.0012003096,0.001012654,0.0005932664,0.00038040458,0.0009463693,0.00067666266,0.00085007225,0.0021784552],"category_scores_gemma":[0.0014949057,0.00037965554,0.00058482273,0.0008983116,0.00066635926,0.00084170664,0.0012646731,0.0011358324,0.00038367655],"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.00007412014,0.00005311271,0.00036127682,0.00011336872,0.00004578344,0.00007482625,0.00004603699,0.9120848,0.0023293109,0.050468177,0.0022709128,0.03207822],"study_design_scores_gemma":[0.000006308314,0.000009967149,0.000021225485,0.0000039110428,0.0000028103314,0.000010692119,0.000006124318,0.9943904,0.00017058972,0.0048965374,0.00047887026,0.0000025684099],"about_ca_topic_score_codex":0.0017835542,"about_ca_topic_score_gemma":0.0013020185,"teacher_disagreement_score":0.0021784552,"about_ca_system_score_codex":0.000830464,"about_ca_system_score_gemma":0.00091897475,"threshold_uncertainty_score":0.007287681},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03521545,0.0009010015,0.9566635,0.00058594433,0.0000807374,0.000116088806,0.000078725556,0.00008824449,0.0062703863],"genre_scores_gemma":[0.8150052,0.0013687551,0.17775646,0.00033182144,0.00015784602,0.00031138732,0.00011510909,0.00010760252,0.0048457216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994671,0.0002463952,0.0000137817615,0.00007314752,0.000100543235,0.000098964454],"domain_scores_gemma":[0.9990728,0.00068703346,0.00006962449,0.000031456104,0.000094326344,0.00004468896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013333529,0.0012133585,0.0010851383,0.00043510375,0.00049153395,0.0013282703,0.0009270112,0.0010459227,0.0021764848],"category_scores_gemma":[0.002720654,0.0003350938,0.0006525089,0.0008173306,0.001065632,0.000804716,0.0011131873,0.0010929519,0.00024209938],"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.000040500046,0.00003747668,0.00024886776,0.000053740183,0.000015973177,0.00008012229,0.000025750687,0.98457146,0.00084159407,0.007888403,0.0005517127,0.005644317],"study_design_scores_gemma":[0.0000036303245,0.000012482152,0.000034216642,0.0000029590199,0.0000026906132,0.000006009914,0.0000069160033,0.9985738,0.00011609635,0.0011340902,0.00010574877,0.0000014339786],"about_ca_topic_score_codex":0.008541188,"about_ca_topic_score_gemma":0.006141479,"teacher_disagreement_score":0.008541188,"about_ca_system_score_codex":0.0010688219,"about_ca_system_score_gemma":0.0014940241,"threshold_uncertainty_score":0.016982973},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09302072,0.00077207177,0.8901888,0.001212367,0.00026386537,0.00078946486,0.0004472395,0.0017387012,0.011566696],"genre_scores_gemma":[0.9504699,0.00030943565,0.04265524,0.00018700614,0.00009213903,0.0002866368,0.00030478157,0.00003657879,0.005658315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962327,0.0011013432,0.00032692446,0.0005013458,0.0012322137,0.0006054699],"domain_scores_gemma":[0.9961385,0.0008685412,0.0005753312,0.0016348293,0.0004907052,0.0002921011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018861882,0.00067148515,0.0011488124,0.001122097,0.0022654135,0.0019287888,0.0017031496,0.0020118407,0.004117587],"category_scores_gemma":[0.004493625,0.00033365964,0.00080119976,0.0015355897,0.0014679646,0.0054404438,0.0051524104,0.001997108,0.0011947214],"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.002448138,0.0005879315,0.004738518,0.0007850016,0.00023508133,0.0021122715,0.0019470147,0.121837236,0.0792803,0.50602967,0.013002888,0.26699597],"study_design_scores_gemma":[0.00050968066,0.0006805947,0.0009551283,0.00009459666,0.00012682781,0.0020474184,0.0003091968,0.7273899,0.031948652,0.2093855,0.026334083,0.00021838087],"about_ca_topic_score_codex":0.0009844092,"about_ca_topic_score_gemma":0.0006769358,"teacher_disagreement_score":0.004117587,"about_ca_system_score_codex":0.0013180099,"about_ca_system_score_gemma":0.002258204,"threshold_uncertainty_score":0.013774693},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029989373,0.0003557707,0.96776843,0.00014893903,0.000047988113,0.00006258896,0.000027666272,0.00026148214,0.0013377172],"genre_scores_gemma":[0.91872907,0.00020660776,0.079498254,0.000106354906,0.00006808083,0.00015757783,0.000063194224,0.00003072295,0.001140129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906284,0.00023044595,0.000033642445,0.00021028478,0.00032884677,0.00013406012],"domain_scores_gemma":[0.99729127,0.0017160194,0.00038734262,0.00021069446,0.00030451984,0.00009020727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014167345,0.0006897341,0.0011113721,0.0006796738,0.00082973193,0.0010071712,0.0017737554,0.0007479859,0.0007085817],"category_scores_gemma":[0.0062832115,0.0003938083,0.0004321758,0.0009890514,0.0009233957,0.0012152912,0.0015826924,0.00090119126,0.00017222109],"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.00023249796,0.00012314935,0.00072149775,0.00011689885,0.00005065296,0.00012913463,0.00017360781,0.8554805,0.008021605,0.01905108,0.0021072659,0.11379201],"study_design_scores_gemma":[0.00001337165,0.0000352971,0.000105805855,0.0000021871172,0.000005515701,0.000035178175,0.000010501587,0.99311006,0.0006213203,0.005819825,0.00023485857,0.0000061164383],"about_ca_topic_score_codex":0.0026897155,"about_ca_topic_score_gemma":0.0029680296,"teacher_disagreement_score":0.0026897155,"about_ca_system_score_codex":0.0011007278,"about_ca_system_score_gemma":0.0012916593,"threshold_uncertainty_score":0.007986426},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13823177,0.0017215791,0.8527733,0.0005498062,0.00022349125,0.00007982144,0.0004918069,0.0014146543,0.0045137927],"genre_scores_gemma":[0.96872497,0.0009272419,0.028505437,0.0000385731,0.000036979072,0.000041658135,0.0003909134,0.000027909542,0.0013062664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.00006793417,0.000021754811,0.00006837486,0.000093365496,0.00004200085],"domain_scores_gemma":[0.9995491,0.00020375634,0.00006562933,0.000040145962,0.00012145829,0.000019875095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048409222,0.0005527557,0.0005328381,0.0005876743,0.00047835906,0.0005280521,0.0007573947,0.00047560758,0.00047637895],"category_scores_gemma":[0.0018032934,0.00033260588,0.00032481033,0.00083539396,0.00025537892,0.00083104975,0.0005410157,0.00054379326,0.00021160411],"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.000029117713,0.000012090516,0.0028921166,0.000027233149,0.000014837179,0.000053790052,0.000023270388,0.96098787,0.0005951578,0.0013699397,0.0007605501,0.033234064],"study_design_scores_gemma":[0.0000014486487,0.000006028339,0.00043165783,0.0000033663948,0.000003303673,0.000011099726,0.000011401418,0.9979215,0.00024905472,0.0010430282,0.00031492414,0.0000031777995],"about_ca_topic_score_codex":0.02934207,"about_ca_topic_score_gemma":0.017290305,"teacher_disagreement_score":0.02934207,"about_ca_system_score_codex":0.00059706013,"about_ca_system_score_gemma":0.0006190715,"threshold_uncertainty_score":0.058342516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118891545,0.00064495334,0.8744435,0.00025966906,0.00015862098,0.00005456805,0.000072329814,0.00023295039,0.005241926],"genre_scores_gemma":[0.97384495,0.00016561706,0.024849353,0.00008884148,0.000048504695,0.000032227446,0.000026599044,0.000009285488,0.0009346422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993074,0.0001984424,0.00002216323,0.00012715608,0.00014953427,0.0001953515],"domain_scores_gemma":[0.99861,0.00063856714,0.00021521561,0.00012162164,0.000257015,0.00015752224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092637195,0.00046137624,0.0006623814,0.00036570922,0.00079139497,0.0006780079,0.00088265596,0.00038727853,0.00077626563],"category_scores_gemma":[0.0018777559,0.00025114967,0.00024371222,0.00067180773,0.00070293836,0.0005917549,0.000796361,0.00041120744,0.00015197243],"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.00065238867,0.00012362198,0.0013324019,0.00008249282,0.000068472094,0.00036198169,0.00017151744,0.8976316,0.015848836,0.02487832,0.0021530348,0.056695316],"study_design_scores_gemma":[0.000011449275,0.000076454206,0.0001823794,0.0000021566761,0.000008639523,0.000049051512,0.000027799395,0.99486285,0.0014067051,0.0030296461,0.00033351337,0.0000093917],"about_ca_topic_score_codex":0.004001006,"about_ca_topic_score_gemma":0.0046545044,"teacher_disagreement_score":0.004001006,"about_ca_system_score_codex":0.00090293045,"about_ca_system_score_gemma":0.0010358103,"threshold_uncertainty_score":0.007955432},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19977279,0.00076055224,0.7886159,0.0002411305,0.000082745355,0.0000902723,0.00009486919,0.0006981796,0.009643602],"genre_scores_gemma":[0.96917367,0.000097716984,0.029464114,0.000030418263,0.0000088448605,0.00002799537,0.000045867913,0.000035254183,0.0011160651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972206,0.00007743072,0.000008290021,0.00004483646,0.000058325604,0.00008903462],"domain_scores_gemma":[0.999744,0.00010535921,0.000051732055,0.000031755902,0.000035429817,0.000031807853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030359306,0.0005472072,0.00049149833,0.00047503537,0.0004566407,0.00066509197,0.0007882107,0.00038918515,0.0015724007],"category_scores_gemma":[0.00063937146,0.00018248925,0.0002991819,0.0004596333,0.00028271895,0.00064581237,0.0004465311,0.00037783006,0.00014738749],"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.00016746846,0.000120099256,0.000686772,0.000074827636,0.000022057286,0.00014461363,0.00006612754,0.9017248,0.0147147495,0.0062195417,0.0015771309,0.07448183],"study_design_scores_gemma":[0.000008041464,0.00004948269,0.00021707802,0.0000035218643,0.000007692049,0.00006021644,0.00003698392,0.99427766,0.0023653228,0.002307125,0.00066181226,0.000005188618],"about_ca_topic_score_codex":0.0013097354,"about_ca_topic_score_gemma":0.0023351014,"teacher_disagreement_score":0.0015724007,"about_ca_system_score_codex":0.00047066936,"about_ca_system_score_gemma":0.0004905489,"threshold_uncertainty_score":0.005260229},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048243245,0.00021046918,0.99302447,0.00010635951,0.00001641647,0.0000293393,0.000028095626,0.000060140257,0.0017004025],"genre_scores_gemma":[0.78619224,0.0013846868,0.20816797,0.0001477412,0.00013562125,0.00024559192,0.00009385996,0.00004703781,0.0035853572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991702,0.00024459654,0.000042965163,0.00014837782,0.00033397556,0.000059847633],"domain_scores_gemma":[0.99875855,0.00067031954,0.000257488,0.000100104124,0.00018412422,0.000029483117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010900202,0.0015578365,0.0008568721,0.00059136335,0.0003734749,0.0012151228,0.0009196075,0.0012092942,0.0014656256],"category_scores_gemma":[0.0026194945,0.0005399568,0.00066984724,0.00063699484,0.0007835963,0.0010153087,0.0009298176,0.00091109716,0.0005147858],"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.00005406684,0.000027766142,0.00027089528,0.00010658945,0.000042268515,0.00014268358,0.00007209506,0.9420906,0.008536505,0.023065612,0.00041625966,0.025174575],"study_design_scores_gemma":[0.000011032961,0.00006913669,0.00006321383,0.000008402644,0.000014493441,0.000053911073,0.000008762802,0.992926,0.0017026728,0.004682643,0.0004513835,0.0000084357725],"about_ca_topic_score_codex":0.0015230697,"about_ca_topic_score_gemma":0.0010961994,"teacher_disagreement_score":0.0015578365,"about_ca_system_score_codex":0.0006676637,"about_ca_system_score_gemma":0.0010489818,"threshold_uncertainty_score":0.005764663},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9000869,0.00040704935,0.09694036,0.00013474585,0.000069502385,0.00006444062,0.000028611887,0.00012188094,0.0021465311],"genre_scores_gemma":[0.9960194,0.000060371476,0.0036607098,0.000024430437,0.000010766932,0.000011483319,0.000004535921,0.0000030582244,0.000205123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854654,0.00034295407,0.000045589826,0.00015614969,0.000381684,0.00052706554],"domain_scores_gemma":[0.99048495,0.006604195,0.00086137943,0.0003156905,0.0012356425,0.0004981983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032683858,0.0010612645,0.0009251054,0.0010227058,0.0007990234,0.0016697167,0.0013414085,0.0008693156,0.0007196239],"category_scores_gemma":[0.0076514366,0.00034193698,0.00028658565,0.0006860884,0.0013725797,0.001336546,0.0010915322,0.00081810466,0.0000833267],"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.003267897,0.0010145338,0.0043833735,0.00025682544,0.00017953484,0.00089663384,0.00046492842,0.88426346,0.056234535,0.018239472,0.00037166546,0.03042716],"study_design_scores_gemma":[0.00007079109,0.0005449078,0.00051523425,0.000006579776,0.000047123718,0.00010702365,0.00006149521,0.99097836,0.0040030126,0.003587174,0.000055585493,0.00002265858],"about_ca_topic_score_codex":0.00756752,"about_ca_topic_score_gemma":0.0065543964,"teacher_disagreement_score":0.00756752,"about_ca_system_score_codex":0.001288572,"about_ca_system_score_gemma":0.001718694,"threshold_uncertainty_score":0.017285109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15100917,0.0031199844,0.83776444,0.00039189728,0.00008641797,0.000031465097,0.0000511621,0.00013466313,0.007410859],"genre_scores_gemma":[0.986598,0.00067908934,0.011924579,0.00007791564,0.0000704855,0.000020380907,0.000009493897,0.000006635467,0.00061350316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854434,0.0005534587,0.000044712968,0.0001450622,0.0004521185,0.00026033144],"domain_scores_gemma":[0.9964965,0.0025339776,0.00037002162,0.0001865137,0.00036714066,0.000045757828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001498829,0.00075354666,0.00071086275,0.00040408067,0.000461014,0.0010026633,0.000814374,0.00070597185,0.0003978522],"category_scores_gemma":[0.0059732758,0.00028099617,0.00032214646,0.0009103986,0.0010038409,0.00089005707,0.0010340072,0.0005248509,0.000105915475],"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.0002069954,0.000047271253,0.0022463005,0.00024656093,0.00009465551,0.0006560445,0.00020971382,0.90470076,0.009132369,0.030954713,0.0004767132,0.051027868],"study_design_scores_gemma":[0.000008910278,0.00010446982,0.00051636255,0.00001643432,0.00003875586,0.00020984015,0.00004273749,0.98782235,0.0024124102,0.00845382,0.00036213928,0.000011836701],"about_ca_topic_score_codex":0.0016988752,"about_ca_topic_score_gemma":0.0018182738,"teacher_disagreement_score":0.0016988752,"about_ca_system_score_codex":0.0006234742,"about_ca_system_score_gemma":0.00060818985,"threshold_uncertainty_score":0.0079267025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040115703,0.00070699817,0.95596814,0.00041179103,0.000040400482,0.0000722743,0.000029522971,0.00027922494,0.0023759757],"genre_scores_gemma":[0.88258237,0.00034342066,0.11545234,0.00017829721,0.00007675829,0.00007321993,0.00005778728,0.000022255323,0.0012134782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990459,0.0003479302,0.000046423444,0.0001667168,0.0001743507,0.0002186568],"domain_scores_gemma":[0.9991247,0.00031109745,0.00017102585,0.00016711566,0.00013042889,0.000095589494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015830465,0.0008204608,0.000822905,0.0005351242,0.00073670474,0.0016350874,0.0016436543,0.00090184796,0.00081040506],"category_scores_gemma":[0.0023564391,0.0003160793,0.00050395704,0.00078088377,0.0006185259,0.00310175,0.0025314423,0.0007870706,0.00027314032],"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.0004138969,0.0002709488,0.0018545584,0.00016381964,0.000117595955,0.0002666168,0.0003631913,0.6515775,0.027235875,0.050375514,0.00407624,0.26328424],"study_design_scores_gemma":[0.000021561153,0.00009281083,0.00022436875,0.000008259525,0.000024046853,0.00005687014,0.000083380786,0.98361915,0.0029907904,0.011141034,0.0017224192,0.000015323581],"about_ca_topic_score_codex":0.0021303531,"about_ca_topic_score_gemma":0.001976219,"teacher_disagreement_score":0.0021303531,"about_ca_system_score_codex":0.0009680598,"about_ca_system_score_gemma":0.0009999969,"threshold_uncertainty_score":0.008372009},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98420656,0.00064113835,0.009341782,0.0001732817,0.000040214327,0.000034207205,0.00008559483,0.00018534932,0.005291778],"genre_scores_gemma":[0.99806815,0.00012640524,0.0014033063,0.000016088241,0.00000991319,0.0000065410118,0.000054901564,0.0000094785755,0.0003052495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986099,0.00029287246,0.00007333131,0.00017395364,0.00046417105,0.00038579022],"domain_scores_gemma":[0.9959699,0.0020377713,0.00043784446,0.00025150462,0.0011567248,0.00014622073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928562,0.0004604944,0.00037433626,0.00080713007,0.00046480526,0.00073080277,0.0006024405,0.0004039532,0.00092598546],"category_scores_gemma":[0.0056795157,0.00013535729,0.00016553073,0.00084682065,0.00045112998,0.0012353372,0.00034829948,0.0005147961,0.00012855485],"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.0029578798,0.00072344113,0.04963002,0.0006165406,0.00020229348,0.0010032626,0.0009473035,0.70766973,0.12301823,0.016435683,0.003465325,0.0933303],"study_design_scores_gemma":[0.000059624042,0.0031169518,0.015498505,0.00004265606,0.00010524163,0.0004060134,0.00048021675,0.93835527,0.03903055,0.0009339536,0.0019203413,0.000050800652],"about_ca_topic_score_codex":0.0055542453,"about_ca_topic_score_gemma":0.0028547894,"teacher_disagreement_score":0.0055542453,"about_ca_system_score_codex":0.0012332428,"about_ca_system_score_gemma":0.0005135552,"threshold_uncertainty_score":0.011043847},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065024264,0.00047054663,0.9271188,0.00016182009,0.00013987902,0.00014349446,0.00006767928,0.0003454233,0.006528154],"genre_scores_gemma":[0.9155772,0.0002570943,0.08259675,0.000074971336,0.00004399594,0.00007459791,0.000078188226,0.00002911875,0.0012680066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954236,0.00014212592,0.000017772018,0.00006714686,0.00013727331,0.00009343148],"domain_scores_gemma":[0.9995982,0.00018814814,0.000061431696,0.00003754274,0.00007876387,0.00003591065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057832594,0.00046450275,0.00045315915,0.00035074793,0.00049338816,0.00046611615,0.00085425033,0.00034746373,0.0013492396],"category_scores_gemma":[0.0013064631,0.00015247945,0.00032528417,0.00063952594,0.00036627255,0.00041756628,0.00030658723,0.0005518566,0.00017427943],"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.00038482714,0.00031503863,0.0008380321,0.00019608764,0.000041460382,0.00021873844,0.00014562522,0.76634026,0.0199573,0.030226395,0.004932921,0.17640333],"study_design_scores_gemma":[0.00002007367,0.00007045604,0.00014543426,0.0000035713674,0.0000054378274,0.000058759408,0.000015773428,0.99494743,0.0016595008,0.001932942,0.0011346384,0.0000059921335],"about_ca_topic_score_codex":0.0055669937,"about_ca_topic_score_gemma":0.0061832806,"teacher_disagreement_score":0.0055669937,"about_ca_system_score_codex":0.0008538935,"about_ca_system_score_gemma":0.0013601448,"threshold_uncertainty_score":0.011069179},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033455502,0.0002794106,0.95389265,0.00007884228,0.00006803575,0.000058486377,0.00016120693,0.009173499,0.0028324218],"genre_scores_gemma":[0.7831094,0.00021760442,0.21069135,0.00013796064,0.00009411697,0.000099046425,0.00055986585,0.00025723534,0.0048333537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890614,0.00020384988,0.000050125167,0.0002176163,0.0005469579,0.00007534732],"domain_scores_gemma":[0.9988869,0.00017445814,0.00017938427,0.00044672957,0.00028423383,0.00002837075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005083222,0.0007152556,0.00078146585,0.001026723,0.000374702,0.0008336993,0.0016108389,0.00063611206,0.0016812835],"category_scores_gemma":[0.0016917201,0.00036017862,0.00036551978,0.001147053,0.0003493603,0.0010820337,0.0013230054,0.00057683163,0.0028870213],"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.000628185,0.0001579711,0.0069393963,0.000363748,0.0001284688,0.0004609122,0.00039056034,0.033781733,0.17559698,0.003874953,0.007007212,0.77066994],"study_design_scores_gemma":[0.00010686614,0.0005956029,0.016393637,0.00007059299,0.00014228321,0.0027433604,0.00018042375,0.70251703,0.2456773,0.004959993,0.026420848,0.0001920612],"about_ca_topic_score_codex":0.0007218269,"about_ca_topic_score_gemma":0.0010496766,"teacher_disagreement_score":0.0016812835,"about_ca_system_score_codex":0.00022279458,"about_ca_system_score_gemma":0.00029836412,"threshold_uncertainty_score":0.005624473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018212361,0.00046426206,0.97510284,0.00016530378,0.00016510858,0.00004172521,0.000062822044,0.0001560866,0.005629499],"genre_scores_gemma":[0.7671574,0.00077558047,0.22666357,0.00025950835,0.00016186816,0.00009964137,0.00012995536,0.000015265277,0.0047372077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.000077196644,0.000012044338,0.000045588353,0.00012083473,0.000047651458],"domain_scores_gemma":[0.999689,0.00008630053,0.000045173438,0.00006317658,0.00009286267,0.000023571729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028238224,0.00052230846,0.00032879517,0.00022389404,0.00032309594,0.00037012238,0.00045689018,0.00039444419,0.0010799865],"category_scores_gemma":[0.0008135123,0.00015071794,0.00033183937,0.00055460277,0.00033670504,0.0004396765,0.00050791365,0.00046799294,0.00034484072],"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.00025085136,0.00011717681,0.0011620419,0.00019940831,0.000119053635,0.0007031286,0.00018742854,0.5214817,0.122954026,0.07413112,0.006160074,0.27253398],"study_design_scores_gemma":[0.000017250115,0.00015291218,0.00031875502,0.000009812504,0.000020791207,0.0002627943,0.000021021868,0.98449624,0.0068996325,0.0047024065,0.003076703,0.000021591803],"about_ca_topic_score_codex":0.0014506964,"about_ca_topic_score_gemma":0.0026359516,"teacher_disagreement_score":0.0014506964,"about_ca_system_score_codex":0.00032449464,"about_ca_system_score_gemma":0.00049906387,"threshold_uncertainty_score":0.003612876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011556949,0.0035645398,0.960015,0.00081297156,0.00014701518,0.000094210205,0.00015209941,0.00019209553,0.023465244],"genre_scores_gemma":[0.88353026,0.0031912972,0.09963785,0.00031870132,0.00025686497,0.00031606562,0.00011814891,0.00007172404,0.012559184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939656,0.00027607326,0.000020032352,0.000081426595,0.00013497185,0.000090924594],"domain_scores_gemma":[0.99976593,0.00010322299,0.00003094142,0.000015027244,0.00006293681,0.0000219254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009593099,0.0007186702,0.0007650207,0.0004682167,0.00050058536,0.0014892195,0.0014199613,0.0009868743,0.004247004],"category_scores_gemma":[0.0009471425,0.0002921383,0.00043614538,0.000788545,0.0006326519,0.001325589,0.0010296867,0.00081379997,0.00055335404],"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.000042421983,0.000032141146,0.00021742264,0.00011833764,0.000023799665,0.000289921,0.000078303274,0.82403225,0.0014577429,0.15030946,0.003960342,0.019437814],"study_design_scores_gemma":[0.0000058335927,0.000016786773,0.000054478016,0.000007642204,0.0000057000716,0.000041405143,0.000021519232,0.9850802,0.00011151778,0.013549425,0.0010992623,0.000006166763],"about_ca_topic_score_codex":0.0049653915,"about_ca_topic_score_gemma":0.0038208612,"teacher_disagreement_score":0.0049653915,"about_ca_system_score_codex":0.0015936284,"about_ca_system_score_gemma":0.0010155023,"threshold_uncertainty_score":0.014207661},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031641588,0.0003421818,0.9475452,0.00065932894,0.00008300329,0.00020189246,0.00007916929,0.000045566925,0.019402122],"genre_scores_gemma":[0.8944657,0.0006444711,0.09310033,0.00021357363,0.00007672338,0.0003286379,0.00006947793,0.000038098184,0.011062928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899286,0.00050381303,0.000026637706,0.000117291675,0.0001921888,0.00016711767],"domain_scores_gemma":[0.9987036,0.0007550513,0.00016345645,0.00007714563,0.00012745598,0.00017317473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014191876,0.00087211904,0.0010047159,0.0005581093,0.0010696154,0.0017308736,0.0018442142,0.0016466602,0.0032087853],"category_scores_gemma":[0.0030318939,0.00040969616,0.0009375447,0.0006876594,0.002063691,0.0022547108,0.0020456598,0.0015828069,0.00026656096],"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.000049561957,0.000051894494,0.00039313352,0.00006339537,0.00003560549,0.00021755685,0.00016356578,0.72933686,0.0011296015,0.26296657,0.0009230893,0.004669122],"study_design_scores_gemma":[0.000011397261,0.00002355483,0.00006351422,0.000008339106,0.00000626561,0.00003309435,0.000069197435,0.95861566,0.00017117469,0.0397996,0.0011904875,0.000007810061],"about_ca_topic_score_codex":0.0054197675,"about_ca_topic_score_gemma":0.004139944,"teacher_disagreement_score":0.0054197675,"about_ca_system_score_codex":0.0020598823,"about_ca_system_score_gemma":0.0017847985,"threshold_uncertainty_score":0.014945507},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12162703,0.0021101108,0.8608379,0.0008048978,0.00059715187,0.0005467848,0.00036868925,0.0024107865,0.010696515],"genre_scores_gemma":[0.93238413,0.00048528984,0.063186966,0.00024683922,0.000098189965,0.00008119944,0.00025804632,0.000042287,0.0032170573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994467,0.00007099828,0.000029808225,0.00010082732,0.00019853367,0.00015318116],"domain_scores_gemma":[0.99947923,0.00007432217,0.000056599587,0.00009316364,0.0002201946,0.00007650719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053902215,0.0005896782,0.00086340425,0.00057991926,0.0008901351,0.00071322045,0.0017057745,0.0004957738,0.0016215353],"category_scores_gemma":[0.00093241263,0.00014746662,0.00045998022,0.00090121746,0.00035273275,0.0011751938,0.0011450388,0.000661917,0.00026503994],"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.0025009352,0.00085245736,0.0036452392,0.00042990956,0.00025665687,0.0011914176,0.0003202953,0.25364,0.0984202,0.046714403,0.02622538,0.5658031],"study_design_scores_gemma":[0.000082821985,0.00021779232,0.00058610685,0.00001410037,0.000031635886,0.00032846417,0.00006337054,0.9802713,0.010896791,0.0029095153,0.004567962,0.000030043604],"about_ca_topic_score_codex":0.0072032306,"about_ca_topic_score_gemma":0.0062612,"teacher_disagreement_score":0.0072032306,"about_ca_system_score_codex":0.0011926084,"about_ca_system_score_gemma":0.0013200747,"threshold_uncertainty_score":0.014322579},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00836703,0.00017976806,0.98914284,0.000065926804,0.00004223003,0.000074632655,0.00003511659,0.00019378259,0.0018986288],"genre_scores_gemma":[0.7296912,0.00038536763,0.26736486,0.00020646019,0.00006851623,0.00027219838,0.00010788331,0.000047185553,0.0018563945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990482,0.00033416064,0.000046703306,0.00015670265,0.00029660802,0.00011772874],"domain_scores_gemma":[0.99890125,0.00026758097,0.00014839334,0.00017097456,0.0004693649,0.00004241626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161834,0.0006562793,0.0003373885,0.0003300256,0.00041360344,0.0006419026,0.0010035421,0.0004967402,0.0010900674],"category_scores_gemma":[0.0016735834,0.00021428375,0.00027986654,0.00031501675,0.0005017663,0.0007458449,0.0007430968,0.00067694386,0.00028132857],"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.0002684878,0.0001217771,0.0015113988,0.00031090528,0.00015190119,0.00038884662,0.00021001762,0.6631056,0.10533808,0.06744044,0.003658011,0.1574946],"study_design_scores_gemma":[0.000014959839,0.00018768576,0.00023070448,0.000013259827,0.000027709139,0.00016779947,0.000018028531,0.97838223,0.014344891,0.003307631,0.0032834823,0.000021729249],"about_ca_topic_score_codex":0.0014552126,"about_ca_topic_score_gemma":0.002018404,"teacher_disagreement_score":0.0014552126,"about_ca_system_score_codex":0.0007495679,"about_ca_system_score_gemma":0.000896994,"threshold_uncertainty_score":0.0064318776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046090417,0.001751659,0.9425615,0.00052240945,0.0003516404,0.00017516139,0.00006739164,0.0012026067,0.007277145],"genre_scores_gemma":[0.9003819,0.00064118614,0.09457558,0.00011502712,0.00020053527,0.00007607904,0.00009326059,0.00004516579,0.003871312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998781,0.00036708504,0.000112627786,0.000214838,0.00040892957,0.00011545987],"domain_scores_gemma":[0.99747306,0.00071023224,0.000362504,0.00043667696,0.00082244916,0.00019497004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020251346,0.0004519685,0.0007635956,0.0007603217,0.0008366438,0.0013446938,0.0011573463,0.00072440354,0.0010107774],"category_scores_gemma":[0.005777082,0.00022643588,0.00046396506,0.0006250157,0.0005205753,0.002757945,0.0012001513,0.0008967214,0.00041236627],"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.0005225028,0.00042080783,0.0049817786,0.00052420824,0.00033863878,0.001088396,0.0005963801,0.2661103,0.05832421,0.13734494,0.014531629,0.51521623],"study_design_scores_gemma":[0.00006200592,0.00063399127,0.0018780385,0.000043304248,0.00021558949,0.0007994351,0.00007873623,0.957845,0.0075417324,0.019170228,0.011604079,0.00012788516],"about_ca_topic_score_codex":0.0014945512,"about_ca_topic_score_gemma":0.0019428652,"teacher_disagreement_score":0.0020251346,"about_ca_system_score_codex":0.00068131916,"about_ca_system_score_gemma":0.0011797632,"threshold_uncertainty_score":0.010710001},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07660144,0.0010893448,0.9163338,0.00021990946,0.00009090639,0.00017163732,0.00008551919,0.0018518245,0.0035556976],"genre_scores_gemma":[0.83401686,0.0004703554,0.16279197,0.00007480655,0.000044406246,0.00017596643,0.00009723324,0.00006731887,0.0022611944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992854,0.00021763124,0.00005361975,0.00012486134,0.00021059938,0.00010796763],"domain_scores_gemma":[0.9987212,0.00046549668,0.00022784792,0.00025640853,0.0002838002,0.000045162855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986276,0.00041914216,0.0005459889,0.00074542564,0.0007611387,0.0008262163,0.0011926572,0.0004397021,0.001398856],"category_scores_gemma":[0.0028750421,0.00030341075,0.00031698585,0.0008366904,0.0006885093,0.0012424026,0.000686435,0.0005830428,0.00025357524],"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.0005296876,0.00015724552,0.0028048505,0.0004711366,0.000097185126,0.00022915534,0.0006179864,0.7229678,0.069756374,0.0736572,0.002712052,0.12599929],"study_design_scores_gemma":[0.000017727198,0.00015850987,0.00081474456,0.000014367346,0.00003074792,0.00010522965,0.000043582193,0.9812703,0.007346651,0.005366126,0.0048026512,0.000029325824],"about_ca_topic_score_codex":0.0039097876,"about_ca_topic_score_gemma":0.0046599885,"teacher_disagreement_score":0.0039097876,"about_ca_system_score_codex":0.0006750955,"about_ca_system_score_gemma":0.0010162406,"threshold_uncertainty_score":0.007774055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1145066,0.000864823,0.87673193,0.0004935067,0.000092677124,0.00011535043,0.000078094,0.00054139475,0.0065756203],"genre_scores_gemma":[0.95632607,0.00019915849,0.041412666,0.00010601029,0.000032536667,0.000055651173,0.000039308743,0.000016871398,0.0018118771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00012691328,0.00002349429,0.00007204949,0.00011799479,0.00011979454],"domain_scores_gemma":[0.99970406,0.00009957656,0.000034319426,0.000025780413,0.000099432604,0.00003678031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049418054,0.0007812875,0.0007118274,0.0004214634,0.00084475265,0.00076653453,0.0010799314,0.0005377529,0.0011596759],"category_scores_gemma":[0.0006652685,0.00021741378,0.00040522305,0.00048070028,0.00049834227,0.00091864035,0.0008550208,0.0004627218,0.00017383513],"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.0004158717,0.00025178085,0.0023493983,0.00019707606,0.00011915025,0.0005033116,0.0003264326,0.7299198,0.045797892,0.031898398,0.004607523,0.18361351],"study_design_scores_gemma":[0.000013514301,0.00010811147,0.00015696588,0.0000040681675,0.000015819029,0.00006992888,0.000067932895,0.9951191,0.0018017187,0.0020421406,0.0005884936,0.000012196794],"about_ca_topic_score_codex":0.0065679317,"about_ca_topic_score_gemma":0.008345784,"teacher_disagreement_score":0.0065679317,"about_ca_system_score_codex":0.0010102474,"about_ca_system_score_gemma":0.0008498204,"threshold_uncertainty_score":0.013059378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010592824,0.00013110907,0.9873689,0.00004525118,0.000050569713,0.0000400092,0.000016741933,0.0005064175,0.0012481658],"genre_scores_gemma":[0.3124986,0.00019084768,0.6843184,0.00010724664,0.00007397573,0.000111673064,0.00007927881,0.000050020742,0.0025698636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996592,0.000037448764,0.000019196783,0.00007743516,0.00017141117,0.000035407087],"domain_scores_gemma":[0.9996741,0.000112987764,0.000048769067,0.000044169876,0.00010231501,0.00001768974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038761282,0.00039956433,0.00038505867,0.00051005173,0.00040122314,0.00057669147,0.0007952092,0.00045591526,0.0010127395],"category_scores_gemma":[0.0013058224,0.00015939966,0.00022477869,0.00032801586,0.000288514,0.0007640211,0.00052186806,0.0006085412,0.0003543073],"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.00029648544,0.00019819877,0.001403315,0.0000902043,0.000042385374,0.0001831952,0.00009727048,0.056087572,0.085608855,0.016561424,0.0021103956,0.83732074],"study_design_scores_gemma":[0.000035437384,0.00013131172,0.00085004355,0.000013038562,0.00002278494,0.0005482296,0.000022051552,0.94599074,0.040387876,0.0055156047,0.0064595975,0.000023263907],"about_ca_topic_score_codex":0.0007214362,"about_ca_topic_score_gemma":0.0010197612,"teacher_disagreement_score":0.0010127395,"about_ca_system_score_codex":0.00038108713,"about_ca_system_score_gemma":0.0004752899,"threshold_uncertainty_score":0.0033879876},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015110666,0.00014830408,0.98366714,0.00007585301,0.000028638628,0.000019627423,0.000027952814,0.00021223006,0.0007096512],"genre_scores_gemma":[0.6700019,0.00022915326,0.32760736,0.00018899216,0.000080828664,0.00009691978,0.00018891682,0.000053269367,0.0015526209],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876213,0.00045068053,0.00006303446,0.0001984238,0.0004341905,0.00009158129],"domain_scores_gemma":[0.99696773,0.0020053121,0.00030547788,0.00024209324,0.00038696907,0.00009243985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014075374,0.00075606885,0.0011664635,0.0008868885,0.00034334432,0.0009166224,0.0009731427,0.00097596075,0.00085275277],"category_scores_gemma":[0.0068429313,0.0002907363,0.00059243717,0.0006788413,0.0008904223,0.0018214189,0.0012247588,0.0008769066,0.00039233768],"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.0009750759,0.00025242832,0.0059190174,0.0003122438,0.00026011807,0.00044344057,0.00027524453,0.39100352,0.057085343,0.12671055,0.002378072,0.41438496],"study_design_scores_gemma":[0.000014739675,0.000066093795,0.00032933088,0.0000070970573,0.000009288948,0.00023666867,0.000011817554,0.9815059,0.006443643,0.010843813,0.00051145494,0.00002017226],"about_ca_topic_score_codex":0.00041669983,"about_ca_topic_score_gemma":0.00042040442,"teacher_disagreement_score":0.0014075374,"about_ca_system_score_codex":0.00045235487,"about_ca_system_score_gemma":0.00066786644,"threshold_uncertainty_score":0.0074438453},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70321864,0.0051611625,0.024077887,0.0022972475,0.00038680487,0.001146371,0.1914625,0.0060116746,0.06623773],"genre_scores_gemma":[0.704151,0.0026752104,0.072646044,0.00023286616,0.00023657929,0.0021094005,0.20400181,0.0006763056,0.013270905],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9946931,0.0011010814,0.0005447362,0.0007962003,0.0026087638,0.00025604424],"domain_scores_gemma":[0.9631688,0.0185819,0.0057777963,0.0035584874,0.0065376987,0.002375294],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.0044484725,0.0006121942,0.0006221235,0.025503624,0.0013661693,0.002533225,0.0009503251,0.0009542338,0.0020530547],"category_scores_gemma":[0.03508879,0.0003406298,0.00037856319,0.030149795,0.00051688455,0.0026671141,0.0017447486,0.0007336015,0.0013576677],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063349825,0.0009086251,0.3749649,0.006065524,0.00074853917,0.0009017073,0.010685234,0.012217035,0.015061821,0.031681444,0.21562381,0.33050796],"study_design_scores_gemma":[0.0002261628,0.000401897,0.45741323,0.0005700647,0.00037038577,0.0013979992,0.0061012767,0.050893385,0.017534737,0.016462512,0.44833893,0.00028951725],"about_ca_topic_score_codex":0.021021036,"about_ca_topic_score_gemma":0.03411319,"teacher_disagreement_score":0.9955515,"about_ca_system_score_codex":0.0016158712,"about_ca_system_score_gemma":0.0036510795,"threshold_uncertainty_score":0.04179734},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046403207,0.00063275074,0.94819486,0.0005392878,0.00006313887,0.000047312238,0.00006528778,0.00012285913,0.003931307],"genre_scores_gemma":[0.98251235,0.00043874606,0.013753062,0.00009334942,0.000045956847,0.000077751494,0.000050520048,0.00003549773,0.002992779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991555,0.00024266339,0.000038200033,0.00019534472,0.00019269327,0.0001755791],"domain_scores_gemma":[0.99705064,0.0022098676,0.00034567848,0.00006633881,0.00024823152,0.00007934183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015470351,0.0011040269,0.0012010026,0.0004267685,0.00045155894,0.0013708234,0.00089223887,0.0009928514,0.0017308161],"category_scores_gemma":[0.0045899968,0.0006157608,0.00054122356,0.0007100036,0.001506338,0.0011634191,0.0010311012,0.0012617747,0.00016959419],"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.000040173876,0.000021157453,0.00017320138,0.000039290848,0.000014107941,0.00005648771,0.000029911722,0.97987956,0.0009181986,0.015095199,0.0001901612,0.0035425022],"study_design_scores_gemma":[0.0000070959495,0.000012981536,0.000042473985,0.000002234906,0.0000029378518,0.000004937202,0.0000048485467,0.9963211,0.0001323344,0.0033907474,0.00007523393,0.0000030381073],"about_ca_topic_score_codex":0.005894633,"about_ca_topic_score_gemma":0.003315606,"teacher_disagreement_score":0.005894633,"about_ca_system_score_codex":0.0015763734,"about_ca_system_score_gemma":0.0016458773,"threshold_uncertainty_score":0.011720657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0095724985,0.00022994918,0.987936,0.0001165975,0.000018323455,0.000041735882,0.00002713561,0.00031580226,0.0017420833],"genre_scores_gemma":[0.48346752,0.00029167242,0.5105012,0.00020942274,0.0000451337,0.0004894911,0.00016105268,0.00015496089,0.0046795625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996524,0.00014420299,0.000014194832,0.000058721926,0.000079699676,0.00005079149],"domain_scores_gemma":[0.9991831,0.00057550025,0.00007746133,0.00003359308,0.000097393735,0.00003296797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008730407,0.0006835711,0.0011123255,0.00060893456,0.0005204156,0.00070532423,0.0009405248,0.0008949635,0.0033229727],"category_scores_gemma":[0.0022191405,0.00038006096,0.00047423368,0.0007748795,0.000601532,0.00096618064,0.0008390069,0.00081528135,0.0006675037],"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.00008072173,0.00004185341,0.00022916625,0.000045068056,0.00002850012,0.000040688807,0.000048020192,0.9479209,0.0014203843,0.005934053,0.001528425,0.042682204],"study_design_scores_gemma":[0.000013649257,0.000018911807,0.000023691262,0.0000026689142,0.000002876289,0.00000890837,0.0000071223603,0.998596,0.0001733499,0.0009362528,0.00021406672,0.0000024181568],"about_ca_topic_score_codex":0.0036829994,"about_ca_topic_score_gemma":0.0041642366,"teacher_disagreement_score":0.0036829994,"about_ca_system_score_codex":0.0007465645,"about_ca_system_score_gemma":0.0012477955,"threshold_uncertainty_score":0.011116385},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007306952,0.00012785224,0.99157715,0.000038986145,0.000018213479,0.000017162683,0.000021994367,0.00020307185,0.00068860827],"genre_scores_gemma":[0.6297703,0.000586629,0.36589572,0.000108334905,0.000112663794,0.00013077284,0.00028685573,0.000076668126,0.0030320103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994523,0.00017015672,0.0000324817,0.000103624916,0.00017569559,0.000065670865],"domain_scores_gemma":[0.99908257,0.00038226365,0.00011463727,0.00015511323,0.00020452662,0.00006091342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010688957,0.0008006999,0.0008572952,0.0009889454,0.00034684944,0.00087173854,0.0012428594,0.00091384794,0.0016060377],"category_scores_gemma":[0.0025491852,0.00026888298,0.00077164645,0.00081429677,0.0006382357,0.0021227065,0.0012173564,0.00089974265,0.000753946],"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.00025157057,0.00019995455,0.0041614217,0.00021976928,0.00014718634,0.0005827904,0.00033733502,0.33690816,0.047956944,0.047730133,0.0039479006,0.5575568],"study_design_scores_gemma":[0.000004233564,0.000038601833,0.00031904576,0.0000047636654,0.000012079859,0.00017824523,0.000028527094,0.9901523,0.0031680667,0.0053680353,0.0007090082,0.000017094584],"about_ca_topic_score_codex":0.00065983436,"about_ca_topic_score_gemma":0.00077427493,"teacher_disagreement_score":0.0016060377,"about_ca_system_score_codex":0.00036728813,"about_ca_system_score_gemma":0.00058085134,"threshold_uncertainty_score":0.0056529045},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107495226,0.00069143606,0.8850129,0.00024335404,0.00007262074,0.0001776422,0.00011553733,0.00027937605,0.005911981],"genre_scores_gemma":[0.79615414,0.00024274876,0.20195343,0.00009046695,0.000023924811,0.00017005087,0.00010810617,0.00004663666,0.0012105089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958116,0.00017662146,0.000015542488,0.0000356006,0.00007169372,0.00011944402],"domain_scores_gemma":[0.99841774,0.0012830105,0.00010405004,0.000039162667,0.00009590019,0.000060129103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009634744,0.0007017032,0.0010078538,0.0006744363,0.00040644853,0.00089552096,0.00083151273,0.00074462197,0.0017223557],"category_scores_gemma":[0.0022905925,0.00045356882,0.0004118192,0.00066761597,0.0006909164,0.0005654411,0.0005931957,0.000594195,0.00016903077],"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.00008333719,0.000034788383,0.00020330808,0.000046472556,0.000016506028,0.00004498123,0.00003154068,0.98238313,0.00081833004,0.00426426,0.00050550053,0.011567867],"study_design_scores_gemma":[0.000033853717,0.000030278607,0.000058538848,0.0000063562625,0.0000057678603,0.000009996925,0.000019116429,0.99728787,0.00037491816,0.001979163,0.00018940307,0.00000480141],"about_ca_topic_score_codex":0.0037181757,"about_ca_topic_score_gemma":0.003437532,"teacher_disagreement_score":0.0037181757,"about_ca_system_score_codex":0.0008544245,"about_ca_system_score_gemma":0.0017961517,"threshold_uncertainty_score":0.007393062},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053886484,0.00024847375,0.94424134,0.00011740036,0.000029596142,0.000031486397,0.000027899632,0.00012893685,0.0012883147],"genre_scores_gemma":[0.80683386,0.00022169792,0.19168921,0.000116127994,0.000042801807,0.000035936988,0.00004875545,0.000013090765,0.0009985334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995647,0.00011469904,0.00001484332,0.000056525994,0.00021488153,0.00003428955],"domain_scores_gemma":[0.9989962,0.00062957837,0.0001246337,0.00010525099,0.00011225053,0.000032010565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045637094,0.0003244111,0.00036067172,0.00029372517,0.00021357271,0.0003534283,0.00046130168,0.00044029474,0.0005278551],"category_scores_gemma":[0.00234653,0.00014415302,0.000113636335,0.00030061408,0.0007024515,0.00080081465,0.00070943276,0.00050220505,0.00010782005],"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.0012903969,0.00019324993,0.0029881825,0.00037810204,0.00006053915,0.00071449246,0.00056840794,0.24386925,0.32837325,0.0818144,0.0024348712,0.3373148],"study_design_scores_gemma":[0.000020015817,0.00020350855,0.00044778158,0.000017849066,0.000010231358,0.0003346499,0.000053570006,0.9612387,0.028106388,0.008509067,0.0010413856,0.000016883128],"about_ca_topic_score_codex":0.0005845457,"about_ca_topic_score_gemma":0.0010599802,"teacher_disagreement_score":0.0005845457,"about_ca_system_score_codex":0.00019027085,"about_ca_system_score_gemma":0.00029466144,"threshold_uncertainty_score":0.0024135709},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10187691,0.018741233,0.7422729,0.007113451,0.00062143867,0.00012178027,0.0010897564,0.0012738704,0.12688856],"genre_scores_gemma":[0.94278675,0.010231934,0.036085732,0.00086903904,0.000992717,0.00052209885,0.0005644116,0.00030887232,0.0076384363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968489,0.00062878494,0.00010994215,0.00030920023,0.001205385,0.00089782034],"domain_scores_gemma":[0.97475976,0.020267507,0.0008592966,0.0016445759,0.0019923,0.0004766457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037001162,0.0021665103,0.0019692285,0.0031708207,0.0017232226,0.004731478,0.0021388768,0.0022585853,0.0065336204],"category_scores_gemma":[0.025121706,0.0007793947,0.0009530663,0.0025358142,0.005726113,0.005961444,0.0047880705,0.005046611,0.0015903687],"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.0003605098,0.00008737226,0.00065623946,0.0007396712,0.0000728355,0.00032517998,0.0005536255,0.38483667,0.01306641,0.5662761,0.005821683,0.027203847],"study_design_scores_gemma":[0.000020023717,0.0000718559,0.0004918601,0.00036811893,0.000052142488,0.00023290173,0.00016660204,0.66207,0.009486409,0.32190746,0.005013232,0.00011943505],"about_ca_topic_score_codex":0.0017135555,"about_ca_topic_score_gemma":0.0010591304,"teacher_disagreement_score":0.0065336204,"about_ca_system_score_codex":0.0033667227,"about_ca_system_score_gemma":0.0020778002,"threshold_uncertainty_score":0.024427414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081256524,0.001292139,0.89744985,0.00034248922,0.00021891743,0.00010102488,0.00019047159,0.0017035825,0.017445117],"genre_scores_gemma":[0.8048274,0.00073737744,0.18951039,0.00027005927,0.00014210145,0.00009153346,0.00018662642,0.00008524456,0.0041492516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961287,0.00008435117,0.000028634793,0.000057898953,0.00012922595,0.00008716066],"domain_scores_gemma":[0.9997131,0.00006736578,0.000048772046,0.000069082584,0.000084866464,0.000016816986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005773228,0.00046876396,0.0003249454,0.00042741117,0.00040723776,0.00081241614,0.00068321684,0.00060683634,0.0023639167],"category_scores_gemma":[0.00085837493,0.00011165191,0.00033782786,0.0003342808,0.00031954158,0.0009334494,0.00060280325,0.0005545798,0.0006627082],"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.00075716566,0.00019485108,0.0029118117,0.00040484002,0.00008375135,0.0016602129,0.00033836137,0.05765481,0.24644062,0.16293424,0.006169616,0.52044976],"study_design_scores_gemma":[0.00010889015,0.0019469316,0.0043597617,0.00026364578,0.00017737938,0.0045834146,0.00017494457,0.5528984,0.24581324,0.043688312,0.1458182,0.00016679292],"about_ca_topic_score_codex":0.00050610956,"about_ca_topic_score_gemma":0.0009792625,"teacher_disagreement_score":0.0023639167,"about_ca_system_score_codex":0.00035140276,"about_ca_system_score_gemma":0.00033865788,"threshold_uncertainty_score":0.007908106},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10565513,0.0009184534,0.8879776,0.00023959072,0.00002898474,0.000034040808,0.000092185815,0.00016917674,0.004884761],"genre_scores_gemma":[0.9666732,0.0005926638,0.030796146,0.00003681713,0.000025169984,0.000032775388,0.0000760798,0.000016546075,0.0017507025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995409,0.0001758748,0.000016504922,0.00005754662,0.00013635585,0.00007284918],"domain_scores_gemma":[0.99885726,0.0006095898,0.0001663631,0.00010131374,0.00024442622,0.000020979835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060107064,0.00031251807,0.00046469292,0.0005094876,0.00050236064,0.0005791583,0.000574185,0.00038680114,0.000731112],"category_scores_gemma":[0.0022142006,0.00017855335,0.00032532663,0.0005285305,0.0005467461,0.00062106334,0.0005355061,0.0002711019,0.00018356006],"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.000075834134,0.000035083325,0.002286594,0.00011292423,0.00003973832,0.0004658109,0.00023542366,0.87119746,0.009251004,0.07275696,0.0013301084,0.04221305],"study_design_scores_gemma":[0.000003933185,0.00005877446,0.00047678285,0.000008769165,0.000016427295,0.00019421458,0.00006661455,0.9839287,0.0019131283,0.011867465,0.00144924,0.000015933789],"about_ca_topic_score_codex":0.0036346344,"about_ca_topic_score_gemma":0.0042628897,"teacher_disagreement_score":0.0036346344,"about_ca_system_score_codex":0.0009371334,"about_ca_system_score_gemma":0.00069262885,"threshold_uncertainty_score":0.007226944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08732691,0.0007413409,0.8839123,0.00062142726,0.00015696081,0.0004390815,0.00039705154,0.011160896,0.01524395],"genre_scores_gemma":[0.5902909,0.0003800785,0.39932632,0.00030562744,0.0000559213,0.00021611118,0.00097358745,0.00016126537,0.0082902415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993198,0.00013121859,0.00008742127,0.00012262733,0.00023657831,0.000102364036],"domain_scores_gemma":[0.9989002,0.000140502,0.000068450725,0.00040197474,0.00032499645,0.00016392687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077475695,0.00030602535,0.00037459863,0.0010190444,0.0010346905,0.0018725599,0.0016741977,0.00091857114,0.0017707051],"category_scores_gemma":[0.0014158519,0.00027530798,0.0004066171,0.0013411139,0.00055978855,0.0017156065,0.001993127,0.0009375656,0.0011146824],"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.0013619855,0.0007358391,0.007856072,0.00061785005,0.0001944424,0.0013943264,0.0015572923,0.12671666,0.12220077,0.16392434,0.032645494,0.5407949],"study_design_scores_gemma":[0.00015558535,0.0003941668,0.0033091297,0.000064731066,0.00013376375,0.0008159707,0.00042608578,0.84057456,0.032302193,0.039824966,0.081852935,0.00014589848],"about_ca_topic_score_codex":0.0074864603,"about_ca_topic_score_gemma":0.006586848,"teacher_disagreement_score":0.0074864603,"about_ca_system_score_codex":0.0012429749,"about_ca_system_score_gemma":0.0016969516,"threshold_uncertainty_score":0.014885783},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20910616,0.0010889715,0.78305155,0.0008037326,0.00010886657,0.00027384248,0.00007869802,0.001069742,0.0044185333],"genre_scores_gemma":[0.9728256,0.0001813623,0.026073683,0.00007128891,0.000028514434,0.000035419773,0.000035114786,0.000010866089,0.0007381872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966966,0.0012532775,0.00025410447,0.00035754376,0.0010687226,0.00036975616],"domain_scores_gemma":[0.9960924,0.0010388432,0.0006913953,0.0016099801,0.0004358264,0.00013151338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024363352,0.00041106224,0.0008094855,0.0007515219,0.0008870769,0.0012465953,0.0008430109,0.0008539724,0.00064989424],"category_scores_gemma":[0.0033971886,0.0002823879,0.0005382656,0.0010547291,0.0014893096,0.0036484234,0.002726896,0.0011745688,0.00025806474],"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.0027809874,0.00052150595,0.010943763,0.00082524226,0.00039832722,0.003126718,0.0028690407,0.18423623,0.18642484,0.32700363,0.0058198897,0.27504975],"study_design_scores_gemma":[0.00012431468,0.00048303226,0.0015849291,0.000063368985,0.00013300893,0.0020120894,0.00031320375,0.8437601,0.08969704,0.05285178,0.00890556,0.00007158507],"about_ca_topic_score_codex":0.00030105948,"about_ca_topic_score_gemma":0.00020392567,"teacher_disagreement_score":0.0024363352,"about_ca_system_score_codex":0.00074532937,"about_ca_system_score_gemma":0.00087351043,"threshold_uncertainty_score":0.012884736},"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":"evaluation","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":"evaluation","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70434016,0.0051046824,0.02370864,0.002288993,0.00038355688,0.0011112487,0.19184609,0.006004164,0.06521252],"genre_scores_gemma":[0.70484394,0.002639517,0.07136009,0.000232156,0.00023406342,0.0020555442,0.20472203,0.0006785075,0.01323411],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9947813,0.001082568,0.0005338512,0.00078899343,0.0025603937,0.00025282096],"domain_scores_gemma":[0.9636905,0.018310696,0.005709159,0.0035171935,0.006417628,0.0023548552],"candidate_categories":["metaresearch","bibliometrics"],"consensus_categories":[],"category_scores_codex":[0.004388424,0.00061099225,0.00061464676,0.025212513,0.0013509889,0.0025265564,0.0009409824,0.000954357,0.0020370337],"category_scores_gemma":[0.034337685,0.00033762163,0.0003779374,0.029523833,0.000512327,0.0026510393,0.0017339019,0.00072875357,0.0013536182],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063482847,0.0009070852,0.37822232,0.0059782113,0.00074921304,0.0009007372,0.010527035,0.012313455,0.0151568195,0.031101532,0.21387544,0.32963338],"study_design_scores_gemma":[0.00022526324,0.0004027645,0.4595627,0.00056892604,0.00036732553,0.0013984512,0.006085325,0.05059166,0.01755025,0.016264103,0.44669557,0.0002877082],"about_ca_topic_score_codex":0.021053689,"about_ca_topic_score_gemma":0.03414108,"teacher_disagreement_score":0.99561155,"about_ca_system_score_codex":0.0015951806,"about_ca_system_score_gemma":0.0035988737,"threshold_uncertainty_score":0.04186231},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20278414,0.0007643334,0.7855029,0.0002443288,0.000083695,0.00008830735,0.000095997326,0.00070864067,0.009727674],"genre_scores_gemma":[0.97027606,0.00009527703,0.028381603,0.00003015496,0.000008630853,0.00002694816,0.000045540663,0.000034663095,0.0011011449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997216,0.00007748076,0.000008204648,0.000044942306,0.000058254867,0.000089420646],"domain_scores_gemma":[0.9997445,0.000105114676,0.000051559888,0.00003155158,0.000035484885,0.00003167486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030306063,0.0005451714,0.00048506196,0.00046816227,0.00045231436,0.0006614383,0.00078022364,0.00038772906,0.0015688415],"category_scores_gemma":[0.00063453685,0.00017958003,0.00029693558,0.0004541802,0.00028235963,0.000643804,0.00044303955,0.00037751102,0.00014623538],"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.00016572476,0.00011862206,0.0006871554,0.00007337494,0.000021799267,0.00014040835,0.00006437443,0.9024852,0.014528219,0.0060810708,0.001560729,0.07407344],"study_design_scores_gemma":[0.000007829446,0.000049124294,0.00021743038,0.000003482353,0.000007579749,0.00005829728,0.00003644537,0.9943693,0.002333769,0.0022605571,0.000650915,0.000005127678],"about_ca_topic_score_codex":0.0013394788,"about_ca_topic_score_gemma":0.0023898543,"teacher_disagreement_score":0.0015688415,"about_ca_system_score_codex":0.00047112675,"about_ca_system_score_gemma":0.00049356284,"threshold_uncertainty_score":0.005248368},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012605821,0.00036226306,0.98136294,0.00021715541,0.00004204373,0.000024907997,0.000078122364,0.00006370187,0.0052430243],"genre_scores_gemma":[0.38845927,0.0014446526,0.6056931,0.00016360825,0.00012908578,0.00015373413,0.00039484355,0.00009804832,0.0034636809],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994223,0.00020940267,0.00003718791,0.0000691077,0.00022083966,0.000041102267],"domain_scores_gemma":[0.99889344,0.00039169952,0.00019866822,0.0002749243,0.00020100565,0.0000403902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061610836,0.00051116804,0.00045626916,0.0005716891,0.00032014534,0.00082403055,0.00037087206,0.00055428996,0.0021939739],"category_scores_gemma":[0.0038999561,0.0002178807,0.0003074542,0.0010416782,0.0008819981,0.0008235317,0.0008299648,0.00094458944,0.0008186942],"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.00012841813,0.000024839142,0.00051453494,0.00013384571,0.000023608753,0.0001212692,0.00012803989,0.44450015,0.017480655,0.45437816,0.0023781308,0.08018825],"study_design_scores_gemma":[0.000018651897,0.00004857907,0.0002595475,0.000037134505,0.000007755495,0.00016063607,0.000024900844,0.85709447,0.0048111705,0.12880166,0.008712814,0.000022788343],"about_ca_topic_score_codex":0.00035345223,"about_ca_topic_score_gemma":0.0004461735,"teacher_disagreement_score":0.0021939739,"about_ca_system_score_codex":0.0005354099,"about_ca_system_score_gemma":0.00051174033,"threshold_uncertainty_score":0.0073395967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014298563,0.00031698917,0.98192596,0.00010431911,0.00004526533,0.00004392147,0.00005055687,0.0005277591,0.0026866999],"genre_scores_gemma":[0.5953368,0.00061029714,0.39652345,0.00028064768,0.00013017506,0.00021419094,0.00033341756,0.00011217254,0.006458788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866474,0.00043750627,0.00006384142,0.00020236318,0.00046185465,0.00016983968],"domain_scores_gemma":[0.9990545,0.0003711884,0.00011422078,0.0001463762,0.0002674786,0.000046240384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008703567,0.00089070405,0.0009153547,0.00058833143,0.0004368692,0.00092802534,0.0010218604,0.0005901063,0.0016642832],"category_scores_gemma":[0.0024934926,0.0002625926,0.00047309094,0.0007963129,0.0005366266,0.0010118961,0.00072944805,0.0006098729,0.0010060214],"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.00061977946,0.00019865631,0.0021165428,0.00014798653,0.000101671154,0.0001624077,0.00013599811,0.47356308,0.041507453,0.01834561,0.005462023,0.45763874],"study_design_scores_gemma":[0.000038462313,0.00010897431,0.00037004988,0.000006362277,0.000020019515,0.00013077205,0.00001882242,0.9844354,0.00988423,0.0033739118,0.0015915768,0.000021425025],"about_ca_topic_score_codex":0.0012303869,"about_ca_topic_score_gemma":0.0018002336,"teacher_disagreement_score":0.0016642832,"about_ca_system_score_codex":0.0005074329,"about_ca_system_score_gemma":0.0008486822,"threshold_uncertainty_score":0.0055675507},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039860863,0.0007134374,0.95620614,0.00041628847,0.000040805007,0.00007070686,0.000029983628,0.0002852785,0.0023765073],"genre_scores_gemma":[0.8840827,0.00034335366,0.1139397,0.00018055485,0.00007679299,0.00007223437,0.00005826367,0.00002264042,0.0012237552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990472,0.00034580825,0.000046045017,0.00016692448,0.00017419353,0.0002197454],"domain_scores_gemma":[0.9991203,0.00031389893,0.00017123448,0.00016821871,0.00013029402,0.000096010706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015721336,0.0008303975,0.0008235764,0.0005324662,0.0007322587,0.0016288442,0.001644232,0.0009041029,0.00081524864],"category_scores_gemma":[0.0023428113,0.00031548413,0.0005031576,0.0007778121,0.00062328554,0.0031043168,0.0025243761,0.0007922696,0.00027585003],"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.00041153294,0.00026694493,0.0018254498,0.00016090722,0.0001157767,0.0002581436,0.00035082546,0.6545872,0.027124884,0.04884235,0.0040622926,0.26199368],"study_design_scores_gemma":[0.00002111596,0.00009269064,0.00022273873,0.00000820347,0.000023628463,0.00005526267,0.000081826984,0.98387754,0.0029720995,0.010932695,0.0016969651,0.000015215507],"about_ca_topic_score_codex":0.002176312,"about_ca_topic_score_gemma":0.0020210876,"teacher_disagreement_score":0.002176312,"about_ca_system_score_codex":0.00096613413,"about_ca_system_score_gemma":0.0010073377,"threshold_uncertainty_score":0.0083143115},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06290652,0.0010845157,0.9211973,0.0011077045,0.00034032553,0.00069420744,0.0003670542,0.002023833,0.010278558],"genre_scores_gemma":[0.94116306,0.0003750005,0.052416578,0.00026827553,0.00014274199,0.00029606436,0.00031714683,0.00004812246,0.0049730977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953243,0.001306754,0.0004221972,0.00062341447,0.0015467262,0.00077667873],"domain_scores_gemma":[0.9957705,0.00087825273,0.00062787865,0.0019026444,0.00055731204,0.0002634035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018703974,0.0008874641,0.0013451639,0.0012704403,0.0024139301,0.0022922189,0.0021075206,0.0020586445,0.0032287391],"category_scores_gemma":[0.004528924,0.00041038683,0.0011613866,0.0016286582,0.0016026831,0.006230987,0.006197091,0.002544126,0.0011649221],"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.0030016578,0.0006508209,0.0040842094,0.00086658064,0.00037599402,0.0023325249,0.0021586465,0.10904642,0.10583737,0.4768204,0.016755082,0.2780703],"study_design_scores_gemma":[0.0004362867,0.0007504015,0.0011318413,0.00009800732,0.00020816049,0.0029152331,0.000410275,0.7589746,0.039519954,0.16290191,0.03234939,0.00030390147],"about_ca_topic_score_codex":0.00089406554,"about_ca_topic_score_gemma":0.0005168535,"teacher_disagreement_score":0.0032287391,"about_ca_system_score_codex":0.0014198025,"about_ca_system_score_gemma":0.0019120997,"threshold_uncertainty_score":0.010801256},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77798754,0.0010262752,0.21083975,0.00034161966,0.00009305386,0.000042022777,0.00020497666,0.00024047855,0.009224303],"genre_scores_gemma":[0.9952673,0.00012181249,0.0041874805,0.00003308762,0.000011192238,0.000010544119,0.00005091866,0.000007617057,0.0003100971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926907,0.00036038834,0.000023922328,0.00007718122,0.00009991126,0.00016943108],"domain_scores_gemma":[0.9972167,0.0017244766,0.000311759,0.00016907019,0.0004353196,0.00014253278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015591683,0.00070582214,0.00067686324,0.0004087151,0.00051512034,0.0008384123,0.0004475498,0.00066790206,0.0007314267],"category_scores_gemma":[0.0038787646,0.0002544044,0.0002561346,0.0007072773,0.0007432271,0.0008040411,0.00092397124,0.00035919363,0.00013499123],"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.00017702767,0.000040514326,0.0018569182,0.000028041435,0.000026308246,0.000096844546,0.00003118044,0.9866296,0.0033296316,0.002933347,0.00027498658,0.0045756423],"study_design_scores_gemma":[0.0000055506,0.00006514978,0.0004910092,0.000001790349,0.0000066390753,0.000030051078,0.000025620962,0.99780804,0.0008395116,0.00066148135,0.000058827787,0.00000641159],"about_ca_topic_score_codex":0.0048035504,"about_ca_topic_score_gemma":0.004174986,"teacher_disagreement_score":0.0048035504,"about_ca_system_score_codex":0.0008870008,"about_ca_system_score_gemma":0.0007396547,"threshold_uncertainty_score":0.0095511675},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16327049,0.001153768,0.82842594,0.00043132657,0.000119974895,0.00017365122,0.00010767134,0.00039397273,0.005923206],"genre_scores_gemma":[0.97749454,0.00016421908,0.021716336,0.000054380544,0.000019521438,0.00003544797,0.000022457445,0.000008924039,0.00048402496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996762,0.00008182175,0.000010466324,0.000043413736,0.00007259174,0.00011543888],"domain_scores_gemma":[0.9993819,0.00024060982,0.000112003596,0.00006485722,0.00011170896,0.00008889735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005849456,0.00040955868,0.00051440764,0.00029523086,0.0007136678,0.0008548252,0.0010184146,0.00036812664,0.0008708473],"category_scores_gemma":[0.0010371424,0.00014291276,0.00016918797,0.00061972026,0.00051459006,0.00072398497,0.0009341946,0.00043819175,0.00012289868],"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.00020965746,0.00011664277,0.0012167753,0.000040829964,0.000027786666,0.00016706219,0.00006021579,0.93131804,0.007683505,0.008850971,0.0017981254,0.048510436],"study_design_scores_gemma":[0.000005677957,0.00001487166,0.00012026732,0.0000013555341,0.0000021135368,0.0000107435935,0.000011765236,0.9979493,0.0005261389,0.00113909,0.00021573387,0.0000030627418],"about_ca_topic_score_codex":0.0084639955,"about_ca_topic_score_gemma":0.0098782275,"teacher_disagreement_score":0.0084639955,"about_ca_system_score_codex":0.0010110928,"about_ca_system_score_gemma":0.0010236255,"threshold_uncertainty_score":0.01682949},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14936505,0.0031362388,0.839356,0.00039559096,0.000088244706,0.000031066593,0.000051662213,0.00013534397,0.0074408003],"genre_scores_gemma":[0.98668635,0.00067454326,0.011840759,0.000077621866,0.000070218935,0.00002012996,0.000009487379,0.000006647608,0.00061437394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853647,0.00055441685,0.00004478636,0.00014672424,0.00045413297,0.00026355087],"domain_scores_gemma":[0.9965107,0.002522118,0.00036788965,0.00018573782,0.00036777827,0.00004572437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014909024,0.00075678254,0.00070989295,0.0004055933,0.00045842893,0.0009957654,0.00082203734,0.0007077884,0.00040066015],"category_scores_gemma":[0.005965328,0.0002787322,0.0003224282,0.0009106593,0.0010013302,0.000890943,0.0010365769,0.0005275463,0.000105617546],"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.00020232197,0.00004698847,0.0022360971,0.00024409436,0.00009371135,0.0006420771,0.00020424335,0.90443367,0.009116449,0.030809315,0.00047513237,0.051495783],"study_design_scores_gemma":[0.000008636802,0.00010351504,0.0005144239,0.000016412107,0.000038410268,0.00020505677,0.000042233565,0.987921,0.00240266,0.008375968,0.00035978667,0.000011843562],"about_ca_topic_score_codex":0.0017287231,"about_ca_topic_score_gemma":0.0018473819,"teacher_disagreement_score":0.0017287231,"about_ca_system_score_codex":0.0006223444,"about_ca_system_score_gemma":0.0006122765,"threshold_uncertainty_score":0.007884741},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00836703,0.00017976806,0.98914284,0.000065926804,0.00004223003,0.000074632655,0.00003511659,0.00019378259,0.0018986288],"genre_scores_gemma":[0.7296912,0.00038536763,0.26736486,0.00020646019,0.00006851623,0.00027219838,0.00010788331,0.000047185553,0.0018563945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990482,0.00033416064,0.000046703306,0.00015670265,0.00029660802,0.00011772874],"domain_scores_gemma":[0.99890125,0.00026758097,0.00014839334,0.00017097456,0.0004693649,0.00004241626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012161834,0.0006562793,0.0003373885,0.0003300256,0.00041360344,0.0006419026,0.0010035421,0.0004967402,0.0010900674],"category_scores_gemma":[0.0016735834,0.00021428375,0.00027986654,0.00031501675,0.0005017663,0.0007458449,0.0007430968,0.00067694386,0.00028132857],"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.0002684878,0.0001217771,0.0015113988,0.00031090528,0.00015190119,0.00038884662,0.00021001762,0.6631056,0.10533808,0.06744044,0.003658011,0.1574946],"study_design_scores_gemma":[0.000014959839,0.00018768576,0.00023070448,0.000013259827,0.000027709139,0.00016779947,0.000018028531,0.97838223,0.014344891,0.003307631,0.0032834823,0.000021729249],"about_ca_topic_score_codex":0.0014552126,"about_ca_topic_score_gemma":0.002018404,"teacher_disagreement_score":0.0014552126,"about_ca_system_score_codex":0.0007495679,"about_ca_system_score_gemma":0.000896994,"threshold_uncertainty_score":0.0064318776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03021631,0.0004104066,0.9489402,0.00068430754,0.000099164696,0.00018887302,0.000083952684,0.000047002733,0.019329805],"genre_scores_gemma":[0.89807975,0.00068317505,0.09014394,0.0002391323,0.00008985542,0.00030151836,0.000067511886,0.00003979067,0.0103552835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999017,0.00048320447,0.000025236106,0.00011553639,0.00018847016,0.00017049072],"domain_scores_gemma":[0.9988217,0.0006774668,0.00015251605,0.00006532907,0.00012251339,0.00016050723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013687896,0.00096704584,0.0010009387,0.00052099896,0.001018161,0.0017391243,0.0018982079,0.0016138455,0.0027650096],"category_scores_gemma":[0.0028783428,0.00042341568,0.0009437662,0.00066407287,0.0018761416,0.0020197923,0.0019898128,0.0015810333,0.0002369475],"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.00004609764,0.00004865688,0.00037706076,0.000060180086,0.00003648645,0.00020678235,0.00014403448,0.78833973,0.0010401004,0.20431113,0.0010144563,0.0043752543],"study_design_scores_gemma":[0.000009108294,0.000020463332,0.000063152496,0.0000075317307,0.000006207953,0.00003077907,0.000063805644,0.97219014,0.00014486001,0.026431773,0.001024926,0.0000072497523],"about_ca_topic_score_codex":0.0061754645,"about_ca_topic_score_gemma":0.0046656146,"teacher_disagreement_score":0.0061754645,"about_ca_system_score_codex":0.0020435192,"about_ca_system_score_gemma":0.0017303267,"threshold_uncertainty_score":0.014826834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026740639,0.0005907341,0.9670382,0.0005133609,0.00017742436,0.00023629489,0.00022138591,0.00075702526,0.0037249888],"genre_scores_gemma":[0.80261785,0.00048054708,0.19160806,0.00031798898,0.00024485987,0.00024506895,0.0003583717,0.000037879294,0.0040893317],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975592,0.00064181915,0.00020453712,0.0003701,0.000959222,0.0002651131],"domain_scores_gemma":[0.99772495,0.0004836588,0.00029400364,0.0010482025,0.0003246249,0.0001245897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014696607,0.00058371975,0.0010187698,0.0007026266,0.0013730851,0.0012402849,0.0016470867,0.0010096023,0.0015659021],"category_scores_gemma":[0.0026793925,0.00025379486,0.00073029316,0.0015285244,0.0007785484,0.003603858,0.0023695573,0.0014999498,0.00050408556],"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.0014871305,0.00045794676,0.0026263548,0.0006065158,0.00026538246,0.0011054304,0.0015130466,0.11199918,0.10905106,0.40805772,0.013597985,0.3492323],"study_design_scores_gemma":[0.00020271538,0.0006153139,0.0011238784,0.00005636901,0.00013887639,0.0016829681,0.00027893708,0.77657086,0.045722727,0.13547432,0.037982676,0.00015021703],"about_ca_topic_score_codex":0.00043591473,"about_ca_topic_score_gemma":0.0003674382,"teacher_disagreement_score":0.0016470867,"about_ca_system_score_codex":0.00081729906,"about_ca_system_score_gemma":0.0010663957,"threshold_uncertainty_score":0.007772386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028319407,0.0002721821,0.9655731,0.00019066579,0.000029985997,0.000039023387,0.00003673103,0.00012876117,0.0054101576],"genre_scores_gemma":[0.92386365,0.0003095498,0.07252617,0.00009579086,0.00003511034,0.00009029882,0.000038013684,0.000035099358,0.003006293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962556,0.00014409109,0.000015298861,0.00007025882,0.00008015029,0.000064603846],"domain_scores_gemma":[0.999597,0.00027172608,0.00004665389,0.000023018345,0.000044445893,0.000017140237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064708304,0.0006550389,0.00066026277,0.00026162897,0.0002634133,0.0009769943,0.00052059296,0.00056654785,0.001949869],"category_scores_gemma":[0.0014415797,0.0003951442,0.00030968498,0.0005192106,0.0006512115,0.0006577295,0.00071594375,0.0005369045,0.00030444373],"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.00009025906,0.000054134292,0.0002387688,0.00008074968,0.000020416523,0.00006452733,0.00006677188,0.9340109,0.0047639045,0.027401542,0.00080781494,0.03240032],"study_design_scores_gemma":[0.0000088524575,0.00001929112,0.000037830167,0.0000027075155,0.0000027863757,0.000009535682,0.00000860125,0.99410266,0.00040425474,0.005222176,0.00017866032,0.0000026328246],"about_ca_topic_score_codex":0.0011520095,"about_ca_topic_score_gemma":0.0012270117,"teacher_disagreement_score":0.001949869,"about_ca_system_score_codex":0.0006864746,"about_ca_system_score_gemma":0.00068805605,"threshold_uncertainty_score":0.006523013},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045238115,0.0014061371,0.94701576,0.0002694122,0.00006255136,0.00007684761,0.000040692932,0.00008811008,0.0058024544],"genre_scores_gemma":[0.92596143,0.0012393113,0.07010732,0.00007716888,0.000059417256,0.00014452093,0.000050063747,0.000012854478,0.0023479103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903846,0.0004180028,0.000037551643,0.000119883676,0.00031540982,0.00007086026],"domain_scores_gemma":[0.9993224,0.00032136796,0.00011410942,0.00007416353,0.00014089812,0.00002704604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000988,0.0005537521,0.0005936923,0.00040914363,0.00045926563,0.0010151481,0.00071049295,0.00088389864,0.0006861067],"category_scores_gemma":[0.0017776298,0.00020563533,0.00039342235,0.00085247855,0.00087194284,0.0010981754,0.0008972808,0.0005509151,0.0001884683],"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.000257733,0.00007840954,0.00090202276,0.0004728971,0.00011918073,0.0010721168,0.00047016257,0.6452169,0.046880886,0.24154957,0.0013830052,0.061597075],"study_design_scores_gemma":[0.000046543402,0.0002780168,0.00023970613,0.000019361732,0.00003915167,0.00042359243,0.000049506514,0.9734779,0.0049150144,0.017316192,0.003156001,0.000039035353],"about_ca_topic_score_codex":0.0008823537,"about_ca_topic_score_gemma":0.0006234335,"teacher_disagreement_score":0.0010151481,"about_ca_system_score_codex":0.00064563355,"about_ca_system_score_gemma":0.000614955,"threshold_uncertainty_score":0.005225122},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04611377,0.0017355442,0.94270015,0.00052018923,0.00034916328,0.00016971884,0.000066861205,0.0011950389,0.0071494826],"genre_scores_gemma":[0.9024019,0.00062515086,0.09265383,0.00011293509,0.00019662992,0.00007415256,0.00009201456,0.00004463827,0.0037987768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987789,0.0003688547,0.00011199048,0.00021640732,0.00040747275,0.000116388386],"domain_scores_gemma":[0.9974722,0.0007138629,0.00036322145,0.00043274398,0.0008224006,0.0001954707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020180196,0.00045316844,0.00076348434,0.0007614949,0.0008343538,0.001337647,0.0011576926,0.0007246614,0.0010063598],"category_scores_gemma":[0.005744783,0.00022619205,0.00046307963,0.0006258869,0.0005208448,0.002762744,0.0011932077,0.0008921518,0.00041068956],"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.0005241713,0.00041878747,0.0050529772,0.00051686284,0.00033882985,0.0010752383,0.0005880492,0.26963615,0.058255527,0.13545763,0.0143578965,0.51377785],"study_design_scores_gemma":[0.00006066801,0.0006237081,0.0018551314,0.000042387037,0.00021225802,0.0007757318,0.00007715724,0.95900756,0.007358563,0.018681156,0.011179565,0.00012605505],"about_ca_topic_score_codex":0.0015261591,"about_ca_topic_score_gemma":0.0019674469,"teacher_disagreement_score":0.0020180196,"about_ca_system_score_codex":0.00068077975,"about_ca_system_score_gemma":0.0011782886,"threshold_uncertainty_score":0.01067245},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079450674,0.0009384456,0.91668177,0.00023485316,0.000057131125,0.00004661626,0.000067322115,0.00014549415,0.0023777299],"genre_scores_gemma":[0.93593305,0.0007085942,0.06104676,0.00006537928,0.000039366627,0.00010125098,0.000049964427,0.000034819772,0.002020818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912816,0.00040049438,0.000028608492,0.00013444595,0.00015247935,0.00015586278],"domain_scores_gemma":[0.9978436,0.0016462447,0.0002088499,0.00006921476,0.00016147937,0.000070507114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016927836,0.0009593689,0.0009980506,0.0007238025,0.00050322094,0.0014946259,0.0012043312,0.0008887656,0.0008758094],"category_scores_gemma":[0.0050061117,0.00072416815,0.00029710462,0.00102151,0.000846398,0.0017523668,0.0009103097,0.00062450033,0.0001907615],"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.000091877824,0.000036787227,0.0002753417,0.000044735163,0.000014705666,0.00008054518,0.000050072395,0.9733272,0.0019206696,0.014490164,0.00028740297,0.00938043],"study_design_scores_gemma":[0.0000065360628,0.000018685025,0.00003364344,0.0000021581805,0.0000044012986,0.000013969248,0.000007561573,0.99621886,0.00038696243,0.0031785634,0.00012464414,0.000004009626],"about_ca_topic_score_codex":0.0024428244,"about_ca_topic_score_gemma":0.0024664034,"teacher_disagreement_score":0.0024428244,"about_ca_system_score_codex":0.0013248293,"about_ca_system_score_gemma":0.0012979637,"threshold_uncertainty_score":0.009612381},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03355638,0.00028612348,0.9537447,0.00008042769,0.00006868319,0.00005791835,0.0001642472,0.009236352,0.0028051124],"genre_scores_gemma":[0.7855983,0.0002203899,0.20819674,0.00014017575,0.00009552284,0.00009882801,0.00056678534,0.0002633012,0.004819994],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989059,0.00020495725,0.00005012673,0.00022035054,0.0005427906,0.00007591233],"domain_scores_gemma":[0.9988778,0.00017730732,0.00018107393,0.00044909967,0.0002860603,0.000028614064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005046918,0.0007218028,0.00077826134,0.0010309927,0.00037243278,0.00082753645,0.0016090233,0.0006407754,0.0016910101],"category_scores_gemma":[0.0016849699,0.00036097888,0.00036865904,0.0011478618,0.00034977688,0.0010919991,0.0013295119,0.00057766377,0.0028915422],"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.0006305676,0.00015751852,0.0070242267,0.00036499742,0.00012963942,0.0004600539,0.00038512566,0.033566464,0.17655462,0.0037727943,0.006906673,0.77004737],"study_design_scores_gemma":[0.000109158245,0.000609783,0.016778415,0.000072491355,0.00014528673,0.0027786659,0.00018347424,0.6976302,0.2498431,0.0049472544,0.026705204,0.00019699163],"about_ca_topic_score_codex":0.0007358547,"about_ca_topic_score_gemma":0.0010644337,"teacher_disagreement_score":0.0016910101,"about_ca_system_score_codex":0.00022251945,"about_ca_system_score_gemma":0.0002970681,"threshold_uncertainty_score":0.005657017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12041469,0.002153666,0.86190945,0.0008142331,0.00060962536,0.0005413523,0.00037581328,0.0024475742,0.010733614],"genre_scores_gemma":[0.93313193,0.0004917857,0.06239821,0.00025227113,0.0000991712,0.00008090614,0.00026223465,0.000043138745,0.003240259],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999443,0.00007117808,0.000029941193,0.00010232473,0.0001988547,0.0001547008],"domain_scores_gemma":[0.9994815,0.00007438416,0.00005589706,0.00009267073,0.00021885188,0.000076745004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005419886,0.0005977534,0.00086784543,0.00057781686,0.0008910609,0.0007110925,0.0016904589,0.0004959043,0.0016389007],"category_scores_gemma":[0.00092792715,0.00014747311,0.00046045444,0.0008959037,0.0003557254,0.0011785002,0.0011496213,0.00066983706,0.0002657814],"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.0025121344,0.0008453086,0.00364672,0.0004284555,0.00025715874,0.0011770761,0.00031681603,0.25326023,0.09816749,0.046681132,0.026190411,0.5665171],"study_design_scores_gemma":[0.000082410115,0.00022025715,0.0005851038,0.000014308294,0.000031961135,0.00032350855,0.000064123735,0.98027635,0.010856858,0.0029491277,0.0045657824,0.000030189374],"about_ca_topic_score_codex":0.007354065,"about_ca_topic_score_gemma":0.0063938526,"teacher_disagreement_score":0.007354065,"about_ca_system_score_codex":0.0011903623,"about_ca_system_score_gemma":0.0013344752,"threshold_uncertainty_score":0.0146225095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98423105,0.0006250645,0.009360261,0.00017510673,0.000040339706,0.000034228357,0.000086722575,0.00018689198,0.0052603334],"genre_scores_gemma":[0.9980642,0.0001242517,0.0014067872,0.000016357435,0.000009930665,0.0000066314387,0.000054974593,0.000009459853,0.000307411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99860567,0.00029251224,0.00007342765,0.00017546139,0.00046344788,0.00038948015],"domain_scores_gemma":[0.99596477,0.0020415906,0.00043788124,0.000251582,0.0011585178,0.00014567087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019289578,0.00046146507,0.00037186584,0.00081148616,0.000463983,0.0007259886,0.0005997019,0.0004076139,0.00092662533],"category_scores_gemma":[0.0056918357,0.00013499586,0.00016533434,0.0008437547,0.00045740683,0.0012436736,0.0003477764,0.0005166521,0.00012845131],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029271408,0.0007285632,0.04985733,0.00061153085,0.00020277903,0.0009920684,0.0009384652,0.70750505,0.12327361,0.016351758,0.003455771,0.09315599],"study_design_scores_gemma":[0.00005957571,0.0031350497,0.015524025,0.000042985972,0.00010541718,0.0004019449,0.00047994056,0.9379676,0.03936968,0.0009308807,0.0019315955,0.000051314775],"about_ca_topic_score_codex":0.005619999,"about_ca_topic_score_gemma":0.0028930672,"teacher_disagreement_score":0.005619999,"about_ca_system_score_codex":0.0012268586,"about_ca_system_score_gemma":0.0005174325,"threshold_uncertainty_score":0.01117456},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4376437,0.0011310366,0.5464845,0.0009878096,0.000118396994,0.00043796535,0.00015591798,0.0013032474,0.011737482],"genre_scores_gemma":[0.86293787,0.00028929458,0.13441747,0.00007158215,0.000032412205,0.00014641036,0.00014249679,0.0001094913,0.0018528906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994711,0.00013547663,0.000029826298,0.000074943055,0.00014762647,0.00014109498],"domain_scores_gemma":[0.99908316,0.0003950568,0.00012937406,0.00006718838,0.00022154381,0.00010368608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056315126,0.0010499071,0.0009878719,0.00087582524,0.0007316993,0.0011677736,0.0011596328,0.000734019,0.0012620372],"category_scores_gemma":[0.0025125556,0.00040261148,0.00038073814,0.0008868095,0.00027885125,0.000983446,0.0006096654,0.00048437488,0.00024818204],"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.00028752867,0.00017637512,0.0024585072,0.00018853697,0.000036854806,0.0002096625,0.000057598052,0.8768337,0.01362722,0.004485078,0.0024969028,0.0991421],"study_design_scores_gemma":[0.000009159442,0.000043751585,0.00050219405,0.000004711137,0.000011499947,0.000042784734,0.00002896595,0.99678266,0.0016830582,0.000638179,0.00024907148,0.0000039635866],"about_ca_topic_score_codex":0.0053235507,"about_ca_topic_score_gemma":0.0053718546,"teacher_disagreement_score":0.0053235507,"about_ca_system_score_codex":0.0014500334,"about_ca_system_score_gemma":0.0018610867,"threshold_uncertainty_score":0.010585129},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07601394,0.0010786299,0.9169036,0.00022079857,0.000091258866,0.00016960062,0.00008680918,0.0018613889,0.0035740556],"genre_scores_gemma":[0.83452487,0.00046413115,0.16227125,0.00007466739,0.000044353576,0.0001742759,0.00009885212,0.000067889094,0.0022797412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992894,0.00021642215,0.000053273267,0.00012579963,0.0002079629,0.00010707944],"domain_scores_gemma":[0.99872893,0.00046278734,0.00022482178,0.00025500366,0.00028376371,0.00004482102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012907701,0.00041862903,0.000543442,0.0007417801,0.0007513042,0.00082255015,0.0011870706,0.00043805773,0.0014118865],"category_scores_gemma":[0.0028392314,0.00029939532,0.0003157405,0.00082952244,0.00068166497,0.0012452393,0.0006822762,0.0005796595,0.00025543763],"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.0005227361,0.00015633089,0.0028097848,0.00046714532,0.00009621197,0.00022330647,0.00060893025,0.722318,0.07000598,0.0726102,0.0026972468,0.1274842],"study_design_scores_gemma":[0.000017505892,0.00015827364,0.00081766245,0.000014378904,0.000030653762,0.00010346977,0.000043658994,0.98125273,0.007361223,0.0053454484,0.004825654,0.000029339648],"about_ca_topic_score_codex":0.003998622,"about_ca_topic_score_gemma":0.0047328505,"teacher_disagreement_score":0.003998622,"about_ca_system_score_codex":0.000676692,"about_ca_system_score_gemma":0.001022413,"threshold_uncertainty_score":0.007950664},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003777401,0.00031012713,0.99422425,0.00021280479,0.000028296714,0.00002690765,0.000012832058,0.00009491423,0.0013124747],"genre_scores_gemma":[0.88967633,0.00070976646,0.10627517,0.00017765537,0.00017336514,0.00023701854,0.000066887835,0.00009737469,0.0025864216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845827,0.0006604067,0.000051874165,0.00028374445,0.00033021453,0.00021554953],"domain_scores_gemma":[0.9985697,0.0008571005,0.00024738366,0.00006416972,0.00018814951,0.00007342935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002457031,0.0017266046,0.001642646,0.0007471439,0.0004854991,0.0017849072,0.0014853178,0.0014294405,0.0012487313],"category_scores_gemma":[0.003797366,0.0006200009,0.00092307024,0.0006600567,0.0013954133,0.0012805436,0.0018300252,0.0018230166,0.00019531028],"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.0000370313,0.000023381644,0.0001155732,0.000032907214,0.000034727753,0.00003603581,0.000021408498,0.9773361,0.00096103054,0.012688181,0.00040280272,0.008310743],"study_design_scores_gemma":[0.0000025835238,0.000007397781,0.00001509926,0.0000017088072,0.0000027479314,0.000003285075,0.0000021211981,0.9984445,0.0000962235,0.0013433909,0.00007846309,0.0000025768677],"about_ca_topic_score_codex":0.005781143,"about_ca_topic_score_gemma":0.0025993774,"teacher_disagreement_score":0.005781143,"about_ca_system_score_codex":0.001816293,"about_ca_system_score_gemma":0.0020429369,"threshold_uncertainty_score":0.01317817},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03495136,0.0009126471,0.95684254,0.00059717445,0.00008246428,0.0001146985,0.000079935046,0.00008992423,0.0063292626],"genre_scores_gemma":[0.81595683,0.0013649315,0.17674488,0.00033562613,0.00015951434,0.0003089806,0.00011631097,0.00010915813,0.004903714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00024737793,0.000013886633,0.00007457351,0.00010136417,0.00010056652],"domain_scores_gemma":[0.999067,0.00069066626,0.00006981491,0.00003179632,0.000095543415,0.00004524783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013281616,0.001222125,0.001084868,0.0004350728,0.0004914632,0.0013334709,0.0009268038,0.0010586325,0.0022109288],"category_scores_gemma":[0.0027177809,0.00033477228,0.00065497245,0.000810031,0.0010671152,0.00080780755,0.0011148227,0.0011044439,0.00024486653],"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.00004047089,0.000037547685,0.00024927297,0.00005367523,0.000016022484,0.00007936249,0.000025540377,0.98457795,0.00084217126,0.007782211,0.0005590205,0.0057367426],"study_design_scores_gemma":[0.0000035843184,0.000012431388,0.00003427157,0.000002987519,0.000002676019,0.0000059263098,0.0000069596176,0.9985898,0.00011550395,0.0011183572,0.00010609342,0.0000014311435],"about_ca_topic_score_codex":0.0086205425,"about_ca_topic_score_gemma":0.006256245,"teacher_disagreement_score":0.0086205425,"about_ca_system_score_codex":0.0010718927,"about_ca_system_score_gemma":0.0015122563,"threshold_uncertainty_score":0.017140687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010567398,0.0004900455,0.98712456,0.00010997999,0.000033623768,0.000029376297,0.000013044072,0.000045039036,0.001586983],"genre_scores_gemma":[0.76034343,0.0010169187,0.2365856,0.00011016741,0.00007771942,0.00013849395,0.000059557104,0.000022029428,0.0016461315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915576,0.0003234089,0.000035225647,0.000086467895,0.0003366652,0.0000624013],"domain_scores_gemma":[0.9988493,0.0005046961,0.00015184583,0.00014165645,0.0003208839,0.000031600895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007140144,0.00078143756,0.0004909664,0.00044765408,0.00038209333,0.00061427435,0.0009176802,0.0007324989,0.0005864291],"category_scores_gemma":[0.0020821106,0.00020344328,0.000313363,0.00073864183,0.0008034158,0.00077520113,0.00069758354,0.00074545335,0.00024391215],"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.00014719764,0.00007437166,0.0007782694,0.00021373098,0.00005905059,0.0002709059,0.00024006199,0.70314646,0.040959675,0.14536458,0.001008449,0.107737325],"study_design_scores_gemma":[0.000012844021,0.000085078784,0.000067210945,0.000014481604,0.000013418455,0.00009900307,0.000015215489,0.9841456,0.0041528065,0.010101025,0.001280544,0.000012789543],"about_ca_topic_score_codex":0.001086763,"about_ca_topic_score_gemma":0.0020995622,"teacher_disagreement_score":0.001086763,"about_ca_system_score_codex":0.00087216566,"about_ca_system_score_gemma":0.00089025946,"threshold_uncertainty_score":0.0063280463},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14055802,0.0017078124,0.85045236,0.0005580445,0.00022413163,0.00007916992,0.0004917278,0.0014259729,0.0045028003],"genre_scores_gemma":[0.9693774,0.0009024295,0.02789942,0.000038246104,0.000036305082,0.000041034193,0.00038661747,0.000027639211,0.0012909152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997086,0.00006765771,0.000021530499,0.00006797832,0.00009220494,0.00004193578],"domain_scores_gemma":[0.9995479,0.00020511207,0.00006544063,0.000039978648,0.00012161275,0.000019911382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048349684,0.00055127015,0.0005272464,0.00058606337,0.0004748962,0.0005244111,0.0007529653,0.00047556413,0.000473494],"category_scores_gemma":[0.0017988151,0.00033043927,0.0003223452,0.00082587305,0.00025525453,0.0008231033,0.0005384186,0.0005410768,0.00020888925],"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.000028903842,0.000011981445,0.00289275,0.000026592952,0.000014734028,0.000052626885,0.000022734817,0.96150005,0.0005867436,0.001344419,0.00074925006,0.0327692],"study_design_scores_gemma":[0.000001437925,0.0000059514628,0.0004319658,0.0000033229924,0.0000032694034,0.00001081871,0.000011221444,0.9979462,0.00024644035,0.0010256859,0.00031051305,0.0000031365144],"about_ca_topic_score_codex":0.029852405,"about_ca_topic_score_gemma":0.01758666,"teacher_disagreement_score":0.029852405,"about_ca_system_score_codex":0.0005984762,"about_ca_system_score_gemma":0.0006204058,"threshold_uncertainty_score":0.059357285},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014843024,0.00037990112,0.98303235,0.00008181051,0.000066560206,0.00001998824,0.000020796613,0.00022793512,0.0013276897],"genre_scores_gemma":[0.6467606,0.0007337963,0.34672138,0.00017351242,0.000102026046,0.000051966977,0.0001110238,0.000048003516,0.0052978015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00014779886,0.000053837302,0.00011374,0.00023545124,0.00007055148],"domain_scores_gemma":[0.9992342,0.0002408031,0.0000783839,0.00014482586,0.0002730229,0.000028796605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065626745,0.00058305834,0.00069634477,0.00038731933,0.0004875628,0.0006059919,0.0006285899,0.00063623884,0.0009922269],"category_scores_gemma":[0.001931073,0.00029698372,0.00051847193,0.00042067506,0.0007363222,0.0010084804,0.00056914194,0.0007370998,0.00045213307],"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.00056195806,0.00010816288,0.0025089444,0.00044270844,0.00020277196,0.00072549045,0.000415096,0.4997852,0.11522459,0.05340346,0.0031945992,0.32342696],"study_design_scores_gemma":[0.000011942992,0.00009742554,0.00024206181,0.000013133822,0.000023857721,0.00019901458,0.000018214329,0.97780013,0.0175681,0.002596901,0.0014020525,0.00002714222],"about_ca_topic_score_codex":0.001445976,"about_ca_topic_score_gemma":0.0021133157,"teacher_disagreement_score":0.001445976,"about_ca_system_score_codex":0.00031644144,"about_ca_system_score_gemma":0.0008145498,"threshold_uncertainty_score":0.0034706593},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029630886,0.00035693878,0.9681257,0.00014983899,0.000048754326,0.000061816725,0.000028089495,0.0002621918,0.0013357431],"genre_scores_gemma":[0.91960394,0.00020619816,0.07862369,0.00010632266,0.00006787668,0.00015570622,0.00006376558,0.000030627438,0.0011418032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904996,0.00023325745,0.000033684682,0.00021396355,0.0003326189,0.00013648099],"domain_scores_gemma":[0.9972398,0.0017523704,0.00039254117,0.00021266675,0.0003109387,0.00009159148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014223631,0.00069924654,0.0011183785,0.00068588275,0.0008270749,0.0010048619,0.0017893583,0.00075298786,0.0007119366],"category_scores_gemma":[0.0062831608,0.00039451863,0.00043637186,0.0009975666,0.0009303432,0.0012222251,0.0015818652,0.00091173634,0.0001720304],"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.00023049678,0.0001231192,0.0007248834,0.00011604008,0.000050628063,0.00012491777,0.00016983825,0.85501105,0.007999759,0.018707447,0.00208102,0.11466084],"study_design_scores_gemma":[0.000013165692,0.000035814213,0.00010736259,0.0000022192094,0.0000055464875,0.000034663823,0.000010496694,0.9932127,0.0006230026,0.0057152845,0.00023359903,0.000006158841],"about_ca_topic_score_codex":0.0027601335,"about_ca_topic_score_gemma":0.003034485,"teacher_disagreement_score":0.0027601335,"about_ca_system_score_codex":0.0011090398,"about_ca_system_score_gemma":0.0013163553,"threshold_uncertainty_score":0.008046627},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2423059,0.0009927802,0.740967,0.00034466293,0.000054866672,0.000056153443,0.000053494583,0.00032293744,0.014902205],"genre_scores_gemma":[0.98481053,0.00023861874,0.014381312,0.00003463309,0.000022741455,0.000017004795,0.000007755808,0.000010544752,0.00047687895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923193,0.00029580042,0.000019066198,0.00009531063,0.00018636549,0.00017150564],"domain_scores_gemma":[0.998396,0.001153554,0.00013874486,0.000085324624,0.00017532604,0.000051009894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016718362,0.0016704625,0.0010099015,0.0004883308,0.00047839255,0.001317161,0.0009707975,0.0010420087,0.0007763196],"category_scores_gemma":[0.0046123955,0.000251035,0.0003627695,0.0005019095,0.0009117024,0.0012242134,0.001221617,0.00062284817,0.00020947785],"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.0003386384,0.00015148544,0.00059296045,0.00014574522,0.0000697286,0.00032537818,0.00014848942,0.92867935,0.020438291,0.014261852,0.00043005764,0.03441814],"study_design_scores_gemma":[0.000023073526,0.00021548229,0.00024492719,0.000008451441,0.00003472905,0.00012112213,0.00004408494,0.98501104,0.006183712,0.007827455,0.00027132308,0.000014717651],"about_ca_topic_score_codex":0.0012147553,"about_ca_topic_score_gemma":0.0013040104,"teacher_disagreement_score":0.0016718362,"about_ca_system_score_codex":0.0006166967,"about_ca_system_score_gemma":0.00077029865,"threshold_uncertainty_score":0.008841634},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031200938,0.0003433732,0.96006685,0.00012785752,0.00004485419,0.00005186239,0.00006393258,0.000116944044,0.007983392],"genre_scores_gemma":[0.6084022,0.000840905,0.3823478,0.00016779995,0.00009320974,0.00019780832,0.00019712733,0.000064888576,0.007688283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963176,0.00009943157,0.000020178893,0.000050760613,0.00015619541,0.000041610838],"domain_scores_gemma":[0.9993655,0.00020493915,0.00011272196,0.00011648962,0.0001643654,0.000036018588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030362545,0.00035968897,0.0003483192,0.00041560648,0.00027216008,0.00048343692,0.00041223443,0.00043868198,0.0017667448],"category_scores_gemma":[0.0014423418,0.000109174725,0.0002456052,0.00046765181,0.00062159565,0.0008005759,0.00054990564,0.0006510628,0.00054472365],"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.00011291078,0.000041534622,0.00025604886,0.000091748196,0.000014996605,0.000094562434,0.00012899772,0.12596685,0.024648856,0.7697689,0.0013174466,0.07755717],"study_design_scores_gemma":[0.000035287347,0.00018482689,0.00019523918,0.000023366212,0.0000080772425,0.00018641102,0.000032101532,0.8383132,0.01771643,0.13069281,0.012574121,0.000038176706],"about_ca_topic_score_codex":0.0006651943,"about_ca_topic_score_gemma":0.0007301849,"teacher_disagreement_score":0.0017667448,"about_ca_system_score_codex":0.00036955636,"about_ca_system_score_gemma":0.0008089041,"threshold_uncertainty_score":0.005910337},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04678137,0.00062397984,0.94783187,0.0005348285,0.00006208188,0.000047478596,0.000064856074,0.00012236854,0.00393111],"genre_scores_gemma":[0.98255575,0.00043390357,0.013735902,0.00009281584,0.00004552718,0.00007811965,0.00005030545,0.000035362857,0.0029723204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991627,0.00024100342,0.000038046517,0.00019273142,0.00019187477,0.00017371727],"domain_scores_gemma":[0.99705696,0.00220466,0.000344967,0.00006650703,0.00024798277,0.00007897002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015480232,0.0010884721,0.0011955713,0.00042590062,0.00045123367,0.0013686012,0.0008827279,0.0009791907,0.0017060011],"category_scores_gemma":[0.004595606,0.00061889825,0.00053866877,0.00070671836,0.0014976029,0.0011580951,0.0010274075,0.0012454765,0.00016852222],"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.0000402143,0.000021062298,0.00017226365,0.000039169016,0.00001410597,0.00005650007,0.0000298655,0.97985667,0.0009208197,0.015150256,0.00018908603,0.003510084],"study_design_scores_gemma":[0.000007169384,0.000013009194,0.000042574306,0.0000022193537,0.000002942615,0.00000493051,0.000004832029,0.9963018,0.00013248992,0.0034096495,0.00007540623,0.0000030325193],"about_ca_topic_score_codex":0.0058083115,"about_ca_topic_score_gemma":0.0032772273,"teacher_disagreement_score":0.0058083115,"about_ca_system_score_codex":0.0015759848,"about_ca_system_score_gemma":0.0016369037,"threshold_uncertainty_score":0.011549056},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07848668,0.00080984295,0.9144004,0.00015133242,0.000129734,0.000080593316,0.00006801632,0.0016078426,0.004265558],"genre_scores_gemma":[0.78955233,0.00026181294,0.20583957,0.00018563052,0.00013549687,0.00007564564,0.00010532258,0.00004769337,0.0037964939],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990343,0.00024636087,0.00004021424,0.00014631213,0.00046040537,0.0000723516],"domain_scores_gemma":[0.9983352,0.0007321713,0.0001785915,0.00029327953,0.00041143145,0.000049390914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007778547,0.00051462144,0.000665317,0.00064437493,0.00045307685,0.0008517482,0.0011917832,0.00059359474,0.001761359],"category_scores_gemma":[0.0014789158,0.00024987446,0.00037247982,0.0005197563,0.0005193338,0.0011409335,0.0009818765,0.00059052324,0.000684547],"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.0014869345,0.00029166357,0.003539887,0.00042184244,0.00029617464,0.0012715296,0.00037322805,0.12195336,0.25166938,0.049241174,0.0042573954,0.56519735],"study_design_scores_gemma":[0.00010779398,0.0007160857,0.0006832022,0.000022706328,0.00007577869,0.0012749414,0.00003304224,0.9502587,0.036728427,0.005725821,0.004304709,0.0000688685],"about_ca_topic_score_codex":0.0004820546,"about_ca_topic_score_gemma":0.00061644136,"teacher_disagreement_score":0.001761359,"about_ca_system_score_codex":0.000251576,"about_ca_system_score_gemma":0.00048532346,"threshold_uncertainty_score":0.0058922768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08531735,0.0036143428,0.89949757,0.00042968764,0.000066776665,0.000037230453,0.00013254845,0.00035253004,0.010552],"genre_scores_gemma":[0.95965165,0.00222776,0.034289565,0.00016377316,0.0001102951,0.00005272496,0.00012078421,0.000082160564,0.0033013388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812764,0.0005166167,0.00007092283,0.00022321596,0.00083262485,0.0002289201],"domain_scores_gemma":[0.9948211,0.0030788474,0.0005225499,0.00032313634,0.0011769175,0.00007748294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001431015,0.0010292645,0.0011044055,0.00090536504,0.0005390887,0.001192183,0.0006856445,0.0010767151,0.0017726785],"category_scores_gemma":[0.0081624845,0.000380799,0.00052343257,0.000957845,0.0009978546,0.0018596462,0.0012236976,0.0010343549,0.0006181912],"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.00017549354,0.00009478386,0.0028303524,0.00036963972,0.00007218758,0.0004892764,0.00033401186,0.8646532,0.030416058,0.061015777,0.0014392473,0.038109947],"study_design_scores_gemma":[0.0000035584014,0.00004750471,0.0006709183,0.000022988694,0.000016871758,0.00022881772,0.000054548887,0.9880752,0.00392749,0.006417116,0.00051215285,0.000022910015],"about_ca_topic_score_codex":0.0018835873,"about_ca_topic_score_gemma":0.0010097005,"teacher_disagreement_score":0.0018835873,"about_ca_system_score_codex":0.0011890467,"about_ca_system_score_gemma":0.00075615937,"threshold_uncertainty_score":0.008627236},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90035427,0.0004038002,0.09668808,0.00013481402,0.000069491354,0.00006390655,0.00002914643,0.000121622645,0.0021349636],"genre_scores_gemma":[0.9960426,0.00005852863,0.0036434256,0.000023895944,0.000010514893,0.00001137739,0.000004497818,0.0000030304586,0.00020194717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985455,0.0003447849,0.00004540338,0.00015652705,0.00037980019,0.00052804634],"domain_scores_gemma":[0.99030334,0.0067622876,0.0008651584,0.00031734488,0.0012508598,0.0005009567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032390053,0.0010546539,0.00091517944,0.0010185151,0.00078907073,0.0016424396,0.0013277568,0.00086520286,0.0007192584],"category_scores_gemma":[0.0076617263,0.0003333935,0.000283635,0.0006844844,0.0013741154,0.00132333,0.0010754726,0.0008123186,0.00008265866],"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.0031920092,0.001000723,0.0043706675,0.00024991116,0.00017603226,0.00086426426,0.00044600116,0.8854061,0.0558087,0.017672135,0.0003639995,0.03044942],"study_design_scores_gemma":[0.000070181995,0.00054795895,0.0005252176,0.000006604016,0.00004696919,0.00010579806,0.00006137211,0.9909093,0.0040870598,0.0035610609,0.000055603887,0.000022810586],"about_ca_topic_score_codex":0.007695538,"about_ca_topic_score_gemma":0.0066772983,"teacher_disagreement_score":0.007695538,"about_ca_system_score_codex":0.0012922499,"about_ca_system_score_gemma":0.0017155283,"threshold_uncertainty_score":0.01712972},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16656767,0.0017010613,0.8288122,0.00018791843,0.00018827611,0.00011967524,0.000055535023,0.00047986922,0.001887844],"genre_scores_gemma":[0.9404481,0.00034160356,0.058465153,0.000046354944,0.000048381356,0.000044442215,0.000058596404,0.000013642099,0.00053364236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947804,0.00013126704,0.000058549307,0.000075735494,0.00018055658,0.00007595588],"domain_scores_gemma":[0.9989796,0.00035095747,0.00018685388,0.00014094924,0.00028508203,0.000056530524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009591075,0.00047546392,0.00045829956,0.0008001842,0.0007091823,0.0005637218,0.0010331273,0.0003893989,0.00025050231],"category_scores_gemma":[0.002621587,0.00017045099,0.0002140683,0.0007175885,0.00040964337,0.0009578998,0.0005604812,0.00036454038,0.00007950892],"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.00063544244,0.000182959,0.0049223406,0.00021469043,0.00009204939,0.0005639348,0.00069975306,0.53237337,0.09601611,0.03133557,0.0024823314,0.33048147],"study_design_scores_gemma":[0.000029587118,0.0002885061,0.0013209521,0.00002050828,0.000055713906,0.00026914635,0.00008516358,0.97464246,0.013824654,0.0056868275,0.0037230344,0.000053502237],"about_ca_topic_score_codex":0.003769985,"about_ca_topic_score_gemma":0.0035149057,"teacher_disagreement_score":0.003769985,"about_ca_system_score_codex":0.0009985875,"about_ca_system_score_gemma":0.0005162056,"threshold_uncertainty_score":0.0074961185},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44819793,0.001301767,0.5456284,0.00026435172,0.00009811994,0.00007008479,0.000020241072,0.00024820358,0.004170935],"genre_scores_gemma":[0.9910823,0.00015547972,0.00827279,0.00004718654,0.000018985145,0.000024439209,0.0000041642033,0.000006526156,0.00038807502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667954,0.0010953823,0.000102651844,0.00041730722,0.00091030437,0.00079480966],"domain_scores_gemma":[0.9838108,0.0123079065,0.0013693271,0.00091403106,0.0012733343,0.00032470629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044037616,0.0015402393,0.0010110139,0.0007774378,0.00090410124,0.0014347355,0.0021017303,0.0014561289,0.0005179481],"category_scores_gemma":[0.012734825,0.00051059166,0.0006704777,0.0009851106,0.0023511013,0.0025704745,0.0027705743,0.0009749909,0.00013699154],"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.00068238704,0.00025969374,0.0030293406,0.00013896095,0.00021395892,0.00062156847,0.0004599315,0.93170315,0.007618994,0.015430701,0.0003193036,0.03952194],"study_design_scores_gemma":[0.000017489623,0.00018581997,0.00037108746,0.0000068970935,0.000047686033,0.0001698584,0.00009150668,0.99247015,0.0020560112,0.0043893643,0.00017587714,0.00001830837],"about_ca_topic_score_codex":0.0044166693,"about_ca_topic_score_gemma":0.003894569,"teacher_disagreement_score":0.0044166693,"about_ca_system_score_codex":0.001098829,"about_ca_system_score_gemma":0.000944908,"threshold_uncertainty_score":0.023289561},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7491322,0.0005993374,0.2161126,0.0018768363,0.0003466764,0.00037533915,0.0015101274,0.001052741,0.028994132],"genre_scores_gemma":[0.9855192,0.00017995975,0.0055285897,0.000051531704,0.00004634708,0.00010101433,0.00029566625,0.000018127495,0.00825948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992078,0.00018337448,0.00002701072,0.00021388901,0.000109242355,0.00025872033],"domain_scores_gemma":[0.99934727,0.00024659367,0.00009138954,0.00006338639,0.00013310827,0.00011826775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047787573,0.0009930842,0.0013060351,0.0006650713,0.0022589024,0.0017130637,0.0021023024,0.0018814094,0.009586281],"category_scores_gemma":[0.0011974062,0.0004224046,0.0006487531,0.001549334,0.00095044286,0.0020897435,0.0021634323,0.00087472895,0.0008723335],"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.0005511308,0.00016666079,0.0031392933,0.00012494356,0.00008282606,0.0013923843,0.00015690681,0.94484866,0.0030336413,0.028432937,0.0039068074,0.014163952],"study_design_scores_gemma":[0.000043125037,0.00009079731,0.00036464166,0.000004548407,0.00002407691,0.0001164586,0.00008396529,0.99141884,0.00040993484,0.0057981964,0.0016286422,0.000016821861],"about_ca_topic_score_codex":0.015429809,"about_ca_topic_score_gemma":0.011428835,"teacher_disagreement_score":0.015429809,"about_ca_system_score_codex":0.0025672342,"about_ca_system_score_gemma":0.0014177543,"threshold_uncertainty_score":0.032069266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009590033,0.0002308528,0.98790634,0.000118368545,0.000018489434,0.00004150731,0.000027490385,0.00031855924,0.0017483664],"genre_scores_gemma":[0.48579147,0.00029065376,0.5081491,0.00021115565,0.000045319877,0.00048441486,0.0001626756,0.00015556924,0.004709575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964905,0.00014536415,0.000014247433,0.000059482634,0.0000802298,0.00005164704],"domain_scores_gemma":[0.99917704,0.00057977036,0.00007790143,0.00003376484,0.00009822114,0.000033188593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000874506,0.0006840269,0.0011099005,0.00060879876,0.0005178765,0.0007053834,0.0009412828,0.00089815154,0.0033523156],"category_scores_gemma":[0.0022169803,0.00037971998,0.00047316554,0.0007761451,0.00060215004,0.0009697293,0.0008361955,0.0008201005,0.0006716967],"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.00008099759,0.000041907857,0.00023056664,0.00004474882,0.000028492734,0.000040259984,0.00004740131,0.94777554,0.0014236486,0.005910727,0.0015215825,0.042854168],"study_design_scores_gemma":[0.000013565753,0.000018848108,0.000023691742,0.0000026752143,0.0000028627544,0.000008809928,0.000007105076,0.998602,0.00017372429,0.00093100296,0.00021332515,0.0000024108833],"about_ca_topic_score_codex":0.003733928,"about_ca_topic_score_gemma":0.0042233714,"teacher_disagreement_score":0.003733928,"about_ca_system_score_codex":0.0007459205,"about_ca_system_score_gemma":0.0012617013,"threshold_uncertainty_score":0.011214614},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010754554,0.0001322444,0.98719084,0.00004571552,0.000050711067,0.00003997449,0.000016958855,0.00050963927,0.0012592929],"genre_scores_gemma":[0.31733537,0.00018979853,0.67947936,0.00010746418,0.00007369982,0.000111522335,0.00007996592,0.000050526454,0.0025723912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965775,0.000037727383,0.000019188536,0.00007807669,0.00017154077,0.00003583192],"domain_scores_gemma":[0.9996718,0.000114228154,0.000049186907,0.00004410032,0.00010286561,0.000017785442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003885242,0.00040022001,0.000384282,0.0005133337,0.00040223476,0.00057691464,0.00079419895,0.00045675,0.0010182967],"category_scores_gemma":[0.0013096987,0.00015937808,0.00022513753,0.0003296121,0.00029025576,0.0007674767,0.0005223525,0.0006084084,0.0003544715],"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.00029840006,0.00019878866,0.0014292849,0.00008968357,0.00004269757,0.00018087524,0.00009640793,0.056797657,0.084936276,0.016382309,0.0020958127,0.8374519],"study_design_scores_gemma":[0.000035145073,0.00013082758,0.0008589609,0.000013074719,0.000022730654,0.0005384724,0.00002206133,0.9466087,0.03995207,0.00546682,0.0063278484,0.000023250528],"about_ca_topic_score_codex":0.00074055215,"about_ca_topic_score_gemma":0.0010396354,"teacher_disagreement_score":0.0010182967,"about_ca_system_score_codex":0.00038374204,"about_ca_system_score_gemma":0.00047976893,"threshold_uncertainty_score":0.0034065247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089794874,0.0009619517,0.9008284,0.0004097076,0.00007259761,0.000048720216,0.000095442505,0.00033857967,0.0074496693],"genre_scores_gemma":[0.9735814,0.0002821027,0.02421699,0.00006201668,0.000015570837,0.00003588542,0.000026788757,0.0000182506,0.00176104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997044,0.000105738036,0.000007609103,0.000034108463,0.000107674954,0.00004033504],"domain_scores_gemma":[0.9996736,0.0002158047,0.000040927804,0.000022407172,0.000033615022,0.000013710612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033682064,0.0005102246,0.0004830838,0.00019421945,0.0003079303,0.00042611282,0.00040761722,0.00048096082,0.0012876801],"category_scores_gemma":[0.0008342878,0.00020564397,0.00020080879,0.00036223992,0.00040240175,0.0005377559,0.0005383844,0.00032351358,0.00014559369],"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.000082948965,0.00003560473,0.00020907391,0.00008843507,0.00001770286,0.00012374562,0.0000388612,0.9480518,0.01071745,0.011915241,0.0007281477,0.027990934],"study_design_scores_gemma":[0.000010058288,0.000063305655,0.00016513659,0.000005272224,0.000005319598,0.00003859882,0.000017500593,0.9903791,0.0016599549,0.007274508,0.00037550466,0.0000056983504],"about_ca_topic_score_codex":0.0010359737,"about_ca_topic_score_gemma":0.0011913214,"teacher_disagreement_score":0.0012876801,"about_ca_system_score_codex":0.0004585659,"about_ca_system_score_gemma":0.00040901714,"threshold_uncertainty_score":0.0043076873},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01048322,0.0013060689,0.984355,0.00011963549,0.000040150986,0.000031661515,0.000057394896,0.00021797811,0.0033890035],"genre_scores_gemma":[0.678961,0.004385641,0.31075597,0.00021652653,0.00023077989,0.00026626463,0.00033107065,0.00018570866,0.0046671038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831617,0.0004971347,0.00006987591,0.00018531321,0.0007924312,0.00013901388],"domain_scores_gemma":[0.99102694,0.0065139662,0.00064354605,0.00061738776,0.0010956576,0.00010251929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027165727,0.0014089255,0.0010371573,0.0010191392,0.00044679618,0.0019538612,0.0011724718,0.0011159234,0.0018072529],"category_scores_gemma":[0.018664436,0.00056353834,0.00060385757,0.0012683619,0.0017037522,0.0021119013,0.0014277746,0.0015015582,0.000863375],"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.00012356286,0.000042775264,0.00055458635,0.0003351079,0.000055886005,0.00012072643,0.00021578227,0.82067174,0.00909492,0.10989555,0.0013771917,0.057512097],"study_design_scores_gemma":[0.000009505916,0.000043246513,0.000119863595,0.000037775753,0.000012329099,0.00007668161,0.000019302912,0.9821002,0.0040713125,0.012738514,0.00075142295,0.000019783596],"about_ca_topic_score_codex":0.0020317237,"about_ca_topic_score_gemma":0.0026038154,"teacher_disagreement_score":0.0027165727,"about_ca_system_score_codex":0.0011322028,"about_ca_system_score_gemma":0.0025054086,"threshold_uncertainty_score":0.014366746},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5586874,0.001514081,0.41502008,0.00052085635,0.000038307342,0.000043741056,0.00025258338,0.0003119619,0.02361104],"genre_scores_gemma":[0.99295104,0.000260255,0.0058772913,0.00002092162,0.000010610219,0.000010623158,0.000041391242,0.000016795786,0.0008110522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932003,0.00021814686,0.00002214363,0.00005027719,0.00027673878,0.00011270974],"domain_scores_gemma":[0.9971539,0.0021912146,0.00018391888,0.00015328152,0.00027423806,0.00004343523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668214,0.0006498533,0.00062427955,0.00054951926,0.00029958264,0.00070317485,0.00053625164,0.0004945304,0.0014426523],"category_scores_gemma":[0.004478148,0.00020145965,0.00035631974,0.0004975053,0.0007916277,0.001050629,0.00051375665,0.00048610847,0.00017989158],"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.00015659473,0.000045188397,0.00097157585,0.000070445385,0.00002728409,0.00033086294,0.00009392069,0.9433741,0.0068954043,0.036642432,0.00054665917,0.010845634],"study_design_scores_gemma":[0.000008743241,0.00006019377,0.0004319398,0.0000068991994,0.000015593025,0.00012493678,0.000037576876,0.9892216,0.0018972874,0.007996274,0.00019088118,0.000008127663],"about_ca_topic_score_codex":0.001577061,"about_ca_topic_score_gemma":0.0015790173,"teacher_disagreement_score":0.001577061,"about_ca_system_score_codex":0.0011522878,"about_ca_system_score_gemma":0.0006300266,"threshold_uncertainty_score":0.008360505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06028142,0.006480117,0.9064479,0.0012771002,0.0009377239,0.0004898383,0.0002398104,0.0068541425,0.016991949],"genre_scores_gemma":[0.80057514,0.0027071936,0.1904353,0.0005541672,0.00045504898,0.00036941754,0.00036323114,0.00020105773,0.00433944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896777,0.0002940004,0.0001259781,0.00012849268,0.00036601507,0.00011764834],"domain_scores_gemma":[0.9983455,0.0004224896,0.00016150204,0.0006116117,0.00032547614,0.00013342834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096646923,0.0006904786,0.00051048974,0.00072446186,0.00073384447,0.001612454,0.0017085432,0.0010640733,0.001369855],"category_scores_gemma":[0.0045707,0.00036334287,0.00047096782,0.00049632945,0.0004748287,0.0028300958,0.0025642554,0.0015026947,0.0005596586],"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.0007947111,0.00041292977,0.004125088,0.0015143987,0.00028486134,0.0024444698,0.0020695871,0.060281955,0.124534994,0.2598335,0.013182257,0.5305212],"study_design_scores_gemma":[0.00023917884,0.0006226413,0.0022176886,0.00039489247,0.00056998123,0.0024935154,0.0006473089,0.58061635,0.05949052,0.11632215,0.23613802,0.000247669],"about_ca_topic_score_codex":0.0010052123,"about_ca_topic_score_gemma":0.0010874025,"teacher_disagreement_score":0.0017085432,"about_ca_system_score_codex":0.00028110013,"about_ca_system_score_gemma":0.0006484122,"threshold_uncertainty_score":0.005111277},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24505281,0.0008380649,0.7431964,0.00021770693,0.00007795816,0.000045041208,0.00013753172,0.00023164661,0.010202873],"genre_scores_gemma":[0.99054366,0.00021890573,0.007926457,0.00003507054,0.0000162783,0.000018830198,0.00001907991,0.000005890434,0.0012158814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.00006450405,0.0000048553766,0.000031491556,0.00006864856,0.000056173772],"domain_scores_gemma":[0.99944896,0.0002799545,0.00010269273,0.00004727928,0.000078409554,0.0000427026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037140545,0.00033738595,0.00037032197,0.00023476576,0.0003133573,0.00054715294,0.0005169723,0.00041036727,0.0009967482],"category_scores_gemma":[0.0008543086,0.00022965249,0.00037624815,0.00031824855,0.0006182224,0.00065069186,0.00045866537,0.00042517696,0.00018405744],"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.00004500281,0.000025961335,0.0009892948,0.00004185883,0.000019589057,0.00020064782,0.00006396823,0.9647271,0.00886196,0.018205447,0.00034339676,0.0064756507],"study_design_scores_gemma":[0.0000020500975,0.000027557877,0.00030302323,0.000002160621,0.000004128999,0.00003676762,0.000011829674,0.99687564,0.00057220715,0.0020123855,0.00014862073,0.0000036365732],"about_ca_topic_score_codex":0.00269805,"about_ca_topic_score_gemma":0.0026889595,"teacher_disagreement_score":0.00269805,"about_ca_system_score_codex":0.0008856353,"about_ca_system_score_gemma":0.0002879468,"threshold_uncertainty_score":0.0064257383},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053575076,0.0002491632,0.94455254,0.00011810305,0.000029783854,0.000030900388,0.000027931248,0.00012953022,0.0012869866],"genre_scores_gemma":[0.8107348,0.000219931,0.1877959,0.00011567321,0.000042599724,0.000035292236,0.000048512436,0.000013024795,0.0009943182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956506,0.00011458122,0.000014732085,0.000056872508,0.00021408386,0.000034543576],"domain_scores_gemma":[0.9989981,0.00062843115,0.00012456311,0.00010492988,0.000111713045,0.00003230245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045318462,0.00032558915,0.00036036683,0.00029138784,0.0002117868,0.00035028177,0.00046195733,0.00044375684,0.0005303179],"category_scores_gemma":[0.0023323682,0.00014370821,0.000113785645,0.00029736562,0.00070142635,0.00080024375,0.0007102573,0.00050329097,0.00010763411],"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.0012810963,0.00019317595,0.0029959136,0.00037544454,0.000060668088,0.00070490636,0.00056028046,0.24604051,0.32698643,0.081358194,0.0024320337,0.33701125],"study_design_scores_gemma":[0.000019676865,0.00020197574,0.0004436649,0.000017743101,0.000010079842,0.00032638464,0.000053062424,0.96186894,0.02757665,0.0084324675,0.0010325606,0.000016729604],"about_ca_topic_score_codex":0.0005939923,"about_ca_topic_score_gemma":0.001069675,"teacher_disagreement_score":0.0005939923,"about_ca_system_score_codex":0.00018919048,"about_ca_system_score_gemma":0.00029780227,"threshold_uncertainty_score":0.0023967028},"labels":[],"label_agreement":null}]}