{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Arunabha Sen","is_ca":false},{"name":"Bao Hong Shen","is_ca":false},{"name":"Subir Bandyopadhyray","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008684166,0.0008404127,0.0004958783,0.0006048419,0.0006788795,0.0007725551,0.001216547,0.0007958528,0.002787425],"category_scores_gemma":[0.003411591,0.0002980286,0.0003691037,0.001265107,0.0009660831,0.002145312,0.001244813,0.001078532,0.0002907097],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002029053,"about_ca_system_score_gemma":0.0009066124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001494642,"about_ca_topic_score_gemma":0.001267281,"domain_scores_codex":[0.9993548,0.0002285609,0.00002645746,0.0001216997,0.0001587839,0.0001096803],"domain_scores_gemma":[0.9987395,0.0007482838,0.0002164114,0.0001302684,0.00008583567,0.00007960518],"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.0004899057,0.0001434684,0.0009962396,0.0003368558,0.00003962008,0.0002123964,0.0002806064,0.7259878,0.01728816,0.1184718,0.004075062,0.1316781],"study_design_scores_gemma":[0.00007161951,0.000205574,0.0004021864,0.00003421218,0.00001684276,0.0001454985,0.00005567688,0.8673239,0.004943334,0.1231362,0.003645358,0.00001970564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1861739,0.0009912302,0.7993406,0.001254799,0.00008183001,0.0003078275,0.0004931258,0.0005730518,0.01078368],"genre_scores_gemma":[0.8123669,0.0009256172,0.1810861,0.0001628563,0.00006685891,0.0002773555,0.000387677,0.00006398915,0.004662681],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002787425,"threshold_uncertainty_score":0.01472181,"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","authors":[{"name":"Baochun Li","is_ca":true},{"name":"William Kalter","is_ca":false},{"name":"Klara Nahrstedt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009981327,0.0004974628,0.0003270806,0.0005771561,0.0006316322,0.001225079,0.001785275,0.0006132331,0.001539081],"category_scores_gemma":[0.001760863,0.0002415232,0.0003500109,0.0005141792,0.0009391659,0.0009674311,0.0006936616,0.001052032,0.0004044402],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001857658,"about_ca_system_score_gemma":0.001245066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008727515,"about_ca_topic_score_gemma":0.008759831,"domain_scores_codex":[0.9993489,0.000113375,0.00004795751,0.0001786861,0.0002266894,0.00008433445],"domain_scores_gemma":[0.9993131,0.0001336623,0.0001125066,0.0001807204,0.0001908142,0.00006921602],"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.0005842574,0.0003773593,0.00415722,0.000234207,0.00008161013,0.0003566332,0.0005203609,0.5102574,0.1130907,0.1187562,0.007725543,0.2438585],"study_design_scores_gemma":[0.00001587325,0.00005088328,0.0004451957,0.000007358322,0.00001215941,0.00003648838,0.00001313907,0.9867728,0.005082894,0.005390343,0.002155167,0.00001768933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04236409,0.0002684682,0.9469963,0.000243057,0.00005432554,0.0001674762,0.00006471269,0.005954533,0.003887034],"genre_scores_gemma":[0.7146088,0.0001635291,0.2817812,0.0001645789,0.000034898,0.0002068441,0.000158687,0.0001533763,0.002728159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008727515,"threshold_uncertainty_score":0.01735342,"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","authors":[{"name":"Youssef Iraqi","is_ca":true},{"name":"Raouf Boutaba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003904352,0.0005037538,0.0007542709,0.0007589456,0.001884635,0.004055715,0.00153833,0.002314634,0.003017288],"category_scores_gemma":[0.006602936,0.0004861919,0.000238897,0.001999193,0.00198779,0.006580408,0.001095068,0.002062776,0.0005296289],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787909,"about_ca_system_score_gemma":0.001182184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00290683,"about_ca_topic_score_gemma":0.002562276,"domain_scores_codex":[0.9985923,0.000536704,0.0001004875,0.0001503956,0.0005025009,0.0001176006],"domain_scores_gemma":[0.9973956,0.00181571,0.000210443,0.0001263558,0.0003609773,0.00009086967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005622568,0.00005300858,0.0003815407,0.0005198459,0.00002806707,0.0007251715,0.0006570274,0.04544998,0.002656498,0.7514665,0.02099174,0.1770144],"study_design_scores_gemma":[0.00003048201,0.00009503105,0.0006772648,0.0003685436,0.00004396804,0.001190372,0.001035042,0.1407098,0.002177796,0.6420779,0.2115096,0.00008420609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02756961,0.20078,0.6251394,0.03617329,0.003871468,0.0002779943,0.0001167082,0.0003808424,0.1056908],"genre_scores_gemma":[0.6553701,0.1283139,0.1557222,0.00614245,0.009106112,0.0006390071,0.0001760836,0.0002087076,0.04432157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004055715,"threshold_uncertainty_score":0.02064848,"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","authors":[{"name":"Jagdeep Singh","is_ca":false},{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Leonard Barolli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002239252,0.000637279,0.001036124,0.0007032664,0.0008814629,0.0009615308,0.002167419,0.001076836,0.001555504],"category_scores_gemma":[0.00534359,0.0002609949,0.0004886159,0.0008494047,0.001021335,0.001291069,0.00191736,0.001537214,0.0003787861],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001028627,"about_ca_system_score_gemma":0.001931912,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002506428,"about_ca_topic_score_gemma":0.002703117,"domain_scores_codex":[0.9984463,0.0005564118,0.0001302132,0.0002304947,0.0004848627,0.000151744],"domain_scores_gemma":[0.997117,0.001515282,0.0003648154,0.0002876566,0.000568394,0.0001468338],"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.0004244033,0.0002708737,0.001753026,0.0003983506,0.0001675444,0.0006515179,0.0005305896,0.4963867,0.01137052,0.1325942,0.01427196,0.3411804],"study_design_scores_gemma":[0.00006370552,0.0001134356,0.0001619856,0.0000163912,0.00001881719,0.0001732746,0.00003020394,0.9662959,0.001280377,0.02598698,0.00583236,0.0000265454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004481901,0.0002862955,0.9921445,0.0003018423,0.00011108,0.0001920897,0.00003768615,0.000481663,0.00196289],"genre_scores_gemma":[0.6765276,0.0005657374,0.3149737,0.0008221161,0.0001405269,0.001312938,0.0002945924,0.00008145752,0.005281433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002506428,"threshold_uncertainty_score":0.01184249,"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","authors":[{"name":"Khuram Khalid","is_ca":true},{"name":"Isaac Woungang","is_ca":true},{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Jagdeep Singh","is_ca":false},{"name":"Leonard Barolli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003538059,0.0002539488,0.0002825209,0.0004203433,0.0005484902,0.0004248786,0.0009020526,0.0004387175,0.0007212308],"category_scores_gemma":[0.0007962097,0.0001054422,0.0003172928,0.0003525366,0.000403957,0.0005034572,0.0005066514,0.000371632,0.00009097748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006181146,"about_ca_system_score_gemma":0.001135609,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005656416,"about_ca_topic_score_gemma":0.007747442,"domain_scores_codex":[0.9998422,0.00002359043,0.0000137561,0.00002577658,0.00007401135,0.00002067466],"domain_scores_gemma":[0.9997754,0.0000737555,0.00004478436,0.00002179302,0.00006204697,0.00002215382],"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.0005641208,0.0002733998,0.00306436,0.0004964306,0.0001366329,0.001280218,0.0006696517,0.4089067,0.09516313,0.1022818,0.008317052,0.3788466],"study_design_scores_gemma":[0.00009258851,0.0003089817,0.000897705,0.00003267704,0.00006682645,0.0004927682,0.0001060165,0.9558702,0.0122993,0.01373063,0.01604869,0.00005362804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05393032,0.0004580694,0.937726,0.0002903622,0.0001373735,0.0003456473,0.0001786439,0.0004947478,0.006438853],"genre_scores_gemma":[0.8253073,0.000434375,0.1699414,0.0001638857,0.00003399182,0.0002816441,0.0001981331,0.00001688475,0.003622343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005656416,"threshold_uncertainty_score":0.01124698,"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","authors":[{"name":"Baoxian Zhang","is_ca":false},{"name":"Hussein T. Mouftah","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001079224,0.0008839808,0.001141424,0.001127908,0.0009280532,0.001279191,0.00213229,0.001100036,0.003419716],"category_scores_gemma":[0.003723373,0.0004255579,0.0006529354,0.00182462,0.0003662352,0.002050831,0.001830168,0.001022624,0.00132709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008025167,"about_ca_system_score_gemma":0.001811824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008966509,"about_ca_topic_score_gemma":0.001500118,"domain_scores_codex":[0.9990053,0.0003102597,0.00007331048,0.0001627671,0.0003323111,0.0001160716],"domain_scores_gemma":[0.9986279,0.0006254007,0.0001241371,0.0002131574,0.0003388051,0.00007056374],"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.0002308985,0.0001543878,0.001029986,0.0003045621,0.0001155471,0.0001123029,0.0002152708,0.6111614,0.003932931,0.06668167,0.01038388,0.3056772],"study_design_scores_gemma":[0.00005971844,0.00006921715,0.0001124413,0.00002030007,0.00002728132,0.0001293311,0.00005195711,0.9386818,0.002231601,0.04961642,0.008982814,0.00001708576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006155931,0.0003354644,0.9894838,0.0001585497,0.00005623698,0.0001241199,0.0001552556,0.000541132,0.002989542],"genre_scores_gemma":[0.1716444,0.0007138588,0.8216901,0.0001535852,0.00007600114,0.0003829538,0.0009346549,0.0001627505,0.004241692],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003419716,"threshold_uncertainty_score":0.0114401,"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","authors":[{"name":"James Yiming Zhang","is_ca":true},{"name":"Jing Wu","is_ca":true},{"name":"Oliver Yang","is_ca":true},{"name":"Michel Savoie","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001153034,0.0008238892,0.0006366756,0.0004300817,0.0003948255,0.001022008,0.0005255736,0.0005137745,0.001024758],"category_scores_gemma":[0.002304476,0.0003907044,0.0002817664,0.0006326694,0.0007549525,0.001151113,0.0007008701,0.0005136078,0.0001369693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001849669,"about_ca_system_score_gemma":0.001151491,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001833919,"about_ca_topic_score_gemma":0.002009527,"domain_scores_codex":[0.9995415,0.0002068068,0.00000757826,0.00003867886,0.0001068226,0.00009856547],"domain_scores_gemma":[0.9995363,0.0003291372,0.00004899378,0.00001630996,0.00004581498,0.0000234751],"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.00006513779,0.00003675056,0.0003028165,0.00004855031,0.00001649364,0.00004269629,0.00002574856,0.9693804,0.002059782,0.01585626,0.0004408821,0.01172447],"study_design_scores_gemma":[0.000005992556,0.00001785198,0.00009924453,0.00000394239,0.00000494183,0.00001260959,0.00001215009,0.9926784,0.0006075306,0.006353262,0.0002011285,0.000002918064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1539146,0.001072533,0.8330154,0.0005458142,0.00004479502,0.00008945169,0.00009705556,0.0001154291,0.01110512],"genre_scores_gemma":[0.9403447,0.0005321773,0.05593947,0.00005867831,0.00002839442,0.00007908607,0.00006179487,0.00007221418,0.002883448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001849669,"threshold_uncertainty_score":0.01342034,"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","authors":[{"name":"Daniele Tafani","is_ca":false},{"name":"Burak Kantarcı","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true},{"name":"Conor McArdle","is_ca":false},{"name":"Liam P. Barry","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001140284,0.0005132887,0.0006531476,0.000411561,0.0008363246,0.001328803,0.002260914,0.0008747465,0.002898398],"category_scores_gemma":[0.001487009,0.000360171,0.0006980551,0.0004739803,0.001131328,0.001277782,0.001897261,0.001072144,0.0003719174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001118643,"about_ca_system_score_gemma":0.001476824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006032267,"about_ca_topic_score_gemma":0.006833925,"domain_scores_codex":[0.9995366,0.0001437984,0.0000266869,0.00007710417,0.0001567317,0.00005911867],"domain_scores_gemma":[0.9996147,0.0001630293,0.00002860793,0.0000678949,0.00007306622,0.00005264439],"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.00007941422,0.00005380948,0.0003494849,0.00005688559,0.0000239023,0.0001238441,0.0001310498,0.8509851,0.004009305,0.1204631,0.001281135,0.02244303],"study_design_scores_gemma":[0.00002315351,0.00001365793,0.00002486092,0.000004166107,0.000004275011,0.00001197247,0.00001344622,0.9862382,0.0004296236,0.01114214,0.002089489,0.00000500544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006405378,0.0001027117,0.991255,0.0001126115,0.00003550888,0.00005319616,0.00002804225,0.0004306299,0.001576832],"genre_scores_gemma":[0.3388298,0.0002988878,0.655791,0.00007635741,0.00006003482,0.0003639588,0.0001112203,0.0001886609,0.004280058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006032267,"threshold_uncertainty_score":0.0119943,"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","authors":[{"name":"Arunita Jaekel","is_ca":true},{"name":"S. Bandyopadhyay","is_ca":true},{"name":"S Roychoudhury","is_ca":true},{"name":"Abhijit Sengupta","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007821606,0.0003419564,0.0002659586,0.0007198557,0.0008043212,0.001584158,0.0008438202,0.0005226376,0.003712833],"category_scores_gemma":[0.002505874,0.0003218864,0.0004324156,0.0008226967,0.001097535,0.003200315,0.001440399,0.000802706,0.0007407393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007481273,"about_ca_system_score_gemma":0.0007031344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003894737,"about_ca_topic_score_gemma":0.0007670614,"domain_scores_codex":[0.9994554,0.000142901,0.00004586675,0.00008346875,0.0002298566,0.0000425879],"domain_scores_gemma":[0.9991286,0.0002823739,0.0001353922,0.0002217031,0.0001485889,0.00008324283],"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.0001244501,0.00006007594,0.0003907954,0.0004281533,0.00002303531,0.0003539226,0.000194466,0.09856508,0.02645545,0.7313972,0.00869553,0.1333119],"study_design_scores_gemma":[0.00007480288,0.0002366836,0.000356884,0.00008663733,0.00003390208,0.0007122448,0.000190099,0.3844119,0.01259024,0.4612228,0.1400253,0.00005847139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01288873,0.0004726703,0.9731025,0.0007784306,0.0002171953,0.0001457958,0.0002084279,0.0007018086,0.01148431],"genre_scores_gemma":[0.2813573,0.00125636,0.706374,0.0003705652,0.000226336,0.0004260232,0.000737605,0.0001950225,0.009056782],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003712833,"threshold_uncertainty_score":0.01242065,"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","authors":[{"name":"Kleoni Ioannidou","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106339,0.000454568,0.0003900372,0.0004891276,0.0006171789,0.0010303,0.00115949,0.0006131419,0.003750426],"category_scores_gemma":[0.005563819,0.0003161556,0.0009607532,0.0003221385,0.001543346,0.002141337,0.001496697,0.001735314,0.000900041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007170601,"about_ca_system_score_gemma":0.0008690365,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006131148,"about_ca_topic_score_gemma":0.0004537667,"domain_scores_codex":[0.9977182,0.0003845165,0.0001568784,0.000426556,0.001108259,0.0002056254],"domain_scores_gemma":[0.9967175,0.001090845,0.0002764873,0.001245134,0.0005851874,0.00008482295],"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.0003477172,0.0002304093,0.001398908,0.0002186412,0.00009472143,0.0004279055,0.0008549383,0.1228805,0.04960868,0.7139532,0.002966879,0.1070174],"study_design_scores_gemma":[0.0001203153,0.00023057,0.0002619012,0.00003933248,0.00005880879,0.0002650625,0.000126493,0.480831,0.08459759,0.4129343,0.02050193,0.00003260674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04222953,0.00009220492,0.945849,0.0001981846,0.00009367678,0.000136093,0.00007152624,0.002729248,0.008600586],"genre_scores_gemma":[0.780024,0.0001958983,0.2102312,0.0002565894,0.00008263803,0.0002826653,0.0002735518,0.0007566905,0.007896778],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003750426,"threshold_uncertainty_score":0.01254636,"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)","authors":[{"name":"Daqiang Liao","is_ca":false},{"name":"Du Zou","is_ca":false},{"name":"Gautam Srivastava","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693039,0.0004861486,0.0004121295,0.0006796333,0.0005231378,0.0006693696,0.001396279,0.0005261113,0.001375953],"category_scores_gemma":[0.001232093,0.0002844759,0.000359265,0.0004911235,0.0002804307,0.001144655,0.0006400964,0.0006605769,0.0004360205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005643584,"about_ca_system_score_gemma":0.000741526,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008168541,"about_ca_topic_score_gemma":0.0008010822,"domain_scores_codex":[0.9992149,0.0001848096,0.00006732238,0.0001417391,0.0003166673,0.00007459047],"domain_scores_gemma":[0.9994754,0.00009246562,0.00006246509,0.00007472941,0.0002696829,0.00002531546],"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.0004470052,0.0001565504,0.001794667,0.000815425,0.0002065876,0.0007146135,0.0004137081,0.2172818,0.2473673,0.06629004,0.007022394,0.4574899],"study_design_scores_gemma":[0.00008460415,0.0005250349,0.0007466458,0.00005958007,0.000170759,0.0009397691,0.0001011558,0.8695612,0.06219631,0.009639585,0.05588009,0.00009536298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01485744,0.0008626002,0.9787144,0.000198203,0.0001752996,0.000202692,0.00005187146,0.001068054,0.003869345],"genre_scores_gemma":[0.5211729,0.001410582,0.4693532,0.0001780125,0.0002208354,0.0006337177,0.0002957915,0.0001716106,0.006563302],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001396279,"threshold_uncertainty_score":0.004602969,"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","authors":[{"name":"Jagdeep Singh","is_ca":false},{"name":"Sanjay Kumar Dhurandher","is_ca":false},{"name":"Isaac Woungang","is_ca":true},{"name":"Leonard Barolli","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001512151,0.0008838801,0.0009761326,0.00205714,0.0006889645,0.002101398,0.001214599,0.001648616,0.003792216],"category_scores_gemma":[0.002912901,0.0005982632,0.0005409595,0.005099976,0.001226823,0.005361574,0.00136339,0.001236799,0.001501757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001052403,"about_ca_system_score_gemma":0.001356871,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001275598,"about_ca_topic_score_gemma":0.0007609312,"domain_scores_codex":[0.9987765,0.0003121291,0.0001174917,0.0001603026,0.0005226201,0.0001110004],"domain_scores_gemma":[0.9977432,0.001527358,0.0001585558,0.0002355531,0.0002724006,0.00006293406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001174612,0.0001237379,0.001438297,0.008292984,0.0001059288,0.0004067909,0.0003740906,0.03092001,0.003070655,0.2432123,0.01741461,0.6945231],"study_design_scores_gemma":[0.00003260607,0.0003405088,0.001548141,0.005032386,0.0001261775,0.001731576,0.0003531492,0.04370273,0.00366577,0.1356592,0.8077118,0.00009598492],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.007623771,0.7798862,0.1581046,0.00300525,0.0008005562,0.000194888,0.0002139126,0.0002497795,0.04992096],"genre_scores_gemma":[0.06977394,0.8992241,0.02323345,0.0006165614,0.001206178,0.0001547054,0.0003406822,0.00004111556,0.005409324],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003792216,"threshold_uncertainty_score":0.01268625,"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","authors":[{"name":"Sabu Joseph","is_ca":true},{"name":"T.D. Todd","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003504112,0.0002685876,0.0002734082,0.0005824102,0.0005273698,0.0006717165,0.0007917027,0.0003422714,0.002870817],"category_scores_gemma":[0.0004126136,0.0002591859,0.0002595249,0.0004709528,0.0004375919,0.0008286238,0.001203927,0.0005776294,0.000677734],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000851422,"about_ca_system_score_gemma":0.0003559222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004863277,"about_ca_topic_score_gemma":0.0009942221,"domain_scores_codex":[0.9997788,0.00004184025,0.000014276,0.00004875637,0.00007496863,0.0000413625],"domain_scores_gemma":[0.9996313,0.00007769573,0.00006441247,0.0001270586,0.00005686011,0.00004265478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003226985,0.0004559993,0.001933705,0.0002887178,0.00006221294,0.0004142626,0.0004621142,0.1322595,0.3536384,0.2345075,0.005771976,0.2698829],"study_design_scores_gemma":[0.000119318,0.0006923984,0.001448789,0.00006239777,0.00005045522,0.000396479,0.0001237845,0.7748648,0.1178557,0.06250241,0.04179998,0.00008345604],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.239466,0.0009958528,0.6913944,0.0003740623,0.0001927606,0.0002053709,0.0001677497,0.005967548,0.06123622],"genre_scores_gemma":[0.7684197,0.000380902,0.2231216,0.0001869247,0.00006947675,0.0001745032,0.0001849206,0.0001328744,0.007329165],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002870817,"threshold_uncertainty_score":0.009603858,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}