{"meta":{"query_hash":"aeb8894ddc71","filters":{"venue":"Journal of High Speed Networks"},"cohort_total":13,"direct_labels_cover":0,"predictions_cover":13,"exported":13,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/aeb8894ddc71","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+High+Speed+Networks"},"results":[{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multimedia; Wireless; Wireless network; Resource (disambiguation); Computer network; Resource management (computing); Telecommunications","score_opus":0.009770102355311037,"score_gpt":0.2610077353668496,"score_spread":0.25123763301153856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519261503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26991287,0.060322527,0.5717378,0.06139122,0.005893093,0.0024787942,0.0000037258978,0.0006281528,0.027631804],"genre_scores_gemma":[0.9455008,0.01912291,0.029441321,0.0006023251,0.0032373043,0.0000072383627,0.000007172176,0.000047521164,0.0020333878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99627805,0.0005892115,0.0010597418,0.00037452384,0.00091593125,0.0007825524],"domain_scores_gemma":[0.99750495,0.00032000363,0.00042070347,0.0012694433,0.00018494169,0.00029996104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016605601,0.00029748055,0.00057874626,0.00042047113,0.00016529582,0.00031498875,0.0036770243,0.00026661664,0.00023005946],"category_scores_gemma":[0.000008496814,0.00026180854,0.00018181746,0.0016612479,0.0001108726,0.0006974085,0.00049555575,0.001630029,0.000031378844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114321025,0.0001535806,0.00032849298,0.000007272607,0.000061218176,0.00031572624,0.00021501418,0.5225154,0.000002267522,0.0027249851,0.026307927,0.44725376],"study_design_scores_gemma":[0.0014659617,0.00012293376,0.011734068,0.00025036512,0.000012756637,0.0001100529,0.000096067175,0.8919703,0.000010215618,0.000313774,0.09361796,0.0002955734],"about_ca_topic_score_codex":0.00003067536,"about_ca_topic_score_gemma":0.00003156562,"teacher_disagreement_score":0.67558795,"about_ca_system_score_codex":0.00017623238,"about_ca_system_score_gemma":0.0000422147,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011012931791111829,"score_gpt":0.215381259874725,"score_spread":0.2043683280836132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1622251338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71229655,0.002215348,0.28324685,0.00017810687,0.0010548844,0.00031089477,0.0000010692683,0.00019155542,0.0005047654],"genre_scores_gemma":[0.98253685,0.0023937798,0.014374889,0.0000125497945,0.000610868,0.0000041057983,0.0000016778821,0.000046476238,0.000018774113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978485,0.00006734264,0.0010787154,0.00018834654,0.00030083177,0.0005162654],"domain_scores_gemma":[0.99881256,0.0002151613,0.0003364599,0.00034794302,0.00018432946,0.00010354572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067638094,0.00027041306,0.00066761585,0.00023090701,0.00003715902,0.000020944295,0.0003447865,0.00042273218,0.000043605593],"category_scores_gemma":[0.00017097173,0.00024009959,0.00016203144,0.0009572,0.00012651418,0.00032913848,0.000072612704,0.0014100969,0.0000020383445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015757928,0.000084114035,0.0039329748,0.000025570082,0.000053335887,0.00008334199,0.00001770456,0.9732215,0.00039464494,0.00036394145,0.00029144043,0.021373877],"study_design_scores_gemma":[0.001194899,0.00038942642,0.018064484,0.00037227248,0.00003098458,0.00016742987,0.00007270489,0.97384727,0.00046210794,0.0036175782,0.0013948269,0.00038604243],"about_ca_topic_score_codex":0.000015069031,"about_ca_topic_score_gemma":0.00004769287,"teacher_disagreement_score":0.27024034,"about_ca_system_score_codex":0.00021934758,"about_ca_system_score_gemma":0.000017267435,"threshold_uncertainty_score":0.9790977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007471200722617087,"score_gpt":0.208092883144962,"score_spread":0.2006216824223449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1667406537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07348049,0.0013592729,0.92316884,0.00012375102,0.0010426117,0.0004869304,7.6881355e-7,0.00024733008,0.00009003061],"genre_scores_gemma":[0.7350276,0.00045242076,0.26314983,0.00008097057,0.0011724557,0.000005737673,0.000007707273,0.00009132777,0.000011957658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749434,0.000024188124,0.0009943022,0.0002289944,0.00026017625,0.0009979996],"domain_scores_gemma":[0.9985677,0.0005395681,0.00033768988,0.00022775537,0.00016908051,0.00015823159],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085907365,0.00036106148,0.0006629112,0.00025659494,0.00008699646,0.00005212123,0.0003550517,0.0003928255,0.00001450597],"category_scores_gemma":[0.000047058893,0.00030671412,0.00011851957,0.00088924577,0.00011112678,0.0003732411,0.00003453662,0.0009938775,5.260304e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004933105,0.000020848103,0.0004885182,0.000024458974,0.00007176292,0.00008522657,0.000028627923,0.95049816,0.0000051600264,0.00030692565,0.0012409623,0.046736035],"study_design_scores_gemma":[0.0018552559,0.0003832765,0.0007638869,0.00033428974,0.00006237673,0.000097793905,0.00012068313,0.9955301,0.000019895051,0.00020539374,0.00025861635,0.00036841427],"about_ca_topic_score_codex":0.0000012857727,"about_ca_topic_score_gemma":0.000039430637,"teacher_disagreement_score":0.6615471,"about_ca_system_score_codex":0.00026599778,"about_ca_system_score_gemma":0.00002142789,"threshold_uncertainty_score":0.9999385},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Path (computing); Tree (set theory); Algorithm; Shortest path problem; Theoretical computer science; Computer network; Mathematics; Combinatorics; Graph","score_opus":0.00937035923181781,"score_gpt":0.21665481260163844,"score_spread":0.20728445336982063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1714480694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008269142,0.00028061148,0.9865341,0.0009401187,0.0014614778,0.000093373965,0.0000024357482,0.00006216498,0.0023565677],"genre_scores_gemma":[0.8159804,0.00009303261,0.18015563,0.00020306728,0.0026802486,9.5181593e-7,0.000018742763,0.00001725834,0.0008506649],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836916,0.000051256924,0.00054629083,0.00021284631,0.00050312554,0.00031730873],"domain_scores_gemma":[0.9987915,0.000100296034,0.0004653186,0.0003363122,0.00020541495,0.00010116111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045783067,0.0001658451,0.000261372,0.00020383576,0.000111106805,0.00035672798,0.0011839333,0.00006352156,0.000022124905],"category_scores_gemma":[0.000017828308,0.00013714939,0.000121432975,0.000529727,0.00003874541,0.0012313928,0.00020615546,0.00027765453,0.000015673064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026004223,0.0006285886,0.007978036,0.0000102545855,0.00015705817,0.0015650446,0.00007605519,0.22639719,0.00013768679,0.06318308,0.2127755,0.48706552],"study_design_scores_gemma":[0.00097045593,0.00027011626,0.0609565,0.000069979724,0.00004686082,0.00017761806,0.000011258396,0.92087084,0.00005793706,0.0055884207,0.010689277,0.000290759],"about_ca_topic_score_codex":0.000039319333,"about_ca_topic_score_gemma":0.000013356634,"teacher_disagreement_score":0.80771124,"about_ca_system_score_codex":0.00005471817,"about_ca_system_score_gemma":0.000035833113,"threshold_uncertainty_score":0.55927896},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016708524497094805,"score_gpt":0.23117875622847567,"score_spread":0.21447023173138086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1810000146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04405234,0.0071370755,0.9430195,0.00094725454,0.002219798,0.00026834942,0.0000020158598,0.00040355948,0.0019501066],"genre_scores_gemma":[0.898348,0.0019295781,0.09731087,0.00017564192,0.0020110104,0.000006347249,0.0000021742667,0.00006028091,0.0001561405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980345,0.000020149408,0.00075748743,0.00019266366,0.00020123711,0.0007939691],"domain_scores_gemma":[0.9986193,0.0006096829,0.0001525639,0.000262687,0.0001453983,0.0002103305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002623977,0.00028246146,0.0006644953,0.00012890874,0.00008759498,0.00004740755,0.0004568389,0.00054066494,0.00021276696],"category_scores_gemma":[0.00016551312,0.00023167432,0.00024062075,0.00035474595,0.00023329718,0.00020027797,0.00007509689,0.0010312927,0.000013624016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006518956,0.000058434554,0.000082106584,0.000009980481,0.000090588415,0.00008136993,0.000005562462,0.9357388,0.000050513976,0.010351259,0.028156377,0.025309844],"study_design_scores_gemma":[0.0010472481,0.0005554005,0.00023076682,0.00005499475,0.00007245789,0.0003222162,0.000021030199,0.98177135,0.00008998959,0.0061368607,0.009394437,0.00030324294],"about_ca_topic_score_codex":3.9085413e-7,"about_ca_topic_score_gemma":0.0000017034197,"teacher_disagreement_score":0.8542956,"about_ca_system_score_codex":0.000116053576,"about_ca_system_score_gemma":0.0000047767853,"threshold_uncertainty_score":0.9447404},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01398069110018204,"score_gpt":0.24021460967262728,"score_spread":0.22623391857244524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098372141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.787743,0.0017057899,0.20837283,0.0001202168,0.00096617173,0.00006776607,7.111069e-7,0.00024334721,0.0007802169],"genre_scores_gemma":[0.93018067,0.0015049243,0.06693234,0.00003963092,0.0012671095,5.516789e-7,7.5035814e-7,0.000050734758,0.000023297138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852324,0.00002039393,0.0005245529,0.00012379215,0.00024433705,0.000563692],"domain_scores_gemma":[0.99934083,0.00014347465,0.00012483989,0.0001963561,0.000053082564,0.00014143588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019194053,0.00021140187,0.00041305568,0.00017804645,0.00006832366,0.00004462256,0.00033148605,0.00020889325,0.000096340686],"category_scores_gemma":[0.000041018295,0.00018607361,0.00015877395,0.0004639658,0.000089731046,0.00024311584,0.000052422667,0.0011127032,0.000005194732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047397712,0.000019639385,0.0006065598,0.000005617365,0.00007543706,0.00039493188,0.000012825567,0.9891537,0.0019056388,0.0012343711,0.00060519355,0.0059386785],"study_design_scores_gemma":[0.0008088181,0.00017813701,0.0013625772,0.00017525595,0.00007591831,0.0014608484,0.000045279565,0.98321,0.000851869,0.007736508,0.003729174,0.0003655587],"about_ca_topic_score_codex":0.0000022499187,"about_ca_topic_score_gemma":0.0000042907477,"teacher_disagreement_score":0.14243771,"about_ca_system_score_codex":0.00020456332,"about_ca_system_score_gemma":0.000015702404,"threshold_uncertainty_score":0.75878614},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014719516351592906,"score_gpt":0.269745154777049,"score_spread":0.2550256384254561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145623489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027015213,0.0003721955,0.9682748,0.002980918,0.00023285885,0.00059470057,0.000010365842,0.000031510903,0.00048747155],"genre_scores_gemma":[0.8611079,0.000020648333,0.13729374,0.00054586586,0.00090641604,0.00001600761,0.000003582568,0.00001606316,0.00008979928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976101,0.00024460934,0.0011346589,0.00023746575,0.000431044,0.0003421161],"domain_scores_gemma":[0.9968307,0.0011325245,0.0008261078,0.00048144936,0.0005093315,0.00021989728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933212,0.00017171123,0.0006387638,0.00011612446,0.00009889093,0.00008740045,0.0010330135,0.00015438312,0.000056022534],"category_scores_gemma":[0.00005589745,0.00013840015,0.00023962653,0.00043564817,0.00005593061,0.00026072346,0.000029613013,0.00047010923,0.000008418711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007601663,0.00037088088,0.00022411045,0.00018568942,0.00038325923,0.000013983782,0.0008388329,0.8012727,0.012543222,0.012113907,0.0016908711,0.16960241],"study_design_scores_gemma":[0.00784673,0.00049313804,0.0058293846,0.00028505598,0.00010433787,0.000346584,0.000040544455,0.95961106,0.0016520985,0.012483241,0.010809048,0.00049878145],"about_ca_topic_score_codex":0.00010762726,"about_ca_topic_score_gemma":0.000020653224,"teacher_disagreement_score":0.8340927,"about_ca_system_score_codex":0.000038326707,"about_ca_system_score_gemma":0.00013563062,"threshold_uncertainty_score":0.56437945},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Energy (signal processing); Computer network; Physics","score_opus":0.006450147394693374,"score_gpt":0.21735660896367925,"score_spread":0.21090646156898588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W219812769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08906457,0.00094179047,0.9085414,0.00046541347,0.00068693043,0.00014035197,0.000006886297,0.00012053268,0.000032152147],"genre_scores_gemma":[0.81021905,0.00010152924,0.18915117,0.00005192508,0.00042251227,0.000009811669,0.000011571992,0.000028110575,0.00000430909],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867755,0.000014660945,0.0005985951,0.000116576564,0.00020017342,0.00039244987],"domain_scores_gemma":[0.9988983,0.0005573752,0.00014683108,0.00013160017,0.00016869287,0.00009715209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012929956,0.00018029305,0.0003601828,0.00015478821,0.00003890843,0.000045475867,0.00026129404,0.000243415,0.000030322648],"category_scores_gemma":[0.000109465545,0.0001542188,0.00011355117,0.00043402228,0.000058504513,0.00012573999,0.00003968347,0.0005348493,0.000003902155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022690967,0.00004436378,0.00008628365,0.000008082384,0.000033926466,0.00001376528,0.000009612586,0.9582024,0.000018770324,0.03171388,0.0033389009,0.0065073133],"study_design_scores_gemma":[0.00048647093,0.00010242413,0.0020910553,0.0001316558,0.00001215149,0.00002269467,0.000027259723,0.8860589,0.00004598529,0.110139966,0.0007173332,0.00016410672],"about_ca_topic_score_codex":0.0000024118262,"about_ca_topic_score_gemma":0.0000016510378,"teacher_disagreement_score":0.7211545,"about_ca_system_score_codex":0.00015587418,"about_ca_system_score_gemma":0.000013416993,"threshold_uncertainty_score":0.628886},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Algorithm","score_opus":0.00907508062188082,"score_gpt":0.23040092510521024,"score_spread":0.22132584448332943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800563874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03228239,0.0010721239,0.9639654,0.001004413,0.00070390495,0.00008043635,0.0000043521713,0.00003355219,0.0008534181],"genre_scores_gemma":[0.94286233,0.00013446857,0.056344707,0.00007228277,0.00055392017,4.1786345e-7,9.895355e-7,0.0000054158013,0.000025446325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985384,0.00004834043,0.0007756935,0.00009451003,0.00033502007,0.00020806615],"domain_scores_gemma":[0.99883777,0.00006730083,0.00049855694,0.00021497515,0.00027715275,0.00010422211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053225685,0.000102639,0.00030241173,0.0000993895,0.00006579497,0.00006752588,0.00058288604,0.0000723685,0.000012585311],"category_scores_gemma":[0.000008177375,0.00008291926,0.00015150158,0.00038565515,0.000020427795,0.0008632992,0.00002738005,0.00024323887,0.000004139359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003994217,0.0006441655,0.0005330987,0.000068518464,0.00027879333,0.00006373571,0.0029646752,0.7142466,0.00058419566,0.031592518,0.01641846,0.23256533],"study_design_scores_gemma":[0.0012358492,0.00021496727,0.0028677143,0.0001721629,0.000032848973,0.00032732153,0.00007654799,0.9604035,0.00073271664,0.00040784734,0.033324912,0.00020359457],"about_ca_topic_score_codex":0.0000066620255,"about_ca_topic_score_gemma":0.0000034331806,"teacher_disagreement_score":0.91058,"about_ca_system_score_codex":0.00005329272,"about_ca_system_score_gemma":0.000060382292,"threshold_uncertainty_score":0.3381349},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03715383016495805,"score_gpt":0.2875374564092956,"score_spread":0.2503836262443376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136878226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021236156,0.00012487812,0.9859195,0.0013348961,0.0012138394,0.010143473,0.000005596067,0.00006892588,0.0009765787],"genre_scores_gemma":[0.90285456,0.000034868244,0.086651966,0.002594196,0.004274765,0.0028478252,0.000032636297,0.00008623198,0.00062296493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99636716,0.00020949748,0.0014169209,0.00055636535,0.00057354826,0.00087648514],"domain_scores_gemma":[0.99577564,0.00081915397,0.001324188,0.00061877444,0.00084807706,0.0006141866],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016569745,0.00043088893,0.000875637,0.00015515235,0.00037543016,0.00055427715,0.0008142752,0.00034096595,0.00005251391],"category_scores_gemma":[0.000066611996,0.0003736392,0.00037075742,0.0005886389,0.00012189983,0.00046400042,0.00026738626,0.000874142,0.000002223236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019297309,0.0013945822,0.0019988387,0.00037886805,0.00078920095,0.007468004,0.0003095398,0.34813276,0.00021327849,0.124666125,0.09949062,0.41322845],"study_design_scores_gemma":[0.003594494,0.0005083375,0.00018848332,0.0004535166,0.00009512836,0.00093625014,0.000031511016,0.9807933,0.000041036277,0.0022075963,0.010708753,0.00044162018],"about_ca_topic_score_codex":0.000005524785,"about_ca_topic_score_gemma":0.0000069086063,"teacher_disagreement_score":0.9026422,"about_ca_system_score_codex":0.00009084411,"about_ca_system_score_gemma":0.0007747147,"threshold_uncertainty_score":0.99987155},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040243057454725284,"score_gpt":0.28748773119484383,"score_spread":0.24724467374011855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308196315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010062075,0.00003256484,0.97980136,0.0006040218,0.0016491826,0.016840464,0.0000025789882,0.00011165563,0.0008575586],"genre_scores_gemma":[0.9602688,0.0000054281345,0.024800742,0.001332336,0.0028123383,0.009626279,0.000027267211,0.00008269851,0.0010441336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620783,0.00030090733,0.0013440843,0.00045058216,0.00082756433,0.0008690538],"domain_scores_gemma":[0.9961784,0.00070329104,0.0018099287,0.00048821085,0.00039876785,0.000421394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029042175,0.00035678505,0.0006941373,0.0002463259,0.0010694821,0.00035223248,0.001546701,0.00015477299,0.00023711173],"category_scores_gemma":[0.000021418004,0.00033021538,0.00040418888,0.0007180831,0.00006415596,0.00041331054,0.0004609395,0.001602681,0.000001661175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009020202,0.00019106858,0.000258676,0.0000201564,0.00007107542,0.00034963537,0.000057050333,0.93931234,0.000005134534,0.009184094,0.022028152,0.027620587],"study_design_scores_gemma":[0.0050160433,0.0011804808,0.000046233505,0.000091558104,0.000050696606,0.00032291652,0.000045164343,0.94986933,0.000003920395,0.00063661666,0.04237365,0.000363379],"about_ca_topic_score_codex":0.000012360658,"about_ca_topic_score_gemma":0.0000012150504,"teacher_disagreement_score":0.9601682,"about_ca_system_score_codex":0.0002096759,"about_ca_system_score_gemma":0.00050607824,"threshold_uncertainty_score":0.999915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.02825589497607551,"score_gpt":0.30092818109617453,"score_spread":0.27267228612009903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380080183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004131431,0.000011344428,0.98473173,0.00027923993,0.0013453513,0.009446523,5.499258e-7,0.000038738337,0.000015102512],"genre_scores_gemma":[0.7025002,0.000008791915,0.2942003,0.000091638314,0.0016118746,0.0014449373,0.0000012559772,0.000020735684,0.0001202396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998692,0.00006132477,0.0005698597,0.00014106031,0.00025462933,0.0002811788],"domain_scores_gemma":[0.99794865,0.00053278595,0.00078087795,0.0001950054,0.00045428672,0.00008839974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015190121,0.00010675087,0.0002508717,0.00011811722,0.00007623104,0.000049957027,0.00049985806,0.00008118954,0.0000032019727],"category_scores_gemma":[0.00029602373,0.000085984604,0.000105813495,0.00039681603,0.000019561352,0.00032258447,0.00007030185,0.00018566278,0.0000018854712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053972454,0.0003750216,0.0019181044,0.00016523647,0.00017463343,0.000030348552,0.0049202177,0.6923776,0.023859449,0.0011078649,0.028727436,0.24580434],"study_design_scores_gemma":[0.0012654295,0.00034300162,0.0018341843,0.00012000612,0.000011984577,0.000014934222,0.000056808596,0.9930885,0.0023081985,0.0003853935,0.00047455006,0.00009705107],"about_ca_topic_score_codex":0.000014584037,"about_ca_topic_score_gemma":0.0000010215178,"teacher_disagreement_score":0.6983688,"about_ca_system_score_codex":0.000089265755,"about_ca_system_score_gemma":0.00026674246,"threshold_uncertainty_score":0.35063505},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Blockchain; Computer science; Computer security; Computer network; Wireless network; Wireless; Telecommunications","score_opus":0.015052175249687782,"score_gpt":0.2591490460183147,"score_spread":0.2440968707686269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401977969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14344029,0.0033694135,0.8481746,0.0026033092,0.0018949857,0.00015274342,0.0000036505787,0.0002715627,0.00008944125],"genre_scores_gemma":[0.9859524,0.00017698167,0.011837579,0.00092075416,0.0010429976,0.0000049654745,0.000002978606,0.000034817345,0.00002655724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975918,0.00021073867,0.00073288754,0.0004719416,0.00044925095,0.00054338796],"domain_scores_gemma":[0.99709994,0.0013528982,0.00036658446,0.00079963135,0.00023205565,0.00014890374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014498847,0.0003073907,0.00050204404,0.00027964174,0.00023163507,0.0002910012,0.0015575248,0.000546879,0.000023589893],"category_scores_gemma":[0.0000634648,0.000257807,0.00024261647,0.0016646308,0.00012983919,0.000103728154,0.00018001535,0.0021874793,0.000013593055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007305345,0.00025739323,0.0005283885,0.00002260221,0.0001934567,0.00038231857,0.00025075764,0.68733644,0.000011489015,0.2665123,0.010116386,0.034315415],"study_design_scores_gemma":[0.00030833084,0.00028033304,0.0022477338,0.00046377676,0.00002655708,0.00007285286,0.000008089519,0.97243583,0.00017736068,0.021800311,0.0018896826,0.00028913954],"about_ca_topic_score_codex":0.00005186646,"about_ca_topic_score_gemma":0.000024611356,"teacher_disagreement_score":0.8425121,"about_ca_system_score_codex":0.000120125405,"about_ca_system_score_gemma":0.00013133953,"threshold_uncertainty_score":0.9999874},"labels":[],"label_agreement":null}]}