{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009310115,0.0007388381,0.000885985,0.0002463086,0.0003590462,0.0004772085,0.002367242,0.0005326526,0.00003575091],"category_scores_gemma":[0.00001025719,0.0006873972,0.0001801636,0.002788413,0.0002130634,0.0009315373,0.0007075401,0.001450364,0.00003536043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002568441,"about_ca_system_score_gemma":0.0001405111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001450119,"about_ca_topic_score_gemma":0.001473152,"domain_scores_codex":[0.9944808,0.0003495413,0.0009509716,0.001498456,0.0006870829,0.002033114],"domain_scores_gemma":[0.9968641,0.0004670052,0.0004300985,0.001712505,0.0001719959,0.0003542261],"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.0002583888,0.0001914083,0.02280438,0.0000128976,0.00006727898,0.001027078,0.0004400038,0.6219438,0.00001580072,0.006435147,0.0009164702,0.3458874],"study_design_scores_gemma":[0.001880679,0.0001981652,0.005980683,0.0005289081,0.0000202983,0.0002380478,0.00009213209,0.9880247,0.00001070492,0.0001056644,0.002026953,0.0008930261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3018529,0.002780832,0.69174,0.0002050485,0.0008019073,0.0006186752,8.841184e-7,0.0005671682,0.001432612],"genre_scores_gemma":[0.9924511,0.001953444,0.003186017,0.001143117,0.00073765,0.0001593232,0.00001785724,0.0001100815,0.0002413954],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6905982,"threshold_uncertainty_score":0.9995577,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003343614,0.0002600464,0.0003290389,0.0001499606,0.0003147599,0.0003020531,0.0002492249,0.0001752508,0.000008215272],"category_scores_gemma":[0.000007193562,0.0002576953,0.00005211012,0.000594082,0.00006640093,0.0003470347,0.000005168527,0.0003440848,0.000005115657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008291468,"about_ca_system_score_gemma":0.00001742383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001487421,"about_ca_topic_score_gemma":0.00004342808,"domain_scores_codex":[0.9980897,0.0001774871,0.0004842543,0.0005544281,0.0002575899,0.0004365287],"domain_scores_gemma":[0.9987889,0.0004808458,0.0001511948,0.0003267504,0.00007543519,0.000176863],"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.00001152495,0.0001286558,0.0001686121,0.00004421061,0.00001570338,0.00003383116,0.0001963766,0.9136798,0.00002347142,0.0004293396,0.00009500881,0.08517347],"study_design_scores_gemma":[0.001242332,0.00008985666,0.0006738628,0.0002150372,0.00001162633,0.00004644865,0.0001001767,0.9972638,0.00001725699,0.00001835851,0.00004823395,0.0002729712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01180821,0.0006611022,0.9860955,0.0002316802,0.0004937478,0.0004276209,0.00004174413,0.0001458155,0.00009452336],"genre_scores_gemma":[0.9974515,0.0001172945,0.002072372,0.00005870672,0.0000489543,0.0001735459,0.00001264441,0.00001580457,0.00004922258],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9856433,"threshold_uncertainty_score":0.9999875,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003837057,0.000165092,0.0001879052,0.0001600622,0.0002445503,0.0001498553,0.003132144,0.00009733473,0.00006550625],"category_scores_gemma":[0.00003648328,0.0001850889,0.00006896202,0.001202184,0.0001059905,0.0003711997,0.0004078378,0.0004785307,0.0003560623],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001298711,"about_ca_system_score_gemma":0.00002709178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007271028,"about_ca_topic_score_gemma":0.0002525183,"domain_scores_codex":[0.9984396,0.000272458,0.0004207861,0.0003146636,0.0001782906,0.0003742724],"domain_scores_gemma":[0.9953202,0.0004963456,0.0001440773,0.003846522,0.0001000675,0.00009277405],"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.00001720779,0.002159723,0.004499611,0.00002589204,0.00005498641,0.00006281407,0.001421037,0.252506,0.0007555502,0.066864,0.06217413,0.609459],"study_design_scores_gemma":[0.000426185,0.0000367179,0.002205749,0.0000645146,0.000004447982,0.000008609974,0.000003894055,0.9809852,0.00001806034,0.0002854773,0.01576731,0.0001937797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001840244,0.007547231,0.9569046,0.01218144,0.0005243623,0.0005108031,0.000003190987,0.0005053873,0.01998275],"genre_scores_gemma":[0.9287183,0.0009259242,0.06864913,0.001145881,0.00006344681,0.000123042,0.00001752256,0.00001870678,0.0003380887],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.926878,"threshold_uncertainty_score":0.7547707,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002158511,0.0004983675,0.0006228474,0.0001755889,0.0001671504,0.0003615,0.00291143,0.0003502345,0.00004013954],"category_scores_gemma":[0.00002440164,0.0005003495,0.0001543676,0.001664559,0.00009660303,0.0007537184,0.00159094,0.0009152106,0.0000538268],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001218322,"about_ca_system_score_gemma":0.00008590084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006955867,"about_ca_topic_score_gemma":0.0004320413,"domain_scores_codex":[0.9954059,0.0007524143,0.0009047232,0.001216345,0.0003502628,0.001370387],"domain_scores_gemma":[0.9970049,0.0004387374,0.0003305686,0.001772378,0.000151697,0.0003017657],"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.00009921059,0.000390717,0.0674829,0.00001809682,0.0000564648,0.0002793898,0.001170022,0.2457992,4.889413e-7,0.006304508,0.01008706,0.668312],"study_design_scores_gemma":[0.0007027924,0.0002047718,0.126288,0.0002226845,0.000002996237,0.00002618816,0.000002439706,0.8696734,0.000002356628,0.0004069872,0.001965677,0.0005016826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00134362,0.0007954974,0.9889573,0.00002718627,0.001329724,0.00603797,7.945192e-7,0.0005105349,0.0009973875],"genre_scores_gemma":[0.8385581,0.0001419366,0.1533936,0.001412729,0.001359892,0.004885551,0.00002521539,0.0001050584,0.0001179274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8372145,"threshold_uncertainty_score":0.9997448,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00180313,0.0002294849,0.0002607886,0.0001737529,0.0002358354,0.0004836553,0.002820535,0.0001009793,0.001214964],"category_scores_gemma":[0.00002204384,0.0002034016,0.00006457797,0.001577433,0.002310702,0.0009359021,0.0005330227,0.0003987852,0.0004082872],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113795,"about_ca_system_score_gemma":0.0000684191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002832466,"about_ca_topic_score_gemma":0.000001560132,"domain_scores_codex":[0.9968625,0.000197813,0.0003876212,0.0009578327,0.0006465561,0.0009476428],"domain_scores_gemma":[0.9981197,0.0002743434,0.00005024638,0.00116574,0.00006030354,0.0003296546],"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.00001207041,0.00006430415,0.0006127513,0.000001867375,0.000001770746,0.00004075623,0.0002246759,0.01155432,0.00001531883,0.8853256,0.000230161,0.1019164],"study_design_scores_gemma":[0.0003390368,0.0001326277,0.01170076,0.00003927324,0.000001369918,0.00007032013,9.530884e-7,0.9508087,0.00008643256,0.03604455,0.0004965597,0.0002794209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.105109,0.00009465164,0.8851866,0.0004240933,0.0005873466,0.0002347519,3.962778e-7,0.0002399658,0.008123265],"genre_scores_gemma":[0.9574265,0.000040864,0.04145753,0.0008941201,0.0001253863,0.00001356692,6.769322e-7,0.00001000257,0.00003134894],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9392544,"threshold_uncertainty_score":0.999698,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001416487,0.0002003153,0.0004059101,0.0001719929,0.0004642,0.0002085893,0.001349631,0.0001584643,0.000006731411],"category_scores_gemma":[0.0001113039,0.0001849383,0.0001281738,0.0006322447,0.00008273725,0.0002258849,0.0004458381,0.0008509772,5.721819e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001062505,"about_ca_system_score_gemma":0.00002354577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003191037,"about_ca_topic_score_gemma":0.00002944666,"domain_scores_codex":[0.9978953,0.0003169363,0.0009075671,0.00023143,0.0002197261,0.0004290605],"domain_scores_gemma":[0.9950463,0.002738512,0.0008175584,0.0009827316,0.0002753138,0.0001395474],"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.00003581385,0.0002784494,0.0004932178,0.000009790734,0.00004691481,0.00001285527,0.00144064,0.618372,0.00001191329,0.01855848,0.0005273728,0.3602126],"study_design_scores_gemma":[0.00111035,0.0002655113,0.0007965596,0.0005521766,0.00001340821,0.00006128227,0.0001415539,0.9963445,0.000002352599,0.0002438579,0.0002793456,0.0001890709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1254165,0.007925099,0.8645272,0.001050622,0.0003270493,0.0004001042,0.000001247613,0.00003997837,0.0003122202],"genre_scores_gemma":[0.980278,0.0013582,0.01799609,0.0002367778,0.00007422382,0.00002309405,0.000002662001,0.0000210032,0.00001000636],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8548614,"threshold_uncertainty_score":0.7541565,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001245025,0.0001722269,0.0004347104,0.00006338922,0.000176564,0.0001275842,0.000864664,0.00009851839,0.000001172026],"category_scores_gemma":[0.000007890726,0.0001524216,0.0001322249,0.000555866,0.00004184149,0.000254562,0.0001320961,0.0002418724,5.211565e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002457532,"about_ca_system_score_gemma":0.00007806011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001164364,"about_ca_topic_score_gemma":0.000005286438,"domain_scores_codex":[0.9982333,0.0001179525,0.000833037,0.0002727753,0.0002052929,0.000337606],"domain_scores_gemma":[0.9974495,0.0005267035,0.0008613612,0.0004692392,0.0005335666,0.0001596681],"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.00003769894,0.0001781373,0.001457878,0.00001226726,0.00003636183,0.000001336279,0.0001089735,0.1317276,0.000008525326,0.004454882,0.004072043,0.8579043],"study_design_scores_gemma":[0.0008301824,0.001022883,0.04070712,0.0001324809,0.0000171056,0.00004561924,0.000003714224,0.9302409,0.000008480046,0.002208669,0.02459419,0.0001886647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00107262,0.002596731,0.9908138,0.00008059351,0.0001193138,0.005256702,0.000002928711,0.00003118055,0.00002612305],"genre_scores_gemma":[0.5748383,0.0004901735,0.419855,0.0004570933,0.001548885,0.002759277,0.000009319322,0.00002068879,0.0000212829],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8577156,"threshold_uncertainty_score":0.6215574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381361,0.0002118754,0.0002277706,0.0001400153,0.00006733445,0.0001257403,0.0009678411,0.0001269736,0.0001232237],"category_scores_gemma":[0.000005950347,0.0001866548,0.00006897211,0.0007418917,0.00003732595,0.0001153413,0.000509716,0.0002798107,0.00007761613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001796093,"about_ca_system_score_gemma":0.00003626928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005623866,"about_ca_topic_score_gemma":0.0003004808,"domain_scores_codex":[0.9976428,0.00006124491,0.0004701281,0.0005858785,0.0004246624,0.0008153504],"domain_scores_gemma":[0.9987106,0.0001852133,0.00008373581,0.0007916335,0.00004852473,0.0001802399],"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.00005480634,0.0004892436,0.005532829,0.00001225401,0.00003317786,0.000269183,0.0009111535,0.3224649,0.00009950458,0.5482442,0.01337865,0.1085101],"study_design_scores_gemma":[0.0005562833,0.00005523628,0.003802533,0.00002729576,0.000002257187,0.000009462621,0.00003273315,0.9938263,0.0002979602,0.00008883294,0.0010475,0.0002535809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05587751,0.00004221099,0.9247477,0.0002061704,0.000769563,0.0003626962,1.589162e-7,0.0002003736,0.01779364],"genre_scores_gemma":[0.9866634,0.00000969937,0.01100224,0.001087819,0.0001726945,0.00002704777,0.000001767427,0.00001447945,0.001020846],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9307859,"threshold_uncertainty_score":0.7611564,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006162329,0.0001394326,0.0001842003,0.00007096544,0.00005743897,0.0001086531,0.0004947585,0.00009177378,0.00007060684],"category_scores_gemma":[0.00002949161,0.000135732,0.00004515829,0.0005958744,0.00002465892,0.0003109012,0.0001220775,0.0002177081,0.00001900693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007214997,"about_ca_system_score_gemma":0.00005509793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006023082,"about_ca_topic_score_gemma":0.0007138345,"domain_scores_codex":[0.9985989,0.0001964591,0.0002068271,0.0004239732,0.0001518534,0.0004219423],"domain_scores_gemma":[0.9989461,0.0002740522,0.00004827089,0.0006107613,0.00002831009,0.00009247951],"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.00001097125,0.000195508,0.01848386,0.00001551194,0.000009584347,0.00009677507,0.0001066467,0.6769662,0.0001497733,0.2346489,0.001036983,0.06827923],"study_design_scores_gemma":[0.0004342283,0.00002519839,0.001900476,0.0000188381,8.023587e-7,0.000006241812,0.000005772016,0.9958681,0.000381017,0.0004157491,0.000765161,0.0001784402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02382897,0.00003665396,0.9576064,0.0001170983,0.0004272143,0.0001823077,7.952359e-8,0.0001925211,0.0176087],"genre_scores_gemma":[0.9799467,0.000004019362,0.01909746,0.0007570972,0.00003485036,0.00003207077,4.224805e-7,0.00001033487,0.0001170625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9561177,"threshold_uncertainty_score":0.5534989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006957649,0.0003597256,0.0004378072,0.00007437397,0.0003900467,0.0004187258,0.00122337,0.0002019444,0.0002257353],"category_scores_gemma":[0.0002836465,0.0003464212,0.0001794592,0.0006223216,0.00004854238,0.0006866115,0.0006601288,0.0003022756,0.00003654072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009076657,"about_ca_system_score_gemma":0.00001535517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002420412,"about_ca_topic_score_gemma":0.00002906833,"domain_scores_codex":[0.9969872,0.0001058579,0.0007304128,0.0008818361,0.0003047444,0.0009900025],"domain_scores_gemma":[0.9963641,0.002052703,0.0003110514,0.0009202339,0.000146708,0.0002051841],"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.00001524222,0.0001289372,0.00003790931,0.00009417367,0.00004926573,0.00001523023,0.001441944,0.06007415,0.0008334674,0.001388519,0.005969814,0.9299514],"study_design_scores_gemma":[0.0008879297,0.0001975713,0.00002831755,0.00008647636,0.00001084013,0.00002976882,0.0001296833,0.9939346,0.0003158392,0.0003272311,0.00360497,0.0004467599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0133417,0.001815548,0.976456,0.0002278687,0.0007790783,0.001458811,0.000002063766,0.0008098726,0.005109039],"genre_scores_gemma":[0.5356349,0.0000733508,0.4612835,0.0005436448,0.0002694049,0.0007613326,0.000004026421,0.00005088939,0.001379012],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9338605,"threshold_uncertainty_score":0.9998988,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004835322,0.0004407693,0.0004248555,0.00008643237,0.0004171994,0.0004195783,0.001750438,0.0002669886,0.0001370797],"category_scores_gemma":[0.00002910977,0.000395264,0.0002288297,0.0005994262,0.00007025409,0.0005650677,0.0006320328,0.0004259939,0.00008854835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000162978,"about_ca_system_score_gemma":0.00004021963,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001347339,"about_ca_topic_score_gemma":0.0001296293,"domain_scores_codex":[0.9966363,0.0001190055,0.0006324838,0.001089463,0.0003771186,0.001145674],"domain_scores_gemma":[0.9977116,0.0002863852,0.0002966592,0.001272867,0.0001648257,0.0002676811],"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.00005146843,0.0006024707,0.0005428831,0.0001541354,0.00006770208,0.00003621487,0.001274345,0.06335926,0.00005855059,0.003058023,0.01890634,0.9118886],"study_design_scores_gemma":[0.002002808,0.0002012861,0.0001224049,0.0001468066,0.00000722421,0.00002228238,0.00005248992,0.9713644,0.00002597719,0.00004514744,0.02550012,0.0005090765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"protocol","genre_scores_codex":[0.0001680914,0.00005287753,0.9074845,0.0002351681,0.0003053755,0.09031958,0.000001941787,0.0009069912,0.0005254912],"genre_scores_gemma":[0.2343894,0.00001659622,0.2021472,0.0014869,0.0006857666,0.5491378,0.00001050589,0.0001814756,0.01194442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9113795,"threshold_uncertainty_score":0.9998499,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009280206,0.0006407422,0.0007647125,0.0001148988,0.001115738,0.0002980182,0.00168842,0.0003466183,0.00005233729],"category_scores_gemma":[0.00004337189,0.0006761214,0.0003485202,0.001232147,0.0001896935,0.0008784137,0.0006662132,0.0006409998,0.00003809843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002411867,"about_ca_system_score_gemma":0.0002140061,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005515374,"about_ca_topic_score_gemma":0.00002053847,"domain_scores_codex":[0.9949992,0.0002293885,0.0009429745,0.001419582,0.0005679792,0.001840852],"domain_scores_gemma":[0.9964656,0.0007189176,0.0005665388,0.001489598,0.0003415469,0.000417796],"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.00002705147,0.00007256824,0.00005109591,0.000005627157,0.00005029779,0.0000726151,0.0001637029,0.6389969,0.000001197027,0.0002233963,0.02751503,0.3328205],"study_design_scores_gemma":[0.001204503,0.0006208036,0.0001020729,0.00009870759,0.00003665891,0.0002188142,0.00001628594,0.9096516,0.00001435958,0.0002718896,0.08705397,0.0007103726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001133415,0.02718832,0.9657019,0.000141229,0.002543956,0.002096976,0.00001454719,0.0007887708,0.0003908674],"genre_scores_gemma":[0.0819372,0.01663848,0.8915144,0.00206985,0.003808107,0.00190591,0.0002706194,0.000225259,0.001630126],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3321101,"threshold_uncertainty_score":0.999569,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004364672,0.0001660954,0.0002002634,0.00005042521,0.00007529347,0.0001578081,0.0007022408,0.00008080501,0.00003153213],"category_scores_gemma":[0.000007786946,0.0001347949,0.00002920656,0.0008883384,0.00002703571,0.0004581584,0.0002393441,0.0002819637,0.00002670905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001428214,"about_ca_system_score_gemma":0.00008283396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007775106,"about_ca_topic_score_gemma":0.00160429,"domain_scores_codex":[0.9983456,0.00005354884,0.0002448975,0.000470343,0.0002963596,0.0005892919],"domain_scores_gemma":[0.9990723,0.0001106768,0.00007565967,0.0005820249,0.00005608099,0.0001032703],"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.0000476791,0.0001106549,0.1093939,0.000008517234,0.00002193576,0.0006504523,0.0008330364,0.1235091,0.00005988015,0.02710816,0.001157184,0.7370994],"study_design_scores_gemma":[0.0005037441,0.00006576863,0.0089562,0.00009295055,0.000001812704,0.00007140234,0.00003896637,0.9883947,0.00002776871,0.0001083096,0.001501375,0.000237036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1149806,0.0003640114,0.8699473,0.0002456599,0.00018071,0.000167203,4.209792e-8,0.0002480804,0.01386643],"genre_scores_gemma":[0.983345,0.0001303933,0.01522523,0.0005690213,0.0001067008,0.0000195751,6.612065e-7,0.00001432104,0.0005891334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8683644,"threshold_uncertainty_score":0.5496777,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003065642,0.0002289436,0.0003148599,0.0001065111,0.0001739529,0.000150663,0.0002206095,0.0001809467,0.00000332119],"category_scores_gemma":[0.000001953939,0.0001984569,0.00004964845,0.0008142683,0.00005050958,0.0002959407,0.000001460867,0.0002466441,0.000009242242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001074128,"about_ca_system_score_gemma":0.00004180329,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008007592,"about_ca_topic_score_gemma":0.000218624,"domain_scores_codex":[0.9982272,0.0002488996,0.0004190647,0.0005165992,0.0002455743,0.0003426866],"domain_scores_gemma":[0.9990047,0.0001318023,0.0001411142,0.0005029268,0.00007135195,0.0001481554],"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.0001076714,0.0001273225,0.0001262975,0.00001688527,0.00002402025,0.000008100506,0.00006913332,0.9840161,0.00002724941,0.004174352,0.00006624516,0.01123661],"study_design_scores_gemma":[0.002202557,0.0001379081,0.0002515968,0.00006935585,0.00001703853,0.00004575688,0.00006952726,0.994966,0.00003533443,0.000124241,0.001813733,0.0002669952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007368637,0.0006895435,0.9904761,0.00005759039,0.0002940121,0.0008534584,0.00001747466,0.0001522019,0.00009100809],"genre_scores_gemma":[0.9977242,0.000148261,0.001436099,0.00003354828,0.00002122418,0.0005193072,0.00002891034,0.00001517556,0.00007326371],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9903556,"threshold_uncertainty_score":0.8092836,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005878711,0.0001059828,0.0001222036,0.00004137131,0.00006026465,0.00008285972,0.0001685588,0.00009970865,0.00004393751],"category_scores_gemma":[0.0000124996,0.0001006885,0.00002242038,0.0003578147,0.00004234174,0.0005174476,0.00007320502,0.0001631304,0.000008184545],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005315674,"about_ca_system_score_gemma":0.00001398833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134815,"about_ca_topic_score_gemma":0.0002311504,"domain_scores_codex":[0.9987959,0.0001516524,0.0002322958,0.0004182428,0.000134268,0.0002676338],"domain_scores_gemma":[0.999378,0.00007509364,0.00004285898,0.0003934242,0.00002426176,0.00008637034],"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.00003256635,0.0005588143,0.08562925,0.00003571986,0.00001786425,0.00002511756,0.0004225248,0.01404713,0.0002484516,0.5547184,0.003072121,0.341192],"study_design_scores_gemma":[0.0005132337,0.0001278335,0.05585363,0.00002389294,0.000002751881,0.00001505721,0.00002078774,0.9331312,0.0001026545,0.007350998,0.00269423,0.00016375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2248096,0.0004730873,0.7715424,0.00005743078,0.0003242455,0.0002672883,3.877482e-7,0.0001645248,0.002360996],"genre_scores_gemma":[0.9945989,0.0002255278,0.004815003,0.0001527369,0.00003217122,0.00007300024,0.000002876041,0.000005905776,0.00009391796],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9190841,"threshold_uncertainty_score":0.4105959,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0197174,0.0003754454,0.0005913926,0.0001513039,0.0005766283,0.0002900073,0.009047673,0.0002932003,0.00006209934],"category_scores_gemma":[0.0004184489,0.0003877009,0.000142888,0.001493064,0.0003637136,0.0008251803,0.001285471,0.0005380022,0.0002226342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001279733,"about_ca_system_score_gemma":0.0003009598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002397939,"about_ca_topic_score_gemma":0.001518991,"domain_scores_codex":[0.9808561,0.01640601,0.0009440012,0.0006658638,0.0004198015,0.0007082241],"domain_scores_gemma":[0.9851214,0.005009804,0.000464411,0.008491117,0.0006517287,0.0002615861],"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.0001833044,0.003897915,0.03794767,0.00004078562,0.00113866,0.00005879466,0.01033236,0.005898826,0.001633513,0.517543,0.130581,0.2907442],"study_design_scores_gemma":[0.002598478,0.0005777801,0.2263082,0.0002069652,0.0001248919,0.00005907693,0.00006293065,0.7355196,0.003668426,0.01338527,0.01406585,0.003422475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001107278,0.0004483323,0.9895175,0.00007797308,0.004705817,0.0007691291,0.00001565647,0.0005428892,0.002815429],"genre_scores_gemma":[0.9285533,0.0008026813,0.06939439,0.0001368892,0.0003998575,0.0003304552,0.00004996633,0.00005271644,0.0002796796],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9274461,"threshold_uncertainty_score":0.9998575,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006758771,0.0002028814,0.0003760026,0.0001512831,0.0001540051,0.0000687643,0.0005607218,0.0001297932,0.00006181575],"category_scores_gemma":[0.00002812199,0.0002148313,0.0001230382,0.0007492971,0.00006901976,0.0004226122,0.0003172796,0.0002537919,0.00007885342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001491562,"about_ca_system_score_gemma":0.0001008667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007859024,"about_ca_topic_score_gemma":0.0001005942,"domain_scores_codex":[0.9979199,0.0001780217,0.0003992656,0.000516869,0.0003538493,0.0006320673],"domain_scores_gemma":[0.9983979,0.0005472883,0.0001208723,0.0007342819,0.00004642855,0.0001532229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005145961,0.00191957,0.776705,0.0000455441,0.00005539237,0.002316276,0.0009939242,0.01580761,0.0003433641,0.01115606,0.1424536,0.04815213],"study_design_scores_gemma":[0.0009130723,0.0001182679,0.2450725,0.0003195989,0.00001076894,0.0002950858,0.00003749232,0.7344007,0.003930657,0.0005297452,0.01272534,0.001646649],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8120416,0.0001763417,0.1837738,0.000195755,0.001145749,0.0002156833,5.962892e-7,0.0002473518,0.002203183],"genre_scores_gemma":[0.997808,0.0001799476,0.0009038536,0.0003945094,0.0001718462,0.00002969175,0.000006557501,0.00001583008,0.0004896949],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7185932,"threshold_uncertainty_score":0.8760567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0007007173,0.0008383197,0.001006664,0.0002942586,0.0007482818,0.0008941241,0.008626204,0.0008482357,0.0000128273],"category_scores_gemma":[0.0000049833,0.0008945881,0.0002694566,0.0006477244,0.0002583392,0.0003623685,0.007245355,0.001839164,0.00006257154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002687056,"about_ca_system_score_gemma":0.0002548873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005901594,"about_ca_topic_score_gemma":0.0001124675,"domain_scores_codex":[0.9959766,0.0003388082,0.001067104,0.001299218,0.0003891307,0.0009291376],"domain_scores_gemma":[0.9889651,0.0008009932,0.0004739591,0.008817242,0.0003277128,0.0006150255],"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.000003773803,0.00004379361,0.000001809922,0.000006669548,0.0000535764,0.000009881184,0.00007725904,0.0116998,7.307332e-8,0.02597566,0.3561357,0.605992],"study_design_scores_gemma":[0.0001703529,0.0001555622,0.00003528217,0.0003143268,0.00002627395,0.00003249394,8.071242e-7,0.4919781,4.945252e-8,0.001032802,0.5057514,0.0005026083],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001308368,0.05416695,0.867617,0.001633286,0.0007413475,0.0009075806,0.000003780988,0.0005389589,0.07438979],"genre_scores_gemma":[0.0009349952,0.1126938,0.5766017,0.01495055,0.003513856,0.0003624495,0.0005617731,0.0002536934,0.2901272],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6054894,"threshold_uncertainty_score":0.9993505,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003357199,0.0003106352,0.0003292164,0.0003450261,0.0004321333,0.00007961472,0.0008911261,0.0003192005,0.00001247276],"category_scores_gemma":[0.000002475494,0.0002964661,0.0001132262,0.001035102,0.0001413413,0.0002205494,0.00001487343,0.0004578342,0.000009733201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001938797,"about_ca_system_score_gemma":0.00003003348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004265047,"about_ca_topic_score_gemma":0.00003561257,"domain_scores_codex":[0.9978701,0.00007201739,0.0003111883,0.0008207908,0.0002642849,0.0006615497],"domain_scores_gemma":[0.9984348,0.00006624299,0.0001492325,0.001157135,0.0001034419,0.00008908696],"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.00005330793,0.0002076627,0.00001229861,0.00003404018,0.0001520744,0.00001950334,0.00005932949,0.7055482,0.000231614,0.004594118,0.00003739294,0.2890505],"study_design_scores_gemma":[0.00114776,0.0008446228,0.000004668632,0.0001466459,0.00008053741,0.00004602964,0.00007213667,0.9767572,0.007468232,0.001178959,0.01187594,0.0003772383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03809436,0.0003797117,0.9590552,0.000141593,0.0004282143,0.001177641,0.000003076877,0.0006205976,0.00009955434],"genre_scores_gemma":[0.8646685,0.0001983916,0.1337091,0.0001660332,0.00003442261,0.001088754,0.00000288261,0.0000385181,0.00009339148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8265741,"threshold_uncertainty_score":0.9999487,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001828183,0.000170728,0.0002978158,0.0001291826,0.0001446936,0.0002115528,0.001496651,0.0001373309,0.000008920279],"category_scores_gemma":[0.00005659477,0.0001845082,0.00005105522,0.0008197335,0.00003608172,0.000390093,0.0002092761,0.0003625961,0.00002918396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001987271,"about_ca_system_score_gemma":0.00007887458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002232679,"about_ca_topic_score_gemma":0.0003907146,"domain_scores_codex":[0.9973475,0.001223329,0.0004925672,0.0003602133,0.0002003918,0.0003760257],"domain_scores_gemma":[0.9966977,0.000597503,0.0002276935,0.002304463,0.00008695541,0.00008573985],"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.0000109665,0.0002636362,0.01392781,0.00006260701,0.00002256227,0.000009731722,0.0004434274,0.8098402,0.0002773695,0.1506677,0.0005809173,0.02389303],"study_design_scores_gemma":[0.0004574725,0.00002150497,0.001779689,0.00008890291,0.000001584842,0.00001438498,0.0000405784,0.9930007,0.00007648004,0.00007201241,0.00424111,0.0002056133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01804527,0.0007750483,0.9717287,0.0001315107,0.000507588,0.0005317816,3.683664e-7,0.0002718708,0.0080078],"genre_scores_gemma":[0.9939584,0.00004937573,0.005500231,0.000159708,0.00003445326,0.000219327,0.000004714273,0.0000188251,0.00005498136],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9759131,"threshold_uncertainty_score":0.7524024,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002598547,0.0001397979,0.0001380954,0.0001104346,0.00005824396,0.000135097,0.0007586921,0.00007669156,0.0004270549],"category_scores_gemma":[0.000003095164,0.0001367122,0.00003345698,0.00120326,0.00002443605,0.0004756558,0.0003468846,0.0001558224,0.0004875878],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009775374,"about_ca_system_score_gemma":0.000005528728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004627688,"about_ca_topic_score_gemma":0.00004569933,"domain_scores_codex":[0.9985519,0.00004366246,0.0002699403,0.0004736535,0.0002300412,0.0004308176],"domain_scores_gemma":[0.9989892,0.00003656641,0.00005225823,0.000793807,0.00004167992,0.00008648514],"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.000003453099,0.0002537308,0.0006112183,0.00002338351,0.00001568179,0.00004165487,0.0001782918,0.114546,0.000006256619,0.03477125,0.02843787,0.8211112],"study_design_scores_gemma":[0.0003343458,0.00004799595,0.0006426529,0.00003366321,0.000001699536,0.000003753771,0.00001969304,0.9357033,0.00001612696,0.0003534592,0.06268065,0.0001626583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002465696,0.009031763,0.9394335,0.0002902332,0.0003292993,0.000696305,8.149996e-8,0.0003453188,0.04740781],"genre_scores_gemma":[0.8218386,0.003550713,0.1565994,0.001232596,0.0001095666,0.0006399471,0.000003096812,0.0000261323,0.01599993],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8211573,"threshold_uncertainty_score":0.6267117,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001359562,0.0002665603,0.0003634775,0.0002885788,0.0004696139,0.0002477616,0.002767899,0.0001699186,0.00002463952],"category_scores_gemma":[0.0002325103,0.0002638945,0.00006860508,0.002296639,0.0001125966,0.0009546755,0.0004255692,0.002256105,0.0000288677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005075734,"about_ca_system_score_gemma":0.0003484417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007186334,"about_ca_topic_score_gemma":0.0002289394,"domain_scores_codex":[0.9971839,0.0005844962,0.000845856,0.0002635935,0.000335306,0.0007869158],"domain_scores_gemma":[0.9961071,0.001043818,0.0004180974,0.001723908,0.0003876784,0.0003193949],"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.0003605106,0.01681791,0.08270428,0.00003933192,0.0005221946,0.0002028335,0.02176679,0.2793187,0.006714155,0.2213416,0.01257746,0.3576342],"study_design_scores_gemma":[0.001395892,0.0002621262,0.01474506,0.0004572448,0.000012948,0.0004473301,0.0001842846,0.9670244,0.0000566735,0.0001386595,0.01475524,0.0005201572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363379,0.02013039,0.8290146,0.002400385,0.002275801,0.002006453,0.00001866472,0.000440206,0.007375618],"genre_scores_gemma":[0.96668,0.0048777,0.02746359,0.0005097646,0.0001822662,0.0001645135,0.00001883248,0.00002849326,0.000074792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8303422,"threshold_uncertainty_score":0.9999813,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004580317,0.000156587,0.0001829418,0.00006285802,0.00008978744,0.0001366275,0.000334637,0.00008767699,0.0001494878],"category_scores_gemma":[0.00001182915,0.0001466342,0.00002848297,0.0007579278,0.00002582114,0.0001400266,0.0001541844,0.0001727449,0.00005493727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004717711,"about_ca_system_score_gemma":0.00004385542,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001694493,"about_ca_topic_score_gemma":0.0001463066,"domain_scores_codex":[0.9984992,0.0001122191,0.0002651029,0.00048153,0.000194366,0.0004475382],"domain_scores_gemma":[0.9991366,0.0001405039,0.00005244079,0.0005126256,0.00005121897,0.0001065924],"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.000009126774,0.0001593465,0.001046366,0.00001458523,0.000007191719,0.0000325356,0.0003254424,0.9283866,0.00003695213,0.05923102,0.0009642468,0.009786646],"study_design_scores_gemma":[0.0007014167,0.00006772428,0.001069018,0.00002735909,0.000002332478,0.00002789441,0.00003594337,0.9663016,0.00007367483,0.001358654,0.03011717,0.0002172014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2801265,0.006152125,0.6950142,0.0002110839,0.0004707541,0.0008006661,0.000001334375,0.0002525088,0.01697079],"genre_scores_gemma":[0.9907995,0.0002226419,0.006351849,0.002116125,0.00002252979,0.0001394459,0.000001762737,0.00001197903,0.0003341199],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.710673,"threshold_uncertainty_score":0.5979567,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.006570946,0.0005448548,0.0006038358,0.0003332282,0.000868586,0.0008291778,0.0031115,0.0005308949,0.00001717517],"category_scores_gemma":[0.00003896048,0.0005259447,0.0002936982,0.001718782,0.0002128879,0.0004671149,0.001480001,0.001646878,0.00007171117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002889539,"about_ca_system_score_gemma":0.00009367018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003085414,"about_ca_topic_score_gemma":0.0000229317,"domain_scores_codex":[0.9933915,0.0003911553,0.0009968779,0.001668267,0.000890601,0.002661565],"domain_scores_gemma":[0.9927406,0.003572099,0.0002796572,0.002222838,0.0006184608,0.0005663203],"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.0001228544,0.0002045114,0.0001039036,0.00001761375,0.00003066897,0.00004903724,0.0001550008,0.4006806,0.000002568075,0.0113251,0.01603776,0.5712704],"study_design_scores_gemma":[0.001193422,0.001384047,0.0007043254,0.0003288122,0.000005300513,0.00002250564,0.00002049451,0.898508,0.00003379245,0.0004005713,0.09688662,0.0005121813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006195896,0.0007651858,0.9743175,0.0001152001,0.001791895,0.02083864,0.000001493732,0.0006705461,0.0008799521],"genre_scores_gemma":[0.6185694,0.0001125117,0.3417641,0.002106614,0.01050744,0.02614414,0.00003933087,0.0002324243,0.0005240442],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6325534,"threshold_uncertainty_score":0.9997192,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.000536221,0.0005815789,0.0005788429,0.0002360136,0.001702481,0.0002304551,0.002006205,0.0004732539,0.00001670786],"category_scores_gemma":[0.0000123185,0.0006263771,0.000471279,0.001215567,0.0001430773,0.0006351276,0.00004063512,0.001099102,0.00003369396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002083737,"about_ca_system_score_gemma":0.0001551488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002639136,"about_ca_topic_score_gemma":0.0001024793,"domain_scores_codex":[0.9960136,0.0001677544,0.0007802419,0.001226293,0.0004803575,0.001331743],"domain_scores_gemma":[0.9964725,0.0008396753,0.000278509,0.001805575,0.0002448225,0.0003588786],"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.00003837807,0.0001286705,0.00009992158,0.0000154169,0.00008436234,0.00004933589,0.0002696796,0.7576395,0.00003408938,0.0002225886,0.0002176457,0.2412004],"study_design_scores_gemma":[0.001304812,0.0001967638,0.00008066962,0.0002430325,0.00004384622,0.0001456129,0.00001985852,0.9904557,0.0003008616,0.0001802756,0.006347666,0.0006808595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004332479,0.0006325388,0.9862902,0.0004343365,0.006331661,0.0009761995,0.000005847435,0.0009220662,0.00007463873],"genre_scores_gemma":[0.8081184,0.0006619347,0.1874116,0.0006410347,0.002289378,0.000427306,0.00001036415,0.0001088565,0.0003310937],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8037859,"threshold_uncertainty_score":0.9996188,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004501525,0.0002966829,0.0003669275,0.0001189967,0.0002445475,0.0003384709,0.001369715,0.0001476153,0.00003395479],"category_scores_gemma":[0.0001240702,0.0003315093,0.0001014667,0.001405969,0.00005564488,0.0002663811,0.000456397,0.0005549071,0.00005636154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001739228,"about_ca_system_score_gemma":0.00002060183,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006697932,"about_ca_topic_score_gemma":0.000006686618,"domain_scores_codex":[0.9972144,0.0001685185,0.0006278629,0.0007289439,0.0002897019,0.0009705151],"domain_scores_gemma":[0.998195,0.0005157088,0.0002333102,0.0008024945,0.00006673126,0.0001867679],"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.000004272357,0.0001217663,0.004127119,0.00001785871,0.00001739625,0.0004395492,0.0004357012,0.3723145,0.00002507735,0.002102613,0.002227434,0.6181667],"study_design_scores_gemma":[0.0005184116,0.00005767775,0.005192597,0.0001313068,0.000005123512,0.00009340924,0.00001786817,0.9914877,0.00001222277,0.0001378047,0.001997197,0.0003487045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0293706,0.001958009,0.9664992,0.000133087,0.0006376585,0.0002248878,0.000004854851,0.0004634301,0.0007082497],"genre_scores_gemma":[0.986253,0.00004016751,0.01323026,0.0001732844,0.0002234402,0.00001017732,0.00002560714,0.00002261321,0.00002146812],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9568824,"threshold_uncertainty_score":0.9999137,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006440566,0.0002966346,0.0003642182,0.000135994,0.000228372,0.0003028955,0.001316257,0.0001628264,0.00001750034],"category_scores_gemma":[0.0000929114,0.0003306158,0.00009936099,0.001871024,0.00004404316,0.0003915566,0.000461747,0.0006083593,0.00003968588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003181608,"about_ca_system_score_gemma":0.00006740359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001571717,"about_ca_topic_score_gemma":0.00003755265,"domain_scores_codex":[0.9971569,0.000191028,0.0006346858,0.0007297429,0.000300781,0.0009868474],"domain_scores_gemma":[0.9983385,0.0004067802,0.0002354363,0.0007401378,0.0000958654,0.0001833197],"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.000005685383,0.00006855497,0.002687123,0.00000539019,0.00001439015,0.00005045407,0.0002026333,0.5636765,0.00004281931,0.001903204,0.00140255,0.4299407],"study_design_scores_gemma":[0.0006123231,0.0000308214,0.01293927,0.000114842,0.000004422171,0.00004213777,0.00001794883,0.9778243,0.00007412168,0.0000881146,0.007904756,0.0003469244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05335906,0.001946977,0.9422755,0.0003649344,0.0004528478,0.0002373486,0.000004680069,0.0007578149,0.0006008605],"genre_scores_gemma":[0.958159,0.00003053924,0.04104399,0.0002277625,0.0004158669,0.000008733304,0.00007236127,0.00002323105,0.00001847501],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9048,"threshold_uncertainty_score":0.9999146,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004687774,0.0002684386,0.0003190484,0.0001375107,0.0001649495,0.0003189252,0.0007367602,0.0001028387,0.000008655714],"category_scores_gemma":[0.0000112448,0.0002477732,0.0000481476,0.0004842664,0.00007980908,0.0003000111,0.0006234138,0.000488687,0.000006312552],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007789599,"about_ca_system_score_gemma":0.00001766092,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007063863,"about_ca_topic_score_gemma":0.00008093825,"domain_scores_codex":[0.9978639,0.0001467689,0.0004358233,0.000665009,0.0002501615,0.0006383226],"domain_scores_gemma":[0.9988164,0.000369314,0.0001656177,0.0004784221,0.00005529714,0.000114916],"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.00004919665,0.0001213997,0.1543256,0.00004423229,0.00003669766,0.0003434867,0.001926365,0.5959694,0.00004461144,0.0009646541,0.0004218466,0.2457525],"study_design_scores_gemma":[0.001132811,0.00006671262,0.005226509,0.0004777249,0.000005985314,0.0001036631,0.00003191039,0.9925586,0.00002357667,0.00001227771,0.00005639785,0.000303861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3288075,0.0001665447,0.6696445,0.0001241958,0.0001901048,0.0001712544,1.839476e-7,0.0001331332,0.0007625906],"genre_scores_gemma":[0.9738443,0.000005513596,0.02427161,0.001620899,0.0002004338,0.000005519287,0.000001078337,0.00002612232,0.00002450522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6453729,"threshold_uncertainty_score":0.9999974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00194526,0.0002089003,0.0003147842,0.0001415029,0.0007919812,0.0002799215,0.00279921,0.0001189552,0.000008288282],"category_scores_gemma":[0.00002754046,0.0001559938,0.00009238734,0.0006925847,0.0005535292,0.000222458,0.0006790684,0.002522863,0.000002281346],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003379983,"about_ca_system_score_gemma":0.00005005781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001323514,"about_ca_topic_score_gemma":0.0002041428,"domain_scores_codex":[0.997886,0.0005594743,0.0006164336,0.0002524481,0.000294903,0.0003907612],"domain_scores_gemma":[0.9955328,0.001873134,0.0004917834,0.001863224,0.0001117704,0.0001272849],"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.00002080171,0.0001706778,0.004044406,0.000003895202,0.00002502096,0.000007673389,0.0003178712,0.009545199,0.0002431612,0.8142272,0.00006908845,0.171325],"study_design_scores_gemma":[0.0003410547,0.00009434001,0.004580488,0.0003807814,0.000005587842,0.00006994793,0.00003565166,0.9815131,0.00004313949,0.01159053,0.001161204,0.0001841293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.838545,0.001406425,0.1473297,0.007869007,0.001286275,0.0003840275,8.852716e-7,0.00007170517,0.003106942],"genre_scores_gemma":[0.9910042,0.002632391,0.005569046,0.0004861394,0.0002634316,0.00001626986,0.000001657812,0.00001955255,0.000007254735],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9719679,"threshold_uncertainty_score":0.9997783,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.007920243,0.0007298769,0.002184749,0.0003226846,0.0003166822,0.0005255141,0.003579207,0.0005304839,0.000001905224],"category_scores_gemma":[0.0003448039,0.0007222398,0.0002379062,0.00137023,0.0001228524,0.0002859236,0.002688595,0.001236384,0.00001734698],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001960001,"about_ca_system_score_gemma":0.0003637082,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001524779,"about_ca_topic_score_gemma":0.00007069858,"domain_scores_codex":[0.9919986,0.003556409,0.001550469,0.001556314,0.0003784471,0.0009597285],"domain_scores_gemma":[0.9914793,0.004480881,0.0009749182,0.002665261,0.0001253151,0.0002743437],"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":[1.157658e-7,0.00003051714,0.00003893531,0.0007920741,0.00003455564,0.00002333564,0.00004172123,0.001939662,5.93234e-9,0.02758246,0.0001874601,0.9693292],"study_design_scores_gemma":[0.000136629,0.00002077899,0.0001070105,0.005947808,0.00005881174,0.00006642478,0.000003296796,0.962039,5.391399e-9,0.0008442942,0.03009003,0.0006859274],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"review","genre_scores_codex":[0.000001286046,0.3953441,0.6032255,0.00002473218,0.000544735,0.0004410124,0.000004664795,0.0002234472,0.0001905184],"genre_scores_gemma":[0.005131789,0.9685564,0.02527709,0.00006554213,0.0005469806,0.00005932932,0.0001900209,0.000105087,0.00006775821],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9686432,"threshold_uncertainty_score":0.9995229,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.01047274,0.0004195865,0.0006460604,0.0001584821,0.0007083142,0.0002901026,0.005914567,0.0002356037,0.00001229004],"category_scores_gemma":[0.0002841099,0.0003686319,0.0001420949,0.001049218,0.0003075307,0.0006598395,0.0006008629,0.0004599032,0.00003402153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001399434,"about_ca_system_score_gemma":0.0003040178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001099122,"about_ca_topic_score_gemma":0.003359802,"domain_scores_codex":[0.993699,0.003568721,0.0008583661,0.0007087989,0.0004121277,0.000752969],"domain_scores_gemma":[0.9880586,0.003792027,0.0006002664,0.006508654,0.0008232711,0.000217238],"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.002527372,0.009712894,0.08405793,0.0003259378,0.001974945,0.00004814041,0.01262402,0.01598203,0.001924812,0.288157,0.04901553,0.5336494],"study_design_scores_gemma":[0.01172188,0.006656163,0.2253014,0.002492189,0.0001891808,0.00006082863,0.0001562683,0.6482372,0.007144196,0.005704362,0.08636935,0.005966969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001949089,0.0001022467,0.9787354,0.00009007873,0.001368206,0.01597112,0.00007355582,0.0004254093,0.001284827],"genre_scores_gemma":[0.870734,0.0001023861,0.09046631,0.000237113,0.0006550201,0.03715599,0.0001720235,0.0001188601,0.0003583175],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8882692,"threshold_uncertainty_score":0.9998766,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003476191,0.0002141225,0.0002197309,0.00005512722,0.0001332511,0.0001082817,0.001145736,0.0001492298,0.00005251471],"category_scores_gemma":[0.00002252156,0.0001946975,0.0001363234,0.0002689769,0.00003710725,0.0004491507,0.0006027268,0.0001773751,0.00003927373],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003925908,"about_ca_system_score_gemma":0.00003231291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001853258,"about_ca_topic_score_gemma":0.000111466,"domain_scores_codex":[0.9983501,0.00001965801,0.0002995796,0.0005815728,0.0001620249,0.0005870446],"domain_scores_gemma":[0.9986672,0.0000801091,0.00009427965,0.0008776051,0.0001125472,0.0001682692],"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.0002570658,0.001936085,0.00135438,0.0002077772,0.0004907142,0.0001088521,0.005109564,0.08009062,0.00979783,0.1248726,0.01565594,0.7601186],"study_design_scores_gemma":[0.0008944459,0.00009565246,0.0004291605,0.0000260999,0.000005849508,0.00001668135,0.00001552288,0.987776,0.000312635,0.0001035956,0.01005029,0.0002740484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008073495,0.0005644488,0.9956734,0.00007935776,0.0006661289,0.0005548637,8.006475e-7,0.0004098852,0.001243791],"genre_scores_gemma":[0.08832537,0.00003753553,0.9095964,0.0008046175,0.0001481493,0.0001885639,0.000002429431,0.00003095239,0.0008659926],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9076854,"threshold_uncertainty_score":0.7939534,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003059083,0.0001351648,0.0001719581,0.00004772791,0.0001863886,0.0002383001,0.0001713167,0.00008534393,0.000003453762],"category_scores_gemma":[0.00001777079,0.0001336058,0.0000165078,0.0001635824,0.0000808529,0.0003214672,0.0001202942,0.0001435207,0.000004148014],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001781353,"about_ca_system_score_gemma":0.00003405306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002777774,"about_ca_topic_score_gemma":0.0001183558,"domain_scores_codex":[0.9988672,0.00007504308,0.0002835051,0.000421691,0.00009822589,0.0002543218],"domain_scores_gemma":[0.9987539,0.000698368,0.00008566311,0.0003427773,0.0000444841,0.00007479778],"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.000001981469,0.0001147898,0.0006909106,0.0000149696,0.000005669312,0.000004036833,0.0003348765,0.00235937,0.0002075162,0.5499867,0.0003229479,0.4459563],"study_design_scores_gemma":[0.0005292796,0.00002393382,0.01638662,0.00004846384,0.000004362149,0.00001484136,0.00003697421,0.9665018,0.0001458286,0.01458475,0.001500717,0.0002223797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.000464008,0.0006200967,0.9869844,0.0009520709,0.00001840684,0.01001367,0.000003557502,0.0001327796,0.0008109832],"genre_scores_gemma":[0.8345359,0.0004116801,0.1170498,0.0001244095,0.0002647482,0.04755056,0.00001078099,0.00001584763,0.00003628671],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9641425,"threshold_uncertainty_score":0.5448287,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002513552,0.0002690972,0.0003215168,0.000075244,0.0001233028,0.0005464054,0.002244925,0.00014496,0.00002122433],"category_scores_gemma":[0.00002004376,0.000272554,0.00007780641,0.001200507,0.00004091793,0.001003574,0.0007509955,0.0004367825,0.00001829265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009851489,"about_ca_system_score_gemma":0.0001015285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003262882,"about_ca_topic_score_gemma":0.00001700467,"domain_scores_codex":[0.997507,0.0001576771,0.0005303498,0.0008015945,0.0003332316,0.0006701226],"domain_scores_gemma":[0.9987564,0.00009830893,0.000224345,0.0006251389,0.00007093343,0.0002248737],"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.000008525453,0.00004689929,0.001788106,0.00002018858,0.000006630396,0.0001150598,0.0003994105,0.4977114,0.00007834355,0.000008535344,0.0001488263,0.499668],"study_design_scores_gemma":[0.0007931173,0.00009254974,0.001386495,0.000074051,0.000003932042,0.00001155212,0.00001150324,0.9941221,0.0004926702,0.00006003845,0.002633943,0.0003179796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01202234,0.000293228,0.9570148,0.00005114133,0.0003936101,0.02992301,0.000001253912,0.0002330684,0.00006754612],"genre_scores_gemma":[0.4952326,0.0000631326,0.398391,0.002516332,0.001756708,0.1018979,0.000002976693,0.000116907,0.00002248415],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5586237,"threshold_uncertainty_score":0.9999726,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00006370671,0.00003665039,0.00003584912,0.00001544032,0.00002367984,0.00004851704,0.0004409085,0.00001797394,0.0002478343],"category_scores_gemma":[0.00000236697,0.00003038406,0.00001716474,0.0001225339,0.000006899996,0.0002791502,0.0001142683,0.00003816041,0.0009062107],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001082215,"about_ca_system_score_gemma":0.00001098864,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002607469,"about_ca_topic_score_gemma":0.00001192674,"domain_scores_codex":[0.9995936,0.00000799684,0.00006021073,0.0001304755,0.00008160152,0.0001261269],"domain_scores_gemma":[0.9995788,0.00001792618,0.00001050665,0.0003382487,0.0000120463,0.00004242303],"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":[2.271173e-7,0.00001729179,0.0001232154,4.038382e-7,0.000001858766,0.000002379016,0.0000537142,0.0006156813,0.0001029605,0.4809399,0.05400999,0.4641323],"study_design_scores_gemma":[0.0001114707,0.00001781987,0.0006635839,0.000001512336,5.091338e-7,0.00001101327,0.000001480434,0.4392304,0.002024165,0.001806839,0.5560324,0.00009879926],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001029101,0.00005084476,0.7996171,0.001828478,0.00009299598,0.00003239829,2.787845e-8,0.0002144336,0.1971347],"genre_scores_gemma":[0.765215,0.00000421908,0.2247663,0.00221818,0.0001886391,0.000005144035,1.458412e-7,0.000002609045,0.007599732],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7641859,"threshold_uncertainty_score":0.9998717,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470032,0.0002271479,0.0002755128,0.00008035741,0.0005108415,0.0003046409,0.002837141,0.0001139619,0.000004746526],"category_scores_gemma":[0.00003356907,0.0002316913,0.00006642626,0.0004753905,0.0001608688,0.0006537405,0.0008699408,0.0003379648,0.00003667906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008173085,"about_ca_system_score_gemma":0.00007343807,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000290816,"about_ca_topic_score_gemma":0.0001714967,"domain_scores_codex":[0.9982415,0.0001587421,0.0005187108,0.0004443304,0.0001739141,0.0004627941],"domain_scores_gemma":[0.9956671,0.0004583703,0.0002571473,0.003243214,0.0002349065,0.0001392829],"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.000009772935,0.0002920522,0.0001291279,0.00004428519,0.00003779035,7.008913e-7,0.000472279,0.006660325,0.0002818939,0.01702623,0.01885014,0.9561954],"study_design_scores_gemma":[0.0005349756,0.00007398782,0.0001752124,0.0001035896,0.000007906474,0.00001359243,0.000005315017,0.6611245,0.00004062299,0.000352271,0.337372,0.000196054],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001671271,0.003255004,0.9762005,0.005296531,0.0001795745,0.01346399,0.000008660707,0.0004103522,0.001018256],"genre_scores_gemma":[0.08828723,0.002184086,0.8571507,0.000931759,0.0008195676,0.04922175,0.00005379467,0.00007396786,0.001277192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9559994,"threshold_uncertainty_score":0.9448097,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001486359,0.000374067,0.0004304666,0.0002233343,0.001367155,0.0001745402,0.001864183,0.000330076,0.000007012584],"category_scores_gemma":[0.00001811439,0.0003894408,0.0001538319,0.0005696506,0.0003970676,0.0004210439,0.00007187924,0.0007582099,0.00001041421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002059459,"about_ca_system_score_gemma":0.00007421067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006401967,"about_ca_topic_score_gemma":0.0004223908,"domain_scores_codex":[0.9971639,0.0003994104,0.0007930526,0.0006997398,0.0002204615,0.0007234462],"domain_scores_gemma":[0.9955224,0.001460985,0.0002995972,0.002172107,0.0002792491,0.0002656052],"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.0002512237,0.003734684,0.00002416213,0.00007161994,0.0005467952,0.000009784711,0.006976735,0.6260011,0.005844863,0.1045238,0.0008126768,0.2512026],"study_design_scores_gemma":[0.0009223277,0.0002320653,0.00009148435,0.00008480417,0.0000411547,0.00003286206,0.0003412233,0.989271,0.007910791,0.000561171,0.0001130302,0.000398034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008555151,0.0002263296,0.9944323,0.002118038,0.0006197689,0.001304734,0.00001060434,0.0003761063,0.00005663868],"genre_scores_gemma":[0.9241698,0.0006608501,0.07385617,0.000431896,0.00005747797,0.0006085175,0.000009808215,0.00004373739,0.0001617025],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9233143,"threshold_uncertainty_score":0.9999329,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005065282,0.0002472603,0.0006667969,0.0001417945,0.0001467058,0.0000786684,0.003629512,0.0002005197,0.00006241788],"category_scores_gemma":[0.00007590924,0.0002611338,0.0001561208,0.0009657562,0.0002427586,0.0008746067,0.0007859696,0.0002609325,0.00004803914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001135162,"about_ca_system_score_gemma":0.0002084805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001249044,"about_ca_topic_score_gemma":0.00001297921,"domain_scores_codex":[0.9952496,0.002257478,0.001234832,0.0004303259,0.0004853927,0.0003424258],"domain_scores_gemma":[0.9920554,0.001006517,0.0009725117,0.005290705,0.0005867426,0.00008808782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000108795,0.002114561,0.05480215,0.0004410666,0.0003435339,0.000001109423,0.002404667,0.01310413,0.8614878,0.03389167,0.0004642664,0.03083623],"study_design_scores_gemma":[0.00427059,0.001255779,0.1112793,0.0008932546,0.000140162,0.000008832815,0.0001077561,0.624869,0.223527,0.0007415022,0.03103607,0.001870797],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6778814,0.0002658791,0.3118145,0.00005781316,0.008160071,0.001220912,0.0000543959,0.0001291064,0.0004160028],"genre_scores_gemma":[0.99639,0.0004422955,0.002192889,0.00002004733,0.0004967555,0.0001064501,0.00016343,0.00002562643,0.0001624629],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6379609,"threshold_uncertainty_score":0.9999841,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003868426,0.0005684349,0.0006943229,0.0005866336,0.0000693753,0.0001853943,0.0009695843,0.0006400255,0.001241589],"category_scores_gemma":[0.00001375461,0.0004959261,0.0001307028,0.0003299921,0.0001343079,0.0003889315,0.0003111065,0.000974031,0.0003302016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002711391,"about_ca_system_score_gemma":0.00005181578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002159223,"about_ca_topic_score_gemma":0.0001474186,"domain_scores_codex":[0.9972324,0.0000633243,0.000482275,0.001133623,0.000508073,0.0005803406],"domain_scores_gemma":[0.9975615,0.0005289553,0.0003131403,0.001320918,0.00008831543,0.0001871962],"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.00002693481,0.00007893422,0.0009191276,0.00002464386,0.00009321734,0.0003751998,0.00006204224,0.003688759,3.646659e-7,0.9567608,0.01273322,0.02523678],"study_design_scores_gemma":[0.003406984,0.001126465,0.005507454,0.001003793,0.00009405748,0.0005452571,0.000004124365,0.8554384,0.000007876065,0.01062838,0.1186599,0.003577398],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00009472297,0.001530866,0.3708948,0.00008596302,0.0005597053,0.0006507817,0.000001881022,0.0002700211,0.6259112],"genre_scores_gemma":[0.3693198,0.00162494,0.01061073,0.0009658035,0.0004493765,0.00009887194,0.00002198813,0.0001853257,0.6167231],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9461324,"threshold_uncertainty_score":0.9997492,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008014291,0.0003103047,0.0004184146,0.0002109037,0.0007491383,0.0004529392,0.002455662,0.0001336529,0.000005324818],"category_scores_gemma":[0.00008493638,0.0002709025,0.0001285323,0.001314234,0.0001290384,0.0004545442,0.0001173496,0.001362788,0.000007988173],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005551279,"about_ca_system_score_gemma":0.000467704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001262378,"about_ca_topic_score_gemma":0.0002901795,"domain_scores_codex":[0.9972651,0.0005446911,0.0006574798,0.0004015951,0.0005026807,0.0006284587],"domain_scores_gemma":[0.9945987,0.001961902,0.0005245475,0.001837892,0.0008468102,0.0002300934],"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.0002191446,0.001391593,0.0002953155,0.000006820927,0.0001077997,0.00002348896,0.0007817633,0.9331604,0.0002154445,0.008968291,0.002891319,0.05193859],"study_design_scores_gemma":[0.001403803,0.0004716692,0.001148719,0.00029627,0.00003487623,0.0001534323,0.00002689341,0.9946576,0.0001167021,0.000251595,0.001106213,0.0003321714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04678576,0.0002512686,0.9466794,0.005146387,0.0001479877,0.0005793343,0.00002184578,0.0001505247,0.000237473],"genre_scores_gemma":[0.8341501,0.0001420683,0.164219,0.000783158,0.0004172164,0.0001803454,0.00005246426,0.00003896054,0.00001663743],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7873644,"threshold_uncertainty_score":0.9999743,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007756594,0.0001753019,0.0002191646,0.0001302482,0.0001190034,0.0001262603,0.000486555,0.0001430585,0.000004143026],"category_scores_gemma":[0.00001282123,0.0001604377,0.00007312681,0.0005203059,0.00001921676,0.0004561604,0.000230496,0.0001628294,0.000008800702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002795793,"about_ca_system_score_gemma":0.00001651906,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002740222,"about_ca_topic_score_gemma":0.001301703,"domain_scores_codex":[0.998338,0.00003664169,0.0004097793,0.0004920063,0.0001780916,0.0005454129],"domain_scores_gemma":[0.9990367,0.0002197696,0.0001139409,0.0004909427,0.00005188134,0.00008670917],"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.00007786671,0.00004256754,0.00007497844,0.00005373773,0.000007722828,0.00001094593,0.0003608019,0.09329348,0.01503345,0.002351115,0.00001937803,0.888674],"study_design_scores_gemma":[0.0007547141,0.0002509775,0.0008278709,0.0001463084,0.000004654754,0.00001929286,0.00027766,0.9100426,0.08589312,0.0001121494,0.00134421,0.0003264273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1823722,0.0007319286,0.8144305,0.00000793211,0.0008950479,0.0007091064,3.235251e-7,0.0002825618,0.0005703968],"genre_scores_gemma":[0.9805522,0.00008844738,0.01871184,0.0000616313,0.0001945292,0.0002494882,0.000001863596,0.00001930854,0.0001206763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8883475,"threshold_uncertainty_score":0.654246,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007995959,0.0001216663,0.0001442017,0.0001129701,0.000055491,0.0001335035,0.0006118043,0.0001216997,0.00002113223],"category_scores_gemma":[0.0001036994,0.0001147694,0.00005974705,0.0003182791,0.00002086641,0.0004391826,0.0001935888,0.0001572675,0.00002982596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005111054,"about_ca_system_score_gemma":0.00004843768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001942741,"about_ca_topic_score_gemma":0.002096896,"domain_scores_codex":[0.9985896,0.00002226643,0.0003397879,0.0003964301,0.0001724272,0.00047954],"domain_scores_gemma":[0.9987171,0.0005274978,0.00006311615,0.0005159794,0.00006898555,0.0001072848],"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.0001480867,0.000230663,0.01081694,0.00004342829,0.00002580944,0.0001925945,0.001397479,0.01807874,0.001480936,0.1284851,0.004234984,0.8348653],"study_design_scores_gemma":[0.0008729557,0.000158929,0.003874956,0.00003126246,0.000003071517,0.000007500454,0.00001873506,0.9793584,0.002143659,0.001934926,0.01132247,0.0002731456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05553247,0.00003826345,0.9413869,0.0005758738,0.000536639,0.0003411589,4.379047e-7,0.0001337478,0.001454548],"genre_scores_gemma":[0.6420421,0.000003588491,0.356603,0.0006756553,0.0003094822,0.00001740278,0.000001732677,0.000009955631,0.0003371434],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9612796,"threshold_uncertainty_score":0.4680162,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009378385,0.000367154,0.0004726279,0.0003216291,0.0003060103,0.0004141107,0.001595684,0.0001959942,0.00001946906],"category_scores_gemma":[0.0001135191,0.0003478097,0.0002143592,0.002071954,0.00002668608,0.0005689092,0.0003319176,0.000304204,0.00001899155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001577117,"about_ca_system_score_gemma":0.00008450118,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005936728,"about_ca_topic_score_gemma":0.0000655304,"domain_scores_codex":[0.9968168,0.00005465699,0.0006024176,0.001004556,0.0004008097,0.00112077],"domain_scores_gemma":[0.9977447,0.0005774745,0.000195156,0.0009397089,0.0001683439,0.0003745992],"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.00003152526,0.000335959,0.0002526926,0.00001117745,0.00008001605,0.00002408357,0.0007428885,0.05179102,0.0006309411,0.1725165,0.004225283,0.7693579],"study_design_scores_gemma":[0.001066856,0.0001899044,0.001111093,0.00004254822,0.00001964985,0.00003846317,0.00003280719,0.9953166,0.0003627487,0.00008567601,0.001274911,0.0004587519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003131758,0.0001563689,0.9930624,0.0005848157,0.0006771171,0.000887902,0.00000252634,0.0004858771,0.001011249],"genre_scores_gemma":[0.5692891,0.00000893273,0.4285086,0.001458046,0.0002987375,0.0000591703,0.000003609388,0.00002099485,0.0003527156],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9435256,"threshold_uncertainty_score":0.9998974,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008941613,0.0003173175,0.0004032118,0.0001767085,0.0007797714,0.0002766262,0.001434988,0.00015662,0.0000048757],"category_scores_gemma":[0.000006658632,0.0003021856,0.00006985544,0.001025008,0.0002104821,0.0003311778,0.0003821502,0.0005871076,0.000001589704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009578805,"about_ca_system_score_gemma":0.0001169212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002238648,"about_ca_topic_score_gemma":0.00006914877,"domain_scores_codex":[0.9974416,0.0006044453,0.0005325013,0.0006109594,0.0002469294,0.0005635649],"domain_scores_gemma":[0.9969322,0.0005745377,0.0002425287,0.001942437,0.0001356225,0.0001726794],"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.00002120734,0.0003797046,0.002206151,0.0000480795,0.00002941366,0.00001798606,0.001408196,0.2524227,0.0003982317,0.02535493,0.00002988615,0.7176835],"study_design_scores_gemma":[0.00113402,0.000132531,0.0009037473,0.0005960471,0.00001392103,0.00004388656,0.0001992367,0.9942476,0.0001965959,0.00006355908,0.002079198,0.0003897077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1227669,0.006303963,0.8692278,0.0003574184,0.00006643692,0.0006198342,9.71625e-7,0.0002187774,0.0004378807],"genre_scores_gemma":[0.8710636,0.00118949,0.1273654,0.0001794645,0.00001916693,0.0001155189,0.00002099387,0.00003325304,0.00001311758],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7482967,"threshold_uncertainty_score":0.999943,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005045452,0.0002910772,0.0003941824,0.000122617,0.0002404005,0.0002538971,0.001184956,0.0001831693,0.0000126887],"category_scores_gemma":[0.00006626553,0.0003256251,0.0000968609,0.001033682,0.00009221653,0.0001957992,0.0004991091,0.0004995351,0.0000179728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001785914,"about_ca_system_score_gemma":0.00006764897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001494608,"about_ca_topic_score_gemma":0.00003206961,"domain_scores_codex":[0.997155,0.0001896915,0.0006933087,0.000723224,0.0002114059,0.001027392],"domain_scores_gemma":[0.9983964,0.0005409358,0.0002424986,0.000637137,0.00007370741,0.0001093285],"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.000005359635,0.0000713549,0.008630696,0.000007831039,0.000007190398,0.0002700729,0.00005287826,0.9397498,0.00003468039,0.0146795,0.0008861814,0.03560446],"study_design_scores_gemma":[0.0005027802,0.00005635967,0.01872953,0.00006218703,0.000005504563,0.0001342372,0.00001408247,0.9787828,0.00004476993,0.00040187,0.0009413497,0.000324527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1039132,0.0003505936,0.893603,0.0001002959,0.0006577318,0.0001874291,0.000004814622,0.000355981,0.0008269847],"genre_scores_gemma":[0.9701331,0.000002439115,0.02908119,0.00008153415,0.0005731522,0.00001020216,0.00008130982,0.00001956332,0.0000175081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8662199,"threshold_uncertainty_score":0.9999196,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0106813,0.0002424408,0.0006591594,0.0004872975,0.0001433907,0.0000532595,0.005988066,0.0002152653,0.00003264172],"category_scores_gemma":[0.000190166,0.0002716986,0.0001791324,0.004170659,0.0005268123,0.000608646,0.0006369739,0.0003443067,0.00001395445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005886063,"about_ca_system_score_gemma":0.0002852997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001736006,"about_ca_topic_score_gemma":0.01023389,"domain_scores_codex":[0.9921481,0.005182995,0.001434558,0.0004502503,0.0004069792,0.000377135],"domain_scores_gemma":[0.9890759,0.002870179,0.0008678638,0.006150707,0.0009205044,0.0001148507],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001656488,0.0107662,0.4025395,0.0002833853,0.0005645155,0.000004967354,0.006308519,0.02683152,0.003021682,0.2105711,0.001852833,0.3370902],"study_design_scores_gemma":[0.002507538,0.0005320197,0.9188558,0.0002915876,0.00007934478,0.000002389855,0.0001067955,0.0525304,0.002968169,0.01165285,0.009244672,0.001228464],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008631346,0.008484576,0.9798456,0.00001499795,0.000771279,0.001311076,0.00007048006,0.0001149842,0.0007557013],"genre_scores_gemma":[0.9373515,0.00197303,0.0593583,0.00002458442,0.00004464289,0.001132908,0.00008149912,0.00002746444,0.000006063184],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9287202,"threshold_uncertainty_score":0.9999735,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008566121,0.0001380306,0.0002262217,0.00005437008,0.00004350951,0.00004760317,0.0005426109,0.00009169037,0.00002855117],"category_scores_gemma":[0.0001024564,0.0001299453,0.00005617601,0.0005896525,0.00002595239,0.0002369507,0.0001770856,0.0002248446,0.00001161754],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008771721,"about_ca_system_score_gemma":0.00007737778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005001808,"about_ca_topic_score_gemma":0.0001914725,"domain_scores_codex":[0.9984296,0.0001227975,0.0003762559,0.0003724846,0.0002503804,0.0004484833],"domain_scores_gemma":[0.9989601,0.0002049106,0.0001258478,0.0005713105,0.00005984948,0.00007798838],"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.00001406973,0.0002263325,0.0622316,0.00003006044,0.00002129307,0.00005390492,0.003417571,0.3054632,0.0005150704,0.07350498,0.0008886955,0.5536332],"study_design_scores_gemma":[0.0004677934,0.00003556229,0.001985002,0.00006310199,0.000001710774,0.000009390599,0.00007243818,0.9944095,0.0004281214,0.0002033558,0.002150514,0.0001734863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02521169,0.000798055,0.9655721,0.0000284462,0.0002451271,0.0001542512,7.71815e-8,0.0001042985,0.007885945],"genre_scores_gemma":[0.9257268,0.00004202262,0.07359583,0.0001905013,0.00002905433,0.000008935363,2.702408e-7,0.00001057403,0.0003960421],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9005151,"threshold_uncertainty_score":0.5299016,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006180711,0.0002423251,0.0003056743,0.0001710972,0.000377701,0.0001207716,0.002765916,0.0001861232,0.00001771866],"category_scores_gemma":[0.000007373361,0.0002581297,0.000161024,0.0006740877,0.0001528556,0.0003142032,0.00003341652,0.0006687688,0.00001162337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045862,"about_ca_system_score_gemma":0.00004670849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000157426,"about_ca_topic_score_gemma":0.000408107,"domain_scores_codex":[0.9979693,0.0004019442,0.0004676636,0.0005005894,0.0002122747,0.0004482089],"domain_scores_gemma":[0.9950776,0.001148049,0.0001374473,0.003414087,0.0001021424,0.0001206405],"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.00006706797,0.001934,0.00001406991,0.00005270475,0.00006915324,4.175826e-7,0.003807802,0.2057655,0.0001297232,0.06072804,0.0002197016,0.7272118],"study_design_scores_gemma":[0.0007348451,0.0002731444,0.00001190341,0.00005984208,0.00001918581,0.000002875845,0.00008489336,0.9905765,0.0009424181,0.002732487,0.004283673,0.0002782524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003036295,0.0008077021,0.9928967,0.0003817867,0.0002599633,0.001198736,0.000008818088,0.0002046889,0.001205353],"genre_scores_gemma":[0.9586764,0.00257818,0.03491068,0.0004289603,0.00002692581,0.00324125,0.0000167185,0.00002820274,0.0000927158],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.957986,"threshold_uncertainty_score":0.9999871,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006609596,0.0007136679,0.0007372464,0.0005374499,0.0008530807,0.0002010601,0.001800078,0.001002595,0.00008511452],"category_scores_gemma":[0.00002762797,0.000742963,0.0004628454,0.002873067,0.0002883952,0.0002763776,0.0000942641,0.003169764,0.00006425377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002117558,"about_ca_system_score_gemma":0.00007842782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002082897,"about_ca_topic_score_gemma":0.0001491717,"domain_scores_codex":[0.9945686,0.0004306301,0.00104766,0.001517165,0.0007599665,0.001675999],"domain_scores_gemma":[0.9953468,0.001097748,0.0002935543,0.002689873,0.000158675,0.000413298],"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.0000593839,0.0003489727,0.002703103,0.000006907404,0.00006442016,0.0003150998,0.0002669613,0.9651822,0.00001923409,0.0003104677,0.0001464214,0.03057687],"study_design_scores_gemma":[0.001255092,0.0001404906,0.0112589,0.000169969,0.00003034165,0.000240633,0.00004320223,0.9855744,0.00005028069,0.00004577792,0.0004206681,0.0007702436],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.199,0.0002768901,0.7971615,0.0004410837,0.001561406,0.0006567597,0.000004336046,0.0005841696,0.0003138268],"genre_scores_gemma":[0.9840518,0.0006374057,0.01322728,0.001062507,0.0005350208,0.0001100153,0.000009249011,0.00009895962,0.0002677479],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7850518,"threshold_uncertainty_score":0.9995021,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617055,0.0002055239,0.0003638151,0.00006671003,0.0001623677,0.0000672536,0.001037727,0.00008770722,0.00003602631],"category_scores_gemma":[0.00001518421,0.000178824,0.00009116893,0.0005141237,0.00002212289,0.0003850054,0.0003541892,0.0001770426,0.000007428885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000349355,"about_ca_system_score_gemma":0.00001123884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001260322,"about_ca_topic_score_gemma":0.00004041928,"domain_scores_codex":[0.998072,0.0001204217,0.000482332,0.000561649,0.0002717215,0.0004918998],"domain_scores_gemma":[0.99823,0.0004366419,0.0002177619,0.0008811848,0.0001390803,0.00009530977],"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.00001232739,0.0005744233,0.00201253,0.00001982946,0.00003446133,0.000002478375,0.003091197,0.1092953,0.00004415822,0.0003993395,0.0005007598,0.8840132],"study_design_scores_gemma":[0.001095652,0.001103155,0.0006113591,0.0000255909,0.00001314003,0.000005100474,0.0003477575,0.9956829,0.0001648722,0.000008971828,0.0007311224,0.0002103634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2466411,0.0004221745,0.7507978,0.0000115164,0.0002431819,0.001225328,5.345865e-7,0.0001522251,0.0005061101],"genre_scores_gemma":[0.8315235,0.000104522,0.1672796,0.00007135161,0.00008100361,0.0004503612,6.173463e-7,0.00001824467,0.0004707929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8863876,"threshold_uncertainty_score":0.7292231,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}