{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":13,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":13,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"aeb8894ddc71","filters":{"venue":"Journal of High Speed Networks"}},"results":[{"id":"W1622251338","doi":"10.3233/hsn-2001-208","title":"Survivability of lightwave networks – path lengths in WDM protection scheme","year":2001,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Survivability; Computer science; Wavelength-division multiplexing; Scheme (mathematics); Path (computing); Computer network; Path protection; Topology (electrical circuits); Distributed computing; Mathematics; Physics; Optics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01101293179111183,"gpt":0.215381259874725,"spread":0.2043683280836132,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006763809,0.0002704131,0.0006676159,0.000230907,0.00003715902,0.0000209443,0.0003447865,0.0004227322,0.00004360559],"category_scores_gemma":[0.0001709717,0.0002400996,0.0001620314,0.0009572,0.0001265142,0.0003291385,0.0000726127,0.001410097,0.000002038345],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002193476,"about_ca_system_score_gemma":0.00001726744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001506903,"about_ca_topic_score_gemma":0.00004769287,"domain_scores_codex":[0.9978485,0.00006734264,0.001078715,0.0001883465,0.0003008318,0.0005162654],"domain_scores_gemma":[0.9988126,0.0002151613,0.0003364599,0.000347943,0.0001843295,0.0001035457],"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.0001575793,0.00008411404,0.003932975,0.00002557008,0.00005333589,0.00008334199,0.00001770456,0.9732215,0.0003946449,0.0003639414,0.0002914404,0.02137388],"study_design_scores_gemma":[0.001194899,0.0003894264,0.01806448,0.0003722725,0.00003098458,0.0001674299,0.00007270489,0.9738473,0.0004621079,0.003617578,0.001394827,0.0003860424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7122965,0.002215348,0.2832468,0.0001781069,0.001054884,0.0003108948,0.000001069268,0.0001915554,0.0005047654],"genre_scores_gemma":[0.9825369,0.00239378,0.01437489,0.00001254979,0.000610868,0.000004105798,0.000001677882,0.00004647624,0.00001877411],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2702403,"threshold_uncertainty_score":0.9790977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145623489","doi":"10.3233/hsn-2000-187","title":"A hierarchical Quality of Service control architecture for configurable multimedia applications","year":2000,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Architecture; Multimedia; Quality of service; Control (management); Quality (philosophy); Service (business); Computer network; Service quality; Computer architecture; Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01471951635159291,"gpt":0.269745154777049,"spread":0.2550256384254561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001393321,0.0001717112,0.0006387638,0.0001161245,0.00009889093,0.00008740045,0.001033013,0.0001543831,0.00005602253],"category_scores_gemma":[0.00005589745,0.0001384002,0.0002396265,0.0004356482,0.00005593061,0.0002607235,0.00002961301,0.0004701092,0.000008418711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003832671,"about_ca_system_score_gemma":0.0001356306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001076273,"about_ca_topic_score_gemma":0.00002065322,"domain_scores_codex":[0.9976101,0.0002446093,0.001134659,0.0002374657,0.000431044,0.0003421161],"domain_scores_gemma":[0.9968307,0.001132524,0.0008261078,0.0004814494,0.0005093315,0.0002198973],"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.0007601663,0.0003708809,0.0002241105,0.0001856894,0.0003832592,0.00001398378,0.0008388329,0.8012727,0.01254322,0.01211391,0.001690871,0.1696024],"study_design_scores_gemma":[0.00784673,0.000493138,0.005829385,0.000285056,0.0001043379,0.000346584,0.00004054446,0.9596111,0.001652098,0.01248324,0.01080905,0.0004987814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02701521,0.0003721955,0.9682748,0.002980918,0.0002328588,0.0005947006,0.00001036584,0.0000315109,0.0004874716],"genre_scores_gemma":[0.8611079,0.00002064833,0.1372937,0.0005458659,0.000906416,0.00001600761,0.000003582568,0.00001606316,0.00008979928],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8340927,"threshold_uncertainty_score":0.5643795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1519261503","doi":"10.3233/hsn-2000-185","title":"Resource management issues in future wireless multimedia networks","year":2000,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Wireless Communication Networks Research","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":"University of Waterloo","funders":"","keywords":"Computer science; Multimedia; Wireless; Wireless network; Resource (disambiguation); Computer network; Resource management (computing); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.009770102355311037,"gpt":0.2610077353668496,"spread":0.2512376330115386,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00166056,0.0002974806,0.0005787463,0.0004204711,0.0001652958,0.0003149887,0.003677024,0.0002666166,0.0002300595],"category_scores_gemma":[0.000008496814,0.0002618085,0.0001818175,0.001661248,0.0001108726,0.0006974085,0.0004955558,0.001630029,0.00003137884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001762324,"about_ca_system_score_gemma":0.0000422147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003067536,"about_ca_topic_score_gemma":0.00003156562,"domain_scores_codex":[0.996278,0.0005892115,0.001059742,0.0003745238,0.0009159312,0.0007825524],"domain_scores_gemma":[0.9975049,0.0003200036,0.0004207035,0.001269443,0.0001849417,0.000299961],"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.000114321,0.0001535806,0.000328493,0.000007272607,0.00006121818,0.0003157262,0.0002150142,0.5225154,0.000002267522,0.002724985,0.02630793,0.4472538],"study_design_scores_gemma":[0.001465962,0.0001229338,0.01173407,0.0002503651,0.00001275664,0.0001100529,0.00009606718,0.8919703,0.00001021562,0.000313774,0.09361796,0.0002955734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2699129,0.06032253,0.5717378,0.06139122,0.005893093,0.002478794,0.000003725898,0.0006281528,0.0276318],"genre_scores_gemma":[0.9455008,0.01912291,0.02944132,0.0006023251,0.003237304,0.000007238363,0.000007172176,0.00004752116,0.002033388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.675588,"threshold_uncertainty_score":0.9999834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4308196315","doi":"10.3233/jhs-222018","title":"Double Q-learning based routing protocol for opportunistic networks","year":2022,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Opportunistic and Delay-Tolerant 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Reinforcement learning; Computer network; Routing protocol; Node (physics); Overhead (engineering); Zone Routing Protocol; Protocol (science); Hop (telecommunications); Estimator; Wireless Routing Protocol; Routing (electronic design automation); Distributed computing; Artificial intelligence; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04024305745472528,"gpt":0.2874877311948438,"spread":0.2472446737401185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002904217,0.0003567851,0.0006941373,0.0002463259,0.001069482,0.0003522325,0.001546701,0.000154773,0.0002371117],"category_scores_gemma":[0.000021418,0.0003302154,0.0004041889,0.0007180831,0.00006415596,0.0004133105,0.0004609395,0.001602681,0.000001661175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002096759,"about_ca_system_score_gemma":0.0005060782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001236066,"about_ca_topic_score_gemma":0.00000121505,"domain_scores_codex":[0.9962078,0.0003009073,0.001344084,0.0004505822,0.0008275643,0.0008690538],"domain_scores_gemma":[0.9961784,0.000703291,0.001809929,0.0004882108,0.0003987679,0.000421394],"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.0009020202,0.0001910686,0.000258676,0.0000201564,0.00007107542,0.0003496354,0.00005705033,0.9393123,0.000005134534,0.009184094,0.02202815,0.02762059],"study_design_scores_gemma":[0.005016043,0.001180481,0.0000462335,0.0000915581,0.00005069661,0.0003229165,0.00004516434,0.9498693,0.000003920395,0.0006366167,0.04237365,0.000363379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001006208,0.00003256484,0.9798014,0.0006040218,0.001649183,0.01684046,0.000002578988,0.0001116556,0.0008575586],"genre_scores_gemma":[0.9602688,0.000005428135,0.02480074,0.001332336,0.002812338,0.009626279,0.00002726721,0.00008269851,0.001044134],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9601682,"threshold_uncertainty_score":0.999915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3136878226","doi":"10.3233/jhs-210648","title":"A fuzzy-based check-and-spray geocast routing protocol for opportunistic networks","year":2021,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Opportunistic and Delay-Tolerant 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Geocast; Routing protocol; Flooding (psychology); Latency (audio); Wireless Routing Protocol; Dynamic Source Routing; Zone Routing Protocol; Routing (electronic design automation); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.03715383016495805,"gpt":0.2875374564092956,"spread":0.2503836262443376,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001656975,0.0004308889,0.000875637,0.0001551523,0.0003754302,0.0005542772,0.0008142752,0.000340966,0.00005251391],"category_scores_gemma":[0.000066612,0.0003736392,0.0003707574,0.0005886389,0.0001218998,0.0004640004,0.0002673863,0.000874142,0.000002223236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009084411,"about_ca_system_score_gemma":0.0007747147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005524785,"about_ca_topic_score_gemma":0.000006908606,"domain_scores_codex":[0.9963672,0.0002094975,0.001416921,0.0005563654,0.0005735483,0.0008764851],"domain_scores_gemma":[0.9957756,0.000819154,0.001324188,0.0006187744,0.0008480771,0.0006141866],"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.001929731,0.001394582,0.001998839,0.000378868,0.0007892009,0.007468004,0.0003095398,0.3481328,0.0002132785,0.1246661,0.09949062,0.4132285],"study_design_scores_gemma":[0.003594494,0.0005083375,0.0001884833,0.0004535166,0.00009512836,0.0009362501,0.00003151102,0.9807933,0.00004103628,0.002207596,0.01070875,0.0004416202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002123616,0.0001248781,0.9859195,0.001334896,0.001213839,0.01014347,0.000005596067,0.00006892588,0.0009765787],"genre_scores_gemma":[0.9028546,0.00003486824,0.08665197,0.002594196,0.004274765,0.002847825,0.0000326363,0.00008623198,0.0006229649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9026422,"threshold_uncertainty_score":0.9998716,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1714480694","doi":"10.3233/hsn-2006-282","title":"Destination-driven shortest path tree algorithms","year":2006,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Data Management and Algorithms","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 Ottawa","funders":"","keywords":"Computer science; Path (computing); Tree (set theory); Algorithm; Shortest path problem; Theoretical computer science; Computer network; Mathematics; Combinatorics; Graph","retraction":null,"screen_n_in":null,"score":{"opus":0.00937035923181781,"gpt":0.2166548126016384,"spread":0.2072844533698206,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004578307,0.0001658451,0.000261372,0.0002038358,0.0001111068,0.000356728,0.001183933,0.00006352156,0.0000221249],"category_scores_gemma":[0.00001782831,0.0001371494,0.000121433,0.000529727,0.00003874541,0.001231393,0.0002061555,0.0002776545,0.00001567306],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005471817,"about_ca_system_score_gemma":0.00003583311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003931933,"about_ca_topic_score_gemma":0.00001335663,"domain_scores_codex":[0.9983692,0.00005125692,0.0005462908,0.0002128463,0.0005031255,0.0003173087],"domain_scores_gemma":[0.9987915,0.000100296,0.0004653186,0.0003363122,0.000205415,0.0001011611],"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.00002600422,0.0006285886,0.007978036,0.00001025459,0.0001570582,0.001565045,0.00007605519,0.2263972,0.0001376868,0.06318308,0.2127755,0.4870655],"study_design_scores_gemma":[0.0009704559,0.0002701163,0.0609565,0.00006997972,0.00004686082,0.0001776181,0.0000112584,0.9208708,0.00005793706,0.005588421,0.01068928,0.000290759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008269142,0.0002806115,0.9865341,0.0009401187,0.001461478,0.00009337396,0.000002435748,0.00006216498,0.002356568],"genre_scores_gemma":[0.8159804,0.00009303261,0.1801556,0.0002030673,0.002680249,9.518159e-7,0.00001874276,0.00001725834,0.0008506649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8077112,"threshold_uncertainty_score":0.559279,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1667406537","doi":"10.3233/hsn-2007-324","title":"Network profit optimization for traffic grooming in WDM networks with wavelength converters","year":2007,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"","keywords":"Traffic grooming; Computer science; Wavelength-division multiplexing; Converters; Computer network; Wavelength; Telecommunications; Electrical engineering; Optics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.007471200722617087,"gpt":0.208092883144962,"spread":0.2006216824223449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008590737,0.0003610615,0.0006629112,0.0002565949,0.00008699646,0.00005212123,0.0003550517,0.0003928255,0.00001450597],"category_scores_gemma":[0.00004705889,0.0003067141,0.0001185196,0.0008892458,0.0001111268,0.0003732411,0.00003453662,0.0009938775,5.260304e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002659978,"about_ca_system_score_gemma":0.00002142789,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001285773,"about_ca_topic_score_gemma":0.00003943064,"domain_scores_codex":[0.9974943,0.00002418812,0.0009943022,0.0002289944,0.0002601763,0.0009979996],"domain_scores_gemma":[0.9985677,0.0005395681,0.0003376899,0.0002277554,0.0001690805,0.0001582316],"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.0004933105,0.0000208481,0.0004885182,0.00002445897,0.00007176292,0.00008522657,0.00002862792,0.9504982,0.000005160026,0.0003069256,0.001240962,0.04673604],"study_design_scores_gemma":[0.001855256,0.0003832765,0.0007638869,0.0003342897,0.00006237673,0.00009779391,0.0001206831,0.9955301,0.00001989505,0.0002053937,0.0002586163,0.0003684143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07348049,0.001359273,0.9231688,0.000123751,0.001042612,0.0004869304,7.688135e-7,0.0002473301,0.00009003061],"genre_scores_gemma":[0.7350276,0.0004524208,0.2631498,0.00008097057,0.001172456,0.000005737673,0.000007707273,0.00009132777,0.00001195766],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6615471,"threshold_uncertainty_score":0.9999385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W219812769","doi":"10.3233/jhs-130457","title":"A distributed framework for energy-efficient lightpaths in computational grids","year":2013,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Energy (signal processing); Computer network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.006450147394693374,"gpt":0.2173566089636793,"spread":0.2109064615689859,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001292996,0.000180293,0.0003601828,0.0001547882,0.00003890843,0.00004547587,0.000261294,0.000243415,0.00003032265],"category_scores_gemma":[0.0001094655,0.0001542188,0.0001135512,0.0004340223,0.00005850451,0.00012574,0.00003968347,0.0005348493,0.000003902155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001558742,"about_ca_system_score_gemma":0.00001341699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002411826,"about_ca_topic_score_gemma":0.000001651038,"domain_scores_codex":[0.9986776,0.00001466095,0.0005985951,0.0001165766,0.0002001734,0.0003924499],"domain_scores_gemma":[0.9988983,0.0005573752,0.0001468311,0.0001316002,0.0001686929,0.00009715209],"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.00002269097,0.00004436378,0.00008628365,0.000008082384,0.00003392647,0.00001376528,0.000009612586,0.9582024,0.00001877032,0.03171388,0.003338901,0.006507313],"study_design_scores_gemma":[0.0004864709,0.0001024241,0.002091055,0.0001316558,0.00001215149,0.00002269467,0.00002725972,0.8860589,0.00004598529,0.11014,0.0007173332,0.0001641067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08906457,0.0009417905,0.9085414,0.0004654135,0.0006869304,0.000140352,0.000006886297,0.0001205327,0.00003215215],"genre_scores_gemma":[0.810219,0.0001015292,0.1891512,0.00005192508,0.0004225123,0.000009811669,0.00001157199,0.00002811057,0.00000430909],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7211545,"threshold_uncertainty_score":0.628886,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1810000146","doi":"10.3233/hsn-2002-216","title":"A scalable logical topology for optical networks","year":2002,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Scalability; Topology (electrical circuits); Computer network; Logical topology; Network topology; Distributed computing; Theoretical computer science; Operating system; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01670852449709481,"gpt":0.2311787562284757,"spread":0.2144702317313809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002623977,0.0002824615,0.0006644953,0.0001289087,0.00008759498,0.00004740755,0.0004568389,0.0005406649,0.000212767],"category_scores_gemma":[0.0001655131,0.0002316743,0.0002406207,0.0003547459,0.0002332972,0.000200278,0.00007509689,0.001031293,0.00001362402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001160536,"about_ca_system_score_gemma":0.000004776785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.908541e-7,"about_ca_topic_score_gemma":0.00000170342,"domain_scores_codex":[0.9980345,0.00002014941,0.0007574874,0.0001926637,0.0002012371,0.0007939691],"domain_scores_gemma":[0.9986193,0.0006096829,0.0001525639,0.000262687,0.0001453983,0.0002103305],"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.00006518956,0.00005843455,0.00008210658,0.000009980481,0.00009058842,0.00008136993,0.000005562462,0.9357388,0.00005051398,0.01035126,0.02815638,0.02530984],"study_design_scores_gemma":[0.001047248,0.0005554005,0.0002307668,0.00005499475,0.00007245789,0.0003222162,0.0000210302,0.9817713,0.00008998959,0.006136861,0.009394437,0.0003032429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04405234,0.007137076,0.9430195,0.0009472545,0.002219798,0.0002683494,0.00000201586,0.0004035595,0.001950107],"genre_scores_gemma":[0.898348,0.001929578,0.09731087,0.0001756419,0.00201101,0.000006347249,0.000002174267,0.00006028091,0.0001561405],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8542956,"threshold_uncertainty_score":0.9447404,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2800563874","doi":"10.3233/hsn-2005-257","title":"Transformations of self-stabilizing algorithms","year":2005,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00907508062188082,"gpt":0.2304009251052102,"spread":0.2213258444833294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005322568,0.000102639,0.0003024117,0.0000993895,0.00006579497,0.00006752588,0.000582886,0.0000723685,0.00001258531],"category_scores_gemma":[0.000008177375,0.00008291926,0.0001515016,0.0003856551,0.00002042779,0.0008632992,0.00002738005,0.0002432389,0.000004139359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005329272,"about_ca_system_score_gemma":0.00006038229,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006662025,"about_ca_topic_score_gemma":0.000003433181,"domain_scores_codex":[0.9985384,0.00004834043,0.0007756935,0.00009451003,0.0003350201,0.0002080662],"domain_scores_gemma":[0.9988378,0.00006730083,0.0004985569,0.0002149752,0.0002771528,0.0001042221],"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.00003994217,0.0006441655,0.0005330987,0.00006851846,0.0002787933,0.00006373571,0.002964675,0.7142466,0.0005841957,0.03159252,0.01641846,0.2325653],"study_design_scores_gemma":[0.001235849,0.0002149673,0.002867714,0.0001721629,0.00003284897,0.0003273215,0.00007654799,0.9604035,0.0007327166,0.0004078473,0.03332491,0.0002035946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03228239,0.001072124,0.9639654,0.001004413,0.000703905,0.00008043635,0.000004352171,0.00003355219,0.0008534181],"genre_scores_gemma":[0.9428623,0.0001344686,0.05634471,0.00007228277,0.0005539202,4.178634e-7,9.895355e-7,0.000005415801,0.00002544632],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.91058,"threshold_uncertainty_score":0.3381349,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4380080183","doi":"10.3233/jhs-222063","title":"Improved design of load balancing for multipath routing protocol","year":2023,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"AI and Multimedia in Education","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Computer network; Zone Routing Protocol; Routing protocol; Wireless Routing Protocol; Path vector protocol; Distance-vector routing protocol; Dynamic Source Routing; Multipath routing; Load balancing (electrical power); Hazy Sighted Link State Routing Protocol; Link-state routing protocol; Distributed computing; Routing (electronic design automation)","retraction":null,"screen_n_in":null,"score":{"opus":0.02825589497607551,"gpt":0.3009281810961745,"spread":0.272672286120099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519012,0.0001067509,0.0002508717,0.0001181172,0.00007623104,0.00004995703,0.0004998581,0.00008118954,0.000003201973],"category_scores_gemma":[0.0002960237,0.0000859846,0.0001058135,0.000396816,0.00001956135,0.0003225845,0.00007030185,0.0001856628,0.000001885471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008926576,"about_ca_system_score_gemma":0.0002667425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001458404,"about_ca_topic_score_gemma":0.000001021518,"domain_scores_codex":[0.998692,0.00006132477,0.0005698597,0.0001410603,0.0002546293,0.0002811788],"domain_scores_gemma":[0.9979486,0.000532786,0.0007808779,0.0001950054,0.0004542867,0.00008839974],"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.0005397245,0.0003750216,0.001918104,0.0001652365,0.0001746334,0.00003034855,0.004920218,0.6923776,0.02385945,0.001107865,0.02872744,0.2458043],"study_design_scores_gemma":[0.00126543,0.0003430016,0.001834184,0.0001200061,0.00001198458,0.00001493422,0.0000568086,0.9930885,0.002308198,0.0003853935,0.0004745501,0.00009705107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004131431,0.00001134443,0.9847317,0.0002792399,0.001345351,0.009446523,5.499258e-7,0.00003873834,0.00001510251],"genre_scores_gemma":[0.7025002,0.000008791915,0.2942003,0.00009163831,0.001611875,0.001444937,0.000001255977,0.00002073568,0.0001202396],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6983688,"threshold_uncertainty_score":0.3506351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4401977969","doi":"10.3233/jhs-240075","title":"Survey on securing wireless networks through a blockchain-based framework","year":2024,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"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":"Blockchain; Computer science; Computer security; Computer network; Wireless network; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01505217524968778,"gpt":0.2591490460183147,"spread":0.2440968707686269,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001449885,0.0003073907,0.000502044,0.0002796417,0.0002316351,0.0002910012,0.001557525,0.000546879,0.00002358989],"category_scores_gemma":[0.0000634648,0.000257807,0.0002426165,0.001664631,0.0001298392,0.0001037282,0.0001800154,0.002187479,0.00001359305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001201254,"about_ca_system_score_gemma":0.0001313395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005186646,"about_ca_topic_score_gemma":0.00002461136,"domain_scores_codex":[0.9975918,0.0002107387,0.0007328875,0.0004719416,0.0004492509,0.000543388],"domain_scores_gemma":[0.9970999,0.001352898,0.0003665845,0.0007996314,0.0002320557,0.0001489037],"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.00007305345,0.0002573932,0.0005283885,0.00002260221,0.0001934567,0.0003823186,0.0002507576,0.6873364,0.00001148902,0.2665123,0.01011639,0.03431541],"study_design_scores_gemma":[0.0003083308,0.000280333,0.002247734,0.0004637768,0.00002655708,0.00007285286,0.000008089519,0.9724358,0.0001773607,0.02180031,0.001889683,0.0002891395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1434403,0.003369414,0.8481746,0.002603309,0.001894986,0.0001527434,0.000003650579,0.0002715627,0.00008944125],"genre_scores_gemma":[0.9859524,0.0001769817,0.01183758,0.0009207542,0.001042998,0.000004965475,0.000002978606,0.00003481735,0.00002655724],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8425121,"threshold_uncertainty_score":0.9999874,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098372141","doi":"10.3233/hsn-2001-203","title":"Hierarchical photonic LANs using spectral folding","year":2001,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Transmitter; Local area network; Bandwidth (computing); Computer network; Throughput; Wavelength-division multiplexing; Electronic engineering; Channel (broadcasting); Telecommunications; Wavelength; Wireless; Physics; Optics","retraction":null,"screen_n_in":null,"score":{"opus":0.01398069110018204,"gpt":0.2402146096726273,"spread":0.2262339185724452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001919405,0.0002114019,0.0004130557,0.0001780465,0.00006832366,0.00004462256,0.0003314861,0.0002088933,0.00009634069],"category_scores_gemma":[0.00004101829,0.0001860736,0.000158774,0.0004639658,0.00008973105,0.0002431158,0.00005242267,0.001112703,0.000005194732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002045633,"about_ca_system_score_gemma":0.0000157024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002249919,"about_ca_topic_score_gemma":0.000004290748,"domain_scores_codex":[0.9985232,0.00002039393,0.0005245529,0.0001237922,0.000244337,0.000563692],"domain_scores_gemma":[0.9993408,0.0001434747,0.0001248399,0.0001963561,0.00005308256,0.0001414359],"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.00004739771,0.00001963938,0.0006065598,0.000005617365,0.00007543706,0.0003949319,0.00001282557,0.9891537,0.001905639,0.001234371,0.0006051935,0.005938679],"study_design_scores_gemma":[0.0008088181,0.000178137,0.001362577,0.0001752559,0.00007591831,0.001460848,0.00004527956,0.98321,0.000851869,0.007736508,0.003729174,0.0003655587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.787743,0.00170579,0.2083728,0.0001202168,0.0009661717,0.00006776607,7.111069e-7,0.0002433472,0.0007802169],"genre_scores_gemma":[0.9301807,0.001504924,0.06693234,0.00003963092,0.00126711,5.516789e-7,7.503581e-7,0.00005073476,0.00002329714],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1424377,"threshold_uncertainty_score":0.7587861,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}