{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020715848,0.0013884759,0.9752864,0.000183133,0.00008108186,0.000013514274,0.00003775953,0.000244341,0.0020493688],"genre_scores_gemma":[0.6733502,0.0018393933,0.32237598,0.00016542379,0.0002207055,0.000056141624,0.0001757032,0.000105471554,0.0017109596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984433,0.00051830045,0.00008310748,0.00024681084,0.0006061963,0.00010237028],"domain_scores_gemma":[0.9975176,0.0013154108,0.00034271664,0.00047321516,0.00030711782,0.000043997483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019183041,0.00075569615,0.00079811673,0.0012248602,0.000450631,0.0012243972,0.00094730087,0.0011437861,0.00062559795],"category_scores_gemma":[0.012101491,0.0005845772,0.00041336223,0.0018775773,0.0013533662,0.0020879733,0.0023005325,0.0010652168,0.0006578097],"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.00037013207,0.000049443133,0.0033161563,0.00032910856,0.000099516474,0.0007394502,0.0008438145,0.49665162,0.0388898,0.12070129,0.002423593,0.33558598],"study_design_scores_gemma":[0.000047566806,0.00013153345,0.0023103945,0.00008663125,0.00004259195,0.001418961,0.00025974002,0.8430338,0.03091865,0.1121781,0.009444465,0.00012763964],"about_ca_topic_score_codex":0.0005866991,"about_ca_topic_score_gemma":0.0003398155,"teacher_disagreement_score":0.0019183041,"about_ca_system_score_codex":0.00034256733,"about_ca_system_score_gemma":0.00040915262,"threshold_uncertainty_score":0.010145068},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85024273,0.002365774,0.11484843,0.00073275535,0.00008943651,0.00009018268,0.0003488392,0.0004928515,0.030789034],"genre_scores_gemma":[0.99641067,0.00017138157,0.0026257127,0.00002837842,0.000011022545,0.00001928118,0.000059368307,0.000008442674,0.00066577893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983405,0.0005180635,0.00008484901,0.00022202908,0.000490506,0.00034395917],"domain_scores_gemma":[0.99248284,0.004977137,0.0007304665,0.0003424313,0.0013106875,0.0001564553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020707932,0.0013906255,0.0010933914,0.0008465117,0.0008668049,0.0012968929,0.0010467481,0.0015127821,0.0009632256],"category_scores_gemma":[0.007161178,0.00032128982,0.00049369276,0.001112166,0.0014575724,0.0011005098,0.0012533828,0.0004945012,0.00033366663],"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.00080327864,0.00008878922,0.0037846006,0.00015356975,0.00011686492,0.0005158472,0.00023608263,0.95149446,0.017121771,0.0094391145,0.0007280777,0.015517669],"study_design_scores_gemma":[0.00006191232,0.00047854314,0.0018847791,0.000021560312,0.00007387862,0.00037159256,0.000090643414,0.9849296,0.007267257,0.004395326,0.00036255963,0.00006243122],"about_ca_topic_score_codex":0.00514286,"about_ca_topic_score_gemma":0.0024523747,"teacher_disagreement_score":0.00514286,"about_ca_system_score_codex":0.0012397948,"about_ca_system_score_gemma":0.0010344209,"threshold_uncertainty_score":0.010951579},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88899696,0.0006588459,0.09964386,0.0002316634,0.0000680318,0.00032082896,0.0015095371,0.0038852398,0.004685091],"genre_scores_gemma":[0.94897074,0.00035261223,0.0466654,0.00003875183,0.000052272164,0.00010697418,0.002049441,0.000068274065,0.0016955888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994808,0.00007345248,0.00003893153,0.00011099892,0.0002326849,0.00006316686],"domain_scores_gemma":[0.9984107,0.00047376667,0.00034199556,0.00013046987,0.0005663101,0.00007683721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034814875,0.00061574206,0.000586632,0.0069065555,0.0004764691,0.00087344804,0.00034837754,0.00041065982,0.00058355875],"category_scores_gemma":[0.0021199964,0.0001470719,0.00034397634,0.001496669,0.0002565352,0.0007717266,0.00041442137,0.00033128337,0.00072671013],"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.00073026685,0.0005296906,0.16149957,0.00029142504,0.00014483601,0.00094019866,0.0005737443,0.024059402,0.09138053,0.0017127917,0.006764823,0.71137273],"study_design_scores_gemma":[0.000011740776,0.0001522657,0.09381107,0.000056476772,0.00007233314,0.0011131964,0.0003544258,0.85958874,0.037990846,0.0025228274,0.0042801644,0.00004598133],"about_ca_topic_score_codex":0.002665098,"about_ca_topic_score_gemma":0.0035110447,"teacher_disagreement_score":0.0069065555,"about_ca_system_score_codex":0.00040681483,"about_ca_system_score_gemma":0.0004081997,"threshold_uncertainty_score":0.005299151},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013951688,0.0073777856,0.97226894,0.0009357006,0.00031778563,0.000082656516,0.000069965135,0.00039760617,0.004597848],"genre_scores_gemma":[0.5822315,0.010702711,0.39965776,0.00037122754,0.00039425082,0.0002916565,0.0003123862,0.000148959,0.0058895503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995963,0.00015330846,0.00002473367,0.000035269757,0.00016747382,0.000022958391],"domain_scores_gemma":[0.9996045,0.00018657425,0.000070234695,0.000031699194,0.000089557136,0.00001747623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070388627,0.00047008423,0.00032477133,0.0003657021,0.00036540622,0.0006277969,0.00060928345,0.00045949902,0.00096412585],"category_scores_gemma":[0.0016102669,0.00014925346,0.00028108433,0.0006669289,0.0003304966,0.0007318022,0.0004448947,0.00064869184,0.00023564215],"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.00010116522,0.00006398837,0.0008543076,0.00078140583,0.000103713726,0.00020456294,0.00017951906,0.5997856,0.020933554,0.09871699,0.0062374254,0.27203777],"study_design_scores_gemma":[0.000012651539,0.000085098996,0.0002689446,0.00004091924,0.000016831447,0.00010606832,0.00004480781,0.9522252,0.0024832129,0.03151066,0.013188225,0.000017297634],"about_ca_topic_score_codex":0.00110423,"about_ca_topic_score_gemma":0.0012031392,"teacher_disagreement_score":0.00110423,"about_ca_system_score_codex":0.0004760469,"about_ca_system_score_gemma":0.00055054,"threshold_uncertainty_score":0.0037225485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026065473,0.00049049297,0.9526523,0.0010368007,0.00016984642,0.00016228881,0.00037142046,0.000224125,0.018827237],"genre_scores_gemma":[0.9140206,0.0009785964,0.06383669,0.00038000123,0.00024389455,0.00057853875,0.00024379363,0.00007740696,0.019640433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987771,0.0004073535,0.000046607445,0.00017496996,0.0003517831,0.00024218846],"domain_scores_gemma":[0.9979122,0.0013045343,0.00020971432,0.00014928835,0.00030346474,0.00012077408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015660177,0.0009608682,0.0009112495,0.0008372439,0.0010157606,0.0020824792,0.0024006034,0.0016995288,0.004358757],"category_scores_gemma":[0.004365923,0.0005654174,0.0006302074,0.0011996278,0.0017241259,0.0028494245,0.0012826255,0.0015978765,0.00067309843],"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.000042424916,0.000053442534,0.00031020044,0.00005575767,0.00001600888,0.00034414558,0.000229631,0.3974472,0.001585614,0.59458554,0.0016090019,0.0037211454],"study_design_scores_gemma":[0.000017210252,0.00002068163,0.00007238271,0.000007930071,0.0000074163595,0.000076529,0.00004536797,0.924711,0.00016016931,0.07308221,0.0017851503,0.000014017505],"about_ca_topic_score_codex":0.012276415,"about_ca_topic_score_gemma":0.0072009843,"teacher_disagreement_score":0.012276415,"about_ca_system_score_codex":0.0035433655,"about_ca_system_score_gemma":0.002363767,"threshold_uncertainty_score":0.025709033},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01724139,0.017505718,0.88876635,0.002977028,0.0010732741,0.00018210021,0.00047140857,0.0009887237,0.070794046],"genre_scores_gemma":[0.46924046,0.030280514,0.4608763,0.002133222,0.001246027,0.0005172749,0.000752675,0.00041973576,0.03453364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.00011595531,0.000029666231,0.000062611325,0.00026255855,0.000051886767],"domain_scores_gemma":[0.9986873,0.0005133809,0.000109244196,0.00025752588,0.0003876942,0.00004481603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004746226,0.0005893189,0.00042800728,0.0007547958,0.00073172647,0.0016873112,0.00052700297,0.0010454427,0.0057849507],"category_scores_gemma":[0.0031119047,0.00021054855,0.00023868299,0.0014199506,0.0010225899,0.0017949919,0.001144426,0.0016706542,0.0022594559],"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.0001403507,0.00003531879,0.00036905688,0.00065445504,0.000014661005,0.00023754316,0.00025766974,0.02005267,0.024634022,0.7773022,0.016148409,0.16015361],"study_design_scores_gemma":[0.000034034867,0.00014524486,0.00029548712,0.00051420287,0.000027669623,0.0012633054,0.00020012743,0.12363664,0.051415484,0.5566619,0.26573667,0.00006922788],"about_ca_topic_score_codex":0.0005028052,"about_ca_topic_score_gemma":0.00051816145,"teacher_disagreement_score":0.0057849507,"about_ca_system_score_codex":0.00066634506,"about_ca_system_score_gemma":0.0009152775,"threshold_uncertainty_score":0.019352615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27845648,0.0033111412,0.7036196,0.0004489706,0.00008265203,0.00006792355,0.000119170894,0.00021417381,0.013679778],"genre_scores_gemma":[0.9888708,0.00051674695,0.009743319,0.0000392441,0.000016103842,0.00003071935,0.000017228547,0.000014996782,0.0007507876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.00020682039,0.000016217573,0.00009334803,0.00011514264,0.00018623521],"domain_scores_gemma":[0.99895453,0.0006669385,0.00011683716,0.000046580793,0.00015612146,0.000059021724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009231159,0.0011794767,0.0008867097,0.0006253178,0.00057584123,0.0015813652,0.00097080576,0.0007314176,0.0011447251],"category_scores_gemma":[0.0022212297,0.00030019908,0.00038881134,0.00075809547,0.0012233742,0.001155673,0.0011956516,0.0006326872,0.00011979719],"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.000111604444,0.00003502645,0.00036589152,0.00010668033,0.000045811194,0.00023961884,0.00014236414,0.9582795,0.0077749174,0.022429684,0.00058794365,0.009881008],"study_design_scores_gemma":[0.000008758948,0.000042905955,0.000110067,0.000007716737,0.000013003794,0.000042704418,0.000038074795,0.9937735,0.00074992306,0.0050175684,0.0001853404,0.000010445485],"about_ca_topic_score_codex":0.0049676136,"about_ca_topic_score_gemma":0.004151352,"teacher_disagreement_score":0.0049676136,"about_ca_system_score_codex":0.0015355159,"about_ca_system_score_gemma":0.0012825179,"threshold_uncertainty_score":0.011141002},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048806667,0.0005627353,0.9371475,0.0012673328,0.00016624224,0.00021622152,0.0010804237,0.0005170101,0.010235844],"genre_scores_gemma":[0.9201491,0.0016862683,0.059645385,0.00047190516,0.00023813645,0.00090074464,0.0011887081,0.00013366502,0.015586065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873394,0.00034559338,0.000078229816,0.00027220315,0.0003391272,0.00023091932],"domain_scores_gemma":[0.9973424,0.0014240856,0.00040940504,0.00021771641,0.00044843584,0.00015803144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014139957,0.0009842053,0.0012288807,0.0008323217,0.00076315267,0.0017071392,0.00248252,0.0020599,0.0032740186],"category_scores_gemma":[0.004736079,0.0006528996,0.001059587,0.0010221681,0.0013084997,0.0023848077,0.0011741946,0.0019926291,0.000898387],"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.000080678336,0.000050658044,0.00083889277,0.00008581156,0.000029238265,0.00021792583,0.00015746822,0.8801493,0.0027009742,0.110979706,0.0012840655,0.003425267],"study_design_scores_gemma":[0.000017668346,0.000025947735,0.00014025877,0.000009263259,0.0000109918465,0.000049605907,0.000014575224,0.98279405,0.00022264055,0.015930975,0.00077009096,0.0000138857495],"about_ca_topic_score_codex":0.0089002345,"about_ca_topic_score_gemma":0.0052031446,"teacher_disagreement_score":0.0089002345,"about_ca_system_score_codex":0.0017825459,"about_ca_system_score_gemma":0.0014414637,"threshold_uncertainty_score":0.017696857},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11372962,0.000619948,0.87779385,0.00010977016,0.000033774897,0.00005844188,0.00007675378,0.00023918955,0.0073386985],"genre_scores_gemma":[0.9342827,0.0004287584,0.06339585,0.000026630756,0.000033438402,0.000061664025,0.000040716255,0.000008532312,0.001721659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00014053562,0.00003583981,0.00007875893,0.00018112473,0.00007010031],"domain_scores_gemma":[0.9988005,0.0005987384,0.00020648623,0.00015713036,0.00020235691,0.00003468098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065296993,0.0007965242,0.00055817823,0.00047084125,0.00048246302,0.0010106633,0.0006854368,0.0005635819,0.00068149704],"category_scores_gemma":[0.0021852623,0.00030166312,0.00032195853,0.00074466167,0.0005152745,0.000882442,0.00065411004,0.00042290983,0.00023427785],"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.00045677385,0.00014359875,0.0047315517,0.00024068133,0.00012153444,0.0009869925,0.00042450038,0.7893893,0.026403522,0.052877877,0.0010709794,0.12315269],"study_design_scores_gemma":[0.000019855437,0.00012036267,0.00031641283,0.000009837566,0.00003255768,0.000504208,0.000047565536,0.9874786,0.0029271499,0.0076583163,0.0008691464,0.000015888152],"about_ca_topic_score_codex":0.0012180987,"about_ca_topic_score_gemma":0.002148305,"teacher_disagreement_score":0.0012180987,"about_ca_system_score_codex":0.00055276207,"about_ca_system_score_gemma":0.0006093697,"threshold_uncertainty_score":0.004010558},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19258761,0.0016635103,0.7995793,0.00065422326,0.00009809147,0.00031238908,0.00006231056,0.00055727945,0.0044852244],"genre_scores_gemma":[0.9577416,0.0004664795,0.04046619,0.00012305751,0.0000998965,0.00009233737,0.000052750656,0.000031731015,0.0009259548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952101,0.0013926282,0.00028831782,0.00066128635,0.0020237858,0.0004239227],"domain_scores_gemma":[0.988948,0.006646701,0.0010547981,0.0012776259,0.0014832299,0.0005897412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003486307,0.0009734088,0.002002283,0.0007472421,0.0019212499,0.0015922133,0.0027231807,0.0014932213,0.0006771891],"category_scores_gemma":[0.01220835,0.000716101,0.00037194774,0.0011297594,0.0012235047,0.004430672,0.0038447147,0.0016632417,0.00026813315],"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.0018104266,0.0009928525,0.009588453,0.0010907523,0.00030735822,0.00396464,0.0039865016,0.4728101,0.105627544,0.09152599,0.004635353,0.3036601],"study_design_scores_gemma":[0.00007208766,0.0002477939,0.0007441709,0.000018670044,0.000058435966,0.00063537835,0.00034134503,0.96088445,0.010047995,0.023523642,0.0033667816,0.00005922665],"about_ca_topic_score_codex":0.0019107653,"about_ca_topic_score_gemma":0.0015036016,"teacher_disagreement_score":0.003486307,"about_ca_system_score_codex":0.0009177838,"about_ca_system_score_gemma":0.0011506294,"threshold_uncertainty_score":0.018437564},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08091066,0.0025798352,0.9046308,0.0008640228,0.00031312802,0.00041912493,0.0001626271,0.0014491755,0.008670654],"genre_scores_gemma":[0.90226,0.0005716991,0.09470132,0.00011824712,0.00007225468,0.00010934506,0.00009035713,0.000056529323,0.002020233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856454,0.0003378467,0.000080002785,0.00013225497,0.00042673602,0.00045861298],"domain_scores_gemma":[0.9984628,0.00032063376,0.0002021616,0.00045234116,0.00038998973,0.00017213494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014371079,0.0005631115,0.0009595526,0.0006330986,0.0016386253,0.0022683472,0.0017729823,0.0009955533,0.0022992152],"category_scores_gemma":[0.0028108093,0.0003373742,0.00057513005,0.0014709634,0.0011176692,0.0039213016,0.003800152,0.0012008271,0.00091726583],"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.0014205186,0.00032456202,0.0016563084,0.0005520267,0.00013978027,0.0015272414,0.0008227688,0.43348774,0.058058906,0.3295391,0.018200064,0.15427089],"study_design_scores_gemma":[0.00008264109,0.00009961975,0.00029609338,0.00003937789,0.000025162606,0.00034114902,0.00023432635,0.919126,0.01244727,0.05635444,0.010917514,0.000036473375],"about_ca_topic_score_codex":0.003119405,"about_ca_topic_score_gemma":0.0024472077,"teacher_disagreement_score":0.003119405,"about_ca_system_score_codex":0.0014556533,"about_ca_system_score_gemma":0.0019700788,"threshold_uncertainty_score":0.010561526},"labels":[],"label_agreement":null}]}