{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02756961,0.20077997,0.62513936,0.036173288,0.0038714684,0.0002779943,0.00011670821,0.00038084242,0.105690755],"genre_scores_gemma":[0.65537006,0.1283139,0.15572223,0.00614245,0.009106112,0.00063900714,0.00017608362,0.0002087076,0.04432157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985923,0.00053670397,0.00010048752,0.00015039557,0.00050250086,0.00011760065],"domain_scores_gemma":[0.99739563,0.0018157096,0.000210443,0.00012635584,0.00036097734,0.000090869675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003904352,0.00050375384,0.0007542709,0.0007589456,0.001884635,0.0040557147,0.0015383301,0.002314634,0.003017288],"category_scores_gemma":[0.006602936,0.00048619192,0.000238897,0.0019991933,0.0019877902,0.0065804077,0.0010950676,0.002062776,0.0005296289],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.000056225683,0.00005300858,0.00038154074,0.00051984587,0.000028067072,0.00072517147,0.0006570274,0.04544998,0.0026564985,0.7514665,0.020991735,0.17701435],"study_design_scores_gemma":[0.000030482011,0.00009503105,0.00067726476,0.00036854355,0.00004396804,0.0011903723,0.0010350422,0.14070983,0.002177796,0.64207786,0.21150962,0.00008420609],"about_ca_topic_score_codex":0.0029068303,"about_ca_topic_score_gemma":0.0025622756,"teacher_disagreement_score":0.0040557147,"about_ca_system_score_codex":0.0017879094,"about_ca_system_score_gemma":0.0011821841,"threshold_uncertainty_score":0.02064848},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18617386,0.0009912302,0.7993406,0.0012547986,0.00008183001,0.0003078275,0.0004931258,0.0005730518,0.01078368],"genre_scores_gemma":[0.8123669,0.00092561723,0.18108614,0.00016285627,0.000066858905,0.00027735555,0.00038767696,0.00006398915,0.0046626814],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.0002285609,0.000026457465,0.0001216997,0.00015878386,0.0001096803],"domain_scores_gemma":[0.99873954,0.00074828375,0.0002164114,0.00013026835,0.00008583567,0.00007960518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086841657,0.0008404127,0.0004958783,0.0006048419,0.0006788795,0.0007725551,0.0012165467,0.0007958528,0.0027874254],"category_scores_gemma":[0.0034115906,0.0002980286,0.0003691037,0.0012651067,0.0009660831,0.0021453123,0.0012448125,0.0010785316,0.00029070966],"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.0004899057,0.00014346837,0.0009962396,0.0003368558,0.00003962008,0.00021239638,0.00028060636,0.7259878,0.017288158,0.11847181,0.0040750615,0.13167809],"study_design_scores_gemma":[0.000071619506,0.000205574,0.00040218644,0.00003421218,0.000016842756,0.00014549852,0.00005567688,0.8673239,0.0049433345,0.12313624,0.0036453584,0.000019705643],"about_ca_topic_score_codex":0.0014946423,"about_ca_topic_score_gemma":0.0012672812,"teacher_disagreement_score":0.0027874254,"about_ca_system_score_codex":0.0020290532,"about_ca_system_score_gemma":0.0009066124,"threshold_uncertainty_score":0.014721811},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15391456,0.0010725331,0.8330154,0.00054581417,0.000044795015,0.000089451685,0.000097055556,0.00011542914,0.011105116],"genre_scores_gemma":[0.9403447,0.0005321773,0.055939473,0.00005867831,0.000028394415,0.00007908607,0.00006179487,0.000072214185,0.002883448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995415,0.0002068068,0.0000075782605,0.000038678863,0.00010682256,0.00009856547],"domain_scores_gemma":[0.9995363,0.0003291372,0.000048993785,0.000016309961,0.000045814977,0.000023475102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011530344,0.00082388916,0.00063667557,0.00043008165,0.00039482547,0.0010220079,0.00052557356,0.0005137745,0.0010247579],"category_scores_gemma":[0.002304476,0.0003907044,0.00028176638,0.00063266937,0.00075495255,0.0011511133,0.00070087006,0.0005136078,0.00013696933],"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.00006513779,0.000036750564,0.0003028165,0.00004855031,0.000016493637,0.000042696294,0.000025748559,0.9693804,0.0020597817,0.015856264,0.00044088208,0.011724468],"study_design_scores_gemma":[0.000005992556,0.000017851982,0.00009924453,0.0000039423903,0.0000049418295,0.0000126095865,0.00001215009,0.9926784,0.00060753064,0.006353262,0.00020112847,0.0000029180635],"about_ca_topic_score_codex":0.0018339193,"about_ca_topic_score_gemma":0.0020095273,"teacher_disagreement_score":0.0018496686,"about_ca_system_score_codex":0.0018496686,"about_ca_system_score_gemma":0.0011514906,"threshold_uncertainty_score":0.013420343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006155931,0.00033546437,0.9894838,0.00015854968,0.000056236982,0.00012411994,0.00015525559,0.000541132,0.0029895424],"genre_scores_gemma":[0.17164437,0.0007138588,0.8216901,0.00015358525,0.00007600114,0.0003829538,0.0009346549,0.00016275047,0.0042416924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900526,0.0003102597,0.000073310475,0.00016276713,0.00033231106,0.00011607165],"domain_scores_gemma":[0.9986279,0.0006254007,0.00012413706,0.00021315743,0.00033880514,0.00007056374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010792238,0.00088398077,0.0011414237,0.0011279075,0.0009280532,0.0012791905,0.00213229,0.0011000355,0.0034197161],"category_scores_gemma":[0.0037233727,0.00042555787,0.00065293536,0.0018246198,0.00036623515,0.0020508312,0.0018301682,0.001022624,0.00132709],"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.00023089854,0.00015438782,0.0010299862,0.0003045621,0.00011554714,0.00011230293,0.00021527079,0.6111614,0.0039329305,0.06668167,0.010383882,0.30567718],"study_design_scores_gemma":[0.000059718437,0.000069217145,0.00011244131,0.000020300065,0.000027281316,0.00012933106,0.000051957115,0.93868184,0.0022316014,0.049616423,0.008982814,0.000017085764],"about_ca_topic_score_codex":0.0008966509,"about_ca_topic_score_gemma":0.0015001183,"teacher_disagreement_score":0.0034197161,"about_ca_system_score_codex":0.0008025167,"about_ca_system_score_gemma":0.0018118238,"threshold_uncertainty_score":0.011440098},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012888728,0.00047267028,0.9731025,0.0007784306,0.00021719528,0.00014579576,0.00020842793,0.0007018086,0.011484305],"genre_scores_gemma":[0.2813573,0.0012563602,0.706374,0.0003705652,0.00022633602,0.00042602315,0.00073760503,0.00019502248,0.009056782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994554,0.00014290099,0.000045866745,0.00008346875,0.00022985661,0.0000425879],"domain_scores_gemma":[0.99912864,0.00028237386,0.00013539224,0.00022170311,0.00014858886,0.000083242834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078216055,0.00034195636,0.00026595857,0.00071985566,0.0008043212,0.0015841578,0.0008438202,0.0005226376,0.003712833],"category_scores_gemma":[0.0025058745,0.00032188641,0.00043241563,0.0008226967,0.0010975348,0.003200315,0.0014403989,0.000802706,0.0007407393],"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.00012445006,0.000060075938,0.0003907954,0.00042815326,0.000023035313,0.0003539226,0.00019446603,0.09856508,0.026455447,0.7313972,0.00869553,0.13331188],"study_design_scores_gemma":[0.00007480288,0.00023668358,0.00035688397,0.00008663733,0.000033902084,0.00071224483,0.00019009903,0.38441193,0.012590241,0.46122277,0.14002527,0.000058471393],"about_ca_topic_score_codex":0.00038947372,"about_ca_topic_score_gemma":0.00076706137,"teacher_disagreement_score":0.003712833,"about_ca_system_score_codex":0.00074812735,"about_ca_system_score_gemma":0.0007031344,"threshold_uncertainty_score":0.012420654},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23946604,0.0009958528,0.6913944,0.0003740623,0.00019276059,0.00020537093,0.00016774968,0.005967548,0.06123622],"genre_scores_gemma":[0.76841974,0.00038090203,0.22312157,0.00018692472,0.00006947675,0.0001745032,0.0001849206,0.00013287435,0.007329165],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997788,0.000041840252,0.000014275996,0.000048756367,0.00007496863,0.000041362502],"domain_scores_gemma":[0.9996313,0.00007769573,0.00006441247,0.00012705859,0.000056860114,0.000042654785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003504112,0.00026858755,0.00027340816,0.0005824102,0.00052736985,0.0006717165,0.0007917027,0.0003422714,0.002870817],"category_scores_gemma":[0.00041261362,0.00025918594,0.00025952494,0.00047095277,0.00043759192,0.0008286238,0.0012039274,0.00057762937,0.00067773403],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.00032269853,0.00045599928,0.0019337046,0.00028871777,0.000062212945,0.0004142626,0.00046211423,0.13225949,0.35363835,0.2345075,0.0057719764,0.26988292],"study_design_scores_gemma":[0.000119318036,0.0006923984,0.0014487889,0.00006239777,0.000050455215,0.00039647895,0.00012378453,0.7748648,0.11785574,0.062502414,0.041799977,0.00008345604],"about_ca_topic_score_codex":0.00048632774,"about_ca_topic_score_gemma":0.0009942221,"teacher_disagreement_score":0.002870817,"about_ca_system_score_codex":0.00085142197,"about_ca_system_score_gemma":0.00035592215,"threshold_uncertainty_score":0.009603858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042364087,0.00026846823,0.94699633,0.00024305697,0.000054325537,0.0001674762,0.000064712694,0.005954533,0.0038870336],"genre_scores_gemma":[0.7146088,0.00016352907,0.28178117,0.00016457887,0.000034897996,0.00020684414,0.00015868702,0.0001533763,0.002728159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00011337504,0.00004795751,0.00017868608,0.00022668943,0.000084334446],"domain_scores_gemma":[0.9993131,0.00013366227,0.000112506634,0.00018072041,0.00019081417,0.00006921602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009981327,0.0004974628,0.00032708063,0.0005771561,0.0006316322,0.0012250791,0.0017852752,0.0006132331,0.0015390811],"category_scores_gemma":[0.0017608629,0.00024152322,0.0003500109,0.0005141792,0.00093916594,0.00096743106,0.0006936616,0.0010520322,0.00040444024],"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.00058425736,0.00037735928,0.0041572195,0.00023420696,0.00008161013,0.0003566332,0.0005203609,0.51025736,0.11309072,0.118756235,0.0077255433,0.24385849],"study_design_scores_gemma":[0.000015873253,0.00005088328,0.0004451957,0.0000073583224,0.000012159413,0.00003648838,0.000013139073,0.98677284,0.0050828937,0.005390343,0.0021551668,0.000017689326],"about_ca_topic_score_codex":0.008727515,"about_ca_topic_score_gemma":0.008759831,"teacher_disagreement_score":0.008727515,"about_ca_system_score_codex":0.0018576583,"about_ca_system_score_gemma":0.0012450656,"threshold_uncertainty_score":0.017353415},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064053778,0.00010271172,0.99125504,0.000112611546,0.00003550888,0.000053196163,0.000028042246,0.0004306299,0.0015768321],"genre_scores_gemma":[0.3388298,0.0002988878,0.65579104,0.00007635741,0.00006003482,0.0003639588,0.000111220346,0.00018866085,0.0042800577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953663,0.00014379837,0.0000266869,0.00007710417,0.00015673172,0.000059118665],"domain_scores_gemma":[0.9996147,0.0001630293,0.000028607934,0.0000678949,0.00007306622,0.00005264439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011402837,0.0005132887,0.0006531476,0.000411561,0.0008363246,0.001328803,0.002260914,0.0008747465,0.002898398],"category_scores_gemma":[0.001487009,0.00036017105,0.0006980551,0.00047398033,0.0011313278,0.0012777817,0.0018972614,0.0010721444,0.0003719174],"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.00007941422,0.000053809476,0.00034948488,0.00005688559,0.000023902301,0.00012384413,0.00013104983,0.85098505,0.0040093046,0.120463125,0.0012811349,0.022443026],"study_design_scores_gemma":[0.000023153509,0.000013657926,0.000024860921,0.0000041661074,0.000004275011,0.000011972471,0.000013446218,0.98623824,0.00042962356,0.0111421365,0.0020894886,0.0000050054405],"about_ca_topic_score_codex":0.0060322667,"about_ca_topic_score_gemma":0.0068339254,"teacher_disagreement_score":0.0060322667,"about_ca_system_score_codex":0.0011186433,"about_ca_system_score_gemma":0.0014768239,"threshold_uncertainty_score":0.011994302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042229533,0.00009220492,0.945849,0.0001981846,0.000093676776,0.00013609303,0.000071526236,0.002729248,0.008600586],"genre_scores_gemma":[0.780024,0.00019589835,0.21023117,0.00025658938,0.000082638035,0.0002826653,0.00027355182,0.00075669045,0.007896778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977182,0.00038451646,0.00015687838,0.00042655595,0.001108259,0.00020562536],"domain_scores_gemma":[0.9967175,0.0010908453,0.0002764873,0.0012451336,0.0005851874,0.000084822954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010633897,0.00045456804,0.00039003717,0.0004891276,0.00061717886,0.0010302999,0.0011594903,0.0006131419,0.0037504255],"category_scores_gemma":[0.0055638193,0.00031615555,0.00096075324,0.00032213848,0.0015433456,0.002141337,0.0014966968,0.0017353145,0.00090004096],"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.00034771723,0.00023040929,0.0013989084,0.00021864117,0.00009472143,0.00042790553,0.0008549383,0.12288054,0.04960868,0.7139532,0.0029668787,0.10701742],"study_design_scores_gemma":[0.000120315264,0.00023057005,0.00026190124,0.000039332477,0.00005880879,0.0002650625,0.00012649302,0.48083103,0.08459759,0.4129343,0.020501934,0.000032606742],"about_ca_topic_score_codex":0.0006131148,"about_ca_topic_score_gemma":0.0004537667,"teacher_disagreement_score":0.0037504255,"about_ca_system_score_codex":0.0007170601,"about_ca_system_score_gemma":0.00086903654,"threshold_uncertainty_score":0.0125463605},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05393032,0.00045806944,0.937726,0.00029036222,0.00013737353,0.0003456473,0.00017864387,0.0004947478,0.006438853],"genre_scores_gemma":[0.82530725,0.00043437505,0.16994144,0.0001638857,0.000033991815,0.00028164408,0.00019813312,0.000016884751,0.0036223433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984217,0.000023590432,0.000013756096,0.000025776575,0.00007401135,0.000020674663],"domain_scores_gemma":[0.99977535,0.0000737555,0.000044784363,0.000021793023,0.000062046965,0.000022153825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035380587,0.00025394882,0.00028252092,0.00042034333,0.0005484902,0.00042487856,0.00090205256,0.00043871754,0.00072123075],"category_scores_gemma":[0.0007962097,0.00010544224,0.00031729275,0.00035253656,0.00040395703,0.0005034572,0.00050665135,0.00037163196,0.000090977475],"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.0005641208,0.00027339978,0.00306436,0.0004964306,0.00013663291,0.0012802185,0.0006696517,0.4089067,0.09516313,0.10228178,0.008317052,0.37884656],"study_design_scores_gemma":[0.00009258851,0.00030898175,0.00089770503,0.00003267704,0.000066826455,0.00049276825,0.000106016465,0.9558702,0.012299304,0.013730631,0.016048687,0.00005362804],"about_ca_topic_score_codex":0.0056564156,"about_ca_topic_score_gemma":0.007747442,"teacher_disagreement_score":0.0056564156,"about_ca_system_score_codex":0.0006181146,"about_ca_system_score_gemma":0.001135609,"threshold_uncertainty_score":0.011246979},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044819014,0.00028629552,0.9921445,0.00030184234,0.00011108004,0.00019208968,0.000037686146,0.00048166304,0.00196289],"genre_scores_gemma":[0.67652756,0.00056573737,0.3149737,0.0008221161,0.00014052694,0.001312938,0.00029459238,0.00008145752,0.0052814335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984463,0.0005564118,0.00013021322,0.00023049467,0.00048486268,0.00015174404],"domain_scores_gemma":[0.99711704,0.0015152821,0.0003648154,0.00028765656,0.00056839397,0.00014683376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022392524,0.000637279,0.0010361243,0.0007032664,0.00088146294,0.0009615308,0.0021674186,0.0010768361,0.001555504],"category_scores_gemma":[0.0053435904,0.00026099492,0.00048861594,0.00084940466,0.0010213354,0.001291069,0.0019173595,0.0015372144,0.0003787861],"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.00042440326,0.00027087374,0.0017530259,0.0003983506,0.0001675444,0.00065151794,0.0005305896,0.49638674,0.011370517,0.13259423,0.014271964,0.34118038],"study_design_scores_gemma":[0.00006370552,0.000113435635,0.00016198558,0.000016391197,0.000018817187,0.00017327462,0.00003020394,0.9662959,0.0012803769,0.025986983,0.0058323597,0.000026545398],"about_ca_topic_score_codex":0.0025064277,"about_ca_topic_score_gemma":0.0027031165,"teacher_disagreement_score":0.0025064277,"about_ca_system_score_codex":0.0010286268,"about_ca_system_score_gemma":0.0019319124,"threshold_uncertainty_score":0.011842489},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014857436,0.00086260017,0.9787144,0.00019820296,0.00017529959,0.000202692,0.000051871462,0.0010680543,0.0038693454],"genre_scores_gemma":[0.52117294,0.0014105815,0.46935317,0.00017801255,0.00022083541,0.0006337177,0.00029579154,0.00017161062,0.0065633017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992149,0.0001848096,0.000067322384,0.00014173912,0.0003166673,0.00007459047],"domain_scores_gemma":[0.9994754,0.00009246562,0.00006246509,0.00007472941,0.00026968287,0.00002531546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005693039,0.00048614855,0.00041212948,0.0006796333,0.0005231378,0.00066936965,0.0013962793,0.00052611134,0.0013759526],"category_scores_gemma":[0.0012320926,0.0002844759,0.00035926505,0.0004911235,0.00028043066,0.0011446554,0.00064009643,0.00066057686,0.0004360205],"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.00044700524,0.00015655038,0.0017946674,0.000815425,0.0002065876,0.00071461353,0.00041370807,0.21728182,0.24736728,0.066290036,0.0070223943,0.4574899],"study_design_scores_gemma":[0.00008460415,0.0005250349,0.0007466458,0.000059580074,0.00017075895,0.00093976915,0.0001011558,0.8695612,0.06219631,0.009639585,0.05588009,0.00009536298],"about_ca_topic_score_codex":0.00081685407,"about_ca_topic_score_gemma":0.00080108223,"teacher_disagreement_score":0.0013962793,"about_ca_system_score_codex":0.0005643584,"about_ca_system_score_gemma":0.000741526,"threshold_uncertainty_score":0.0046029687},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007623771,0.77988625,0.15810461,0.0030052497,0.00080055615,0.00019488798,0.00021391256,0.0002497795,0.049920958],"genre_scores_gemma":[0.06977394,0.8992241,0.023233451,0.0006165614,0.0012061779,0.00015470543,0.0003406822,0.000041115563,0.0054093236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987765,0.00031212906,0.00011749173,0.00016030265,0.0005226201,0.00011100039],"domain_scores_gemma":[0.99774325,0.001527358,0.00015855578,0.00023555315,0.0002724006,0.000062934065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015121512,0.0008838801,0.00097613264,0.0020571395,0.0006889645,0.0021013983,0.0012145992,0.0016486157,0.003792216],"category_scores_gemma":[0.002912901,0.0005982632,0.0005409595,0.0050999755,0.001226823,0.0053615742,0.0013633897,0.0012367989,0.0015017571],"study_design_candidate":"not_applicable","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.00011746119,0.00012373786,0.0014382969,0.008292984,0.000105928775,0.0004067909,0.00037409062,0.030920014,0.0030706553,0.24321234,0.017414615,0.6945231],"study_design_scores_gemma":[0.000032606065,0.00034050876,0.0015481405,0.0050323857,0.0001261775,0.0017315763,0.00035314923,0.043702733,0.0036657697,0.13565925,0.8077118,0.00009598492],"about_ca_topic_score_codex":0.0012755977,"about_ca_topic_score_gemma":0.00076093123,"teacher_disagreement_score":0.003792216,"about_ca_system_score_codex":0.0010524031,"about_ca_system_score_gemma":0.0013568714,"threshold_uncertainty_score":0.012686253},"labels":[],"label_agreement":null}]}