{"meta":{"query_hash":"ea84488bbdb1","filters":{"venue":"2013 International Conference on Computing, Networking and Communications (ICNC)"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/ea84488bbdb1","api":"https://metacan.xera.ac/api/v1/cohort?venue=2013+International+Conference+on+Computing%2C+Networking+and+Communications+%28ICNC%29"},"results":[{"id":"W1973104709","doi":"10.1109/iccnc.2013.6504137","title":"Ambiguity resolution in RSS-based emitter geolocation","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Geolocation; RSS; Robustness (evolution); Common emitter; Computer science; Ambiguity resolution; Ambiguity; Remote sensing; Real-time computing; Electronic engineering; Telecommunications; Engineering; Geography; GNSS applications; Global Positioning System; World Wide Web","score_opus":0.03864977308457444,"score_gpt":0.2647509111545804,"score_spread":0.22610113807000592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973104709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5869261,0.002122121,0.25024396,0.02230458,0.0030208493,0.0015704732,0.000020648826,0.0029842067,0.13080701],"genre_scores_gemma":[0.99614406,0.0006543633,0.0025486017,0.00027859086,0.00009305535,0.000061022976,0.00010220731,0.00001825518,0.00009986238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989515,0.000076751414,0.00036120543,0.0002056356,0.00017079107,0.00023409919],"domain_scores_gemma":[0.99893874,0.00012086325,0.00009203056,0.0006096995,0.00019696265,0.00004173137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021886588,0.00017046527,0.00014942732,0.0002582114,0.0001757675,0.00016646026,0.0007083395,0.00013679168,0.00009862662],"category_scores_gemma":[0.000030402092,0.00018098121,0.000034495806,0.00023536789,0.00014163285,0.00014257422,0.0001767716,0.00038362306,0.000079101796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038103077,0.00043753977,0.06688872,0.000093221584,0.00015344445,0.000003793899,0.001523392,0.28987122,0.0008328321,0.20637208,0.030661585,0.40312403],"study_design_scores_gemma":[0.0002850816,0.000022167305,0.013937481,0.00016350622,0.0000038637536,0.000002335955,0.000113198446,0.97536093,0.000090708985,0.0033235508,0.006507303,0.00018990075],"about_ca_topic_score_codex":0.00035597183,"about_ca_topic_score_gemma":0.00019566913,"teacher_disagreement_score":0.68548965,"about_ca_system_score_codex":0.00011761004,"about_ca_system_score_gemma":0.000022926344,"threshold_uncertainty_score":0.73801994},"labels":[],"label_agreement":null},{"id":"W1976822910","doi":"10.1109/iccnc.2013.6504228","title":"Performance of cooperative relaying with adaptive modulation and selection combining","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Relay; Computer science; Link adaptation; Bit error rate; Maximal-ratio combining; Signal-to-noise ratio (imaging); Cooperative diversity; Modulation (music); Selection (genetic algorithm); Node (physics); Coding (social sciences); Electronic engineering; Diversity combining; Channel (broadcasting); Computer network; Telecommunications; Fading; Engineering; Mathematics; Statistics; Artificial intelligence","score_opus":0.06617419324837946,"score_gpt":0.28145708771061045,"score_spread":0.21528289446223098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976822910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7214566,0.00085759285,0.24010822,0.0058179125,0.0003104648,0.00080230256,0.0000023835162,0.00027799103,0.030366523],"genre_scores_gemma":[0.9682174,0.0029689348,0.028417831,0.00015858057,0.00004877884,0.000038221944,0.000013689491,0.000011853543,0.00012472896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859476,0.00025561766,0.00037624605,0.0003392134,0.0002376002,0.00019655364],"domain_scores_gemma":[0.9978915,0.00031130496,0.0003431743,0.0005802303,0.0007976387,0.000076166165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034630654,0.00020030723,0.00021952906,0.00017821135,0.00065434177,0.00029237242,0.0010199216,0.00006367471,0.0000225221],"category_scores_gemma":[0.000019082025,0.00018322012,0.000024778668,0.00036884396,0.00022991523,0.0005753923,0.0007566696,0.0003844379,0.00000896851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054784377,0.00019996647,0.018881446,0.000015803327,0.00017937477,3.795005e-7,0.0037982408,0.012378788,0.00149002,0.55383676,0.0004642489,0.4087002],"study_design_scores_gemma":[0.00038079757,0.00028447754,0.019715978,0.00037099342,0.000006778693,0.000015551757,0.00016840085,0.9778124,0.00004850928,0.00048657076,0.00050636585,0.00020314097],"about_ca_topic_score_codex":0.00007456054,"about_ca_topic_score_gemma":0.000049286806,"teacher_disagreement_score":0.96543366,"about_ca_system_score_codex":0.00005262304,"about_ca_system_score_gemma":0.000060909526,"threshold_uncertainty_score":0.74715},"labels":[],"label_agreement":null},{"id":"W1981229864","doi":"10.1109/iccnc.2013.6504162","title":"Automated malware classification based on network behavior","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Advanced Malware Detection Techniques","field":"Computer Science","cited_by":118,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Malware; Computer science; Leverage (statistics); Cryptovirology; Computer security; The Internet; Network security; Artificial intelligence; Malware analysis; Machine learning; Data mining; World Wide Web","score_opus":0.06834772293007085,"score_gpt":0.3245046573709163,"score_spread":0.2561569344408455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981229864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057812543,0.00019698389,0.9300797,0.014542151,0.0017661535,0.0012360311,0.000009464791,0.004795349,0.041592922],"genre_scores_gemma":[0.90790856,0.00023422095,0.09003366,0.0010497605,0.00020635847,0.0002685198,0.000067868794,0.000024438024,0.00020662353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978695,0.00026078516,0.00050048745,0.000582411,0.0004129223,0.0003739323],"domain_scores_gemma":[0.9966314,0.00039296504,0.0004291477,0.0018497441,0.00056146365,0.00013529761],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003564099,0.00029542219,0.0002266506,0.00025477316,0.0006434804,0.0006217026,0.002531407,0.00014668205,0.00008058038],"category_scores_gemma":[0.000040072813,0.00030234092,0.00007751464,0.00043080427,0.00016310885,0.0003782794,0.00067727984,0.0005427361,0.00015212924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025866148,0.00057737145,0.003843206,0.000012855336,0.00006292948,0.000004386512,0.00024819272,0.013926463,0.00033394905,0.4970091,0.029487487,0.4544682],"study_design_scores_gemma":[0.00024182849,0.00014136458,0.013320396,0.0002233664,0.0000073258807,0.000010147727,0.00002829076,0.96838766,0.000038076083,0.004081294,0.013213647,0.00030661744],"about_ca_topic_score_codex":0.000109855944,"about_ca_topic_score_gemma":0.000023375287,"teacher_disagreement_score":0.95446116,"about_ca_system_score_codex":0.00013972318,"about_ca_system_score_gemma":0.0000840142,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W2000361393","doi":"10.1109/iccnc.2013.6504241","title":"Multi-objective QoS routing for wireless sensor networks","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Quality of service; Routing protocol; Wireless sensor network; Distributed computing; Wireless Routing Protocol; Reliability (semiconductor); Routing (electronic design automation); Geographic routing; Dynamic Source Routing","score_opus":0.056006812021748766,"score_gpt":0.2950054410584486,"score_spread":0.23899862903669986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000361393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01334825,0.00036676115,0.972091,0.0046203956,0.0023196312,0.00075206923,0.0000051453503,0.0004656521,0.006031103],"genre_scores_gemma":[0.88170815,0.00061509956,0.11562263,0.000617784,0.0006905656,0.00013152213,0.000060578415,0.0000373621,0.00051632314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727577,0.00029819517,0.0006410957,0.0007811949,0.00035329888,0.0006504739],"domain_scores_gemma":[0.9957332,0.0011078173,0.0005275617,0.0015896367,0.0008552944,0.00018651487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000560128,0.0003963891,0.00036859544,0.00021344425,0.0009530229,0.0009569448,0.0031327112,0.00019847877,0.000020494703],"category_scores_gemma":[0.00005262961,0.0004021733,0.00014103149,0.00036921047,0.00024325837,0.00035683758,0.0013877392,0.000641548,0.000041350362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032158587,0.00058927626,0.0027141625,0.000016508324,0.00031566547,0.0000033158674,0.0018002773,0.271322,0.0003268978,0.46897957,0.0059662815,0.24793388],"study_design_scores_gemma":[0.0006457209,0.000081034304,0.0015875084,0.00028135083,0.000011784424,0.000016463116,0.00019833197,0.9920782,0.00002093372,0.00052309904,0.004117943,0.0004376662],"about_ca_topic_score_codex":0.0003156811,"about_ca_topic_score_gemma":0.00009252855,"teacher_disagreement_score":0.86835986,"about_ca_system_score_codex":0.00012454583,"about_ca_system_score_gemma":0.00006596095,"threshold_uncertainty_score":0.999843},"labels":[],"label_agreement":null},{"id":"W2021080064","doi":"10.1109/iccnc.2013.6504227","title":"A queueing theoretic model for opportunistic network coding","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Network packet; Linear network coding; Queueing theory; Computer network; Coding (social sciences); Markov process; Markov chain; Markovian arrival process; Point process; Discrete time and continuous time; Real-time computing; Mathematics","score_opus":0.13543242226646177,"score_gpt":0.33071047068999304,"score_spread":0.19527804842353128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021080064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000835985,0.0006286373,0.9536414,0.013479263,0.00065562234,0.00064235186,0.0000047541785,0.00035132957,0.029760666],"genre_scores_gemma":[0.92267686,0.0055144564,0.06885776,0.0014207319,0.00029518723,0.00017858994,0.00006341272,0.00002632116,0.00096670166],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978505,0.0002703459,0.00058926165,0.0005268779,0.00027575443,0.00048731224],"domain_scores_gemma":[0.9961105,0.0008748868,0.0003766248,0.0017767907,0.0006805734,0.00018064305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082521443,0.00030757394,0.00030239802,0.00015852533,0.0012289772,0.0009908198,0.00357457,0.000103923216,0.000055277236],"category_scores_gemma":[0.000077942204,0.00030885858,0.000106503285,0.00029829534,0.0002371959,0.00038347894,0.0017999222,0.0004677455,0.00004254013],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005217704,0.000055546356,0.00011978579,0.000006547258,0.000043322216,2.820912e-7,0.0005968541,0.0046975412,0.0000436088,0.89874387,0.006287671,0.089399755],"study_design_scores_gemma":[0.00033151364,0.00005080063,0.0002015646,0.00031301548,0.00001116336,0.000008920275,0.00005701208,0.934812,0.0000023911778,0.054554097,0.009334207,0.00032330106],"about_ca_topic_score_codex":0.000031669446,"about_ca_topic_score_gemma":0.00005111279,"teacher_disagreement_score":0.93011445,"about_ca_system_score_codex":0.00008946755,"about_ca_system_score_gemma":0.00012580177,"threshold_uncertainty_score":0.99993634},"labels":[],"label_agreement":null},{"id":"W2024128585","doi":"10.1109/iccnc.2013.6504198","title":"Polar codes for data storage applications","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Decoding methods; Encoding (memory); Polar; Computer data storage; Error detection and correction; Throughput; Algorithm; Theoretical computer science; Computer engineering; Telecommunications; Computer hardware; Artificial intelligence","score_opus":0.12183898016624352,"score_gpt":0.3524047824314154,"score_spread":0.23056580226517187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024128585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008808929,0.0005337447,0.9735645,0.010063724,0.0005260541,0.00085540063,0.000028984648,0.00067160605,0.012875068],"genre_scores_gemma":[0.7888284,0.00054283935,0.2091454,0.000503079,0.00024268383,0.00024420785,0.00023215325,0.000019258528,0.00024201015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982219,0.00014937558,0.00042373073,0.0006289973,0.0002661745,0.00030984063],"domain_scores_gemma":[0.99490327,0.0006995025,0.0003400998,0.003393947,0.0005539957,0.0001091762],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00065116805,0.00022672431,0.00021486114,0.00018674173,0.00067351916,0.00075983856,0.0068969755,0.00009519014,0.000022470565],"category_scores_gemma":[0.00006339769,0.00023518204,0.000052801184,0.00024939008,0.00015983198,0.00043436195,0.0028348493,0.000376081,0.000060378345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004661861,0.0001630108,0.0010073141,0.000013097462,0.00007647589,3.0706894e-7,0.00042315185,0.00012489405,0.00017501334,0.6844324,0.021989664,0.29159003],"study_design_scores_gemma":[0.00016090207,0.000052136398,0.0005316969,0.00011137084,0.0000087192875,0.00001111393,0.000063005245,0.880814,0.000015575932,0.02502989,0.09295496,0.00024661425],"about_ca_topic_score_codex":0.00049387146,"about_ca_topic_score_gemma":0.000116218136,"teacher_disagreement_score":0.88068914,"about_ca_system_score_codex":0.000065909124,"about_ca_system_score_gemma":0.00008484831,"threshold_uncertainty_score":0.9984762},"labels":[],"label_agreement":null},{"id":"W2051659128","doi":"10.1109/iccnc.2013.6504175","title":"Effective capacity optimization for cognitive radio network based on underlay scheme in gamma fading channels","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Underlay; Cognitive radio; Quality of service; Throughput; Computer science; Computer network; Interference (communication); Fading; Transmitter power output; Cognitive network; Electronic engineering; Telecommunications; Signal-to-noise ratio (imaging); Transmitter; Engineering; Wireless; Channel (broadcasting)","score_opus":0.054065397810230925,"score_gpt":0.2876415898820545,"score_spread":0.2335761920718236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051659128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01979103,0.00019312772,0.9643933,0.004540742,0.0010386526,0.001289227,0.0000056590793,0.00017781564,0.008570415],"genre_scores_gemma":[0.94925725,0.00022013848,0.048867203,0.0007949323,0.0005660296,0.00015628143,0.00007337496,0.000025540181,0.000039262406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769235,0.00039605203,0.000457711,0.0006398064,0.00029626617,0.00051784696],"domain_scores_gemma":[0.99622375,0.002129441,0.00033950558,0.0006499616,0.00053491077,0.0001224228],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071340817,0.00032829025,0.00034238485,0.00029756123,0.0006270439,0.0006862262,0.0010744698,0.00013598922,0.000027579808],"category_scores_gemma":[0.000104705,0.00034400643,0.000102655664,0.00047844797,0.00017057815,0.00032354836,0.00035587387,0.0005401976,0.0000143742545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079449776,0.00031848898,0.002659502,0.000017740296,0.0001292326,0.0000028040295,0.0009809148,0.645144,0.000022698609,0.16890201,0.001075293,0.18066789],"study_design_scores_gemma":[0.0010376683,0.00020617127,0.0025171968,0.0010117758,0.000009817678,0.0000070429437,0.00006753197,0.9883397,0.000013189055,0.0059402655,0.0004882941,0.0003613044],"about_ca_topic_score_codex":0.00016891489,"about_ca_topic_score_gemma":0.000087178116,"teacher_disagreement_score":0.9294662,"about_ca_system_score_codex":0.00019118893,"about_ca_system_score_gemma":0.00006534566,"threshold_uncertainty_score":0.9999012},"labels":[],"label_agreement":null},{"id":"W2072172450","doi":"10.1109/iccnc.2013.6504191","title":"A realistic and stable Markov-based model for WSNs","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Reliability (semiconductor); Markov chain; Markov model; Markov process; Real-time computing; Smart grid; Power consumption; Hidden Markov model; Power (physics); Distributed computing; Computer network; Engineering; Artificial intelligence","score_opus":0.06950999142397984,"score_gpt":0.29339833011184785,"score_spread":0.223888338687868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072172450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049609034,0.00030797333,0.97420394,0.009403469,0.00040269134,0.00038876722,0.000009499406,0.0002161542,0.010106571],"genre_scores_gemma":[0.872247,0.0004201969,0.12575589,0.0007897488,0.00011161789,0.00008472394,0.000059369733,0.000018243078,0.00051325513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983894,0.00012457416,0.00038696095,0.00048260659,0.0002537564,0.0003626744],"domain_scores_gemma":[0.9973273,0.00068465737,0.0002627707,0.0011436506,0.00044533296,0.00013625987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038451486,0.00023028096,0.00021838932,0.00016122783,0.00054020074,0.0006866127,0.0017801248,0.00009749328,0.000013188334],"category_scores_gemma":[0.000038026395,0.0002320976,0.000054271834,0.00017534432,0.00018597639,0.00020804806,0.0007387048,0.00028240055,0.0000095962905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012806221,0.0001600572,0.00042396894,0.000015605669,0.000050846727,4.5326482e-7,0.00038527217,0.30483562,0.000044701184,0.6096607,0.00745054,0.07695945],"study_design_scores_gemma":[0.00039658142,0.000052629322,0.00032712528,0.00018093351,0.000008381724,0.000004866409,0.000027313476,0.9875578,0.0000056237436,0.0067813424,0.00440947,0.0002479109],"about_ca_topic_score_codex":0.00029663852,"about_ca_topic_score_gemma":0.00017255267,"teacher_disagreement_score":0.867286,"about_ca_system_score_codex":0.000056832196,"about_ca_system_score_gemma":0.00008023243,"threshold_uncertainty_score":0.94646657},"labels":[],"label_agreement":null},{"id":"W2074311317","doi":"10.1109/iccnc.2013.6504072","title":"Dual-hop AF systems with maximum end-to-end SNR relay selection over nakagami-m and rician fading links","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Rician fading; Relay; Nakagami distribution; Fading; Cumulative distribution function; Probability density function; Computer science; Maximal-ratio combining; Signal-to-noise ratio (imaging); Selection (genetic algorithm); Relay channel; Mathematics; Topology (electrical circuits); Algorithm; Telecommunications; Statistics; Channel (broadcasting); Physics","score_opus":0.05106065220654933,"score_gpt":0.2888453482463421,"score_spread":0.2377846960397928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074311317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22546792,0.0061320188,0.62234914,0.048058562,0.0029699667,0.002634466,0.000015423699,0.001344433,0.09102804],"genre_scores_gemma":[0.98029256,0.0029972026,0.014659331,0.0008831209,0.0002653,0.00009419889,0.000032707798,0.000027362603,0.0007482186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975805,0.00043757836,0.00053089927,0.00061879493,0.00041922176,0.00041298982],"domain_scores_gemma":[0.9969368,0.0005043551,0.00035755392,0.0013105378,0.0006637881,0.00022697377],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00063486444,0.0003410933,0.00031471997,0.0003494694,0.001085765,0.0014689567,0.0017774488,0.00016254256,0.00007252452],"category_scores_gemma":[0.000036555946,0.00031836206,0.000047978298,0.0006157491,0.00019044834,0.00051412755,0.0015966889,0.00090800953,0.0000686564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034426776,0.0002652532,0.008078121,0.000025227775,0.00028594167,0.000004004126,0.004251829,0.011431129,0.0006094084,0.55928427,0.007993759,0.40773666],"study_design_scores_gemma":[0.00043699355,0.00016484864,0.007753059,0.00053523335,0.000013288733,0.00005934439,0.00018513713,0.9448683,0.0000105356385,0.00071448873,0.04484065,0.00041808526],"about_ca_topic_score_codex":0.00035217276,"about_ca_topic_score_gemma":0.00027676727,"teacher_disagreement_score":0.9334372,"about_ca_system_score_codex":0.00013757624,"about_ca_system_score_gemma":0.000088984816,"threshold_uncertainty_score":0.99992687},"labels":[],"label_agreement":null},{"id":"W2113967535","doi":"10.1109/iccnc.2013.6504164","title":"Mitigating the asymmetric interests among peers in peer-to-peer video-on-demand systems","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Video on demand; Incentive; Exploit; Peer-to-peer; On demand; Multimedia; Coding (social sciences); The Internet; Computer network; Video streaming; World Wide Web; Computer security","score_opus":0.07177435605892733,"score_gpt":0.31667204494787415,"score_spread":0.2448976888889468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113967535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3254092,0.0035093047,0.17075306,0.25621676,0.0060434635,0.0038726456,0.00001475673,0.00092179555,0.23325904],"genre_scores_gemma":[0.9929309,0.000862582,0.003165851,0.0013961904,0.00022548203,0.00015839054,0.000027308975,0.000021847902,0.0012114439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99678284,0.00076175464,0.0007075846,0.0005621514,0.00074238156,0.00044328882],"domain_scores_gemma":[0.9947557,0.0014339432,0.00036530825,0.0021101062,0.0011520517,0.00018291747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017560435,0.00031842783,0.00030556438,0.000507462,0.00081491575,0.0016705006,0.0049204505,0.000103945225,0.000030741958],"category_scores_gemma":[0.00034998948,0.00027009487,0.00007882914,0.0010172422,0.00022487795,0.0003810127,0.0022421519,0.0009415245,0.000160703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014903294,0.00028781465,0.016666139,0.000013070596,0.00013384169,0.0000034111742,0.006155811,0.016524013,0.000068674104,0.6698452,0.037801795,0.2524853],"study_design_scores_gemma":[0.00035813244,0.00008943118,0.024268864,0.0006867982,0.0000049967616,0.0000100929665,0.0005400138,0.949523,0.000007969259,0.0014313514,0.022744311,0.0003350654],"about_ca_topic_score_codex":0.00046676485,"about_ca_topic_score_gemma":0.00031543954,"teacher_disagreement_score":0.93299896,"about_ca_system_score_codex":0.00015987836,"about_ca_system_score_gemma":0.000067833425,"threshold_uncertainty_score":0.99997514},"labels":[],"label_agreement":null},{"id":"W2158303681","doi":"10.1109/iccnc.2013.6504126","title":"Cloud-hosted key sharing towards secure and scalable mobile applications in clouds","year":2013,"lang":"en","type":"article","venue":"2013 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Scalability; Key (lock); Revocation; Data sharing; Key management; Computer network; Encryption; Distributed computing; Computer security; Database; Operating system","score_opus":0.03765016578818742,"score_gpt":0.2900395208622726,"score_spread":0.25238935507408516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158303681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49329913,0.0064983815,0.41379413,0.014003241,0.0019141556,0.0032101162,0.000073474286,0.0010661816,0.06614121],"genre_scores_gemma":[0.981037,0.0017940155,0.01643654,0.00025222285,0.00015008841,0.00018610302,0.000084507345,0.000012152266,0.00004735095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983404,0.000115548966,0.00042503583,0.0005561534,0.00024693407,0.00031588052],"domain_scores_gemma":[0.9978225,0.0002229459,0.00020465223,0.0013601222,0.00025269223,0.00013708588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039859506,0.0002277664,0.00022569756,0.00023532605,0.00045921162,0.00079481717,0.002417042,0.00011106138,0.000046641373],"category_scores_gemma":[0.0000146692655,0.00023009705,0.000050393006,0.0004927658,0.00019755132,0.0004375266,0.002030301,0.0004973306,0.000029045477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060158723,0.00021376908,0.0104650175,0.000014184554,0.000038959515,6.9024594e-7,0.0017386227,0.00022542135,0.00003646739,0.9021969,0.0013374101,0.083726555],"study_design_scores_gemma":[0.00045561147,0.000088876506,0.012693185,0.00022430957,0.0000077915565,0.00001459287,0.00038689838,0.88364726,0.000014335025,0.058044434,0.044045184,0.0003775105],"about_ca_topic_score_codex":0.0008865869,"about_ca_topic_score_gemma":0.00026810405,"teacher_disagreement_score":0.88342184,"about_ca_system_score_codex":0.000045728775,"about_ca_system_score_gemma":0.000047827838,"threshold_uncertainty_score":0.93830854},"labels":[],"label_agreement":null}]}