{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":11,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":11,"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","author_layer_release":"2026-06-26"},"query_hash":"ea84488bbdb1","filters":{"venue":"2013 International Conference on Computing, Networking and Communications (ICNC)"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Nari","is_ca":true},{"name":"Ali A. Ghorbani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06834772293007085,"gpt":0.3245046573709163,"spread":0.2561569344408455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003564099,0.0002954222,0.0002266506,0.0002547732,0.0006434804,0.0006217026,0.002531407,0.0001466821,0.00008058038],"category_scores_gemma":[0.00004007281,0.0003023409,0.00007751464,0.0004308043,0.0001631089,0.0003782794,0.0006772798,0.0005427361,0.0001521292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001397232,"about_ca_system_score_gemma":0.0000840142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001098559,"about_ca_topic_score_gemma":0.00002337529,"domain_scores_codex":[0.9978695,0.0002607852,0.0005004875,0.000582411,0.0004129223,0.0003739323],"domain_scores_gemma":[0.9966314,0.000392965,0.0004291477,0.001849744,0.0005614636,0.0001352976],"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.00002586615,0.0005773715,0.003843206,0.00001285534,0.00006292948,0.000004386512,0.0002481927,0.01392646,0.0003339491,0.4970091,0.02948749,0.4544682],"study_design_scores_gemma":[0.0002418285,0.0001413646,0.0133204,0.0002233664,0.000007325881,0.00001014773,0.00002829076,0.9683877,0.00003807608,0.004081294,0.01321365,0.0003066174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005781254,0.0001969839,0.9300797,0.01454215,0.001766153,0.001236031,0.000009464791,0.004795349,0.04159292],"genre_scores_gemma":[0.9079086,0.0002342209,0.09003366,0.00104976,0.0002063585,0.0002685198,0.00006786879,0.00002443802,0.0002066235],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9544612,"threshold_uncertainty_score":0.9999429,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Hind Alwan","is_ca":true},{"name":"Anjali Agarwal","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05600681202174877,"gpt":0.2950054410584486,"spread":0.2389986290366999,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000560128,0.0003963891,0.0003685954,0.0002134442,0.0009530229,0.0009569448,0.003132711,0.0001984788,0.0000204947],"category_scores_gemma":[0.00005262961,0.0004021733,0.0001410315,0.0003692105,0.0002432584,0.0003568376,0.001387739,0.000641548,0.00004135036],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001245458,"about_ca_system_score_gemma":0.00006596095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003156811,"about_ca_topic_score_gemma":0.00009252855,"domain_scores_codex":[0.9972758,0.0002981952,0.0006410957,0.0007811949,0.0003532989,0.0006504739],"domain_scores_gemma":[0.9957332,0.001107817,0.0005275617,0.001589637,0.0008552944,0.0001865149],"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.00003215859,0.0005892763,0.002714162,0.00001650832,0.0003156655,0.000003315867,0.001800277,0.271322,0.0003268978,0.4689796,0.005966282,0.2479339],"study_design_scores_gemma":[0.0006457209,0.0000810343,0.001587508,0.0002813508,0.00001178442,0.00001646312,0.000198332,0.9920782,0.00002093372,0.000523099,0.004117943,0.0004376662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01334825,0.0003667611,0.972091,0.004620396,0.002319631,0.0007520692,0.00000514535,0.0004656521,0.006031103],"genre_scores_gemma":[0.8817081,0.0006150996,0.1156226,0.000617784,0.0006905656,0.0001315221,0.00006057842,0.0000373621,0.0005163231],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8683599,"threshold_uncertainty_score":0.999843,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Gabi Sarkis","is_ca":true},{"name":"Warren J. Gross","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1218389801662435,"gpt":0.3524047824314154,"spread":0.2305658022651719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0006511681,0.0002267243,0.0002148611,0.0001867417,0.0006735192,0.0007598386,0.006896975,0.00009519014,0.00002247057],"category_scores_gemma":[0.00006339769,0.000235182,0.00005280118,0.0002493901,0.000159832,0.000434362,0.002834849,0.000376081,0.00006037834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006590912,"about_ca_system_score_gemma":0.00008484831,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004938715,"about_ca_topic_score_gemma":0.0001162181,"domain_scores_codex":[0.9982219,0.0001493756,0.0004237307,0.0006289973,0.0002661745,0.0003098406],"domain_scores_gemma":[0.9949033,0.0006995025,0.0003400998,0.003393947,0.0005539957,0.0001091762],"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.000004661861,0.0001630108,0.001007314,0.00001309746,0.00007647589,3.070689e-7,0.0004231519,0.0001248941,0.0001750133,0.6844324,0.02198966,0.29159],"study_design_scores_gemma":[0.0001609021,0.0000521364,0.0005316969,0.0001113708,0.000008719288,0.00001111393,0.00006300525,0.880814,0.00001557593,0.02502989,0.09295496,0.0002466142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008808929,0.0005337447,0.9735645,0.01006372,0.0005260541,0.0008554006,0.00002898465,0.000671606,0.01287507],"genre_scores_gemma":[0.7888284,0.0005428393,0.2091454,0.000503079,0.0002426838,0.0002442079,0.0002321533,0.00001925853,0.0002420102],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8806891,"threshold_uncertainty_score":0.9984762,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Irfan Al‐Anbagi","is_ca":true},{"name":"Mounib Khanafer","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06950999142397984,"gpt":0.2933983301118478,"spread":0.223888338687868,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003845149,0.000230281,0.0002183893,0.0001612278,0.0005402007,0.0006866127,0.001780125,0.00009749328,0.00001318833],"category_scores_gemma":[0.0000380264,0.0002320976,0.00005427183,0.0001753443,0.0001859764,0.0002080481,0.0007387048,0.0002824005,0.000009596291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000568322,"about_ca_system_score_gemma":0.00008023243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002966385,"about_ca_topic_score_gemma":0.0001725527,"domain_scores_codex":[0.9983894,0.0001245742,0.0003869609,0.0004826066,0.0002537564,0.0003626744],"domain_scores_gemma":[0.9973273,0.0006846574,0.0002627707,0.001143651,0.000445333,0.0001362599],"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.00001280622,0.0001600572,0.0004239689,0.00001560567,0.00005084673,4.532648e-7,0.0003852722,0.3048356,0.00004470118,0.6096607,0.00745054,0.07695945],"study_design_scores_gemma":[0.0003965814,0.00005262932,0.0003271253,0.0001809335,0.000008381724,0.000004866409,0.00002731348,0.9875578,0.000005623744,0.006781342,0.00440947,0.0002479109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004960903,0.0003079733,0.9742039,0.009403469,0.0004026913,0.0003887672,0.000009499406,0.0002161542,0.01010657],"genre_scores_gemma":[0.872247,0.0004201969,0.1257559,0.0007897488,0.0001116179,0.00008472394,0.00005936973,0.00001824308,0.0005132551],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.867286,"threshold_uncertainty_score":0.9464666,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Mohamed Elalem","is_ca":true},{"name":"Lian Zhao","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05406539781023093,"gpt":0.2876415898820545,"spread":0.2335761920718236,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007134082,0.0003282902,0.0003423849,0.0002975612,0.0006270439,0.0006862262,0.00107447,0.0001359892,0.00002757981],"category_scores_gemma":[0.000104705,0.0003440064,0.0001026557,0.000478448,0.0001705781,0.0003235484,0.0003558739,0.0005401976,0.00001437425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001911889,"about_ca_system_score_gemma":0.00006534566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001689149,"about_ca_topic_score_gemma":0.00008717812,"domain_scores_codex":[0.9976923,0.000396052,0.000457711,0.0006398064,0.0002962662,0.000517847],"domain_scores_gemma":[0.9962237,0.002129441,0.0003395056,0.0006499616,0.0005349108,0.0001224228],"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.00007944978,0.000318489,0.002659502,0.0000177403,0.0001292326,0.000002804029,0.0009809148,0.645144,0.00002269861,0.168902,0.001075293,0.1806679],"study_design_scores_gemma":[0.001037668,0.0002061713,0.002517197,0.001011776,0.000009817678,0.000007042944,0.00006753197,0.9883397,0.00001318905,0.005940265,0.0004882941,0.0003613044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01979103,0.0001931277,0.9643933,0.004540742,0.001038653,0.001289227,0.000005659079,0.0001778156,0.008570415],"genre_scores_gemma":[0.9492573,0.0002201385,0.0488672,0.0007949323,0.0005660296,0.0001562814,0.00007337496,0.00002554018,0.00003926241],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9294662,"threshold_uncertainty_score":0.9999012,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. T. Charith Gunasekara","is_ca":true},{"name":"Attahiru Sule Alfa","is_ca":true},{"name":"Pradeepa Yahampath","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1354324222664618,"gpt":0.330710470689993,"spread":0.1952780484235313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008252144,0.0003075739,0.000302398,0.0001585253,0.001228977,0.0009908198,0.00357457,0.0001039232,0.00005527724],"category_scores_gemma":[0.0000779422,0.0003088586,0.0001065033,0.0002982953,0.0002371959,0.0003834789,0.001799922,0.0004677455,0.00004254013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008946755,"about_ca_system_score_gemma":0.0001258018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003166945,"about_ca_topic_score_gemma":0.00005111279,"domain_scores_codex":[0.9978505,0.0002703459,0.0005892616,0.0005268779,0.0002757544,0.0004873122],"domain_scores_gemma":[0.9961105,0.0008748868,0.0003766248,0.001776791,0.0006805734,0.0001806431],"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.000005217704,0.00005554636,0.0001197858,0.000006547258,0.00004332222,2.820912e-7,0.0005968541,0.004697541,0.0000436088,0.8987439,0.006287671,0.08939976],"study_design_scores_gemma":[0.0003315136,0.00005080063,0.0002015646,0.0003130155,0.00001116336,0.000008920275,0.00005701208,0.934812,0.000002391178,0.0545541,0.009334207,0.0003233011],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000835985,0.0006286373,0.9536414,0.01347926,0.0006556223,0.0006423519,0.000004754178,0.0003513296,0.02976067],"genre_scores_gemma":[0.9226769,0.005514456,0.06885776,0.001420732,0.0002951872,0.0001785899,0.00006341272,0.00002632116,0.0009667017],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9301144,"threshold_uncertainty_score":0.9999363,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Samy S. Soliman","is_ca":true},{"name":"Norman C. Beaulieu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05106065220654933,"gpt":0.2888453482463421,"spread":0.2377846960397928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006348644,0.0003410933,0.00031472,0.0003494694,0.001085765,0.001468957,0.001777449,0.0001625426,0.00007252452],"category_scores_gemma":[0.00003655595,0.0003183621,0.0000479783,0.0006157491,0.0001904483,0.0005141275,0.001596689,0.0009080095,0.0000686564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001375762,"about_ca_system_score_gemma":0.00008898482,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003521728,"about_ca_topic_score_gemma":0.0002767673,"domain_scores_codex":[0.9975805,0.0004375784,0.0005308993,0.0006187949,0.0004192218,0.0004129898],"domain_scores_gemma":[0.9969368,0.0005043551,0.0003575539,0.001310538,0.0006637881,0.0002269738],"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.00003442678,0.0002652532,0.008078121,0.00002522778,0.0002859417,0.000004004126,0.004251829,0.01143113,0.0006094084,0.5592843,0.007993759,0.4077367],"study_design_scores_gemma":[0.0004369935,0.0001648486,0.007753059,0.0005352334,0.00001328873,0.00005934439,0.0001851371,0.9448683,0.00001053564,0.0007144887,0.04484065,0.0004180853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2254679,0.006132019,0.6223491,0.04805856,0.002969967,0.002634466,0.0000154237,0.001344433,0.09102804],"genre_scores_gemma":[0.9802926,0.002997203,0.01465933,0.0008831209,0.0002653,0.00009419889,0.0000327078,0.0000273626,0.0007482186],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9334372,"threshold_uncertainty_score":0.9999269,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Wei Song","is_ca":true},{"name":"Peijian Ju","is_ca":true},{"name":"Dizhi Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06617419324837946,"gpt":0.2814570877106105,"spread":0.215282894462231,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003463065,0.0002003072,0.0002195291,0.0001782114,0.0006543418,0.0002923724,0.001019922,0.00006367471,0.0000225221],"category_scores_gemma":[0.00001908202,0.0001832201,0.00002477867,0.000368844,0.0002299152,0.0005753923,0.0007566696,0.0003844379,0.00000896851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005262304,"about_ca_system_score_gemma":0.00006090953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007456054,"about_ca_topic_score_gemma":0.00004928681,"domain_scores_codex":[0.9985948,0.0002556177,0.0003762461,0.0003392134,0.0002376002,0.0001965536],"domain_scores_gemma":[0.9978915,0.000311305,0.0003431743,0.0005802303,0.0007976387,0.00007616616],"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.00005478438,0.0001999665,0.01888145,0.00001580333,0.0001793748,3.795005e-7,0.003798241,0.01237879,0.00149002,0.5538368,0.0004642489,0.4087002],"study_design_scores_gemma":[0.0003807976,0.0002844775,0.01971598,0.0003709934,0.000006778693,0.00001555176,0.0001684008,0.9778124,0.00004850928,0.0004865708,0.0005063658,0.000203141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7214566,0.0008575929,0.2401082,0.005817913,0.0003104648,0.0008023026,0.000002383516,0.000277991,0.03036652],"genre_scores_gemma":[0.9682174,0.002968935,0.02841783,0.0001585806,0.00004877884,0.00003822194,0.00001368949,0.00001185354,0.000124729],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9654337,"threshold_uncertainty_score":0.74715,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Piotr K. Tysowski","is_ca":true},{"name":"M.A. Hasan","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03765016578818742,"gpt":0.2900395208622726,"spread":0.2523893550740852,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003985951,0.0002277664,0.0002256976,0.000235326,0.0004592116,0.0007948172,0.002417042,0.0001110614,0.00004664137],"category_scores_gemma":[0.00001466927,0.0002300971,0.00005039301,0.0004927658,0.0001975513,0.0004375266,0.002030301,0.0004973306,0.00002904548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004572878,"about_ca_system_score_gemma":0.00004782784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008865869,"about_ca_topic_score_gemma":0.000268104,"domain_scores_codex":[0.9983404,0.000115549,0.0004250358,0.0005561534,0.0002469341,0.0003158805],"domain_scores_gemma":[0.9978225,0.0002229459,0.0002046522,0.001360122,0.0002526922,0.0001370859],"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.000006015872,0.0002137691,0.01046502,0.00001418455,0.00003895952,6.902459e-7,0.001738623,0.0002254213,0.00003646739,0.9021969,0.00133741,0.08372656],"study_design_scores_gemma":[0.0004556115,0.00008887651,0.01269319,0.0002243096,0.000007791557,0.00001459287,0.0003868984,0.8836473,0.00001433503,0.05804443,0.04404518,0.0003775105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4932991,0.006498381,0.4137941,0.01400324,0.001914156,0.003210116,0.00007347429,0.001066182,0.06614121],"genre_scores_gemma":[0.981037,0.001794016,0.01643654,0.0002522228,0.0001500884,0.000186103,0.00008450734,0.00001215227,0.00004735095],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8834218,"threshold_uncertainty_score":0.9383085,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"S. Sarkar","is_ca":true},{"name":"Mea Wang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07177435605892733,"gpt":0.3166720449478742,"spread":0.2448976888889468,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001756044,0.0003184278,0.0003055644,0.000507462,0.0008149158,0.001670501,0.004920451,0.0001039452,0.00003074196],"category_scores_gemma":[0.0003499895,0.0002700949,0.00007882914,0.001017242,0.0002248779,0.0003810127,0.002242152,0.0009415245,0.000160703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001598784,"about_ca_system_score_gemma":0.00006783343,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004667648,"about_ca_topic_score_gemma":0.0003154395,"domain_scores_codex":[0.9967828,0.0007617546,0.0007075846,0.0005621514,0.0007423816,0.0004432888],"domain_scores_gemma":[0.9947557,0.001433943,0.0003653083,0.002110106,0.001152052,0.0001829175],"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.00001490329,0.0002878146,0.01666614,0.0000130706,0.0001338417,0.000003411174,0.006155811,0.01652401,0.0000686741,0.6698452,0.03780179,0.2524853],"study_design_scores_gemma":[0.0003581324,0.00008943118,0.02426886,0.0006867982,0.000004996762,0.00001009297,0.0005400138,0.949523,0.000007969259,0.001431351,0.02274431,0.0003350654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.3254092,0.003509305,0.1707531,0.2562168,0.006043463,0.003872646,0.00001475673,0.0009217956,0.233259],"genre_scores_gemma":[0.9929309,0.000862582,0.003165851,0.00139619,0.000225482,0.0001583905,0.00002730898,0.0000218479,0.001211444],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.932999,"threshold_uncertainty_score":0.9999751,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sichun Wang","is_ca":true},{"name":"Robert Inkol","is_ca":true},{"name":"Brad R. Jackson","is_ca":true},{"name":"Shanzeng Guo","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03864977308457444,"gpt":0.2647509111545804,"spread":0.2261011380700059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002188659,0.0001704653,0.0001494273,0.0002582114,0.0001757675,0.0001664603,0.0007083395,0.0001367917,0.00009862662],"category_scores_gemma":[0.00003040209,0.0001809812,0.00003449581,0.0002353679,0.0001416328,0.0001425742,0.0001767716,0.0003836231,0.0000791018],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011761,"about_ca_system_score_gemma":0.00002292634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003559718,"about_ca_topic_score_gemma":0.0001956691,"domain_scores_codex":[0.9989515,0.00007675141,0.0003612054,0.0002056356,0.0001707911,0.0002340992],"domain_scores_gemma":[0.9989387,0.0001208633,0.00009203056,0.0006096995,0.0001969626,0.00004173137],"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.00003810308,0.0004375398,0.06688872,0.00009322158,0.0001534444,0.000003793899,0.001523392,0.2898712,0.0008328321,0.2063721,0.03066158,0.403124],"study_design_scores_gemma":[0.0002850816,0.00002216731,0.01393748,0.0001635062,0.000003863754,0.000002335955,0.0001131984,0.9753609,0.00009070899,0.003323551,0.006507303,0.0001899007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5869261,0.002122121,0.250244,0.02230458,0.003020849,0.001570473,0.00002064883,0.002984207,0.130807],"genre_scores_gemma":[0.9961441,0.0006543633,0.002548602,0.0002785909,0.00009305535,0.00006102298,0.0001022073,0.00001825518,0.00009986238],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6854897,"threshold_uncertainty_score":0.7380199,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}