{"meta":{"query_hash":"ef4f546eb752","filters":{"venue":"Journal of Networks"},"cohort_total":11,"direct_labels_cover":0,"predictions_cover":11,"exported":11,"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/ef4f546eb752","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Networks"},"results":[{"id":"W1979718221","doi":"10.4304/jnw.10.01.15-28","title":"Techniques for Allocation of Sensors in Shared Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Wireless; Telecommunications","score_opus":0.024358925945411475,"score_gpt":0.2624113918270588,"score_spread":0.23805246588164733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979718221","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.01232878,0.0006997527,0.98483396,0.00016161987,0.00008257657,0.00009081872,0.000013299124,0.00025813238,0.0015311111],"genre_scores_gemma":[0.5803084,0.0012465238,0.4130081,0.00017268556,0.00018861235,0.0004587693,0.00006708187,0.00012754643,0.004422344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982128,0.00073263544,0.000108302986,0.00028088444,0.00048466845,0.00018073502],"domain_scores_gemma":[0.9975368,0.0012583302,0.0002385854,0.0006669498,0.000215981,0.00008341481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023201373,0.00077485514,0.00088031177,0.0009579358,0.0010556666,0.00095319335,0.0025064657,0.00081428746,0.0018655492],"category_scores_gemma":[0.0075835832,0.0006176535,0.00071826624,0.0015859508,0.0014209063,0.002836828,0.002939233,0.00095571275,0.00043676322],"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.00041898288,0.00016228689,0.001384081,0.00036950488,0.0001416076,0.00022750655,0.0007266351,0.501749,0.020939555,0.13706905,0.0027769867,0.33403483],"study_design_scores_gemma":[0.000050629755,0.00018787463,0.00037015125,0.000045249595,0.000059303547,0.00026321172,0.00019723973,0.90061873,0.0070290947,0.08117227,0.009970593,0.000035607907],"about_ca_topic_score_codex":0.000997819,"about_ca_topic_score_gemma":0.001613778,"teacher_disagreement_score":0.0025064657,"about_ca_system_score_codex":0.000812588,"about_ca_system_score_gemma":0.0008718187,"threshold_uncertainty_score":0.012270212},"labels":[],"label_agreement":null},{"id":"W2024531104","doi":"10.4304/jnw.2.6.24-32","title":"Reliable Integrated Architecture for Heterogeneous Mobile and Wireless Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Networks","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Architecture; Computer network; Wireless; Wireless network; Mobile wireless; Heterogeneous network; Telecommunications; Distributed computing","score_opus":0.005107163564986482,"score_gpt":0.21383103229274225,"score_spread":0.20872386872775578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024531104","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.050639812,0.00085030316,0.93570477,0.00023692196,0.00014245628,0.00010853183,0.0000372466,0.0019444884,0.010335564],"genre_scores_gemma":[0.79861236,0.0005473588,0.19137831,0.00013435626,0.00010109094,0.00018253936,0.00023943324,0.00010241658,0.008702085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944276,0.00013394417,0.000037904905,0.000078750716,0.00022292169,0.00008375636],"domain_scores_gemma":[0.9993876,0.000083410574,0.000050516002,0.00015714836,0.00028425624,0.000037027337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008635601,0.00035308767,0.00029727633,0.0003957419,0.0004460115,0.0012448735,0.0011683111,0.0005988037,0.0019765885],"category_scores_gemma":[0.0011660286,0.00025505773,0.0003436009,0.0002830453,0.0004958754,0.0011103594,0.0012248602,0.0008228657,0.0006090585],"study_design_candidate":"theoretical_or_conceptual","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.00051612325,0.00023930102,0.0031174412,0.0003135567,0.00027551863,0.00077444484,0.0006772741,0.3257952,0.09545845,0.2920988,0.007934065,0.27279985],"study_design_scores_gemma":[0.000067127774,0.00034251637,0.00065280776,0.000044683868,0.00012440367,0.00024081462,0.00007431515,0.90492064,0.01790794,0.041691337,0.03390452,0.000028900606],"about_ca_topic_score_codex":0.00086282974,"about_ca_topic_score_gemma":0.0011063452,"teacher_disagreement_score":0.0019765885,"about_ca_system_score_codex":0.0006675422,"about_ca_system_score_gemma":0.0006566851,"threshold_uncertainty_score":0.006612301},"labels":[],"label_agreement":null},{"id":"W2032206463","doi":"10.4304/jnw.4.2.148-161","title":"Toward Neural Networks Solution for Multimedia Support in Mobile Ad hoc Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Quality of service; Computer network; Adaptive quality of service multi-hop routing; Mobile QoS; Core network; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Service (business); Multimedia; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless; Routing protocol; Service delivery framework; Network packet; Telecommunications","score_opus":0.02504710550335765,"score_gpt":0.2852375555671387,"score_spread":0.26019045006378105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032206463","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.032454047,0.00096882426,0.9585564,0.001202819,0.00022107924,0.000049670944,0.000058265538,0.00046289823,0.0060259993],"genre_scores_gemma":[0.54608226,0.0016147024,0.4275493,0.00046799396,0.00038679046,0.000098682605,0.0001762215,0.00006682996,0.023557136],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999249,0.000014860995,0.0000043884547,0.000016614582,0.000023821338,0.000015417807],"domain_scores_gemma":[0.9997937,0.00005331479,0.000013217269,0.000011343485,0.000115263225,0.000013171039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002915076,0.0002667486,0.00026884887,0.00024851022,0.00027737673,0.0005901097,0.0008241707,0.0007671085,0.00259111],"category_scores_gemma":[0.0008016496,0.00013444912,0.00018500934,0.00030825048,0.00018835763,0.00060310896,0.0003753942,0.00068635884,0.00040258715],"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.00017725442,0.00023640494,0.0013827982,0.00021746971,0.00009189491,0.00018023269,0.00011375982,0.31974968,0.036283363,0.055724476,0.010332186,0.5755104],"study_design_scores_gemma":[0.000005202472,0.000023005448,0.00010275861,0.0000055167598,0.000010290792,0.00001638734,0.00001843132,0.98795915,0.0031686178,0.006831394,0.0018556659,0.0000035843473],"about_ca_topic_score_codex":0.0026745992,"about_ca_topic_score_gemma":0.0040255417,"teacher_disagreement_score":0.0026745992,"about_ca_system_score_codex":0.00039518205,"about_ca_system_score_gemma":0.0004266896,"threshold_uncertainty_score":0.008668125},"labels":[],"label_agreement":null},{"id":"W2042414722","doi":"10.4304/jnw.10.3.141-151","title":"Wi-Fi-based Positioning in a Complex Underground Environment","year":2015,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Computer science; Real-time computing; Computer security; Human–computer interaction","score_opus":0.02883959241326816,"score_gpt":0.2149274203378151,"score_spread":0.18608782792454692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042414722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7504834,0.0001541555,0.2439859,0.000063126914,0.000040702173,0.000047170026,0.0001985118,0.000836794,0.004190271],"genre_scores_gemma":[0.95660317,0.000095998075,0.041805882,0.000014309762,0.0000072815856,0.000019885318,0.00011204436,0.000014935716,0.0013264364],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980253,0.00004176558,0.000008721674,0.000042035183,0.00007602773,0.000028966944],"domain_scores_gemma":[0.99988365,0.000035335248,0.000017052238,0.000029563264,0.000026858168,0.0000075140447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017972819,0.0002948126,0.0002554739,0.0002132636,0.00020327709,0.0002931251,0.0003180611,0.00033893774,0.0005767552],"category_scores_gemma":[0.0005438114,0.00010303539,0.00009587102,0.0003085386,0.0002992207,0.00033534886,0.0004636578,0.00013990424,0.00034863933],"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.0007179558,0.00009265594,0.021999449,0.0003592567,0.000083780425,0.0012279995,0.0009197461,0.13381363,0.51861453,0.002954266,0.0011035706,0.31811315],"study_design_scores_gemma":[0.00007526376,0.0013578605,0.09994675,0.000059664213,0.00013788906,0.00224666,0.0008230023,0.57831144,0.30196893,0.0024181355,0.01253516,0.00011926944],"about_ca_topic_score_codex":0.0025002954,"about_ca_topic_score_gemma":0.003320731,"teacher_disagreement_score":0.0025002954,"about_ca_system_score_codex":0.00015548579,"about_ca_system_score_gemma":0.00018133993,"threshold_uncertainty_score":0.004971504},"labels":[],"label_agreement":null},{"id":"W2044883957","doi":"10.4304/jnw.7.5.812-820","title":"Delay-Constrained Admission and Bandwidth Allocation for Long-Reach EPON","year":2012,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Advanced Photonic Communication Systems","field":"Engineering","cited_by":11,"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; Bandwidth allocation; Bandwidth (computing); Dynamic bandwidth allocation; Computer network; Real-time computing","score_opus":0.016546371461551905,"score_gpt":0.2632045032038496,"score_spread":0.24665813174229767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044883957","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.47344851,0.0004919633,0.5189956,0.0006066017,0.000084554704,0.000089307905,0.000046772642,0.00030018153,0.00593644],"genre_scores_gemma":[0.9901839,0.000052835236,0.009137529,0.00002143578,0.000011247425,0.000014135133,0.000010362157,0.000009709554,0.00055891334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966824,0.000101954516,0.000008662282,0.000038078764,0.00008157091,0.00010151491],"domain_scores_gemma":[0.99955815,0.00023396486,0.00007188795,0.0000289946,0.000047296802,0.000059740432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000643788,0.00031796045,0.00033026197,0.00015308404,0.0003180823,0.0005113814,0.00058033585,0.00032733954,0.0008675759],"category_scores_gemma":[0.001694884,0.0001950412,0.0001707687,0.00018167048,0.0004804163,0.00052719895,0.00063498,0.00046952802,0.00005090245],"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.00009344731,0.000054570995,0.0005653557,0.00001539868,0.0000073847755,0.000052861662,0.000031110136,0.97591656,0.0026732676,0.0063344287,0.0003397518,0.013915863],"study_design_scores_gemma":[0.0000065262825,0.000011071722,0.000071985975,6.402455e-7,0.000001246372,0.0000043920486,0.0000056800263,0.9983891,0.00030955602,0.0011236543,0.000074251584,0.0000018881426],"about_ca_topic_score_codex":0.0067178616,"about_ca_topic_score_gemma":0.005483091,"teacher_disagreement_score":0.0067178616,"about_ca_system_score_codex":0.00086245744,"about_ca_system_score_gemma":0.0015179061,"threshold_uncertainty_score":0.01335752},"labels":[],"label_agreement":null},{"id":"W2073320561","doi":"10.4304/jnw.7.7.1106-1115","title":"Routing Algorithm Based on Multi-Community Evolutionary Game for VANET","year":2012,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Vehicular ad hoc network; Evolutionary algorithm; Routing (electronic design automation); Algorithm; Artificial intelligence; Computer network; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.04919750498611805,"score_gpt":0.28233116607136716,"score_spread":0.2331336610852491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073320561","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.025848659,0.00018056584,0.9681664,0.00027481033,0.000050061335,0.00012935988,0.000042335032,0.00009220685,0.0052156057],"genre_scores_gemma":[0.7459576,0.00039546893,0.2478679,0.00015449981,0.000037696936,0.00046114193,0.00014119584,0.000034226923,0.004950271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999607,0.00015425502,0.000016959033,0.00006894015,0.00009441451,0.00005849],"domain_scores_gemma":[0.99963653,0.00018876715,0.00004352552,0.000016771877,0.0000726162,0.000041861953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005459863,0.0005905148,0.0007377709,0.0005664838,0.0006939291,0.0007274817,0.0014329951,0.00093260355,0.0015444388],"category_scores_gemma":[0.0016485237,0.00022288403,0.0005485705,0.00053626363,0.0005143591,0.00086788094,0.000931151,0.0006718254,0.00012451496],"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.00004181848,0.000047885947,0.00057251914,0.00005417791,0.000040150295,0.00014058485,0.00009375729,0.92732286,0.0016700543,0.04818122,0.0010750942,0.020759875],"study_design_scores_gemma":[0.000013626603,0.000019718993,0.00004469312,0.000002697109,0.000005158312,0.000034421704,0.000010330747,0.99350655,0.00010890844,0.0057805935,0.00046889455,0.000004465893],"about_ca_topic_score_codex":0.005189779,"about_ca_topic_score_gemma":0.0039017792,"teacher_disagreement_score":0.005189779,"about_ca_system_score_codex":0.0007933147,"about_ca_system_score_gemma":0.001024443,"threshold_uncertainty_score":0.010319114},"labels":[],"label_agreement":null},{"id":"W2085333208","doi":"10.4304/jnw.4.1.9-18","title":"Probabilistic Evidence Aggregation for Malicious Node Position Bounding in Wireless Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Security in Wireless Sensor Networks","field":"Computer Science","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":"Carleton University","funders":"","keywords":"Computer science; Bounding overwatch; Probabilistic logic; Node (physics); Computer network; Position (finance); Wireless; Wireless network; Computer security; Artificial intelligence; Telecommunications","score_opus":0.02250319157323996,"score_gpt":0.27810398996770636,"score_spread":0.25560079839446637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085333208","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.08493823,0.00039710326,0.9130903,0.00030563885,0.000025279107,0.000084393,0.000046559155,0.00022512229,0.000887326],"genre_scores_gemma":[0.9140468,0.0001759302,0.08506637,0.00005133453,0.000051682313,0.00008272826,0.00006023415,0.000019675392,0.00044518113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946398,0.0025254874,0.00031612022,0.00053065125,0.0016917841,0.00029614507],"domain_scores_gemma":[0.9768262,0.01600198,0.0024349561,0.0028201519,0.0015490457,0.0003676714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007377036,0.0008115836,0.0014957871,0.0025552863,0.0009328555,0.0017687719,0.0020526454,0.00089864765,0.000716599],"category_scores_gemma":[0.024285361,0.0006055621,0.00081177114,0.0024134158,0.0017331607,0.0033598628,0.0029211268,0.0013559014,0.00014979726],"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.000508974,0.00013363936,0.004068906,0.000111223366,0.00015811602,0.00021166375,0.0003579268,0.84072083,0.004522669,0.04527717,0.0007489625,0.10317998],"study_design_scores_gemma":[0.00001054324,0.000052341285,0.00033703944,0.000008181474,0.000019429897,0.000041940733,0.000027599628,0.988069,0.0012835136,0.009931637,0.00021032275,0.000008395012],"about_ca_topic_score_codex":0.002560307,"about_ca_topic_score_gemma":0.0019433256,"teacher_disagreement_score":0.007377036,"about_ca_system_score_codex":0.0020523914,"about_ca_system_score_gemma":0.0009878065,"threshold_uncertainty_score":0.03901398},"labels":[],"label_agreement":null},{"id":"W2090908054","doi":"10.4304/jnw.9.12.3347-3355","title":"Verifying Online User Identity using Stylometric Analysis for Short Messages","year":2014,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Authorship Attribution and Profiling","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":"Toronto Metropolitan University; University of Victoria","funders":"","keywords":"Computer science; Identity (music); Information retrieval; Computer security; Artificial intelligence; World Wide Web","score_opus":0.07910227027143786,"score_gpt":0.3555485818100229,"score_spread":0.27644631153858507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090908054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69441134,0.0010106211,0.28932452,0.0004420638,0.00021460086,0.00040761117,0.004682272,0.0036200085,0.0058870153],"genre_scores_gemma":[0.92629856,0.0002549453,0.069455504,0.000032057105,0.00010049908,0.00014572997,0.00243896,0.000049471648,0.0012242756],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9953452,0.0016187606,0.0006292328,0.00073573535,0.0014160818,0.00025495805],"domain_scores_gemma":[0.97933125,0.008932623,0.00458034,0.0034884093,0.003230742,0.00043656628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023460512,0.00065669575,0.0008181858,0.009069888,0.00083405647,0.0016167037,0.00055197364,0.00083825254,0.0010362205],"category_scores_gemma":[0.019819051,0.00017802551,0.00047585927,0.0055048238,0.00056636694,0.0023758758,0.0010450861,0.00062402704,0.0016929528],"study_design_candidate":"bench_or_experimental","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.0010299255,0.0005777714,0.14184216,0.0006550311,0.00017716961,0.0007163363,0.0018443988,0.022326024,0.04412966,0.0070108036,0.007146656,0.7725441],"study_design_scores_gemma":[0.000032903386,0.0003466474,0.11292967,0.00013820315,0.00008109334,0.0014755559,0.0017145331,0.798314,0.05346164,0.019569827,0.011790396,0.0001456011],"about_ca_topic_score_codex":0.0010437135,"about_ca_topic_score_gemma":0.0016617585,"teacher_disagreement_score":0.009069888,"about_ca_system_score_codex":0.00072357245,"about_ca_system_score_gemma":0.0006253038,"threshold_uncertainty_score":0.012407243},"labels":[],"label_agreement":null},{"id":"W2125156513","doi":"10.4304/jnw.4.1.1-8","title":"Effective Location Management of Mobile Actors in Wireless Sensor and Actor Networks","year":2009,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Energy Efficient Wireless Sensor 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":"Dalhousie University","funders":"","keywords":"Computer science; Wireless sensor network; Wireless; Mobile wireless; Wireless network; Computer security; Computer network; Telecommunications","score_opus":0.004470790301259626,"score_gpt":0.22394380570980027,"score_spread":0.21947301540854064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125156513","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.12266656,0.0017708681,0.868662,0.00068874366,0.00015372653,0.000061188555,0.000047767855,0.0004970211,0.005452187],"genre_scores_gemma":[0.93062603,0.0006231654,0.065561935,0.000059168393,0.000056011922,0.00005166102,0.000060587594,0.00002678516,0.002934576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945873,0.00025163172,0.000031057214,0.00010596004,0.000088848086,0.00006369269],"domain_scores_gemma":[0.99925214,0.00031358874,0.00015371807,0.000105077444,0.00011016412,0.00006530034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008707556,0.00039233957,0.00041041267,0.00044719756,0.0006960917,0.0008173878,0.00081845047,0.00070735754,0.00088511215],"category_scores_gemma":[0.0025483295,0.00022469171,0.00021300896,0.00053777714,0.0006043429,0.0020507064,0.0010483488,0.00042128484,0.00033421518],"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.0007839526,0.00014009667,0.006434605,0.0003190041,0.000088514564,0.0008031437,0.0007927765,0.5828915,0.04484019,0.081007175,0.004537148,0.27736175],"study_design_scores_gemma":[0.000035039884,0.00024507698,0.00093475427,0.000043500386,0.00005687708,0.000400374,0.00037584227,0.95093733,0.016088936,0.018156443,0.012695611,0.000030288826],"about_ca_topic_score_codex":0.0006622652,"about_ca_topic_score_gemma":0.0009333614,"teacher_disagreement_score":0.00088511215,"about_ca_system_score_codex":0.00043119767,"about_ca_system_score_gemma":0.0003579596,"threshold_uncertainty_score":0.0046049953},"labels":[],"label_agreement":null},{"id":"W2144738839","doi":"10.4304/jnw.9.2.501-506","title":"An Image Fusion Method Based on NSCT and Dual-channel PCNN Model","year":2014,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Advanced Image Fusion Techniques","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Dual (grammatical number); Artificial intelligence; Computer vision; Image (mathematics); Image fusion; Fusion; Channel (broadcasting); Pattern recognition (psychology); Telecommunications","score_opus":0.007480037986895567,"score_gpt":0.26632555880745745,"score_spread":0.2588455208205619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144738839","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.02778109,0.0005999755,0.9660057,0.00025574697,0.00033394748,0.00006437629,0.00017709534,0.0011822858,0.0035997827],"genre_scores_gemma":[0.40233877,0.0015706497,0.5832278,0.00023154989,0.00021171418,0.00012666325,0.00094849704,0.00018973033,0.011154571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996383,0.000024833935,0.00002107691,0.0000763686,0.00020877268,0.000030647865],"domain_scores_gemma":[0.9997744,0.000021722059,0.000014373529,0.000033705986,0.0001381956,0.000017479968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045744234,0.00055929925,0.00077497587,0.0010432926,0.00045074162,0.0006479155,0.0005684196,0.00072686805,0.0024141462],"category_scores_gemma":[0.0007013829,0.00032335045,0.0010322119,0.000894072,0.00029913572,0.0014959595,0.00065791537,0.00085788063,0.0009936601],"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.0003074195,0.00012613968,0.0014681333,0.00020554097,0.0001481764,0.00014265472,0.000101793645,0.051333476,0.11790792,0.0042590057,0.006477986,0.81752175],"study_design_scores_gemma":[0.00002244339,0.00010733653,0.0022118576,0.00002225018,0.00012069436,0.00030809306,0.00004375026,0.94730675,0.043152656,0.0019274107,0.004724465,0.000052288302],"about_ca_topic_score_codex":0.0056029223,"about_ca_topic_score_gemma":0.0059589893,"teacher_disagreement_score":0.0056029223,"about_ca_system_score_codex":0.0004193228,"about_ca_system_score_gemma":0.00110731,"threshold_uncertainty_score":0.011140645},"labels":[],"label_agreement":null},{"id":"W2149812531","doi":"10.4304/jnw.1.3.1-8","title":"Efficient Distributed Algorithm for RWA Using Path Protection","year":2006,"lang":"en","type":"article","venue":"Journal of Networks","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":7,"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; Path (computing); Distributed computing; Algorithm; Computer network","score_opus":0.010621480415194734,"score_gpt":0.2204993149802355,"score_spread":0.20987783456504078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149812531","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.0053747306,0.00009053218,0.99009854,0.00013798481,0.000033833083,0.000098223965,0.00004824682,0.0009862331,0.0031316667],"genre_scores_gemma":[0.19439541,0.000096786374,0.7996816,0.00009723489,0.00003440594,0.000535603,0.00022859413,0.00021792663,0.004712401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928564,0.00017597884,0.000031095606,0.00018700649,0.00017126967,0.00014896994],"domain_scores_gemma":[0.9991412,0.0004936962,0.00007350066,0.00011631751,0.00013505078,0.000040144238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010740596,0.0010445794,0.0011654628,0.0007668235,0.00089687994,0.0011025975,0.0016261658,0.0013018574,0.009214611],"category_scores_gemma":[0.0025291808,0.00044825408,0.0005807553,0.00079757505,0.00077317376,0.0014172306,0.0017344656,0.0010613024,0.0017400441],"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.00025636968,0.00024189935,0.0004152502,0.00016329702,0.000045951932,0.00012290469,0.0001644841,0.7101636,0.00679155,0.033972077,0.007313054,0.2403495],"study_design_scores_gemma":[0.00013194868,0.000048055816,0.00004720847,0.000007101278,0.0000094081315,0.000029981784,0.000037724443,0.98360336,0.0012098894,0.012377499,0.0024903796,0.0000075805533],"about_ca_topic_score_codex":0.0027606823,"about_ca_topic_score_gemma":0.003815906,"teacher_disagreement_score":0.009214611,"about_ca_system_score_codex":0.0010587928,"about_ca_system_score_gemma":0.0023431224,"threshold_uncertainty_score":0.030825913},"labels":[],"label_agreement":null}]}