{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":104,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":104,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"70e00eb543d9","filters":{"venue":"2015 IEEE Global Communications Conference (GLOBECOM)"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2058394020014972,"gpt":0.346581816010288,"spread":0.1407424140087908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008127318,0.0002688499,0.0002588993,0.00008100766,0.0002249056,0.0002217343,0.001777422,0.0001860639,0.00004237486],"category_scores_gemma":[0.00007847098,0.0002396187,0.00008763333,0.0005309558,0.0001504598,0.0004210971,0.0001370003,0.0003483311,0.0001077306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004779373,"about_ca_system_score_gemma":0.0001682416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002332269,"about_ca_topic_score_gemma":0.0007618925,"domain_scores_codex":[0.9983351,0.0001910336,0.0005092239,0.0002404259,0.0002624343,0.0004617632],"domain_scores_gemma":[0.9972776,0.00009628871,0.00009481434,0.002062697,0.0003238758,0.0001447308],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004184109,0.0003471288,0.0009453113,0.00005544901,0.0001334485,0.000002566284,0.001852826,0.247981,0.001402421,0.06902232,0.6569262,0.02128943],"study_design_scores_gemma":[0.0008130433,0.00005666219,0.0002586655,0.00004088307,0.00003656037,0.00001866347,0.0009793977,0.8146343,0.000611301,0.004403897,0.1777424,0.0004042366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05387735,0.01037355,0.7362826,0.006748499,0.005888843,0.003890721,0.0004844137,0.001538024,0.1809159],"genre_scores_gemma":[0.99087,0.0005454423,0.006891255,0.0002031212,0.0003267733,0.0004608423,0.0003745996,0.0000270464,0.000300912],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9369926,"threshold_uncertainty_score":0.9771367,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Jitter; Ethernet; Ethernet flow control; Computer network; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05805133289761593,"gpt":0.3027737291750642,"spread":0.2447223962774483,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002334049,0.0003301749,0.0004298373,0.0000713113,0.0001160463,0.00005554667,0.001379477,0.0001535865,0.00001878822],"category_scores_gemma":[0.00004674139,0.0003017552,0.00002741984,0.0005253687,0.0004533436,0.000392021,0.0003778054,0.0003926929,0.00004024564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001980705,"about_ca_system_score_gemma":0.00008393435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000123155,"about_ca_topic_score_gemma":0.0009815721,"domain_scores_codex":[0.9983784,0.00008412638,0.0004684076,0.0002960997,0.0003639433,0.0004090509],"domain_scores_gemma":[0.9972404,0.00008795699,0.0001411788,0.002040854,0.0003221623,0.0001675108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001017067,0.006494066,0.4620256,0.0006417049,0.00224627,0.00003089076,0.008528163,0.1537501,0.003371951,0.03504023,0.03410374,0.2927502],"study_design_scores_gemma":[0.01367465,0.007595723,0.08115712,0.001314556,0.0007069216,0.0001037214,0.02203196,0.8315008,0.002356171,0.01224458,0.02277848,0.00453536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9797206,0.000716753,0.005656596,0.0001290422,0.00016193,0.0006570651,0.00004295979,0.0004684106,0.01244665],"genre_scores_gemma":[0.9831315,0.000901423,0.01571247,0.00002598579,0.0000188565,0.0001161592,0.00001280668,0.00002685,0.00005397573],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6777507,"threshold_uncertainty_score":0.9999434,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08496835250947447,"gpt":0.3131640900202471,"spread":0.2281957375107726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007369326,0.000336578,0.0003832154,0.0001258217,0.0001885768,0.0001744469,0.003809189,0.0002380571,0.00002654041],"category_scores_gemma":[0.0002225993,0.0003690775,0.00005335016,0.0008284002,0.0003056505,0.0008577069,0.0007832143,0.0006247261,0.0004448935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000416564,"about_ca_system_score_gemma":0.0003203575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008294319,"about_ca_topic_score_gemma":0.01371109,"domain_scores_codex":[0.9976974,0.0002855342,0.000620782,0.0004453358,0.0004037454,0.000547163],"domain_scores_gemma":[0.9950598,0.0001069065,0.0001176897,0.004089026,0.000307636,0.0003189399],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003397528,0.003242941,0.04627445,0.0006994327,0.000612452,0.0001246311,0.01967712,0.1013818,0.005398459,0.05554999,0.663245,0.103454],"study_design_scores_gemma":[0.002784703,0.0001148065,0.006307927,0.0005656397,0.00007100855,0.00005680253,0.00308743,0.8259799,0.001888774,0.009630065,0.1477758,0.001737091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8185305,0.007788033,0.01168214,0.003172745,0.005035762,0.001505978,0.001705586,0.001574964,0.1490043],"genre_scores_gemma":[0.9945467,0.002802755,0.001360888,0.0001545839,0.0001267661,0.00006006266,0.0008938875,0.00002376446,0.0000305548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7245982,"threshold_uncertainty_score":0.9998761,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.1614913619258457,"gpt":0.319582731107059,"spread":0.1580913691812133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009252771,0.0003451059,0.0003424349,0.0001860336,0.0004970995,0.0008857163,0.002928916,0.000208541,0.00001070744],"category_scores_gemma":[0.0002292363,0.0003816391,0.0001044147,0.0007934575,0.0003234266,0.001194686,0.0004320335,0.0002628883,0.0001185812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006580088,"about_ca_system_score_gemma":0.00043984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001868909,"about_ca_topic_score_gemma":0.0002864295,"domain_scores_codex":[0.997171,0.0002322264,0.0008158488,0.0007955058,0.0005209614,0.0004644374],"domain_scores_gemma":[0.9942646,0.000348482,0.000553852,0.003460289,0.001030113,0.0003426528],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001370351,0.00185869,0.007179077,0.00009782055,0.0001255419,0.000003129772,0.00153843,0.004024666,0.0761488,0.8203291,0.02899311,0.05956457],"study_design_scores_gemma":[0.002659102,0.000180338,0.009134507,0.0001552277,0.00005358391,0.00007320692,0.0002861941,0.9222057,0.003794539,0.02364088,0.03679812,0.00101863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008555139,0.0004428655,0.964735,0.02154448,0.0006237914,0.0009249464,0.00008288623,0.0003424472,0.0027484],"genre_scores_gemma":[0.8915219,0.0000451528,0.1075111,0.0003815345,0.00008146048,0.0001843058,0.0001444837,0.00002163455,0.0001084156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.918181,"threshold_uncertainty_score":0.9998636,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07429691881509605,"gpt":0.3076552326631586,"spread":0.2333583138480625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009073675,0.0003157833,0.0003468972,0.0001265978,0.0004532847,0.0003356017,0.006337116,0.0002944785,0.00003153082],"category_scores_gemma":[0.0001133317,0.0003240103,0.0001160564,0.001165219,0.0007861329,0.000754129,0.00134527,0.0004905482,0.0005257035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003574211,"about_ca_system_score_gemma":0.0005728378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001443631,"about_ca_topic_score_gemma":0.00012241,"domain_scores_codex":[0.9974554,0.0003781954,0.0006137853,0.0005408516,0.0005065792,0.0005052545],"domain_scores_gemma":[0.9935411,0.0001105756,0.00030239,0.00472899,0.0009680447,0.0003488541],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000005528828,0.000315284,0.0001810427,0.00001014345,0.00002043656,8.863612e-7,0.0004129836,0.00005220561,0.000007482573,0.9718465,0.02251801,0.004629536],"study_design_scores_gemma":[0.0009758154,0.00009025314,0.0003794967,0.00003164133,0.00003058916,0.0002528951,0.0006899805,0.3961442,0.00009061651,0.5100837,0.09063928,0.0005915664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002770309,0.0008307411,0.9065213,0.0145259,0.0003012462,0.0005758545,0.0001085859,0.0008064976,0.07355961],"genre_scores_gemma":[0.8870343,0.0001959802,0.1115123,0.0005856188,0.00005734142,0.0003427668,0.0001512175,0.000009761888,0.0001107238],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.884264,"threshold_uncertainty_score":0.9999212,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0915133012168476,"gpt":0.3562476778987927,"spread":0.2647343766819452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001023205,0.0003592227,0.0004204455,0.0001898805,0.0003422555,0.0001566999,0.001685795,0.0002802286,0.000005579641],"category_scores_gemma":[0.0000719497,0.0004420018,0.00009939766,0.0008711212,0.0001651656,0.000356524,0.0003491338,0.0003456291,0.00002110185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195974,"about_ca_system_score_gemma":0.0001864201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004662759,"about_ca_topic_score_gemma":0.002014278,"domain_scores_codex":[0.9974088,0.0005836444,0.0008843972,0.0003734649,0.0002427426,0.0005069296],"domain_scores_gemma":[0.9953715,0.0003871034,0.0002500104,0.003138056,0.0006081566,0.0002451855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002243227,0.000162848,0.00009088542,0.00002569251,0.00004145176,5.1966e-7,0.0003416291,0.9499419,0.0005561503,0.03543915,0.002803972,0.01057342],"study_design_scores_gemma":[0.0008867983,0.00003908128,0.00004427648,0.0001222408,0.00004606255,0.00001285667,0.0008701271,0.9817755,0.0001890566,0.001958569,0.01363418,0.0004212155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005943034,0.002942312,0.9854742,0.0009578678,0.0003426379,0.0008239149,0.00008870647,0.0004471212,0.008328984],"genre_scores_gemma":[0.8043768,0.0003547993,0.1935529,0.00008437513,0.00004674077,0.0004819201,0.001012729,0.00004663932,0.00004316083],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8037825,"threshold_uncertainty_score":0.9998032,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1407071307850266,"gpt":0.3676536604089858,"spread":0.2269465296239591,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009940895,0.0003918283,0.000458371,0.0001710136,0.0005700537,0.0002100538,0.003058877,0.0002488407,0.000005663901],"category_scores_gemma":[0.0002221365,0.000471038,0.0001236502,0.0008801856,0.0002554395,0.0005275289,0.0004942633,0.000311223,0.0001316021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001263006,"about_ca_system_score_gemma":0.0004334617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000292427,"about_ca_topic_score_gemma":0.001683798,"domain_scores_codex":[0.9975605,0.0002596429,0.0008026034,0.0004282694,0.000307338,0.0006416552],"domain_scores_gemma":[0.9930991,0.0005377191,0.0001627654,0.003940512,0.00179421,0.0004656984],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008675628,0.0004301265,0.0001871864,0.0002894116,0.0003314303,5.39324e-7,0.002503726,0.5311049,0.0005576764,0.05317347,0.05410791,0.3572268],"study_design_scores_gemma":[0.001014346,0.00009168574,0.00002693638,0.0001352738,0.00006595355,0.00001019341,0.002927144,0.8742985,0.0001717315,0.001436495,0.119345,0.0004767286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001838677,0.001426163,0.9840174,0.003009894,0.000277591,0.002652375,0.0005462701,0.0006519243,0.007234512],"genre_scores_gemma":[0.5515615,0.0001939303,0.4452336,0.0002662351,0.0000716667,0.001470954,0.0009667121,0.00007417463,0.0001612278],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5513777,"threshold_uncertainty_score":0.9997742,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.06590949104925675,"gpt":0.30601834052608,"spread":0.2401088494768233,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009675737,0.0006103565,0.0006781499,0.0002196262,0.000723561,0.0004441369,0.004371716,0.0004012021,0.00003818241],"category_scores_gemma":[0.0002956526,0.0006949608,0.0001959089,0.001041321,0.0005374364,0.0005324079,0.0007100191,0.000595696,0.0002189416],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001457445,"about_ca_system_score_gemma":0.0004566674,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005611564,"about_ca_topic_score_gemma":0.0009879166,"domain_scores_codex":[0.9965291,0.0006122662,0.001118296,0.0005059846,0.0005028328,0.0007315155],"domain_scores_gemma":[0.990185,0.0004670194,0.000384222,0.006200209,0.002295205,0.0004682989],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004054459,0.0003736113,0.0001364247,0.00003995583,0.0001338226,3.359982e-7,0.0008868506,0.9750891,0.0003428552,0.01494243,0.007215682,0.000798428],"study_design_scores_gemma":[0.001730159,0.00008241249,0.0002585454,0.0001722301,0.0000864812,0.00002342001,0.002639773,0.9869852,0.0000669588,0.00003241695,0.007206324,0.0007160521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1690458,0.009859571,0.8012955,0.002012206,0.001812072,0.0044579,0.001527295,0.002445289,0.007544391],"genre_scores_gemma":[0.9043308,0.00104378,0.09209733,0.00005792551,0.00003897849,0.001285926,0.0009504542,0.00009244547,0.0001023058],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.735285,"threshold_uncertainty_score":0.9995502,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08311168232316223,"gpt":0.3193312210767359,"spread":0.2362195387535737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001036422,0.0002834271,0.0004217569,0.0001617923,0.0002231203,0.0003667657,0.003805952,0.0002084169,0.00001709588],"category_scores_gemma":[0.0001777827,0.000296284,0.0001198009,0.001069475,0.0002389534,0.001258658,0.001174006,0.0004381158,0.00004567087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004043902,"about_ca_system_score_gemma":0.0005483745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003436515,"about_ca_topic_score_gemma":0.001118229,"domain_scores_codex":[0.9973785,0.0004934365,0.0007731621,0.0004715624,0.0004195978,0.0004638011],"domain_scores_gemma":[0.9952274,0.0001765241,0.0003750524,0.00291895,0.001065854,0.0002362456],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009531707,0.0005703425,0.05809722,0.00002286584,0.00008280457,0.00001238743,0.000947434,0.8739213,0.0001852137,0.04207869,0.00516613,0.01882029],"study_design_scores_gemma":[0.001010958,0.00006145751,0.002776137,0.000119995,0.0000175077,0.00001908625,0.0002592207,0.9939768,0.00002966198,0.0008071944,0.0005960111,0.0003259414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08882006,0.002433822,0.8858709,0.001481997,0.0008180267,0.0004620445,0.00003824851,0.0002918042,0.01978314],"genre_scores_gemma":[0.9786009,0.0004952145,0.02037915,0.0002244402,0.00003074906,0.00003849808,0.00004678104,0.00001189829,0.0001724132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8897808,"threshold_uncertainty_score":0.9999489,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08982215824629151,"gpt":0.2978578021378956,"spread":0.2080356438916041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006663335,0.0006926718,0.0007824917,0.0001733218,0.0005247653,0.000380924,0.005586798,0.000430664,0.0001078725],"category_scores_gemma":[0.0001875867,0.0007832902,0.0002701195,0.000899795,0.0005173115,0.0005352924,0.000826009,0.000680325,0.0008663206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009339753,"about_ca_system_score_gemma":0.0006444484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004895916,"about_ca_topic_score_gemma":0.003944918,"domain_scores_codex":[0.9965852,0.0003613495,0.001063521,0.0005592981,0.0004187911,0.00101183],"domain_scores_gemma":[0.9907864,0.0005362359,0.0003017661,0.006100729,0.001583871,0.0006909895],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002648105,0.001398556,0.0008620074,0.0004207375,0.0009814776,0.000009451272,0.002286794,0.4653449,0.02952899,0.1147196,0.3566364,0.02754622],"study_design_scores_gemma":[0.002027924,0.000126974,0.0001927502,0.0001507467,0.0001414818,0.00002103399,0.001379538,0.8868389,0.002015692,0.0007247788,0.1052931,0.001087068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6979225,0.007892976,0.2123408,0.01224454,0.004326563,0.006605113,0.004488298,0.004592098,0.04958707],"genre_scores_gemma":[0.9447466,0.00137535,0.05122142,0.0002025866,0.0001188684,0.0009780023,0.0006838182,0.0001089033,0.000564445],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4214939,"threshold_uncertainty_score":0.9999116,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04307966333898192,"gpt":0.2713759324600797,"spread":0.2282962691210978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006666076,0.0003337985,0.0003567252,0.00009344138,0.0001094673,0.000135316,0.001467748,0.000264569,0.00005741701],"category_scores_gemma":[0.00004383528,0.0003791195,0.00008672394,0.0007059619,0.0001488867,0.0003763143,0.0003066006,0.0005804966,0.0002841523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009698365,"about_ca_system_score_gemma":0.0001681903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000413961,"about_ca_topic_score_gemma":0.003087888,"domain_scores_codex":[0.9978412,0.0002389632,0.0006102462,0.0003061549,0.0003781518,0.0006252904],"domain_scores_gemma":[0.9970108,0.00004944369,0.00008873419,0.002222384,0.0002726943,0.0003559517],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009484959,0.0001026181,0.007023761,0.000009618058,0.0000530385,0.000005941076,0.00009644595,0.9447603,0.00002990286,0.004200283,0.03922836,0.004480211],"study_design_scores_gemma":[0.0007604942,0.00004002484,0.005080611,0.00008919658,0.0000289236,0.00001228442,0.0001703837,0.9638943,0.00001945719,0.002017546,0.02755447,0.0003323117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3880997,0.02886954,0.3158977,0.004774859,0.006590383,0.004109745,0.0005622137,0.004252331,0.2468435],"genre_scores_gemma":[0.9956269,0.001010323,0.002517608,0.0002020841,0.0001167387,0.0001574871,0.0002405134,0.00003373961,0.00009465611],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6075271,"threshold_uncertainty_score":0.9998661,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.198295395490307,"gpt":0.4005172549099296,"spread":0.2022218594196226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002020836,0.0004455309,0.0004954634,0.000132889,0.0005840708,0.0008184835,0.0159264,0.0002049362,0.00005297603],"category_scores_gemma":[0.0001680824,0.0004583995,0.0001807172,0.001810452,0.0006102766,0.001425057,0.007561892,0.0007565159,0.0009761665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001117037,"about_ca_system_score_gemma":0.0008231482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001362199,"about_ca_topic_score_gemma":0.0006526059,"domain_scores_codex":[0.9949781,0.001198088,0.000947503,0.0008199977,0.001150357,0.0009059053],"domain_scores_gemma":[0.9859434,0.0002149794,0.0003296879,0.01146222,0.001486966,0.0005627004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002863058,0.0008432731,0.0006901138,0.0000336647,0.0001450005,0.000008060446,0.001087972,0.001822126,0.00001382658,0.8545491,0.0278432,0.1129351],"study_design_scores_gemma":[0.001433282,0.0001897387,0.002769312,0.0002376095,0.00005742296,0.0000606538,0.001636142,0.5401974,0.0003045433,0.1861525,0.2656796,0.00128187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002240286,0.002869463,0.7984434,0.0162933,0.0008868759,0.001064284,0.0000443083,0.0006872411,0.1774708],"genre_scores_gemma":[0.8279891,0.002696314,0.1679452,0.0005977419,0.00005088944,0.0002614924,0.0000603003,0.00001928872,0.0003796539],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8257488,"threshold_uncertainty_score":0.9998017,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1680833079818882,"gpt":0.3221429367619527,"spread":0.1540596287800644,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002862345,0.0003330589,0.0003463945,0.00007146732,0.0002480071,0.0002378792,0.001042971,0.0002346338,0.00001393431],"category_scores_gemma":[0.000130914,0.0003868956,0.00009803583,0.0003548234,0.0000977727,0.0006673551,0.000172212,0.0002139101,0.00005366198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006543029,"about_ca_system_score_gemma":0.0001559933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008141818,"about_ca_topic_score_gemma":0.0007752342,"domain_scores_codex":[0.9983735,0.00008360873,0.0005834341,0.0003264093,0.0001755156,0.0004575487],"domain_scores_gemma":[0.9970877,0.00008541831,0.0001915561,0.001595539,0.0007827529,0.0002570518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001658845,0.00007920284,0.0001440176,0.00002949741,0.00009128141,5.033502e-7,0.0001700139,0.9736119,0.003908909,0.005334539,0.01136221,0.005251319],"study_design_scores_gemma":[0.000792996,0.00004522141,0.00001003632,0.00005932095,0.00003519331,0.00002416009,0.0001613178,0.9905146,0.0003942586,0.0003240326,0.007242503,0.0003963912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002324403,0.002100017,0.9890348,0.0003075929,0.001077367,0.001018861,0.0001786802,0.0004992591,0.003459053],"genre_scores_gemma":[0.8204476,0.0003783656,0.1778836,0.00006846054,0.0002184874,0.0004238088,0.0004565215,0.00004625739,0.00007693147],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8181232,"threshold_uncertainty_score":0.9998583,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1057839313496214,"gpt":0.327745442389916,"spread":0.2219615110402946,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003013531,0.0003480303,0.0003681974,0.0001465271,0.0002220865,0.0001721437,0.001771003,0.0002790944,0.0001202677],"category_scores_gemma":[0.0001340603,0.0003637508,0.00008824651,0.0009023139,0.0002985848,0.0003282186,0.0001344648,0.0002880868,0.0004233645],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005469032,"about_ca_system_score_gemma":0.0003325205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001772612,"about_ca_topic_score_gemma":0.0009358291,"domain_scores_codex":[0.9981252,0.0001543604,0.000617586,0.0002607027,0.0003992314,0.0004429268],"domain_scores_gemma":[0.9970077,0.00007061008,0.0001198631,0.002003412,0.0005659002,0.0002324656],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008575946,0.001277977,0.07523504,0.0007935213,0.0005327169,0.0000210812,0.002074068,0.3878904,0.0004051095,0.1036514,0.2024882,0.2255447],"study_design_scores_gemma":[0.0008602276,0.00005130698,0.0008424656,0.0001150988,0.00005786534,0.0000070483,0.0004983005,0.9597991,0.001191566,0.002791742,0.03330599,0.0004792737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0290101,0.002634822,0.9227505,0.002265027,0.001263339,0.00106293,0.0002977024,0.005543299,0.03517223],"genre_scores_gemma":[0.991375,0.000236758,0.007609185,0.0002726759,0.00002759798,0.0001303183,0.0002873713,0.00003363772,0.00002745388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9623649,"threshold_uncertainty_score":0.9998814,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05419210974851078,"gpt":0.284099364546231,"spread":0.2299072547977202,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001320756,0.0004057778,0.0005015749,0.00006473767,0.0008193527,0.0005991382,0.002528893,0.0003139844,0.000006498138],"category_scores_gemma":[0.0001680373,0.0004128299,0.00009910003,0.001132091,0.0002503253,0.0008188951,0.0006896976,0.0002686386,0.00001088635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002339669,"about_ca_system_score_gemma":0.0005270817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007225058,"about_ca_topic_score_gemma":0.00007142137,"domain_scores_codex":[0.9968178,0.0006228955,0.0007129874,0.0007348139,0.0004512966,0.0006602078],"domain_scores_gemma":[0.9951888,0.0003903133,0.0004674718,0.002446581,0.0009972655,0.0005095616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007460612,0.0001536788,0.0007351366,0.00001086881,0.00004305395,3.485461e-7,0.00026365,0.8009611,0.000001518049,0.1284754,0.05264169,0.0166389],"study_design_scores_gemma":[0.001699685,0.000324891,0.0001111145,0.00008988156,0.00005573616,0.00002196352,0.0002175711,0.9656973,0.000001437324,0.003175299,0.02815558,0.0004495599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002593927,0.002720651,0.9906061,0.001275773,0.0004623683,0.001380421,0.00004561132,0.000454011,0.002795688],"genre_scores_gemma":[0.5985789,0.0007287468,0.397752,0.001020225,0.0004303613,0.0007256272,0.000530289,0.00003634509,0.000197469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5983195,"threshold_uncertainty_score":0.9998323,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1408463862152347,"gpt":0.3839294724330211,"spread":0.2430830862177864,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001499632,0.0002942672,0.0004103059,0.00007597941,0.000267215,0.0004092002,0.004422208,0.0001181199,0.00001114739],"category_scores_gemma":[0.00006432104,0.0002911581,0.0001343145,0.0006242918,0.0001613362,0.0009762737,0.0007187656,0.0003159143,0.00004295799],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003508987,"about_ca_system_score_gemma":0.0008011399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006488839,"about_ca_topic_score_gemma":0.0002325773,"domain_scores_codex":[0.9971877,0.0005352891,0.0006565106,0.0005516044,0.000436053,0.0006327798],"domain_scores_gemma":[0.9958707,0.0001697765,0.0002135857,0.002985778,0.0004363862,0.0003237357],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001343978,0.002104053,0.00426219,0.0001064356,0.000109755,0.000009259095,0.001860161,0.005211862,0.00009411319,0.5824897,0.2278044,0.1758137],"study_design_scores_gemma":[0.002032631,0.000161753,0.001569653,0.0001028234,0.00002644523,0.00002305072,0.0002144481,0.8315589,0.00007816066,0.05567076,0.1079576,0.0006037561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001159183,0.0009908349,0.97321,0.003934878,0.0002802837,0.00079755,0.00005130509,0.0001782741,0.01939771],"genre_scores_gemma":[0.6664897,0.0001938064,0.3319084,0.0007919011,0.00006999011,0.0002312619,0.0001194918,0.00001162631,0.0001838264],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8263471,"threshold_uncertainty_score":0.999954,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0657653160746157,"gpt":0.3090291236470349,"spread":0.2432638075724192,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000700069,0.000461009,0.0006683301,0.00009683325,0.0006240369,0.0002597553,0.001346959,0.000157651,0.00002091155],"category_scores_gemma":[0.000005886082,0.000474259,0.0002433043,0.0006500377,0.0002960769,0.0001929563,0.0004872458,0.00029027,0.000004379963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002962503,"about_ca_system_score_gemma":0.0002834937,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001324053,"about_ca_topic_score_gemma":0.0006130633,"domain_scores_codex":[0.9971851,0.0004312534,0.0006862787,0.0006261854,0.0003295562,0.0007416708],"domain_scores_gemma":[0.9959658,0.0001662351,0.0003950915,0.002146038,0.0009385059,0.000388376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000830303,0.0008713566,0.002740264,0.0000103256,0.0001359681,1.911148e-7,0.0001119857,0.7358096,0.000009155448,0.2397669,0.0139079,0.006553396],"study_design_scores_gemma":[0.001201863,0.00005803101,0.0001860752,0.00005005167,0.0001509736,0.000002220319,0.0006869839,0.9816049,0.000004194771,0.00978451,0.00577503,0.0004951183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004206809,0.0007456958,0.9860876,0.0004431937,0.000101835,0.0007361696,0.0003614914,0.0002456096,0.007071578],"genre_scores_gemma":[0.9481782,0.00003604492,0.04966175,0.0001383879,0.0001901296,0.0004560414,0.001244586,0.00003316733,0.00006168357],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9439714,"threshold_uncertainty_score":0.9997709,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1482252038409785,"gpt":0.3575085389752852,"spread":0.2092833351343067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001663887,0.0003631953,0.0004426367,0.0001878893,0.0004599,0.0004895862,0.007630585,0.000272479,0.00001336219],"category_scores_gemma":[0.0004943259,0.0003861285,0.00009844635,0.001950698,0.0002655279,0.0008713988,0.001281553,0.0007818606,0.0005123224],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071755,"about_ca_system_score_gemma":0.000658722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003239187,"about_ca_topic_score_gemma":0.002127816,"domain_scores_codex":[0.9960001,0.001484715,0.0008586665,0.000616012,0.0004957916,0.0005447594],"domain_scores_gemma":[0.9914351,0.0003493823,0.0003579007,0.006488149,0.0009758267,0.0003936526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002089048,0.0004451881,0.003597587,0.0000197295,0.00003697838,0.000005712923,0.002745831,0.001485511,0.0000741654,0.9346572,0.01287395,0.04403725],"study_design_scores_gemma":[0.001783128,0.0001105975,0.006360197,0.0007685786,0.00002559131,0.0000610507,0.002955078,0.8519553,0.00008929671,0.002818413,0.132061,0.001011824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004475759,0.005398003,0.908172,0.01880858,0.0007982765,0.0009797642,0.0000275522,0.0009586428,0.06038148],"genre_scores_gemma":[0.8888847,0.00071136,0.1093789,0.000534184,0.00004394078,0.0001489266,0.00004708046,0.00001622284,0.0002347311],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9318388,"threshold_uncertainty_score":0.999859,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0677478186504631,"gpt":0.3236808569134698,"spread":0.2559330382630067,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007956985,0.000263356,0.0003205105,0.0001033396,0.0005959806,0.0003000794,0.004677109,0.0002908202,0.000008598947],"category_scores_gemma":[0.0003093596,0.0002743408,0.00007448976,0.0006711427,0.0003624779,0.0007846853,0.002198391,0.0003446644,0.00004907001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001855023,"about_ca_system_score_gemma":0.000322694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002915753,"about_ca_topic_score_gemma":0.0005894243,"domain_scores_codex":[0.9981349,0.0001784024,0.0004407591,0.0005860481,0.0002365906,0.0004233554],"domain_scores_gemma":[0.9943235,0.0001887596,0.0002440638,0.00406361,0.0008945818,0.000285521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001111577,0.0002190048,0.001605195,0.00001917349,0.00003892289,5.10703e-7,0.0005838603,0.000002868702,0.0001179309,0.968156,0.02179441,0.007450947],"study_design_scores_gemma":[0.001088391,0.0001314815,0.0006559879,0.00004146181,0.00002769263,0.00005254833,0.0003861334,0.3031731,0.0005526751,0.5209883,0.1723988,0.0005033685],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07141516,0.003646165,0.8561962,0.04960383,0.0005919533,0.001727669,0.0001568726,0.001347788,0.01531436],"genre_scores_gemma":[0.8820629,0.0003321219,0.1168758,0.0002709205,0.00003941117,0.0003237512,0.00003759436,0.00000948927,0.00004801579],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8106477,"threshold_uncertainty_score":0.9999709,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2025807585261301,"gpt":0.3786076535594674,"spread":0.1760268950333373,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001620499,0.0003671136,0.000442166,0.0002024398,0.0006727132,0.0004624427,0.006588932,0.0002380874,0.00001148715],"category_scores_gemma":[0.0004154275,0.0004016366,0.0001346418,0.001559861,0.0002750988,0.001198085,0.001548164,0.0005590752,0.0002019289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008006801,"about_ca_system_score_gemma":0.0007322694,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004950171,"about_ca_topic_score_gemma":0.009436069,"domain_scores_codex":[0.9966083,0.001100342,0.0008142449,0.0005618805,0.000364276,0.0005510101],"domain_scores_gemma":[0.9925963,0.0003214412,0.0003576696,0.004664903,0.00174875,0.0003109064],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007436245,0.002252839,0.01118873,0.00003584576,0.0001204043,0.000001572237,0.002935842,0.005978763,0.0007608453,0.8469716,0.04205223,0.08762697],"study_design_scores_gemma":[0.002058239,0.0001406002,0.001399905,0.0001535891,0.00002366285,0.00001740633,0.0003298984,0.9354295,0.000166975,0.002911124,0.05683345,0.0005357059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01287602,0.007860089,0.9521995,0.01508757,0.0005975554,0.001856269,0.00005539358,0.0008593704,0.008608254],"genre_scores_gemma":[0.7850444,0.002875757,0.2108634,0.0004120213,0.00002881087,0.0004429761,0.0001133287,0.00001777904,0.0002014919],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9294507,"threshold_uncertainty_score":0.9998435,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06126879896818959,"gpt":0.3023149399367901,"spread":0.2410461409686005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007590735,0.0003001186,0.0003820729,0.000119921,0.0002531066,0.0001852969,0.004564126,0.00009818004,0.000003779816],"category_scores_gemma":[0.00004733036,0.0002694755,0.00009476931,0.0009776384,0.0003174364,0.00007551653,0.0009226344,0.0002263668,0.00008776709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003086421,"about_ca_system_score_gemma":0.0006528503,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005874915,"about_ca_topic_score_gemma":0.0005265594,"domain_scores_codex":[0.9975317,0.0003275212,0.0005912812,0.0005082263,0.0006358104,0.0004054709],"domain_scores_gemma":[0.9944378,0.0001399632,0.0004771886,0.003982862,0.0007047488,0.0002574618],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004143171,0.004482511,0.03512442,0.0002498195,0.0005980814,0.00002096747,0.002628253,0.113059,0.001128418,0.5813267,0.06656652,0.194401],"study_design_scores_gemma":[0.001951086,0.00023353,0.0008794629,0.0001775131,0.00005777233,0.00001778624,0.0004508701,0.9434277,0.0003580372,0.001117844,0.05086343,0.0004649453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05675862,0.00061358,0.906063,0.007716591,0.0005420095,0.001395707,0.00004947903,0.0006205209,0.02624049],"genre_scores_gemma":[0.9477397,0.00001521978,0.05155121,0.0004194281,0.00005181648,0.0001299444,0.00002047956,0.00001359481,0.0000585812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8909811,"threshold_uncertainty_score":0.9999757,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03301349043186726,"gpt":0.2722268090658109,"spread":0.2392133186339437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003992318,0.0003234375,0.0003468306,0.00008407873,0.000253155,0.0001584448,0.001359967,0.0001845467,0.0001026709],"category_scores_gemma":[0.00009399356,0.0003573019,0.00009551173,0.000470835,0.0002747755,0.0006344783,0.0001741075,0.0002954586,0.0004216761],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003892169,"about_ca_system_score_gemma":0.00007484889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003836299,"about_ca_topic_score_gemma":0.00009383287,"domain_scores_codex":[0.9981446,0.0002747821,0.0006219358,0.0002682635,0.0002779728,0.0004124678],"domain_scores_gemma":[0.9970549,0.0001242747,0.0001620686,0.002053584,0.000415605,0.0001895526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001691562,0.0001910378,0.0003049248,0.0002224468,0.00008000641,5.09843e-7,0.000560344,0.1732161,0.0001772571,0.7967011,0.02199992,0.0065294],"study_design_scores_gemma":[0.00062924,0.00002976237,0.0001646746,0.00008863748,0.00003763009,0.00006118071,0.0003112276,0.9535104,0.00008055256,0.01652229,0.02807915,0.0004852564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007948469,0.0004150921,0.8541808,0.000390452,0.0004248245,0.0004336429,0.0001406035,0.0006543969,0.1425653],"genre_scores_gemma":[0.948788,0.000352631,0.04968488,0.0001143841,0.0001337773,0.0002110444,0.0005568679,0.00003388361,0.0001245357],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9479932,"threshold_uncertainty_score":0.9998879,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1017441981230134,"gpt":0.3386342963510567,"spread":0.2368900982280432,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008502451,0.0005474597,0.0006009881,0.0002239718,0.0004015057,0.0003143531,0.002532843,0.0003912553,0.000007671565],"category_scores_gemma":[0.0004269505,0.0006171752,0.0001553463,0.000697148,0.0002689779,0.0008457146,0.0003205021,0.0004080824,0.0001441287],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001080742,"about_ca_system_score_gemma":0.0004312082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000270834,"about_ca_topic_score_gemma":0.0003463116,"domain_scores_codex":[0.9971253,0.0003922431,0.0009838914,0.0004356927,0.0004621538,0.0006007213],"domain_scores_gemma":[0.99387,0.0005651413,0.0003781278,0.003749378,0.001098238,0.0003390847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007543503,0.0003533194,0.0003007194,0.0003272888,0.0001667318,7.145388e-7,0.0005613016,0.8975407,0.00063729,0.0431452,0.02928298,0.02760836],"study_design_scores_gemma":[0.0009600813,0.00009822999,0.00009633117,0.0002248199,0.00006691382,0.000008564506,0.0004050474,0.974528,0.0007964279,0.008580969,0.01356101,0.0006736341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002135001,0.002329076,0.9867955,0.0009642706,0.0006713541,0.001658407,0.0004460097,0.002214175,0.002786239],"genre_scores_gemma":[0.9532517,0.0004025744,0.04355408,0.0002004886,0.00006966251,0.001108992,0.001224486,0.00009092562,0.00009709609],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9511167,"threshold_uncertainty_score":0.9996279,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02806104229206929,"gpt":0.2661723039949445,"spread":0.2381112617028752,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006024977,0.0002774434,0.0004066582,0.0001333871,0.0003993113,0.0002769926,0.001140572,0.0002197875,0.00001099737],"category_scores_gemma":[0.00006924618,0.0003072366,0.0001175121,0.0006540109,0.0002183912,0.0002563035,0.0002207133,0.0002848545,0.00003199569],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002205985,"about_ca_system_score_gemma":0.00002445775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000582036,"about_ca_topic_score_gemma":0.00357326,"domain_scores_codex":[0.9983971,0.0002683522,0.0005298262,0.0002913659,0.0001614835,0.0003519252],"domain_scores_gemma":[0.9963449,0.0003604621,0.0001420539,0.002623338,0.0003721262,0.0001571675],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000341262,0.0002081794,0.02186771,0.0002223432,0.001640644,2.677797e-7,0.0003780171,0.8463784,0.00133345,0.07169881,0.008591193,0.04764685],"study_design_scores_gemma":[0.0003255944,0.00002732409,0.008811174,0.00007185032,0.0003013799,0.000006421746,0.00006376946,0.9759746,0.00008729508,0.0005862468,0.01340892,0.0003354304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08806223,0.002326943,0.8985466,0.0007102091,0.0005768133,0.0006479136,0.00008738621,0.0007086284,0.008333314],"genre_scores_gemma":[0.9879613,0.0008869219,0.01036786,0.00007290459,0.00006156268,0.0003261898,0.0002033785,0.00003023661,0.00008967848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8998991,"threshold_uncertainty_score":0.999938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1402441959210119,"gpt":0.3724722919477225,"spread":0.2322280960267106,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001862785,0.0004358504,0.0005909232,0.0002390322,0.0008538756,0.0006280294,0.008824962,0.0001636289,0.00001867077],"category_scores_gemma":[0.0006495472,0.0004887407,0.0001631688,0.001817703,0.0004097151,0.001303042,0.002940831,0.0005965209,0.0002241718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001049335,"about_ca_system_score_gemma":0.0005743286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002942275,"about_ca_topic_score_gemma":0.003929771,"domain_scores_codex":[0.9959939,0.001249836,0.001042883,0.0006398805,0.0004089394,0.0006645349],"domain_scores_gemma":[0.9890608,0.0007939085,0.0005199974,0.007683974,0.001568681,0.0003726411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001001944,0.0009559697,0.005150686,0.00002958872,0.0001313384,0.000002628897,0.002724672,0.004191793,0.00245158,0.8914253,0.02646704,0.06636918],"study_design_scores_gemma":[0.002115723,0.00007297775,0.001705302,0.0002170385,0.00002438331,0.00001514506,0.0003172202,0.9618334,0.0001062927,0.01274598,0.02027011,0.0005764693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00699836,0.001817208,0.9454224,0.02797572,0.0004516628,0.001681522,0.0002550406,0.0006743036,0.01472375],"genre_scores_gemma":[0.8991396,0.001074975,0.09829761,0.0003243258,0.00003580707,0.0003228695,0.0005927382,0.00002367937,0.0001884228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9576415,"threshold_uncertainty_score":0.9997564,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.8281249177914913,"gpt":0.646497618326707,"spread":0.1816272994647843,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","bibliometrics","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.02548872,0.0003280505,0.0005565184,0.009205179,0.0008111162,0.006475484,0.01380752,0.0002395119,0.0003373158],"category_scores_gemma":[0.03155397,0.0002755097,0.000138243,0.110299,0.0004285524,0.001417807,0.003736815,0.0005834753,0.005149337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009595435,"about_ca_system_score_gemma":0.002515993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001053694,"about_ca_topic_score_gemma":0.003553892,"domain_scores_codex":[0.9837805,0.001808443,0.001248242,0.001012824,0.01112211,0.001027857],"domain_scores_gemma":[0.9669909,0.0017275,0.0003261551,0.005637336,0.02341592,0.001902166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001880906,0.001253903,0.1334078,0.000009092262,0.0001018632,0.00001425652,0.002432873,0.0006266338,0.001552082,0.02522091,0.707171,0.1280215],"study_design_scores_gemma":[0.004182135,0.001381722,0.09573445,0.0001452556,0.00006332123,0.00004110996,0.03571169,0.05247083,0.001044484,0.06327222,0.7440118,0.001941013],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5614361,0.007183191,0.06431351,0.1103959,0.003747756,0.004322995,0.001492005,0.0004904867,0.2466181],"genre_scores_gemma":[0.9895717,0.0003866835,0.00765368,0.0005116736,0.00009804392,0.0001186152,0.00004821698,0.00001724749,0.00159416],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4281356,"threshold_uncertainty_score":0.9999697,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1116707322582937,"gpt":0.3545484315555816,"spread":0.2428776992972879,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001569864,0.0003632228,0.0004459609,0.0001925871,0.0009555194,0.0004447467,0.006582597,0.0002324454,0.00001855488],"category_scores_gemma":[0.0003889327,0.0003978688,0.0001503759,0.00132059,0.0002697098,0.0009463107,0.001337114,0.0005549539,0.0001746955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004656975,"about_ca_system_score_gemma":0.0002938882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003290942,"about_ca_topic_score_gemma":0.008581392,"domain_scores_codex":[0.9964703,0.001311147,0.0008010733,0.0005788021,0.0002928282,0.0005458654],"domain_scores_gemma":[0.992843,0.0005417023,0.0003639447,0.004960417,0.001096739,0.0001942075],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002440554,0.001033461,0.005254976,0.00002912262,0.00005798843,2.545426e-7,0.0007799181,0.002487449,0.0009867607,0.8713645,0.008819589,0.1091615],"study_design_scores_gemma":[0.001334959,0.0001092778,0.00272935,0.0001573717,0.0000201082,0.000009069513,0.0000859166,0.9333645,0.0001924651,0.00259828,0.05893469,0.0004640236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008281237,0.002418212,0.9710137,0.009845078,0.0003340357,0.001147643,0.00002660771,0.0005890013,0.00634447],"genre_scores_gemma":[0.7960113,0.002943091,0.1998408,0.0005087255,0.00003014165,0.0004022472,0.00009331262,0.00001710113,0.0001533376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.930877,"threshold_uncertainty_score":0.9998473,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Jitter; Ethernet; Ethernet flow control; Computer network; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02693266709747226,"gpt":0.2785840003173586,"spread":0.2516513332198863,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002219359,0.0003233412,0.0004289136,0.0000669403,0.0001578249,0.00005266479,0.001361538,0.0001485719,0.00002899165],"category_scores_gemma":[0.00004331328,0.0002956765,0.00003000356,0.0004405728,0.0004407337,0.0003095089,0.0003254147,0.00038568,0.00003520532],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001177086,"about_ca_system_score_gemma":0.0000353106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008400654,"about_ca_topic_score_gemma":0.0008893615,"domain_scores_codex":[0.9984517,0.00009672254,0.0004561509,0.0003008339,0.0002929294,0.0004016432],"domain_scores_gemma":[0.9972712,0.0001409213,0.0001414694,0.002136207,0.0002033899,0.0001068323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004993359,0.004297913,0.3274742,0.000730095,0.001570348,0.00000791134,0.003401313,0.09646554,0.005923969,0.0590702,0.01081329,0.4897459],"study_design_scores_gemma":[0.005760081,0.003783275,0.0964518,0.0008459067,0.0003807142,0.00003524703,0.003986252,0.8630485,0.001720386,0.006902127,0.01459563,0.002490089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9715746,0.0003255288,0.01411095,0.0001174395,0.0001289055,0.0005736657,0.00002943418,0.0004506462,0.01268885],"genre_scores_gemma":[0.9835571,0.0009429935,0.01525942,0.00003229146,0.00001999601,0.0001085109,0.00001072834,0.00002640264,0.0000425402],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.766583,"threshold_uncertainty_score":0.9999495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.2281611413124577,"gpt":0.3907579747991021,"spread":0.1625968334866443,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001992242,0.0003941046,0.0004487454,0.0001423986,0.0007820078,0.0009184466,0.02133674,0.0003091982,0.00001447579],"category_scores_gemma":[0.0004042535,0.0004241441,0.000111692,0.001490967,0.0002878593,0.001678175,0.006018003,0.0006667318,0.0001888974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005520859,"about_ca_system_score_gemma":0.001039006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006360097,"about_ca_topic_score_gemma":0.001148049,"domain_scores_codex":[0.9958081,0.0009591336,0.0007464015,0.0008903461,0.000738226,0.0008578065],"domain_scores_gemma":[0.9835611,0.0004612308,0.0003850181,0.01251892,0.002495057,0.0005786782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005224327,0.0005549621,0.0005281213,0.00002042979,0.0001418156,0.000001803594,0.0002327772,0.002848453,0.0002390512,0.7895043,0.159673,0.04620298],"study_design_scores_gemma":[0.0008001159,0.0001097623,0.00007435212,0.00004519114,0.00002766289,0.00001776139,0.0001240685,0.9404365,0.0001738148,0.01956433,0.03819435,0.0004320981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004987964,0.001271131,0.9824367,0.008530149,0.001043458,0.001191525,0.0001388322,0.0005582495,0.004331147],"genre_scores_gemma":[0.8067556,0.0008105782,0.1906171,0.0003179754,0.000286999,0.0004111418,0.000479118,0.00002930208,0.0002922305],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.937588,"threshold_uncertainty_score":0.9998211,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.101263160890229,"gpt":0.3449932718119573,"spread":0.2437301109217282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001281005,0.0003723535,0.0004123518,0.000157148,0.001253721,0.0007229958,0.01593944,0.0002112618,0.00002282832],"category_scores_gemma":[0.0006822083,0.0004078457,0.0002305848,0.001147503,0.0004838018,0.001632538,0.004920539,0.0004360763,0.0001095789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001627535,"about_ca_system_score_gemma":0.0003328598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008835022,"about_ca_topic_score_gemma":0.002715567,"domain_scores_codex":[0.9971731,0.0004246757,0.0007357224,0.0006552433,0.0004109899,0.0006002255],"domain_scores_gemma":[0.984472,0.0007295344,0.0004569392,0.01306284,0.0009859613,0.0002927377],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001401863,0.0004282557,0.002147972,0.00003732213,0.00006270995,1.151345e-7,0.0004441772,0.00001153557,0.0005417923,0.9516348,0.02827427,0.01640306],"study_design_scores_gemma":[0.001348537,0.0001176518,0.003861864,0.0001603554,0.00005028238,0.00002587663,0.0001581616,0.4976329,0.0001797783,0.0917941,0.4039364,0.0007340507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001820395,0.0006387223,0.9701657,0.01481055,0.0005393591,0.0008918271,0.0009320027,0.0004923418,0.009709056],"genre_scores_gemma":[0.4941369,0.0004477208,0.503647,0.0005890735,0.0000707195,0.0002924958,0.0007844626,0.00001432743,0.00001734333],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8598407,"threshold_uncertainty_score":0.9998373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05364715362380884,"gpt":0.2894909691462616,"spread":0.2358438155224528,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004877164,0.0002979704,0.0003563963,0.0002206758,0.00007515855,0.0000796407,0.0009905973,0.0002497397,0.00001289856],"category_scores_gemma":[0.0002246283,0.0003498454,0.00005659873,0.0007524954,0.00008031817,0.0002869196,0.00009837518,0.0002707175,0.00006560552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008834259,"about_ca_system_score_gemma":0.0001649743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000288755,"about_ca_topic_score_gemma":0.004072997,"domain_scores_codex":[0.9981467,0.0002232941,0.0007237438,0.0003320342,0.0001796481,0.0003946185],"domain_scores_gemma":[0.9976357,0.0002243843,0.0001675672,0.001442382,0.000373729,0.0001562142],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009995695,0.000279115,0.0009170428,0.0000549899,0.0000234047,0.00000101707,0.001133554,0.9675746,0.0005103519,0.01541249,0.01065788,0.0033356],"study_design_scores_gemma":[0.003389529,0.0001516706,0.0006368395,0.0004616982,0.00002795398,0.000004573397,0.001291957,0.9670898,0.000649417,0.004971224,0.02055096,0.0007743182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07120767,0.001800884,0.8787228,0.003134376,0.001804792,0.004504675,0.00062806,0.0008816601,0.03731512],"genre_scores_gemma":[0.9803666,0.0002532088,0.01828155,0.0001216299,0.00003922398,0.0004525146,0.0003359881,0.00004160639,0.0001076213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.909159,"threshold_uncertainty_score":0.9998953,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.08714631431027008,"gpt":0.3274911901051311,"spread":0.240344875794861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008483365,0.0004729532,0.000550637,0.0001327187,0.0006223308,0.000697164,0.003002791,0.0002177518,0.000007102383],"category_scores_gemma":[0.0001689782,0.0005122963,0.0002293955,0.001060039,0.0003462186,0.0006933705,0.0006050006,0.0004817471,0.00004494264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005833539,"about_ca_system_score_gemma":0.0008918907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004508555,"about_ca_topic_score_gemma":0.0004568209,"domain_scores_codex":[0.9969619,0.0002699284,0.0006112152,0.0007576106,0.0004778667,0.0009214628],"domain_scores_gemma":[0.9950488,0.0006363487,0.0003543862,0.002231179,0.001186247,0.0005430899],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001632268,0.001629105,0.003761108,0.0000282045,0.000484273,0.00002904997,0.0007836273,0.006394281,0.0001430427,0.09670825,0.01290718,0.8769687],"study_design_scores_gemma":[0.00236578,0.0002139248,0.001306409,0.0002137851,0.00007114969,0.00006498118,0.0002395459,0.9866867,0.0002165099,0.004109446,0.00387157,0.0006401644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00073063,0.001476929,0.9870833,0.00318873,0.001393622,0.0008534153,0.0001437707,0.0004065449,0.004723019],"genre_scores_gemma":[0.7597141,0.0001696066,0.2391625,0.0002854682,0.0003893909,0.0001091646,0.0000786072,0.0000253125,0.00006583389],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9802924,"threshold_uncertainty_score":0.9997329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04442127510991538,"gpt":0.280759597812088,"spread":0.2363383227021726,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002844449,0.0003274217,0.000380071,0.000157834,0.0001302864,0.00009973636,0.001018683,0.0002162756,0.000007154622],"category_scores_gemma":[0.0001349599,0.0003428266,0.00002801978,0.0005276895,0.0007458153,0.0005975518,0.0003640119,0.0005468991,0.00001630276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004911475,"about_ca_system_score_gemma":0.0001576022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003394243,"about_ca_topic_score_gemma":0.002682079,"domain_scores_codex":[0.9984803,0.0001731708,0.0004954541,0.0002981422,0.0002042849,0.0003486815],"domain_scores_gemma":[0.9977697,0.000181114,0.0001768511,0.001343433,0.0003773863,0.0001515562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001885407,0.0002867187,0.01286258,0.00008352871,0.0001381454,0.000006807813,0.00153723,0.6524065,0.0001214324,0.01296525,0.0006927666,0.3187105],"study_design_scores_gemma":[0.001106358,0.00009332899,0.01481661,0.0003204257,0.00002029289,0.00003311958,0.001454905,0.9779028,0.00008311506,0.003655747,0.00009018977,0.0004230891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07539867,0.001689828,0.9148029,0.000698286,0.0001445781,0.0006965951,0.0000779537,0.0007282518,0.005762941],"genre_scores_gemma":[0.9777789,0.001258057,0.02044444,0.00004288787,0.00001163479,0.0001848352,0.0002464301,0.00002494461,0.00000789189],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9023802,"threshold_uncertainty_score":0.9999024,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07387584870307928,"gpt":0.2732127955589944,"spread":0.1993369468559151,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007427476,0.0003166655,0.0003503497,0.00007620548,0.0002618514,0.0001366033,0.003554948,0.0001736805,0.00004299305],"category_scores_gemma":[0.00009380916,0.0002562785,0.00009980614,0.0007232439,0.0006210397,0.0001877475,0.0003739366,0.0005735322,0.0001184176],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000234477,"about_ca_system_score_gemma":0.0001816167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000280119,"about_ca_topic_score_gemma":0.0005150927,"domain_scores_codex":[0.9978627,0.0006415009,0.0005025355,0.000205647,0.000450707,0.0003369111],"domain_scores_gemma":[0.9927245,0.0002028798,0.0002092692,0.005987421,0.0006682397,0.0002076958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001746103,0.000900002,0.001378948,0.0000757693,0.0006780653,0.000004086612,0.002402511,0.05047147,0.002780567,0.8609318,0.06925251,0.01094971],"study_design_scores_gemma":[0.005728645,0.001217734,0.002162623,0.001524592,0.0005085025,0.0001475796,0.004030698,0.6064779,0.01751507,0.05160296,0.3056748,0.003408851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.3761009,0.01080214,0.1246071,0.02045585,0.0008150271,0.002718503,0.0003305404,0.001267872,0.462902],"genre_scores_gemma":[0.9919541,0.0008027578,0.006545332,0.0003609037,0.00001449168,0.0001340969,0.0001019498,0.00003185478,0.00005451695],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8093288,"threshold_uncertainty_score":0.999989,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.08158860634591454,"gpt":0.2961147823282241,"spread":0.2145261759823096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002839478,0.0003046685,0.0004690691,0.000160079,0.0001036034,0.00009063743,0.0009709685,0.0001662888,0.00001071981],"category_scores_gemma":[0.00005678205,0.0003445031,0.00008710898,0.0005618617,0.0004765698,0.0002639295,0.000153618,0.000399117,0.00003420453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003355054,"about_ca_system_score_gemma":0.0001128116,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002085406,"about_ca_topic_score_gemma":0.008123577,"domain_scores_codex":[0.9982599,0.0002192597,0.0005792269,0.0002648184,0.0002732269,0.000403572],"domain_scores_gemma":[0.9976045,0.00008903888,0.000161022,0.001772263,0.0002129281,0.0001602454],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0007685782,0.002517179,0.02928787,0.0005601801,0.0007794171,0.0001029269,0.004745638,0.08299743,0.6987567,0.06668551,0.02345713,0.08934142],"study_design_scores_gemma":[0.002096057,0.000194486,0.01418843,0.0009968174,0.00009077775,0.0001188744,0.0009131262,0.3796447,0.4827939,0.1145871,0.003008999,0.001366721],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7698585,0.002098339,0.1825564,0.001256587,0.0008661019,0.0008045465,0.0001381086,0.001442635,0.04097876],"genre_scores_gemma":[0.9954983,0.0004051436,0.003949465,0.00003623809,0.00004082593,0.00000766727,0.00002884747,0.00002509205,0.000008428633],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2966473,"threshold_uncertainty_score":0.9999007,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Zoning; Process (computing); Computer network; Computer security; Operating system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.07871567800747788,"gpt":0.3239924517962259,"spread":0.2452767737887481,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006004937,0.0003055292,0.0003486127,0.0001049821,0.000137163,0.0001356458,0.001458201,0.000171148,0.0000186067],"category_scores_gemma":[0.0001318731,0.0003209584,0.00004642589,0.0006515693,0.0001538731,0.0003476588,0.00009655199,0.0003885194,0.00002709219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004376931,"about_ca_system_score_gemma":0.0005126948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001827113,"about_ca_topic_score_gemma":0.002668449,"domain_scores_codex":[0.9983341,0.0001076361,0.0004543195,0.0002967428,0.0002559939,0.000551278],"domain_scores_gemma":[0.9975109,0.0001971777,0.0001208737,0.001466864,0.0004717478,0.0002324856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009592326,0.0002017478,0.02382963,0.0001882098,0.00007571026,0.000008711401,0.0005925777,0.9420722,0.00008380642,0.01357413,0.01020836,0.009069047],"study_design_scores_gemma":[0.001533573,0.0001021046,0.0008122341,0.0004531514,0.00003342319,0.0000173622,0.0004347005,0.9830843,0.000267512,0.001323157,0.01135989,0.0005785902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2074251,0.001958209,0.6307172,0.00305619,0.001544658,0.002678864,0.0005101716,0.003307263,0.1488024],"genre_scores_gemma":[0.9548776,0.0000555758,0.0441883,0.0001081105,0.00004726694,0.0003854798,0.0002261873,0.00004760543,0.00006390252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7474525,"threshold_uncertainty_score":0.9999242,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1727433881033274,"gpt":0.335392778933646,"spread":0.1626493908303186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001493397,0.0005280804,0.0005846798,0.0001324726,0.0003062204,0.0003280998,0.004741539,0.0004166946,0.00006070652],"category_scores_gemma":[0.0002228446,0.0005875666,0.0001310419,0.0007316754,0.0008042353,0.0009883626,0.0007370969,0.0009457467,0.0001409637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008198475,"about_ca_system_score_gemma":0.0004623971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002959034,"about_ca_topic_score_gemma":0.0004874982,"domain_scores_codex":[0.9964396,0.001107252,0.0008944921,0.0005075404,0.0004551246,0.0005959733],"domain_scores_gemma":[0.9920769,0.0001757543,0.0002065704,0.006062473,0.0009275672,0.0005507815],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003946617,0.006061824,0.009045357,0.0007335648,0.00107125,0.00001585098,0.02941088,0.03795535,0.004892102,0.571498,0.2085864,0.1303347],"study_design_scores_gemma":[0.00194815,0.0003406726,0.0008539076,0.0002870148,0.0001453869,0.0001656364,0.005905962,0.8951044,0.001056422,0.05436645,0.03760982,0.002216194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04164082,0.002386924,0.8043358,0.002117669,0.0005007238,0.002749123,0.000375126,0.005948258,0.1399455],"genre_scores_gemma":[0.7768188,0.0003486709,0.2220597,0.000099173,0.00003242619,0.0003256266,0.0002478797,0.00004378326,0.00002393547],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8571491,"threshold_uncertainty_score":0.9996576,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1996220426506125,"gpt":0.3754777279001943,"spread":0.1758556852495818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001968098,0.0005110392,0.0005541626,0.0002073407,0.001026341,0.001068489,0.007847212,0.0002074502,0.00001429034],"category_scores_gemma":[0.0003282125,0.0004673158,0.0001511323,0.002503189,0.000459814,0.001193681,0.001653516,0.0005668527,0.000144206],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004906689,"about_ca_system_score_gemma":0.0008555106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000156014,"about_ca_topic_score_gemma":0.0008972654,"domain_scores_codex":[0.9961809,0.0009664966,0.0007437141,0.0007658484,0.0005096198,0.000833415],"domain_scores_gemma":[0.9898593,0.000699929,0.0004518366,0.005858233,0.002558869,0.0005717921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004385723,0.001470272,0.004898929,0.00003291446,0.0004523057,0.0000112026,0.001869692,0.1415865,0.00006418944,0.5823567,0.1316895,0.1351293],"study_design_scores_gemma":[0.002597558,0.0003896504,0.0009898525,0.0001087357,0.00004399285,0.00005381789,0.0001014243,0.9564922,0.00008328453,0.003471269,0.03490267,0.000765565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006884931,0.00408454,0.9738374,0.004768844,0.0005466905,0.001234614,0.00003250805,0.0004494972,0.01435744],"genre_scores_gemma":[0.8259284,0.001329835,0.1708123,0.0008180404,0.00009570248,0.0004700343,0.00006177954,0.00002887144,0.0004550143],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.82524,"threshold_uncertainty_score":0.9999685,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04200556769959409,"gpt":0.2749384162343494,"spread":0.2329328485347553,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002709755,0.0002994118,0.0004701202,0.0001512874,0.0001435361,0.00008654688,0.0009569384,0.000161201,0.00001682039],"category_scores_gemma":[0.00005260808,0.0003390414,0.00009634226,0.000470714,0.0004637828,0.0002072355,0.0001313344,0.0003929918,0.00002949838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001966655,"about_ca_system_score_gemma":0.00004616897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001425737,"about_ca_topic_score_gemma":0.007415309,"domain_scores_codex":[0.9982917,0.0002561761,0.000565621,0.0002703254,0.0002190596,0.0003971518],"domain_scores_gemma":[0.9975966,0.0001456368,0.0001621441,0.001861521,0.0001331583,0.0001009207],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002296691,0.001024646,0.01250134,0.0004000768,0.000335739,0.00001573663,0.001142428,0.0313663,0.7813586,0.07113939,0.004471406,0.09601465],"study_design_scores_gemma":[0.00105034,0.000115871,0.02089092,0.0007808107,0.00005911919,0.00004864209,0.0001900073,0.4725927,0.4220846,0.07894287,0.002337612,0.0009065073],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6077149,0.0007657054,0.353233,0.0009515625,0.0005694901,0.0005801312,0.00007798678,0.001157389,0.03494987],"genre_scores_gemma":[0.9956004,0.000421021,0.003826514,0.00004545147,0.00004386387,0.000007067156,0.00002429014,0.00002481571,0.000006548505],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4412264,"threshold_uncertainty_score":0.9999062,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02031134921880774,"gpt":0.2533467546267723,"spread":0.2330354054079646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005095231,0.0004515588,0.0005754963,0.00006528007,0.0003489155,0.0003308699,0.001329927,0.0002240912,0.00002397992],"category_scores_gemma":[0.0002742142,0.0004440728,0.00007171863,0.0002490201,0.0005836052,0.000236773,0.0001104824,0.0003664599,0.00002587869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002630902,"about_ca_system_score_gemma":0.0001970633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003987142,"about_ca_topic_score_gemma":0.0007364173,"domain_scores_codex":[0.9976339,0.0002830383,0.0006625457,0.0003933059,0.0003008143,0.0007263381],"domain_scores_gemma":[0.9958134,0.00140933,0.0001912629,0.001680556,0.0005622094,0.0003432199],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002823497,0.00005090522,0.0001338077,0.0000335043,0.0001281868,0.000001762525,0.00003233557,0.735001,0.00003851775,0.2590921,0.00229515,0.003164496],"study_design_scores_gemma":[0.001199085,0.0001682357,0.000209994,0.0002620012,0.00009849115,0.00008925514,0.000119442,0.9897286,0.000006591061,0.0004957178,0.007076118,0.0005464818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002812401,0.0004740985,0.9844308,0.000165185,0.0005245897,0.0004030957,0.0005014265,0.0006369664,0.01005137],"genre_scores_gemma":[0.9473114,0.00002858328,0.05187685,0.000088361,0.0001035202,0.0002772781,0.0001782391,0.00006214417,0.00007361677],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.944499,"threshold_uncertainty_score":0.9998011,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1254991709095276,"gpt":0.3416904648624643,"spread":0.2161912939529367,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001090307,0.0002771449,0.0003245545,0.0001056156,0.000488339,0.000619039,0.003547255,0.0001117852,0.000008856032],"category_scores_gemma":[0.0002167535,0.0002779339,0.00008760953,0.0007548919,0.0002060939,0.0002807709,0.00206799,0.0002632834,0.0001429947],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004082014,"about_ca_system_score_gemma":0.0003033749,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006390121,"about_ca_topic_score_gemma":0.0002148554,"domain_scores_codex":[0.9973917,0.0006252283,0.0005736834,0.0004942971,0.0004878609,0.0004272199],"domain_scores_gemma":[0.9956327,0.0001234284,0.0003624733,0.002942715,0.0006520074,0.0002866601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003012496,0.002048934,0.02829004,0.0001568901,0.0006098817,0.00004400912,0.006613004,0.09811211,0.001031974,0.5832,0.06595164,0.2136403],"study_design_scores_gemma":[0.002100098,0.00004236271,0.0006338623,0.0001378263,0.00003678612,0.00004191353,0.0003686949,0.982802,0.00003210097,0.002879988,0.010567,0.0003573066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09316245,0.000645587,0.8773735,0.005526382,0.001079708,0.0006603448,0.00003606257,0.0005672898,0.02094864],"genre_scores_gemma":[0.9316465,0.00003476886,0.06764372,0.0003624583,0.00008560148,0.00002149647,0.00005504043,0.0000115637,0.0001388944],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8846899,"threshold_uncertainty_score":0.9999673,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06012163465902565,"gpt":0.3265022655987379,"spread":0.2663806309397123,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006420354,0.0004716624,0.0005300755,0.000140041,0.0004168185,0.001001513,0.01213103,0.0002912376,0.00000306401],"category_scores_gemma":[0.0003040786,0.0004476166,0.0001789828,0.001545528,0.0004243357,0.0009920564,0.003790239,0.0005004858,0.0001574266],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004844792,"about_ca_system_score_gemma":0.0007004244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004092663,"about_ca_topic_score_gemma":0.002499595,"domain_scores_codex":[0.9967422,0.0002849599,0.0006087432,0.000821707,0.0006223848,0.0009199352],"domain_scores_gemma":[0.9925972,0.0002837256,0.0002438441,0.005494421,0.0008294758,0.0005512947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001390909,0.0005820668,0.003391916,0.00005339099,0.0001637048,0.00001009734,0.0007021803,0.002093515,0.000118888,0.7502738,0.138168,0.1043033],"study_design_scores_gemma":[0.002120403,0.0005910708,0.004519078,0.0002353484,0.00007788114,0.0001388418,0.0006154052,0.1116221,0.0002494647,0.3963708,0.4819187,0.001540953],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007814534,0.0006326411,0.9373276,0.04583294,0.0006628145,0.0009905915,0.001287101,0.001230989,0.0042208],"genre_scores_gemma":[0.7817089,0.00005554001,0.2164755,0.0009318782,0.00007923372,0.0003193229,0.0002951494,0.00001587134,0.0001186348],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7738944,"threshold_uncertainty_score":0.9997976,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.04684814527069362,"gpt":0.2904714724238442,"spread":0.2436233271531506,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001285273,0.0003406538,0.0004631496,0.00007559103,0.0006180162,0.0003132728,0.002432357,0.0001701873,0.00000607741],"category_scores_gemma":[0.0003252951,0.0002787957,0.000107597,0.0008532199,0.0007202679,0.0006603678,0.001221556,0.000637862,0.00004284336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001957405,"about_ca_system_score_gemma":0.000494995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006673532,"about_ca_topic_score_gemma":0.002676285,"domain_scores_codex":[0.997248,0.00055598,0.0006893691,0.0004922003,0.0004375615,0.0005769241],"domain_scores_gemma":[0.9952899,0.0009516886,0.0004372566,0.002030167,0.0009951619,0.0002958033],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006950832,0.001676985,0.1356095,0.0001596668,0.001340668,0.00003722164,0.01661534,0.02826588,0.0007540884,0.2719362,0.01407413,0.5288352],"study_design_scores_gemma":[0.001121542,0.0002300442,0.008237403,0.0004097075,0.00007994883,0.0001091872,0.0009019697,0.9849821,0.0002391285,0.0006723712,0.002544091,0.00047255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3257428,0.004836979,0.6541601,0.003594656,0.0007980161,0.0009379325,0.00005102735,0.0002666307,0.009611762],"genre_scores_gemma":[0.9871277,0.001493616,0.01079737,0.0003699094,0.00008177826,0.00003253186,0.00002391624,0.00001400024,0.00005918897],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9567162,"threshold_uncertainty_score":0.9999664,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02067841135837278,"gpt":0.2677802557128315,"spread":0.2471018443544588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002478652,0.0002255915,0.0002583008,0.00004946593,0.0003133667,0.0001516985,0.001071914,0.000181881,0.00004848991],"category_scores_gemma":[0.0001232009,0.0002313863,0.00006225599,0.0002537518,0.00009843911,0.0003870382,0.0002653205,0.000279911,0.00002058477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001234514,"about_ca_system_score_gemma":0.00004488851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009299283,"about_ca_topic_score_gemma":0.0003316779,"domain_scores_codex":[0.9989063,0.00008130819,0.0003099255,0.0002318325,0.0001285585,0.0003420845],"domain_scores_gemma":[0.9980046,0.0001401059,0.00007880497,0.001382928,0.0002472419,0.0001463917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008744442,0.0002745034,0.01815595,0.0007138086,0.0005017697,9.289109e-7,0.001531241,0.0009861898,0.01368125,0.5748642,0.2795198,0.1096829],"study_design_scores_gemma":[0.0007596656,0.00008953385,0.002803632,0.0000723799,0.00004412924,0.00002036815,0.0001051997,0.704145,0.001207604,0.06037098,0.2299146,0.0004669631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6655136,0.007093955,0.2174962,0.008091067,0.001840518,0.002063724,0.0004367867,0.001915252,0.09554891],"genre_scores_gemma":[0.9858074,0.0007314148,0.01305775,0.0001152303,0.00009775592,0.00006565826,0.00006534046,0.00002004026,0.0000394134],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7031587,"threshold_uncertainty_score":0.9435659,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03963225574957347,"gpt":0.2729814665412121,"spread":0.2333492107916386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005315178,0.0004590355,0.000573135,0.00006935892,0.000250534,0.0003461712,0.001346771,0.0002308319,0.00001512962],"category_scores_gemma":[0.0002924769,0.0004509318,0.0000648421,0.0002986707,0.0005977756,0.0003028212,0.0001294955,0.000371905,0.00003010497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000452276,"about_ca_system_score_gemma":0.0004850651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005902013,"about_ca_topic_score_gemma":0.000812948,"domain_scores_codex":[0.9975854,0.000241137,0.0006766021,0.0003847898,0.0003759549,0.000736173],"domain_scores_gemma":[0.9959201,0.0008435519,0.0001894054,0.001599534,0.0009015654,0.0005458977],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000514757,0.00006772362,0.0001703968,0.00002499689,0.0001601228,0.000006316425,0.00007355626,0.8448315,0.00001836132,0.1464135,0.006615276,0.001566795],"study_design_scores_gemma":[0.001701993,0.0002005705,0.0001013494,0.0002361631,0.0001072411,0.000155936,0.0004161354,0.9894705,0.000005381285,0.0005211241,0.006497893,0.0005857569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00314276,0.001109121,0.9830487,0.0001858479,0.0006737339,0.0004726005,0.0007468412,0.0006732405,0.009947207],"genre_scores_gemma":[0.9461042,0.0000278305,0.05303698,0.0000703178,0.00009608575,0.0002964389,0.0002110976,0.00006269986,0.0000943808],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9429614,"threshold_uncertainty_score":0.9997942,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06270134270456333,"gpt":0.3044923533574463,"spread":0.2417910106528829,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001464377,0.0004924685,0.0004503402,0.00008490068,0.0006121909,0.0007824777,0.006534431,0.0003005205,0.00003437663],"category_scores_gemma":[0.0002812054,0.0005284303,0.0001415833,0.001582896,0.000210061,0.000991397,0.001111602,0.0004918375,0.0003165986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009130265,"about_ca_system_score_gemma":0.001216734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003644856,"about_ca_topic_score_gemma":0.0007316347,"domain_scores_codex":[0.9957152,0.0008900531,0.0008088993,0.0008313619,0.0009275191,0.0008269761],"domain_scores_gemma":[0.991642,0.0002941637,0.0005209515,0.005572438,0.001434908,0.0005355298],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002372362,0.0002223101,0.001571825,0.000005019225,0.00002173321,0.00000275282,0.00009796126,0.9160894,0.000001216243,0.04215321,0.02192303,0.01788782],"study_design_scores_gemma":[0.000982656,0.0001483713,0.0005864771,0.0001586274,0.00002578792,0.00001055773,0.00006513591,0.9895644,0.000005708596,0.001959869,0.005970276,0.0005221599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0000899255,0.0002730735,0.9637901,0.005051571,0.001093819,0.0007819994,0.00004843095,0.0007133433,0.02815772],"genre_scores_gemma":[0.7053251,0.00008512105,0.2926777,0.001309337,0.0001556986,0.0001358862,0.0002337176,0.00002088403,0.00005654665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7052352,"threshold_uncertainty_score":0.9997167,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05973339818328947,"gpt":0.3023882915081686,"spread":0.2426548933248791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004178562,0.0003575875,0.0004172636,0.0001277795,0.0001309761,0.0001221767,0.001085341,0.0002475345,0.00002487189],"category_scores_gemma":[0.0001771715,0.0004310672,0.00008383446,0.0007353461,0.0001689286,0.0003906815,0.0001183812,0.000435533,0.000140197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006641357,"about_ca_system_score_gemma":0.0002336351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002139097,"about_ca_topic_score_gemma":0.001399153,"domain_scores_codex":[0.997996,0.0002874087,0.0006235109,0.0003405912,0.0002345029,0.0005179878],"domain_scores_gemma":[0.9973368,0.0001375575,0.0001460579,0.00153317,0.0005608977,0.0002854985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001432884,0.00007724845,0.003019415,0.0000210441,0.00003723887,0.000005236373,0.000115511,0.9946753,0.0001076381,0.0003736216,0.0001683338,0.001385124],"study_design_scores_gemma":[0.001133959,0.00003187087,0.0002623386,0.0002555769,0.00003301481,0.0000211217,0.000414473,0.9958662,0.0002308516,0.0004562703,0.0008175159,0.0004767908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01220578,0.003218195,0.9744655,0.0001776643,0.000553984,0.0006644957,0.00008575444,0.0005143921,0.008114255],"genre_scores_gemma":[0.9775614,0.0002733594,0.02153246,0.0001112664,0.00005624297,0.0001667765,0.0002407362,0.00004567198,0.0000121178],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9653556,"threshold_uncertainty_score":0.9998141,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.07211096035085904,"gpt":0.2967678010923424,"spread":0.2246568407414834,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008779871,0.0005259588,0.0006191127,0.0001257458,0.0009399042,0.000732869,0.002712807,0.0002797417,0.000008401619],"category_scores_gemma":[0.0001823276,0.00056565,0.0002676531,0.001096949,0.0003516031,0.0005105319,0.0004705913,0.0006980218,0.00003698069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007124097,"about_ca_system_score_gemma":0.0009573956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000394528,"about_ca_topic_score_gemma":0.001740577,"domain_scores_codex":[0.996318,0.000598853,0.0006831757,0.0008288193,0.0005675778,0.001003512],"domain_scores_gemma":[0.9943546,0.0006022048,0.0004936121,0.002554137,0.001442887,0.0005525342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003655216,0.0009192727,0.001028463,0.00004569274,0.0004219228,0.00006770012,0.0007174565,0.0820118,0.0002612553,0.7655334,0.07210378,0.07652372],"study_design_scores_gemma":[0.001333058,0.0002367253,0.0001326999,0.0001508461,0.00005467388,0.00008821136,0.0002256211,0.9631383,0.000132858,0.02807209,0.005788693,0.0006462378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004915745,0.0002716647,0.9803241,0.0101031,0.0009457319,0.0006794601,0.00009018072,0.0005589624,0.002110994],"genre_scores_gemma":[0.9677734,0.0001572683,0.03055534,0.000824685,0.0002361876,0.00003569405,0.0003199698,0.00003109992,0.00006634162],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9628577,"threshold_uncertainty_score":0.9996795,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.06391313434900145,"gpt":0.3075735634437006,"spread":0.2436604290946991,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001165846,0.0003836021,0.0004187041,0.0001520271,0.001040253,0.0005539901,0.004779737,0.00009162971,0.00003020207],"category_scores_gemma":[0.000135137,0.000402131,0.0001889185,0.0009993006,0.0005326809,0.0008603814,0.001060124,0.0004283132,0.0001361372],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002297071,"about_ca_system_score_gemma":0.0002288842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003131462,"about_ca_topic_score_gemma":0.0006079416,"domain_scores_codex":[0.9966946,0.001059392,0.0005408555,0.0007226064,0.0004135069,0.0005690629],"domain_scores_gemma":[0.9937022,0.000188597,0.0003524485,0.004899403,0.0006152034,0.0002421319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000634004,0.001229386,0.001037881,0.00007975116,0.0001439081,0.000003053065,0.0004533447,0.0002135359,0.004074186,0.8148276,0.001547667,0.1763263],"study_design_scores_gemma":[0.001157933,0.0003758248,0.007740681,0.0001976085,0.000126633,0.000232235,0.0001207083,0.5814861,0.01290902,0.3786285,0.01554924,0.001475562],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1350893,0.0003802695,0.8455301,0.002219511,0.001192565,0.0006843937,0.00007016837,0.00153434,0.01329938],"genre_scores_gemma":[0.9365066,0.00009723123,0.06296609,0.0002479313,0.00009204334,0.00003680383,0.00002247929,0.00001332308,0.00001750251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8014173,"threshold_uncertainty_score":0.9998431,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.1074249064549734,"gpt":0.3489757898366548,"spread":0.2415508833816814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004233529,0.0003556585,0.0003896344,0.0001102841,0.0003331871,0.00008441742,0.001825464,0.0002178992,0.00004802663],"category_scores_gemma":[0.0001623581,0.0004057873,0.0001366367,0.0004537163,0.000463048,0.0004513144,0.0003858779,0.0003427359,0.0001610903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004457383,"about_ca_system_score_gemma":0.0003637046,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004747355,"about_ca_topic_score_gemma":0.0002896667,"domain_scores_codex":[0.9980931,0.0001714104,0.000656802,0.0002985398,0.0003386713,0.0004415149],"domain_scores_gemma":[0.9950965,0.0002313197,0.0001606404,0.003058474,0.001110854,0.0003422229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007879417,0.0005370416,0.00211209,0.00008093641,0.0002984533,0.000002021095,0.0004605918,0.03271222,0.002412901,0.7774562,0.1151661,0.06868267],"study_design_scores_gemma":[0.001499833,0.00008544641,0.0006138056,0.0001187613,0.00007518342,0.0000421912,0.0005586759,0.5201805,0.001212939,0.03197316,0.4426885,0.0009510297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008197772,0.004141697,0.9333208,0.003336512,0.0007235383,0.001716626,0.001215699,0.002556737,0.04479063],"genre_scores_gemma":[0.8252475,0.0005370573,0.1730746,0.0001391767,0.00004234033,0.0003365131,0.0004497873,0.0000410306,0.0001319679],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8170497,"threshold_uncertainty_score":0.9998394,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}