{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1382,"total_is_capped":false,"direct_labels_cover":2,"predictions_cover":1382,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"378dac038a7f","filters":{"topic":"Mobile Ad Hoc Networks"}},"results":[{"id":"W2156689181","doi":"10.1023/a:1012319418150","title":"Routing with Guaranteed Delivery in Ad Hoc Wireless Networks","year":2001,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1203,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; Routing protocol; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications","authors":[{"name":"Prosenjit Bose","is_ca":true},{"name":"Pat Morin","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true},{"name":"Jorge Urrutia","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009027105612704069,"gpt":0.2084926108908004,"spread":0.1994655052780963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003983897,0.001181107,0.001805888,0.001352282,0.00131822,0.003140661,0.003031211,0.002205544,0.004205835],"category_scores_gemma":[0.0145661,0.0009398753,0.0006486799,0.002120715,0.002080135,0.005926028,0.002682289,0.002703225,0.001341626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001639673,"about_ca_system_score_gemma":0.001443772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00163448,"about_ca_topic_score_gemma":0.001300038,"domain_scores_codex":[0.9965093,0.001464367,0.0001885995,0.0004033022,0.001130802,0.0003036048],"domain_scores_gemma":[0.9937668,0.004253994,0.0003387186,0.0009764935,0.0004971776,0.000166886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007086205,0.0001456649,0.000597756,0.0009234546,0.0001528165,0.0002841263,0.0004212933,0.2797279,0.003001826,0.4081822,0.02826048,0.2775939],"study_design_scores_gemma":[0.0001373239,0.0001614857,0.0001907079,0.00009488242,0.0001002329,0.000260724,0.00007644321,0.7032858,0.001905314,0.2710018,0.02274199,0.0000432974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005747586,0.005494586,0.9810963,0.001185857,0.0006511275,0.00008554261,0.00007054934,0.00121345,0.004455026],"genre_scores_gemma":[0.5064427,0.01020058,0.4599552,0.0007134337,0.001850849,0.0005714041,0.0004715775,0.0005847398,0.01920949],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004205835,"threshold_uncertainty_score":0.02106911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165275875","doi":"10.1109/71.980024","title":"Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":871,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nortel (Canada); University of Ottawa","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Retransmission; Node (physics); Overhead (engineering); Wireless network; Transmission (telecommunications); Wireless; Algorithm; Distributed computing; Network packet; Telecommunications","authors":[{"name":"Ivan Stojmenović","is_ca":true},{"name":"M. Seddigh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01915252195389812,"gpt":0.2278275419431529,"spread":0.2086750199892548,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001380992,0.0009280157,0.000934955,0.001315973,0.0008562107,0.001003345,0.001546925,0.0008904953,0.001064781],"category_scores_gemma":[0.004057874,0.000454968,0.000643188,0.001970206,0.001097076,0.001622239,0.0009758798,0.0009897032,0.000415559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001267636,"about_ca_system_score_gemma":0.0008732416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001668063,"about_ca_topic_score_gemma":0.001534631,"domain_scores_codex":[0.9985454,0.0006181319,0.00007700663,0.000202603,0.0004608164,0.0000960222],"domain_scores_gemma":[0.9984048,0.0009911354,0.0001910938,0.000132618,0.0002215431,0.00005881342],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001915239,0.0001175946,0.001007767,0.0007273169,0.000204288,0.000134362,0.0006347637,0.5024277,0.006687006,0.1983455,0.00592226,0.2835999],"study_design_scores_gemma":[0.0001260573,0.0003425378,0.0006242162,0.00009583197,0.00009152482,0.0003683829,0.000192193,0.7871311,0.005629456,0.1753523,0.02998923,0.00005712367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01997414,0.004443207,0.9666889,0.0004504882,0.0002034669,0.0002559781,0.0001291491,0.0004395074,0.007415154],"genre_scores_gemma":[0.3797943,0.006517937,0.6032907,0.0005435481,0.0004064663,0.0008319906,0.0005897678,0.0001424741,0.007882712],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001668063,"threshold_uncertainty_score":0.009197414,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145885111","doi":"10.1109/mcom.2002.1018018","title":"Position-based routing in ad hoc networks","year":2002,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":650,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Distributed computing; Routing protocol; Static routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Robustness (evolution); Wireless ad hoc network; Scalability; Interior gateway protocol; Routing (electronic design automation); Wireless; Telecommunications","authors":[{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02975569859432026,"gpt":0.260003688707304,"spread":0.2302479901129837,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001151344,0.001472242,0.001274127,0.00152963,0.0007217763,0.003151435,0.001807936,0.002378623,0.004739393],"category_scores_gemma":[0.002622577,0.0007854339,0.0004794357,0.003832804,0.00181894,0.004303689,0.001503975,0.002041299,0.004897252],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007791886,"about_ca_system_score_gemma":0.0007510601,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007812004,"about_ca_topic_score_gemma":0.0007423922,"domain_scores_codex":[0.9985745,0.0003878112,0.0001228902,0.0001691319,0.0006844789,0.00006126463],"domain_scores_gemma":[0.9991811,0.0003630565,0.00007652333,0.0001555225,0.000177622,0.00004623094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004307417,0.00005832522,0.0004377037,0.001602109,0.000063762,0.0003032562,0.0003155428,0.03166007,0.003204151,0.3580478,0.04399803,0.5602662],"study_design_scores_gemma":[0.00003837562,0.0001743994,0.0005004535,0.0005358325,0.00006243538,0.001178978,0.0001604116,0.06199009,0.001751329,0.2854776,0.6480537,0.00007642122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002596528,0.1677178,0.7696062,0.003441245,0.00532752,0.0003429043,0.0002337738,0.001877751,0.04885635],"genre_scores_gemma":[0.1028731,0.2855487,0.5408906,0.001659053,0.007668413,0.0009770491,0.001149074,0.0004232072,0.05881083],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004739393,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083719968","doi":"10.1016/j.comnet.2011.05.010","title":"Routing protocols in ad hoc networks: A survey","year":2011,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":535,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Routing protocol; Distributed computing; Mobile ad hoc network; Ad hoc wireless distribution service; Wireless Routing Protocol; Link-state routing protocol; Vehicular ad hoc network; Wireless; Routing (electronic design automation); Telecommunications; Network packet","authors":[{"name":"Azzedine Boukerche","is_ca":true},{"name":"Begümhan Turgut","is_ca":false},{"name":"Nevin Aydın","is_ca":false},{"name":"Mohammad Zubair Ahmad","is_ca":false},{"name":"Ladislau Bölöni","is_ca":false},{"name":"Damla Turgut","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05050942116015256,"gpt":0.2641481605096089,"spread":0.2136387393494563,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003266633,0.001586929,0.002729628,0.003282808,0.0009933345,0.005024148,0.003168023,0.002480607,0.003497476],"category_scores_gemma":[0.007101894,0.00113981,0.000837157,0.009672769,0.001261127,0.01011377,0.00180839,0.002766639,0.002172288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001058969,"about_ca_system_score_gemma":0.001856347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001260368,"about_ca_topic_score_gemma":0.0009036926,"domain_scores_codex":[0.9974108,0.0004715586,0.0004355667,0.0003808262,0.001159061,0.0001421646],"domain_scores_gemma":[0.9948611,0.003339624,0.0002567805,0.0004371345,0.000962045,0.0001433319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001287575,0.0003054447,0.001293064,0.006705636,0.0001144326,0.0001422909,0.0002170025,0.01123756,0.001901967,0.04407725,0.0221265,0.91175],"study_design_scores_gemma":[0.0001206807,0.0006719133,0.002038442,0.003552488,0.0004317603,0.00299489,0.0008205302,0.06815908,0.005130195,0.1339567,0.7819508,0.0001726177],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.004675741,0.8433426,0.1343294,0.002372351,0.001839754,0.0002269941,0.0002202895,0.0004957286,0.01249715],"genre_scores_gemma":[0.02684296,0.891161,0.07355061,0.0008313867,0.002804004,0.0002201395,0.0006118013,0.0001166231,0.003861452],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.005024148,"threshold_uncertainty_score":0.01727581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092910894","doi":"10.1016/s0304-3975(98)00223-0","title":"Power consumption in packet radio networks","year":2000,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":424,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec; Université du Québec en Outaouais; Carleton University","funders":"","keywords":"Bounded function; Network packet; Constant (computer programming); Approximation algorithm; Mathematics; Assignment problem; Range (aeronautics); Generalized assignment problem; Node (physics); Path (computing); Mathematical optimization; Dynamic programming; Combinatorics; Discrete mathematics; Computer science; Computer network","authors":[{"name":"Lefteris M. Kirousis","is_ca":false},{"name":"Evangelos Kranakis","is_ca":true},{"name":"Danny Kriz̧anc","is_ca":true},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007225679416192487,"gpt":0.2328950077014554,"spread":0.2256693282852629,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207947,0.0004012612,0.0004675023,0.0005424452,0.0003260277,0.0009298898,0.0006237803,0.0004706422,0.003057515],"category_scores_gemma":[0.003603642,0.0003561513,0.0001503769,0.001070222,0.0004121372,0.001349171,0.0003870357,0.000386612,0.0004122446],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000711805,"about_ca_system_score_gemma":0.0002546063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001047891,"about_ca_topic_score_gemma":0.0007728817,"domain_scores_codex":[0.9994986,0.0001378132,0.00001821893,0.0000600082,0.0002051399,0.0000801645],"domain_scores_gemma":[0.9986154,0.001034012,0.00006485952,0.0001082687,0.0001449688,0.00003246335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003004211,0.0001099328,0.00382476,0.0001854387,0.00005057761,0.000215434,0.000153708,0.8007951,0.01143977,0.05808122,0.00319083,0.1216528],"study_design_scores_gemma":[0.0000125672,0.00007055303,0.002471751,0.00001494768,0.00002793058,0.0001883225,0.00008850092,0.9461772,0.004127826,0.04302721,0.003780666,0.00001254703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3544423,0.007324516,0.6013944,0.00178365,0.0003690559,0.00006505358,0.0003919,0.0008790328,0.0333501],"genre_scores_gemma":[0.9830777,0.001168319,0.008236516,0.00006307635,0.00008040282,0.00002458212,0.0001176747,0.0001024643,0.007129283],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003057515,"threshold_uncertainty_score":0.0102284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2124297703","doi":"10.1109/jcn.2002.6596934","title":"On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":370,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Routing protocol; Telecommunications","authors":[{"name":"Jie Wu","is_ca":false},{"name":"Fei Dai","is_ca":false},{"name":"Ming Gao","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02377303206741777,"gpt":0.2757971317582326,"spread":0.2520240996908149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067823,0.001027826,0.0009578199,0.001811613,0.0008042568,0.0009166897,0.001358087,0.0008256874,0.001015117],"category_scores_gemma":[0.00925751,0.0004371498,0.0007625641,0.001817939,0.0006880921,0.001512646,0.0009407591,0.000662765,0.0002765315],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000965055,"about_ca_system_score_gemma":0.0007994884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001238416,"about_ca_topic_score_gemma":0.001430919,"domain_scores_codex":[0.9982241,0.0008049326,0.0001016063,0.0001278073,0.0006918515,0.00004968208],"domain_scores_gemma":[0.9963243,0.002735656,0.0001704488,0.0001759403,0.0005317949,0.00006195634],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006492996,0.0000460274,0.0008793033,0.0002487318,0.00007816005,0.0001284879,0.0001433824,0.8744886,0.002678006,0.02303376,0.001609367,0.09660123],"study_design_scores_gemma":[0.00001295512,0.00004766504,0.0001556387,0.00002404035,0.00002019372,0.00008188016,0.00001748638,0.9839499,0.001595128,0.01219282,0.001890465,0.00001177343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008296354,0.0003935005,0.9897288,0.0001021748,0.00006787667,0.0001020097,0.00003098825,0.000134927,0.001143393],"genre_scores_gemma":[0.2230955,0.0009787502,0.7741368,0.00009655498,0.0001192593,0.0004433515,0.0001669275,0.00005730467,0.0009055345],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002067823,"threshold_uncertainty_score":0.01093578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2007217169","doi":"10.1016/j.jnca.2009.07.002","title":"Survey of multipath routing protocols for mobile ad hoc networks","year":2009,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":282,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Computer science; Multipath routing; Computer network; Routing protocol; Link-state routing protocol; Wireless Routing Protocol; Distributed computing; Routing (electronic design automation)","authors":[{"name":"Mohammed Tarique","is_ca":false},{"name":"Kemal Tepe","is_ca":true},{"name":"Sasan Adibi","is_ca":true},{"name":"S. Erfani","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02348658634003196,"gpt":0.2957509871184213,"spread":0.2722644007783894,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135832,0.001175137,0.001563911,0.003140439,0.001110702,0.002644673,0.002730754,0.001596508,0.002975279],"category_scores_gemma":[0.004283363,0.0009445372,0.0006514461,0.006910337,0.0006557504,0.005019487,0.00168966,0.001922307,0.001594699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001201353,"about_ca_system_score_gemma":0.001906163,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001345812,"about_ca_topic_score_gemma":0.001216193,"domain_scores_codex":[0.9983717,0.0002781046,0.0002363475,0.0002886735,0.0006903508,0.0001348153],"domain_scores_gemma":[0.9973355,0.001074892,0.0002241113,0.0003311856,0.000901537,0.0001327058],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001507352,0.0001603047,0.0008863797,0.004489236,0.0001166966,0.0001145134,0.0001024617,0.01431175,0.004269503,0.03132075,0.02094188,0.9231358],"study_design_scores_gemma":[0.00006265751,0.0007750326,0.00153271,0.001732423,0.0003594249,0.00178191,0.0003006126,0.06288611,0.007232022,0.04977731,0.8734265,0.0001333225],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.008255937,0.6943083,0.2723196,0.00323086,0.002301412,0.0003236892,0.0003661651,0.0008106664,0.01808326],"genre_scores_gemma":[0.05803329,0.7829138,0.1438619,0.001073204,0.003215079,0.0003265742,0.001122508,0.0001648493,0.009288915],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003140439,"threshold_uncertainty_score":0.0112955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967996014","doi":"10.1109/mobhoc.2007.4428616","title":"Efficient Mesh Router Placement in Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":265,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Router; Switched mesh; Shared mesh; Heuristic; Distributed computing; Order One Network Protocol; The Internet; Constraint (computer-aided design); Mesh networking; Wireless network; Default gateway; Wireless; Mathematics; Telecommunications","authors":[{"name":"Junfang Wang","is_ca":false},{"name":"Bin Xie","is_ca":false},{"name":"Kan Cai","is_ca":true},{"name":"Dharma P. Agrawal","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009556968764721176,"gpt":0.2361285238498626,"spread":0.2265715550851414,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006367477,0.0005191472,0.0006459272,0.000797211,0.0005168023,0.00052097,0.0008902607,0.0007907317,0.001018021],"category_scores_gemma":[0.002270206,0.0004390535,0.0002602318,0.001138436,0.0004020573,0.0009795247,0.0007777587,0.0003239228,0.0003046682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004978311,"about_ca_system_score_gemma":0.0004478442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001450393,"about_ca_topic_score_gemma":0.001843938,"domain_scores_codex":[0.999465,0.0002564684,0.00002558299,0.00007283872,0.0001249117,0.00005520743],"domain_scores_gemma":[0.9994217,0.000310858,0.00009902888,0.00008030807,0.00006644389,0.00002165395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00011242,0.00003505248,0.0008147078,0.0001114174,0.00002742648,0.0001780813,0.00005349786,0.8863955,0.007604504,0.01301996,0.001897953,0.08974956],"study_design_scores_gemma":[0.0000130393,0.00003913064,0.0001123816,0.00000596813,0.000005964522,0.00006688819,0.00002545344,0.9911234,0.001879323,0.005548564,0.001174477,0.000005400597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02198174,0.0003162242,0.9756601,0.0001095022,0.00002964246,0.00004355522,0.00004241569,0.000293443,0.001523273],"genre_scores_gemma":[0.4828017,0.0006196655,0.5142956,0.00004075115,0.00004996526,0.000115811,0.0001766042,0.00006227518,0.001837528],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001450393,"threshold_uncertainty_score":0.003612041,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2149076393","doi":"10.1109/hicss.2002.994183","title":"Connectivity based k-hop clustering in wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":260,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Cluster analysis; Computer science; Clustering coefficient; Node (physics); Wireless ad hoc network; Cluster (spacecraft); Set (abstract data type); Theoretical computer science; Algorithm; Computer network; Wireless; Artificial intelligence","authors":[{"name":"Geng Chen","is_ca":true},{"name":"Fabián García Nocetti","is_ca":false},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01308461231721515,"gpt":0.2267866513309311,"spread":0.213702039013716,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008989148,0.000700666,0.0007760585,0.001345749,0.0008782922,0.001154581,0.001790257,0.001324032,0.0009791977],"category_scores_gemma":[0.003221422,0.0004849157,0.0005643521,0.002242678,0.001119313,0.003087149,0.001010521,0.0006900356,0.00056233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009624266,"about_ca_system_score_gemma":0.0006010632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001715516,"about_ca_topic_score_gemma":0.00200285,"domain_scores_codex":[0.9988691,0.000339154,0.00008047521,0.0002303804,0.0004217557,0.00005904707],"domain_scores_gemma":[0.9988418,0.000613389,0.0001348677,0.0001640225,0.0002146276,0.00003116553],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001274225,0.00006160326,0.001523122,0.0008276536,0.0001348616,0.0002734165,0.0004488053,0.5570001,0.008417423,0.1213164,0.004863103,0.3050061],"study_design_scores_gemma":[0.00003835573,0.0001108139,0.0008350116,0.00007317971,0.00006601011,0.0004959331,0.000108415,0.8861684,0.005618916,0.08146136,0.02493891,0.00008479392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00653404,0.001835563,0.9895489,0.0001858175,0.00008323336,0.00006829674,0.00003319619,0.0003632869,0.001347775],"genre_scores_gemma":[0.1598544,0.004429102,0.8314243,0.0001482844,0.0002523574,0.0002864437,0.0002748992,0.0001765444,0.003153575],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001790257,"threshold_uncertainty_score":0.006982863,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2083944171","doi":"10.1145/513800.513821","title":"Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":257,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected dominating set; Wireless ad hoc network; Computer science; Dominating set; Approximation algorithm; Cluster analysis; Graph; Mobile ad hoc network; Algorithm; Topology (electrical circuits); Mathematics; Theoretical computer science; Combinatorics; Computer network; Vertex (graph theory); Wireless","authors":[{"name":"Yuanzhu Peter Chen","is_ca":true},{"name":"Arthur L. Liestman","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01737055995851462,"gpt":0.2433278574520575,"spread":0.2259572974935428,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001712754,0.0009482634,0.001258216,0.001346077,0.0006826171,0.0008430335,0.001734582,0.000787104,0.0008039009],"category_scores_gemma":[0.009254752,0.0004574908,0.0006676596,0.001772863,0.0008066111,0.001608563,0.001120087,0.0008195477,0.0003082029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001205865,"about_ca_system_score_gemma":0.0007261864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001475071,"about_ca_topic_score_gemma":0.001893776,"domain_scores_codex":[0.9990024,0.0003370388,0.00005715413,0.0001661867,0.0003815415,0.00005563541],"domain_scores_gemma":[0.9967624,0.001952872,0.0003282564,0.0004173747,0.0004265266,0.0001124417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009400208,0.00004713307,0.0006904691,0.0001002133,0.00003483312,0.00003473052,0.00007351406,0.9367117,0.002708502,0.009095468,0.0008321712,0.04957727],"study_design_scores_gemma":[0.00001009119,0.00004061352,0.0001122851,0.000005004858,0.000006923396,0.0000220885,0.00001456037,0.9896736,0.001080528,0.00861026,0.0004199795,0.000004124752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02435059,0.0003369036,0.9739805,0.0001119188,0.00003016456,0.0000650393,0.00005859851,0.0002295485,0.0008365915],"genre_scores_gemma":[0.4292392,0.0006201775,0.5674892,0.00008631549,0.00008016231,0.0003373299,0.0004293012,0.00009270629,0.001625535],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001734582,"threshold_uncertainty_score":0.009057999,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163943736","doi":"10.1109/lcn.2001.990778","title":"MP-DSR: a QoS-aware multi-path dynamic source routing protocol for wireless ad-hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Routing protocol; Link-state routing protocol; Wireless ad hoc network; Zone Routing Protocol; DSRFLOW; Distributed computing; Adaptive quality of service multi-hop routing; Destination-Sequenced Distance Vector routing; Network packet; Wireless; Telecommunications","authors":[{"name":"Ricky Wai-kei Leung","is_ca":true},{"name":"Jilei Liu","is_ca":true},{"name":"E. Colin S. Poon","is_ca":true},{"name":"A.-L.C. Chan","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0257657941799144,"gpt":0.277298228032923,"spread":0.2515324338530086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545092,0.0005525729,0.0005122091,0.0007820547,0.0004596548,0.0006187588,0.001361701,0.0007139603,0.001321514],"category_scores_gemma":[0.001156512,0.0002036661,0.0002810238,0.000693904,0.000466838,0.001232547,0.0009090148,0.0009339556,0.0007405229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000288219,"about_ca_system_score_gemma":0.0005380964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004836058,"about_ca_topic_score_gemma":0.0008233421,"domain_scores_codex":[0.999679,0.00007272825,0.00002395744,0.00003279313,0.0001701499,0.00002141853],"domain_scores_gemma":[0.9996144,0.0001174605,0.00005493227,0.00006794255,0.0001114181,0.00003387847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003472753,0.0001983391,0.0006265123,0.001268747,0.0001679933,0.0007924291,0.0003438561,0.08348688,0.09521808,0.06566422,0.02997225,0.7219133],"study_design_scores_gemma":[0.0002392919,0.0008790641,0.001044438,0.000137815,0.0002285971,0.00291067,0.0001510868,0.5988798,0.05688139,0.04264882,0.2958325,0.0001665274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01643508,0.006281592,0.9615806,0.0007366139,0.0005259414,0.0004586372,0.000309529,0.004269937,0.009402177],"genre_scores_gemma":[0.3146686,0.009219932,0.6596486,0.0006432435,0.0004699906,0.0009982357,0.001553399,0.0003658845,0.01243217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001361701,"threshold_uncertainty_score":0.004420936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1988969082","doi":"10.1016/j.adhoc.2008.06.001","title":"HOPNET: A hybrid ant colony optimization routing algorithm for mobile ad hoc network","year":2008,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":234,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Ant colony optimization algorithms; Link-state routing protocol; Distance-vector routing protocol; Hybrid routing; Distributed computing; Computer network; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Routing protocol; Static routing; Swarm intelligence; Algorithm; Network packet; Particle swarm optimization","authors":[{"name":"Jianping Wang","is_ca":true},{"name":"Eseosa Osagie","is_ca":true},{"name":"Parimala Thulasiraman","is_ca":true},{"name":"Ruppa K. Thulasiram","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0117247028281354,"gpt":0.2278753296525496,"spread":0.2161506268244142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919498,0.0004355492,0.0005171667,0.0004968949,0.0004048866,0.0004430117,0.0009749369,0.0005317384,0.003032858],"category_scores_gemma":[0.0007464255,0.0002279466,0.0002087945,0.0004663626,0.0001942,0.0006773178,0.0005902965,0.0004881106,0.0006720665],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000238848,"about_ca_system_score_gemma":0.0005222345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001594852,"about_ca_topic_score_gemma":0.003261113,"domain_scores_codex":[0.9998115,0.00004568485,0.000008373545,0.00002170975,0.00009603488,0.00001680952],"domain_scores_gemma":[0.9997908,0.00007935574,0.00001617689,0.00002282727,0.00007338219,0.00001730034],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003532565,0.0002179806,0.001208915,0.0002701281,0.000149598,0.0001604508,0.00009976498,0.4518947,0.01445375,0.01227374,0.01908189,0.4998358],"study_design_scores_gemma":[0.00007064912,0.0001191626,0.0002233408,0.000009765122,0.00002912112,0.00007463244,0.0000181447,0.9806724,0.004128499,0.00291149,0.01172669,0.0000162331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02899903,0.0007291242,0.9542375,0.0002322246,0.0003706656,0.0002412484,0.0002552147,0.006405789,0.008529164],"genre_scores_gemma":[0.2641726,0.0006180124,0.7157658,0.0002276804,0.0001027732,0.0003944628,0.0007107549,0.0006585176,0.01734938],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003032858,"threshold_uncertainty_score":0.01014596,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047377413","doi":"10.1145/381591.381614","title":"Routing with load balancing in wireless Ad hoc networks","year":2001,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":231,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Dynamic Source Routing; Distributed computing; Routing protocol; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Ad hoc wireless distribution service; Geographic routing; Network packet; Wireless; Telecommunications","authors":[{"name":"Hossam S. Hassanein","is_ca":true},{"name":"Audrey Zhou","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007621184751426363,"gpt":0.2102234625760273,"spread":0.2026022778246009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001510288,0.001071356,0.0009064923,0.0009825719,0.0009036026,0.001525618,0.001401165,0.001350939,0.001270216],"category_scores_gemma":[0.003974646,0.0004722929,0.0003458004,0.00189052,0.0008919534,0.003317535,0.001239641,0.0007345183,0.0008604377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005952096,"about_ca_system_score_gemma":0.0005422377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007387446,"about_ca_topic_score_gemma":0.000725726,"domain_scores_codex":[0.9986839,0.000522464,0.00008102348,0.0001431763,0.0004916022,0.00007787599],"domain_scores_gemma":[0.9990939,0.0004235829,0.0001181848,0.0001503601,0.0001736581,0.00004036418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002319959,0.0001663205,0.0009138476,0.0006143939,0.0001119848,0.0003306761,0.0002338324,0.4655898,0.01105519,0.06238692,0.01117808,0.4471869],"study_design_scores_gemma":[0.00009618237,0.0002282355,0.0003904956,0.00007799618,0.00007521643,0.0004059505,0.0001065693,0.8614073,0.003979772,0.08931038,0.0438694,0.00005251599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01331824,0.006585602,0.9673818,0.0009342236,0.0007064558,0.0002477931,0.00005417212,0.001627063,0.009144589],"genre_scores_gemma":[0.5646131,0.01384267,0.4028518,0.0006983096,0.002177109,0.0008991631,0.0003991369,0.0003922753,0.01412642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001525618,"threshold_uncertainty_score":0.007987261,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153410375","doi":"10.1109/tpds.2003.1239871","title":"Localized Delaunay triangulation with application in ad hoc wireless networks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Computer science; Unit disk graph; Wireless ad hoc network; Spanner; Computer network; Topology (electrical circuits); Wireless network; Distributed computing; Algorithm; Mathematics; Wireless; Combinatorics; Telecommunications","authors":[{"name":"Xiangyang Li","is_ca":false},{"name":"Gruiă Cälinescu","is_ca":false},{"name":"Peng‐Jun Wan","is_ca":false},{"name":"Yu Wang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009531872383462547,"gpt":0.2165016350579502,"spread":0.2069697626744876,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006945888,0.0008176149,0.0008469599,0.001158477,0.0008825866,0.0006692969,0.001304724,0.001250616,0.002508675],"category_scores_gemma":[0.003204321,0.0004622113,0.0006765398,0.003459803,0.0008099137,0.001201188,0.001755693,0.00114291,0.001074777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005059398,"about_ca_system_score_gemma":0.0005098121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00158843,"about_ca_topic_score_gemma":0.001248657,"domain_scores_codex":[0.9989961,0.0003346171,0.00005720874,0.0001422765,0.0004218145,0.00004809591],"domain_scores_gemma":[0.9988249,0.0005442994,0.0001374124,0.0001569489,0.0002876545,0.00004877869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001109559,0.00008328333,0.001698732,0.001146441,0.00008305799,0.0005791963,0.000543015,0.3282289,0.01667605,0.04890072,0.008849205,0.5931005],"study_design_scores_gemma":[0.00003332702,0.0001662102,0.0004720965,0.000115151,0.00004282001,0.0006342244,0.0002048826,0.8970006,0.007860844,0.04407695,0.04934466,0.00004822149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003917077,0.003010159,0.9891095,0.0001879294,0.0001501613,0.0001083945,0.00002498433,0.0006542057,0.002837591],"genre_scores_gemma":[0.1899756,0.007265182,0.7984392,0.000230792,0.0002431492,0.0004420167,0.0001600083,0.0001526484,0.003091515],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002508675,"threshold_uncertainty_score":0.008392334,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1921603329","doi":"10.1109/icc.2002.997008","title":"Group mobility and partition prediction in wireless ad-hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Network partition; Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Mobility model; Partition (number theory); Optimized Link State Routing Protocol; Distributed computing; Wireless network; Cluster analysis; Network topology; Mobile radio; Wireless; Routing protocol; Routing (electronic design automation); Artificial intelligence; Network packet; Mathematics","authors":[{"name":"K.H. Wang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008876906264831739,"gpt":0.2088461184559708,"spread":0.199969212191139,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313714,0.0006758973,0.0006379958,0.001086122,0.0006345834,0.0005339193,0.0007518106,0.0008420448,0.0002405623],"category_scores_gemma":[0.01075117,0.0003421321,0.000317342,0.001136853,0.0009652734,0.002153779,0.0009258813,0.0007252981,0.0001422663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005910973,"about_ca_system_score_gemma":0.000351893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004271237,"about_ca_topic_score_gemma":0.00280161,"domain_scores_codex":[0.9993272,0.0002826962,0.00003356113,0.0001126795,0.0001751223,0.00006869886],"domain_scores_gemma":[0.9950971,0.003290303,0.0006376627,0.0004365647,0.0004103638,0.0001280343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008482095,0.00003013309,0.0063658,0.00002796309,0.00002521205,0.00006440444,0.0001136434,0.951288,0.001349385,0.004243538,0.0004634067,0.03594359],"study_design_scores_gemma":[0.000003511806,0.00001603934,0.0006574029,0.000003254046,0.000004610642,0.00002582162,0.00002096998,0.9938529,0.0004072241,0.004817227,0.0001864428,0.000004680025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1776993,0.0008010192,0.8195432,0.0003860119,0.00006376504,0.00006856216,0.0001011218,0.000349915,0.0009871016],"genre_scores_gemma":[0.9398459,0.0004644443,0.05889969,0.00003967143,0.00008227461,0.00006615555,0.0002078948,0.0000243915,0.0003694476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004271237,"threshold_uncertainty_score":0.008492768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136520221","doi":"10.1109/surv.2011.042711.00007","title":"Wireless Mesh Networks Design — A Survey","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":206,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Wireless network; Wireless; Routing protocol; Wireless site survey; The Internet; Routing (electronic design automation); Software deployment; Network planning and design; Distributed computing; Key distribution in wireless sensor networks; Telecommunications; World Wide Web","authors":[{"name":"Djohara Benyamina","is_ca":true},{"name":"Abdelhakim Hafid","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1392662808559227,"gpt":0.2990981661956663,"spread":0.1598318853397436,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009817824,0.0006990833,0.0007325439,0.001404624,0.0004319556,0.001585691,0.001683207,0.001273957,0.003876934],"category_scores_gemma":[0.002055138,0.0006055064,0.0005145611,0.002316569,0.0004319596,0.00274818,0.0008373572,0.0008648579,0.001773833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005980189,"about_ca_system_score_gemma":0.0006195065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007141747,"about_ca_topic_score_gemma":0.0006672455,"domain_scores_codex":[0.9993091,0.0001657589,0.00007324275,0.0001237911,0.0002857177,0.00004239794],"domain_scores_gemma":[0.9992148,0.0004079549,0.00006249335,0.00007620132,0.0002051976,0.00003322341],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000641705,0.00009717504,0.001062634,0.003366744,0.00006175956,0.0001663175,0.0001025674,0.02012808,0.00277869,0.0495849,0.02473166,0.8978555],"study_design_scores_gemma":[0.00002873,0.000296177,0.001131681,0.001477597,0.00007853465,0.002180227,0.0002422295,0.07126268,0.004492508,0.06964152,0.8491055,0.00006266226],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.006183276,0.5678076,0.3709331,0.003093845,0.002419547,0.0002792825,0.0003458362,0.0004161897,0.0485213],"genre_scores_gemma":[0.08009025,0.7460493,0.144651,0.00102815,0.003954126,0.0003888342,0.0009735351,0.0001949792,0.02266986],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.003876934,"threshold_uncertainty_score":0.01296961,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W24214201","doi":"10.1007/s11695-013-1116-7","title":"Single Gateway Placement in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"Obesity Surgery","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":202,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Gateway address; Default gateway; Mesh networking; Throughput; Gateway (web page); Heuristics; Wireless network; Distributed computing; Wireless; Telecommunications","authors":[{"name":"Skanda N. Muthaiah","is_ca":true},{"name":"Catherine P. Rosenberg","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02211322323778445,"gpt":0.2091839475923061,"spread":0.1870707243545217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007141121,0.000385892,0.0005538395,0.0006896168,0.0005246478,0.0007028854,0.0008195094,0.0005886991,0.004233929],"category_scores_gemma":[0.001902291,0.0002636352,0.0002639345,0.0008015858,0.00034117,0.001354085,0.0008747482,0.0003341913,0.0008773575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000336727,"about_ca_system_score_gemma":0.0004335639,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007981536,"about_ca_topic_score_gemma":0.001992899,"domain_scores_codex":[0.9995806,0.0001313491,0.00003331294,0.000091366,0.00006336171,0.000099975],"domain_scores_gemma":[0.999176,0.0004094187,0.0000990015,0.0001154279,0.00008743962,0.000112813],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002450475,0.0005744392,0.04884315,0.0007136787,0.0001976538,0.003541051,0.0004271239,0.1045033,0.01661237,0.02639718,0.02991621,0.7658234],"study_design_scores_gemma":[0.0003890531,0.002084906,0.0223337,0.0002024,0.0002591636,0.007788271,0.001071564,0.8818842,0.01074128,0.04038303,0.03278295,0.00007954024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7025294,0.007958828,0.2627248,0.003673133,0.002157438,0.0003301607,0.0006066386,0.001249597,0.01877005],"genre_scores_gemma":[0.9785049,0.001179721,0.01690314,0.0001133908,0.0003021469,0.00005673368,0.0002196064,0.00003293133,0.00268759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004233929,"threshold_uncertainty_score":0.01416391,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1661775361","doi":"10.1007/978-1-84800-328-6","title":"Guide to Wireless Ad Hoc Networks","year":2009,"lang":"en","type":"book","venue":"Computer communications and networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless ad hoc network; Wireless; Computer network; Mobile ad hoc network; Ad hoc wireless distribution service; Computer science; Wireless network; Vehicular ad hoc network; Post-hoc analysis; Telecommunications; Optimized Link State Routing Protocol; Medicine","authors":[{"name":"Subhas Chandra Misra","is_ca":false},{"name":"Sudip Misra","is_ca":true},{"name":"Isaac Woungang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01643028610307961,"gpt":0.2571329500858034,"spread":0.2407026639827238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004854155,0.00243382,0.001936672,0.002411857,0.0006585533,0.001836738,0.001757445,0.001492875,0.1391852],"category_scores_gemma":[0.00130571,0.0008201317,0.0004982934,0.00315232,0.0004878499,0.003043736,0.001199799,0.002679085,0.1734626],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007027176,"about_ca_system_score_gemma":0.001328179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001744309,"about_ca_topic_score_gemma":0.00598918,"domain_scores_codex":[0.99958,0.00003823726,0.00001771627,0.00005612581,0.0002762293,0.00003170019],"domain_scores_gemma":[0.9992887,0.0002008728,0.00002916394,0.00008546992,0.0003159001,0.00007990062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001443845,0.00006806002,0.00007419074,0.0003463426,0.00001383288,0.0000661411,0.0000555867,0.002091136,0.001017597,0.01502929,0.6118972,0.3693261],"study_design_scores_gemma":[0.000005240504,0.00002260926,0.0001019801,0.0001847199,0.000008091008,0.0001615169,0.00001552315,0.001529173,0.0002375828,0.006017081,0.9917063,0.00001029426],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.0007198188,0.0460847,0.2201926,0.002437412,0.006733946,0.0003375934,0.002635766,0.005779085,0.7150791],"genre_scores_gemma":[0.001801429,0.02353025,0.03485903,0.0009309865,0.0008109076,0.0002117707,0.00159126,0.0007345942,0.9355298],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1391852,"threshold_uncertainty_score":0.465621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2062802747","doi":"10.1109/tvt.2014.2313865","title":"Security Enhancements for Mobile Ad Hoc Networks With Trust Management Using Uncertain Reasoning","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Trust management (information system); Computer network; Wireless ad hoc network; Mobile ad hoc network; Network packet; Node (physics); Trust anchor; Routing protocol; Overhead (engineering); Scheme (mathematics); Network topology; Computer security; Wireless; Computational trust; Mathematics; Engineering","authors":[{"name":"Zhexiong Wei","is_ca":true},{"name":"Helen Tang","is_ca":true},{"name":"F. Richard Yu","is_ca":true},{"name":"Maoyu Wang","is_ca":true},{"name":"Peter Mason","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007771689284809232,"gpt":0.2370758330244207,"spread":0.2293041437396115,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002446272,0.0007139654,0.0007372055,0.000636901,0.0009649163,0.00120849,0.00125019,0.000906314,0.0007048404],"category_scores_gemma":[0.007260269,0.0002845597,0.0009075315,0.0006428209,0.001029246,0.003931127,0.002464272,0.001372988,0.0002029732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009234067,"about_ca_system_score_gemma":0.0009243856,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001433742,"about_ca_topic_score_gemma":0.001252471,"domain_scores_codex":[0.9977713,0.0007211494,0.0002311524,0.0002767036,0.0007925993,0.0002071325],"domain_scores_gemma":[0.9967391,0.001301594,0.0005557744,0.0006668304,0.0005834336,0.0001533025],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008885157,0.0002785142,0.004730438,0.0005226731,0.0003125193,0.001316739,0.00157116,0.4388237,0.03731709,0.1596801,0.004005905,0.3505528],"study_design_scores_gemma":[0.00003751993,0.0001701851,0.0003815514,0.00002408934,0.0000920202,0.0002553013,0.0001132383,0.9610264,0.004770723,0.0304775,0.002616977,0.00003455839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04325351,0.00122425,0.9518071,0.0005842765,0.0001180731,0.0001093696,0.00003843198,0.0002654251,0.002599635],"genre_scores_gemma":[0.9044329,0.0006872439,0.09367264,0.0001227779,0.00009840931,0.00007308773,0.0000686093,0.00001475556,0.0008295035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002446272,"threshold_uncertainty_score":0.01293731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3015911510","doi":"10.1023/a:1023447105713","title":"Connectivity Based k-Hop Clustering in Wireless Networks","year":2003,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":176,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Cluster analysis; Wireless ad hoc network; Mobile ad hoc network; Cluster (spacecraft); Algorithm; Theoretical computer science; Topology (electrical circuits); Computer network; Artificial intelligence; Mathematics; Combinatorics; Wireless","authors":[{"name":"Fabián García Nocetti","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02231112957223328,"gpt":0.2512801826526452,"spread":0.228969053080412,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001017321,0.0004827453,0.0009312494,0.001694577,0.001324059,0.001161991,0.00206008,0.001513164,0.001576174],"category_scores_gemma":[0.006526474,0.0005806565,0.0004085838,0.002767631,0.001181275,0.002617397,0.001178301,0.0007341942,0.0004818777],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00107225,"about_ca_system_score_gemma":0.000687744,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003562804,"about_ca_topic_score_gemma":0.003719443,"domain_scores_codex":[0.9990739,0.0003206156,0.00005495144,0.0001932712,0.0002672637,0.00009006188],"domain_scores_gemma":[0.9963523,0.002172092,0.0003918562,0.0004082745,0.00052954,0.0001460095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003484398,0.00008768421,0.001674243,0.000262965,0.00007280627,0.00009376842,0.0002431219,0.8559415,0.004891398,0.03769229,0.003386333,0.09530537],"study_design_scores_gemma":[0.00002564286,0.00007066555,0.0007104486,0.00001644188,0.00002683057,0.0001338906,0.000069053,0.9622648,0.00151948,0.03356959,0.001570185,0.00002300638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07505951,0.001499265,0.918866,0.0004269255,0.0001410926,0.0000968634,0.0001470947,0.0006621979,0.003101046],"genre_scores_gemma":[0.8168209,0.001482844,0.1760127,0.0001111068,0.0001585602,0.0001383897,0.0003961017,0.000138859,0.004740683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003562804,"threshold_uncertainty_score":0.007779717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2121480725","doi":"10.1109/lcn.2001.990775","title":"A scalable location management scheme in mobile ad-hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":165,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Server; Geographic routing; Wireless ad hoc network; Node (physics); Scalability; Mobile ad hoc network; Overhead (engineering); Distributed computing; Stateless protocol; Routing (electronic design automation); Routing protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Wireless; Database","authors":[{"name":"Yuan Xue","is_ca":false},{"name":"Baochun Li","is_ca":true},{"name":"Klara Nahrstedt","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01163512742696489,"gpt":0.2171675016796328,"spread":0.2055323742526679,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001652475,0.0005251804,0.0005862416,0.0008956745,0.001102823,0.0008660834,0.001604129,0.001096336,0.001250875],"category_scores_gemma":[0.003724744,0.0002635392,0.0003161914,0.001678924,0.001126107,0.003015064,0.00275041,0.0008480788,0.0007510548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006399753,"about_ca_system_score_gemma":0.0006532752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005939909,"about_ca_topic_score_gemma":0.0005738151,"domain_scores_codex":[0.9985876,0.000405224,0.0001107542,0.0001485981,0.0006494637,0.00009836422],"domain_scores_gemma":[0.9986319,0.0003160964,0.000179699,0.0004921705,0.0002611919,0.0001190224],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0004245611,0.0001648443,0.0009203691,0.0004470443,0.00008108386,0.0007490437,0.0006007169,0.1269852,0.06198708,0.2745411,0.01521717,0.5178818],"study_design_scores_gemma":[0.0002314166,0.0008527892,0.0006462295,0.00007540821,0.0001018413,0.001061672,0.0001552579,0.7964559,0.01760878,0.0988115,0.08386139,0.0001378569],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01755072,0.001638282,0.9735985,0.0005645081,0.0002933749,0.0002565163,0.00007770253,0.001523493,0.004497039],"genre_scores_gemma":[0.508302,0.001401733,0.482041,0.0003240407,0.0005107704,0.0006302276,0.0003635617,0.00007782994,0.006348847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001652475,"threshold_uncertainty_score":0.008739233,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161060874","doi":"10.1109/jsac.2012.120207","title":"CORMAN: A Novel Cooperative Opportunistic Routing Scheme in Mobile Ad Hoc Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Routing protocol; Node (physics); Network packet; Optimized Link State Routing Protocol; Distributed computing; Broadcasting (networking); Wireless; Telecommunications","authors":[{"name":"Zehua Wang","is_ca":true},{"name":"Yuanzhu Chen","is_ca":true},{"name":"Cheng Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04973911950863975,"gpt":0.3067954244716767,"spread":0.257056304963037,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001306586,0.000689533,0.0007487961,0.0008983138,0.001074913,0.0008238449,0.002327592,0.0007942682,0.0008754227],"category_scores_gemma":[0.002353414,0.0002362784,0.0004014259,0.001064594,0.0007709144,0.001454174,0.001981343,0.0007635076,0.0002648437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007734022,"about_ca_system_score_gemma":0.001927548,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004165469,"about_ca_topic_score_gemma":0.006725231,"domain_scores_codex":[0.9990922,0.0002611471,0.0000522805,0.0001273952,0.0003258749,0.0001411248],"domain_scores_gemma":[0.9988294,0.0003396129,0.0001879947,0.0002749793,0.0002651291,0.0001028573],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007457415,0.0004328088,0.002514752,0.0006466352,0.0002172996,0.001377515,0.001045045,0.1963176,0.05345989,0.09745849,0.02059853,0.6251857],"study_design_scores_gemma":[0.0001596773,0.0005212717,0.0005743904,0.00005720886,0.00008435616,0.00105519,0.00019987,0.9205274,0.01072175,0.02113657,0.04486874,0.00009359959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05967961,0.002657718,0.9171239,0.0008140499,0.0005577723,0.0008435213,0.000198733,0.003578511,0.0145461],"genre_scores_gemma":[0.7107566,0.001152379,0.2772413,0.0005990766,0.0001478278,0.0005287586,0.0003551677,0.0001267064,0.009092162],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004165469,"threshold_uncertainty_score":0.008282423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108267575","doi":"10.1109/infcom.2002.1019357","title":"Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Vehicular ad hoc network; Ad hoc wireless distribution service; Mobile computing; Optimized Link State Routing Protocol; Telecommunications; Wireless","authors":[{"name":"K.H. Wang","is_ca":true},{"name":"Baochun Li","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.007238727407722001,"gpt":0.2117793403203357,"spread":0.2045406129126137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912379,0.0007729811,0.00107672,0.0008686429,0.0009077265,0.001003675,0.001366343,0.0008090013,0.0005656921],"category_scores_gemma":[0.006363989,0.0004227913,0.0003185418,0.001113353,0.00119209,0.001866372,0.001746975,0.0005386167,0.0003178929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007536807,"about_ca_system_score_gemma":0.0005663529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002500602,"about_ca_topic_score_gemma":0.001974595,"domain_scores_codex":[0.9987669,0.0004511841,0.00005135795,0.0001621397,0.0003370036,0.0002314897],"domain_scores_gemma":[0.9974026,0.001389498,0.0003363753,0.0004282084,0.0002537421,0.0001895588],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005708762,0.00005694893,0.001516389,0.0001120909,0.00005302618,0.0002273647,0.0005229547,0.8820038,0.01310758,0.01451744,0.001682669,0.08562877],"study_design_scores_gemma":[0.00003352935,0.0001129568,0.0003537191,0.00001073705,0.00001789365,0.0001676415,0.00009090653,0.9813897,0.002809452,0.01365136,0.001350494,0.00001156074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1516576,0.001231897,0.843814,0.0002146435,0.00003309393,0.00008443064,0.00008453168,0.0009732009,0.001906636],"genre_scores_gemma":[0.9371552,0.0003471257,0.06147816,0.00004599964,0.00003867837,0.00007385166,0.0001285496,0.00007966573,0.0006528388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002500602,"threshold_uncertainty_score":0.005468428,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032510935","doi":"10.1016/j.comnet.2007.11.016","title":"Research on multicast routing protocols for mobile ad-hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer network; Computer science; Protocol Independent Multicast; Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; Xcast; Source-specific multicast","authors":[{"name":"Junhai Luo","is_ca":true},{"name":"Xue Liu","is_ca":true},{"name":"Danxia Ye","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0670637926794713,"gpt":0.3811164180693922,"spread":0.314052625389921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004209133,0.0012516,0.001509334,0.002902861,0.001689746,0.003918503,0.003221422,0.002515246,0.005241325],"category_scores_gemma":[0.01376283,0.001009409,0.0008225862,0.005387804,0.001786014,0.01418634,0.001459329,0.003957222,0.0016059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00249942,"about_ca_system_score_gemma":0.001803102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001207862,"about_ca_topic_score_gemma":0.0009169761,"domain_scores_codex":[0.9970165,0.0007792155,0.0001876819,0.0005060209,0.001247758,0.0002628046],"domain_scores_gemma":[0.985899,0.009371846,0.0004191153,0.001300698,0.002750534,0.000258856],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002071214,0.0003370277,0.001189665,0.002593377,0.0001474757,0.0001798395,0.0005805509,0.02995694,0.01393459,0.3968365,0.01384121,0.5401956],"study_design_scores_gemma":[0.0001321677,0.0007857521,0.001105272,0.001626632,0.0003949273,0.001556064,0.0009037829,0.2371096,0.03628891,0.4484027,0.2715588,0.000135489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0284526,0.2437412,0.6465749,0.01042102,0.003329302,0.0003709107,0.0001910031,0.0006850916,0.06623409],"genre_scores_gemma":[0.3112717,0.324534,0.3202207,0.003279877,0.00822264,0.0006246903,0.001039264,0.0004496811,0.03035747],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005241325,"threshold_uncertainty_score":0.02226025,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104354412","doi":"10.1109/tnet.2008.2005219","title":"Delay Aware Link Scheduling for Multi-Hop TDMA Wireless Networks","year":2008,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":161,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Time division multiple access; Computer network; Scheduling (production processes); Router; Transmission delay; Wireless network; Distributed computing; Wireless; Mathematical optimization; Network packet; Mathematics","authors":[{"name":"Petar Djukic","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05488659881913505,"gpt":0.2781040589740816,"spread":0.2232174601549466,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007439148,0.0004858928,0.0003558865,0.0005642314,0.000593354,0.0007368518,0.0008612124,0.0003597812,0.002017966],"category_scores_gemma":[0.002531227,0.0002911812,0.0003055487,0.0009226428,0.0003520829,0.0007647499,0.0004402154,0.0006978745,0.0004020538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001188742,"about_ca_system_score_gemma":0.001570611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002572084,"about_ca_topic_score_gemma":0.003699998,"domain_scores_codex":[0.9996124,0.0001243243,0.00002550135,0.00005409336,0.0001530185,0.00003070218],"domain_scores_gemma":[0.9993418,0.0003925544,0.00006629863,0.0000781241,0.00009356144,0.00002768811],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001780628,0.00009572225,0.0006967951,0.0003894954,0.00004979074,0.00008977998,0.0001292016,0.573741,0.01267065,0.06343639,0.004293219,0.3442299],"study_design_scores_gemma":[0.00003764864,0.00009290433,0.0002051683,0.00002451732,0.00001854012,0.00005655147,0.00002917104,0.9546719,0.004191556,0.02975512,0.01090337,0.00001350168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0100238,0.001944799,0.9834104,0.0001854981,0.0001602755,0.0001133947,0.00009710673,0.0004261321,0.003638634],"genre_scores_gemma":[0.295294,0.002807876,0.6968279,0.0001005345,0.0001722287,0.0002866166,0.0003447497,0.0001602376,0.004005766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002572084,"threshold_uncertainty_score":0.008624971,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2069239201","doi":"10.1007/s446-002-8028-1","title":"Deterministic broadcasting in ad hoc radio networks","year":2002,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"Division of Electrical, Communications and Cyber Systems","keywords":"Broadcasting (networking); Computer science; Computer network; Node (physics); Wireless ad hoc network; Acknowledgement; Collision; Network topology; Block (permutation group theory); Collision detection; Mobile ad hoc network; Unicast; Distributed computing; Topology (electrical circuits); Theoretical computer science; Telecommunications; Mathematics; Computer security; Wireless; Network packet","authors":[{"name":"Bogdan S. Chlebus","is_ca":false},{"name":"Leszek Gąsieniec","is_ca":false},{"name":"Alan Gibbons","is_ca":false},{"name":"Andrzej Pelc","is_ca":true},{"name":"Wojciech Rytter","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01824020398321956,"gpt":0.2265913010055592,"spread":0.2083510970223397,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002569336,0.000594406,0.001780994,0.001061911,0.001591034,0.002210427,0.00212552,0.001711579,0.001870973],"category_scores_gemma":[0.01968859,0.001245275,0.0005152824,0.001982166,0.002649199,0.003294042,0.00169479,0.001598367,0.0004500304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002490814,"about_ca_system_score_gemma":0.001797128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003648922,"about_ca_topic_score_gemma":0.003426608,"domain_scores_codex":[0.9971926,0.001025951,0.0001525155,0.0004015309,0.0008734586,0.0003539222],"domain_scores_gemma":[0.980602,0.01534768,0.001077046,0.001497605,0.001048799,0.0004267957],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003637569,0.00007463469,0.001394995,0.0005847492,0.00007085381,0.0001591049,0.0003839695,0.5423565,0.002952815,0.3847028,0.005564239,0.0613917],"study_design_scores_gemma":[0.00008359343,0.00006195765,0.0003334538,0.00003117905,0.00005483661,0.0001184784,0.00006398417,0.7262622,0.001093932,0.2663286,0.005541548,0.00002630592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03702918,0.004340146,0.9492983,0.001181133,0.0002370564,0.00007719439,0.0001480405,0.0006353972,0.007053666],"genre_scores_gemma":[0.8920283,0.004980634,0.09097169,0.0003132312,0.0004948259,0.000280477,0.0003043051,0.0002020048,0.0104245],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003648922,"threshold_uncertainty_score":0.01807225,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2667052534","doi":"10.1007/s00446-005-0126-7","title":"Broadcasting in undirected ad hoc radio networks","year":2005,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Binary logarithm; Upper and lower bounds; Radio networks; Omega; Combinatorics; Logarithm; RADIUS; Log-log plot; Node (physics); Mathematics; Discrete mathematics; Computer science; Topology (electrical circuits); Computer network; Telecommunications; Physics; Wireless network","authors":[{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01055025266061116,"gpt":0.2309611542078272,"spread":0.2204109015472161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001021264,0.0005240059,0.001247619,0.001433984,0.00119874,0.002002414,0.001707054,0.0013519,0.002136397],"category_scores_gemma":[0.009951831,0.000762044,0.0004596879,0.002447343,0.00152631,0.002556138,0.001045862,0.001243541,0.0005169011],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212949,"about_ca_system_score_gemma":0.0007740419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004331235,"about_ca_topic_score_gemma":0.003649353,"domain_scores_codex":[0.9989497,0.0003885249,0.00006174485,0.0001898405,0.0002726496,0.0001375736],"domain_scores_gemma":[0.989162,0.008448905,0.000875144,0.0004304357,0.0007041939,0.0003793049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000269931,0.0001258372,0.002050736,0.0008489103,0.00009992611,0.000595022,0.0007934227,0.4100861,0.006782664,0.4729134,0.009070623,0.09636345],"study_design_scores_gemma":[0.00007407401,0.00005148176,0.0005557881,0.00004392861,0.00008612032,0.0002420537,0.0001411788,0.6189094,0.001215925,0.371038,0.007611537,0.00003062018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09794622,0.003716506,0.8803899,0.001410035,0.0002702641,0.000119647,0.000341933,0.0006799547,0.01512559],"genre_scores_gemma":[0.866259,0.00754515,0.1019293,0.0003941651,0.0006923603,0.0002718143,0.0008572193,0.000282692,0.02176819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004331235,"threshold_uncertainty_score":0.008800626,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1599674946","doi":"10.1023/a:1013985610753","title":"Internal Node and Shortcut Based Routing with Guaranteed Delivery in Wireless Networks","year":2002,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Greedy algorithm; Node (physics); Hop (telecommunications); Packet forwarding; Computer network; Algorithm; Network packet; Geographic routing; Communication source; Routing protocol; Static routing","authors":[{"name":"Susanta Datta","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true},{"name":"Jie Wu","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01072992971202405,"gpt":0.2009819713228837,"spread":0.1902520416108597,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002224399,0.0007975016,0.00137731,0.001161073,0.0009232782,0.001745828,0.002560079,0.001159055,0.002369242],"category_scores_gemma":[0.00702417,0.0006898495,0.0006032041,0.001421542,0.001316986,0.002706205,0.001670051,0.001471946,0.0004692473],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001228709,"about_ca_system_score_gemma":0.001005991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00219205,"about_ca_topic_score_gemma":0.00239649,"domain_scores_codex":[0.9989002,0.0003635222,0.00004900465,0.0001456027,0.0004058007,0.0001358591],"domain_scores_gemma":[0.9970083,0.001731525,0.0002760888,0.0003642769,0.0004106621,0.0002092266],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001140928,0.0002176014,0.001304951,0.0004994331,0.0001416135,0.0002771984,0.0006242962,0.4532919,0.0114628,0.2975605,0.01222944,0.2212494],"study_design_scores_gemma":[0.00006467141,0.0002085476,0.0002569893,0.00002374176,0.00006874231,0.0001392588,0.00005623076,0.920462,0.002296932,0.07332273,0.003074917,0.0000252265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04357113,0.001380177,0.9496698,0.000454414,0.000270955,0.00008549036,0.00006988908,0.0007174395,0.003780763],"genre_scores_gemma":[0.6819173,0.001868307,0.3020746,0.0002379326,0.0004198437,0.0002195139,0.0002888229,0.0004792104,0.01249444],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002560079,"threshold_uncertainty_score":0.01176387,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037785008","doi":"10.1155/2010/418934","title":"On the Complexity of Scheduling in Wireless Networks","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":139,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Army Research Office; Multidisciplinary University Research Initiative; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Wireless network; Time complexity; Distributed computing; Wireless; Approximation algorithm; Computational complexity theory; Greedy algorithm; Mathematical optimization; Computer network; Algorithm; Mathematics","authors":[{"name":"Changhee Joo","is_ca":false},{"name":"Gaurav Sharma","is_ca":false},{"name":"Ness B. Shroff","is_ca":false},{"name":"Ravi R. Mazumdar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05349021118341814,"gpt":0.2816610418362372,"spread":0.2281708306528191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004350533,0.001601599,0.00226341,0.001270671,0.001849137,0.003980702,0.002277908,0.00235288,0.004914305],"category_scores_gemma":[0.02901855,0.001083794,0.001248922,0.002817758,0.003081617,0.008793145,0.002799864,0.003762246,0.0005971048],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00446467,"about_ca_system_score_gemma":0.002705963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005820688,"about_ca_topic_score_gemma":0.004105328,"domain_scores_codex":[0.9956215,0.002026392,0.0002050498,0.0005139191,0.001029408,0.0006036816],"domain_scores_gemma":[0.960448,0.03573767,0.001275517,0.001224343,0.0007875006,0.0005271409],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003428106,0.000103092,0.001250306,0.0003468122,0.00009633877,0.000172521,0.0002165721,0.8214918,0.001027799,0.1377975,0.007298757,0.02985569],"study_design_scores_gemma":[0.00004114783,0.00002076249,0.0002265471,0.00002409801,0.0000164563,0.00004358021,0.00005750959,0.8160857,0.000213335,0.1817888,0.001469587,0.00001242114],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1495735,0.008675968,0.7863113,0.01905191,0.000804313,0.0003742758,0.001434557,0.0009107232,0.03286345],"genre_scores_gemma":[0.8115556,0.008348539,0.1669,0.001240572,0.001305402,0.000723624,0.001311034,0.0005225873,0.008092748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005820688,"threshold_uncertainty_score":0.03239363,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965878030","doi":"10.1145/2635675","title":"Opportunistic Routing in Wireless Networks: Models, Algorithms, and Classifications","year":2014,"lang":"en","type":"review","venue":"ACM Computing Surveys","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":134,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Network packet; Relay; Forwarder; Wireless network; Wireless; Node (physics); Geographic routing; Packet forwarding; Routing (electronic design automation); Set (abstract data type); Distributed computing; Routing protocol; Dynamic Source Routing; Telecommunications","authors":[{"name":"Azzedine Boukerche","is_ca":true},{"name":"Amir Darehshoorzadeh","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09991202871269256,"gpt":0.3247099436215215,"spread":0.2247979149088289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001738685,0.001444476,0.001470097,0.0030855,0.0006984787,0.002984371,0.002431378,0.002025209,0.003007787],"category_scores_gemma":[0.003681422,0.0005629028,0.0008354919,0.006380913,0.001560666,0.005352382,0.001198799,0.002043579,0.001446503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001784669,"about_ca_system_score_gemma":0.001547725,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002039847,"about_ca_topic_score_gemma":0.001435825,"domain_scores_codex":[0.9989467,0.0002863494,0.00008525396,0.0001496909,0.0004311839,0.0001008192],"domain_scores_gemma":[0.9980736,0.00123442,0.0001669001,0.0001355092,0.0003350352,0.00005447056],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004268007,0.0001300161,0.001159777,0.003568247,0.00007136504,0.0002103274,0.0002564306,0.02327733,0.0005240422,0.3831519,0.04090711,0.5467008],"study_design_scores_gemma":[0.00002916548,0.0001207629,0.001209483,0.003333174,0.0001213024,0.001643133,0.0004952051,0.04874328,0.0005660893,0.4081327,0.5355042,0.000101676],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.004138109,0.7879744,0.1515667,0.005823788,0.002511396,0.0003953089,0.0003531614,0.0002999412,0.04693728],"genre_scores_gemma":[0.04365053,0.8852167,0.05617305,0.0009216156,0.003278401,0.0004680879,0.0004993174,0.00006431955,0.009728017],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.0030855,"threshold_uncertainty_score":0.01294875,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114470741","doi":"10.1109/surv.2011.041311.00099","title":"A Survey On MAC Protocols for Wireless Adhoc Networks with Beamforming Antennas","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Beamforming; Wireless; Wireless network; Mobile ad hoc network; Vehicular ad hoc network; Multiple Access with Collision Avoidance for Wireless; Transmission (telecommunications); Telecommunications; Network packet","authors":[{"name":"Osama Bazan","is_ca":true},{"name":"Muhammad Jaseemuddin","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.125124470151401,"gpt":0.325821351399581,"spread":0.20069688124818,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368328,0.002119575,0.001841536,0.003330902,0.001169926,0.003138563,0.003077193,0.002632024,0.004975952],"category_scores_gemma":[0.006580114,0.00132424,0.001098887,0.006770171,0.001019212,0.005604554,0.001673204,0.003794571,0.004354182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001261155,"about_ca_system_score_gemma":0.001438146,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001144585,"about_ca_topic_score_gemma":0.0007553581,"domain_scores_codex":[0.9968918,0.0007693936,0.0004984104,0.0003129283,0.001320639,0.000206885],"domain_scores_gemma":[0.9963751,0.002111653,0.0002274111,0.0003335114,0.0008793494,0.00007287876],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001079643,0.0002025745,0.0006591774,0.005142592,0.0001121987,0.0003168353,0.0003970235,0.01110265,0.005520846,0.08646852,0.0462282,0.8437415],"study_design_scores_gemma":[0.00003916792,0.0003195755,0.0008157074,0.002779235,0.0001668994,0.001992976,0.0002308259,0.03585403,0.00434782,0.05960582,0.8937098,0.0001381584],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.003064838,0.48092,0.4733367,0.002746332,0.003119799,0.0006687851,0.0003336546,0.00122586,0.03458403],"genre_scores_gemma":[0.0371786,0.6495038,0.2808904,0.003700768,0.005379063,0.002120767,0.001187116,0.0004656352,0.01957382],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004975952,"threshold_uncertainty_score":0.01664621,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979634439","doi":"10.1145/2069131.2069135","title":"A novel multi-hop clustering scheme for vehicular ad-hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Vehicular ad hoc network; Wireless ad hoc network; Computer science; Cluster analysis; Computer network; Mobility model; Wireless; Mobile ad hoc network; Intelligent transportation system; Hop (telecommunications); Distributed computing; Scheme (mathematics); Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Telecommunications; Engineering; Artificial intelligence","authors":[{"name":"Zhenxia Zhang","is_ca":true},{"name":"Azzedine Boukerche","is_ca":true},{"name":"Richard W. Pazzi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04842265875544571,"gpt":0.252965318839409,"spread":0.2045426600839633,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005472846,0.0007022738,0.0007290408,0.00124394,0.00125925,0.0006681656,0.002442481,0.001073528,0.001241036],"category_scores_gemma":[0.001152334,0.0002413952,0.0006254543,0.002070678,0.0003685856,0.00154413,0.0009859308,0.0008801495,0.001147523],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001011572,"about_ca_system_score_gemma":0.0009961126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003149781,"about_ca_topic_score_gemma":0.004979389,"domain_scores_codex":[0.9992567,0.0001344213,0.00006296501,0.0001398222,0.0003378346,0.0000682294],"domain_scores_gemma":[0.9993595,0.00006290774,0.00004910261,0.0001441653,0.000335109,0.00004914262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003483345,0.0001825083,0.0007639374,0.0004571608,0.0001591908,0.0004087546,0.0003741746,0.1805322,0.07567187,0.0571771,0.01932422,0.6646006],"study_design_scores_gemma":[0.00009584999,0.0003368862,0.0006472238,0.00004335586,0.00007756486,0.0009824835,0.0001055207,0.8765997,0.02910888,0.01394047,0.07791159,0.0001505211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008080977,0.0009421257,0.9848825,0.0002181702,0.0003910329,0.0003017026,0.0001348377,0.0009863829,0.004062239],"genre_scores_gemma":[0.2194699,0.001428464,0.7663109,0.0002377687,0.0001770383,0.0004791557,0.0008128295,0.0001393233,0.01094472],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003149781,"threshold_uncertainty_score":0.007339478,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051011315","doi":"10.1007/s11042-006-0012-8","title":"Routing protocols in wireless mesh networks: challenges and design considerations","year":2006,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Routing (electronic design automation); Distributed computing; Routing protocol; Wireless ad hoc network; Wireless network; Wireless; Telecommunications","authors":[{"name":"Sonia Waharte","is_ca":true},{"name":"Raouf Boutaba","is_ca":true},{"name":"Youssef Iraqi","is_ca":true},{"name":"Brent Ishibashi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04687829276456813,"gpt":0.2723054268626269,"spread":0.2254271340980588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008841403,0.001030431,0.001630768,0.001049359,0.001283066,0.006417987,0.003847645,0.00394208,0.002662218],"category_scores_gemma":[0.01348112,0.001235086,0.0004722223,0.001833247,0.003077922,0.01659913,0.001912136,0.004042648,0.001241214],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001453766,"about_ca_system_score_gemma":0.001475806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007778988,"about_ca_topic_score_gemma":0.001292133,"domain_scores_codex":[0.9968821,0.001262686,0.0002541753,0.0002578551,0.00116964,0.0001735611],"domain_scores_gemma":[0.989951,0.006871211,0.0005168513,0.0007122488,0.001734482,0.0002141847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001386031,0.00019488,0.0007298273,0.0018471,0.00007361619,0.0002627838,0.0004441009,0.04933117,0.005383712,0.6601872,0.01403392,0.2673731],"study_design_scores_gemma":[0.00006193382,0.0003077587,0.0004067734,0.0006428198,0.0001045196,0.001092659,0.00085773,0.2368832,0.00395841,0.6586035,0.09696276,0.0001179337],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01358112,0.1363876,0.7667839,0.0470704,0.00227313,0.0002395549,0.000110611,0.0004607922,0.03309289],"genre_scores_gemma":[0.3414327,0.1904972,0.4367411,0.003244378,0.01024902,0.00086009,0.0002403412,0.0003144304,0.01642081],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008841403,"threshold_uncertainty_score":0.04675841,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089637452","doi":"10.1109/access.2020.3027043","title":"Multipath Routing Protocol Using Genetic Algorithm in Mobile Ad Hoc Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Multipath propagation; Wireless ad hoc network; Mobile ad hoc network; Routing protocol; Multipath routing; Ad hoc wireless distribution service; Dynamic Source Routing; Zone Routing Protocol; Algorithm; Routing (electronic design automation); Wireless; Telecommunications","authors":[{"name":"Antra Bhardwaj","is_ca":true},{"name":"Hosam El‐Ocla","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04267789685971997,"gpt":0.3229416968855046,"spread":0.2802638000257846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000462612,0.0005022295,0.0005955378,0.0007725094,0.0004562859,0.0008069067,0.0009486285,0.0007509402,0.0008215479],"category_scores_gemma":[0.001219059,0.0001967379,0.0005066355,0.001308148,0.0005369137,0.000798666,0.0006268881,0.0008397111,0.0003522829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005900195,"about_ca_system_score_gemma":0.0009425792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002228319,"about_ca_topic_score_gemma":0.00153129,"domain_scores_codex":[0.9995762,0.000152061,0.00002478713,0.00005728914,0.0001573915,0.0000322927],"domain_scores_gemma":[0.9997541,0.0001105873,0.00003169786,0.00002589207,0.00006497723,0.00001269322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007185393,0.0001154435,0.00124994,0.0002799367,0.0001414458,0.0003498641,0.0002008558,0.5163416,0.01082006,0.08071755,0.005088612,0.3846228],"study_design_scores_gemma":[0.00005497485,0.0002006791,0.0005112181,0.00007585336,0.00006294309,0.000470766,0.00005372185,0.9224117,0.00437871,0.03963166,0.03208267,0.00006499576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007581498,0.00211176,0.9819886,0.0002888391,0.000168366,0.0001620684,0.00004268662,0.0009823997,0.00667366],"genre_scores_gemma":[0.2304231,0.003324848,0.7577525,0.0002037073,0.0001414472,0.0006426568,0.0002364096,0.0001067524,0.007168494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002228319,"threshold_uncertainty_score":0.004430711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074320386","doi":"10.1145/1102219.1102226","title":"AnonDSR","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Anonymity; Scalability; Computer network; Routing protocol; Computer security; Protocol (science); Wireless ad hoc network; Mobile ad hoc network; Routing (electronic design automation); Security analysis; Telecommunications; Wireless","authors":[{"name":"Ronggong Song","is_ca":true},{"name":"Larry Korba","is_ca":true},{"name":"George Yee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.00874489416949657,"gpt":0.2228419071766989,"spread":0.2140970130072023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001694481,0.0006109224,0.0003976007,0.001424539,0.001194075,0.002123533,0.001296764,0.00109725,0.1420345],"category_scores_gemma":[0.003003992,0.0002352354,0.0004869658,0.0009162984,0.0004380884,0.00192105,0.001851875,0.0009570299,0.07374258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001018619,"about_ca_system_score_gemma":0.001568835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001608259,"about_ca_topic_score_gemma":0.002040174,"domain_scores_codex":[0.998075,0.0004111319,0.0001427509,0.0002436604,0.0009777123,0.0001497814],"domain_scores_gemma":[0.9966152,0.0003789581,0.000179823,0.0008279827,0.001718646,0.000279373],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000377126,0.0002104435,0.001842253,0.0003985192,0.00004033704,0.0005971298,0.0002321879,0.002240988,0.01978805,0.1060743,0.3531128,0.5150859],"study_design_scores_gemma":[0.00004431956,0.0001212037,0.0008600663,0.0000689036,0.00002013349,0.0007216819,0.0001117034,0.006248844,0.006235397,0.01022782,0.9753082,0.00003176093],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.01307888,0.001680097,0.1390982,0.005093904,0.003788176,0.0006427631,0.003547081,0.01004443,0.8230264],"genre_scores_gemma":[0.1242172,0.002676319,0.09437491,0.002844358,0.001580542,0.0006312928,0.0115361,0.0016892,0.7604501],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.1420345,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1984044090","doi":"10.1109/mcom.2005.1522133","title":"QoS routing for wireless ad hoc networks: problems, algorithms, and protocols","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Adaptive quality of service multi-hop routing; Distributed computing; Ad hoc wireless distribution service; Dynamic Source Routing; Wireless ad hoc network; Routing protocol; Quality of service; Optimized Link State Routing Protocol; Link-state routing protocol; Zone Routing Protocol; Routing (electronic design automation); Wireless; Telecommunications","authors":[{"name":"Baoxian Zhang","is_ca":true},{"name":"Hussein T. Mouftah","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0414720452036481,"gpt":0.3074359233300997,"spread":0.2659638781264516,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238605,0.001817039,0.00149904,0.001594374,0.00125716,0.003873315,0.002230413,0.00297515,0.002699993],"category_scores_gemma":[0.005151555,0.0007058423,0.0006112113,0.005055228,0.002120973,0.005788833,0.001306468,0.002737582,0.001497185],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412114,"about_ca_system_score_gemma":0.001382896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001764364,"about_ca_topic_score_gemma":0.001456526,"domain_scores_codex":[0.9981982,0.0007391733,0.0001506911,0.0001591581,0.0006725206,0.00008027197],"domain_scores_gemma":[0.9975495,0.001697222,0.0001408303,0.000168297,0.0003877033,0.00005648621],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000483367,0.00008652968,0.0005650252,0.002139076,0.00008443079,0.0001952962,0.0003483254,0.05699544,0.001662169,0.2765199,0.03445375,0.6269018],"study_design_scores_gemma":[0.00003909037,0.0001024606,0.0003647477,0.0007578557,0.00006286731,0.0006221146,0.0004554486,0.2293776,0.001549544,0.5359694,0.2306244,0.00007445641],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003028933,0.1725686,0.8004511,0.00707922,0.002205244,0.0003066482,0.0001588529,0.0005785608,0.01362284],"genre_scores_gemma":[0.07689177,0.2697993,0.6339905,0.001256106,0.006158362,0.0007950985,0.0005571599,0.0002668627,0.01028496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003873315,"threshold_uncertainty_score":0.01712757,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2147807910","doi":"10.1109/twc.2007.060312","title":"Joint logical topology design, interface assignment, channel allocation, and routing for multi-channel wireless mesh networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Router; Channel (broadcasting); Topology (electrical circuits); Routing (electronic design automation); Wireless mesh network; Network topology; Logical topology; Network packet; Interface (matter); Routing table; Wireless network; Wireless; Routing protocol; Distributed computing; Mathematics; Telecommunications","authors":[{"name":"Amir-Hamed Mohsenian-Rad","is_ca":true},{"name":"Vincent W. S. Wong","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08069712228787203,"gpt":0.3087359352593773,"spread":0.2280388129715052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001582812,0.0004842736,0.0004784901,0.0005442454,0.0004411644,0.001135292,0.00130113,0.0006251283,0.001015768],"category_scores_gemma":[0.002421327,0.0003519741,0.0004787773,0.0006784833,0.0007440654,0.001780152,0.0009114493,0.0006338587,0.0001609459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211752,"about_ca_system_score_gemma":0.00155391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002047622,"about_ca_topic_score_gemma":0.003038483,"domain_scores_codex":[0.9989603,0.0004496152,0.00004261713,0.0001081131,0.0003345815,0.0001047039],"domain_scores_gemma":[0.99931,0.0003255896,0.0001087983,0.00007877962,0.000138993,0.00003786425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003948786,0.00003661805,0.0004471125,0.0001017008,0.00002328891,0.00005770165,0.00004710792,0.9228458,0.003716496,0.02879902,0.0008819373,0.04300357],"study_design_scores_gemma":[0.00000536062,0.00002372378,0.00005624703,0.000003322849,0.00000673791,0.00001920664,0.000009407571,0.9931362,0.0008120963,0.005212166,0.0007110322,0.00000446376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006794458,0.0002474387,0.9913083,0.0001098341,0.00002218846,0.00003415231,0.00001472414,0.0001034527,0.0013654],"genre_scores_gemma":[0.591588,0.0007311579,0.4051898,0.0001109456,0.00009061438,0.0002072977,0.0001091556,0.00007601871,0.001896965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002047622,"threshold_uncertainty_score":0.008791864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2943017603","doi":"10.1109/comst.2019.2907195","title":"Fundamentals of Mobility-Aware Performance Characterization of Cellular Networks: A Tutorial","year":2019,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Characterization (materials science); Computer science; Nanotechnology; Materials science","authors":[{"name":"Hina Tabassum","is_ca":true},{"name":"Mohammad Salehi","is_ca":true},{"name":"Ekram Hossain","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02429437019936401,"gpt":0.2541463816616782,"spread":0.2298520114623142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001123037,0.002609615,0.001411219,0.002704316,0.0004344002,0.002506071,0.001574949,0.001876076,0.00458724],"category_scores_gemma":[0.003082693,0.0007236208,0.001168144,0.003833092,0.0009979117,0.003713641,0.001082237,0.003193602,0.002693383],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001346658,"about_ca_system_score_gemma":0.0005627,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001816729,"about_ca_topic_score_gemma":0.0006332014,"domain_scores_codex":[0.9992014,0.0001905926,0.00008589945,0.0002025785,0.0002538858,0.00006581279],"domain_scores_gemma":[0.9988621,0.0007549775,0.00006768675,0.0001120937,0.0001796289,0.00002351852],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006587061,0.0002119209,0.001531733,0.002443727,0.0001388303,0.0005434849,0.000423049,0.1020057,0.007559878,0.4928882,0.04317365,0.3490139],"study_design_scores_gemma":[0.00001141117,0.0002261696,0.002089841,0.001012361,0.0001004051,0.001560883,0.0001753747,0.3154311,0.004122936,0.3936778,0.2814398,0.0001519539],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004303611,0.1429885,0.8024582,0.002097408,0.001277565,0.0001406342,0.0008724113,0.0006956651,0.04516596],"genre_scores_gemma":[0.152754,0.4402536,0.3687741,0.001856975,0.01010632,0.0009070385,0.002170445,0.0005333847,0.02264414],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00458724,"threshold_uncertainty_score":0.01534581,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1780992783","doi":"10.1007/978-0-387-35608-2_11","title":"Symmetric Connectivity with Minimum Power Consumption in Radio Networks","year":2002,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Wireless ad hoc network; Unicast; Computer science; Wireless network; Approximation algorithm; Shortest path problem; Topology (electrical circuits); Graph; Wireless; Network packet; Mathematical optimization; Mathematics; Algorithm; Computer network; Theoretical computer science; Combinatorics; Telecommunications","authors":[{"name":"Gruiă Cälinescu","is_ca":false},{"name":"Ion Măndoiu","is_ca":false},{"name":"Alex Zelikovsky","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01745053382231488,"gpt":0.2107557105450149,"spread":0.1933051767227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309325,0.0008019728,0.0005034289,0.0003985378,0.0002711533,0.0008447946,0.0008841197,0.0007304428,0.003276016],"category_scores_gemma":[0.001346437,0.0003442729,0.0003107527,0.00122711,0.0007407276,0.001971743,0.0005877572,0.0006428402,0.0007443428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004487611,"about_ca_system_score_gemma":0.0002445124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002633181,"about_ca_topic_score_gemma":0.0002461573,"domain_scores_codex":[0.999686,0.0001070321,0.00001039363,0.00006031059,0.0001064926,0.00002974757],"domain_scores_gemma":[0.9996792,0.0002102636,0.00003056657,0.00003994342,0.00002618742,0.0000138405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001092983,0.00006088679,0.0002788026,0.0004424211,0.00003276193,0.0002057053,0.0001873695,0.3526988,0.006041496,0.4418585,0.0114651,0.186619],"study_design_scores_gemma":[0.00004222492,0.0001488516,0.000272518,0.00004891617,0.00002346677,0.0004237144,0.00007448568,0.4363093,0.00278847,0.5299082,0.0299438,0.00001606089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03890123,0.003785281,0.9200512,0.0009430548,0.0001747138,0.0000656837,0.000111375,0.0004608616,0.03550662],"genre_scores_gemma":[0.6431066,0.009092066,0.3240751,0.000329169,0.0005148742,0.0002788164,0.0004042547,0.000290041,0.02190893],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003276016,"threshold_uncertainty_score":0.01095939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2152683746","doi":"10.1109/jsac.2005.845634","title":"Hop count optimal position-based packet routing algorithms for ad hoc wireless networks with a realistic physical Layer","year":2005,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Algorithm; Packet forwarding; Distance-vector routing protocol; Network packet; Dynamic Source Routing; Routing protocol; Wireless; Telecommunications","authors":[{"name":"Johnson Kuruvila","is_ca":true},{"name":"Amiya Nayak","is_ca":true},{"name":"Ivan Stojmenović","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02857341277290591,"gpt":0.2993540626651102,"spread":0.2707806498922042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527779,0.0007900203,0.0006617759,0.0007704951,0.0007018302,0.0006354756,0.001661271,0.000685201,0.0009023275],"category_scores_gemma":[0.002913628,0.0003742222,0.0002824024,0.001088264,0.0007327334,0.0015587,0.0009407166,0.0007190573,0.0002969387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238115,"about_ca_system_score_gemma":0.001152221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002484055,"about_ca_topic_score_gemma":0.003764757,"domain_scores_codex":[0.9994892,0.0001542358,0.00002871953,0.0000788957,0.0002059894,0.00004291163],"domain_scores_gemma":[0.9991497,0.0004473835,0.000128832,0.00007599911,0.0001698272,0.00002818099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009316368,0.00005565663,0.0007864135,0.00006488842,0.00003124684,0.00003467429,0.0001168313,0.8109393,0.002070236,0.02694912,0.001827355,0.1570313],"study_design_scores_gemma":[0.00001737007,0.00004578343,0.00009718787,0.000004408956,0.000004908555,0.00001947178,0.00002081292,0.9880314,0.0007098767,0.01029866,0.0007447336,0.000005414669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01318113,0.0002959657,0.9846647,0.0001199844,0.00002731541,0.00006949514,0.00002356906,0.000424179,0.001193641],"genre_scores_gemma":[0.2405404,0.000534404,0.7559516,0.0001189444,0.00004944378,0.0002673419,0.0001659765,0.0000744536,0.002297429],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002484055,"threshold_uncertainty_score":0.008983135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097324407","doi":"10.1109/icc.2007.196","title":"Enhanced Intrusion Detection System for Discovering Malicious Nodes in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Intrusion detection system; Wireless ad hoc network; Mobile ad hoc network; Node (physics); Network partition; Vehicular ad hoc network; Throughput; Routing protocol; Computer security; Routing (electronic design automation); Wireless; Network packet; Engineering; Telecommunications","authors":[{"name":"Nidal Nasser","is_ca":true},{"name":"Yi Chen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006723387109422721,"gpt":0.2325099173924055,"spread":0.2257865302829827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001070482,0.0005724238,0.0008308091,0.001281062,0.0004276533,0.0006538773,0.00101607,0.0007163419,0.0009226759],"category_scores_gemma":[0.002526095,0.0002623043,0.0002915551,0.0004404391,0.0003639691,0.001703741,0.0008948726,0.0007102212,0.0004043263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003198399,"about_ca_system_score_gemma":0.000443605,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00051403,"about_ca_topic_score_gemma":0.0005639709,"domain_scores_codex":[0.9991325,0.0002089343,0.0001015523,0.0001530194,0.0003291063,0.00007489266],"domain_scores_gemma":[0.9982343,0.0005882531,0.0001928666,0.0002599852,0.0006178265,0.0001066952],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001769056,0.0009071568,0.01548135,0.0004389729,0.0002872612,0.001505372,0.0006633117,0.02037849,0.2326883,0.005880381,0.009400425,0.7105999],"study_design_scores_gemma":[0.0003059311,0.001976755,0.008059023,0.00006352735,0.0004020008,0.003696879,0.0001061533,0.7563382,0.2017981,0.003051212,0.02407152,0.0001307415],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1659744,0.001326654,0.8017216,0.0003285928,0.0002801231,0.0004852129,0.0001486201,0.02637364,0.003361134],"genre_scores_gemma":[0.6986715,0.0005358383,0.2953753,0.0003901974,0.0001309057,0.0002453869,0.0003965376,0.0001388187,0.004115603],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001281062,"threshold_uncertainty_score":0.005661309,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129819894","doi":"10.1109/infcom.2007.12","title":"Link Scheduling for Minimum Delay in Spatial Re-Use TDMA","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":117,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Time division multiple access; Computer network; Scheduling (production processes); Transmission delay; Network packet; End-to-end delay; Heuristics; Quality of service; Wireless network; Wireless; Real-time computing; Distributed computing; Mathematical optimization; Mathematics","authors":[{"name":"Petar Djukic","is_ca":true},{"name":"Shahrokh Valaee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02432261264558317,"gpt":0.2716753881650107,"spread":0.2473527755194275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007891851,0.0005002174,0.0004124345,0.0005709053,0.0005396259,0.0006047339,0.000748275,0.0003240263,0.003361935],"category_scores_gemma":[0.002058072,0.0003230134,0.0002756704,0.000709596,0.0003745695,0.0006114956,0.0004680527,0.0003986575,0.0003783664],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009177807,"about_ca_system_score_gemma":0.001583065,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003302416,"about_ca_topic_score_gemma":0.005535836,"domain_scores_codex":[0.9995882,0.0001250132,0.00001771006,0.00006751255,0.0001207573,0.00008077113],"domain_scores_gemma":[0.9992687,0.0004145469,0.000119172,0.00005242285,0.0001051923,0.00004006411],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000215202,0.000139556,0.0009118376,0.0001875,0.00003810645,0.0001242814,0.0002152896,0.8203277,0.009454302,0.06051982,0.002924032,0.1049424],"study_design_scores_gemma":[0.00004517579,0.0001284004,0.0002869434,0.0000143057,0.00001745497,0.00006182424,0.00005174157,0.965166,0.005435987,0.02472143,0.004059493,0.00001120589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08047351,0.0004416073,0.9090618,0.0002143134,0.00004614921,0.0001830747,0.0001896487,0.0004966535,0.008893216],"genre_scores_gemma":[0.6643965,0.0003253066,0.3289457,0.00009903357,0.00002896897,0.000242353,0.0002572405,0.0001747937,0.005530082],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003361935,"threshold_uncertainty_score":0.0112468,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135495315","doi":"10.1109/infcom.2009.5061905","title":"Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Queuing delay; Computer network; Wireless mesh network; End-to-end principle; Channel (broadcasting); End-to-end delay; Queueing theory; Metric (unit); Wireless; Wireless network; Telecommunications; Engineering; Network packet","authors":[{"name":"H. Li","is_ca":false},{"name":"Yu Cheng","is_ca":false},{"name":"Chi Zhou","is_ca":false},{"name":"Weihua Zhuang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03262381685992377,"gpt":0.2713075768103567,"spread":0.2386837599504329,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001918487,0.001174746,0.0008893225,0.001180505,0.0003643,0.0008914974,0.001299516,0.0008398211,0.0004608674],"category_scores_gemma":[0.004806029,0.000229083,0.0004134501,0.001172866,0.000572027,0.00292317,0.0008728357,0.0006082153,0.0001112828],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001061071,"about_ca_system_score_gemma":0.0006044495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00036575,"about_ca_topic_score_gemma":0.0005067596,"domain_scores_codex":[0.9987533,0.0004927084,0.0001002601,0.0001536056,0.0004320054,0.00006819425],"domain_scores_gemma":[0.9979939,0.001088374,0.0004517499,0.0001341828,0.0002616359,0.00007012019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008104402,0.0000569888,0.001508845,0.0003330926,0.00009886321,0.00005697522,0.00008759271,0.860741,0.01703352,0.03048553,0.0007794711,0.08873709],"study_design_scores_gemma":[0.000007422825,0.000186527,0.0003727407,0.00001789651,0.000026606,0.000112575,0.00002555041,0.9829002,0.005131122,0.008844371,0.002354501,0.00002049351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01498531,0.001187019,0.9828414,0.0001115695,0.00004303242,0.00003415679,0.00003422667,0.00006312906,0.0007001634],"genre_scores_gemma":[0.5139667,0.001580167,0.4827287,0.00007613738,0.0001668698,0.0001737182,0.0001567682,0.000105223,0.001045716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001918487,"threshold_uncertainty_score":0.01014602,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1963519131","doi":"10.1002/wcm.108","title":"Robust position‐based routing in wireless ad hoc networks with irregular transmission ranges","year":2003,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Universitat de Barcelona","keywords":"Computer network; Computer science; Wireless Routing Protocol; Wireless ad hoc network; Flooding (psychology); Dynamic Source Routing; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Routing protocol; Geographic routing; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Link-state routing protocol; Distributed computing; Network packet; Wireless; Telecommunications","authors":[{"name":"Lali Barrière","is_ca":false},{"name":"Pierre Fraigniaud","is_ca":false},{"name":"Lata Narayanan","is_ca":true},{"name":"Jaroslav Opatrny","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01790155695241124,"gpt":0.2352750917105086,"spread":0.2173735347580973,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001236341,0.0005446865,0.0007210562,0.000764481,0.00038684,0.000858964,0.001386898,0.0009091348,0.0005292194],"category_scores_gemma":[0.004042798,0.0003848866,0.0003751103,0.0007540459,0.001034656,0.001646191,0.001215383,0.0005814917,0.0003764424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004018647,"about_ca_system_score_gemma":0.0002738141,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005779254,"about_ca_topic_score_gemma":0.0003387586,"domain_scores_codex":[0.9991331,0.0002925512,0.00007182031,0.0001143425,0.0003227733,0.00006552973],"domain_scores_gemma":[0.9980953,0.0008689851,0.0004623877,0.0003492639,0.0001625938,0.00006137521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001682432,0.00003726366,0.0006229354,0.0001752386,0.0000575441,0.0005002973,0.0001642197,0.8519275,0.02910223,0.03310544,0.001181921,0.08295717],"study_design_scores_gemma":[0.00003226667,0.0001457731,0.0002945433,0.00001683513,0.00002759372,0.0002563578,0.00002991959,0.970727,0.005752623,0.01922091,0.003472577,0.00002365724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05939256,0.002350355,0.934072,0.0003299233,0.0001127985,0.00006609653,0.00005252947,0.000956618,0.002667123],"genre_scores_gemma":[0.8091769,0.001704218,0.1858748,0.0001072057,0.0001778459,0.0001183568,0.0001775994,0.0001143793,0.002548733],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001386898,"threshold_uncertainty_score":0.006538451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051628581","doi":"10.1007/s00446-006-0007-8","title":"Optimal Deterministic Broadcasting in Known Topology Radio Networks","year":2006,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":115,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Binary logarithm; Broadcasting (networking); Radio networks; Scheme (mathematics); Node (physics); Mathematics; Discrete mathematics; Graph; Time complexity; Combinatorics; Topology (electrical circuits); Computer science; Algorithm; Computer network; Telecommunications; Wireless network; Wireless","authors":[{"name":"Dariusz R. Kowalski","is_ca":false},{"name":"Andrzej Pelc","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008946229700157711,"gpt":0.2331893582974499,"spread":0.2242431285972922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002839503,0.00089897,0.002509745,0.001321114,0.001268863,0.002357709,0.002756943,0.001837487,0.00281627],"category_scores_gemma":[0.02142861,0.001574471,0.0006220618,0.002104518,0.002624183,0.00357916,0.002230402,0.001375719,0.0003650674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003758959,"about_ca_system_score_gemma":0.00240443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005285484,"about_ca_topic_score_gemma":0.007254449,"domain_scores_codex":[0.9978022,0.0008663112,0.00009974043,0.0003697994,0.0004385523,0.0004233187],"domain_scores_gemma":[0.976877,0.01961066,0.001153888,0.001018214,0.000774616,0.0005655903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005058962,0.00007171193,0.0004094454,0.0002263569,0.00004327124,0.00005384042,0.0001678978,0.919899,0.001476081,0.05540874,0.002703675,0.01903406],"study_design_scores_gemma":[0.00009989125,0.00005412967,0.0001455368,0.0000136106,0.00002684242,0.00002802536,0.00004358252,0.9472029,0.000429946,0.05136624,0.0005757125,0.00001351556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.144238,0.002193143,0.8353878,0.002091766,0.0001810677,0.0001613425,0.0004174625,0.0007651385,0.01456419],"genre_scores_gemma":[0.9148328,0.001453938,0.07567897,0.0002374602,0.0002114153,0.0001924674,0.0003260451,0.0002117432,0.006855068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005285484,"threshold_uncertainty_score":0.02727324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2099028485","doi":"10.1109/surv.2011.020211.00045","title":"A Survey of Applications of Identity-Based Cryptography in Mobile Ad-Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mobile ad hoc network; Cryptography; Wireless ad hoc network; Open research; Computer security; Vehicular ad hoc network; Mobile computing; Identity (music); Computer network; Telecommunications; World Wide Web; Wireless","authors":[{"name":"Shushan Zhao","is_ca":true},{"name":"Akshai Aggarwal","is_ca":true},{"name":"Richard Frost","is_ca":true},{"name":"Xiaole Bai","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06212585223188858,"gpt":0.3066082981316978,"spread":0.2444824458998092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001856666,0.001186633,0.001250356,0.004017892,0.001148158,0.002645972,0.001166891,0.001755302,0.003096447],"category_scores_gemma":[0.003869648,0.0007781201,0.000691493,0.009996525,0.001150003,0.005790106,0.00146082,0.00257481,0.002937515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000966176,"about_ca_system_score_gemma":0.001049863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005008078,"about_ca_topic_score_gemma":0.0004689886,"domain_scores_codex":[0.9976779,0.0005461365,0.0002929358,0.0002664023,0.001072833,0.0001437525],"domain_scores_gemma":[0.9969831,0.001800892,0.0001944258,0.0002487545,0.0006835337,0.00008933404],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00008311839,0.0001549584,0.00195014,0.005371443,0.00005596848,0.0002657205,0.0002865588,0.004210338,0.002529503,0.07995237,0.02513732,0.8800026],"study_design_scores_gemma":[0.00002397454,0.0003316686,0.002603124,0.003418216,0.00009905283,0.003827452,0.0003769151,0.01270436,0.003615741,0.07029472,0.9025972,0.0001074349],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.003633444,0.9203568,0.04802339,0.002392431,0.001279184,0.0001004372,0.00008605912,0.0001571014,0.02397123],"genre_scores_gemma":[0.02278769,0.9494212,0.01958252,0.0007490027,0.002349551,0.00006788092,0.00016243,0.00004271229,0.004837035],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004017892,"threshold_uncertainty_score":0.01035869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130196300","doi":"10.1109/icc.2002.997425","title":"Load balancing of multipath source routing in ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multipath routing; Computer network; Wireless ad hoc network; Multipath propagation; Load balancing (electrical power); Routing (electronic design automation); Distributed computing; Mobile ad hoc network; Optimized Link State Routing Protocol; Dynamic Source Routing; Routing protocol; Telecommunications; Wireless; Geology","authors":[{"name":"L Zhang","is_ca":false},{"name":"Zenghua Zhao","is_ca":false},{"name":"Yantai Shu","is_ca":false},{"name":"Lei Wang","is_ca":false},{"name":"Ou Yang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.008706074272355162,"gpt":0.2162829024505834,"spread":0.2075768281782283,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006749703,0.0005174796,0.0003389623,0.0007284068,0.0005749541,0.0006618769,0.0005900534,0.0004256845,0.0007315375],"category_scores_gemma":[0.001697361,0.0002822783,0.0002202722,0.0007650684,0.000449839,0.001197769,0.0005539276,0.0002975823,0.0001707542],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006879289,"about_ca_system_score_gemma":0.0005116569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001266327,"about_ca_topic_score_gemma":0.001278196,"domain_scores_codex":[0.9995525,0.0001250589,0.00001924395,0.00004953662,0.0001994162,0.00005411241],"domain_scores_gemma":[0.9994804,0.0002505168,0.00007913713,0.0000516911,0.0001159624,0.0000223814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002389472,0.00009107515,0.002205964,0.0001558782,0.00007352771,0.0001743773,0.000120367,0.7410349,0.03956798,0.02381572,0.001280763,0.1912405],"study_design_scores_gemma":[0.00001914013,0.0001183246,0.0005153025,0.00001028998,0.00003142934,0.0001338806,0.00003282841,0.9724633,0.008404473,0.0150693,0.003184077,0.00001767794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2050783,0.002731851,0.7836389,0.0004021982,0.0001655947,0.0001016358,0.0000516725,0.001187676,0.006642228],"genre_scores_gemma":[0.954969,0.0008946304,0.04239434,0.00003994018,0.0001151319,0.00004544079,0.00004050686,0.0000537337,0.001447236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001266327,"threshold_uncertainty_score":0.004991293,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077715947","doi":"10.1109/twc.2013.122313.131118","title":"A Mean Field Game Theoretic Approach for Security Enhancements in Mobile Ad hoc Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Computer science; Mobile ad hoc network; Game theory; Node (physics); Wireless ad hoc network; Computer network; Computer security; Scheme (mathematics); Distributed computing; Wireless; Telecommunications; Network packet; Mathematics; Mathematical economics","authors":[{"name":"Yanwei Wang","is_ca":true},{"name":"F. Richard Yu","is_ca":true},{"name":"Helen Tang","is_ca":true},{"name":"Minyi Huang","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01632377492953324,"gpt":0.2627952867707266,"spread":0.2464715118411933,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002055088,0.001053759,0.001018671,0.001039965,0.0008994695,0.001454287,0.002055308,0.00163778,0.002311228],"category_scores_gemma":[0.004229394,0.00039144,0.001318609,0.001073973,0.002181268,0.003281821,0.001579252,0.002537121,0.0004045839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001935867,"about_ca_system_score_gemma":0.001673293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247635,"about_ca_topic_score_gemma":0.001214212,"domain_scores_codex":[0.998019,0.001044897,0.00007413973,0.000212798,0.0005154186,0.0001338413],"domain_scores_gemma":[0.9985219,0.0009574839,0.0001239039,0.0001324744,0.0001886822,0.00007558018],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005497395,0.00007620522,0.0002112021,0.0001571739,0.00005976017,0.0001220659,0.000147795,0.2007842,0.00332578,0.7619194,0.002112397,0.03102902],"study_design_scores_gemma":[0.0000320549,0.0001479704,0.000114981,0.00003804715,0.00003313251,0.0001500674,0.00004216451,0.6346969,0.0008741804,0.3572641,0.006566876,0.00003957516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00375356,0.0004270014,0.9889193,0.0004208357,0.0001034091,0.0001049023,0.00002440183,0.00004750156,0.006199053],"genre_scores_gemma":[0.6461173,0.002219637,0.3401911,0.0008008277,0.0004377206,0.0006651367,0.00007588874,0.00005602861,0.00943634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002311228,"threshold_uncertainty_score":0.01404577,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2091072140","doi":"10.1145/1362542.1362543","title":"Efficient geographic routing over lossy links in wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Nokia (Canada)","funders":"National Science Foundation","keywords":"Computer science; Computer network; Lossy compression; Packet forwarding; Geographic routing; Wireless sensor network; Network packet; Virtual routing and forwarding; Routing (electronic design automation); Metric (unit); Routing table; Performance metric; Distributed computing; Routing protocol; Static routing","authors":[{"name":"Marco Zúñiga","is_ca":false},{"name":"Karim Seada","is_ca":true},{"name":"Bhaskar Krishnamachari","is_ca":false},{"name":"Ahmed Helmy","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01424154330528261,"gpt":0.2291245243339125,"spread":0.2148829810286299,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001569847,0.0004930889,0.0005015867,0.001010103,0.0005554807,0.0008584506,0.0008954569,0.0006798374,0.0003608731],"category_scores_gemma":[0.005747161,0.000398893,0.0002247204,0.001129557,0.001157289,0.002234505,0.001097137,0.0003381199,0.0001316343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005663672,"about_ca_system_score_gemma":0.0003926662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009547813,"about_ca_topic_score_gemma":0.001274358,"domain_scores_codex":[0.9992409,0.0003198934,0.00003504742,0.00006145584,0.0002873832,0.00005531767],"domain_scores_gemma":[0.9978027,0.001320362,0.00042098,0.0002416125,0.0001769378,0.00003738945],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004884099,0.00001674702,0.001055476,0.0001096142,0.00003062974,0.0001259953,0.0001243873,0.9619827,0.006193346,0.008682359,0.0003775108,0.02125243],"study_design_scores_gemma":[0.00001668396,0.0001154563,0.0008738891,0.0000112983,0.00002157163,0.0002019401,0.00011793,0.9749138,0.002842549,0.01921644,0.001648842,0.00001959618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2270947,0.003130933,0.7661594,0.0004841754,0.00004267292,0.0001062634,0.00009362664,0.0008555096,0.002032789],"genre_scores_gemma":[0.9405022,0.001775857,0.05667452,0.00007032368,0.00004353611,0.00007908251,0.00009558941,0.00004795073,0.0007108919],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001569847,"threshold_uncertainty_score":0.008302271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100252439","doi":"10.1109/mascot.2001.948858","title":"Performance study of a multipath routing method for wireless mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Multipath routing; Optimized Link State Routing Protocol; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Wireless Routing Protocol; Vehicular ad hoc network; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications; Network packet","authors":[{"name":"Kui Wu","is_ca":true},{"name":"Janelle Harms","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02484175342221162,"gpt":0.2738050662479757,"spread":0.2489633128257641,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002156937,0.0008658659,0.0007635946,0.001172295,0.0006054738,0.0006475349,0.000708608,0.0006059706,0.00140136],"category_scores_gemma":[0.007949718,0.0001899033,0.0003160248,0.001289929,0.0003924884,0.0009365251,0.0004780354,0.0004186067,0.0002401585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001040075,"about_ca_system_score_gemma":0.0006764347,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002264518,"about_ca_topic_score_gemma":0.001362595,"domain_scores_codex":[0.9984689,0.0005665229,0.0000428935,0.0001259878,0.000648594,0.0001471119],"domain_scores_gemma":[0.9933601,0.004187194,0.0003382583,0.0004328298,0.001525406,0.0001562536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001318596,0.0002013969,0.005118217,0.0003820734,0.0002225401,0.0002180222,0.000166198,0.7151253,0.02861558,0.01075892,0.003607528,0.2342656],"study_design_scores_gemma":[0.00002056334,0.0004962616,0.000939268,0.00001076781,0.00004355211,0.0001916081,0.00003719391,0.9916089,0.004368268,0.0009533353,0.001309118,0.00002119864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4163646,0.008480623,0.5576702,0.000664627,0.000514069,0.000284671,0.0002378651,0.002051739,0.01373169],"genre_scores_gemma":[0.9371978,0.001197849,0.05943558,0.00004050072,0.00008789744,0.00008083433,0.0001333786,0.00008205234,0.001744118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002264518,"threshold_uncertainty_score":0.01140714,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}