{"meta":{"query_hash":"378dac038a7f","filters":{"topic":"Mobile Ad Hoc Networks"},"cohort_total":1382,"direct_labels_cover":2,"predictions_cover":1382,"exported":1382,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/378dac038a7f","api":"https://metacan.xera.ac/api/v1/cohort?topic=Mobile+Ad+Hoc+Networks"},"results":[{"id":"W1022174637","doi":"10.5120/21690-4795","title":"SCIDR: A Scalable Cluster based Inter-Domain Routing Protocol for Heterogeneous MANET","year":2015,"lang":"en","type":"article","venue":"International Journal of Computer Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ontario Council on Graduate Studies, Council of Ontario Universities","keywords":"Computer science; Scalability; Computer network; Cluster (spacecraft); Mobile ad hoc network; Routing protocol; Protocol (science); Domain (mathematical analysis); Routing (electronic design automation); Distributed computing; Database; Medicine","score_opus":0.029664864533171218,"score_gpt":0.3212313130644325,"score_spread":0.29156644853126124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1022174637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048418734,0.002368779,0.92172337,0.000806705,0.00069860916,0.001267289,0.0006425801,0.0076569607,0.016416918],"genre_scores_gemma":[0.67522585,0.0015502691,0.30942014,0.00070083124,0.0001962703,0.00094947015,0.0019938955,0.00021321709,0.009750054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955565,0.0001001584,0.000031877287,0.00006542591,0.00018416031,0.00006257164],"domain_scores_gemma":[0.99951744,0.00007957394,0.000066498564,0.00011328585,0.00016062701,0.00006257331],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000702412,0.00044544705,0.0005348516,0.00086534914,0.00084373663,0.00064509903,0.0015095875,0.00049446087,0.001142332],"category_scores_gemma":[0.0010812476,0.00014463464,0.0004067322,0.00087198574,0.0003765993,0.00096254307,0.0016831774,0.0009057489,0.0005327805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079262024,0.00036575264,0.002112883,0.00089784764,0.00028533646,0.0013498716,0.0005932846,0.20436294,0.107637405,0.06557363,0.06790267,0.5481257],"study_design_scores_gemma":[0.00022890848,0.00096644845,0.0015665672,0.00006828931,0.00014931726,0.0016047967,0.00032886755,0.85733765,0.033848293,0.015736554,0.08796802,0.00019630023],"about_ca_topic_score_codex":0.0016492099,"about_ca_topic_score_gemma":0.0022166555,"teacher_disagreement_score":0.0016492099,"about_ca_system_score_codex":0.0005927283,"about_ca_system_score_gemma":0.001362673,"threshold_uncertainty_score":0.0043005347},"labels":[],"label_agreement":null},{"id":"W1025245949","doi":"10.1007/978-0-387-33112-6_4","title":"Promoting Identity-Based Key Management in Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Vehicular ad hoc network; Ad hoc wireless distribution service; Key management; Wireless network; Computer security; Wireless; Key (lock); Identity management; Optimized Link State Routing Protocol; Distributed computing; Cryptography; Authentication (law); Telecommunications","score_opus":0.019022732127945148,"score_gpt":0.25816287681711114,"score_spread":0.239140144689166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1025245949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009239107,0.014079186,0.90834737,0.002161336,0.0014686218,0.00016813226,0.000043398984,0.0006856852,0.06380714],"genre_scores_gemma":[0.39198333,0.041639138,0.4809912,0.0010367846,0.003012326,0.00042377907,0.00027685805,0.0004025206,0.08023403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99847466,0.0005814957,0.0000686053,0.0001390675,0.00056290283,0.00017335048],"domain_scores_gemma":[0.99776864,0.0011545233,0.00013691673,0.0005213708,0.0003106734,0.000107898275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019302462,0.0008760231,0.0006195968,0.00094677653,0.0012460081,0.002649485,0.0014810341,0.0015374597,0.0038520247],"category_scores_gemma":[0.0050310674,0.0006220695,0.00029860655,0.0017343675,0.001955355,0.009760228,0.0039673676,0.0033244528,0.0032056493],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010358255,0.00014336084,0.00040950096,0.000453718,0.000015153052,0.00020016238,0.0007139137,0.0075184302,0.010104374,0.64520454,0.018943993,0.31618935],"study_design_scores_gemma":[0.00005260238,0.0002009506,0.0004192332,0.000390198,0.000060341084,0.0015055436,0.00048317848,0.11441703,0.02319417,0.601834,0.25736123,0.00008149741],"about_ca_topic_score_codex":0.00027474685,"about_ca_topic_score_gemma":0.00025539208,"teacher_disagreement_score":0.0038520247,"about_ca_system_score_codex":0.0006881062,"about_ca_system_score_gemma":0.0007725323,"threshold_uncertainty_score":0.012886345},"labels":[],"label_agreement":null},{"id":"W108571205","doi":"","title":"Split agent-based routing in interconnected networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Computer network; Distributed computing; Hierarchical routing; Static routing; Routing (electronic design automation); Policy-based routing; Routing table; Source routing; Quality of service; Routing protocol; Dynamic Source Routing","score_opus":0.06524714825460248,"score_gpt":0.35041425723549785,"score_spread":0.28516710898089537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108571205","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015902461,0.61546075,0.27313137,0.008230505,0.005236794,0.00023860313,0.000086784756,0.00036472085,0.08134808],"genre_scores_gemma":[0.17627984,0.6518745,0.11974225,0.0012191451,0.009725946,0.00025975076,0.0003284948,0.00020542118,0.040364563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949455,0.000118281016,0.000036100035,0.00011066834,0.00019340978,0.000047048306],"domain_scores_gemma":[0.9986802,0.0007159116,0.00006287696,0.00007661638,0.00037501322,0.00008935988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001407256,0.0007375941,0.0006692663,0.0011747769,0.000575625,0.00256695,0.00082603085,0.0015868585,0.003305802],"category_scores_gemma":[0.0023396816,0.0006381937,0.0004707037,0.003251672,0.0014476101,0.0023730902,0.00077955326,0.0018200376,0.0009571175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012551394,0.00035580446,0.0012042772,0.002108684,0.0001189434,0.0005312963,0.0006658298,0.06934699,0.0030502244,0.34585494,0.03245746,0.54418004],"study_design_scores_gemma":[0.00007498435,0.00044578296,0.0016877886,0.0013158402,0.0001067309,0.0011973522,0.0005491796,0.17671946,0.0025212476,0.24572606,0.5695579,0.00009781856],"about_ca_topic_score_codex":0.0020644846,"about_ca_topic_score_gemma":0.0010616194,"teacher_disagreement_score":0.003305802,"about_ca_system_score_codex":0.001136104,"about_ca_system_score_gemma":0.0010667238,"threshold_uncertainty_score":0.011058986},"labels":[],"label_agreement":null},{"id":"W1104986043","doi":"10.1007/978-3-642-36071-8_7","title":"Trust Based Secure Gateway Discovery Mechanism for Integrated Internet and MANET","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Environmental Studies Association of Canada","funders":"","keywords":"Computer science; Computer network; The Internet; Mobile ad hoc network; Node (physics); Network packet; Computer security; Routing protocol; Distributed computing; World Wide Web","score_opus":0.010427792485565636,"score_gpt":0.21475266501823406,"score_spread":0.20432487253266843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1104986043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098788805,0.0017791705,0.8808357,0.0007431359,0.00052771735,0.0003349458,0.0001854993,0.0047894744,0.012015519],"genre_scores_gemma":[0.8899769,0.0005894745,0.09715805,0.00016008691,0.00014065136,0.00011952315,0.00032725994,0.00009225426,0.011435803],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999134,0.00012401534,0.000095922056,0.00014753839,0.00034346848,0.0001550316],"domain_scores_gemma":[0.9986908,0.00025051064,0.00018346112,0.00046371753,0.00030126885,0.00011024345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010843839,0.00036016488,0.0007434063,0.00087164756,0.00091420073,0.0014493038,0.0016735626,0.0011442024,0.0019585544],"category_scores_gemma":[0.0018417132,0.00034743888,0.00044125083,0.0007719436,0.0005467036,0.002889386,0.0023505779,0.0014941877,0.0007524911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025568756,0.00083466363,0.0045136767,0.0006402967,0.0003293346,0.002611236,0.0012764137,0.057850514,0.12338917,0.2606745,0.028054122,0.5172692],"study_design_scores_gemma":[0.00024243047,0.00085653673,0.0023784,0.000097808035,0.00038897988,0.0036147672,0.00032777264,0.7670456,0.08746779,0.08794511,0.049438246,0.00019655662],"about_ca_topic_score_codex":0.0006799168,"about_ca_topic_score_gemma":0.0007111497,"teacher_disagreement_score":0.0019585544,"about_ca_system_score_codex":0.0007096958,"about_ca_system_score_gemma":0.0008695459,"threshold_uncertainty_score":0.006551981},"labels":[],"label_agreement":null},{"id":"W120728763","doi":"10.1007/978-3-642-30904-5_6","title":"Security Issues in Link State Routing Protocols for MANETs","year":2012,"lang":"en","type":"book-chapter","venue":"Mathematics in industry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimized Link State Routing Protocol; Link-state routing protocol; Computer network; Computer science; Zone Routing Protocol; Wireless Routing Protocol; Routing protocol; Distributed computing; Ad hoc wireless distribution service; Dynamic Source Routing; Multipath routing; Routing (electronic design automation)","score_opus":0.053769312868411016,"score_gpt":0.3203128065659654,"score_spread":0.26654349369755437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W120728763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016942237,0.11799263,0.5931468,0.02230503,0.008418191,0.0003005206,0.00024480524,0.00074629235,0.23990354],"genre_scores_gemma":[0.38108417,0.18636417,0.21638617,0.0041532395,0.01104163,0.000773325,0.0007528183,0.0006948382,0.19874959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988385,0.00031300995,0.00008084829,0.00011355708,0.00057009247,0.00008399598],"domain_scores_gemma":[0.9973394,0.0019725529,0.00010253541,0.00027531642,0.00026311845,0.00004712166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001719333,0.0011156024,0.0007464169,0.0010579323,0.00145095,0.0043191174,0.0011815154,0.0021514988,0.0066803475],"category_scores_gemma":[0.0060744723,0.00093532127,0.000628832,0.0022256018,0.0024110933,0.009394733,0.0018547914,0.0050331326,0.0023640213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061298546,0.000045095767,0.000101752594,0.00051731506,0.000025445332,0.0002326017,0.00045662097,0.013202697,0.0020678467,0.84167606,0.025362985,0.11625037],"study_design_scores_gemma":[0.000016521468,0.000052522944,0.00008569987,0.00031520263,0.0000382622,0.00048211167,0.00018059801,0.026996654,0.001753226,0.8132216,0.15682995,0.000027646045],"about_ca_topic_score_codex":0.00053860183,"about_ca_topic_score_gemma":0.0004265196,"teacher_disagreement_score":0.0066803475,"about_ca_system_score_codex":0.0013839449,"about_ca_system_score_gemma":0.0007396388,"threshold_uncertainty_score":0.022347987},"labels":[],"label_agreement":null},{"id":"W122318060","doi":"10.1007/978-1-4614-6602-4_2","title":"Literature Review and Background","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Wireless network; Computer science; Quality of service; Wireless; Provisioning; Wireless WAN; Wi-Fi array; Heterogeneous network; Hop (telecommunications); Service set; Telecommunications","score_opus":0.01708227881144181,"score_gpt":0.23875862278798737,"score_spread":0.22167634397654556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W122318060","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025641356,0.9832109,0.00028230334,0.0042177136,0.0016771641,0.00006492796,0.0013201532,0.000025883939,0.008944499],"genre_scores_gemma":[0.0019029563,0.9868954,0.0006813893,0.0037282761,0.002152705,0.00010598569,0.0011468783,0.000021321135,0.0033650668],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981134,0.0004416883,0.00043708566,0.0003342529,0.00048809836,0.00018559725],"domain_scores_gemma":[0.9887912,0.0066526737,0.0013598152,0.00021198772,0.0026092809,0.0003751528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002712607,0.0013508552,0.0026527303,0.032977477,0.0014362924,0.004896246,0.0018858704,0.0023904059,0.062491782],"category_scores_gemma":[0.01598278,0.0006704831,0.0015334236,0.03478427,0.001683461,0.005040727,0.0022355819,0.0018136555,0.015321081],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017489307,0.00010482116,0.0009808016,0.13107494,0.00019327115,0.00058536965,0.0006390097,0.0002006714,0.0003266866,0.0115645565,0.30061758,0.5535374],"study_design_scores_gemma":[0.00001679248,0.00004648644,0.0010632742,0.09485285,0.00039393446,0.00089780183,0.000631093,0.00003668777,0.0001210166,0.003447615,0.898462,0.00003046583],"about_ca_topic_score_codex":0.005843547,"about_ca_topic_score_gemma":0.010791748,"teacher_disagreement_score":0.062491782,"about_ca_system_score_codex":0.0022388988,"about_ca_system_score_gemma":0.011592526,"threshold_uncertainty_score":0.20905584},"labels":[],"label_agreement":null},{"id":"W129298735","doi":"10.1007/978-3-540-39611-6_4","title":"On-demand Routing in MANETs: The Impact of a Realistic Physical Layer Model","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Layer (electronics); Routing (electronic design automation); Physical layer; Computer network; Distributed computing; Telecommunications; Wireless","score_opus":0.020117833602280377,"score_gpt":0.2748774028256888,"score_spread":0.2547595692234084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W129298735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29391444,0.008736606,0.61481637,0.0059741056,0.0015596955,0.00019439809,0.0008181134,0.00060602697,0.0733803],"genre_scores_gemma":[0.9621819,0.0036411833,0.022650618,0.00031260724,0.00030305353,0.00006270131,0.00018763727,0.00015340088,0.0105069885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988525,0.00052023755,0.000027533823,0.00012242256,0.0003230173,0.00015430493],"domain_scores_gemma":[0.99704844,0.00211692,0.00016805137,0.0002931413,0.00026964856,0.000103791564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013794255,0.0008148227,0.0012667364,0.00041853925,0.000682903,0.0020287992,0.0021819263,0.0019939807,0.0027978003],"category_scores_gemma":[0.006382905,0.00095761917,0.0005735469,0.00088423846,0.0010183665,0.0047954014,0.0010784761,0.0014199499,0.00039894378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006132148,0.000059303973,0.00015681914,0.000059676036,0.000014586008,0.000067348024,0.000027120748,0.97035944,0.0007108602,0.022995371,0.0013126945,0.00417543],"study_design_scores_gemma":[0.000007500938,0.000018823952,0.000052157233,0.0000071284667,0.000008037506,0.000028691771,0.0000118015205,0.99215204,0.000114118346,0.0072316597,0.0003618453,0.0000062571576],"about_ca_topic_score_codex":0.004559558,"about_ca_topic_score_gemma":0.00474429,"teacher_disagreement_score":0.004559558,"about_ca_system_score_codex":0.001761894,"about_ca_system_score_gemma":0.0007601184,"threshold_uncertainty_score":0.012783527},"labels":[],"label_agreement":null},{"id":"W131214474","doi":"","title":"Anomaly Detection Scheme for Routing Intrusions on Mobile Ad Hoc Networks.","year":2009,"lang":"en","type":"article","venue":"International Conference on Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Adaptive quality of service multi-hop routing; Computer network; Intrusion detection system; Optimized Link State Routing Protocol; Scheme (mathematics); Anomaly detection; Ad hoc wireless distribution service; Routing (electronic design automation); Routing protocol; Computer security; Data mining; Telecommunications; Mathematics; Wireless","score_opus":0.02314366307888726,"score_gpt":0.27831444540738465,"score_spread":0.2551707823284974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W131214474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09397643,0.0010092625,0.897225,0.000575829,0.0005870566,0.00029174762,0.00018178517,0.0044796006,0.0016731957],"genre_scores_gemma":[0.8226897,0.00031960508,0.1743415,0.00016602453,0.00021040234,0.00014897893,0.00033849612,0.000054615735,0.0017307083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804795,0.00044170293,0.00021571384,0.00028639316,0.00079270045,0.00021546075],"domain_scores_gemma":[0.99352527,0.0020855884,0.0006214431,0.0012852862,0.0021240779,0.0003583401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024883258,0.0005842583,0.0014975036,0.0024297743,0.0011895162,0.0009493587,0.0021966489,0.0011334249,0.0009138493],"category_scores_gemma":[0.0073468,0.00023377602,0.00046094783,0.0012493078,0.0008054782,0.0027057906,0.0015496115,0.001593315,0.00039508543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023262699,0.0006652057,0.013971728,0.00026308117,0.00037221788,0.0006495766,0.0003972274,0.059629142,0.070159934,0.024238396,0.0116927475,0.8156345],"study_design_scores_gemma":[0.00012397941,0.0008774164,0.002250707,0.000023282113,0.00013389003,0.0012077087,0.00012573978,0.948524,0.028273167,0.013491738,0.0048926366,0.000075643395],"about_ca_topic_score_codex":0.0011022452,"about_ca_topic_score_gemma":0.0010126637,"teacher_disagreement_score":0.0024883258,"about_ca_system_score_codex":0.00095105934,"about_ca_system_score_gemma":0.0009638003,"threshold_uncertainty_score":0.013159692},"labels":[],"label_agreement":null},{"id":"W141706559","doi":"10.1007/978-1-4614-6357-3_3","title":"Routing for Wireless Multi-Hop Networks: Distinguishing Features","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Link-state routing protocol; Dynamic Source Routing; Policy-based routing; Static routing; Computer network; Multipath routing; Distributed computing; Geographic routing; Wireless Routing Protocol; Routing protocol; Routing (electronic design automation)","score_opus":0.020669131317336633,"score_gpt":0.24921323213115446,"score_spread":0.22854410081381782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141706559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015607665,0.090229355,0.6553697,0.0060878606,0.0041945293,0.00021178075,0.0003061382,0.0013254842,0.2266674],"genre_scores_gemma":[0.33781227,0.12585416,0.40065327,0.00271155,0.008877113,0.0004134255,0.00066023006,0.00081230677,0.1222057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.00006115016,0.000017205399,0.00007155856,0.0001396625,0.000023202392],"domain_scores_gemma":[0.9993513,0.00035897765,0.00004321699,0.00010993806,0.000096056625,0.00004045564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037870757,0.0007115514,0.00052388303,0.00060399773,0.0004375033,0.002280542,0.001037734,0.0013178079,0.0030945837],"category_scores_gemma":[0.0015236948,0.00034688268,0.00041334625,0.0015145636,0.0011202493,0.004175684,0.0013259294,0.0018720147,0.0015920526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004465339,0.000056576948,0.00024677435,0.0007266991,0.000015038523,0.00018717698,0.00026247682,0.0046132123,0.007782076,0.6626222,0.017900415,0.30554265],"study_design_scores_gemma":[0.000019513504,0.00017104555,0.0009188231,0.00024074143,0.000048162776,0.003490354,0.00020314322,0.030621305,0.0042382595,0.5792866,0.38070574,0.000056334407],"about_ca_topic_score_codex":0.00020920997,"about_ca_topic_score_gemma":0.00027443006,"teacher_disagreement_score":0.0030945837,"about_ca_system_score_codex":0.00035710307,"about_ca_system_score_gemma":0.00042611768,"threshold_uncertainty_score":0.010352433},"labels":[],"label_agreement":null},{"id":"W146461228","doi":"","title":"On the Robustness of Simple Indoor MANET Simulation Models.","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Robustness (evolution); Mobility model; Routing protocol; Soundness; Computer network; Simple (philosophy); Node (physics); Mobile ad hoc network; Radio propagation; Radio propagation model; Routing (electronic design automation); Telecommunications","score_opus":0.027590905521168337,"score_gpt":0.2587814725777786,"score_spread":0.23119056705661029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W146461228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63811696,0.0012814659,0.3443361,0.0017628577,0.00034820053,0.0006630245,0.00086410926,0.0016091095,0.011018191],"genre_scores_gemma":[0.9651136,0.00026091182,0.0334359,0.00017771189,0.00004084591,0.00013944856,0.00030104694,0.00010206528,0.00042843824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99122566,0.006300048,0.0003929251,0.0004910552,0.0012567093,0.00033368688],"domain_scores_gemma":[0.88948524,0.090540364,0.005754806,0.009799539,0.0038144507,0.0006055104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012094612,0.0010442233,0.0008831144,0.0010324985,0.00072372006,0.0014986657,0.0016708276,0.0014038193,0.0011150817],"category_scores_gemma":[0.09830579,0.00070768985,0.0009371659,0.00073686097,0.0016355639,0.002554494,0.0018481824,0.0017546946,0.0002529824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037475326,0.00013808429,0.0060117412,0.00011961395,0.00018897676,0.00011069987,0.0001265471,0.977803,0.002326085,0.006420889,0.0004815726,0.005898098],"study_design_scores_gemma":[0.00003805482,0.00025942954,0.0007606186,0.00004291258,0.0000810004,0.00006375159,0.000050550647,0.99089545,0.0024395778,0.0047528646,0.00058817124,0.000027567701],"about_ca_topic_score_codex":0.005384928,"about_ca_topic_score_gemma":0.0027493774,"teacher_disagreement_score":0.012094612,"about_ca_system_score_codex":0.001365446,"about_ca_system_score_gemma":0.000776461,"threshold_uncertainty_score":0.063963234},"labels":[],"label_agreement":null},{"id":"W1484282256","doi":"10.5555/954014.954040","title":"The use of mobile agents for clustering in mobile ad hoc networks","year":2003,"lang":"en","type":"article","venue":"South African Institute of Computer Scientists and Information Technologists","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Distributed computing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Adaptive quality of service multi-hop routing; Link-state routing protocol; Static routing; Optimized Link State Routing Protocol; Triangular routing; Policy-based routing; Wireless ad hoc network; Mobile ad hoc network; Cluster analysis; Routing protocol; Routing (electronic design automation); Wireless; Artificial intelligence; Telecommunications","score_opus":0.02021849445160362,"score_gpt":0.2307565498946989,"score_spread":0.21053805544309528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484282256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005245338,0.009660496,0.97804296,0.00069743017,0.00041036008,0.00016786177,0.000031362368,0.00056394254,0.0051801708],"genre_scores_gemma":[0.19619231,0.011957886,0.7842312,0.00044915444,0.0006034853,0.0003872781,0.00015286762,0.00017429184,0.0058515994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884075,0.0005042694,0.0000734993,0.00014408304,0.00039194486,0.000045496956],"domain_scores_gemma":[0.9991738,0.00035318383,0.0001326073,0.00015004838,0.00014851936,0.000041833922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007696643,0.00089338265,0.0007460294,0.0009276426,0.0008293311,0.0014527501,0.0014694248,0.0016749599,0.0010903287],"category_scores_gemma":[0.002757583,0.0004660288,0.00045563566,0.0016436941,0.001448032,0.0019950182,0.00107651,0.0015146602,0.0010165912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016835696,0.00011770799,0.001221174,0.0009686389,0.00025923294,0.00062157225,0.00050037657,0.22987767,0.02571036,0.26575974,0.010549402,0.46424583],"study_design_scores_gemma":[0.00008854806,0.0004543858,0.0010171471,0.00026357704,0.00018328537,0.0014746712,0.00016017842,0.6364778,0.022826878,0.1532905,0.18359408,0.00016893593],"about_ca_topic_score_codex":0.0008827683,"about_ca_topic_score_gemma":0.0011598599,"teacher_disagreement_score":0.0016749599,"about_ca_system_score_codex":0.0005428494,"about_ca_system_score_gemma":0.00051445176,"threshold_uncertainty_score":0.004070401},"labels":[],"label_agreement":null},{"id":"W1484451046","doi":"10.1007/978-3-540-89641-8_27","title":"A New Message Recognition Protocol for Ad Hoc Pervasive Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Protocol (science); Hash function; Wireless ad hoc network; Computer network; Mobile ad hoc network; Flexibility (engineering); Ad hoc wireless distribution service; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Computer security; Routing protocol; Wireless; Network packet","score_opus":0.03001622151295368,"score_gpt":0.2684930525539955,"score_spread":0.23847683104104184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484451046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035498908,0.0012916039,0.9771502,0.00042058152,0.0013677971,0.00041420755,0.0001592218,0.008050748,0.0075957575],"genre_scores_gemma":[0.09713225,0.0026416718,0.8310318,0.0012139197,0.0011975253,0.0017308992,0.0015130359,0.0019007815,0.06163803],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99776435,0.00043172916,0.00025902377,0.00028036328,0.0010251874,0.00023935802],"domain_scores_gemma":[0.99701166,0.00083476,0.00018768886,0.001030391,0.0007602994,0.00017524046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019061238,0.0012515552,0.0014948373,0.0015256724,0.0013209066,0.002549132,0.003228041,0.00213901,0.008590154],"category_scores_gemma":[0.004351624,0.00081789267,0.000705002,0.0013707033,0.0010083853,0.006131495,0.002956698,0.00434191,0.0059771165],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009345954,0.00036720757,0.00033674552,0.0008013116,0.00010820822,0.000534329,0.00038219776,0.011275417,0.06933214,0.1470794,0.07209787,0.69675064],"study_design_scores_gemma":[0.00042988616,0.00080551405,0.00065045967,0.0002410114,0.00036195453,0.0022863634,0.0001888027,0.3227209,0.10145892,0.09205607,0.4784168,0.00038330173],"about_ca_topic_score_codex":0.0008768423,"about_ca_topic_score_gemma":0.0011553884,"teacher_disagreement_score":0.008590154,"about_ca_system_score_codex":0.0006778551,"about_ca_system_score_gemma":0.001083979,"threshold_uncertainty_score":0.028736949},"labels":[],"label_agreement":null},{"id":"W1484570581","doi":"10.1109/iscc.2004.1358644","title":"Optimal solution of total routing table size for hierarchical networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Hierarchy; Table (database); Routing (electronic design automation); Cluster size; Cluster (spacecraft); Computer science; Integer (computer science); Scalability; Mathematics; Routing table; Mathematical optimization; Routing protocol; Data mining; Computer network","score_opus":0.01051734073726864,"score_gpt":0.23281268587515297,"score_spread":0.22229534513788432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484570581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05688192,0.00046857662,0.93297917,0.00045744953,0.00006177881,0.0001664216,0.00034660127,0.00048479481,0.008153381],"genre_scores_gemma":[0.48592478,0.0005052582,0.50681204,0.00017242224,0.000075639226,0.00040829025,0.0005559389,0.000245003,0.005300626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991365,0.00022254713,0.000040504383,0.00018632316,0.00018889905,0.00022525892],"domain_scores_gemma":[0.9973279,0.0017677011,0.00027004973,0.00015861014,0.00029990578,0.00017577584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00151842,0.0011445459,0.0012053497,0.0012133614,0.0006316292,0.0013659409,0.0016122398,0.0011486668,0.004715298],"category_scores_gemma":[0.006499283,0.00072727614,0.000661676,0.0014177766,0.0006890988,0.0021895564,0.0013825868,0.0008326866,0.0004749208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008132972,0.000044488705,0.00038991048,0.0001220594,0.00001825031,0.000050917803,0.00007660941,0.9516084,0.0022514998,0.013600904,0.0022479608,0.029507643],"study_design_scores_gemma":[0.000023078755,0.00003714221,0.00018568768,0.000008869331,0.0000099332365,0.0000306476,0.00004708654,0.98770195,0.000499698,0.0108357165,0.00061191176,0.000008304177],"about_ca_topic_score_codex":0.0047523146,"about_ca_topic_score_gemma":0.00614887,"teacher_disagreement_score":0.0047523146,"about_ca_system_score_codex":0.0019493484,"about_ca_system_score_gemma":0.0024516468,"threshold_uncertainty_score":0.01577425},"labels":[],"label_agreement":null},{"id":"W1485874181","doi":"","title":"Limited flooding protocol for mobile ad hoc networks.","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Flooding (psychology); Optimized Link State Routing Protocol; Wireless Routing Protocol; Routing protocol; Distributed computing; Ad hoc wireless distribution service; Wireless ad hoc network; Dynamic Source Routing; Link-state routing protocol; Mobile ad hoc network; Network packet; Wireless; Telecommunications","score_opus":0.03661589084767227,"score_gpt":0.2771446805292086,"score_spread":0.24052878968153632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485874181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057628835,0.053115133,0.875838,0.0044213356,0.004813487,0.0018971205,0.0012324736,0.005248696,0.047671005],"genre_scores_gemma":[0.13108659,0.05145278,0.74314696,0.0037040217,0.0022614673,0.0059150816,0.0051032356,0.00061674346,0.05671316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987319,0.00034850868,0.000110971196,0.00011007516,0.00062428054,0.00007431357],"domain_scores_gemma":[0.99918145,0.0002594174,0.0001237377,0.00015762771,0.00019900754,0.00007875176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013376189,0.00079443055,0.0010429736,0.0012938158,0.0009769393,0.0010288194,0.0018348119,0.0016302484,0.004336718],"category_scores_gemma":[0.0027493814,0.0003861282,0.0005143468,0.0015562063,0.001303577,0.0024497851,0.0020085624,0.001746427,0.0038221283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003376093,0.00012605268,0.0005833377,0.0035332646,0.00020389631,0.0010240478,0.0006199597,0.013170056,0.038946763,0.29813808,0.14787929,0.49543768],"study_design_scores_gemma":[0.00016996753,0.00023848533,0.00033449847,0.00030516964,0.00010963051,0.0024096456,0.000118450465,0.01994633,0.011208026,0.09017442,0.8748497,0.00013565981],"about_ca_topic_score_codex":0.0008571481,"about_ca_topic_score_gemma":0.00091282674,"teacher_disagreement_score":0.004336718,"about_ca_system_score_codex":0.0008486204,"about_ca_system_score_gemma":0.0012289733,"threshold_uncertainty_score":0.014507771},"labels":[],"label_agreement":null},{"id":"W1487163320","doi":"10.1007/978-3-540-72606-7_24","title":"Minimum Cost Configuration of Relay and Channel Infrastructure in Heterogeneous Wireless Mesh Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless mesh network; Relay; Computer network; Mesh networking; Wireless; Channel (broadcasting); Wireless network; Relay channel; Distributed computing; Telecommunications","score_opus":0.012702498888647143,"score_gpt":0.2352727536306178,"score_spread":0.22257025474197067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487163320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0828981,0.00059185055,0.90866685,0.00021668407,0.000060479353,0.000076873024,0.00012310263,0.00031506456,0.007051091],"genre_scores_gemma":[0.8517669,0.0003389886,0.14502694,0.000026905724,0.000040041534,0.00009940513,0.00014384103,0.00008580707,0.0024712365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995303,0.00020545106,0.000021273716,0.00007894953,0.00009767411,0.00006628794],"domain_scores_gemma":[0.99922407,0.00047936244,0.00007947756,0.00009177101,0.00007846978,0.000046884783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006002414,0.00072853663,0.0010295248,0.00054237543,0.0004584313,0.000804092,0.0019561492,0.0008631969,0.0016766966],"category_scores_gemma":[0.002555233,0.00058202096,0.00031836386,0.0008509414,0.00047801354,0.0014949357,0.00089491747,0.00055407255,0.00023841324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020300977,0.00004664293,0.0003440732,0.00009441579,0.000027717637,0.00011511794,0.00005159501,0.9193562,0.006432267,0.01892498,0.0014817631,0.052922156],"study_design_scores_gemma":[0.000021940388,0.00007401097,0.00020453607,0.000009648547,0.000017091887,0.00007575352,0.000029547848,0.98172414,0.0017145793,0.01554962,0.00056808884,0.0000109957455],"about_ca_topic_score_codex":0.00084803347,"about_ca_topic_score_gemma":0.0012966229,"teacher_disagreement_score":0.0019561492,"about_ca_system_score_codex":0.0007867526,"about_ca_system_score_gemma":0.00045508269,"threshold_uncertainty_score":0.005708337},"labels":[],"label_agreement":null},{"id":"W1487335778","doi":"","title":"Multicasting in mobile ad-hoc networks: achieving high packet delivery ratios","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Network packet; Packet loss; Protocol Independent Multicast; Distributed computing; Reliable multicast; Geocast; IP multicast; Routing protocol; Optimized Link State Routing Protocol","score_opus":0.011573067086262646,"score_gpt":0.22670999267919656,"score_spread":0.2151369255929339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487335778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08640391,0.017547563,0.8529739,0.0018243,0.0003511807,0.0003036743,0.00012340942,0.006143874,0.03432826],"genre_scores_gemma":[0.68473196,0.010452017,0.29571855,0.00041729893,0.00078185817,0.00034035373,0.00022690247,0.0006067473,0.0067244186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839056,0.00065135333,0.00006998315,0.00009855549,0.000618396,0.00017115282],"domain_scores_gemma":[0.99718094,0.0017570143,0.00021527438,0.00023789602,0.0005089821,0.00009985026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002423852,0.0012035823,0.0011957575,0.0016837536,0.0009248908,0.0013883335,0.0016075049,0.0018521018,0.0024721914],"category_scores_gemma":[0.007820579,0.0004639916,0.00027256436,0.0013796135,0.00063552975,0.0031709448,0.001455539,0.0009821652,0.0023519928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068589696,0.00038387152,0.0027811367,0.001281395,0.00009640139,0.0011417796,0.00089417404,0.10215392,0.14899653,0.10244555,0.017078716,0.6220606],"study_design_scores_gemma":[0.00036330003,0.0023774854,0.0021051646,0.00032598598,0.00026321798,0.0044990615,0.00050618616,0.5515487,0.19411212,0.1193479,0.12439017,0.00016073382],"about_ca_topic_score_codex":0.00029120676,"about_ca_topic_score_gemma":0.00022755093,"teacher_disagreement_score":0.0024721914,"about_ca_system_score_codex":0.00056361867,"about_ca_system_score_gemma":0.00028477222,"threshold_uncertainty_score":0.012818694},"labels":[],"label_agreement":null},{"id":"W1487943940","doi":"10.1109/iswpc.2006.1613634","title":"DMAC-DACA: Enabling Efficient Medium Access for Wireless Ad hoc Networks with Directional Antennas","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Throughput; Mobile ad hoc network; Terminal (telecommunication); Scheme (mathematics); Limit (mathematics); Ad hoc wireless distribution service; Wireless; Wireless network; Hidden node problem; Vehicular ad hoc network; Optimized Link State Routing Protocol; Telecommunications; Network packet; Wi-Fi array; Mathematics","score_opus":0.012117403235815966,"score_gpt":0.2409674337029425,"score_spread":0.22885003046712651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487943940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051670752,0.00605372,0.9210562,0.0008386171,0.0010765304,0.0004154628,0.00022970878,0.0039417897,0.014717212],"genre_scores_gemma":[0.70145583,0.0026934934,0.2835889,0.0006594882,0.00042710712,0.00039115496,0.0004142907,0.000091478425,0.010278148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995763,0.00008885226,0.000027155944,0.000044973847,0.00018534268,0.000077467135],"domain_scores_gemma":[0.99883765,0.0003431368,0.00014232482,0.00017542017,0.00037067384,0.00013080079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000695195,0.0006211033,0.0005332934,0.00093647465,0.0008575259,0.0009742416,0.0013145298,0.0005825029,0.0014348016],"category_scores_gemma":[0.0017477501,0.00023527935,0.00026442157,0.00066569087,0.00059880945,0.0008883486,0.0013348598,0.0014005676,0.0006840977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007059089,0.00039543034,0.0039667073,0.0010066284,0.00013302323,0.0006454555,0.0002941499,0.049939513,0.2021643,0.075883225,0.029967884,0.6348978],"study_design_scores_gemma":[0.00028913267,0.0010491489,0.0022458325,0.000096499745,0.00014570443,0.0023499988,0.00013296609,0.6757669,0.0989569,0.017149236,0.20165215,0.00016557683],"about_ca_topic_score_codex":0.0010433537,"about_ca_topic_score_gemma":0.0022048014,"teacher_disagreement_score":0.0014348016,"about_ca_system_score_codex":0.0005418125,"about_ca_system_score_gemma":0.0007819579,"threshold_uncertainty_score":0.0047999024},"labels":[],"label_agreement":null},{"id":"W1489141058","doi":"10.1109/pimrc.2005.1651662","title":"A Two-Channel Medium Access Control Protocol for Mobile Ad Hoc Networks using Directional Antennas","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Directional antenna; Computer network; Computer science; Omnidirectional antenna; Wireless ad hoc network; Throughput; Mobile ad hoc network; Network topology; Transmission (telecommunications); Neighbor Discovery Protocol; Control channel; Antenna (radio); Wireless; Telecommunications; Base station; Internet protocol suite; Network packet","score_opus":0.026249567907140406,"score_gpt":0.3178230714272879,"score_spread":0.2915735035201475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489141058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011504094,0.0020363268,0.979602,0.00039660974,0.0005017912,0.000601828,0.000075295284,0.0009512694,0.0043307035],"genre_scores_gemma":[0.4358756,0.0033221538,0.5446236,0.0008119314,0.00054187275,0.0029506113,0.00042270374,0.0000898203,0.0113616865],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998544,0.00045516962,0.00013316322,0.00016166485,0.00060903956,0.00009697528],"domain_scores_gemma":[0.99824023,0.00060493534,0.00022221055,0.00025915695,0.00057240436,0.00010115955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001965635,0.00079347804,0.0006004914,0.0007936531,0.0010126738,0.0012902356,0.0014451053,0.0011884709,0.0016360818],"category_scores_gemma":[0.0033488763,0.00025772615,0.00047141474,0.00090319285,0.00078633474,0.0015630978,0.00088876224,0.0015454574,0.0006158315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009060625,0.00073828263,0.0015935806,0.0013275685,0.00027260557,0.0014649048,0.0006122963,0.10197653,0.1377441,0.17653736,0.017830677,0.5589961],"study_design_scores_gemma":[0.0004012802,0.0019918992,0.0013369874,0.0001347812,0.000294601,0.0021909815,0.00013111871,0.80302995,0.042669192,0.022663323,0.12488938,0.00026655063],"about_ca_topic_score_codex":0.0009515451,"about_ca_topic_score_gemma":0.0013834303,"teacher_disagreement_score":0.001965635,"about_ca_system_score_codex":0.00066874723,"about_ca_system_score_gemma":0.0011042425,"threshold_uncertainty_score":0.010395408},"labels":[],"label_agreement":null},{"id":"W1489859050","doi":"10.1109/wirles.2005.1549405","title":"Throughput Maximizing Routing in a MANET: Protocol and Analysis","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Distributed computing; Mobile ad hoc network; Link-state routing protocol; Throughput; Routing (electronic design automation); Wireless; Network packet; Telecommunications","score_opus":0.014111406066145141,"score_gpt":0.27136049424860226,"score_spread":0.2572490881824571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1489859050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018166719,0.005175204,0.96050775,0.0010041627,0.00017449033,0.0007348061,0.00039394177,0.000759748,0.013083212],"genre_scores_gemma":[0.51706666,0.019654656,0.43981177,0.00075740303,0.00066652097,0.0045437054,0.0010345485,0.00066038873,0.015804388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980684,0.0005250364,0.00010850647,0.00016903653,0.0009556145,0.00017335202],"domain_scores_gemma":[0.9971855,0.001542889,0.00039052108,0.00023143897,0.0005800339,0.00006964005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036453146,0.0014062439,0.0012065535,0.0025087963,0.0013263463,0.0027294217,0.0019572107,0.0014209856,0.0024829297],"category_scores_gemma":[0.009196709,0.0007108187,0.00072833913,0.0039883307,0.0014769771,0.0036591718,0.0014255327,0.0015922232,0.0010739819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011261903,0.00013041131,0.0012953235,0.0005000836,0.000096677984,0.00045227463,0.00045707682,0.63758,0.0064054425,0.28923804,0.007194021,0.056538094],"study_design_scores_gemma":[0.000011795965,0.00007489492,0.0002656418,0.00007874862,0.00004378705,0.00033921778,0.0000625338,0.9351962,0.0018014621,0.055010147,0.007078997,0.000036524823],"about_ca_topic_score_codex":0.003247874,"about_ca_topic_score_gemma":0.0022188332,"teacher_disagreement_score":0.0036453146,"about_ca_system_score_codex":0.0024591147,"about_ca_system_score_gemma":0.0018821912,"threshold_uncertainty_score":0.019278526},"labels":[],"label_agreement":null},{"id":"W1492501824","doi":"10.1007/978-3-642-02617-1_44","title":"Performance Evaluation of DSR in Multi-services Ad Hoc Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Network packet; Wireless ad hoc network; DSRFLOW; Vehicular ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Routing (electronic design automation); Ad hoc wireless distribution service; Protocol (science); Telecommunications; Wireless","score_opus":0.025339338492567923,"score_gpt":0.2675672387366046,"score_spread":0.24222790024403668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492501824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88314337,0.010180419,0.08618407,0.0005689342,0.00032738218,0.0002533035,0.00057087047,0.0030174043,0.015754161],"genre_scores_gemma":[0.9871837,0.00081945787,0.009938833,0.000040681494,0.000056745,0.0000203664,0.0002967195,0.000075017786,0.0015685102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955914,0.002023468,0.0002557808,0.0003798001,0.0012367661,0.0005128465],"domain_scores_gemma":[0.98764044,0.008409001,0.0004670484,0.0006790412,0.0024688465,0.00033566653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044115917,0.0011646525,0.0012593624,0.0020697895,0.00073505676,0.0013880666,0.0013049068,0.0009363024,0.0029171673],"category_scores_gemma":[0.009297583,0.00022390408,0.00033012187,0.001542731,0.0006579511,0.0018426601,0.0007031189,0.0004467174,0.00063127774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009693069,0.0009154242,0.010251854,0.0011881306,0.0003908992,0.0004583457,0.00027267152,0.59994674,0.049186062,0.0063425153,0.0048562973,0.31649795],"study_design_scores_gemma":[0.00017741232,0.0032781477,0.0032541153,0.000031501564,0.00018865138,0.00053535757,0.00024889328,0.96028244,0.029260295,0.001036016,0.0016556071,0.000051598083],"about_ca_topic_score_codex":0.0047712126,"about_ca_topic_score_gemma":0.002747289,"teacher_disagreement_score":0.0047712126,"about_ca_system_score_codex":0.0022728755,"about_ca_system_score_gemma":0.0006560398,"threshold_uncertainty_score":0.023330986},"labels":[],"label_agreement":null},{"id":"W1492821351","doi":"10.1023/a:1013750820088","title":"Guest Editorial Analysis and Design of Multi-Service Wireless Networks","year":2002,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.01495549730261418,"score_gpt":0.23199556757962117,"score_spread":0.217040070277007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1492821351","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010103198,0.00819617,0.016690187,0.026201691,0.9408847,0.000035596204,0.000102311715,0.00016554601,0.006713536],"genre_scores_gemma":[0.021688303,0.009178385,0.004361207,0.0048480434,0.9284839,0.000039823866,0.000100242825,0.00019857375,0.031101465],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999076,0.00018788387,0.000055587006,0.00016654542,0.0004341617,0.000079859616],"domain_scores_gemma":[0.9899946,0.0038018632,0.0003732628,0.0002993504,0.0046376833,0.00089326064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015976332,0.0012042945,0.0011257977,0.001157138,0.0007407551,0.0024476899,0.0012693681,0.0022119505,0.0093524605],"category_scores_gemma":[0.010571152,0.00031500024,0.0005518913,0.0004898237,0.0007534404,0.0013053083,0.0005760204,0.002832185,0.0034723352],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024502873,0.000040665098,0.0002435893,0.0005846777,0.00005838466,0.0005031927,0.000033072538,0.0017879341,0.0010061202,0.010755965,0.91909283,0.06564854],"study_design_scores_gemma":[0.000086907676,0.00018031696,0.00044732998,0.00023529858,0.00015743672,0.00080360635,0.000046081284,0.010931375,0.0017512756,0.017726976,0.9676004,0.000032882657],"about_ca_topic_score_codex":0.00028618454,"about_ca_topic_score_gemma":0.00035528518,"teacher_disagreement_score":0.0093524605,"about_ca_system_score_codex":0.00066181226,"about_ca_system_score_gemma":0.00048293994,"threshold_uncertainty_score":0.031287134},"labels":[],"label_agreement":null},{"id":"W1493639231","doi":"","title":"A green framework for energy efficient management in TDMA-based Wireless Mesh Networks","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy consumption; Throughput; Computer network; Wireless mesh network; Distributed computing; Scheduling (production processes); Time division multiple access; Efficient energy use; Routing (electronic design automation); Energy management; Wireless; Energy (signal processing); Mathematical optimization; Wireless network; Engineering; Telecommunications; Mathematics","score_opus":0.013022957191781492,"score_gpt":0.2313956237621505,"score_spread":0.21837266657036902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493639231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003974474,0.0005184207,0.9898038,0.0005613264,0.00016541412,0.00004486388,0.000056680277,0.00022103803,0.004654085],"genre_scores_gemma":[0.5228922,0.002143803,0.45808122,0.00040285982,0.0005303869,0.00036109774,0.00020124028,0.00035221662,0.015034926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992692,0.00023029184,0.000029587898,0.000087176406,0.00027182745,0.00011196385],"domain_scores_gemma":[0.9992157,0.0003377628,0.00004816423,0.00015317688,0.00015239893,0.0000928427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014627165,0.0006909539,0.0010385672,0.00071172393,0.00091846223,0.0023446141,0.0026133647,0.0011897428,0.0034604068],"category_scores_gemma":[0.002019875,0.00038114164,0.0007607736,0.00088824076,0.0015137417,0.0025375132,0.003135022,0.001932328,0.0005276763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058392834,0.000061376704,0.00016036414,0.00008484189,0.00003061225,0.00010484372,0.000120151184,0.2693655,0.0034479187,0.68796504,0.0036095113,0.03499156],"study_design_scores_gemma":[0.000009288549,0.000020296573,0.000048857415,0.00001628886,0.000011836335,0.000028134724,0.000036802925,0.79954547,0.0007029091,0.19111298,0.008454116,0.000013057],"about_ca_topic_score_codex":0.0019828782,"about_ca_topic_score_gemma":0.0029748443,"teacher_disagreement_score":0.0034604068,"about_ca_system_score_codex":0.0014054652,"about_ca_system_score_gemma":0.0013378769,"threshold_uncertainty_score":0.011576235},"labels":[],"label_agreement":null},{"id":"W1493769967","doi":"10.1109/icc.2015.7249373","title":"Minimum-energy broadcasting for cross wireless ad-hoc networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Broadcasting (networking); Computer science; Time complexity; Algorithm; Wireless ad hoc network; Approximation algorithm; Computational complexity theory; Wireless sensor network; Energy (signal processing); Distributed algorithm; Wireless; Mathematical optimization; Mathematics; Distributed computing; Computer network; Telecommunications","score_opus":0.031192448289557945,"score_gpt":0.27318236420064457,"score_spread":0.24198991591108662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493769967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021012357,0.00075361645,0.97422653,0.00018116954,0.00003763887,0.00004583274,0.000029166786,0.00033250402,0.0033811857],"genre_scores_gemma":[0.40209147,0.0012180429,0.5913305,0.00018469658,0.00014608906,0.00022367948,0.0002859033,0.00017138524,0.004348097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993106,0.00023306366,0.000031249452,0.000114733986,0.00023171928,0.0000787039],"domain_scores_gemma":[0.99892044,0.0006250177,0.00011147534,0.00014088632,0.0001541726,0.000048028553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011109472,0.0007321216,0.0007173643,0.00065018696,0.0008123496,0.0008903896,0.0015435684,0.0008205766,0.0022372059],"category_scores_gemma":[0.003026265,0.00036393566,0.00039660296,0.0010089077,0.0005790548,0.001742316,0.0017275556,0.00072397664,0.000514102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026048947,0.00020582923,0.0012417265,0.0005893685,0.00011354862,0.00014892881,0.00044625968,0.5788363,0.014152269,0.10367643,0.007397207,0.29293168],"study_design_scores_gemma":[0.000052529973,0.00015528193,0.0003851024,0.00002801371,0.00004109702,0.00022258727,0.0001529111,0.94739,0.0041273185,0.03981072,0.007618505,0.000016068829],"about_ca_topic_score_codex":0.00073586975,"about_ca_topic_score_gemma":0.0010300257,"teacher_disagreement_score":0.0022372059,"about_ca_system_score_codex":0.0005754689,"about_ca_system_score_gemma":0.0006272251,"threshold_uncertainty_score":0.0074841976},"labels":[],"label_agreement":null},{"id":"W1493847926","doi":"10.1002/ett.2963","title":"An energy‐aware load‐balanced routing protocol for ad hoc M2M communications","year":2015,"lang":"en","type":"article","venue":"Transactions on Emerging Telecommunications Technologies","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Routing protocol; Link-state routing protocol; Zone Routing Protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Distributed computing; Network packet","score_opus":0.056861560734212224,"score_gpt":0.3408224794251534,"score_spread":0.2839609186909412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493847926","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037944335,0.0019447253,0.9499749,0.0009481473,0.0004870264,0.00036184688,0.00014727493,0.001341302,0.0068505174],"genre_scores_gemma":[0.78616166,0.0013360858,0.20343149,0.0005181597,0.00022321411,0.0006006853,0.0004943459,0.00010212267,0.007132233],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.00014570713,0.000046588033,0.000073518044,0.00017408255,0.000050989827],"domain_scores_gemma":[0.99927086,0.00020308376,0.00011798734,0.00009524165,0.00027368907,0.000039194674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006280758,0.0006161424,0.0005299354,0.000903495,0.0009002348,0.0008492623,0.0013312579,0.0006841844,0.0011609559],"category_scores_gemma":[0.0014858136,0.0002302811,0.00031762233,0.00073309557,0.00038819137,0.0015352484,0.001176138,0.00066603295,0.00042173004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000619581,0.00034986806,0.0020093177,0.0005643841,0.00031707395,0.00087209354,0.00062432553,0.378117,0.105383866,0.095438965,0.02553048,0.39017305],"study_design_scores_gemma":[0.000057395948,0.00019239055,0.00036147478,0.000036084395,0.000052753985,0.00033954985,0.00010633147,0.9487591,0.012735184,0.016344965,0.020946432,0.00006834182],"about_ca_topic_score_codex":0.0009931821,"about_ca_topic_score_gemma":0.0018571536,"teacher_disagreement_score":0.0013312579,"about_ca_system_score_codex":0.0006113257,"about_ca_system_score_gemma":0.0007404417,"threshold_uncertainty_score":0.0044354796},"labels":[],"label_agreement":null},{"id":"W1493878798","doi":"10.1007/978-3-540-28634-9_27","title":"Routing Table Dynamics in Mobile Ad-Hoc Networks: A Continuum Model","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Link-state routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Enhanced Interior Gateway Routing Protocol; Routing protocol; Distributed computing; Optimized Link State Routing Protocol; Static routing; Routing table; Routing (electronic design automation)","score_opus":0.009147438660698618,"score_gpt":0.22306165842870848,"score_spread":0.21391421976800987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493878798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090700805,0.0049632406,0.8156605,0.0072931326,0.0007033192,0.0001744525,0.00050094887,0.00049997045,0.07950368],"genre_scores_gemma":[0.89294297,0.0051306714,0.051699877,0.00077316497,0.00066729594,0.00030075535,0.00023610597,0.00023475771,0.048014455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.00039275232,0.000041700354,0.00019660196,0.00032338596,0.0001481641],"domain_scores_gemma":[0.9960531,0.0024080598,0.00039293477,0.0002884473,0.0004632063,0.00039425775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001563869,0.0007262549,0.00164456,0.0013033795,0.0013439059,0.0037573103,0.0040736455,0.0037850314,0.008095625],"category_scores_gemma":[0.00878838,0.0011446931,0.0010346939,0.0022835734,0.003196452,0.006971559,0.0024677997,0.002205069,0.0016847902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008768276,0.00012669912,0.00060712773,0.00015376687,0.000031713073,0.00024132708,0.00040342862,0.40527892,0.0011599242,0.5726244,0.005935454,0.01334959],"study_design_scores_gemma":[0.00003535653,0.000038707098,0.00010582927,0.000023497561,0.000015732729,0.00009647211,0.000089272246,0.876623,0.000087283544,0.12059544,0.002269786,0.000019666059],"about_ca_topic_score_codex":0.0033361842,"about_ca_topic_score_gemma":0.0018968281,"teacher_disagreement_score":0.008095625,"about_ca_system_score_codex":0.0020451292,"about_ca_system_score_gemma":0.0010906652,"threshold_uncertainty_score":0.027082562},"labels":[],"label_agreement":null},{"id":"W1498067662","doi":"10.1109/wimob.2005.1512902","title":"BEAN - BitTorrent enabled ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"BitTorrent; Computer science; Wireless ad hoc network; Vehicular ad hoc network; Computer network; Telecommunications; Peer-to-peer; Wireless","score_opus":0.007435371455788675,"score_gpt":0.20594499404796024,"score_spread":0.19850962259217156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1498067662","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02975797,0.008549869,0.9257765,0.0008553172,0.0013669952,0.00055770634,0.00038354762,0.008429949,0.024322266],"genre_scores_gemma":[0.48563156,0.008366512,0.45454204,0.0013695344,0.00039135086,0.00043845057,0.00286389,0.0005186416,0.04587801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919575,0.00019482625,0.000062631785,0.00010883072,0.00031199993,0.00012600876],"domain_scores_gemma":[0.99918777,0.00008404251,0.000075249845,0.00017755323,0.00033073893,0.00014457252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009175172,0.0004050462,0.00075117714,0.0005800403,0.0005266806,0.0015112702,0.0015672708,0.000924971,0.0014102268],"category_scores_gemma":[0.0012375065,0.0002305751,0.00037748835,0.0006242608,0.00042983022,0.0025530027,0.0012892724,0.0009405593,0.0013856344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014108333,0.0004912877,0.0035051147,0.0015126031,0.00034236757,0.002151314,0.00037179067,0.020685887,0.13207933,0.1592769,0.068014115,0.61015844],"study_design_scores_gemma":[0.0001675307,0.0013926226,0.0032403432,0.00021032237,0.0002537157,0.009060824,0.00020672016,0.30288142,0.108852826,0.04830195,0.5250601,0.0003716824],"about_ca_topic_score_codex":0.0008479608,"about_ca_topic_score_gemma":0.0011921637,"teacher_disagreement_score":0.0015672708,"about_ca_system_score_codex":0.00038032734,"about_ca_system_score_gemma":0.0006150271,"threshold_uncertainty_score":0.004852414},"labels":[],"label_agreement":null},{"id":"W1499181218","doi":"10.1007/978-3-540-39611-6_24","title":"Mobile Agents for Clustering and Routing in Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Distributed computing; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Mobile ad hoc network; Static routing; Hybrid routing; Policy-based routing; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Routing (electronic design automation); Wireless; Network packet; Telecommunications","score_opus":0.01609495910882278,"score_gpt":0.2502134767817561,"score_spread":0.23411851767293332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1499181218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027627193,0.023548143,0.9354917,0.00078853965,0.0019605919,0.00015064534,0.00013223606,0.0019014175,0.033264022],"genre_scores_gemma":[0.06652876,0.023078557,0.78306246,0.0005171009,0.0015340032,0.0004332421,0.0005845197,0.0007191673,0.12354224],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965215,0.00009344682,0.00001838265,0.000045932862,0.00017032016,0.000019833082],"domain_scores_gemma":[0.99967206,0.00014396755,0.000021761778,0.0000672537,0.00007642691,0.000018544522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035835142,0.00106677,0.0010038997,0.0006841228,0.0004259928,0.0014121991,0.0015777955,0.0014013542,0.008117415],"category_scores_gemma":[0.001001564,0.0004382557,0.0003665953,0.0013816277,0.00057593256,0.0019791196,0.0007231619,0.0012942788,0.0045361426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009954348,0.00008523464,0.0001904148,0.000945641,0.00007846734,0.0002644747,0.00027698555,0.041585427,0.008644024,0.228133,0.07529615,0.64440066],"study_design_scores_gemma":[0.00007004958,0.00015743129,0.00032726873,0.00029754025,0.000094994255,0.0009202818,0.00012509167,0.20387585,0.0066947676,0.15346004,0.63392174,0.00005493176],"about_ca_topic_score_codex":0.0005335245,"about_ca_topic_score_gemma":0.0009771228,"teacher_disagreement_score":0.008117415,"about_ca_system_score_codex":0.00037916817,"about_ca_system_score_gemma":0.00034596492,"threshold_uncertainty_score":0.027155459},"labels":[],"label_agreement":null},{"id":"W1502346466","doi":"10.1109/sahcn.2004.1381964","title":"Simplified simulation models for indoor MANET evaluation are not robust","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robustness (evolution); Computer science; Soundness; Routing protocol; Mobility model; Mobile ad hoc network; Radio propagation; Computer network; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.09169599729762026,"score_gpt":0.30387119195229007,"score_spread":0.2121751946546698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502346466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25208968,0.0011511596,0.7236753,0.0015791325,0.00039964318,0.0011768402,0.001526381,0.004406758,0.013995143],"genre_scores_gemma":[0.8878322,0.0010243468,0.106902026,0.00030700598,0.00008161614,0.0007457478,0.0012554282,0.00055382366,0.0012977658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99322283,0.0034950553,0.00041714427,0.00042225712,0.00208676,0.00035600332],"domain_scores_gemma":[0.9740537,0.014624828,0.002125407,0.005773622,0.0030502027,0.00037224303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065906276,0.0014565096,0.0013543474,0.0010386093,0.00073741697,0.0018717884,0.0020264091,0.001312647,0.0017187078],"category_scores_gemma":[0.04710188,0.000994422,0.0011529729,0.0012478699,0.0011389777,0.00298719,0.0014016986,0.0017684359,0.00084559387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010436344,0.0000628075,0.0015305558,0.00012862876,0.0000945927,0.00006594371,0.000059898135,0.9816642,0.0019515646,0.0049072294,0.00082778273,0.008602512],"study_design_scores_gemma":[0.000051130693,0.00021873083,0.00083389244,0.000053940483,0.00007497126,0.000071534945,0.00005331562,0.9873679,0.0025234318,0.0064990856,0.0022044857,0.000047502814],"about_ca_topic_score_codex":0.007887875,"about_ca_topic_score_gemma":0.004524175,"teacher_disagreement_score":0.007887875,"about_ca_system_score_codex":0.0015832613,"about_ca_system_score_gemma":0.0011572444,"threshold_uncertainty_score":0.034855008},"labels":[],"label_agreement":null},{"id":"W1503049715","doi":"10.1109/wimob.2005.1512903","title":"Quality of service for ad hoc on-demand distance vector routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Ad hoc On-Demand Distance Vector Routing; Computer science; Quality of service; Distance-vector routing protocol; Dynamic Source Routing; Mobile ad hoc network; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Adaptive quality of service multi-hop routing; Routing protocol; Wireless ad hoc network; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.02234317067964363,"score_gpt":0.2759327467183502,"score_spread":0.2535895760387066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503049715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016483534,0.017748896,0.9056824,0.0032503025,0.0030136134,0.0007364826,0.00084554544,0.003902478,0.048336636],"genre_scores_gemma":[0.5695718,0.021153377,0.3513338,0.0011667165,0.0016192346,0.0018275698,0.0041510477,0.0008379538,0.048338532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987583,0.0003335273,0.00006992192,0.00007517554,0.0006709813,0.00009210613],"domain_scores_gemma":[0.998863,0.0002849672,0.000090694666,0.00016165499,0.0005248747,0.00007481393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011368066,0.0008146134,0.00093767594,0.00087361236,0.0008237506,0.0017213565,0.001478107,0.0012620137,0.0052818027],"category_scores_gemma":[0.003502232,0.00023246575,0.00031020775,0.0013876692,0.0005900217,0.0013160312,0.0011018987,0.0012324213,0.0029476562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047417014,0.0002711745,0.001199766,0.0008280671,0.00010308135,0.00052344333,0.0002840771,0.104740284,0.019348757,0.24796647,0.08601716,0.53824353],"study_design_scores_gemma":[0.0001359973,0.0003311244,0.0010772804,0.00019514628,0.00004363839,0.00041904338,0.00015641822,0.725059,0.00349053,0.09638185,0.17262602,0.000084071726],"about_ca_topic_score_codex":0.0026551916,"about_ca_topic_score_gemma":0.001917427,"teacher_disagreement_score":0.0052818027,"about_ca_system_score_codex":0.0012207999,"about_ca_system_score_gemma":0.000849325,"threshold_uncertainty_score":0.01766938},"labels":[],"label_agreement":null},{"id":"W1503512665","doi":"10.1007/11506843_11","title":"ASM and SDL Models of Geographic Routing in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Complement (music); Mobile ad hoc network; Protocol (science); Distributed computing; Wireless ad hoc network; Routing (electronic design automation); Theoretical computer science; Computer network; Telecommunications","score_opus":0.011259965527801357,"score_gpt":0.22259776997021438,"score_spread":0.211337804442413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1503512665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012043348,0.00068311754,0.9683035,0.0012377332,0.00019322132,0.00005698146,0.0003179932,0.0006912132,0.01647295],"genre_scores_gemma":[0.63753057,0.001971195,0.32838413,0.00046969223,0.00041899818,0.0004046981,0.0009603815,0.00035604098,0.029504325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.0005370925,0.00010790744,0.0001499822,0.00042788908,0.00014319428],"domain_scores_gemma":[0.997242,0.0014964099,0.00018176588,0.00045421429,0.0005057485,0.00011995798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016691629,0.0007253554,0.0008186646,0.00097643735,0.00075748743,0.003531229,0.0024386493,0.0015623085,0.0049685542],"category_scores_gemma":[0.00617334,0.0006640551,0.0009035342,0.0014542125,0.0018920773,0.0046623405,0.0014674189,0.0021612975,0.0010990498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045944143,0.00004548334,0.00037331317,0.00007624366,0.000014744608,0.00008283531,0.00015974265,0.298175,0.0005624108,0.67666274,0.0031956667,0.020605825],"study_design_scores_gemma":[0.000013742382,0.000014260629,0.000040801686,0.000012408414,0.000010989849,0.000030147543,0.000027847615,0.7609098,0.00025734198,0.23334876,0.005325701,0.000008246779],"about_ca_topic_score_codex":0.0076532904,"about_ca_topic_score_gemma":0.0057743797,"teacher_disagreement_score":0.0076532904,"about_ca_system_score_codex":0.0016122098,"about_ca_system_score_gemma":0.0015485237,"threshold_uncertainty_score":0.01662147},"labels":[],"label_agreement":null},{"id":"W1504742739","doi":"10.1109/icpp.2006.71","title":"Truthful Topology Control inWireless Ad Hoc Networks with Selfish Nodes","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Wireless ad hoc network; Topology control; Computer science; Mobile ad hoc network; Node (physics); Network topology; Topology (electrical circuits); Optimized Link State Routing Protocol; Wireless network; Power control; Distributed computing; Wireless; Network packet; Routing protocol; Power (physics); Key distribution in wireless sensor networks; Telecommunications; Mathematics; Engineering","score_opus":0.0034446658830411623,"score_gpt":0.1852159508707842,"score_spread":0.18177128498774306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504742739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047082145,0.0012548354,0.944959,0.0010881104,0.00012955804,0.00011385961,0.0000835485,0.00029895626,0.0049898727],"genre_scores_gemma":[0.9476998,0.0013214188,0.047786802,0.00023126169,0.0001986957,0.0001837747,0.000069821166,0.00006149509,0.0024469506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995826,0.0018019157,0.00028737346,0.00068305334,0.00093098654,0.00047075853],"domain_scores_gemma":[0.9560525,0.032176614,0.005127015,0.003362372,0.0019487104,0.0013327703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066271825,0.0011014548,0.0011907626,0.001323325,0.0012202703,0.0034091529,0.0031463648,0.0019231123,0.0023763664],"category_scores_gemma":[0.035736676,0.00084031513,0.00084605644,0.0015874252,0.005168513,0.007926752,0.0026596854,0.0022998562,0.000375238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043318956,0.00014825929,0.0013751093,0.00041269613,0.00010754786,0.00057738856,0.0009455159,0.38408574,0.006082574,0.56581616,0.0020974225,0.037918422],"study_design_scores_gemma":[0.00007286735,0.00015209339,0.0001880793,0.000040537263,0.000045378365,0.00017315,0.000073518946,0.65179056,0.0014337571,0.3445398,0.0014567696,0.000033486915],"about_ca_topic_score_codex":0.00085010787,"about_ca_topic_score_gemma":0.0005000915,"teacher_disagreement_score":0.0066271825,"about_ca_system_score_codex":0.0020799064,"about_ca_system_score_gemma":0.0011441605,"threshold_uncertainty_score":0.035048306},"labels":[],"label_agreement":null},{"id":"W1507684178","doi":"10.1109/icsmc.2004.1399996","title":"VNET: a distributed algorithm simulator for wireless peer-to-peer networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Ethernet; Scalability; Distributed computing; Network topology; Wireless network; Peer-to-peer; Computer network; Wireless sensor network; Network simulation; Wireless; Process (computing); Operating system","score_opus":0.01106957563692363,"score_gpt":0.25540706274381186,"score_spread":0.24433748710688824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507684178","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015245855,0.00049025624,0.9412675,0.00025204348,0.00028824457,0.00046078814,0.0029563038,0.027562398,0.011476615],"genre_scores_gemma":[0.27303377,0.0014109379,0.6946676,0.00030607416,0.00011787292,0.0029136029,0.00931944,0.005173422,0.013057234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947125,0.00015247776,0.000059262344,0.000048441918,0.00021220234,0.000056412573],"domain_scores_gemma":[0.9988777,0.0005857827,0.00007129049,0.00013361972,0.00024371919,0.00008784415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008439585,0.0007520517,0.00092084776,0.000561027,0.00048749728,0.0007601376,0.0022862353,0.0010413051,0.0074813743],"category_scores_gemma":[0.003698394,0.0005176335,0.00066083565,0.0007648661,0.00036226856,0.0014832894,0.0010253018,0.0015787166,0.0018697361],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023305826,0.00013678177,0.0011862973,0.00042871785,0.00014561373,0.00014896254,0.00014496803,0.8862717,0.006512134,0.021821173,0.029436553,0.053534057],"study_design_scores_gemma":[0.00012142023,0.00004295832,0.000115850824,0.000014877306,0.0000192289,0.000044213844,0.00000909428,0.96832556,0.002308591,0.0050838753,0.023895478,0.000018834731],"about_ca_topic_score_codex":0.0035424463,"about_ca_topic_score_gemma":0.003731036,"teacher_disagreement_score":0.0074813743,"about_ca_system_score_codex":0.0005230914,"about_ca_system_score_gemma":0.0013599596,"threshold_uncertainty_score":0.025027692},"labels":[],"label_agreement":null},{"id":"W1515185950","doi":"10.1109/lcn.2004.16","title":"An adaptive distributed ID assignment scheme for CSMA/IC","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multiple Access with Collision Avoidance for Wireless; Carrier sense multiple access with collision avoidance; Computer science; Computer network; Hidden node problem; Throughput; Wireless ad hoc network; Countdown; Distributed coordination function; Transmission (telecommunications); Wireless; Scheme (mathematics); Protocol (science); Wireless network; Collision; Distributed computing; Vehicular ad hoc network; IEEE 802.11; Wi-Fi array; Engineering; Computer security; Telecommunications","score_opus":0.019183229110045465,"score_gpt":0.2599438281393408,"score_spread":0.24076059902929534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515185950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008824418,0.0002564634,0.9874958,0.00009708628,0.00015824064,0.00010203336,0.000014144202,0.00048886,0.0025629057],"genre_scores_gemma":[0.42089668,0.0003864082,0.5722152,0.0002220914,0.00018706663,0.00030689768,0.00009573044,0.00006978526,0.005620143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999458,0.00010394541,0.000026927813,0.00010155174,0.0002459488,0.00006362611],"domain_scores_gemma":[0.9992423,0.00013869994,0.00007463123,0.00021402107,0.00026054448,0.00006982409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077155966,0.00063943723,0.00042527684,0.0005966759,0.00064966694,0.0006249168,0.0018489265,0.0005512738,0.001808641],"category_scores_gemma":[0.0015797137,0.00020732766,0.00025790214,0.00047482667,0.00060943415,0.00095753744,0.0006981156,0.001104,0.00069051643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005816757,0.00043891525,0.0014256989,0.0002522455,0.000078551086,0.00017596218,0.00027266124,0.14239825,0.14573981,0.20957732,0.006628804,0.49243012],"study_design_scores_gemma":[0.00013645693,0.000261877,0.00025999002,0.000019182504,0.000047162437,0.00021203807,0.000034183697,0.9204435,0.035829466,0.017047653,0.025652708,0.000055782257],"about_ca_topic_score_codex":0.0011517099,"about_ca_topic_score_gemma":0.0009781651,"teacher_disagreement_score":0.0018489265,"about_ca_system_score_codex":0.00078591483,"about_ca_system_score_gemma":0.00093095755,"threshold_uncertainty_score":0.006050527},"labels":[],"label_agreement":null},{"id":"W1517142369","doi":"10.1002/0471643505.ch4","title":"Networks of Queues: Product Form Solution","year":2004,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Queue; Computer science; Routing (electronic design automation); Processor sharing; Product (mathematics); Wireless network; Computer network; Poisson distribution; Topology (electrical circuits); Distributed computing; Mathematics; Wireless; Telecommunications; Combinatorics","score_opus":0.009379896542357342,"score_gpt":0.22237277494879734,"score_spread":0.21299287840644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517142369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018471453,0.0022476236,0.9239585,0.0034637104,0.0004361603,0.00009566649,0.00035878408,0.00020803262,0.050760206],"genre_scores_gemma":[0.6186883,0.0050693876,0.26423395,0.0014139032,0.0011587196,0.0008540841,0.00089056435,0.00022123707,0.10746985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.00015565845,0.000020405621,0.00011853394,0.00015317519,0.00007686474],"domain_scores_gemma":[0.99856573,0.0006771873,0.00013570765,0.00009680829,0.000413119,0.000111520916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012208143,0.00070387655,0.000762453,0.00088386156,0.00073127757,0.0017954902,0.0009781263,0.0018317744,0.0077693975],"category_scores_gemma":[0.005578859,0.00051911804,0.00073837716,0.0010289194,0.0013837954,0.0024292713,0.001693571,0.0018185673,0.0008189501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013752711,0.000019522658,0.00023186617,0.000041450177,0.00001517707,0.000068183355,0.00007572868,0.08757317,0.0002957798,0.89982563,0.0048325732,0.0070071532],"study_design_scores_gemma":[0.000019133016,0.000013608768,0.000097339005,0.000012427256,0.0000067657506,0.000051711886,0.000026240796,0.49131072,0.000091367,0.5024048,0.005957638,0.000008271211],"about_ca_topic_score_codex":0.0043534255,"about_ca_topic_score_gemma":0.0035423352,"teacher_disagreement_score":0.0077693975,"about_ca_system_score_codex":0.0017127948,"about_ca_system_score_gemma":0.0016769752,"threshold_uncertainty_score":0.025991261},"labels":[],"label_agreement":null},{"id":"W1518630539","doi":"10.1007/11753810_14","title":"A Lagrangian Approach for the Optimal Placement of Wireless Relay Nodes in Wireless Local Area Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Relay; Computer science; Subgradient method; Throughput; Path loss; Rayleigh fading; Computer network; Wireless network; Wireless; Wi-Fi; Lagrangian relaxation; Mathematical optimization; Fading; Telecommunications; Mathematics","score_opus":0.013178058977573116,"score_gpt":0.22137041393638285,"score_spread":0.20819235495880972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518630539","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014221696,0.00045441792,0.99305385,0.00027669978,0.00007838272,0.000041257274,0.000047698515,0.000053268916,0.0045722965],"genre_scores_gemma":[0.16249447,0.0025201398,0.81761163,0.00032776728,0.0003336351,0.00060979737,0.00023366783,0.00027453617,0.015594361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993742,0.00031495787,0.00002037536,0.00005540288,0.00017684308,0.00005828913],"domain_scores_gemma":[0.9990126,0.00070803537,0.00006684268,0.00003648808,0.00013450054,0.000041581614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298022,0.0016319947,0.0017183339,0.0010088586,0.0007106677,0.0014983653,0.0023702946,0.0019269574,0.004325099],"category_scores_gemma":[0.0037617951,0.0013282399,0.0011014579,0.0014503325,0.0013683158,0.0017130075,0.0016824636,0.002164461,0.0010841814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025305459,0.000044353455,0.000086254084,0.00013042349,0.00001836191,0.00007878587,0.00007613334,0.8564811,0.00074383937,0.112363055,0.0053379755,0.024614483],"study_design_scores_gemma":[0.00001430872,0.000021466069,0.000020998887,0.000018429459,0.0000044942276,0.000017397384,0.000015583497,0.9681873,0.000103860606,0.029877419,0.0017114971,0.000007229197],"about_ca_topic_score_codex":0.005168874,"about_ca_topic_score_gemma":0.005350496,"teacher_disagreement_score":0.005168874,"about_ca_system_score_codex":0.001594098,"about_ca_system_score_gemma":0.0016449373,"threshold_uncertainty_score":0.014468849},"labels":[],"label_agreement":null},{"id":"W1521235291","doi":"10.1007/978-3-642-36958-2_7","title":"Revisiting Planarity in Position-Based Routing for Wireless Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Planarity testing; Computer network; Computer science; Mathematics; Combinatorics","score_opus":0.01693654096071202,"score_gpt":0.22936865447307173,"score_spread":0.21243211351235972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521235291","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005990771,0.021543968,0.87094384,0.005256356,0.0024352951,0.000063568645,0.00020719985,0.00037129034,0.09318767],"genre_scores_gemma":[0.2659502,0.08211437,0.56723225,0.0035402803,0.0077449046,0.00025944813,0.0006762419,0.001288077,0.07119418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871325,0.00036121023,0.00008004034,0.0002629638,0.00048102494,0.00010164838],"domain_scores_gemma":[0.9975164,0.0015284697,0.00013829726,0.0003470687,0.0004087223,0.00006105818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013478538,0.0016646833,0.001241033,0.0017513053,0.0012815038,0.0034114202,0.0028078638,0.0019755973,0.00679367],"category_scores_gemma":[0.0072204927,0.0009783654,0.0015755346,0.0039639757,0.004563033,0.010776649,0.0035289912,0.0055561154,0.003327431],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018096447,0.000014951319,0.000112076734,0.00034182094,0.000013934487,0.00007678468,0.00019284053,0.02192612,0.00074387394,0.8911786,0.006667566,0.07871333],"study_design_scores_gemma":[0.000009157606,0.000045077806,0.00010109008,0.00013353299,0.000025830397,0.00019784759,0.00008705713,0.028358217,0.00060455303,0.8865998,0.08381069,0.00002717683],"about_ca_topic_score_codex":0.0030667854,"about_ca_topic_score_gemma":0.0024315328,"teacher_disagreement_score":0.00679367,"about_ca_system_score_codex":0.0016677767,"about_ca_system_score_gemma":0.0008337609,"threshold_uncertainty_score":0.022727132},"labels":[],"label_agreement":null},{"id":"W1521554476","doi":"10.1007/11943952_2","title":"Routing Transient Traffic in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Transient (computer programming); Link-state routing protocol; Wireless ad hoc network; Distributed computing; Routing protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.009237131349496065,"score_gpt":0.21917491547869178,"score_spread":0.20993778412919573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521554476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023960376,0.021229655,0.908439,0.00073132064,0.0010624743,0.00009889828,0.000103486294,0.0020903032,0.04228443],"genre_scores_gemma":[0.6067397,0.037667956,0.24639842,0.000446094,0.0017670825,0.00027069563,0.0008370096,0.0006680813,0.105204955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980587,0.000041737527,0.000011370451,0.000027243486,0.00008429418,0.00002959391],"domain_scores_gemma":[0.99932873,0.00040079872,0.0000323403,0.000079804966,0.00013104508,0.000027382985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004743243,0.0005299632,0.0006525273,0.00058034057,0.00039709365,0.0013915839,0.0012476173,0.00069677725,0.0035525311],"category_scores_gemma":[0.0013957076,0.0003574583,0.00020727824,0.0012088588,0.0005522999,0.0017714907,0.0005161227,0.0007764742,0.0013678168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016289836,0.000113513335,0.00043826672,0.0007044759,0.00003526611,0.00026481264,0.00024612193,0.12756166,0.017232606,0.113986276,0.026323365,0.7129308],"study_design_scores_gemma":[0.00003771246,0.00041539688,0.00051208574,0.00021490076,0.00007789902,0.0010557881,0.00022307262,0.7413964,0.011578226,0.13499416,0.109448746,0.00004560228],"about_ca_topic_score_codex":0.00036784005,"about_ca_topic_score_gemma":0.0004563844,"teacher_disagreement_score":0.0035525311,"about_ca_system_score_codex":0.0004944748,"about_ca_system_score_gemma":0.00034689228,"threshold_uncertainty_score":0.011884391},"labels":[],"label_agreement":null},{"id":"W1521991987","doi":"10.1002/9780470570517.ch8","title":"Location Service in Sensor and Mobile Actuator Networks","year":2010,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Actuator; Service (business); Wireless sensor network; Flooding (psychology); Wireless ad hoc network; Mobile ad hoc network; Wireless; Distributed computing; Real-time computing; Artificial intelligence; Telecommunications","score_opus":0.006385001758368106,"score_gpt":0.22105149652151304,"score_spread":0.21466649476314492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1521991987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013436928,0.06713323,0.7746218,0.005975831,0.002072662,0.00023330036,0.00037249306,0.0014844055,0.13466938],"genre_scores_gemma":[0.5091285,0.096426256,0.26695028,0.0023346185,0.003963758,0.0007526185,0.001007614,0.00030156862,0.11913477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991412,0.00023474923,0.000046281282,0.00016270501,0.00034286157,0.00007211837],"domain_scores_gemma":[0.99941826,0.00030271508,0.000056675206,0.00008154515,0.00010390054,0.000036906178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066801097,0.0005809557,0.00074197835,0.00085068523,0.00093930296,0.0024601736,0.0010585962,0.0018142011,0.0061221663],"category_scores_gemma":[0.0017882602,0.00030451923,0.000382824,0.003297048,0.0014449788,0.0043362384,0.0011526012,0.0015041964,0.0024860138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008597522,0.000038399998,0.0004165179,0.0007834246,0.000018990533,0.0002856566,0.00029360762,0.021758983,0.0026246004,0.70364475,0.030299911,0.2397492],"study_design_scores_gemma":[0.000042866362,0.00015801728,0.00066595775,0.0002817645,0.00003828744,0.0010081789,0.0003636448,0.1436755,0.002513025,0.38450992,0.46668196,0.000060844326],"about_ca_topic_score_codex":0.0020513292,"about_ca_topic_score_gemma":0.0013097498,"teacher_disagreement_score":0.0061221663,"about_ca_system_score_codex":0.0014567086,"about_ca_system_score_gemma":0.0011330082,"threshold_uncertainty_score":0.020480692},"labels":[],"label_agreement":null},{"id":"W1522486275","doi":"","title":"Bounded-hop strong connectivity for flocking swarms","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bounded function; Topology (electrical circuits); Hop (telecommunications); Computer science; Flocking (texture); Network topology; Wireless ad hoc network; Graph; Wireless; Mathematics; Discrete mathematics; Computer network; Combinatorics; Theoretical computer science; Physics; Telecommunications","score_opus":0.012122085690517469,"score_gpt":0.23160674688754218,"score_spread":0.2194846611970247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522486275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22133747,0.0012204048,0.7679313,0.0009176363,0.00012705545,0.000075560885,0.00015648636,0.00017804024,0.008056115],"genre_scores_gemma":[0.9774991,0.0006648964,0.017669136,0.000071361035,0.00007401651,0.00011024727,0.000112059686,0.000045635228,0.0037535746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994272,0.00022700768,0.000034602377,0.00010390989,0.00012618022,0.00008118498],"domain_scores_gemma":[0.99275535,0.005347344,0.00063765567,0.0003433826,0.0004452554,0.00047106942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011444117,0.0006934722,0.0011970322,0.0014237128,0.0007923926,0.0014991587,0.001592822,0.0011089488,0.0019880182],"category_scores_gemma":[0.009768924,0.0004474276,0.00059977017,0.001031257,0.001858747,0.0023842666,0.0023366627,0.0012766741,0.00015914511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000243513,0.00007391771,0.00088642404,0.0001932472,0.00007310519,0.00021929436,0.00024004973,0.6647906,0.004361892,0.3077135,0.0016622274,0.019542316],"study_design_scores_gemma":[0.000018928875,0.00006018183,0.00024689946,0.00001038038,0.000012336357,0.000042869513,0.000037462232,0.89869475,0.00028601612,0.100160874,0.00041894917,0.000010416527],"about_ca_topic_score_codex":0.0013631457,"about_ca_topic_score_gemma":0.0009717418,"teacher_disagreement_score":0.0019880182,"about_ca_system_score_codex":0.0006939628,"about_ca_system_score_gemma":0.00048815648,"threshold_uncertainty_score":0.0066506267},"labels":[],"label_agreement":null},{"id":"W1522522675","doi":"10.1002/9780470570517.ch2","title":"Energy‐Efficient Backbones and Broadcasting in Sensor and Actuator Networks","year":2010,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Broadcasting (networking); Actuator; Computer science; Energy (signal processing); Computer network; Wireless sensor network; Telecommunications; Physics; Artificial intelligence","score_opus":0.0066139420105883725,"score_gpt":0.20506839118231585,"score_spread":0.19845444917172747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522522675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010112281,0.08441347,0.71254283,0.003797449,0.0029493459,0.00023886535,0.00048692853,0.0017403024,0.18371846],"genre_scores_gemma":[0.14695121,0.19426903,0.37864482,0.0015830724,0.0033034298,0.00040288345,0.0012119637,0.0005604924,0.27307305],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998574,0.000022894763,0.000007495354,0.000019298603,0.00008088354,0.000011875256],"domain_scores_gemma":[0.99989176,0.000053763124,0.000007684686,0.000010503901,0.000029281926,0.0000070681044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024218965,0.00027799094,0.00026957784,0.0006646227,0.00031844463,0.0010210706,0.00053804455,0.00048572128,0.008168161],"category_scores_gemma":[0.00041040895,0.0002400489,0.00019703804,0.0015872922,0.00041572438,0.0015408649,0.00040457153,0.0006045241,0.0019962501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037483554,0.000046021043,0.00023870757,0.0006470308,0.000019785533,0.00007496872,0.00018016608,0.026040152,0.008136556,0.36823612,0.061959278,0.5343838],"study_design_scores_gemma":[0.000018016739,0.0000737008,0.0006790831,0.0002442092,0.000023359684,0.00028353382,0.00013289558,0.07383097,0.0046266452,0.13165858,0.7884023,0.000026703761],"about_ca_topic_score_codex":0.0014675733,"about_ca_topic_score_gemma":0.0021536753,"teacher_disagreement_score":0.008168161,"about_ca_system_score_codex":0.00045992256,"about_ca_system_score_gemma":0.00040242515,"threshold_uncertainty_score":0.027325213},"labels":[],"label_agreement":null},{"id":"W1526666907","doi":"","title":"A Simple Distributed Method for Control over Wireless Networks","year":2011,"lang":"en","type":"article","venue":"Scholarly Commons (University of Pennsylvania)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Scalability; Robustness (evolution); Wireless network; Distributed computing; Wireless; Computation; Computer network; Telecommunications; Algorithm","score_opus":0.022173495470650235,"score_gpt":0.2317062696428983,"score_spread":0.20953277417224808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526666907","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007132359,0.00013306757,0.9956813,0.00009962177,0.00013956099,0.000048587346,0.000022004562,0.0003032224,0.0028595],"genre_scores_gemma":[0.1414222,0.0007085061,0.83306706,0.00032163458,0.00036178218,0.00066548714,0.000121002275,0.00024194583,0.023090482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993931,0.00011446476,0.000037486207,0.00013594529,0.00028570122,0.000033233464],"domain_scores_gemma":[0.9996886,0.00008805828,0.000022096749,0.00011280832,0.0000642923,0.000024278139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065912755,0.0005768657,0.0004329948,0.00049266487,0.00061433495,0.0010214964,0.0012288399,0.0008155937,0.006945759],"category_scores_gemma":[0.0012915966,0.00023152544,0.00049379724,0.0005569896,0.0010178074,0.0016451057,0.0012716461,0.001455681,0.0015021025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112685004,0.00009460457,0.0002441135,0.0002960357,0.000054696615,0.00019899552,0.00025500933,0.06503317,0.043407924,0.5830627,0.010090721,0.29714933],"study_design_scores_gemma":[0.00017434517,0.000206718,0.0001745646,0.000061597966,0.00004747989,0.00034013137,0.00003969667,0.6528755,0.013400902,0.16780478,0.16481617,0.00005810693],"about_ca_topic_score_codex":0.0007159253,"about_ca_topic_score_gemma":0.00094165193,"teacher_disagreement_score":0.006945759,"about_ca_system_score_codex":0.0005082263,"about_ca_system_score_gemma":0.0005997022,"threshold_uncertainty_score":0.023235857},"labels":[],"label_agreement":null},{"id":"W1527244369","doi":"10.1007/978-3-540-77444-0_58","title":"On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of British Columbia; McGill University","funders":"","keywords":"Wireless ad hoc network; Computer science; Destination-Sequenced Distance Vector routing; Combinatorics; Computer network; Routing (electronic design automation); Dynamic Source Routing; Mathematics; Wireless; Routing protocol; Telecommunications","score_opus":0.01391096567403587,"score_gpt":0.2246083153789703,"score_spread":0.21069734970493442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527244369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030112993,0.0072218236,0.9772843,0.0008406975,0.00074434944,0.00006945504,0.00006534735,0.00054978236,0.010212848],"genre_scores_gemma":[0.27513623,0.034949325,0.65963805,0.0011569186,0.0020935778,0.00063307094,0.0005768372,0.0006571185,0.025158796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985775,0.0005520332,0.00008863329,0.00014281904,0.00049524213,0.0001438323],"domain_scores_gemma":[0.997315,0.0019958997,0.00009313912,0.00031982566,0.00020361254,0.00007249651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020115536,0.0017743035,0.001701554,0.0013423618,0.00088177965,0.0021746028,0.003398836,0.0016838755,0.005096108],"category_scores_gemma":[0.0058292043,0.000662838,0.00087733736,0.0027685186,0.0018340773,0.0038708579,0.0028915012,0.0028440685,0.001392681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002486338,0.00009797117,0.00029774828,0.0007024568,0.00011509407,0.00028031078,0.00034985493,0.31188852,0.0030363782,0.36151782,0.03291638,0.28854877],"study_design_scores_gemma":[0.000043500913,0.00011868463,0.0001873916,0.00013920065,0.00004467458,0.00030482374,0.000083146115,0.66641927,0.0014254581,0.30486783,0.026317164,0.000048806694],"about_ca_topic_score_codex":0.0017059555,"about_ca_topic_score_gemma":0.0015621865,"teacher_disagreement_score":0.005096108,"about_ca_system_score_codex":0.0013722341,"about_ca_system_score_gemma":0.00072589,"threshold_uncertainty_score":0.01704818},"labels":[],"label_agreement":null},{"id":"W1527822878","doi":"10.1109/milcom.2003.1290313","title":"Parameterized neighborhood-based flooding for ad hoc wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Flooding (psychology); Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Distributed computing; Node (physics); Parameterized complexity; Network topology; Wireless network; Metric (unit); Wireless; Algorithm; Engineering; Network packet","score_opus":0.016348259007103193,"score_gpt":0.2401465416789809,"score_spread":0.2237982826718777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527822878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008155567,0.0035214392,0.9850391,0.00022442966,0.00010357693,0.00013264378,0.000070921546,0.00049666123,0.0022556807],"genre_scores_gemma":[0.37518072,0.01128381,0.60818213,0.00011134494,0.00028749384,0.000897635,0.00053844106,0.00017172527,0.0033466767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943966,0.00019843859,0.000039775052,0.0000530612,0.00024746842,0.000021578764],"domain_scores_gemma":[0.9989454,0.0005742183,0.00012924403,0.00017052013,0.00014767847,0.000032948945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006908482,0.00043777548,0.0006120764,0.00055431505,0.0005265476,0.0006885749,0.000993716,0.00054185744,0.00076467264],"category_scores_gemma":[0.0046595884,0.00026902324,0.0003299897,0.0012602613,0.0006143534,0.0016751043,0.0006605016,0.00057682116,0.00026891296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107342115,0.000049040675,0.0010769161,0.00064946874,0.00008021471,0.0002489883,0.00035737734,0.55491734,0.0148873655,0.18243761,0.0075604855,0.23762779],"study_design_scores_gemma":[0.000028577915,0.00012955765,0.00045004263,0.000054645225,0.000039547835,0.00038147005,0.000072038616,0.86693376,0.003287976,0.09560971,0.032974653,0.00003791682],"about_ca_topic_score_codex":0.0016494101,"about_ca_topic_score_gemma":0.0012413273,"teacher_disagreement_score":0.0016494101,"about_ca_system_score_codex":0.0005923629,"about_ca_system_score_gemma":0.00056785205,"threshold_uncertainty_score":0.004297912},"labels":[],"label_agreement":null},{"id":"W1529752038","doi":"10.1109/wimob.2005.1512918","title":"On the potential of hybrid route/relay schemes","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Redundancy (engineering); Relay; Tree traversal; Network packet; Throughput; Mobile ad hoc network; Wireless ad hoc network; Mobility model; Routing (electronic design automation); Transmission delay; Distributed computing; Wireless; Telecommunications; Algorithm","score_opus":0.00538986423356913,"score_gpt":0.19340033546854976,"score_spread":0.18801047123498063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529752038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41822627,0.009579063,0.52765965,0.002216603,0.000239533,0.00013962925,0.00013789424,0.0010587298,0.040742636],"genre_scores_gemma":[0.9580545,0.0013025606,0.037995268,0.00013142743,0.000110568326,0.000049494414,0.000037305337,0.000051059007,0.0022677924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989023,0.0005451626,0.000031885753,0.00010737208,0.00025528375,0.00015794749],"domain_scores_gemma":[0.9930647,0.0045349905,0.0004944059,0.0012917112,0.00044018522,0.00017416645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024582937,0.00065718626,0.0006616155,0.00087372976,0.0007103575,0.0014697642,0.0015081627,0.0012573147,0.0025461887],"category_scores_gemma":[0.0077105067,0.00034589745,0.0004719111,0.0008230128,0.0017791714,0.0038073726,0.0017905044,0.00094356487,0.0005180424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009828062,0.00019481612,0.0019358498,0.00025431454,0.0001514217,0.0004202546,0.00047909384,0.4578119,0.020571308,0.4230777,0.0030635975,0.09105703],"study_design_scores_gemma":[0.000107687716,0.0005810203,0.00043422572,0.000068393245,0.00009276233,0.00064355263,0.00012960129,0.8256492,0.004751137,0.16036199,0.007109803,0.00007063322],"about_ca_topic_score_codex":0.0004907049,"about_ca_topic_score_gemma":0.00039355026,"teacher_disagreement_score":0.0025461887,"about_ca_system_score_codex":0.0006691247,"about_ca_system_score_gemma":0.00031927787,"threshold_uncertainty_score":0.013000846},"labels":[],"label_agreement":null},{"id":"W1530759307","doi":"10.1109/wimob.2005.1512890","title":"Simple and efficient protocols for guaranteed message delivery in wireless ad-hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Router; Wireless ad hoc network; Distributed computing; Subnetwork; Mobile ad hoc network; Wireless network; Wireless; Network packet","score_opus":0.010246100888042852,"score_gpt":0.24659959816740298,"score_spread":0.23635349727936014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530759307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012027388,0.0015151853,0.9834395,0.0002239003,0.00011725816,0.00041302908,0.000048688697,0.0006577151,0.0015574797],"genre_scores_gemma":[0.27252647,0.0028240331,0.717655,0.00023347812,0.0003249421,0.0015514797,0.00027194942,0.00025279814,0.004359843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959157,0.0012406864,0.0004166938,0.00032357365,0.0018530918,0.00025015214],"domain_scores_gemma":[0.99235666,0.0041025514,0.0010470428,0.0017407581,0.0005241147,0.00022899035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004989482,0.0013399305,0.001663237,0.0016822898,0.0011626475,0.0024434065,0.0039760997,0.002088019,0.0018973497],"category_scores_gemma":[0.013652739,0.0009505049,0.0012210192,0.0018265437,0.0027710975,0.0061005536,0.0037011886,0.0031264026,0.0006853577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045126516,0.00044329086,0.00093178905,0.001453716,0.00021918397,0.00045577512,0.0008275807,0.1198063,0.036371265,0.62475127,0.004592344,0.20969622],"study_design_scores_gemma":[0.00048029821,0.0011503178,0.00055274187,0.0002326877,0.00026967452,0.0010010428,0.00023091401,0.57811487,0.025853764,0.3431946,0.04872728,0.00019177231],"about_ca_topic_score_codex":0.00035882095,"about_ca_topic_score_gemma":0.00049874384,"teacher_disagreement_score":0.004989482,"about_ca_system_score_codex":0.0012056213,"about_ca_system_score_gemma":0.0010956012,"threshold_uncertainty_score":0.026387155},"labels":[],"label_agreement":null},{"id":"W1534342069","doi":"10.48550/arxiv.1204.5641","title":"Stability Analysis of Path-vector Routing","year":2012,"lang":"fr","type":"preprint","venue":"arXiv (Cornell University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Path vector protocol; Border Gateway Protocol; Routing protocol; Computer science; Default-free zone; Distance-vector routing protocol; Stability (learning theory); Interior gateway protocol; Routing (electronic design automation); Enhanced Interior Gateway Routing Protocol; Distributed computing; Computer network; Link-state routing protocol; Path (computing); Machine learning","score_opus":0.09187935230522015,"score_gpt":0.19295144824583202,"score_spread":0.10107209594061187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534342069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13726836,0.0011698,0.8500617,0.0003487177,0.000050143637,0.00012013998,0.00031437151,0.00049144874,0.01017537],"genre_scores_gemma":[0.97573733,0.000577746,0.021164125,0.000040664225,0.000075629716,0.000092549366,0.0002586668,0.00010820003,0.0019451559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990073,0.00028103212,0.000041804575,0.00021442729,0.00037321929,0.00008222202],"domain_scores_gemma":[0.9945944,0.0027840016,0.00086744875,0.00053359364,0.0010645156,0.00015614815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014861603,0.0005576682,0.000528696,0.001998853,0.0006508541,0.0011941497,0.0007267929,0.00042299044,0.0018482264],"category_scores_gemma":[0.009618178,0.00019788416,0.00033100462,0.0011592403,0.0012667272,0.0016817885,0.0009884494,0.00083314534,0.0003404782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014210178,0.000057080022,0.007982766,0.00017570805,0.00011722553,0.00012928745,0.00032924878,0.66046685,0.016559996,0.2552596,0.0019113107,0.056868773],"study_design_scores_gemma":[0.000003108741,0.000032363252,0.00094994257,0.000010190865,0.000008262241,0.000037913018,0.000035934474,0.95296884,0.0021851147,0.042919446,0.00083725475,0.000011735622],"about_ca_topic_score_codex":0.0016517059,"about_ca_topic_score_gemma":0.00047724298,"teacher_disagreement_score":0.001998853,"about_ca_system_score_codex":0.0013295474,"about_ca_system_score_gemma":0.0005789939,"threshold_uncertainty_score":0.009646535},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W1536075984","doi":"10.1007/978-3-540-27824-5_49","title":"Flexible QoS Routing Protocol for Mobile Ad Hoc Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer network; Quality of service; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Wireless ad hoc network; Network packet; Optimized Link State Routing Protocol; Queuing delay; Routing protocol; Mobile QoS; Distributed computing; Ad hoc wireless distribution service; Queueing theory; Service (business); Wireless","score_opus":0.02200180455192185,"score_gpt":0.28410791243299155,"score_spread":0.2621061078810697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536075984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010658055,0.009359605,0.9451537,0.0010403167,0.0016174266,0.00019371406,0.0003114137,0.0031512,0.028514517],"genre_scores_gemma":[0.3478694,0.011865302,0.559453,0.0008689558,0.0010611444,0.0006256586,0.0018559949,0.000873444,0.07552713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969697,0.00005269067,0.000022496684,0.000039717208,0.0001494782,0.000038674516],"domain_scores_gemma":[0.9995413,0.00013524875,0.000028703716,0.00011154186,0.00015210877,0.000031115902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005436041,0.00055791915,0.0004073034,0.00067420176,0.00060657033,0.00088783033,0.0013184149,0.0005831011,0.0032585599],"category_scores_gemma":[0.001101989,0.000281016,0.00025789425,0.0009216009,0.0004380692,0.0010485263,0.0007011607,0.0014456841,0.0010547206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023251191,0.00007985984,0.00030174453,0.0005315545,0.00005064909,0.00037335703,0.00032174922,0.030844701,0.05516018,0.1407321,0.056632522,0.714739],"study_design_scores_gemma":[0.00010821672,0.00045343212,0.001038614,0.00026789287,0.0001542653,0.0018696862,0.00023004651,0.2912353,0.034931786,0.14586298,0.5236734,0.00017437642],"about_ca_topic_score_codex":0.0009190872,"about_ca_topic_score_gemma":0.0012628295,"teacher_disagreement_score":0.0032585599,"about_ca_system_score_codex":0.0005072484,"about_ca_system_score_gemma":0.00046880776,"threshold_uncertainty_score":0.010900974},"labels":[],"label_agreement":null},{"id":"W1536563834","doi":"10.1109/ccece.2005.1557394","title":"Mobile ad-hoc networks with QoS and RSVP provisioning","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Quality of service; Multiprotocol Label Switching; Integrated services; Scalability; Resource Reservation Protocol; Mobile ad hoc network; Differentiated services; Mobile QoS; Distributed computing; Service (business); Service provider; The Internet; Internet Protocol; Network packet","score_opus":0.0035614061295839625,"score_gpt":0.19188486394337192,"score_spread":0.18832345781378795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536563834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023687249,0.01799929,0.86241305,0.0026170772,0.0016070936,0.0004055168,0.00035159508,0.0021649024,0.08875415],"genre_scores_gemma":[0.5075071,0.01560879,0.44363588,0.0006748528,0.001274658,0.00037945306,0.00045102226,0.00012148016,0.030346854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934167,0.00019518539,0.000032001608,0.000048495815,0.00033393697,0.00004872162],"domain_scores_gemma":[0.999648,0.000121520585,0.00004904068,0.00005824019,0.00009836936,0.000024843624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000704548,0.0004605106,0.00028335393,0.0004646243,0.00058286224,0.00091065024,0.00067759387,0.0005967083,0.0014677759],"category_scores_gemma":[0.001800117,0.00022705311,0.00018158875,0.0006930078,0.00044566533,0.0013617954,0.00079877523,0.00061865535,0.000965599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016798651,0.000108709806,0.0012490611,0.0006619873,0.00006902619,0.0011050333,0.00038407158,0.06648327,0.019406015,0.44686857,0.018630125,0.44486612],"study_design_scores_gemma":[0.00008062634,0.0003341533,0.00082476105,0.0001668133,0.00010353171,0.002255946,0.00019678951,0.30258793,0.012549427,0.220415,0.46040043,0.0000846327],"about_ca_topic_score_codex":0.00089882954,"about_ca_topic_score_gemma":0.000897782,"teacher_disagreement_score":0.0014677759,"about_ca_system_score_codex":0.0003336485,"about_ca_system_score_gemma":0.00055430154,"threshold_uncertainty_score":0.004910171},"labels":[],"label_agreement":null},{"id":"W1537572056","doi":"10.1007/978-3-642-14785-2_2","title":"An Energy Efficient Power Control Protocol for Ad Hoc Networks Using Directional Antennas","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Omnidirectional antenna; Directional antenna; Wireless ad hoc network; Computer network; Power control; Transmission (telecommunications); Node (physics); Transmitter power output; Mobile ad hoc network; Wireless; Wireless network; Power (physics); Telecommunications; Transmitter; Channel (broadcasting); Antenna (radio); Network packet; Engineering","score_opus":0.013659303393195304,"score_gpt":0.2666508605373502,"score_spread":0.2529915571441549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537572056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00486926,0.0007670732,0.98700047,0.00013015387,0.00027520568,0.00009640188,0.000035238452,0.0007992004,0.006027138],"genre_scores_gemma":[0.39734274,0.002212405,0.55930054,0.00043342245,0.00044956722,0.00059428957,0.0003618494,0.00029100163,0.039014168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996921,0.00006160891,0.000026505979,0.000031799653,0.00016256634,0.00002551195],"domain_scores_gemma":[0.9996,0.00018719345,0.000026045225,0.00006963559,0.00010251048,0.000014568488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045008768,0.0006450373,0.00045891947,0.00039969652,0.00038776436,0.00070408545,0.0010770268,0.00049631356,0.0023870708],"category_scores_gemma":[0.00089056016,0.0002504347,0.00028401305,0.0005064112,0.00044197612,0.0008432688,0.0006568297,0.0010056305,0.0006549172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038668764,0.00026787687,0.00029409636,0.00033517103,0.00010772036,0.00039738562,0.00023360271,0.1635234,0.09746773,0.11753834,0.019921146,0.5995268],"study_design_scores_gemma":[0.00013702209,0.00044552787,0.00044414573,0.00004806736,0.00012485239,0.0007849939,0.00006328382,0.8603966,0.036527306,0.04097635,0.05998477,0.00006708358],"about_ca_topic_score_codex":0.0003498344,"about_ca_topic_score_gemma":0.0008040203,"teacher_disagreement_score":0.0023870708,"about_ca_system_score_codex":0.00025930777,"about_ca_system_score_gemma":0.00027243994,"threshold_uncertainty_score":0.007985592},"labels":[],"label_agreement":null},{"id":"W153882112","doi":"10.1007/978-3-540-79549-0_81","title":"Multi-commodity Flow Problem for Multi-hop Wireless Networks with Realistic Smart Antenna Model","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless network; Smart antenna; Interference (communication); Wireless sensor network; Wireless; Distributed computing; Antenna (radio); Directional antenna; Telecommunications; Channel (broadcasting)","score_opus":0.032839794792759634,"score_gpt":0.24951143519062896,"score_spread":0.21667164039786932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W153882112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031117832,0.0011368559,0.95681363,0.001814958,0.000255315,0.00018837603,0.0004082579,0.00017555329,0.008089232],"genre_scores_gemma":[0.7299887,0.0028286122,0.23873721,0.0004352711,0.0005396895,0.0006794547,0.00081732194,0.00022262958,0.025751144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998591,0.0007137202,0.000048275386,0.0002630838,0.00019672544,0.00018706906],"domain_scores_gemma":[0.99691343,0.0023595698,0.00020799342,0.0001361751,0.0001843697,0.0001984863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026635537,0.0015969998,0.0024822496,0.001057428,0.0012642267,0.0028158873,0.0035094284,0.0036209628,0.004966641],"category_scores_gemma":[0.0066273236,0.0017779947,0.001235984,0.0024156002,0.0017805065,0.004723747,0.0018012852,0.0026448634,0.00047385902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007062042,0.000052999956,0.000177868,0.00011665201,0.000034266366,0.00012389438,0.00003818882,0.93195957,0.0003056363,0.058004048,0.0028696926,0.006246565],"study_design_scores_gemma":[0.000016777536,0.000013127474,0.00005076374,0.000007702126,0.000007132466,0.000032441516,0.000014672826,0.9710906,0.0000672134,0.028045798,0.0006463557,0.000007355661],"about_ca_topic_score_codex":0.0032610775,"about_ca_topic_score_gemma":0.0020918606,"teacher_disagreement_score":0.004966641,"about_ca_system_score_codex":0.0026957649,"about_ca_system_score_gemma":0.0013832465,"threshold_uncertainty_score":0.019559264},"labels":[],"label_agreement":null},{"id":"W1540023932","doi":"10.1201/9781420040401.ch13","title":"Structured Proactive and Reactive Routing for Wireless Mobile Ad Hoc Networks","year":2002,"lang":"en","type":"book-chapter","venue":"˜The œelectrical engineering handbook/Electrical engineering handbook series/Electrical engineering handbook","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mobile ad hoc network; Computer network; Wireless ad hoc network; Computer science; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications","score_opus":0.005944553031767373,"score_gpt":0.17765019909100588,"score_spread":0.1717056460592385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540023932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004642976,0.15625826,0.624552,0.0019307958,0.005374581,0.0005044564,0.00037369868,0.0038026585,0.20256054],"genre_scores_gemma":[0.04977838,0.16128708,0.4733306,0.001479807,0.002742671,0.00075691903,0.0014534306,0.0007372153,0.30843398],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997261,0.000039983297,0.000014482123,0.000035197245,0.00017102633,0.00001316111],"domain_scores_gemma":[0.9998035,0.00008501995,0.000012897164,0.000032638243,0.000051961302,0.000014069204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003053271,0.0010739706,0.00038650827,0.00061679166,0.00040156982,0.0013423107,0.0012649628,0.0009393329,0.0070641697],"category_scores_gemma":[0.00059879746,0.000423767,0.00034053109,0.00137891,0.0006245057,0.001501953,0.0005450005,0.0012555526,0.0064094607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043599324,0.000079292855,0.00010792593,0.0012307647,0.000027001974,0.00017838068,0.0002730707,0.011143261,0.009457726,0.121884584,0.09234279,0.76323164],"study_design_scores_gemma":[0.000021144226,0.00013916993,0.0003166039,0.00030650035,0.000026582056,0.00073594914,0.00008748966,0.02098943,0.0017751157,0.057888024,0.9176712,0.00004276901],"about_ca_topic_score_codex":0.00057708484,"about_ca_topic_score_gemma":0.0011578795,"teacher_disagreement_score":0.0070641697,"about_ca_system_score_codex":0.00047069692,"about_ca_system_score_gemma":0.0006490407,"threshold_uncertainty_score":0.02363199},"labels":[],"label_agreement":null},{"id":"W1540495411","doi":"10.1109/wirles.2005.1549404","title":"Traffic Balancing in Wireless MESH Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Wireless ad hoc network; Load balancing (electrical power); Wireless network; Switched mesh; Network packet; Shared mesh; Order One Network Protocol; Mesh networking; Distributed computing; Wireless; Telecommunications","score_opus":0.007712735089506273,"score_gpt":0.2182098408324232,"score_spread":0.21049710574291694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540495411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05661282,0.007948785,0.9121976,0.001057938,0.0006877224,0.00019053572,0.00016819547,0.0009515524,0.02018487],"genre_scores_gemma":[0.906947,0.0045208884,0.07966665,0.00023422911,0.00074806286,0.0002425852,0.0003478326,0.000137252,0.007155339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992878,0.00025429737,0.000035836663,0.00009113867,0.00024019102,0.00009083401],"domain_scores_gemma":[0.99922705,0.00035861562,0.00009158112,0.00008377669,0.0001883513,0.0000505814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009833932,0.00043045182,0.00046602686,0.00087860436,0.0007399124,0.00107515,0.0009493415,0.0007593554,0.0016871699],"category_scores_gemma":[0.0035156705,0.00027663723,0.00023589344,0.0011490237,0.00045409444,0.0019068389,0.0008976426,0.00049056945,0.00051162473],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042535213,0.0001259064,0.0016935441,0.00037049627,0.00009426833,0.0003405802,0.0002000223,0.4537531,0.01679195,0.15683152,0.0123258475,0.3570474],"study_design_scores_gemma":[0.000029969819,0.000085474654,0.00031665596,0.000035317793,0.000030427613,0.0002121484,0.00007428221,0.894106,0.0026287215,0.08848106,0.013977987,0.00002196318],"about_ca_topic_score_codex":0.00090862345,"about_ca_topic_score_gemma":0.00057558605,"teacher_disagreement_score":0.0016871699,"about_ca_system_score_codex":0.0006269735,"about_ca_system_score_gemma":0.00038088777,"threshold_uncertainty_score":0.0056441426},"labels":[],"label_agreement":null},{"id":"W1540595803","doi":"10.1109/glocom.2002.1188035","title":"Elective participation in ad hoc networks based on energy consumption","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Energy consumption; Wireless ad hoc network; Computer science; Mobile ad hoc network; Consumption (sociology); Post-hoc analysis; Vehicular ad hoc network; Computer network; Telecommunications; Sociology; Statistics; Engineering; Electrical engineering; Mathematics; Wireless","score_opus":0.015762039346377557,"score_gpt":0.25722894695193105,"score_spread":0.2414669076055535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1540595803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24195184,0.0019390582,0.73209,0.00082722923,0.00013079683,0.00021660017,0.00011251727,0.00076227804,0.021969715],"genre_scores_gemma":[0.97474897,0.000519552,0.020221086,0.000048642363,0.00004640088,0.000094502924,0.000059262173,0.00004529865,0.0042163213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00030516638,0.000036665027,0.00011257632,0.00029920344,0.00013220782],"domain_scores_gemma":[0.99784255,0.0012100342,0.00020297091,0.00025725944,0.00028077193,0.00020651928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014372529,0.00050495355,0.0005673979,0.00079243036,0.0007234232,0.0013475227,0.0013074976,0.000652272,0.0015479664],"category_scores_gemma":[0.004516108,0.00027119546,0.00031960677,0.0010028674,0.0011419539,0.0024074616,0.0015149652,0.0005445059,0.00033137592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005528691,0.00023982159,0.010474851,0.0002570227,0.00008132181,0.0006399458,0.0011875755,0.49882618,0.017034888,0.29021108,0.0038077729,0.17668663],"study_design_scores_gemma":[0.000041509164,0.00022100724,0.0020597733,0.00003152287,0.0000402615,0.0004829927,0.00030923795,0.8804437,0.004546078,0.10307134,0.00870328,0.00004929871],"about_ca_topic_score_codex":0.0011055339,"about_ca_topic_score_gemma":0.0013039247,"teacher_disagreement_score":0.0015479664,"about_ca_system_score_codex":0.00082198135,"about_ca_system_score_gemma":0.00058110664,"threshold_uncertainty_score":0.007600963},"labels":[],"label_agreement":null},{"id":"W1541800957","doi":"10.1007/978-1-4614-6357-3_4","title":"Conclusions and Open Issues","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Geology","score_opus":0.022552976884726808,"score_gpt":0.2707520759540469,"score_spread":0.24819909906932008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1541800957","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025950214,0.045085836,0.006529784,0.48469532,0.14745395,0.00016523007,0.0015303233,0.00047677656,0.31146777],"genre_scores_gemma":[0.04958903,0.06348983,0.014752244,0.21433286,0.06695105,0.0005708717,0.0038302923,0.0008847455,0.58559906],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99406576,0.0014861701,0.00025255937,0.0008811978,0.0022244852,0.0010897676],"domain_scores_gemma":[0.97853,0.0039985855,0.0005713767,0.0017225607,0.010834257,0.004343231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011453691,0.00082621904,0.0008231555,0.0018438149,0.0038298285,0.014442483,0.003917394,0.0066234483,0.1626863],"category_scores_gemma":[0.028911723,0.0003253862,0.0013652055,0.002877229,0.0032663113,0.015292059,0.005731371,0.0072137895,0.059728235],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018461974,0.00016695507,0.00040904948,0.0007234079,0.00001866301,0.00012851469,0.0005544004,0.00022576077,0.00031266094,0.16356084,0.7281614,0.105553746],"study_design_scores_gemma":[0.000025376145,0.000027630369,0.0003526896,0.00070071867,0.000015351494,0.00006588766,0.001900274,0.00011544141,0.00021428826,0.083172075,0.9133964,0.000013870016],"about_ca_topic_score_codex":0.004493416,"about_ca_topic_score_gemma":0.004940861,"teacher_disagreement_score":0.1626863,"about_ca_system_score_codex":0.004514974,"about_ca_system_score_gemma":0.010917512,"threshold_uncertainty_score":0.5442399},"labels":[],"label_agreement":null},{"id":"W1542609757","doi":"10.71781/9694","title":"Protocole de routage basé sur des passerelles mobiles pour un accès Internet dans les réseaux véhiculaires","year":2011,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Computer network; Computer science; Routing protocol; Vehicular ad hoc network; The Internet; Wireless ad hoc network; Wireless; Routing (electronic design automation); Telecommunications; World Wide Web","score_opus":0.013405959423320471,"score_gpt":0.19135638294726937,"score_spread":0.1779504235239489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542609757","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06059003,0.0066582933,0.7835238,0.0034643458,0.002233543,0.0026752613,0.0018357383,0.011126266,0.12789272],"genre_scores_gemma":[0.5773196,0.008111371,0.20316453,0.001261896,0.00071233953,0.0032766338,0.0041347123,0.00094783923,0.20107113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99699044,0.0007552067,0.00034804735,0.00046854926,0.0011112631,0.00032647743],"domain_scores_gemma":[0.9966537,0.00081556506,0.00024155926,0.000634849,0.001498125,0.00015630531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002774705,0.0010918343,0.001217938,0.0020060674,0.002323492,0.0049735024,0.0013596262,0.0021260108,0.01212668],"category_scores_gemma":[0.0055789147,0.00066262885,0.000930254,0.0013258411,0.0014703773,0.004155042,0.0025226993,0.002347144,0.006572021],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00209755,0.00043636494,0.004439978,0.0021784897,0.0003404275,0.0032631056,0.005224719,0.041179724,0.08359392,0.4094027,0.048260357,0.39958262],"study_design_scores_gemma":[0.00033627707,0.0011913715,0.0029842432,0.00070138177,0.00026644205,0.0020618285,0.0017128334,0.13055015,0.080702394,0.035353072,0.7437152,0.0004247447],"about_ca_topic_score_codex":0.011092322,"about_ca_topic_score_gemma":0.006523145,"teacher_disagreement_score":0.01212668,"about_ca_system_score_codex":0.0021489647,"about_ca_system_score_gemma":0.003978493,"threshold_uncertainty_score":0.040567815},"labels":[],"label_agreement":null},{"id":"W1542789490","doi":"10.1007/0-387-23150-1_30","title":"Randomized Routing Algorithms in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Wireless Routing Protocol; Wireless ad hoc network; Heuristic; Computer network; Distributed computing; Optimized Link State Routing Protocol; Dynamic Source Routing; Greedy algorithm; Algorithm; Static routing; Routing (electronic design automation); Routing protocol; Artificial intelligence; Telecommunications","score_opus":0.014394761284462152,"score_gpt":0.2618405975754782,"score_spread":0.24744583629101602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1542789490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003297422,0.006491725,0.9743009,0.0012621543,0.0009878197,0.000134642,0.00013601413,0.0010018781,0.012387423],"genre_scores_gemma":[0.15249121,0.0095903035,0.8013172,0.0011361798,0.0020181576,0.0009864643,0.00084238837,0.0005414859,0.031076482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968844,0.0015310973,0.00013175748,0.00040914328,0.00084691535,0.00019653837],"domain_scores_gemma":[0.9958496,0.0028195705,0.00018147298,0.00069509126,0.00036911198,0.000085148815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027493355,0.0011843037,0.0016804977,0.0010099275,0.0009171338,0.0020704474,0.0028952414,0.0019530468,0.006697253],"category_scores_gemma":[0.009978485,0.00093561714,0.00064935494,0.0025578411,0.0018295385,0.0037943586,0.0014979972,0.0028242453,0.0022907439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024132566,0.00018182026,0.00021204696,0.00047767407,0.00007552397,0.000055434495,0.00009143212,0.23517324,0.0019597246,0.44859535,0.04609484,0.26684168],"study_design_scores_gemma":[0.00016533233,0.00010647338,0.00014999812,0.000100713,0.00003875019,0.00010670434,0.000037347956,0.57104707,0.0011387593,0.38953352,0.037539493,0.00003586881],"about_ca_topic_score_codex":0.0011627498,"about_ca_topic_score_gemma":0.0013779923,"teacher_disagreement_score":0.006697253,"about_ca_system_score_codex":0.0017973174,"about_ca_system_score_gemma":0.0018047679,"threshold_uncertainty_score":0.022404611},"labels":[],"label_agreement":null},{"id":"W1545175026","doi":"10.1109/pimrc.2003.1259202","title":"Multipath bandwidth splitting reservation in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Bandwidth (computing); Reservation; Quality of service; Network packet; Wireless ad hoc network; Vehicular ad hoc network; Multipath propagation; Distributed computing; Wireless; Telecommunications","score_opus":0.015973976286692056,"score_gpt":0.24034720031103923,"score_spread":0.22437322402434717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545175026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087321244,0.007201523,0.89822936,0.00048879604,0.00026893103,0.00007170971,0.000047315025,0.00092096545,0.00545013],"genre_scores_gemma":[0.89614564,0.0021751907,0.09914537,0.00008208997,0.00019445145,0.00006842038,0.00005846833,0.00004191482,0.002088383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995548,0.000112412425,0.00002480878,0.000057765763,0.00019637335,0.000053812095],"domain_scores_gemma":[0.9993467,0.00028858148,0.00007350582,0.00012836441,0.00011950691,0.00004334458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075556035,0.0003254616,0.0003883396,0.00056832825,0.0004971467,0.0006211794,0.00093010516,0.0004148811,0.00049298996],"category_scores_gemma":[0.0014608846,0.00027515055,0.00021898703,0.00061304873,0.00055760733,0.0012029468,0.00057714316,0.00047760815,0.00016571044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042888493,0.00007630523,0.0028234634,0.00033274636,0.00012866559,0.00065859786,0.00043224046,0.31143567,0.06407323,0.14035037,0.0048019984,0.4744579],"study_design_scores_gemma":[0.000058750815,0.00019315307,0.00067840755,0.000043763284,0.00009783818,0.00076951063,0.00013049887,0.8988864,0.022156924,0.048820287,0.028096933,0.000067584],"about_ca_topic_score_codex":0.0013787774,"about_ca_topic_score_gemma":0.0011121379,"teacher_disagreement_score":0.0013787774,"about_ca_system_score_codex":0.0005518008,"about_ca_system_score_gemma":0.0005535888,"threshold_uncertainty_score":0.004003644},"labels":[],"label_agreement":null},{"id":"W1545615968","doi":"10.1109/icppw.2004.38","title":"Cross-layer flow control in lightly-loaded multi-hop ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Network packet; Wireless ad hoc network; Throughput; Mobile ad hoc network; Node (physics); Hop (telecommunications); Optimized Link State Routing Protocol; Flow control (data); Routing protocol; Wireless; Engineering; Telecommunications","score_opus":0.014796959365890826,"score_gpt":0.25784893934365755,"score_spread":0.24305197997776673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545615968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055157393,0.0037898286,0.93558997,0.0004370907,0.00043083658,0.00014361076,0.000039104798,0.001390959,0.0030211522],"genre_scores_gemma":[0.93109155,0.0015026982,0.063794956,0.0002305504,0.00033622747,0.00010770279,0.000066686436,0.000071438284,0.0027981813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908614,0.00029142166,0.00006511538,0.00014274144,0.00029687575,0.00011759396],"domain_scores_gemma":[0.9979955,0.0010061987,0.00027550646,0.00018884301,0.00039930778,0.00013473148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026422697,0.00074226235,0.0006729051,0.00067836075,0.00077249884,0.0018608149,0.0013762179,0.00069197104,0.0012201268],"category_scores_gemma":[0.0035970327,0.00042246497,0.00022254979,0.00051187497,0.0012265973,0.0014405416,0.0010839951,0.0007876093,0.00028269578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074600265,0.0003827201,0.0017032532,0.00025373197,0.00008503671,0.00037262443,0.0003747922,0.6559608,0.025794338,0.040922973,0.0050080954,0.2683956],"study_design_scores_gemma":[0.000034733574,0.00012348765,0.0002428498,0.000015135918,0.000027345472,0.000053049873,0.00001981558,0.98598516,0.003369238,0.008469831,0.0016383431,0.000020918707],"about_ca_topic_score_codex":0.0032609457,"about_ca_topic_score_gemma":0.0020351599,"teacher_disagreement_score":0.0032609457,"about_ca_system_score_codex":0.00069162424,"about_ca_system_score_gemma":0.00068651355,"threshold_uncertainty_score":0.013973832},"labels":[],"label_agreement":null},{"id":"W1546484454","doi":"","title":"Modeling and Performance Analysis of Service Discovery Strategies in Ad Hoc Networks.","year":2003,"lang":"en","type":"article","venue":"International Conference on Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Service discovery; Wireless ad hoc network; Mobile ad hoc network; Service (business); Vehicular ad hoc network; Distributed computing; Context (archaeology); Computer network; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Routing protocol; World Wide Web; Routing (electronic design automation); Web service; Wireless","score_opus":0.024385920748767668,"score_gpt":0.2604525685639705,"score_spread":0.2360666478152028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546484454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0541653,0.002483129,0.92954147,0.0014717497,0.00015108375,0.00028018924,0.00026854442,0.00037549433,0.011263096],"genre_scores_gemma":[0.90289754,0.0027458982,0.08784095,0.00022404025,0.00023808013,0.0005590568,0.00030954758,0.000121752484,0.005063168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681747,0.0012378121,0.00012597696,0.00034426223,0.0010958168,0.00037862078],"domain_scores_gemma":[0.9904479,0.006957617,0.00096239574,0.00052184414,0.0008774809,0.00023274023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045751217,0.0019830253,0.0012123407,0.0016940774,0.0009127873,0.0022032002,0.003371749,0.0022123177,0.0018482818],"category_scores_gemma":[0.01770063,0.00079104624,0.00095078425,0.0017314242,0.0017027986,0.004324314,0.0011950089,0.0017371649,0.0007130114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003734248,0.000051804967,0.0008294159,0.00008054461,0.000037487887,0.00007293051,0.000116911404,0.9314017,0.0009194033,0.058967497,0.00082737615,0.0066576777],"study_design_scores_gemma":[0.0000040774926,0.00002336115,0.00008285344,0.0000063574325,0.0000093299495,0.000023700968,0.000015114136,0.9885111,0.00012541134,0.010839082,0.00035465136,0.000005005534],"about_ca_topic_score_codex":0.0069595794,"about_ca_topic_score_gemma":0.0038344152,"teacher_disagreement_score":0.0069595794,"about_ca_system_score_codex":0.0038097678,"about_ca_system_score_gemma":0.0020999298,"threshold_uncertainty_score":0.027641892},"labels":[],"label_agreement":null},{"id":"W1547059661","doi":"10.1007/11561354_7","title":"A Multiple Path Characterization of Ad-Hoc Network Capacity","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Throughput; Interference (communication); Wireless ad hoc network; Path (computing); Routing (electronic design automation); Path loss; Channel (broadcasting); Mobile ad hoc network; Computer network; Distributed computing; Topology (electrical circuits); Wireless; Telecommunications; Network packet; Mathematics","score_opus":0.013942518626851757,"score_gpt":0.2107574318717977,"score_spread":0.19681491324494596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547059661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08556964,0.004968904,0.86381173,0.0012217665,0.00017804463,0.00012033161,0.00087822374,0.00054902886,0.04270228],"genre_scores_gemma":[0.9322709,0.002667513,0.056050852,0.00021152991,0.0007389135,0.00025356805,0.00034460987,0.000190683,0.0072715115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828315,0.00043186467,0.000067040724,0.00037226558,0.0005981905,0.00024746818],"domain_scores_gemma":[0.98400486,0.012770598,0.00079494447,0.0010375755,0.0009958512,0.00039611242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019576242,0.0011733035,0.0010579141,0.0043348633,0.0007854391,0.0022383535,0.0022144155,0.0010516449,0.006660083],"category_scores_gemma":[0.013800679,0.0006234335,0.0005706618,0.00431603,0.0027567507,0.008575413,0.0019379146,0.00259647,0.00069942884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012890194,0.00006349876,0.0016370642,0.00034795757,0.000065758795,0.00022097016,0.0003372514,0.20351602,0.009460025,0.72109056,0.0057375077,0.05739448],"study_design_scores_gemma":[0.000009692231,0.00010831203,0.0012251815,0.000080491045,0.000039953262,0.00064778945,0.00012493192,0.61694515,0.003100417,0.37064427,0.007028406,0.00004542019],"about_ca_topic_score_codex":0.000753936,"about_ca_topic_score_gemma":0.00043786442,"teacher_disagreement_score":0.006660083,"about_ca_system_score_codex":0.0016547006,"about_ca_system_score_gemma":0.0005069137,"threshold_uncertainty_score":0.022280157},"labels":[],"label_agreement":null},{"id":"W1547936246","doi":"10.1007/978-1-4614-6357-3","title":"Routing for Wireless Multi-Hop Networks","year":2013,"lang":"en","type":"book","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Hop (telecommunications); Computer science; Wireless network; Wireless; Telecommunications","score_opus":0.019478270692268228,"score_gpt":0.24926274612646526,"score_spread":0.22978447543419703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547936246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002755183,0.3067496,0.44678113,0.002708495,0.010671747,0.00023706116,0.00060890504,0.003613307,0.2258745],"genre_scores_gemma":[0.046242677,0.29916477,0.22950824,0.0011974019,0.006385507,0.0005024863,0.0021061155,0.0012729197,0.41361994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996768,0.000053428674,0.000019845851,0.000048958864,0.00017775672,0.000023100896],"domain_scores_gemma":[0.99973994,0.00011422178,0.0000175313,0.000050600895,0.000061398,0.000016285429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027141275,0.0018060498,0.0011225182,0.0009376344,0.00030750406,0.001642274,0.0013461963,0.0010630009,0.016684564],"category_scores_gemma":[0.0008163568,0.0004271963,0.00046067065,0.0021411995,0.0005183951,0.0026332512,0.00088010967,0.0015624207,0.011079185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033871594,0.0000485433,0.000068348345,0.0014985024,0.000044514156,0.000110702946,0.000076887896,0.017355112,0.00426063,0.09027779,0.13660549,0.7496197],"study_design_scores_gemma":[0.000024284687,0.000084354164,0.00024590507,0.00054986466,0.000042691696,0.0006801978,0.000055868655,0.030750217,0.0012433248,0.11729432,0.8489927,0.000036171376],"about_ca_topic_score_codex":0.00048227914,"about_ca_topic_score_gemma":0.00063154823,"teacher_disagreement_score":0.016684564,"about_ca_system_score_codex":0.0005706449,"about_ca_system_score_gemma":0.00040006478,"threshold_uncertainty_score":0.0558154},"labels":[],"label_agreement":null},{"id":"W1549201808","doi":"10.1007/978-3-642-10625-5_6","title":"Gateways Congestion-Aware Design of Multi-radio Wireless Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Shared mesh; Switched mesh; Order One Network Protocol; Mesh networking; Network congestion; Distributed computing; Throughput; Heuristic; Router; Wireless network; Network packet; Wireless; Telecommunications","score_opus":0.02895333422561576,"score_gpt":0.23466148900458741,"score_spread":0.20570815477897164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549201808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023027718,0.0010029181,0.9671475,0.00015230621,0.00015448943,0.0001139815,0.000039558516,0.0009886961,0.0073728655],"genre_scores_gemma":[0.6662515,0.0009305962,0.32526794,0.0001620629,0.00011327308,0.0001832561,0.00010773542,0.00029261544,0.00669104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994579,0.00016142824,0.000028567541,0.00010182288,0.0001688517,0.00008142817],"domain_scores_gemma":[0.9995196,0.00014386725,0.00005100768,0.000083151055,0.00015069784,0.000051667594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008578925,0.0006793028,0.00065224344,0.0004835316,0.00040673531,0.0013191818,0.0025068996,0.00048243545,0.0026114911],"category_scores_gemma":[0.0010771147,0.0005543156,0.00041723903,0.00033845438,0.00040635534,0.0008050596,0.0009529228,0.0008105318,0.00047989312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025556234,0.00018747225,0.00076024706,0.00034153336,0.000115166804,0.00022978587,0.00020094644,0.7183509,0.0520396,0.060467817,0.0048001804,0.16225082],"study_design_scores_gemma":[0.000021636739,0.0001033484,0.00016397526,0.00001754852,0.00004370349,0.00007932676,0.000020386053,0.9778637,0.008220298,0.00873317,0.0047217268,0.000011152114],"about_ca_topic_score_codex":0.0007688437,"about_ca_topic_score_gemma":0.0021085097,"teacher_disagreement_score":0.0026114911,"about_ca_system_score_codex":0.00085538055,"about_ca_system_score_gemma":0.0006464047,"threshold_uncertainty_score":0.008736312},"labels":[],"label_agreement":null},{"id":"W1550593438","doi":"","title":"The dynamical updating location information scheme (DULIS) - A novel routing for mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Distributed computing; Routing protocol; Link-state routing protocol; Zone Routing Protocol; Mobile ad hoc network; Ad hoc wireless distribution service; Overhead (engineering); Destination-Sequenced Distance Vector routing; Geographic routing; Network packet; Wireless; Telecommunications","score_opus":0.007810661545278274,"score_gpt":0.20481118270746757,"score_spread":0.1970005211621893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1550593438","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018722687,0.0030106094,0.96296626,0.001205078,0.001118046,0.00023225139,0.00010051648,0.0010538463,0.0115907295],"genre_scores_gemma":[0.44791144,0.0051949206,0.52434057,0.0009684304,0.0012722266,0.00065855775,0.00058095733,0.00013035079,0.018942486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993311,0.00013915334,0.00006443372,0.00012458005,0.00028206396,0.000058582926],"domain_scores_gemma":[0.9994369,0.00012231592,0.00013067125,0.00015335945,0.00010713661,0.000049633785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007636182,0.0004599401,0.00059831655,0.00071888015,0.00060827157,0.0013454516,0.0018522816,0.0007583112,0.0009202605],"category_scores_gemma":[0.0012454357,0.00022187244,0.0005681875,0.0005955231,0.00094184215,0.0027309875,0.0013256113,0.0011248592,0.0005781138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018185335,0.0001406109,0.002410249,0.0006396124,0.000114314214,0.00073843874,0.0006852106,0.03960843,0.06896358,0.38652188,0.015509473,0.4844863],"study_design_scores_gemma":[0.00019606957,0.0014184782,0.001430357,0.00019006235,0.00024124881,0.004338803,0.00048088867,0.37887555,0.05948781,0.0659657,0.4870738,0.00030129714],"about_ca_topic_score_codex":0.00034245843,"about_ca_topic_score_gemma":0.00049003714,"teacher_disagreement_score":0.0018522816,"about_ca_system_score_codex":0.0005997801,"about_ca_system_score_gemma":0.00058615976,"threshold_uncertainty_score":0.0043517947},"labels":[],"label_agreement":null},{"id":"W1552241428","doi":"10.1007/11839569_12","title":"Interference-Aware Selfish Routing in Multi-ratio Multi-channel Wireless Mesh Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Nash equilibrium; Wireless mesh network; Computer network; Embarrassment; Game theory; Routing (electronic design automation); Wireless network; Channel (broadcasting); Wireless; Transmission (telecommunications); Interference (communication); Potential game; Distributed computing; Mathematical optimization; Telecommunications; Mathematical economics; Mathematics","score_opus":0.02337255677623723,"score_gpt":0.2456993827548776,"score_spread":0.22232682597864037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552241428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03123741,0.0025762152,0.9590296,0.0002249177,0.00015980219,0.00003084782,0.000026381056,0.000431069,0.006283677],"genre_scores_gemma":[0.8834817,0.0016580619,0.10955961,0.00011155958,0.00021080674,0.00005192427,0.00005274875,0.000119764154,0.0047538304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995782,0.00014855835,0.000018197157,0.00005579669,0.00015227855,0.000046973557],"domain_scores_gemma":[0.9991208,0.00056387874,0.00007205542,0.00009901057,0.000116166804,0.000028162736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070215506,0.00039192033,0.00061988446,0.00044014346,0.0003366301,0.00063333695,0.0014261554,0.00046152493,0.000999896],"category_scores_gemma":[0.0017198282,0.000288448,0.00032839918,0.00055673934,0.00046706016,0.0010157126,0.0008279565,0.0005643823,0.00023341899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029471793,0.00012910918,0.00091152504,0.00037388457,0.00012141323,0.00033599476,0.0003318859,0.60197365,0.050663635,0.085341215,0.0057149027,0.2538081],"study_design_scores_gemma":[0.0000108604445,0.000083212566,0.00020113596,0.000011800139,0.000023211147,0.0002793636,0.00003251344,0.97559637,0.004166722,0.01725733,0.0023214135,0.000016040245],"about_ca_topic_score_codex":0.00023442577,"about_ca_topic_score_gemma":0.00040014315,"teacher_disagreement_score":0.0014261554,"about_ca_system_score_codex":0.00037037072,"about_ca_system_score_gemma":0.00015959919,"threshold_uncertainty_score":0.003713429},"labels":[],"label_agreement":null},{"id":"W1554418054","doi":"10.1007/978-3-540-45209-6_148","title":"Performance Evaluation of Two Congestion Control Mechanisms with On-Demand Distance Vector (AODV) Routing Protocol for Mobile and Wireless Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless Routing Protocol; Computer network; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Distance-vector routing protocol; Destination-Sequenced Distance Vector routing; Zone Routing Protocol; Wireless ad hoc network; Distributed computing; Routing protocol; Mobile ad hoc network; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.016009693867761795,"score_gpt":0.2682478248544917,"score_spread":0.2522381309867299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554418054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97569543,0.001982872,0.016779907,0.00019196837,0.00024944256,0.0001543183,0.0001473319,0.0008188553,0.0039797947],"genre_scores_gemma":[0.99535084,0.00023043601,0.003154617,0.000019629359,0.0000231701,0.000025747735,0.00009942426,0.00002499257,0.0010711754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817085,0.000521137,0.00011025953,0.00019755356,0.0006860467,0.00031406572],"domain_scores_gemma":[0.9926783,0.0044043884,0.0004900529,0.0004703001,0.001622358,0.0003345983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430329,0.001119537,0.0009528011,0.0013924257,0.00059797365,0.0010181842,0.0016864032,0.0008786304,0.0014609743],"category_scores_gemma":[0.0054886676,0.0002753865,0.00031936524,0.00079584407,0.0006452903,0.0012170433,0.000537219,0.00052013417,0.0001609009],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.027730858,0.0049758772,0.016204065,0.0014738145,0.000835816,0.00059839047,0.0006490488,0.41945133,0.20173147,0.005976946,0.0061920094,0.31418034],"study_design_scores_gemma":[0.00071759545,0.011289265,0.009773679,0.000031931733,0.0006073218,0.00029151488,0.00034724435,0.875259,0.09922583,0.000846969,0.0014939622,0.000115738956],"about_ca_topic_score_codex":0.0053294674,"about_ca_topic_score_gemma":0.003328517,"teacher_disagreement_score":0.0053294674,"about_ca_system_score_codex":0.0012686828,"about_ca_system_score_gemma":0.000700054,"threshold_uncertainty_score":0.012852967},"labels":[],"label_agreement":null},{"id":"W1554426854","doi":"10.1109/wimob.2005.1512908","title":"A SIP-based multicast framework in MANET","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Computer network; Overlay multicast; Overlay network; Distributed computing; Protocol Independent Multicast; Mobile ad hoc network; Xcast; Pragmatic General Multicast; Source-specific multicast; IP multicast; Network topology; The Internet; World Wide Web","score_opus":0.0071016540792995025,"score_gpt":0.22595486431572512,"score_spread":0.21885321023642562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554426854","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077527044,0.0013920116,0.9735791,0.00058133533,0.00035421678,0.00019474076,0.00009337991,0.0026635085,0.013388933],"genre_scores_gemma":[0.32063136,0.0024399587,0.66066265,0.00062440074,0.00050106714,0.0005675988,0.000405388,0.00023375949,0.013933858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954396,0.00016821077,0.00003477508,0.000043048756,0.0001712024,0.000038710103],"domain_scores_gemma":[0.9997813,0.000054134292,0.00001359503,0.00003877136,0.00007245613,0.000039755614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011002073,0.0003812096,0.00043087447,0.0005373655,0.0010402937,0.001194238,0.0010157427,0.0010114859,0.0017773438],"category_scores_gemma":[0.000866942,0.00023690931,0.00044885994,0.00042231803,0.0005444701,0.0013500989,0.0011877606,0.0009631293,0.00070995284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030969986,0.00019241891,0.00068947923,0.00045069636,0.00009778789,0.0017219039,0.0008872152,0.06977574,0.032197684,0.59072465,0.02364666,0.27930605],"study_design_scores_gemma":[0.00007013106,0.0003118564,0.00032110774,0.00012248362,0.00010330102,0.0011721642,0.00024187959,0.68256724,0.014340484,0.1246118,0.17604177,0.00009584683],"about_ca_topic_score_codex":0.00089813484,"about_ca_topic_score_gemma":0.00095430604,"teacher_disagreement_score":0.0017773438,"about_ca_system_score_codex":0.00042978025,"about_ca_system_score_gemma":0.0006489327,"threshold_uncertainty_score":0.0059458017},"labels":[],"label_agreement":null},{"id":"W1554811214","doi":"10.1007/978-3-540-30191-2_28","title":"Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Canada Research Chairs","keywords":"Destination-Sequenced Distance Vector routing; Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Routing protocol; Distance-vector routing protocol; Zone Routing Protocol; Network packet","score_opus":0.014502823052608423,"score_gpt":0.2547890168051272,"score_spread":0.2402861937525188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554811214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07773242,0.0051080626,0.86916447,0.0007121769,0.0013235168,0.00016615896,0.00027100026,0.0023479692,0.043174192],"genre_scores_gemma":[0.6739295,0.006895626,0.26857382,0.00032664035,0.00036810682,0.00013972507,0.0006899714,0.00032118763,0.048755474],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99969184,0.000060265178,0.000023663828,0.00003767664,0.00015905433,0.000027439632],"domain_scores_gemma":[0.99950147,0.00015703755,0.00004976587,0.0001335119,0.00013109784,0.000027116957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000535745,0.00028999767,0.00040888478,0.0004411028,0.00027456722,0.00076262775,0.00052880513,0.0005177798,0.0016929471],"category_scores_gemma":[0.0013261599,0.00023624256,0.00019104128,0.00037266593,0.000445402,0.0014271322,0.0008977075,0.0005328283,0.0011739586],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033496745,0.000067097586,0.0014222797,0.00047344423,0.00005102325,0.0004057295,0.0003923252,0.016000144,0.10348539,0.09634678,0.01927272,0.7617481],"study_design_scores_gemma":[0.00015207838,0.0010020562,0.0016800882,0.00028324034,0.00014945088,0.0035855793,0.00027959977,0.28530535,0.23031317,0.08857369,0.38854608,0.00012965326],"about_ca_topic_score_codex":0.00031061552,"about_ca_topic_score_gemma":0.00036179196,"teacher_disagreement_score":0.0016929471,"about_ca_system_score_codex":0.00020385724,"about_ca_system_score_gemma":0.0005483561,"threshold_uncertainty_score":0.005663514},"labels":[],"label_agreement":null},{"id":"W1556739598","doi":"10.5772/12922","title":"Fault-Tolerant Routing in Mobile Ad Hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Carleton University","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Routing (electronic design automation); Distributed computing; Routing protocol","score_opus":0.020243072190627168,"score_gpt":0.2302654028718339,"score_spread":0.21002233068120674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556739598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067463224,0.067524694,0.88857836,0.0025777847,0.0029188811,0.00045795582,0.00029956413,0.0020550697,0.02884137],"genre_scores_gemma":[0.40306854,0.1473413,0.4123548,0.0019865579,0.005639877,0.0012347705,0.0013250496,0.00038767426,0.026661487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880624,0.00032721242,0.00009106704,0.00014829462,0.00053779664,0.00008937525],"domain_scores_gemma":[0.9986871,0.0007085206,0.000134803,0.00018365019,0.00024509832,0.000040826628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009179041,0.0010099505,0.00093973795,0.0009549082,0.0006901053,0.0018706556,0.0020402914,0.0016572492,0.0029920677],"category_scores_gemma":[0.0032541628,0.00045459383,0.00047214483,0.002370184,0.0009694055,0.0030994832,0.00102234,0.0016339631,0.0018268253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008400804,0.000094333314,0.0006490861,0.0019786176,0.00007919434,0.00052838464,0.00039228293,0.14157915,0.0048227175,0.23798022,0.03003724,0.5817747],"study_design_scores_gemma":[0.00006147973,0.00041783694,0.00087582925,0.0010955177,0.00009110644,0.0017869489,0.00034674272,0.35142094,0.0041518295,0.29015034,0.34945914,0.0001423389],"about_ca_topic_score_codex":0.0009768105,"about_ca_topic_score_gemma":0.0007509359,"teacher_disagreement_score":0.0029920677,"about_ca_system_score_codex":0.0010398048,"about_ca_system_score_gemma":0.00066500576,"threshold_uncertainty_score":0.010009468},"labels":[],"label_agreement":null},{"id":"W1556974308","doi":"10.1007/978-3-642-11723-7_36","title":"VoIP Implementation and Experiments on a Mobile Wireless AdHoc Network","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Voice over IP; Testbed; Computer network; Computer science; Packet loss; Network packet; Communication source; Wireless; Wireless ad hoc network; Scheme (mathematics); Mobile ad hoc network; Wireless network; Telecommunications; The Internet; Operating system","score_opus":0.018563045758999745,"score_gpt":0.26483979980829203,"score_spread":0.24627675404929228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556974308","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97574735,0.00017244482,0.016959598,0.00015642213,0.00009654283,0.00025525023,0.00030758476,0.0013678578,0.004936958],"genre_scores_gemma":[0.98069006,0.00013319941,0.015986858,0.000047774913,0.00001776758,0.0000933978,0.00038225722,0.00015869965,0.002490051],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987834,0.00037664722,0.00010486722,0.0001060008,0.00036519743,0.0002638658],"domain_scores_gemma":[0.996104,0.002031566,0.00012543846,0.00047369016,0.001048996,0.00021635038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010906066,0.000699053,0.0007522681,0.00083224283,0.00092572265,0.00067701,0.0015084055,0.0009901442,0.0031037915],"category_scores_gemma":[0.0037806053,0.00040357964,0.0003046981,0.0011532935,0.0005393354,0.0009964558,0.00054000696,0.00077701383,0.0005696228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009720067,0.0091838455,0.020798031,0.0017231028,0.00037842957,0.0033674743,0.0019359912,0.34463775,0.3802368,0.006338328,0.0077101407,0.21397],"study_design_scores_gemma":[0.0011992377,0.006461655,0.016038952,0.000071794006,0.00025972686,0.0008517667,0.0010648099,0.7208271,0.24770197,0.0017751715,0.0036198027,0.00012805502],"about_ca_topic_score_codex":0.006844598,"about_ca_topic_score_gemma":0.003957493,"teacher_disagreement_score":0.006844598,"about_ca_system_score_codex":0.0005982484,"about_ca_system_score_gemma":0.00041887155,"threshold_uncertainty_score":0.013609529},"labels":[],"label_agreement":null},{"id":"W1559942935","doi":"10.1109/ccece.2015.7129381","title":"On the performance of beamforming-based channel assignment in dense wireless mesh networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless mesh network; Beamforming; Channel (broadcasting); Directional antenna; Computer network; Antenna (radio); Wireless; Mesh networking; Node (physics); Reuse; Electronic engineering; Wireless network; Telecommunications; Acoustics; Engineering","score_opus":0.02034968949264947,"score_gpt":0.22361936392349877,"score_spread":0.20326967443084928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559942935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57207716,0.002951413,0.4096368,0.0009774884,0.00016758921,0.000094031806,0.00021832711,0.0007604212,0.013116756],"genre_scores_gemma":[0.98437935,0.00039939396,0.014521775,0.00005171685,0.000032295255,0.000027281989,0.000072572766,0.000019349183,0.00049625617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844235,0.00082612055,0.000048087313,0.000111305795,0.000353429,0.00021879935],"domain_scores_gemma":[0.98487604,0.012898006,0.00055926095,0.00059092604,0.0009079935,0.00016773061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031969398,0.00081013987,0.00051983277,0.0006240372,0.00045721742,0.0005859461,0.0004950435,0.0006703297,0.00075245637],"category_scores_gemma":[0.017378613,0.00024769743,0.00014006947,0.0006816549,0.0009664412,0.0013269673,0.0011188851,0.0004933686,0.00016736765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036545927,0.00005874731,0.0013645131,0.00006765419,0.00002369813,0.00002376766,0.000055827193,0.9524299,0.0040035415,0.0037001732,0.0006314868,0.03727525],"study_design_scores_gemma":[0.000014232886,0.00015841429,0.0006070385,0.000008338302,0.000008929422,0.000022169283,0.000031328975,0.9950482,0.0017983762,0.0021890223,0.000105183746,0.00000858301],"about_ca_topic_score_codex":0.0030778474,"about_ca_topic_score_gemma":0.002882717,"teacher_disagreement_score":0.0031969398,"about_ca_system_score_codex":0.00081845286,"about_ca_system_score_gemma":0.00066176907,"threshold_uncertainty_score":0.016907215},"labels":[],"label_agreement":null},{"id":"W1562252382","doi":"10.1007/11795490_19","title":"Half-Space Proximal: A New Local Test for Extracting a Bounded Dilation Spanner of a Unit Disk Graph","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; Natural Sciences and Engineering Research Council of Canada; University of Ottawa","funders":"","keywords":"Combinatorics; Computer science; Graph factorization; Spanner; Bounded function; Distance-hereditary graph; Graph; Vertex (graph theory); Unit disk graph; Discrete mathematics; Mathematics; Line graph; Graph power","score_opus":0.018312498157106685,"score_gpt":0.24878007551033507,"score_spread":0.23046757735322837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562252382","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18801045,0.00020032673,0.801929,0.0002938312,0.00007045898,0.00013174447,0.00039851564,0.0008873872,0.008078189],"genre_scores_gemma":[0.75918126,0.00018540426,0.2321814,0.00018056491,0.00013258397,0.00018160384,0.0011873053,0.00052384794,0.006246051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993661,0.00017404187,0.000025695965,0.00017302441,0.00018356627,0.00007758185],"domain_scores_gemma":[0.99721056,0.0014347517,0.00019261535,0.00039331094,0.00034123837,0.0004274479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093619135,0.0007790539,0.0012139498,0.002234745,0.000761726,0.0014085727,0.0018531124,0.0014590223,0.0079764705],"category_scores_gemma":[0.006727188,0.00043212864,0.0006711582,0.001345392,0.0021064458,0.003398858,0.003163837,0.0017927089,0.0012053112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022804542,0.00039017986,0.0076439534,0.00080926984,0.00014507625,0.001130664,0.001027869,0.09664226,0.101537086,0.46443868,0.011332743,0.31262177],"study_design_scores_gemma":[0.00009535008,0.0006203522,0.0023268112,0.000060670023,0.000055133845,0.00048426696,0.00045955562,0.6668144,0.023805173,0.30057633,0.0046328814,0.00006912327],"about_ca_topic_score_codex":0.0005415458,"about_ca_topic_score_gemma":0.00055196596,"teacher_disagreement_score":0.0079764705,"about_ca_system_score_codex":0.00048666252,"about_ca_system_score_gemma":0.00052223227,"threshold_uncertainty_score":0.026683986},"labels":[],"label_agreement":null},{"id":"W1562951537","doi":"10.1007/978-3-642-02085-8_25","title":"Distributed Generation of a Family of Connected Dominating Sets in Wireless Sensor Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Unit disk graph; Wireless sensor network; Vertex (graph theory); Distributed algorithm; Unit disk; Upper and lower bounds; Graph; Maximization; Euclidean geometry; Combinatorics; Joins; Wireless network; Wireless; Theoretical computer science; Mathematics; Distributed computing; Computer network; Mathematical optimization; Telecommunications","score_opus":0.019944535697190766,"score_gpt":0.24428013515843816,"score_spread":0.2243355994612474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562951537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03700147,0.0004293455,0.95850945,0.0001760569,0.00009242258,0.00012042136,0.00006804748,0.00015537234,0.0034474446],"genre_scores_gemma":[0.6496675,0.0006450947,0.34113637,0.0001244293,0.00009076422,0.00054282544,0.00024632114,0.000119317774,0.0074273427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925476,0.00033552412,0.000035006087,0.00014534978,0.00018259657,0.000046757224],"domain_scores_gemma":[0.99801874,0.0012523289,0.00010705154,0.00022811344,0.00029821965,0.0000954886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015835651,0.00064627535,0.00086207496,0.0007135944,0.0007530284,0.0007104997,0.0015808407,0.00080343534,0.0016216788],"category_scores_gemma":[0.004518222,0.0005197062,0.000785225,0.0008134119,0.00071046175,0.0011025219,0.0012965081,0.00083031284,0.00023092004],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014024485,0.00008366747,0.0007057212,0.00018329654,0.00008041336,0.00020349187,0.0003354438,0.7996859,0.009191122,0.08889292,0.00362184,0.096876],"study_design_scores_gemma":[0.000017817974,0.00006056496,0.00009592109,0.000010155212,0.000013938898,0.00009694429,0.00002586356,0.9668053,0.001052228,0.030479578,0.0013341757,0.000007480104],"about_ca_topic_score_codex":0.00047336632,"about_ca_topic_score_gemma":0.0005590466,"teacher_disagreement_score":0.0016216788,"about_ca_system_score_codex":0.000665394,"about_ca_system_score_gemma":0.00048203507,"threshold_uncertainty_score":0.008374751},"labels":[],"label_agreement":null},{"id":"W156429136","doi":"","title":"A performance evaluation of a pre-emptive on-demand distance vector routing protocol for mobile ad hoc networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Ad hoc wireless distribution service; Distributed computing; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Network packet; Routing protocol; Dynamic Source Routing; Wireless; Telecommunications","score_opus":0.09801426201206634,"score_gpt":0.40531741821378003,"score_spread":0.30730315620171367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156429136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9392251,0.0018937677,0.046278983,0.00041904688,0.00022304026,0.00046188734,0.00032266512,0.00091166986,0.010263791],"genre_scores_gemma":[0.98484725,0.0004408154,0.012855048,0.00003245987,0.000025421034,0.00006877138,0.00033958483,0.00004032287,0.0013502915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979804,0.0005658925,0.00013124559,0.0002019285,0.00093500887,0.00018558084],"domain_scores_gemma":[0.9951938,0.0023941547,0.00029275595,0.00043014815,0.0014509314,0.00023822462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024667953,0.0010524949,0.0006370707,0.00095844833,0.0005122545,0.0010031994,0.0009833795,0.0007714914,0.0013796837],"category_scores_gemma":[0.0065277945,0.00020318794,0.00029138647,0.0008853699,0.00048188507,0.0015562144,0.00045058996,0.0005564688,0.00030383715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0040330547,0.0023994863,0.018278409,0.0010700222,0.00035676284,0.00039307124,0.00040862165,0.5988768,0.069670945,0.007837538,0.006829212,0.28984612],"study_design_scores_gemma":[0.00010545744,0.0032563885,0.0036673276,0.000016103504,0.00006335238,0.00019997176,0.00010093767,0.97501886,0.015456967,0.0007777445,0.0013074544,0.000029408791],"about_ca_topic_score_codex":0.003264402,"about_ca_topic_score_gemma":0.0019593346,"teacher_disagreement_score":0.003264402,"about_ca_system_score_codex":0.0014878275,"about_ca_system_score_gemma":0.0006987752,"threshold_uncertainty_score":0.013045847},"labels":[],"label_agreement":null},{"id":"W1564455055","doi":"10.1109/wimob.2005.1512889","title":"Routing overhead analysis for reactive routing protocols in wireless ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Ad hoc wireless distribution service; Dynamic Source Routing; Link-state routing protocol; Adaptive quality of service multi-hop routing; Zone Routing Protocol; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.017618919158925064,"score_gpt":0.2768137092127073,"score_spread":0.25919479005378226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564455055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021614065,0.0036212017,0.96628034,0.0005041257,0.0001826041,0.00008437422,0.00006587887,0.00035682248,0.0072904998],"genre_scores_gemma":[0.84221053,0.006532311,0.1438323,0.00029433955,0.00056514627,0.00037097,0.000277273,0.00038519304,0.0055319355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688977,0.00096060155,0.000120560624,0.00015936646,0.0017150176,0.00015476836],"domain_scores_gemma":[0.99174786,0.006270065,0.00065753754,0.0005819221,0.0006726047,0.000070058755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030875409,0.0011309307,0.00043532875,0.0018063155,0.0005158013,0.0011050139,0.0011270129,0.00063044135,0.0012575758],"category_scores_gemma":[0.013005076,0.00031991955,0.00050538336,0.0011062725,0.0010258905,0.0030420015,0.00056320755,0.0011701097,0.00029562518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009905522,0.00008846526,0.0008596794,0.00034759022,0.00007931033,0.00020468443,0.0001984933,0.7316843,0.01625095,0.19044296,0.0022722567,0.05747225],"study_design_scores_gemma":[0.000009441582,0.00006214346,0.00036923937,0.00003806772,0.000029612722,0.0001621439,0.000048659458,0.94646305,0.0029055437,0.046250995,0.0036390023,0.000022103966],"about_ca_topic_score_codex":0.0008409498,"about_ca_topic_score_gemma":0.00048587736,"teacher_disagreement_score":0.0030875409,"about_ca_system_score_codex":0.0013825524,"about_ca_system_score_gemma":0.0005509518,"threshold_uncertainty_score":0.016328633},"labels":[],"label_agreement":null},{"id":"W156587935","doi":"10.1201/9781420040401.ch22","title":"Power-Aware Wireless Mobile Ad Hoc Networks","year":2002,"lang":"en","type":"book-chapter","venue":"˜The œelectrical engineering handbook/Electrical engineering handbook series/Electrical engineering handbook","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Mobile ad hoc network; Computer science; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Wireless; Telecommunications","score_opus":0.0049526455061079,"score_gpt":0.1706275842189474,"score_spread":0.16567493871283948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W156587935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059662596,0.15941496,0.4919183,0.0021431227,0.0044991644,0.0002659736,0.0004423689,0.0034657028,0.331884],"genre_scores_gemma":[0.064092025,0.18051524,0.22488776,0.001311599,0.0020209132,0.0003027162,0.0013691694,0.0007307092,0.5247698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997973,0.000025514391,0.000010137818,0.000027102746,0.0001311474,0.000008893672],"domain_scores_gemma":[0.99977976,0.000085945154,0.000012078663,0.00003200477,0.00007760493,0.000012732706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018742123,0.00078783784,0.0004527276,0.0005343418,0.0003243446,0.0011063431,0.0009602709,0.0005718616,0.008418751],"category_scores_gemma":[0.0006406546,0.00034628826,0.00016264814,0.0013177552,0.00029700552,0.0015434141,0.00054498564,0.0009739019,0.008663155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003138782,0.000073854746,0.00018371044,0.00091835426,0.000028440432,0.00026838577,0.00018712453,0.010667807,0.010240602,0.051280636,0.11247359,0.8136461],"study_design_scores_gemma":[0.000008121721,0.00005748794,0.00028722762,0.0002481631,0.000019706791,0.0008392949,0.000050839633,0.01602974,0.0032102952,0.028371273,0.95085454,0.000023283206],"about_ca_topic_score_codex":0.00020803776,"about_ca_topic_score_gemma":0.0005713911,"teacher_disagreement_score":0.008418751,"about_ca_system_score_codex":0.00023460711,"about_ca_system_score_gemma":0.00032012395,"threshold_uncertainty_score":0.028163493},"labels":[],"label_agreement":null},{"id":"W1567627123","doi":"10.1109/wimob.2005.1512887","title":"Hierarchical dynamic source routing: passive forwarding node selection for wireless ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer network; Computer science; DSRFLOW; Dynamic Source Routing; Routing protocol; Node (physics); Network packet; Source routing; Packet forwarding; Distributed computing; Geographic routing; Wireless Routing Protocol; Throughput; Wireless ad hoc network; Zone Routing Protocol; Routing (electronic design automation); Wireless; Engineering; Telecommunications","score_opus":0.006090903457113225,"score_gpt":0.22484472526366284,"score_spread":0.21875382180654962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567627123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119289495,0.0024174964,0.9782518,0.00032543056,0.00017464752,0.00016216835,0.00015406212,0.0016750148,0.004910374],"genre_scores_gemma":[0.5039657,0.0039345627,0.48182306,0.00030274468,0.0002843304,0.00040033358,0.00092514313,0.00016885088,0.008195326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957424,0.000110378016,0.00002360204,0.00005897425,0.00020165663,0.000031170803],"domain_scores_gemma":[0.9996258,0.00013524004,0.000051312734,0.00007445296,0.00009451132,0.000018665876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006438013,0.0004236674,0.00035796998,0.000752047,0.00041746616,0.00056303263,0.0011875639,0.00042185793,0.0012489918],"category_scores_gemma":[0.0009221841,0.000189676,0.00028643897,0.00074385066,0.00044933855,0.00096953113,0.00051171763,0.00036655672,0.00046366884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026240404,0.00012144014,0.0016999582,0.0010329458,0.00012292004,0.0005867203,0.0003315687,0.16612758,0.083605364,0.1266043,0.015627718,0.6038771],"study_design_scores_gemma":[0.000076944154,0.00035453634,0.0012772958,0.00007821416,0.00012670833,0.0010186909,0.00011378281,0.84642464,0.027054481,0.055634078,0.06777094,0.00006966735],"about_ca_topic_score_codex":0.0014358063,"about_ca_topic_score_gemma":0.0019266933,"teacher_disagreement_score":0.0014358063,"about_ca_system_score_codex":0.0005145996,"about_ca_system_score_gemma":0.0006913432,"threshold_uncertainty_score":0.0041782856},"labels":[],"label_agreement":null},{"id":"W1570912205","doi":"10.1109/icccn.2002.1043127","title":"MobileGrid: capacity-aware topology control in mobile ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Node (physics); Topology control; Network topology; Distributed computing; Network performance; Transmission (telecommunications); Topology (electrical circuits); Wireless network; Wireless; Key distribution in wireless sensor networks; Network packet; Telecommunications; Engineering","score_opus":0.009695571982506373,"score_gpt":0.22414876196747138,"score_spread":0.21445318998496501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1570912205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019701343,0.0011168055,0.97299916,0.00024569652,0.000099350764,0.00009777858,0.000079794656,0.0022378047,0.0034222743],"genre_scores_gemma":[0.737262,0.00093192724,0.25816938,0.00014616438,0.00012532495,0.00024390219,0.00023919929,0.0002232442,0.0026588282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996669,0.00010943169,0.000014038883,0.00005041388,0.00012613492,0.0000330838],"domain_scores_gemma":[0.9991775,0.0004038187,0.000118726326,0.00014772547,0.00009569679,0.00005657516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075438875,0.0006398637,0.0005656899,0.000598806,0.00040215423,0.0007612025,0.0015104465,0.00050867285,0.0010227526],"category_scores_gemma":[0.002713994,0.00025688886,0.000207281,0.00080613774,0.0007251322,0.0014735248,0.0009761755,0.00059532817,0.00028908122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013965393,0.000061896804,0.0007065104,0.00013400296,0.000053635464,0.00015203681,0.000111810004,0.76754135,0.013565465,0.025324091,0.0036165863,0.18859302],"study_design_scores_gemma":[0.000037561935,0.00009016236,0.00019429137,0.000012264658,0.000011638631,0.00011929966,0.000019483123,0.979031,0.0031284576,0.012576761,0.004765722,0.000013258918],"about_ca_topic_score_codex":0.0015109335,"about_ca_topic_score_gemma":0.0019267916,"teacher_disagreement_score":0.0015109335,"about_ca_system_score_codex":0.00047696146,"about_ca_system_score_gemma":0.000502828,"threshold_uncertainty_score":0.003989637},"labels":[],"label_agreement":null},{"id":"W1571543791","doi":"10.1109/icufn.2015.7182647","title":"Multi-dimensional clustering and network monitoring system for aeronautical ad hoc networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Network partition; Computer science; Partition (number theory); Wireless ad hoc network; Cluster analysis; Network topology; Network simulation; Mobile ad hoc network; Computer network; Distributed computing; Dynamic network analysis; Network monitoring; Topology (electrical circuits); Engineering; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.03778284424489891,"score_gpt":0.2673196802288969,"score_spread":0.229536835983998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571543791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034540124,0.0003373052,0.9436082,0.00036061506,0.00017298252,0.00041950317,0.0004866823,0.014206917,0.00586766],"genre_scores_gemma":[0.5052818,0.00035695682,0.48536736,0.00025036992,0.000103701794,0.0006374798,0.0010955298,0.0002269106,0.0066798367],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991043,0.00018016576,0.000066054134,0.0002451762,0.00034475845,0.000059414626],"domain_scores_gemma":[0.9989453,0.000111267065,0.00012518793,0.00020451643,0.00053238135,0.00008138376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008478412,0.0006075421,0.0005871721,0.0017608762,0.0013103306,0.0009995817,0.0011062698,0.00079491554,0.0031111978],"category_scores_gemma":[0.0016502969,0.00027502596,0.00031938014,0.0011562868,0.00034181573,0.0013305614,0.0010305931,0.0005286225,0.0012169704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010866816,0.00046570215,0.013597463,0.00043903687,0.00021254279,0.0005972177,0.0011126999,0.08786099,0.10324263,0.018487277,0.045047514,0.72785026],"study_design_scores_gemma":[0.000049388495,0.0003080667,0.007897014,0.000037983173,0.00007304654,0.00044063883,0.00021035969,0.9149186,0.04452428,0.0047231466,0.026708763,0.00010869371],"about_ca_topic_score_codex":0.0029225284,"about_ca_topic_score_gemma":0.0033207943,"teacher_disagreement_score":0.0031111978,"about_ca_system_score_codex":0.0010328995,"about_ca_system_score_gemma":0.0008136298,"threshold_uncertainty_score":0.010407925},"labels":[],"label_agreement":null},{"id":"W1574747178","doi":"10.1109/icppw.2004.72","title":"PIES: Protocol independent energy saving algorithm","year":2004,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Parallel Processing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Protocol (science); Node (physics); Energy (signal processing); Energy conservation; Set (abstract data type); Routing (electronic design automation); Engineering; Mathematics","score_opus":0.02704097689361715,"score_gpt":0.28060571066534173,"score_spread":0.25356473377172456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574747178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012582993,0.00083518866,0.9407813,0.00085856154,0.0005087789,0.0003871793,0.0005722942,0.006360319,0.03711341],"genre_scores_gemma":[0.37495187,0.0009911719,0.56806463,0.0010661134,0.00020052242,0.00090662466,0.0030582773,0.0009092127,0.04985156],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995246,0.00008228672,0.000027970438,0.00008839357,0.00017674391,0.000100037316],"domain_scores_gemma":[0.9994981,0.00013517262,0.000035772668,0.00014163862,0.00014491551,0.000044469263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007217829,0.0007518923,0.0005405845,0.0009484744,0.0007485838,0.001415994,0.0022145482,0.00093282573,0.014062213],"category_scores_gemma":[0.002402526,0.0002873572,0.0005114653,0.0009552162,0.0005684502,0.001901205,0.0020092556,0.0013938693,0.0036926796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006148807,0.00019753183,0.0013177904,0.00031475586,0.00007036776,0.00020084773,0.00011258224,0.2256255,0.009443739,0.09566625,0.07492646,0.5915093],"study_design_scores_gemma":[0.00018785207,0.0002181763,0.00038657573,0.000057998943,0.000036592523,0.00040969628,0.00007450074,0.85330945,0.012215639,0.050969575,0.08209309,0.000040734212],"about_ca_topic_score_codex":0.0007555363,"about_ca_topic_score_gemma":0.0010870803,"teacher_disagreement_score":0.014062213,"about_ca_system_score_codex":0.000637105,"about_ca_system_score_gemma":0.0016736382,"threshold_uncertainty_score":0.047042847},"labels":[],"label_agreement":null},{"id":"W1575299606","doi":"10.5555/984720.984795","title":"Two-tier agent architecture for trusted communication in ad-hoc mobile networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Architecture; Mobile ad hoc network; Wireless ad hoc network; Computer network; Computer security; Telecommunications; Wireless; Geography; Network packet","score_opus":0.012177370433957807,"score_gpt":0.25539534603086683,"score_spread":0.24321797559690903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575299606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023447799,0.0008212333,0.96405035,0.0004787732,0.00022213484,0.0002033302,0.00005045982,0.003985802,0.0067401202],"genre_scores_gemma":[0.5876381,0.0007453494,0.39180988,0.00024301464,0.0001209672,0.00024553452,0.00026867553,0.00029040282,0.018638093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983779,0.0004704256,0.00017202874,0.0001454956,0.00053649896,0.00029763728],"domain_scores_gemma":[0.9978927,0.00028321616,0.000118735246,0.00073944754,0.00064959907,0.00031631524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019037114,0.000470701,0.000749128,0.00066538516,0.0015299224,0.0034473913,0.0025861238,0.0017464908,0.0032167595],"category_scores_gemma":[0.0024429963,0.0005437878,0.0004635703,0.00056438526,0.0009664237,0.0032594071,0.0025450191,0.001838942,0.0017667759],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017127371,0.0006602431,0.0032309198,0.0006016819,0.0002743364,0.0009052412,0.0015517031,0.1553242,0.06995085,0.42084605,0.023762906,0.32117924],"study_design_scores_gemma":[0.000094317795,0.000251804,0.00037416533,0.00004785864,0.000105479114,0.0003612372,0.00016454398,0.8905296,0.019273,0.052293457,0.03641215,0.0000923355],"about_ca_topic_score_codex":0.0028917857,"about_ca_topic_score_gemma":0.00519578,"teacher_disagreement_score":0.0034473913,"about_ca_system_score_codex":0.0010160824,"about_ca_system_score_gemma":0.0016391221,"threshold_uncertainty_score":0.010761201},"labels":[],"label_agreement":null},{"id":"W1576584978","doi":"10.1002/9781118256053.ch3","title":"Data‐Link Layer Protocols","year":2007,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences; Cisco Systems","keywords":"Data link layer; Link (geometry); Link layer; Layer (electronics); Computer science; Computer network; Network layer; Materials science; Nanotechnology; Network packet","score_opus":0.06819017015401349,"score_gpt":0.3433707165964487,"score_spread":0.27518054644243517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576584978","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00814085,0.00518575,0.48360994,0.002678287,0.0029263478,0.0021967543,0.004193529,0.018347085,0.47272155],"genre_scores_gemma":[0.13719304,0.00903605,0.14390863,0.002126893,0.0012836503,0.0022065907,0.015393459,0.0018564132,0.68699527],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990465,0.000142158,0.00007827364,0.0001043228,0.0005127559,0.00011605996],"domain_scores_gemma":[0.99816424,0.00028573413,0.00011487921,0.0008076294,0.00051199243,0.00011558318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013473848,0.0011314217,0.0006723823,0.0016552757,0.0012304245,0.0038754588,0.0019947242,0.0011835531,0.05505701],"category_scores_gemma":[0.0033195205,0.00055000524,0.0004532494,0.0014745325,0.0006935529,0.00245663,0.0025727174,0.0017889957,0.04214274],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024354424,0.00033957767,0.00039083438,0.00056004676,0.00006237625,0.00016828135,0.0001859776,0.0052153505,0.015653338,0.24158832,0.26443902,0.47115338],"study_design_scores_gemma":[0.00007498658,0.00008109607,0.00033766063,0.00018916765,0.000095792115,0.00024353045,0.0000667437,0.03136047,0.01890308,0.0520612,0.896526,0.000060296523],"about_ca_topic_score_codex":0.0012494369,"about_ca_topic_score_gemma":0.001550681,"teacher_disagreement_score":0.05505701,"about_ca_system_score_codex":0.0007884203,"about_ca_system_score_gemma":0.0016430152,"threshold_uncertainty_score":0.18418407},"labels":[],"label_agreement":null},{"id":"W157693642","doi":"10.1007/978-3-540-28634-9_28","title":"Realistic Mobility for Mobile Ad Hoc Network Simulation","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Mobility model; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Wireless ad hoc network; Computer network; Distributed computing; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Routing protocol; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.018211977544636535,"score_gpt":0.26802322593256395,"score_spread":0.2498112483879274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W157693642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009811739,0.0012000278,0.97142166,0.00042202763,0.00021566277,0.00009049619,0.0002737112,0.0009050211,0.015659539],"genre_scores_gemma":[0.5202558,0.0032139414,0.4527548,0.00024240052,0.00027742577,0.0006449325,0.0012309204,0.0007273416,0.020652417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965763,0.00014423595,0.00001643853,0.000032970107,0.0001240395,0.000024627478],"domain_scores_gemma":[0.9992167,0.00045807383,0.000046489735,0.00011961724,0.000121273355,0.000037865622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043301744,0.00062587316,0.0008526963,0.0004955818,0.0004932534,0.0009074239,0.0016491156,0.0013010628,0.0051919287],"category_scores_gemma":[0.003810727,0.0006505207,0.0004938561,0.0007965132,0.000430585,0.0013923356,0.0011239365,0.001127595,0.0012695452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023189848,0.000025202826,0.00013195278,0.00005987004,0.000015628164,0.000048278267,0.000038920225,0.95171744,0.0010264528,0.030532395,0.0022382194,0.014142366],"study_design_scores_gemma":[0.000005895937,0.0000068948307,0.000021507578,0.0000063734537,0.0000031717202,0.000015639234,0.000004668992,0.9893506,0.00017036585,0.008119391,0.0022920223,0.0000034584948],"about_ca_topic_score_codex":0.00275057,"about_ca_topic_score_gemma":0.0017637812,"teacher_disagreement_score":0.0051919287,"about_ca_system_score_codex":0.000610987,"about_ca_system_score_gemma":0.00039343396,"threshold_uncertainty_score":0.017368734},"labels":[],"label_agreement":null},{"id":"W1577487455","doi":"10.1007/978-3-540-72990-7_73","title":"Quality-of-Service Provisioning for Multi-service TDMA Mesh Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Quality of service; Time division multiple access; Schedule; File transfer; Frame (networking); Transfer (computing)","score_opus":0.059683573086619625,"score_gpt":0.32025947677863353,"score_spread":0.2605759036920139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1577487455","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03789709,0.006440123,0.92747736,0.0010500862,0.00071090955,0.00013884972,0.00021804478,0.0019751932,0.024092354],"genre_scores_gemma":[0.7852161,0.005918299,0.19290419,0.00027175664,0.00063767843,0.00014359763,0.0004800833,0.0002860452,0.0141422795],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994611,0.000083373765,0.000027921573,0.00006612021,0.0002704532,0.000091098154],"domain_scores_gemma":[0.9993875,0.00023141314,0.000052415988,0.00011272229,0.00017111521,0.000044865847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086024875,0.00041983495,0.00042909043,0.0007362577,0.00060841127,0.0014713928,0.0015027906,0.00062105176,0.0035722486],"category_scores_gemma":[0.0019683319,0.00032779423,0.00023874489,0.0010645868,0.0003299916,0.0015793121,0.0008302104,0.000982445,0.00077002676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029056947,0.0001648231,0.0010153116,0.0004536969,0.000059799415,0.000254461,0.00026385067,0.1206407,0.049806077,0.08972598,0.023284197,0.7140406],"study_design_scores_gemma":[0.00002177082,0.0001281688,0.0010615353,0.00008454363,0.000037334976,0.0006158143,0.00009351346,0.88606215,0.012768842,0.048508503,0.05057942,0.000038357066],"about_ca_topic_score_codex":0.00094946136,"about_ca_topic_score_gemma":0.0013572599,"teacher_disagreement_score":0.0035722486,"about_ca_system_score_codex":0.0010614733,"about_ca_system_score_gemma":0.000437309,"threshold_uncertainty_score":0.011950374},"labels":[],"label_agreement":null},{"id":"W1578663287","doi":"10.1109/wiopt.2005.21","title":"Energy Saving Dynamic Source Routing for Ad Hoc Wireless Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Zone Routing Protocol; DSRFLOW; Routing protocol; Static routing; Destination-Sequenced Distance Vector routing; Optimized Link State Routing Protocol; Distributed computing; Network packet","score_opus":0.007220693622980891,"score_gpt":0.2212484921242054,"score_spread":0.2140277985012245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578663287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017624767,0.0069714705,0.96152276,0.0007405181,0.0004898086,0.000080513484,0.000098357836,0.0011920389,0.011279756],"genre_scores_gemma":[0.65904564,0.013862769,0.30889383,0.0004428069,0.00033098858,0.00031702407,0.00058523635,0.0002451317,0.016276527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977547,0.00005885026,0.0000105733,0.000026098462,0.00011464491,0.000014295663],"domain_scores_gemma":[0.99983275,0.00006292,0.000015958507,0.000032488457,0.00004867667,0.0000071582726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024613919,0.00040652035,0.00027676465,0.0004695334,0.0003487796,0.00046811096,0.00061359233,0.00038538701,0.0014120115],"category_scores_gemma":[0.00065478554,0.00014673556,0.0002856339,0.00060766,0.00024858417,0.0009665747,0.00043207488,0.00038738322,0.0004293748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016039377,0.000072748284,0.0005698858,0.0007907947,0.00012274664,0.00042170164,0.00017056576,0.17173629,0.04991123,0.11284487,0.013614767,0.64958405],"study_design_scores_gemma":[0.0000707194,0.0003031244,0.000669396,0.00009276318,0.00011385653,0.0009233437,0.000095707976,0.76887995,0.02888479,0.081021436,0.11887703,0.000067950925],"about_ca_topic_score_codex":0.0003527857,"about_ca_topic_score_gemma":0.0006569902,"teacher_disagreement_score":0.0014120115,"about_ca_system_score_codex":0.00030757705,"about_ca_system_score_gemma":0.00028380082,"threshold_uncertainty_score":0.0047236085},"labels":[],"label_agreement":null},{"id":"W1578765129","doi":"10.1109/icet.2005.1558855","title":"The statistical average carrier-to-interference ratio (CIR) of an ad hoc CSMA/CA wireless network providing multiple service-classes","year":2005,"lang":"en","type":"article","venue":"Proceedings of the IEEE Symposium on Emerging Technologies, 2005.","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Wireless ad hoc network; Computer science; Mobile ad hoc network; Interference (communication); Wireless network; Carrier sense multiple access with collision avoidance; Wireless; Vehicular ad hoc network; Throughput; Telecommunications; Channel (broadcasting); Network packet","score_opus":0.011305962852084973,"score_gpt":0.235043413013604,"score_spread":0.22373745016151905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578765129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48761055,0.0027244792,0.48590562,0.0010400268,0.00050854654,0.00007993612,0.000989921,0.0015325758,0.019608414],"genre_scores_gemma":[0.9888765,0.00052748696,0.008454635,0.00011661081,0.00016615805,0.00003440464,0.0002640126,0.00008852749,0.0014715362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989636,0.00015290664,0.000047647678,0.00017276448,0.00047391513,0.00018907992],"domain_scores_gemma":[0.98917496,0.0073165647,0.00084226637,0.00047876927,0.001971118,0.00021626691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017736752,0.0006827774,0.00063287385,0.0011742825,0.00052053883,0.0013040875,0.00081945176,0.0008051697,0.0019316429],"category_scores_gemma":[0.013538579,0.0003939487,0.0003393534,0.0010731964,0.00084795634,0.0017461443,0.0005155096,0.00082176004,0.00049352995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095490884,0.0001567673,0.018685527,0.000318569,0.00021657937,0.000777469,0.00027821277,0.80799335,0.048303638,0.05082743,0.0043892856,0.06709821],"study_design_scores_gemma":[0.000020458136,0.00023138693,0.006520534,0.0000201101,0.00007999242,0.00063398085,0.00007277233,0.97649676,0.0054425662,0.00910699,0.0013128266,0.000061601786],"about_ca_topic_score_codex":0.0024789681,"about_ca_topic_score_gemma":0.0025117644,"teacher_disagreement_score":0.0024789681,"about_ca_system_score_codex":0.0008457683,"about_ca_system_score_gemma":0.0013785824,"threshold_uncertainty_score":0.009380162},"labels":[],"label_agreement":null},{"id":"W1579580202","doi":"10.1109/milcom.2005.1605809","title":"The Probability Distribution of the Carrier-to-Interference Ratio (CIR) of a CSMA/CA Ad Hoc Wireless Network","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless ad hoc network; Computer science; Rayleigh fading; Node (physics); Monte Carlo method; Computer network; Nakagami distribution; Stochastic geometry models of wireless networks; Fading; Topology (electrical circuits); Algorithm; Optimized Link State Routing Protocol; Mathematics; Wireless; Statistics; Telecommunications; Physics; Channel (broadcasting)","score_opus":0.008438226489872937,"score_gpt":0.20956806867369132,"score_spread":0.20112984218381838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579580202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15179442,0.0009887472,0.83623034,0.00046921213,0.00008633981,0.00011093897,0.00040945434,0.00092855206,0.008982008],"genre_scores_gemma":[0.9591216,0.0008136966,0.037522357,0.00010061825,0.00007584127,0.00014144539,0.00029186162,0.00010295004,0.0018297753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882907,0.00032233828,0.000057953835,0.00023148066,0.00044244822,0.00011665593],"domain_scores_gemma":[0.98966813,0.0075331773,0.0008533856,0.000857734,0.0009900167,0.00009762852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021400626,0.00058424607,0.0004610975,0.0012136949,0.0004561789,0.001113531,0.00087495276,0.00097142434,0.0014471745],"category_scores_gemma":[0.013760817,0.00036510415,0.0004332679,0.0010452734,0.0013403357,0.0020633826,0.00043685964,0.00094461406,0.00042314714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089563044,0.00006359534,0.009547015,0.00012759483,0.000067884124,0.0002811932,0.00017125967,0.8912621,0.0058123376,0.069756195,0.0012978592,0.021523502],"study_design_scores_gemma":[0.000009144963,0.000065356086,0.0025765963,0.000024593217,0.000018148314,0.00031657965,0.000056408313,0.97783625,0.0026715973,0.01494088,0.0014494108,0.000034975885],"about_ca_topic_score_codex":0.0020177038,"about_ca_topic_score_gemma":0.0011595616,"teacher_disagreement_score":0.0021400626,"about_ca_system_score_codex":0.00094085146,"about_ca_system_score_gemma":0.00063473586,"threshold_uncertainty_score":0.011317849},"labels":[],"label_agreement":null},{"id":"W1579890920","doi":"10.1007/978-3-540-39611-6_27","title":"Cartesian Ad Hoc Routing Protocols","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Connectionless communication; Computer science; Computer network; Wireless ad hoc network; Flooding (psychology); Bandwidth (computing); Routing protocol; Power consumption; Distributed computing; Optimized Link State Routing Protocol; Routing (electronic design automation); Power (physics); Wireless; Network packet; Telecommunications","score_opus":0.018302680160935895,"score_gpt":0.2591549466044496,"score_spread":0.2408522664435137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579890920","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008741451,0.016393358,0.69812214,0.0009169857,0.0022650065,0.00032359647,0.0005784139,0.004122709,0.26853633],"genre_scores_gemma":[0.18161012,0.026225984,0.46756387,0.0004806326,0.0009036484,0.0004791845,0.002737579,0.0006803438,0.31931865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972314,0.000044832574,0.000023331902,0.00005242774,0.00013354889,0.000022689037],"domain_scores_gemma":[0.99958175,0.000085384345,0.000026199677,0.00016877714,0.00011601919,0.000021788304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004018115,0.00066064385,0.00044093566,0.00086416054,0.0006567089,0.0013072422,0.0007139539,0.00044489576,0.013336444],"category_scores_gemma":[0.00089864805,0.00038165067,0.00019974589,0.0015053126,0.00067302916,0.0015145944,0.0012541972,0.0007687935,0.0066169566],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007084668,0.00003949229,0.00016481586,0.00051635166,0.000019986634,0.00010049791,0.0002921098,0.005917797,0.0062938593,0.53157043,0.052497633,0.40251622],"study_design_scores_gemma":[0.000024822197,0.00012857148,0.00027915652,0.0001689291,0.00004698128,0.0007405636,0.00012636263,0.020971732,0.0058927643,0.2126924,0.7588932,0.00003440412],"about_ca_topic_score_codex":0.00046974313,"about_ca_topic_score_gemma":0.0008940967,"teacher_disagreement_score":0.013336444,"about_ca_system_score_codex":0.00043054108,"about_ca_system_score_gemma":0.00057270785,"threshold_uncertainty_score":0.04461485},"labels":[],"label_agreement":null},{"id":"W1580015807","doi":"10.1109/wimob.2005.1512907","title":"A proposal for an ad-hoc network QoS gateway","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Quality of service; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Gateway address; Distributed computing; Default gateway; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.011331615538547385,"score_gpt":0.23875495593964421,"score_spread":0.22742334040109682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580015807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017482128,0.0010929339,0.9492104,0.0036035448,0.0011010637,0.0008476953,0.000119547774,0.0040704976,0.022472275],"genre_scores_gemma":[0.1524586,0.0011022831,0.82023644,0.0017130034,0.00031562895,0.0006542479,0.0003255779,0.00021271089,0.022981413],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921846,0.00016830875,0.00006068784,0.00016878259,0.00028457615,0.000099238445],"domain_scores_gemma":[0.99933904,0.00009701677,0.00003516547,0.00009576001,0.00026286268,0.00017007272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011894838,0.0006477948,0.00040527253,0.00065708574,0.00083552283,0.0024334893,0.0024213365,0.003120508,0.0025683797],"category_scores_gemma":[0.0011188255,0.0005865893,0.0006543832,0.0007133744,0.00089006935,0.0025549487,0.0014964076,0.0023131862,0.0017594143],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041246513,0.0005042796,0.002944537,0.0008948247,0.000103833794,0.0028427152,0.0015059216,0.019482197,0.11373217,0.6180925,0.026585545,0.21289903],"study_design_scores_gemma":[0.0004057674,0.0016169739,0.0015214654,0.00023376092,0.00028131518,0.004741538,0.0006954661,0.22653775,0.061713036,0.09580894,0.60627747,0.00016651802],"about_ca_topic_score_codex":0.0005396743,"about_ca_topic_score_gemma":0.00052197103,"teacher_disagreement_score":0.003120508,"about_ca_system_score_codex":0.00062117074,"about_ca_system_score_gemma":0.0011763171,"threshold_uncertainty_score":0.008592129},"labels":[],"label_agreement":null},{"id":"W1580688485","doi":"10.1007/978-3-540-39611-6_25","title":"Routing Update in Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Computer network; Wireless ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Vehicular ad hoc network; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Network packet; Distributed computing; Routing protocol; Dynamic Source Routing; Wireless; Telecommunications","score_opus":0.011253472871701272,"score_gpt":0.22602086561876983,"score_spread":0.21476739274706855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580688485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016026909,0.08986087,0.764935,0.0022771612,0.00950675,0.00023966316,0.00037786952,0.0040001883,0.11277549],"genre_scores_gemma":[0.2440924,0.10116631,0.34732962,0.0011276581,0.0066671777,0.00040745657,0.0017350536,0.0010714651,0.2964029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995968,0.00007649189,0.0000319472,0.000059185855,0.00020534894,0.000030268091],"domain_scores_gemma":[0.9992955,0.00029774438,0.000036587422,0.00016039726,0.00018402653,0.000025768108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064555724,0.000702793,0.00073871005,0.0009009247,0.00039576454,0.0016722176,0.001279422,0.0006938841,0.0064380225],"category_scores_gemma":[0.002285808,0.00042561063,0.00021765314,0.0018455489,0.00039192464,0.002982276,0.0006218517,0.001127857,0.0022595925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100250065,0.000073052855,0.00032117273,0.0005671088,0.000026459607,0.00014250498,0.000121335215,0.013309092,0.003143337,0.05927089,0.04966295,0.87326175],"study_design_scores_gemma":[0.00006260679,0.00027022508,0.00095796253,0.00035075383,0.00017922008,0.0014008927,0.00017736942,0.20852025,0.008175763,0.10119115,0.67865527,0.000058547597],"about_ca_topic_score_codex":0.0005520599,"about_ca_topic_score_gemma":0.0007473472,"teacher_disagreement_score":0.0064380225,"about_ca_system_score_codex":0.00040881307,"about_ca_system_score_gemma":0.00037722033,"threshold_uncertainty_score":0.021537304},"labels":[],"label_agreement":null},{"id":"W1580766708","doi":"10.1007/978-3-540-39611-6_13","title":"Preventing Replay Attacks for Secure Routing in Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Wireless ad hoc network; Ad hoc wireless distribution service; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Distributed computing; Distance-vector routing protocol; Routing protocol; Routing (electronic design automation); Network packet; Wireless; Telecommunications","score_opus":0.014634027727399732,"score_gpt":0.25173493103590255,"score_spread":0.2371009033085028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1580766708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06503516,0.007467252,0.9070515,0.0011065676,0.00049831,0.00025915494,0.00008881951,0.003415661,0.015077668],"genre_scores_gemma":[0.7676385,0.0052503683,0.20822941,0.00027128076,0.0005463524,0.00020474925,0.00029920414,0.0003915387,0.017168567],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986773,0.00028951967,0.00011646048,0.00013298681,0.00060504215,0.00017876127],"domain_scores_gemma":[0.9969144,0.0014721013,0.00032348296,0.00090702745,0.00030001168,0.00008305701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011620406,0.0014366412,0.0012136712,0.0010360843,0.00078548404,0.0015376293,0.0016937476,0.0015938621,0.0035706903],"category_scores_gemma":[0.004095644,0.0007115398,0.00061951444,0.00064447836,0.0011495425,0.004112313,0.002361447,0.002020444,0.0017165166],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011817687,0.0003680979,0.0012435858,0.0012453649,0.00029484252,0.00073044887,0.00082334713,0.16205637,0.081490934,0.11235655,0.025896879,0.61231184],"study_design_scores_gemma":[0.00018062656,0.0008563797,0.00057602505,0.00020042143,0.00021111063,0.0017657755,0.00027267763,0.7426303,0.06747315,0.15259199,0.0331593,0.00008229234],"about_ca_topic_score_codex":0.0002257762,"about_ca_topic_score_gemma":0.0002515993,"teacher_disagreement_score":0.0035706903,"about_ca_system_score_codex":0.00045520853,"about_ca_system_score_gemma":0.00038496347,"threshold_uncertainty_score":0.011945128},"labels":[],"label_agreement":null},{"id":"W1582487684","doi":"10.1109/icmcis.2015.7158713","title":"Secure and efficient routing by Leveraging Situational Awareness Messages in tactical edge networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer network; Computer science; Routing protocol; Multicast; Wireless ad hoc network; Distributed computing; Destination-Sequenced Distance Vector routing; Policy-based routing; Dynamic Source Routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.022584138029304368,"score_gpt":0.25934734570231927,"score_spread":0.2367632076730149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1582487684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22480714,0.001984573,0.7668755,0.0004674565,0.0001537084,0.00012209942,0.000039052462,0.0006831632,0.0048673656],"genre_scores_gemma":[0.9442542,0.00062404684,0.054205,0.000059645092,0.000033011413,0.00004902165,0.000036447138,0.00001615234,0.0007224084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957484,0.00013983923,0.000030313215,0.000056263354,0.00014123537,0.000057617162],"domain_scores_gemma":[0.9994624,0.00021176219,0.00013487267,0.000108644876,0.000061444385,0.00002081399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005344437,0.0003566436,0.0003435544,0.00047603736,0.00039677997,0.00062532135,0.00056475494,0.00048733494,0.00026242816],"category_scores_gemma":[0.0010198967,0.00017761333,0.00025371817,0.00039409634,0.0006311866,0.0011700295,0.00091651315,0.00056738785,0.00012587385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002854012,0.00011426342,0.0020767797,0.00027354094,0.000111610534,0.0008611136,0.0006082871,0.6796096,0.124830365,0.04949334,0.0018769057,0.13985877],"study_design_scores_gemma":[0.000018416129,0.00027617623,0.0005058519,0.00001899929,0.00003780143,0.00029975103,0.000102043625,0.970346,0.015813481,0.007697859,0.0048586605,0.000024966974],"about_ca_topic_score_codex":0.00091791456,"about_ca_topic_score_gemma":0.0008638486,"teacher_disagreement_score":0.00091791456,"about_ca_system_score_codex":0.00022811421,"about_ca_system_score_gemma":0.00029181095,"threshold_uncertainty_score":0.0028264523},"labels":[],"label_agreement":null},{"id":"W1583127423","doi":"","title":"Optimizing performance of ad-hoc networks under energy and scheduling constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Wireless ad hoc network; Distributed computing; Scheduling (production processes); Survivability; Job shop scheduling; Wireless sensor network; Computer network; Data collection; Mobile ad hoc network; Approximation algorithm; Wireless network; Wireless; Mathematical optimization; Algorithm; Routing (electronic design automation)","score_opus":0.009177230409929295,"score_gpt":0.21331664441514686,"score_spread":0.20413941400521757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583127423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45407364,0.0026841662,0.52361876,0.0014191177,0.00018562724,0.00010832819,0.00019712729,0.00040371824,0.017309451],"genre_scores_gemma":[0.9834216,0.00046076564,0.015013353,0.00002942377,0.000044615343,0.000028148797,0.000043931486,0.000029330282,0.0009287762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899966,0.0005203331,0.000031663276,0.00009881634,0.00017463333,0.00017492502],"domain_scores_gemma":[0.99662846,0.0025796306,0.00024495026,0.00013829002,0.00026768443,0.0001408959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020317943,0.00093506643,0.00064654736,0.0004524834,0.0005548262,0.0013002823,0.0007340284,0.00072350935,0.0011850202],"category_scores_gemma":[0.0063645327,0.00031850228,0.00017269271,0.0009117672,0.0007369403,0.0016389264,0.00067598134,0.0005616875,0.00018681193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012514056,0.0000393464,0.0006013808,0.000048801005,0.000017306467,0.000030793497,0.000019861156,0.98251694,0.0021374444,0.0058537167,0.00043408733,0.008175097],"study_design_scores_gemma":[0.000009680872,0.00005133014,0.00012393147,0.0000037964712,0.000005400404,0.000010965264,0.00001965953,0.9950505,0.0009710119,0.0035778724,0.00017362394,0.0000022770953],"about_ca_topic_score_codex":0.0015042903,"about_ca_topic_score_gemma":0.001144633,"teacher_disagreement_score":0.0020317943,"about_ca_system_score_codex":0.0012425713,"about_ca_system_score_gemma":0.00073435064,"threshold_uncertainty_score":0.010745227},"labels":[],"label_agreement":null},{"id":"W1590923996","doi":"10.1007/11943952_36","title":"A Secure Architecture for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Single point of failure; Computer network; Scalability; Certificate authority; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Public key infrastructure; Distributed computing; Architecture; Authentication (law); Vehicular ad hoc network; Cluster analysis; Routing (electronic design automation); Computer security; Wireless; Engineering; Public-key cryptography; Geography; Database; Operating system","score_opus":0.008543906233223712,"score_gpt":0.22644598181302858,"score_spread":0.21790207557980487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590923996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066191126,0.0022053295,0.9710154,0.00068673666,0.00039185653,0.00018012004,0.000050112496,0.0030917982,0.015759474],"genre_scores_gemma":[0.269845,0.006616009,0.6615376,0.00045299588,0.0006492565,0.000649037,0.00034336073,0.0008975822,0.05900925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992186,0.0001305148,0.000065625085,0.00007380657,0.0004197677,0.00009167795],"domain_scores_gemma":[0.99928373,0.00016504664,0.000043643307,0.00032638814,0.00013649733,0.000044701974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076005684,0.0010782054,0.00060402305,0.0008593549,0.0011084481,0.0021309785,0.001493406,0.0014805752,0.005579359],"category_scores_gemma":[0.0015369334,0.0008846784,0.00058686046,0.000768204,0.0014819328,0.0038466856,0.0027547507,0.00259517,0.0030512172],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020510751,0.00008802789,0.00031695468,0.00039374354,0.000058663056,0.0003355845,0.00042067352,0.028121809,0.02875263,0.6631857,0.016522363,0.26159877],"study_design_scores_gemma":[0.000108879874,0.00033868803,0.00029543828,0.00020995532,0.00014376735,0.0010968868,0.00011536597,0.23519939,0.034532677,0.5051063,0.222773,0.00007970023],"about_ca_topic_score_codex":0.00038172962,"about_ca_topic_score_gemma":0.0005541991,"teacher_disagreement_score":0.005579359,"about_ca_system_score_codex":0.000660035,"about_ca_system_score_gemma":0.00078685535,"threshold_uncertainty_score":0.018664777},"labels":[],"label_agreement":null},{"id":"W1591032459","doi":"10.1007/978-3-540-30121-9_36","title":"Desirable Mobile Networking Method for Formulating an Efficient Mobile Conferencing Application","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Korea Science and Engineering Foundation; Federation for the Humanities and Social Sciences","keywords":"Bluetooth; Computer network; Computer science; Network packet; Mobile technology; Delay-tolerant networking; Mobile device; Mobile computing; Telecommunications; Wireless; Optimized Link State Routing Protocol; World Wide Web; Routing protocol","score_opus":0.022755648315774143,"score_gpt":0.2868335239951681,"score_spread":0.26407787567939395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591032459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051025394,0.000036517467,0.9893495,0.000076493,0.000042804626,0.0000725747,0.000042828713,0.0006972772,0.004579504],"genre_scores_gemma":[0.13402355,0.00009289851,0.85687244,0.00008580825,0.00006555485,0.00029527335,0.00020278693,0.0002786303,0.008083118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989932,0.00019173195,0.000071796014,0.00018482025,0.00045391737,0.000104491875],"domain_scores_gemma":[0.99921834,0.0002960656,0.000046505997,0.00015818923,0.000249071,0.000031867687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070736086,0.0007343367,0.00047861197,0.00064970716,0.00069273514,0.0010507617,0.0014840495,0.00073817914,0.0054194024],"category_scores_gemma":[0.002141441,0.0004278557,0.0008513843,0.00048833847,0.000614231,0.001125898,0.0010493896,0.0012773972,0.0014951627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003530774,0.00027985513,0.0009732402,0.00046181647,0.00006932339,0.000549311,0.00037895393,0.07267386,0.11747115,0.48543224,0.009736321,0.3116209],"study_design_scores_gemma":[0.000104053455,0.0003188758,0.00041888622,0.00007476008,0.00012261767,0.0006639316,0.00009068636,0.75032085,0.085307054,0.11783443,0.044693626,0.000050277777],"about_ca_topic_score_codex":0.0010390175,"about_ca_topic_score_gemma":0.0020595521,"teacher_disagreement_score":0.0054194024,"about_ca_system_score_codex":0.0006972077,"about_ca_system_score_gemma":0.0011035112,"threshold_uncertainty_score":0.018129706},"labels":[],"label_agreement":null},{"id":"W1591243799","doi":"10.3390/aerospace2030392","title":"Unmanned Aerial ad Hoc Networks: Simulation-Based Evaluation of Entity Mobility Models’ Impact on Routing Performance","year":2015,"lang":"en","type":"article","venue":"Aerospace","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network; Mobility model; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Routing protocol; Telecommunications","score_opus":0.05244857833157652,"score_gpt":0.32365972768127305,"score_spread":0.27121114934969653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591243799","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715659,0.0004998434,0.022973834,0.00020316095,0.00007534812,0.00013347797,0.0005274873,0.0003164705,0.0037043588],"genre_scores_gemma":[0.990672,0.00022355237,0.008353197,0.000021244756,0.000006218743,0.000068256064,0.00034230156,0.000014209562,0.00029907568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993616,0.0003045824,0.000053052605,0.0000551522,0.00016716341,0.00005854634],"domain_scores_gemma":[0.99758244,0.0015055395,0.0002861761,0.00023941894,0.00030181283,0.00008466435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011705139,0.0006948301,0.0003789544,0.00065301656,0.00028363825,0.00043385828,0.0005345986,0.0005556613,0.00043390377],"category_scores_gemma":[0.003080135,0.00013924304,0.00033885168,0.00073187327,0.00028730542,0.00085038703,0.00042629242,0.00047009005,0.000080068305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016177619,0.00021638202,0.0052825403,0.000075651435,0.00007600027,0.000064176806,0.000073136296,0.9806826,0.003093288,0.0013892305,0.0004606022,0.008424647],"study_design_scores_gemma":[0.000021868964,0.00042622208,0.0019265761,0.000011248582,0.000023120114,0.000046050798,0.000067900866,0.9929374,0.0036712587,0.0003393069,0.0005165877,0.000012515152],"about_ca_topic_score_codex":0.0050575193,"about_ca_topic_score_gemma":0.0032224336,"teacher_disagreement_score":0.0050575193,"about_ca_system_score_codex":0.00067373156,"about_ca_system_score_gemma":0.0003897019,"threshold_uncertainty_score":0.010056138},"labels":[],"label_agreement":null},{"id":"W1591500809","doi":"10.1007/978-3-642-10625-5_7","title":"Novel Analytical Delay Model and Burst Assembly Scheme for Wireless Mesh and Optical Burst Switching Convergence","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer network; Optical burst switching; Computer science; Wireless mesh network; Quality of service; Internetworking; The Internet; Distributed computing; Wireless; Wireless network; Telecommunications; Optical performance monitoring; Wavelength-division multiplexing","score_opus":0.02596973823691245,"score_gpt":0.25154526509032327,"score_spread":0.2255755268534108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1591500809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018330036,0.0005265012,0.9709925,0.00021050363,0.0001249991,0.00005985922,0.00004616202,0.00018822889,0.00952119],"genre_scores_gemma":[0.80776304,0.0011775886,0.16984823,0.00016804507,0.0001481131,0.00021690143,0.00010777502,0.00020220927,0.020368079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998437,0.00003910749,0.000005936197,0.000024689305,0.00006131373,0.000025223098],"domain_scores_gemma":[0.99978095,0.00008690338,0.000025105868,0.00002441354,0.000069116744,0.0000134364855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004354147,0.000573307,0.00046697466,0.00044047335,0.0005229578,0.0007617239,0.0013801871,0.00073932245,0.0024545663],"category_scores_gemma":[0.0010208071,0.00028038386,0.00047138505,0.0005822856,0.0004818111,0.0010445516,0.00056422147,0.00093079044,0.00044792006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013286514,0.00009412695,0.00033465363,0.00011810668,0.000022661283,0.00016235521,0.00018561413,0.64140916,0.029188788,0.29310298,0.0031646485,0.032084007],"study_design_scores_gemma":[0.0000021689455,0.000006948917,0.00001566865,0.0000027942817,0.0000027125861,0.000014246562,0.0000043510267,0.994962,0.00043956767,0.004190616,0.000356159,0.0000027878723],"about_ca_topic_score_codex":0.001999946,"about_ca_topic_score_gemma":0.0018325093,"teacher_disagreement_score":0.0024545663,"about_ca_system_score_codex":0.0015736889,"about_ca_system_score_gemma":0.0007117053,"threshold_uncertainty_score":0.011417925},"labels":[],"label_agreement":null},{"id":"W1593594285","doi":"10.1007/978-3-642-17458-2_21","title":"PTAS for Minimum Connected Dominating Set with Routing Cost Constraint in Wireless Sensor Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Computer science; Polynomial-time approximation scheme; Routing (electronic design automation); Approximation algorithm; Constraint (computer-aided design); Shortest path problem; Mathematical optimization; Set (abstract data type); Connected dominating set; Wireless sensor network; Computer network; Algorithm; Mathematics; Theoretical computer science","score_opus":0.014696845990418905,"score_gpt":0.24213470204740828,"score_spread":0.22743785605698938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593594285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055227596,0.0014602336,0.9841569,0.000702936,0.00060535735,0.00018993614,0.00031975596,0.00036557246,0.00667666],"genre_scores_gemma":[0.2954335,0.004599074,0.6760424,0.00091443,0.0010054194,0.0015549549,0.0008637926,0.0005252748,0.019061293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886477,0.00037347007,0.00006638433,0.0002879734,0.00033193114,0.000075425145],"domain_scores_gemma":[0.99872714,0.0007746085,0.00010878839,0.00014151572,0.00018117424,0.00006673214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012605614,0.0014081434,0.0015850662,0.0007263965,0.00067752186,0.0015550184,0.003132125,0.0012869199,0.005850055],"category_scores_gemma":[0.004324973,0.0005039873,0.0013217882,0.002417289,0.00090486434,0.0026768374,0.001588126,0.0028324465,0.00097079476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023857811,0.00011670767,0.00023057213,0.0012409678,0.00013267813,0.00016904116,0.00018777499,0.517748,0.006067972,0.2691133,0.023203243,0.18155116],"study_design_scores_gemma":[0.000028212413,0.00013808445,0.0001078124,0.000054053715,0.000040910672,0.00019805657,0.00003902011,0.84116197,0.0012577666,0.14734472,0.009610081,0.000019267287],"about_ca_topic_score_codex":0.0011848046,"about_ca_topic_score_gemma":0.0013412399,"teacher_disagreement_score":0.005850055,"about_ca_system_score_codex":0.0014251026,"about_ca_system_score_gemma":0.0014043722,"threshold_uncertainty_score":0.01957035},"labels":[],"label_agreement":null},{"id":"W1594907937","doi":"10.1007/978-3-540-74823-6_9","title":"The Impact of Delay in Dominating Set and Neighbor Elimination Based Broadcasting in Ad Hoc Networks","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Timeout; Broadcasting (networking); Computer science; Computer network; Node (physics); Retransmission; Network packet; Engineering","score_opus":0.018059251252865505,"score_gpt":0.27659316954191404,"score_spread":0.25853391828904854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594907937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43175235,0.052612014,0.4657101,0.0030250088,0.0022314284,0.00019341988,0.00044818857,0.0005793854,0.043448173],"genre_scores_gemma":[0.95074654,0.010492662,0.028954424,0.000146829,0.00040876569,0.00006296575,0.00011464297,0.00018235354,0.008890691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979668,0.00066591694,0.00006997774,0.0001929262,0.0007972605,0.00030703616],"domain_scores_gemma":[0.962826,0.033418432,0.0007229276,0.00078360806,0.0017714795,0.00047757127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030749796,0.0009422887,0.0013623831,0.0010809463,0.0010224115,0.0015875455,0.0020584047,0.000991734,0.0022981525],"category_scores_gemma":[0.0200628,0.00057545357,0.0004634422,0.0020306702,0.0013996935,0.003508678,0.0010609551,0.00097495975,0.00024256126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001972124,0.0002821043,0.0038392772,0.0009861557,0.00016158304,0.0003421796,0.00047057148,0.69363654,0.015997322,0.1215021,0.0043946835,0.15641536],"study_design_scores_gemma":[0.00014111081,0.0009804133,0.002016766,0.00008718833,0.0003479311,0.00086061563,0.00046809544,0.9083593,0.013463725,0.06575998,0.007448107,0.00006684178],"about_ca_topic_score_codex":0.0034449613,"about_ca_topic_score_gemma":0.0037870405,"teacher_disagreement_score":0.0034449613,"about_ca_system_score_codex":0.0028935804,"about_ca_system_score_gemma":0.0013602602,"threshold_uncertainty_score":0.020994484},"labels":[],"label_agreement":null},{"id":"W1595060433","doi":"10.1109/pimrc.2004.1370964","title":"Cellular CDMA capacity improvement using ad hoc relaying","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Telecommunications link; Base station; Wireless ad hoc network; Code division multiple access; Relay; Vehicular ad hoc network; Cellular network; Wireless; Telecommunications","score_opus":0.02526653942584944,"score_gpt":0.22892879665133845,"score_spread":0.203662257225489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595060433","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46653637,0.0045168945,0.47167262,0.00054759945,0.00017086374,0.00006682206,0.00007583877,0.0006355473,0.05577748],"genre_scores_gemma":[0.9888188,0.0005013044,0.009427405,0.000028273123,0.00003075177,0.000008512187,0.000011843704,0.0000130987,0.0011599219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.00011510917,0.0000057726475,0.00003168607,0.00011620598,0.00008106167],"domain_scores_gemma":[0.9991641,0.00050248666,0.000076498676,0.00009945398,0.00012962575,0.000027867125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003696321,0.0005591785,0.00024984134,0.0004154221,0.0002555777,0.000627764,0.0004105005,0.00043398465,0.0010478586],"category_scores_gemma":[0.0024620395,0.00012967434,0.00020480409,0.00047222403,0.00065564946,0.00078311784,0.0005628263,0.00037677758,0.0001758879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010567258,0.000082366205,0.0014946188,0.00009030108,0.00005168689,0.00029717496,0.00009414538,0.8850437,0.02142638,0.04354335,0.00084974465,0.046920914],"study_design_scores_gemma":[0.0000150509,0.00019762774,0.0003833491,0.000012529243,0.00004137946,0.00020157211,0.00005093961,0.97322524,0.012831095,0.009287996,0.0037379523,0.000015237917],"about_ca_topic_score_codex":0.0019478588,"about_ca_topic_score_gemma":0.0016576911,"teacher_disagreement_score":0.0019478588,"about_ca_system_score_codex":0.00065116957,"about_ca_system_score_gemma":0.00042132364,"threshold_uncertainty_score":0.004724562},"labels":[],"label_agreement":null},{"id":"W1595947196","doi":"10.1109/vetecs.2006.1682764","title":"Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Integer programming; Computer science; Routing (electronic design automation); Mathematical optimization; Heuristic; Path (computing); Wireless network; Static routing; Wireless; Computer network; Geographic routing; Routing protocol; Distributed computing; Mathematics; Telecommunications","score_opus":0.008580403349341039,"score_gpt":0.22615050176551668,"score_spread":0.21757009841617564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1595947196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052542714,0.0019769876,0.9820135,0.0013954715,0.00018422182,0.0000937859,0.00022812512,0.00007472901,0.00877886],"genre_scores_gemma":[0.24816173,0.007047676,0.72832763,0.00084967713,0.00082621624,0.0009902879,0.00054769893,0.00015591164,0.013093215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987362,0.00062629883,0.000041324725,0.00019781556,0.00024932603,0.00014901816],"domain_scores_gemma":[0.998187,0.0014212168,0.00015297512,0.000044965294,0.00013440145,0.000059373437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022738425,0.0022162008,0.0015529194,0.00069203996,0.0006515873,0.0024068903,0.0019577732,0.0026178367,0.0031345333],"category_scores_gemma":[0.003821961,0.00085778587,0.0010297529,0.0023297821,0.0012276372,0.002809957,0.0011960206,0.0026367125,0.00069061946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039408947,0.00011519592,0.00028539283,0.0003080519,0.000043369448,0.00018459342,0.00010714823,0.8538197,0.0006214665,0.11793869,0.004572157,0.021964759],"study_design_scores_gemma":[0.000019202778,0.00005635545,0.000075323085,0.00004856809,0.000020492702,0.00006042748,0.00004948456,0.949884,0.00028973704,0.044044066,0.005438819,0.000013472732],"about_ca_topic_score_codex":0.0027512726,"about_ca_topic_score_gemma":0.0027246922,"teacher_disagreement_score":0.0031345333,"about_ca_system_score_codex":0.0012504542,"about_ca_system_score_gemma":0.0013801049,"threshold_uncertainty_score":0.012025356},"labels":[],"label_agreement":null},{"id":"W1596696432","doi":"10.1007/978-3-540-39611-6_19","title":"On the Interaction of Bandwidth Constraints and Energy Efficiency in All-Wireless Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Unicast; Computer network; Energy consumption; Bandwidth (computing); Node (physics); Base station; Wireless network; Wireless; Blocking (statistics); Distributed computing; Telecommunications; Multicast","score_opus":0.013574245459270648,"score_gpt":0.23210249757652754,"score_spread":0.2185282521172569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1596696432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054040488,0.040556718,0.75932944,0.012804418,0.0014741034,0.00008777707,0.00035417097,0.00022915068,0.13112375],"genre_scores_gemma":[0.8573931,0.039850056,0.06705316,0.0015954588,0.0028894823,0.00015203458,0.00021877889,0.00041592593,0.03043194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989197,0.0005107237,0.000046064793,0.00011691256,0.00025593588,0.00015071199],"domain_scores_gemma":[0.9868471,0.011859268,0.00034519006,0.00033862307,0.00045099802,0.00015879756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025483586,0.0014227871,0.0018682193,0.0009393055,0.0010087221,0.0035768696,0.002519487,0.0020296895,0.007830749],"category_scores_gemma":[0.013087731,0.0010067113,0.0005903978,0.0028452682,0.00316664,0.011271551,0.0019755014,0.0035032157,0.00075152656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000101735495,0.00004175511,0.0004526179,0.00024569785,0.0000498364,0.00012137862,0.0001570726,0.11950339,0.0007519233,0.836927,0.007533229,0.034114286],"study_design_scores_gemma":[0.0000144859,0.000025528163,0.0002804366,0.00006765796,0.000025330684,0.00011539043,0.00009199113,0.13708587,0.00026263704,0.8565724,0.005435335,0.00002288609],"about_ca_topic_score_codex":0.002447246,"about_ca_topic_score_gemma":0.0027800566,"teacher_disagreement_score":0.007830749,"about_ca_system_score_codex":0.0017162308,"about_ca_system_score_gemma":0.000635826,"threshold_uncertainty_score":0.02619642},"labels":[],"label_agreement":null},{"id":"W1597684374","doi":"10.1007/978-3-642-27901-0_10","title":"Preventing the Cluster Formation Attack against the Hierarchical OLSR Protocol","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Scalability; Mobile ad hoc network; Node (physics); Routing protocol; Wireless ad hoc network; Distributed computing; Ad hoc wireless distribution service; Routing (electronic design automation); Network packet; Wireless; Engineering","score_opus":0.023231472797339725,"score_gpt":0.27414175126845264,"score_spread":0.2509102784711129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597684374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31099108,0.002549836,0.6420021,0.0014464945,0.0004436904,0.00040322717,0.00011383605,0.004190533,0.03785928],"genre_scores_gemma":[0.9453821,0.0005779971,0.04617132,0.00017193376,0.00008500995,0.00007168175,0.0000869398,0.000073336225,0.007379661],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99874437,0.00030218196,0.00004866446,0.00007977626,0.00061391783,0.00021105741],"domain_scores_gemma":[0.99808466,0.0006493046,0.0002874564,0.0006166623,0.0002919865,0.00006991636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056099,0.0004966607,0.00049474445,0.00074212626,0.00075773365,0.0006760387,0.0010607206,0.00080302777,0.0011005014],"category_scores_gemma":[0.002755394,0.00029103248,0.0003090597,0.00041535537,0.0006403405,0.0011890716,0.0022199252,0.0011950977,0.00059053616],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012987806,0.00040150285,0.0036844555,0.0006189217,0.00027897014,0.0010846523,0.0011183468,0.14451154,0.18456376,0.11650835,0.022682734,0.52324796],"study_design_scores_gemma":[0.00012387084,0.0008201519,0.003019803,0.00007759375,0.00019774352,0.0014063813,0.00037974198,0.8386631,0.100994505,0.031861827,0.022363108,0.000092154354],"about_ca_topic_score_codex":0.00097401463,"about_ca_topic_score_gemma":0.00088444276,"teacher_disagreement_score":0.0011005014,"about_ca_system_score_codex":0.0003951892,"about_ca_system_score_gemma":0.0008314268,"threshold_uncertainty_score":0.0053182244},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Greedy algorithm; Node (physics); Hop (telecommunications); Packet forwarding; Computer network; Algorithm; Network packet; Geographic routing; Communication source; Routing protocol; Static routing","score_opus":0.010729929712024047,"score_gpt":0.2009819713228837,"score_spread":0.19025204161085965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599674946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043571133,0.0013801774,0.9496698,0.00045441402,0.000270955,0.00008549036,0.00006988908,0.00071743946,0.003780763],"genre_scores_gemma":[0.6819173,0.001868307,0.30207464,0.00023793259,0.00041984365,0.00021951385,0.0002888229,0.00047921043,0.012494441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989002,0.0003635222,0.000049004648,0.00014560267,0.00040580067,0.00013585907],"domain_scores_gemma":[0.99700826,0.0017315253,0.00027608883,0.00036427693,0.0004106621,0.00020922664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022243995,0.00079750165,0.0013773096,0.001161073,0.0009232782,0.0017458276,0.0025600793,0.0011590547,0.0023692416],"category_scores_gemma":[0.0070241704,0.0006898495,0.0006032041,0.0014215424,0.001316986,0.0027062048,0.0016700507,0.0014719457,0.0004692473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011409282,0.00021760144,0.0013049508,0.00049943314,0.00014161352,0.00027719836,0.0006242962,0.4532919,0.011462805,0.29756048,0.0122294435,0.2212494],"study_design_scores_gemma":[0.00006467141,0.00020854757,0.00025698927,0.00002374176,0.00006874231,0.00013925877,0.00005623076,0.92046195,0.0022969318,0.07332273,0.003074917,0.000025226496],"about_ca_topic_score_codex":0.00219205,"about_ca_topic_score_gemma":0.0023964902,"teacher_disagreement_score":0.0025600793,"about_ca_system_score_codex":0.0012287094,"about_ca_system_score_gemma":0.0010059912,"threshold_uncertainty_score":0.011763871},"labels":[],"label_agreement":null},{"id":"W1600126388","doi":"10.1007/978-3-540-28634-9_24","title":"Application of Eigenspace Analysis Techniques to Ad-Hoc Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Artificial intelligence; Computer network; Telecommunications; Wireless","score_opus":0.008112222466846942,"score_gpt":0.24191984303835792,"score_spread":0.23380762057151097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600126388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002657326,0.0022544197,0.990006,0.0001207284,0.00013816362,0.0000109840785,0.000018866394,0.0002831456,0.004510297],"genre_scores_gemma":[0.18785468,0.012952458,0.7766515,0.00017394664,0.00068622467,0.00011890071,0.00019323248,0.00033441657,0.021034753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.0001134009,0.000018748864,0.000047361555,0.00016001762,0.000025485788],"domain_scores_gemma":[0.9993617,0.00040336695,0.000030235386,0.00008079518,0.00010591864,0.000018019491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036779584,0.0009155339,0.0007944169,0.0013733389,0.00045390212,0.0011827445,0.0006569273,0.0006466361,0.0036826492],"category_scores_gemma":[0.0014356395,0.00046670102,0.0006107224,0.0017478133,0.00079602795,0.001416462,0.0008644702,0.0013726243,0.0013650313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007169457,0.00011137745,0.0005824963,0.00037549078,0.0001318597,0.00025697154,0.00031168252,0.13263868,0.026557175,0.21808067,0.008723682,0.61215824],"study_design_scores_gemma":[0.000013643978,0.000057035086,0.0005280115,0.00007365868,0.000032924454,0.00048644323,0.00009610056,0.66286033,0.0073067765,0.30055192,0.027952168,0.000040984643],"about_ca_topic_score_codex":0.00050692284,"about_ca_topic_score_gemma":0.00046496792,"teacher_disagreement_score":0.0036826492,"about_ca_system_score_codex":0.00023620045,"about_ca_system_score_gemma":0.00021851732,"threshold_uncertainty_score":0.012319684},"labels":[],"label_agreement":null},{"id":"W1600819600","doi":"","title":"An H {592}[infinity] dynamic routing control of networked multi-agent systems","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Robustness (evolution); Computer science; Scalability; Queueing theory; Routing (electronic design automation); Network topology; Distributed computing; Mathematics; Computer network","score_opus":0.023169533799254252,"score_gpt":0.2764865862700022,"score_spread":0.253317052470748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600819600","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014794598,0.010082127,0.5330838,0.0037922745,0.008297645,0.0002541795,0.0006847349,0.00096487795,0.42804572],"genre_scores_gemma":[0.48849294,0.010852405,0.06529327,0.001629902,0.0027733196,0.0005788973,0.001372248,0.0002643196,0.42874265],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969196,0.00007280692,0.000016910615,0.00008448521,0.000112196925,0.000021682621],"domain_scores_gemma":[0.99978787,0.00003567274,0.000024327206,0.00002073119,0.00011403439,0.000017414479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040098478,0.0008181596,0.00041526175,0.00037366184,0.00049727154,0.0014021999,0.00047583776,0.00077327323,0.023803873],"category_scores_gemma":[0.0009386793,0.00010151932,0.00031118374,0.00078874564,0.00057260686,0.00049623055,0.0007512409,0.0009088668,0.0048327455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001742631,0.0000711422,0.0005345692,0.0007130305,0.00009109889,0.00045130457,0.00023719056,0.10587403,0.0069227563,0.52198035,0.090998545,0.2719518],"study_design_scores_gemma":[0.00005618306,0.0001951694,0.0012387575,0.00022934943,0.000050340273,0.00023212667,0.000090145084,0.38902923,0.00260559,0.13955079,0.46665215,0.00007029933],"about_ca_topic_score_codex":0.005310326,"about_ca_topic_score_gemma":0.0017354725,"teacher_disagreement_score":0.023803873,"about_ca_system_score_codex":0.0007425652,"about_ca_system_score_gemma":0.00083211076,"threshold_uncertainty_score":0.079631865},"labels":[],"label_agreement":null},{"id":"W1603830235","doi":"10.1007/978-3-540-39611-6_9","title":"A Uniform Continuum Model for Scaling of Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Network packet; Scalability; Packet forwarding; Overhead (engineering); Routing (electronic design automation); Scaling; Distributed computing; Telecommunications; Wireless; Mathematics","score_opus":0.017138113934079,"score_gpt":0.23753708255443076,"score_spread":0.22039896862035177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1603830235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024165059,0.0034005935,0.9087912,0.0025469852,0.00072091556,0.00009799589,0.00022782643,0.00048487925,0.059564605],"genre_scores_gemma":[0.82101536,0.0059352405,0.113797516,0.0013978078,0.0017754801,0.00042276856,0.00033657125,0.00040655895,0.05491268],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.00036894868,0.000045313627,0.0001636499,0.00034362686,0.00014212335],"domain_scores_gemma":[0.998293,0.00066770654,0.00016900121,0.00028922723,0.00031965907,0.0002615007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015004849,0.0009719409,0.0014044511,0.0014652817,0.0012214023,0.0030001597,0.0033065213,0.0023493527,0.0069590756],"category_scores_gemma":[0.0066615753,0.00058917515,0.001038033,0.0017850931,0.0024336863,0.00468388,0.0024013014,0.0025165884,0.0014154036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025013751,0.000040001298,0.00013657456,0.000062680876,0.000013619091,0.00008001736,0.000087541426,0.057713524,0.00072585716,0.9299412,0.0044156,0.0067583458],"study_design_scores_gemma":[0.000024764546,0.000037725502,0.000117393894,0.000026983193,0.000015627342,0.00012068143,0.00005276492,0.5053255,0.00016224368,0.4879109,0.006186448,0.000018994717],"about_ca_topic_score_codex":0.0016750556,"about_ca_topic_score_gemma":0.00083676504,"teacher_disagreement_score":0.0069590756,"about_ca_system_score_codex":0.0015719637,"about_ca_system_score_gemma":0.00075941905,"threshold_uncertainty_score":0.023280442},"labels":[],"label_agreement":null},{"id":"W1606207121","doi":"10.2478/v10248-012-0014-2","title":"Energy Efficient Routing for Multi Hop Ad Hoc Networks with Multiple Access and Adaptive Modulation to Maximise Throughput","year":2012,"lang":"en","type":"article","venue":"Image Processing & Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Humber Polytechnic","funders":"","keywords":"Computer science; Computer network; Throughput; Energy consumption; Wireless ad hoc network; Node (physics); Wireless; Link adaptation; Telecommunications; Fading; Channel (broadcasting); Electrical engineering; Engineering","score_opus":0.061608131981455254,"score_gpt":0.3226112787963205,"score_spread":0.26100314681486525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606207121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07013724,0.0025205566,0.92112714,0.0003378551,0.00012811409,0.00014503057,0.000022928049,0.0003287295,0.005252414],"genre_scores_gemma":[0.8344008,0.0011598428,0.16104782,0.00008237552,0.00008747655,0.00014306087,0.00003287508,0.000025631134,0.0030201478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995115,0.00022797888,0.00002217518,0.000034684257,0.00016068872,0.00004292605],"domain_scores_gemma":[0.9994905,0.0002854564,0.00007634129,0.000048853115,0.00008518135,0.000013562022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057655486,0.0004086231,0.00029847902,0.0005897403,0.00039251053,0.00055576325,0.00052776455,0.0003887387,0.0008847564],"category_scores_gemma":[0.001561188,0.00014245915,0.00020848177,0.0005706961,0.00031265875,0.0007946043,0.00038752286,0.00031347355,0.00019003858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027376553,0.00021580212,0.0014608846,0.00033867636,0.00011722567,0.0002828453,0.0002065683,0.53061056,0.10815055,0.06206146,0.0028466885,0.29343492],"study_design_scores_gemma":[0.000028647044,0.0002780071,0.00047634693,0.000020730042,0.000031106574,0.0001735505,0.000030011826,0.96926695,0.011593879,0.012751694,0.0053324425,0.000016621068],"about_ca_topic_score_codex":0.0003184079,"about_ca_topic_score_gemma":0.00068469776,"teacher_disagreement_score":0.0008847564,"about_ca_system_score_codex":0.00046727996,"about_ca_system_score_gemma":0.00027909756,"threshold_uncertainty_score":0.0033904314},"labels":[],"label_agreement":null},{"id":"W1616592890","doi":"10.1007/978-3-642-11723-7_31","title":"Reliable Coverage Area Based Link Expiration Time (LET) Routing Metric for Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Link-state routing protocol; Routing Information Protocol; Metrics; Distance-vector routing protocol; Zone Routing Protocol; Routing protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.014490797908544321,"score_gpt":0.22020806118031672,"score_spread":0.2057172632717724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1616592890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02332539,0.016450519,0.9487607,0.00067723973,0.0007176107,0.00014344092,0.0006913427,0.0018475452,0.007386203],"genre_scores_gemma":[0.63086283,0.0074076382,0.3506648,0.00022203423,0.00051727216,0.00034479055,0.0014318645,0.00033099443,0.008217771],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989166,0.00034708955,0.000080952515,0.00010438795,0.0004995797,0.00005140726],"domain_scores_gemma":[0.9981059,0.0007726386,0.0003606626,0.00025693988,0.00044013633,0.00006379925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010749,0.0007086989,0.0005534181,0.001175986,0.00030730327,0.0009554196,0.0011108181,0.00056491804,0.0010362738],"category_scores_gemma":[0.005040349,0.00018762721,0.00022215334,0.0017756078,0.0003245262,0.0013607407,0.00054067187,0.00067037763,0.0005684648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035681212,0.000067556655,0.0020739622,0.0008579312,0.00011053154,0.0002796175,0.00030215498,0.17484914,0.032802336,0.056365862,0.02468386,0.70725024],"study_design_scores_gemma":[0.000047905058,0.0009969157,0.0029140331,0.00018115771,0.00012458388,0.0014449116,0.00020439833,0.8332314,0.024839703,0.05116043,0.08472389,0.00013064276],"about_ca_topic_score_codex":0.00044828013,"about_ca_topic_score_gemma":0.0006960409,"teacher_disagreement_score":0.001175986,"about_ca_system_score_codex":0.00056339067,"about_ca_system_score_gemma":0.00039809884,"threshold_uncertainty_score":0.005684674},"labels":[],"label_agreement":null},{"id":"W1627672439","doi":"10.1007/978-3-642-04434-2_1","title":"On Trust Evaluation in Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Communications Research Centre Canada","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer security","score_opus":0.01958403878938217,"score_gpt":0.24852280741779498,"score_spread":0.2289387686284128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1627672439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008434655,0.0072532455,0.97191477,0.0013995897,0.00053288916,0.00014720058,0.000065392414,0.0001383621,0.010114026],"genre_scores_gemma":[0.5866756,0.011013716,0.38200295,0.00047993672,0.0021905869,0.00040406475,0.0003807326,0.0002122656,0.016640188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909899,0.0050783334,0.00054631056,0.00069245364,0.0022580456,0.0004350166],"domain_scores_gemma":[0.9722395,0.022447493,0.00077348156,0.0016857599,0.0024182424,0.00043542957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009048912,0.0015000192,0.002530158,0.0014015024,0.000978618,0.0036080573,0.002105525,0.0017301539,0.0031101892],"category_scores_gemma":[0.030043079,0.0005934188,0.0009522648,0.0025538064,0.0029201172,0.0076536313,0.0024511686,0.0034644275,0.000611618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038986965,0.00023127858,0.0019204055,0.00066499057,0.00021879021,0.00037573703,0.00092979666,0.21077247,0.0017494974,0.43677688,0.01417995,0.33179036],"study_design_scores_gemma":[0.0000340391,0.00013866255,0.000480309,0.00017552244,0.000062936924,0.00016487815,0.00015502938,0.57883596,0.00083502574,0.41192314,0.007160762,0.00003379222],"about_ca_topic_score_codex":0.0021287217,"about_ca_topic_score_gemma":0.0016492491,"teacher_disagreement_score":0.009048912,"about_ca_system_score_codex":0.0025176648,"about_ca_system_score_gemma":0.0010501002,"threshold_uncertainty_score":0.047855794},"labels":[],"label_agreement":null},{"id":"W1641151077","doi":"10.1109/lwc.2015.2436397","title":"Random Node Failures and Wireless Networks Connectivity: Theoretical Analysis","year":2015,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless network; Node (physics); Scheduling (production processes); Wireless; Wireless sensor network; Upper and lower bounds; Channel (broadcasting); Distributed computing; Telecommunications; Mathematics; Engineering; Mathematical optimization","score_opus":0.018957427859622226,"score_gpt":0.25449939935614085,"score_spread":0.23554197149651862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1641151077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10226114,0.008902646,0.84978503,0.005949758,0.00024890632,0.00009003911,0.00028988472,0.00063883193,0.031833734],"genre_scores_gemma":[0.96302915,0.009924686,0.019757543,0.00055408315,0.0007592897,0.0003707185,0.00018546906,0.00017310517,0.005245836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979207,0.00084902963,0.000047108315,0.00023322122,0.0006755775,0.00027438588],"domain_scores_gemma":[0.9688676,0.027037902,0.0019187225,0.00076275016,0.0010523011,0.0003606232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037933113,0.0013153539,0.0010708587,0.0034086832,0.0011301388,0.0021263438,0.0019045135,0.002026066,0.004092119],"category_scores_gemma":[0.03475618,0.0007922318,0.0007736628,0.002554245,0.004185218,0.0050082454,0.0020204517,0.0023917991,0.0006564545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080705184,0.00006630801,0.002164223,0.00030999052,0.000070075774,0.0003079461,0.00041511573,0.47878528,0.0012647721,0.4895686,0.0057303263,0.021236638],"study_design_scores_gemma":[0.000013268369,0.000046742265,0.0006210634,0.0000711529,0.0000318424,0.00024601616,0.00013613385,0.81890017,0.0003562646,0.17758945,0.0019646846,0.000023154174],"about_ca_topic_score_codex":0.0023671372,"about_ca_topic_score_gemma":0.0015489535,"teacher_disagreement_score":0.004092119,"about_ca_system_score_codex":0.0029622174,"about_ca_system_score_gemma":0.0006431537,"threshold_uncertainty_score":0.021492481},"labels":[],"label_agreement":null},{"id":"W1656989426","doi":"10.1109/notere.2015.7293484","title":"Overlay interconnection for end-user applications and wireless sensor networks in MANETs","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Interconnection; Overlay; Default gateway; Internetworking; Middleware (distributed applications); Overlay network; Wireless sensor network; Architecture; Wireless; Distributed computing; Gateway (web page); Telecommunications; The Internet; Operating system; World Wide Web","score_opus":0.016998939889266953,"score_gpt":0.2495604747544342,"score_spread":0.23256153486516723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1656989426","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076479495,0.0033704538,0.89594877,0.001235522,0.0002124448,0.0002173422,0.000074041374,0.0013268306,0.02113512],"genre_scores_gemma":[0.76101,0.0033766902,0.22348878,0.00015737947,0.00020049958,0.00024176585,0.00018670803,0.00011511109,0.011223087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945706,0.00023235142,0.00003466048,0.000071543305,0.00015848406,0.000045932302],"domain_scores_gemma":[0.9993432,0.00031595048,0.00004625044,0.00010996317,0.00014282635,0.00004179475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075088977,0.00031402364,0.00029799735,0.00034710698,0.0008295066,0.0011754625,0.0005933764,0.00071186945,0.0014472054],"category_scores_gemma":[0.0021635713,0.00022434577,0.00018883041,0.0006132629,0.00055165146,0.002146043,0.00096082874,0.00060665276,0.00031714697],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003681787,0.00018437188,0.0025033632,0.000877676,0.000072898765,0.0015976162,0.0014334646,0.26415005,0.07296986,0.4045597,0.013668004,0.23761469],"study_design_scores_gemma":[0.000026196765,0.00034773836,0.0013802159,0.000075757605,0.000054802353,0.00092881406,0.00064902887,0.7951364,0.018507954,0.0985551,0.084292896,0.000045134635],"about_ca_topic_score_codex":0.0012538454,"about_ca_topic_score_gemma":0.0022257587,"teacher_disagreement_score":0.0014472054,"about_ca_system_score_codex":0.00062992366,"about_ca_system_score_gemma":0.00046477513,"threshold_uncertainty_score":0.0048413873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01643028610307961,"score_gpt":0.25713295008580345,"score_spread":0.24070266398272383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661775361","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007198188,0.046084702,0.22019263,0.0024374123,0.0067339456,0.0003375934,0.0026357663,0.0057790847,0.71507907],"genre_scores_gemma":[0.0018014285,0.023530249,0.03485903,0.00093098654,0.0008109076,0.00021177073,0.0015912597,0.0007345942,0.93552977],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957997,0.00003823726,0.000017716267,0.000056125806,0.0002762293,0.00003170019],"domain_scores_gemma":[0.9992887,0.00020087282,0.000029163939,0.00008546992,0.0003159001,0.00007990062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048541554,0.0024338204,0.0019366717,0.0024118572,0.0006585533,0.0018367383,0.0017574447,0.001492875,0.13918523],"category_scores_gemma":[0.00130571,0.00082013174,0.0004982934,0.0031523202,0.0004878499,0.0030437359,0.0011997987,0.0026790854,0.17346257],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014438451,0.00006806002,0.00007419074,0.0003463426,0.000013832877,0.000066141096,0.000055586705,0.0020911358,0.0010175969,0.015029294,0.61189723,0.3693261],"study_design_scores_gemma":[0.0000052405044,0.000022609256,0.00010198009,0.00018471987,0.000008091008,0.0001615169,0.000015523148,0.0015291733,0.00023758276,0.006017081,0.99170625,0.000010294262],"about_ca_topic_score_codex":0.0017443092,"about_ca_topic_score_gemma":0.0059891804,"teacher_disagreement_score":0.13918523,"about_ca_system_score_codex":0.00070271763,"about_ca_system_score_gemma":0.0013281791,"threshold_uncertainty_score":0.465621},"labels":[],"label_agreement":null},{"id":"W1663565304","doi":"10.5555/2147671.2147714","title":"Cross-layer cluster-based data dissemination for failure detection in MANETs","year":2011,"lang":"en","type":"article","venue":"Conference on Network and Service Management","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Computer network; Gossip; Node (physics); Network layer; Overhead (engineering); Dissemination; Distributed computing; Wireless sensor network; Flooding (psychology); Layer (electronics); Engineering","score_opus":0.057374299895364564,"score_gpt":0.2902060172202093,"score_spread":0.2328317173248447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1663565304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04664985,0.0013601611,0.94763273,0.0002460033,0.000105899795,0.00018910592,0.000049956874,0.0021560057,0.0016103364],"genre_scores_gemma":[0.81039196,0.0006800882,0.1862771,0.000116282594,0.000056360732,0.00015610241,0.00014246833,0.00008634181,0.0020933042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.0003457726,0.00009001533,0.00013199096,0.00032334562,0.000067438814],"domain_scores_gemma":[0.99766195,0.0010763552,0.00023653792,0.0004955547,0.0004348047,0.00009474767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021712491,0.00037891144,0.0005464473,0.00096347387,0.0006077123,0.00082190265,0.0010618521,0.0006409312,0.0010849868],"category_scores_gemma":[0.005310286,0.00033355466,0.00032226287,0.0009312366,0.0005230298,0.0011956852,0.0010309471,0.0006392463,0.00029886916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011522936,0.00029619536,0.00493655,0.0006375713,0.00032520134,0.0004700979,0.0007897289,0.4828776,0.08153936,0.033655003,0.0071452796,0.3861751],"study_design_scores_gemma":[0.000040134077,0.00020992325,0.00087779213,0.000016731488,0.00004558355,0.0001861032,0.000042303287,0.9780847,0.013021783,0.0034088402,0.004036669,0.000029484556],"about_ca_topic_score_codex":0.0018611202,"about_ca_topic_score_gemma":0.0014635551,"teacher_disagreement_score":0.0021712491,"about_ca_system_score_codex":0.00060674816,"about_ca_system_score_gemma":0.000531837,"threshold_uncertainty_score":0.011482775},"labels":[],"label_agreement":null},{"id":"W166551268","doi":"10.22215/etd/2006-06188","title":"Adaptive algorithms for routing and traffic engineering in stochastic networks","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Routing algorithm; Computer science; Routing (electronic design automation); Humanities; Algorithm; Computer network; Routing protocol; Art","score_opus":0.010240255096183665,"score_gpt":0.22897656229686705,"score_spread":0.21873630720068338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W166551268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040484928,0.0004715378,0.99333924,0.00027965786,0.00010993635,0.000026010546,0.000025520669,0.00016617158,0.0015332983],"genre_scores_gemma":[0.4725133,0.0028924022,0.5057057,0.00043062196,0.001040297,0.0006002794,0.00037052148,0.00027922378,0.016167728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998744,0.0006003732,0.00005615925,0.00017421042,0.0003287409,0.00009643797],"domain_scores_gemma":[0.9950289,0.004012837,0.00025525625,0.00023675615,0.00033440258,0.00013181673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082955,0.000867492,0.0007602539,0.0010482635,0.00052727,0.0012330291,0.0015391668,0.0013715618,0.0026910037],"category_scores_gemma":[0.011592886,0.00048691747,0.0005839585,0.001266234,0.0012662956,0.0018762283,0.0015448123,0.0020735068,0.0005866748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005842088,0.000039602714,0.00036151666,0.000063154905,0.00004459694,0.000026207545,0.000054147837,0.8247865,0.00090639887,0.11828054,0.0024464196,0.052932505],"study_design_scores_gemma":[0.000007800539,0.00000788525,0.000030109033,0.0000035649557,0.00000224212,0.000005470857,0.0000030036804,0.9772864,0.000077278004,0.021934904,0.00063890306,0.000002498202],"about_ca_topic_score_codex":0.0032538723,"about_ca_topic_score_gemma":0.002972577,"teacher_disagreement_score":0.0032538723,"about_ca_system_score_codex":0.0012568214,"about_ca_system_score_gemma":0.0010520763,"threshold_uncertainty_score":0.011015892},"labels":[],"label_agreement":null},{"id":"W1677044153","doi":"","title":"A Survey on Some Currently Existing Intrusion Detection Systems for Mobile Ad Hoc Networks","year":2015,"lang":"en","type":"article","venue":"International Conference on Electrical and Electronics Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mobile ad hoc network; Computer science; Intrusion detection system; Computer security; Computer network; Throughput; Confidentiality; Wireless ad hoc network; Harm; Vehicular ad hoc network; Wireless; Network packet; Telecommunications","score_opus":0.0408647280678053,"score_gpt":0.2731785203578787,"score_spread":0.2323137922900734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677044153","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014089962,0.8205587,0.13389169,0.0015459374,0.0016796426,0.00042831924,0.00053539703,0.0017051594,0.025565201],"genre_scores_gemma":[0.08144628,0.7739135,0.12650725,0.0012098412,0.0017630286,0.0003367319,0.001839946,0.00018545096,0.012797923],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986451,0.00023446424,0.00026699778,0.00021477045,0.0005322219,0.00010630601],"domain_scores_gemma":[0.99821436,0.0009374753,0.00013542826,0.00014392637,0.0004969385,0.000071870214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013042743,0.0011178065,0.0011479519,0.0037442339,0.0006688525,0.0017570499,0.0017904993,0.0011114241,0.003639134],"category_scores_gemma":[0.0026940193,0.0007030801,0.0008751541,0.004466469,0.0003913245,0.0035348432,0.00084175315,0.0011482483,0.002055302],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012770215,0.00016129122,0.0019835348,0.0048588356,0.00008023401,0.0001767118,0.00017900535,0.002210595,0.004948566,0.006710355,0.014112818,0.9644505],"study_design_scores_gemma":[0.000030751376,0.00086355023,0.0049195094,0.002533222,0.00034446164,0.003750444,0.00041075825,0.027531533,0.014444964,0.007399129,0.93761605,0.00015565318],"about_ca_topic_score_codex":0.00075382,"about_ca_topic_score_gemma":0.00081255083,"teacher_disagreement_score":0.0037442339,"about_ca_system_score_codex":0.0005787075,"about_ca_system_score_gemma":0.0009009525,"threshold_uncertainty_score":0.0121741295},"labels":[],"label_agreement":null},{"id":"W1749917426","doi":"10.1007/978-3-642-16023-3_22","title":"Broadcasting in Sensor Networks of Unknown Topology in the Presence of Swamping","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Broadcasting (networking); Wireless sensor network; Computer science; Granularity; Topology (electrical circuits); Network topology; Computer network; Plane (geometry); Wireless; Upper and lower bounds; Distributed computing; Telecommunications; Mathematics; Combinatorics; Geometry; Mathematical analysis","score_opus":0.015762162602857645,"score_gpt":0.24806053918884366,"score_spread":0.232298376585986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1749917426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2412279,0.00980453,0.71947986,0.0015447863,0.00032633526,0.0000971401,0.00014905847,0.00053827267,0.026832094],"genre_scores_gemma":[0.946459,0.005730567,0.035067555,0.00010108976,0.0002970913,0.00006561621,0.00011853514,0.00012233261,0.012038207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949145,0.00017578545,0.000020408752,0.000085961925,0.00015936038,0.00006716246],"domain_scores_gemma":[0.9948361,0.004151648,0.0003353504,0.00018871289,0.00032902663,0.00015922224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009305404,0.0004628248,0.0011361716,0.0009716729,0.0007664571,0.0012688839,0.001358275,0.0013553159,0.0011400525],"category_scores_gemma":[0.007702627,0.00071671925,0.000408793,0.0015239873,0.0020124153,0.0027774943,0.0011655911,0.0009985788,0.00024717514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034226576,0.000058189366,0.0019455974,0.00075875764,0.00007648294,0.0010970057,0.0013671367,0.7416553,0.01462193,0.1619064,0.0038730996,0.07229788],"study_design_scores_gemma":[0.000024538242,0.000082961626,0.0005789504,0.000032012053,0.000032884396,0.00042423804,0.00024752985,0.9218369,0.001442985,0.07272586,0.0025438338,0.000027353823],"about_ca_topic_score_codex":0.003186036,"about_ca_topic_score_gemma":0.002144846,"teacher_disagreement_score":0.003186036,"about_ca_system_score_codex":0.0009948295,"about_ca_system_score_gemma":0.0004910928,"threshold_uncertainty_score":0.007218063},"labels":[],"label_agreement":null},{"id":"W177094228","doi":"10.1007/978-1-4615-4495-1_8","title":"Transformations and Exact Node Routing Solutions by Column Generation","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Static routing; Computer science; Policy-based routing; Multipath routing; Destination-Sequenced Distance Vector routing; Arc routing; Link-state routing protocol; Equal-cost multi-path routing; Dynamic Source Routing; Geographic routing; Computer network; Distributed computing; Routing (electronic design automation); Mathematical optimization; Mathematics; Routing protocol","score_opus":0.02120271554104778,"score_gpt":0.21136274990855203,"score_spread":0.19016003436750425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W177094228","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039330088,0.00068661704,0.95861816,0.00023457076,0.00037177207,0.00006978439,0.00021380736,0.0021162548,0.033755925],"genre_scores_gemma":[0.116664104,0.0017598252,0.8177672,0.00036405685,0.00024158778,0.00020900823,0.0010197965,0.0011501298,0.0608242],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972445,0.000050151208,0.0000104963465,0.000046457764,0.00013660961,0.000031846204],"domain_scores_gemma":[0.99971384,0.000079902384,0.0000129641985,0.00012119584,0.00006250257,0.000009559583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002434347,0.0006746674,0.0005494868,0.000606516,0.00044486584,0.0008738433,0.0010177235,0.00033482016,0.017257264],"category_scores_gemma":[0.000932409,0.0003368704,0.00042650374,0.0014237739,0.0005831598,0.0013061372,0.00077665364,0.0012287268,0.0042351917],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009777516,0.00007178697,0.00010677332,0.00017454494,0.000023257593,0.0000529332,0.00009619093,0.0777891,0.008857211,0.23910636,0.04137481,0.63224924],"study_design_scores_gemma":[0.000058297126,0.0000809052,0.00014655014,0.00004583882,0.000030843865,0.00023520149,0.00007859967,0.41504592,0.016518377,0.43996215,0.12776528,0.00003197122],"about_ca_topic_score_codex":0.0014347231,"about_ca_topic_score_gemma":0.0019048532,"teacher_disagreement_score":0.017257264,"about_ca_system_score_codex":0.00046679846,"about_ca_system_score_gemma":0.00050254003,"threshold_uncertainty_score":0.05773133},"labels":[],"label_agreement":null},{"id":"W1774937627","doi":"10.1109/lcn.2004.135","title":"Voilaˋ: delivering messages across partitioned ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Computer network; Computer science; Network packet; Wireless ad hoc network; Mobile ad hoc network; Partition (number theory); Routing protocol; Network partition; Distributed computing; Routing (electronic design automation); Wireless; Wireless network; Host (biology); Telecommunications; Mathematics","score_opus":0.012109925326266292,"score_gpt":0.25263136175294526,"score_spread":0.24052143642667898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1774937627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018820105,0.003230637,0.95354176,0.0005825357,0.001304306,0.00047814654,0.00032706422,0.006958359,0.014757105],"genre_scores_gemma":[0.28679475,0.0051263045,0.6773586,0.00058906554,0.0005768088,0.0005015351,0.0012314105,0.0006259702,0.027195528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993149,0.00012922478,0.000053380663,0.000101959406,0.0003351746,0.000065373104],"domain_scores_gemma":[0.9992034,0.00018201224,0.000113788956,0.0001981332,0.00022209746,0.00008055667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000777626,0.00076414994,0.0006905039,0.00080816715,0.00093221926,0.0013789961,0.0015248422,0.00075755024,0.0029778895],"category_scores_gemma":[0.002170933,0.00043497456,0.00027966118,0.0010520001,0.0007727543,0.0022688825,0.0019158078,0.00057837425,0.0027395762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051934045,0.00008674531,0.00086479797,0.0010746534,0.00015985823,0.0008390323,0.0012295876,0.023012359,0.058503684,0.06709073,0.03469018,0.81192905],"study_design_scores_gemma":[0.00031104023,0.0013987097,0.0012975,0.0002759335,0.0002587981,0.002779085,0.0009965627,0.2312659,0.07814449,0.09604844,0.58708704,0.00013661978],"about_ca_topic_score_codex":0.0006590375,"about_ca_topic_score_gemma":0.0005811141,"teacher_disagreement_score":0.0029778895,"about_ca_system_score_codex":0.00028992002,"about_ca_system_score_gemma":0.00044135872,"threshold_uncertainty_score":0.009962022},"labels":[],"label_agreement":null},{"id":"W1778406155","doi":"10.1109/vetecs.2006.1682883","title":"Analysis of Capacity Improvements in Multi-Radio Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Waterloo","funders":"","keywords":"Bottleneck; Wireless mesh network; Computer network; Computer science; Bandwidth (computing); Wireless; Wireless network; Interference (communication); Collision; Radio resource management; Distributed computing; Telecommunications; Channel (broadcasting); Computer security; Embedded system","score_opus":0.015228426607486986,"score_gpt":0.23298020922835175,"score_spread":0.21775178262086475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1778406155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20693964,0.009698633,0.70189273,0.002538414,0.00035968595,0.00010627329,0.0005023431,0.0011099762,0.076852255],"genre_scores_gemma":[0.97748077,0.0018576044,0.016413374,0.00018510991,0.0001755372,0.00008075131,0.00010384835,0.00012996749,0.0035730128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831945,0.0005466038,0.000027579767,0.00010411871,0.00054662,0.00045563793],"domain_scores_gemma":[0.99212086,0.0060738344,0.00046720036,0.00036951277,0.00082863885,0.00014002436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019233668,0.00080640207,0.0005430352,0.0013530428,0.00044178093,0.0009803921,0.0011713766,0.0007527098,0.005553384],"category_scores_gemma":[0.01084117,0.0003494211,0.00038570864,0.0012701887,0.000987638,0.0021765344,0.0010195262,0.0011183417,0.000558449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015278823,0.000047625257,0.00062522426,0.00023307865,0.000040478553,0.00016006953,0.00008247228,0.8752146,0.0069059352,0.086206056,0.0026311567,0.027700478],"study_design_scores_gemma":[0.0000054656307,0.0000325379,0.00040230592,0.000031198128,0.000014140446,0.00007293724,0.000032765463,0.973103,0.0021445893,0.02260316,0.00154545,0.000012568452],"about_ca_topic_score_codex":0.0015132322,"about_ca_topic_score_gemma":0.0011628213,"teacher_disagreement_score":0.005553384,"about_ca_system_score_codex":0.0020969852,"about_ca_system_score_gemma":0.0006786838,"threshold_uncertainty_score":0.018577933},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.017450533822314877,"score_gpt":0.2107557105450149,"score_spread":0.19330517672270003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1780992783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038901232,0.0037852812,0.92005116,0.0009430548,0.00017471376,0.0000656837,0.00011137502,0.00046086157,0.03550662],"genre_scores_gemma":[0.64310664,0.009092066,0.3240751,0.00032916898,0.0005148742,0.0002788164,0.00040425468,0.00029004103,0.021908928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999686,0.00010703207,0.000010393625,0.00006031059,0.00010649255,0.000029747565],"domain_scores_gemma":[0.9996792,0.00021026365,0.000030566567,0.00003994342,0.000026187417,0.000013840499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000309325,0.0008019728,0.0005034289,0.00039853778,0.00027115332,0.00084479456,0.00088411965,0.0007304428,0.003276016],"category_scores_gemma":[0.0013464367,0.0003442729,0.0003107527,0.0012271099,0.0007407276,0.0019717426,0.0005877572,0.0006428402,0.0007443428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010929833,0.000060886792,0.0002788026,0.0004424211,0.000032761935,0.00020570528,0.0001873695,0.35269877,0.0060414956,0.44185847,0.011465101,0.18661901],"study_design_scores_gemma":[0.000042224918,0.00014885157,0.00027251797,0.000048916172,0.000023466766,0.00042371443,0.00007448568,0.43630934,0.0027884701,0.5299082,0.029943801,0.00001606089],"about_ca_topic_score_codex":0.00026331813,"about_ca_topic_score_gemma":0.00024615726,"teacher_disagreement_score":0.003276016,"about_ca_system_score_codex":0.00044876113,"about_ca_system_score_gemma":0.0002445124,"threshold_uncertainty_score":0.010959387},"labels":[],"label_agreement":null},{"id":"W1793323729","doi":"10.1007/978-3-642-37119-6_21","title":"QoS Aware Adaptive Security Scheme for Video Streaming in MANETs","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Cryptography; Mobile QoS; Computer network; Overhead (engineering); Scheme (mathematics); Bandwidth (computing); Adaptive quality of service multi-hop routing; Multimedia; Distributed computing; Computer security; Service (business); Service provider; Routing (electronic design automation); Routing protocol","score_opus":0.01605122822730854,"score_gpt":0.23980078379609332,"score_spread":0.22374955556878479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1793323729","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12722267,0.0030394457,0.85823184,0.0008538868,0.00052808685,0.00028328274,0.0001653187,0.0013961857,0.008279282],"genre_scores_gemma":[0.914802,0.00092549616,0.07732259,0.00020382392,0.00021230869,0.00008294519,0.00017223741,0.00004355583,0.0062350105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995389,0.00008767883,0.00003085349,0.00008374395,0.00015605286,0.000102709804],"domain_scores_gemma":[0.99918205,0.00027934322,0.000073858806,0.0001271245,0.00026033405,0.00007721992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071227597,0.0005946032,0.0006800263,0.0005997473,0.00078602985,0.00087188475,0.00094512996,0.00062738237,0.0019007627],"category_scores_gemma":[0.0015236804,0.00016844673,0.00025468157,0.0004440552,0.0004734845,0.0011286631,0.0011055082,0.0013937551,0.00037719842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023682634,0.0005455071,0.0013698995,0.0004449154,0.00015118008,0.00083944376,0.00054455793,0.09431708,0.30465937,0.09738396,0.012132698,0.48524314],"study_design_scores_gemma":[0.00011333152,0.0006813582,0.0010872012,0.000061362785,0.00009863462,0.0009972376,0.00020785503,0.90838593,0.04858883,0.030674998,0.009029699,0.000073511146],"about_ca_topic_score_codex":0.0007791329,"about_ca_topic_score_gemma":0.00081347354,"teacher_disagreement_score":0.0019007627,"about_ca_system_score_codex":0.00088618475,"about_ca_system_score_gemma":0.0005694369,"threshold_uncertainty_score":0.0064297915},"labels":[],"label_agreement":null},{"id":"W1795263886","doi":"10.1002/sec.731","title":"A cryptography‐based protocol against packet dropping and message tampering attacks on mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Network packet; Encryption; Vehicular ad hoc network; Ad hoc On-Demand Distance Vector Routing; Data transmission; Optimized Link State Routing Protocol; Routing protocol; Wireless; Telecommunications","score_opus":0.009372966372849413,"score_gpt":0.24587766104086065,"score_spread":0.23650469466801124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1795263886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26433402,0.0013171122,0.7207768,0.0005517542,0.0003577243,0.0006439215,0.00007573301,0.0012877122,0.010655285],"genre_scores_gemma":[0.9577751,0.00028278973,0.040072847,0.00007665641,0.000046317527,0.00009553174,0.00005527023,0.000022288554,0.0015732333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985532,0.0005632879,0.00013471335,0.00009234278,0.0005452733,0.00011114366],"domain_scores_gemma":[0.9963761,0.0013817006,0.0008046026,0.00076868536,0.0005787349,0.0000902375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017887275,0.00048713523,0.00043795584,0.0011717337,0.0005408236,0.0008950164,0.0010497156,0.00083456526,0.0009811382],"category_scores_gemma":[0.0049541057,0.00016784036,0.00038763034,0.00062130165,0.0007991327,0.0017841699,0.0014807775,0.00062600535,0.00034997484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012911513,0.00062975334,0.003953889,0.0005721957,0.0003103131,0.0012125566,0.00047012002,0.44857696,0.18527107,0.12930717,0.0032796902,0.22512509],"study_design_scores_gemma":[0.000112245114,0.0010726945,0.0007160688,0.000053545296,0.00009668819,0.0007791615,0.00005746094,0.9244073,0.052306056,0.013686381,0.006669001,0.000043392498],"about_ca_topic_score_codex":0.00029449826,"about_ca_topic_score_gemma":0.00015657529,"teacher_disagreement_score":0.0017887275,"about_ca_system_score_codex":0.0004440122,"about_ca_system_score_gemma":0.0007342436,"threshold_uncertainty_score":0.009459794},"labels":[],"label_agreement":null},{"id":"W1814673524","doi":"10.1002/wcm.1164","title":"Fault‐tolerance in wireless ad hoc networks: bi‐connectivity through movement of removable nodes","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Node (physics); Wireless ad hoc network; Ring network; Mobile ad hoc network; Wireless mesh network; Wireless network; Distributed computing; Wireless; Network packet; Network topology; Engineering","score_opus":0.031502922465628976,"score_gpt":0.26493108452082376,"score_spread":0.2334281620551948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814673524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067514025,0.0011175887,0.92480415,0.00058284454,0.00014590644,0.00010352839,0.000076296514,0.00034573174,0.0053099226],"genre_scores_gemma":[0.8525688,0.00094875315,0.14073768,0.00015114843,0.000079421385,0.0001615837,0.00019252549,0.000047582194,0.0051125223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994037,0.00016659974,0.000061717496,0.00012944483,0.00016887508,0.00006973615],"domain_scores_gemma":[0.9990103,0.00033587404,0.00021870971,0.0002024137,0.00015702582,0.00007566814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060380285,0.00064902985,0.0005035863,0.00093700923,0.00071123714,0.0011588505,0.0015970606,0.0009470585,0.0017999362],"category_scores_gemma":[0.0019725761,0.00034235918,0.0004764334,0.0011037282,0.00088368764,0.0024935768,0.002051344,0.00074283447,0.00045134762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042638805,0.00015247666,0.0033164,0.00046001474,0.00010910752,0.00091843755,0.00042319257,0.7042054,0.035866544,0.08725265,0.0027096248,0.16415986],"study_design_scores_gemma":[0.000033789038,0.00026713288,0.0008318455,0.000053042262,0.000049670412,0.0004612404,0.00013917359,0.95400643,0.004960034,0.032353424,0.0068072747,0.00003704649],"about_ca_topic_score_codex":0.001234933,"about_ca_topic_score_gemma":0.0011091147,"teacher_disagreement_score":0.0017999362,"about_ca_system_score_codex":0.00039879698,"about_ca_system_score_gemma":0.00041562945,"threshold_uncertainty_score":0.0060213804},"labels":[],"label_agreement":null},{"id":"W1822930499","doi":"10.1109/ccece.2003.1226077","title":"Zone-based routing protocol for high-mobility MANET","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Routing protocol; Zone Routing Protocol; Mobile ad hoc network; Interior gateway protocol; Link-state routing protocol; Routing (electronic design automation); Network packet","score_opus":0.02148608925440572,"score_gpt":0.28495395609703106,"score_spread":0.26346786684262535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1822930499","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070033316,0.007844767,0.9699821,0.0010740987,0.0010915637,0.0003824588,0.00033701293,0.0024213786,0.009863305],"genre_scores_gemma":[0.37886086,0.015077745,0.5821369,0.0014832751,0.0008515653,0.0017721783,0.00259699,0.0003556809,0.016864764],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916005,0.00026964143,0.00007169222,0.00011662706,0.000328643,0.000053381606],"domain_scores_gemma":[0.9993863,0.00015000445,0.00009112853,0.000131127,0.00019551863,0.000045843284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008274525,0.0005454443,0.00067850534,0.0006952026,0.0008329731,0.0011601577,0.0019645605,0.0011710648,0.0022482588],"category_scores_gemma":[0.0017160812,0.00020365792,0.00043537712,0.001227702,0.0006342874,0.0024179847,0.0012392475,0.0015348895,0.0013719342],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005407194,0.00013099101,0.0014186521,0.0018648871,0.00026105836,0.0012408588,0.00076715415,0.09795452,0.05705924,0.363711,0.05454255,0.4205084],"study_design_scores_gemma":[0.00023766686,0.00058555516,0.0013073705,0.00023224877,0.0002703932,0.003196474,0.00039443115,0.35763785,0.025794657,0.13220382,0.4778518,0.00028780874],"about_ca_topic_score_codex":0.001181179,"about_ca_topic_score_gemma":0.0012259942,"teacher_disagreement_score":0.0022482588,"about_ca_system_score_codex":0.0006152475,"about_ca_system_score_gemma":0.0009096369,"threshold_uncertainty_score":0.0075211525},"labels":[],"label_agreement":null},{"id":"W1833643712","doi":"10.1109/glocom.2000.892013","title":"Improving quality-of-service in ad hoc wireless networks with adaptive multi-path routing","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Adaptive quality of service multi-hop routing; Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless Routing Protocol; Quality of service; Path (computing); Wireless; Distributed computing; Routing protocol; Telecommunications","score_opus":0.03608595613313794,"score_gpt":0.2481804174732569,"score_spread":0.21209446134011894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1833643712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09625591,0.0036749705,0.89612806,0.000517056,0.00015014947,0.00009163716,0.000024499568,0.0012055609,0.0019522646],"genre_scores_gemma":[0.82054156,0.0021290064,0.17562447,0.00010305154,0.00017733585,0.000055573208,0.000057594654,0.00006860786,0.0012428474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989453,0.0003517826,0.00005004015,0.00008793543,0.0004408885,0.0001241391],"domain_scores_gemma":[0.99837035,0.0007414984,0.00022017592,0.00023213377,0.00033855272,0.000097305136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001743963,0.0008882682,0.00065597607,0.000995616,0.00053011905,0.0010256217,0.001479654,0.0007859295,0.00072090264],"category_scores_gemma":[0.0050347806,0.00033358173,0.00029496444,0.00088774617,0.00073007884,0.0024232145,0.0011830527,0.00073609944,0.00024459726],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000523171,0.00031519085,0.00423167,0.00040620213,0.00014532798,0.00030957712,0.00028600966,0.5296767,0.06275381,0.0229794,0.0025852378,0.37578776],"study_design_scores_gemma":[0.000043633794,0.00032968618,0.0007014573,0.000018250574,0.00004985622,0.00020002981,0.000060294224,0.9791668,0.007448578,0.008609361,0.0033462516,0.000025863314],"about_ca_topic_score_codex":0.00095278525,"about_ca_topic_score_gemma":0.0010777223,"teacher_disagreement_score":0.001743963,"about_ca_system_score_codex":0.0005416852,"about_ca_system_score_gemma":0.0004911398,"threshold_uncertainty_score":0.009223044},"labels":[],"label_agreement":null},{"id":"W1844868686","doi":"10.5539/mas.v9n9p131","title":"A Maximum Transmission Range and Relative Energy Based Multipath Routing Strategy in Manet’s","year":2015,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Multipath routing; Routing protocol; Multipath propagation; Overhead (engineering); Distance-vector routing protocol; Mobile ad hoc network; Transmission (telecommunications); Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Link-state routing protocol; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.026801647282263058,"score_gpt":0.23837378485157892,"score_spread":0.21157213756931587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1844868686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06565435,0.0046746326,0.91845727,0.0005422348,0.00019035973,0.00014538236,0.00007795282,0.0005154291,0.009742422],"genre_scores_gemma":[0.8564809,0.002882418,0.13457774,0.000132265,0.000095364165,0.00015653353,0.00012515983,0.000034342134,0.005515243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996209,0.00011667774,0.000023148075,0.000067539615,0.00012596203,0.000045718683],"domain_scores_gemma":[0.9997799,0.00006706137,0.000033801938,0.000022906177,0.00007417357,0.000022227869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038599808,0.00043244616,0.0004992956,0.0007402509,0.0004995948,0.00067567604,0.00094098056,0.00049027824,0.0006262709],"category_scores_gemma":[0.000820864,0.00018830072,0.00034235447,0.00068901276,0.00039117792,0.0009894934,0.0005210524,0.0003564021,0.0002248966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031648102,0.00013988436,0.0021134368,0.0005108921,0.00014167884,0.0008887627,0.00041133357,0.46693206,0.058154676,0.08482934,0.005143131,0.38041827],"study_design_scores_gemma":[0.000037571994,0.000714609,0.0010188407,0.000060293263,0.00007810896,0.001787038,0.00029745616,0.93992513,0.012735407,0.02448025,0.018755032,0.00011028963],"about_ca_topic_score_codex":0.0012474586,"about_ca_topic_score_gemma":0.0012314264,"teacher_disagreement_score":0.0012474586,"about_ca_system_score_codex":0.00045967998,"about_ca_system_score_gemma":0.0005700247,"threshold_uncertainty_score":0.003335297},"labels":[],"label_agreement":null},{"id":"W1845185439","doi":"10.1007/11561354_6","title":"Randomized AB-Face-AB Routing Algorithms in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Static routing; Algorithm; Optimized Link State Routing Protocol; Computer network; Multipath routing; Distributed computing; Routing (electronic design automation); Routing protocol","score_opus":0.01128650629168062,"score_gpt":0.2407008591141244,"score_spread":0.22941435282244377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1845185439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024056759,0.0016532625,0.95789737,0.0016851645,0.0006908093,0.00046723508,0.00030723738,0.0019123361,0.011329865],"genre_scores_gemma":[0.28542668,0.0011714348,0.69684875,0.0010278655,0.00068387337,0.0010781125,0.0008079735,0.0005058393,0.012449527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99418145,0.0028392943,0.00026092687,0.00074271136,0.0012669171,0.00070857845],"domain_scores_gemma":[0.98688054,0.007990552,0.0005457116,0.002706462,0.001387831,0.00048880867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047549605,0.0016734359,0.0025572353,0.0018236015,0.0029088212,0.0027196554,0.0058113025,0.0026398331,0.008989489],"category_scores_gemma":[0.018082716,0.0011668035,0.001272321,0.0032418962,0.00219855,0.0063711456,0.00462362,0.003682284,0.0022359586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024668686,0.00075938465,0.0011940715,0.0005279973,0.00017924477,0.000107590204,0.00027633127,0.36695778,0.004724721,0.18259822,0.04290485,0.39730296],"study_design_scores_gemma":[0.00031515807,0.0002609363,0.00021135034,0.00004617903,0.000052672316,0.000118328186,0.000078809724,0.87623733,0.0016342984,0.116028704,0.004978431,0.000037831967],"about_ca_topic_score_codex":0.003582186,"about_ca_topic_score_gemma":0.005131871,"teacher_disagreement_score":0.008989489,"about_ca_system_score_codex":0.0029274016,"about_ca_system_score_gemma":0.0042127324,"threshold_uncertainty_score":0.030072808},"labels":[],"label_agreement":null},{"id":"W1872539111","doi":"","title":"Refinement of AODV routing algorithm for wireless mesh networks (WMNs)","year":2011,"lang":"en","type":"article","venue":"Iranian Conference on Electrical Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Dynamic Source Routing; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Wireless Routing Protocol; Distributed computing; Routing protocol; Zone Routing Protocol; Ad hoc wireless distribution service; Link-state routing protocol; Wireless ad hoc network; Routing (electronic design automation); Wireless network; Wireless; Telecommunications","score_opus":0.02460674977443898,"score_gpt":0.22223073191937298,"score_spread":0.197623982144934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872539111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019736668,0.0053183995,0.95442516,0.0008851869,0.0009476828,0.000627746,0.00040306145,0.0015868084,0.016069224],"genre_scores_gemma":[0.271007,0.0049738954,0.70585907,0.0004689869,0.00028648996,0.0007397359,0.001812628,0.00019970926,0.014652469],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925965,0.00018856234,0.00007008189,0.00010359526,0.00032320878,0.000054926026],"domain_scores_gemma":[0.99937624,0.0001282292,0.00006567132,0.00007575724,0.00032802796,0.000026155698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070964167,0.00044561646,0.00049718004,0.0008369863,0.00065754744,0.00059459975,0.0017715346,0.00054752413,0.0011608757],"category_scores_gemma":[0.0018868624,0.0002328222,0.00051346613,0.0008247006,0.00029535222,0.0010148885,0.0007416366,0.0008562918,0.0006997542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002673925,0.00018559159,0.0039227293,0.0009970482,0.00019522176,0.00040555277,0.00045933085,0.14333853,0.031932022,0.0728882,0.026119865,0.7192885],"study_design_scores_gemma":[0.0002612729,0.00048858515,0.0027130293,0.00019523046,0.00014370824,0.001306476,0.00042759368,0.6622718,0.031747684,0.03911982,0.2611673,0.00015751249],"about_ca_topic_score_codex":0.0043417388,"about_ca_topic_score_gemma":0.0038705438,"teacher_disagreement_score":0.0043417388,"about_ca_system_score_codex":0.0005146553,"about_ca_system_score_gemma":0.0011475579,"threshold_uncertainty_score":0.008632958},"labels":[],"label_agreement":null},{"id":"W1879381658","doi":"10.1109/wirles.2005.1549521","title":"FuzzyMARS: a fuzzy logic approach with service differentiation for wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer network; Computer science; Quality of service; Wireless ad hoc network; Fuzzy logic; Wireless; Vehicular ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Network packet; Routing protocol; Telecommunications","score_opus":0.015888285232040535,"score_gpt":0.22202327992264415,"score_spread":0.20613499469060362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879381658","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036323497,0.0006031847,0.991156,0.00023150377,0.000070970484,0.000058009115,0.00002440667,0.00022860273,0.0039949906],"genre_scores_gemma":[0.24830747,0.001177347,0.74308944,0.00037040722,0.00020417784,0.00019339171,0.00008445437,0.000044572156,0.0065287203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992162,0.0002457463,0.000055674707,0.00011738034,0.00031572598,0.000049286406],"domain_scores_gemma":[0.999569,0.00020590448,0.00005669386,0.000044449098,0.000095597716,0.000028381679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015307808,0.00047718472,0.00058863795,0.0007510544,0.0006326076,0.0012485576,0.0014224119,0.00095375435,0.0023490228],"category_scores_gemma":[0.0015259678,0.00022220418,0.00087982375,0.00067291694,0.0011874025,0.0016382999,0.0008298438,0.0011104711,0.0006354201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019755907,0.00014367013,0.0004525395,0.0003621058,0.00009700703,0.0004578014,0.00042355096,0.14900455,0.014180332,0.5977007,0.0026912566,0.2342889],"study_design_scores_gemma":[0.000041189047,0.00017698345,0.00013716477,0.000063012056,0.00004245853,0.00029501755,0.000060159215,0.80878705,0.0044276724,0.16700584,0.018925395,0.000038134353],"about_ca_topic_score_codex":0.0018830729,"about_ca_topic_score_gemma":0.001699388,"teacher_disagreement_score":0.0023490228,"about_ca_system_score_codex":0.0009611983,"about_ca_system_score_gemma":0.00095020793,"threshold_uncertainty_score":0.008095622},"labels":[],"label_agreement":null},{"id":"W1894428291","doi":"10.1109/vetecs.2006.1682879","title":"CAT: Contention Aware Transport Protocol for IEEE 802.11 MANETs","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Academy of Chinese Medical Sciences; Scottish Rite Charitable Foundation of Canada","keywords":"Computer network; Computer science; Network packet; Network congestion; Acknowledgement; Mobile ad hoc network; IEEE 802.11; TCP delayed acknowledgment; Throughput; TCP global synchronization; Wireless; Telecommunications","score_opus":0.02329857838601893,"score_gpt":0.2750049321724522,"score_spread":0.25170635378643325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894428291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009766782,0.0060847765,0.9670688,0.0008907333,0.0019102534,0.0007033897,0.0003662199,0.0053598634,0.007849083],"genre_scores_gemma":[0.469392,0.009967386,0.49069887,0.0016240998,0.0014075935,0.0034953519,0.003260547,0.00082956353,0.019324686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991381,0.00024105565,0.000107652755,0.000079965794,0.0003555417,0.00007758834],"domain_scores_gemma":[0.9989949,0.00029288253,0.00013518821,0.00013538354,0.00036345096,0.00007819573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013285916,0.0007353055,0.0006181617,0.0010897736,0.0009418784,0.0014546515,0.0017874772,0.0010301018,0.0025937944],"category_scores_gemma":[0.0028633086,0.0002602467,0.00048134773,0.0013287384,0.0006161668,0.0018960644,0.0011978272,0.0017561803,0.0009394752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008450468,0.00027936292,0.0024517328,0.0030241834,0.000491864,0.002050234,0.0007452506,0.073757194,0.08474021,0.21456853,0.08320523,0.53384113],"study_design_scores_gemma":[0.00022600357,0.0010786311,0.0012905843,0.00035281637,0.00053434365,0.0032868746,0.0003529954,0.5474676,0.038441636,0.052975833,0.3536855,0.00030722405],"about_ca_topic_score_codex":0.0010181386,"about_ca_topic_score_gemma":0.00094258634,"teacher_disagreement_score":0.0025937944,"about_ca_system_score_codex":0.00051684567,"about_ca_system_score_gemma":0.0010084296,"threshold_uncertainty_score":0.008677065},"labels":[],"label_agreement":null},{"id":"W1894885767","doi":"10.1109/icccn.2001.956319","title":"Load-sensitive routing for mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Zone Routing Protocol; Link-state routing protocol; Routing protocol; Distributed computing; Static routing; Destination-Sequenced Distance Vector routing; Optimized Link State Routing Protocol; Interior gateway protocol; DSRFLOW; Routing (electronic design automation)","score_opus":0.016264334311541187,"score_gpt":0.23042779282135398,"score_spread":0.21416345850981278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1894885767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035169672,0.017622873,0.9615987,0.001671089,0.0014893877,0.00034472506,0.000148586,0.0019324779,0.011675237],"genre_scores_gemma":[0.23542854,0.04086294,0.69126594,0.0015296737,0.00353348,0.0013411769,0.0012109351,0.0007605201,0.02406677],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884474,0.00034800798,0.00007560288,0.00010563281,0.0005741385,0.000051869654],"domain_scores_gemma":[0.9990152,0.00043555294,0.00008738946,0.0002048808,0.00020761082,0.000049308364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000974833,0.0012636514,0.0009918795,0.0010012715,0.0008287636,0.0015331549,0.0018098112,0.0012896936,0.0033560619],"category_scores_gemma":[0.0029860851,0.00044047946,0.00042648893,0.0017770384,0.0009496196,0.0024310146,0.001162504,0.0015511084,0.002052791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014027461,0.0001233421,0.0004288205,0.0011693325,0.000123637,0.0005231998,0.0003407531,0.13734473,0.014688973,0.23169315,0.041677743,0.57174605],"study_design_scores_gemma":[0.00006257869,0.0001887908,0.00047892725,0.00022072386,0.00007743261,0.0009290837,0.00011237116,0.5100127,0.003454326,0.2863922,0.1979705,0.00010039549],"about_ca_topic_score_codex":0.00092974224,"about_ca_topic_score_gemma":0.0009443801,"teacher_disagreement_score":0.0033560619,"about_ca_system_score_codex":0.000970336,"about_ca_system_score_gemma":0.00064145675,"threshold_uncertainty_score":0.0112271905},"labels":[],"label_agreement":null},{"id":"W1895598284","doi":"10.1109/icstcc.2015.7321309","title":"Traffic control under scarce resources in wireless networks - a game-based approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Narodowym Centrum Nauki; Department of Science and Technology, Ministry of Science and Technology, India; Canadian Association for the Study of the Liver","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Routing (electronic design automation); Wireless network; Node (physics); Power control; Wireless; Power (physics); Telecommunications; Engineering","score_opus":0.01927587806713954,"score_gpt":0.22096262966610183,"score_spread":0.2016867515989623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1895598284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040755067,0.0011542451,0.9321117,0.0014699604,0.00017209843,0.00029413006,0.000064650376,0.000067173976,0.023911025],"genre_scores_gemma":[0.9227118,0.0011182303,0.06844111,0.00024722237,0.000238376,0.0003668241,0.000028726374,0.000036612593,0.006811147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981566,0.0011589534,0.000054784665,0.00015891339,0.00026378976,0.00020697078],"domain_scores_gemma":[0.99806577,0.001326687,0.00012730318,0.000059477185,0.00018935947,0.0002313276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024075005,0.0009857533,0.0014088047,0.0010016795,0.00089093787,0.0029789687,0.0020507572,0.0021465651,0.0017533554],"category_scores_gemma":[0.003280391,0.00042468173,0.0009518262,0.00081058464,0.0031100488,0.0024320972,0.0019087709,0.0015533438,0.00015955477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096882846,0.000106257045,0.00037437739,0.00012307566,0.000082869316,0.00019355839,0.00022926691,0.6517889,0.0022105768,0.33377331,0.0010412376,0.009979613],"study_design_scores_gemma":[0.000021778005,0.00005586186,0.0000738254,0.000017033299,0.000016089045,0.000028931518,0.00006176308,0.9316357,0.00015291349,0.06700206,0.00092027424,0.000013768174],"about_ca_topic_score_codex":0.0035568972,"about_ca_topic_score_gemma":0.0030388518,"teacher_disagreement_score":0.0035568972,"about_ca_system_score_codex":0.0021307403,"about_ca_system_score_gemma":0.0017193675,"threshold_uncertainty_score":0.015459716},"labels":[],"label_agreement":null},{"id":"W1912426016","doi":"10.1109/ipdps.2003.1213470","title":"A parallel ant colony optimization algorithm for all-pair routing in MANETs","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Mobile ad hoc network; Ant colony optimization algorithms; Distributed computing; Wireless ad hoc network; Routing (electronic design automation); Parallel computing; Heuristic; Load balancing (electrical power); Destination-Sequenced Distance Vector routing; Speedup; Workstation; Computer network; Routing protocol; Link-state routing protocol; Wireless; Algorithm; Network packet","score_opus":0.01471220152327829,"score_gpt":0.2504721206419687,"score_spread":0.23575991911869043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1912426016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009737219,0.00028368543,0.9857836,0.00017207999,0.000068885485,0.00010858436,0.00003931716,0.00059133413,0.0032153558],"genre_scores_gemma":[0.2166072,0.0003487936,0.7769676,0.00011951058,0.0000521886,0.00042215703,0.00014581204,0.00015143515,0.005185383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972385,0.00008903605,0.000013646831,0.00004213152,0.00010449553,0.000026785328],"domain_scores_gemma":[0.9996706,0.00016053615,0.000040661336,0.000026648762,0.00007816963,0.00002334913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005157981,0.00078792195,0.000983381,0.0005459108,0.00062034576,0.0005628198,0.0013482018,0.0007695489,0.0016865267],"category_scores_gemma":[0.001324176,0.00036743958,0.00042766973,0.0007410149,0.00046677375,0.0006503707,0.00072344043,0.000635856,0.00043700563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046741963,0.000039530794,0.0002573342,0.00005204472,0.00003583038,0.000059897102,0.000038629685,0.9318048,0.0013352189,0.006141029,0.0017146898,0.05847419],"study_design_scores_gemma":[0.000020777634,0.00001886145,0.00003159322,0.0000022020743,0.0000044049825,0.000015163986,0.000006351819,0.9965508,0.00023139446,0.0022535278,0.00086181413,0.0000030063616],"about_ca_topic_score_codex":0.0040315567,"about_ca_topic_score_gemma":0.0055249454,"teacher_disagreement_score":0.0040315567,"about_ca_system_score_codex":0.000459207,"about_ca_system_score_gemma":0.0010111597,"threshold_uncertainty_score":0.008016229},"labels":[],"label_agreement":null},{"id":"W1913042784","doi":"10.1109/glocom.2001.965946","title":"Power-aware fair infrastructure formation for wireless mobile ad hoc communications","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Base station; Wireless ad hoc network; Wireless; Mobile ad hoc network; Wireless Application Protocol; Wireless Routing Protocol; Protocol (science); Routing protocol; Node (physics); Wireless network; Routing (electronic design automation); Telecommunications; Engineering","score_opus":0.01508648584837918,"score_gpt":0.243352460767429,"score_spread":0.22826597491904982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1913042784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011893296,0.0010319656,0.9838981,0.00022030839,0.00014656609,0.00008445296,0.000014240758,0.00021676545,0.0024943377],"genre_scores_gemma":[0.76397014,0.0016784965,0.22976054,0.000121447905,0.00023297845,0.00026761828,0.000068753594,0.000056475023,0.0038435454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944943,0.0001948759,0.000020734631,0.00006194274,0.0002074643,0.00006558281],"domain_scores_gemma":[0.99893063,0.00066201657,0.00008843199,0.0001386822,0.0001279495,0.00005232212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015015568,0.0004623091,0.00040061623,0.0005319047,0.00088564114,0.00078514277,0.0012849879,0.0005142704,0.0012608718],"category_scores_gemma":[0.0044269003,0.00021091985,0.00029316955,0.0004766456,0.0011772498,0.00183245,0.0009049153,0.0006088179,0.00019266053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018936524,0.00013127548,0.0008538938,0.0002765528,0.00006706839,0.0003030146,0.00040810427,0.43433765,0.017940924,0.3433534,0.0040750285,0.19806378],"study_design_scores_gemma":[0.000045632154,0.00014747304,0.00022935675,0.000020252815,0.00003286554,0.00012559531,0.00005898733,0.90324384,0.0037956727,0.0799062,0.012369636,0.000024543564],"about_ca_topic_score_codex":0.0012963853,"about_ca_topic_score_gemma":0.0016665688,"teacher_disagreement_score":0.0015015568,"about_ca_system_score_codex":0.0009560407,"about_ca_system_score_gemma":0.0010055111,"threshold_uncertainty_score":0.007941127},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008876906264831739,"score_gpt":0.20884611845597076,"score_spread":0.19996921219113903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1921603329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17769931,0.0008010192,0.8195432,0.0003860119,0.000063765045,0.00006856216,0.00010112181,0.00034991503,0.0009871016],"genre_scores_gemma":[0.9398459,0.0004644443,0.05889969,0.000039671435,0.00008227461,0.00006615555,0.00020789477,0.000024391496,0.00036944763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993272,0.00028269622,0.00003356113,0.000112679474,0.00017512226,0.00006869886],"domain_scores_gemma":[0.9950971,0.0032903028,0.00063766266,0.0004365647,0.0004103638,0.00012803425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013137138,0.00067589735,0.0006379958,0.0010861224,0.0006345834,0.00053391926,0.00075181056,0.00084204477,0.00024056234],"category_scores_gemma":[0.010751166,0.0003421321,0.00031734203,0.0011368527,0.00096527336,0.002153779,0.0009258813,0.0007252981,0.00014226626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008482095,0.00003013309,0.0063658,0.000027963088,0.000025212048,0.00006440444,0.00011364336,0.951288,0.0013493855,0.0042435382,0.00046340673,0.035943594],"study_design_scores_gemma":[0.0000035118055,0.000016039341,0.00065740285,0.0000032540463,0.000004610642,0.000025821622,0.00002096998,0.99385285,0.0004072241,0.0048172274,0.00018644283,0.000004680025],"about_ca_topic_score_codex":0.0042712367,"about_ca_topic_score_gemma":0.0028016102,"teacher_disagreement_score":0.0042712367,"about_ca_system_score_codex":0.00059109734,"about_ca_system_score_gemma":0.00035189302,"threshold_uncertainty_score":0.008492768},"labels":[],"label_agreement":null},{"id":"W1926552205","doi":"","title":"QoS multilayered multicast routing protocol for video transmission in heterogeneous wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Xcast; Source-specific multicast; Distributed computing; Wireless ad hoc network; Pragmatic General Multicast; Wireless; Telecommunications","score_opus":0.033042681174576385,"score_gpt":0.28828790504057994,"score_spread":0.25524522386600357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926552205","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10116387,0.0018996883,0.890426,0.0006909278,0.00022770368,0.00020746166,0.00023628354,0.0010188412,0.004129245],"genre_scores_gemma":[0.8676992,0.00048405782,0.12938932,0.00013632972,0.0000834676,0.00012373026,0.0003138155,0.000028168048,0.0017419228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995679,0.000114844435,0.000045367025,0.000043012154,0.00017559178,0.0000531304],"domain_scores_gemma":[0.9994635,0.00013959236,0.000086019056,0.000062602696,0.00019822297,0.00005001901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008485342,0.0003425587,0.00037554526,0.0005455153,0.0006751344,0.000648533,0.0007192725,0.00045738308,0.00087085937],"category_scores_gemma":[0.0016285309,0.00010962749,0.00028242852,0.00041285378,0.0002532515,0.0007423433,0.0008536303,0.00049284264,0.00016507551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001194596,0.0003295593,0.0073496206,0.0009024239,0.00031785728,0.0013710127,0.00092971243,0.22216852,0.14272265,0.06345202,0.01348808,0.545774],"study_design_scores_gemma":[0.000102028745,0.00036105508,0.0017339239,0.00007056152,0.00011455473,0.00060347887,0.00015340948,0.937812,0.025382433,0.016750606,0.016861755,0.000054210996],"about_ca_topic_score_codex":0.0011242212,"about_ca_topic_score_gemma":0.001200121,"teacher_disagreement_score":0.0011242212,"about_ca_system_score_codex":0.00088659266,"about_ca_system_score_gemma":0.00049558555,"threshold_uncertainty_score":0.006432712},"labels":[],"label_agreement":null},{"id":"W1940166290","doi":"10.1109/wirles.2005.1549510","title":"A Cross-Layer Design for Passive Forwarding Node Selection in Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Computer network; Computer science; Packet forwarding; Network packet; Wireless ad hoc network; Network layer; Node (physics); Overhead (engineering); Mobile ad hoc network; Routing protocol; Throughput; Optimized Link State Routing Protocol; Wireless network; Distributed computing; Wireless; Layer (electronics); Engineering; Telecommunications","score_opus":0.022606338575795366,"score_gpt":0.27704761480638046,"score_spread":0.2544412762305851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1940166290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01294871,0.0004269357,0.9846502,0.00008400195,0.00009195171,0.00012147052,0.000017407507,0.0005227883,0.0011365685],"genre_scores_gemma":[0.40930507,0.00069987174,0.5851384,0.00040763174,0.00016562268,0.00035984116,0.00014932001,0.00013634043,0.0036378296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.00028859352,0.00009371539,0.00016786651,0.00035510343,0.00008454506],"domain_scores_gemma":[0.99894804,0.00029202207,0.00012590294,0.00019838543,0.00038709893,0.000048543097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018142341,0.00062126486,0.0003337729,0.00049831637,0.00043755292,0.0008547568,0.0016018684,0.00060038955,0.0010581848],"category_scores_gemma":[0.0018739642,0.000461241,0.00042783367,0.00023975907,0.00044693117,0.0013991086,0.00069499365,0.00081512245,0.00040569017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061809755,0.00037639326,0.004357183,0.0009370116,0.00035417647,0.0006112467,0.00052392785,0.12861112,0.3620552,0.05122904,0.004436706,0.44588992],"study_design_scores_gemma":[0.00016493203,0.0017284176,0.0019828929,0.00008069144,0.00041738886,0.0014170023,0.00007372693,0.82936054,0.12673888,0.008174057,0.02977024,0.00009127194],"about_ca_topic_score_codex":0.00048596025,"about_ca_topic_score_gemma":0.00066483085,"teacher_disagreement_score":0.0018142341,"about_ca_system_score_codex":0.00043468148,"about_ca_system_score_gemma":0.00049481215,"threshold_uncertainty_score":0.009594679},"labels":[],"label_agreement":null},{"id":"W1943426223","doi":"10.1109/icccn.2000.885514","title":"Location trace aided routing in mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Wireless ad hoc network; Wireless Routing Protocol; Dynamic Source Routing; TRACE (psycholinguistics); Distributed computing; Node (physics); Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Geographic routing; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Wireless; Engineering; Telecommunications; Network packet","score_opus":0.014998119781273725,"score_gpt":0.2264057671861839,"score_spread":0.2114076474049102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1943426223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063188067,0.00482135,0.9841673,0.00028346592,0.00021268736,0.00011701236,0.000036437563,0.001191396,0.002851573],"genre_scores_gemma":[0.38802573,0.013004224,0.5870354,0.00031970753,0.0005668708,0.0003927466,0.00036864003,0.00017099814,0.010115646],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896765,0.00038990195,0.00005077209,0.000088514746,0.00044917027,0.000053968168],"domain_scores_gemma":[0.99883384,0.0005661531,0.00011275454,0.00020688241,0.00024181102,0.000038575658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010196286,0.0005904318,0.00070176437,0.0008374195,0.00044728364,0.0009531311,0.0013385619,0.0009810013,0.0013792523],"category_scores_gemma":[0.0027883374,0.0003723921,0.0002784506,0.0014622025,0.0007578517,0.0020663058,0.0009361901,0.0007966457,0.0007494479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022344524,0.00016811272,0.0010862794,0.00050640147,0.00009827892,0.00038118035,0.00023155127,0.3398267,0.019068485,0.081544064,0.007870217,0.5489953],"study_design_scores_gemma":[0.000057009158,0.00042107643,0.0003925459,0.00007199228,0.000050766834,0.0006212353,0.00009399993,0.89268184,0.007604855,0.060743254,0.03720027,0.0000612268],"about_ca_topic_score_codex":0.0010382902,"about_ca_topic_score_gemma":0.0008793318,"teacher_disagreement_score":0.0013792523,"about_ca_system_score_codex":0.0005156416,"about_ca_system_score_gemma":0.00056046527,"threshold_uncertainty_score":0.0053923726},"labels":[],"label_agreement":null},{"id":"W1963484481","doi":"10.1109/cjece.2004.1425808","title":"Perfor mance of a QoS-based multiple-route ad hoc on-demand distance vector protocol for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; National Institute of Standards and Technology; University of Calgary","keywords":"Computer network; Computer science; Quality of service; Mobile ad hoc network; Optimized Link State Routing Protocol; Backup; Ad hoc On-Demand Distance Vector Routing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Routing protocol; Distance-vector routing protocol; Wireless Routing Protocol; Wireless ad hoc network; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.00743421366381781,"score_gpt":0.2090951399277899,"score_spread":0.2016609262639721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963484481","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031223806,0.0061332975,0.94124657,0.0015110394,0.0005431388,0.00014538379,0.000021726784,0.00033609875,0.018838909],"genre_scores_gemma":[0.71096116,0.009987803,0.2624352,0.0004229471,0.00042032418,0.00017498773,0.00014856696,0.00011485227,0.015334225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925643,0.0002445731,0.000028965427,0.000058355676,0.00036766246,0.000044080778],"domain_scores_gemma":[0.9995763,0.00016432481,0.0000298217,0.000057764028,0.00014663854,0.000025214595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008616881,0.00054556906,0.00039795996,0.00037117075,0.00038420525,0.0010058782,0.000919895,0.00079039944,0.0010745975],"category_scores_gemma":[0.0017908921,0.00018783486,0.00030478934,0.00041080217,0.00048714594,0.0017025386,0.0007782095,0.00063978904,0.00035930562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002516227,0.00013033376,0.0017475324,0.0006664646,0.00015292807,0.0009002134,0.00055052614,0.13376771,0.07643514,0.18514973,0.006041056,0.5942067],"study_design_scores_gemma":[0.00006653036,0.0006631736,0.0004192971,0.00007419245,0.00011969686,0.0015793458,0.00028850455,0.85977316,0.02179227,0.036411207,0.078754604,0.00005798781],"about_ca_topic_score_codex":0.000693614,"about_ca_topic_score_gemma":0.0008528644,"teacher_disagreement_score":0.0010745975,"about_ca_system_score_codex":0.00035785552,"about_ca_system_score_gemma":0.00035751998,"threshold_uncertainty_score":0.0045571327},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01790155695241124,"score_gpt":0.2352750917105086,"score_spread":0.21737353475809734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963519131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05939256,0.0023503546,0.93407196,0.00032992326,0.0001127985,0.00006609653,0.000052529467,0.000956618,0.0026671232],"genre_scores_gemma":[0.80917686,0.0017042182,0.18587483,0.00010720575,0.00017784588,0.00011835684,0.00017759943,0.00011437935,0.0025487335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913305,0.0002925512,0.00007182031,0.00011434246,0.00032277327,0.00006552973],"domain_scores_gemma":[0.99809533,0.0008689851,0.0004623877,0.00034926392,0.00016259376,0.000061375205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012363406,0.0005446865,0.0007210562,0.00076448097,0.00038684,0.00085896405,0.0013868978,0.0009091348,0.0005292194],"category_scores_gemma":[0.004042798,0.00038488657,0.00037511034,0.0007540459,0.0010346564,0.0016461908,0.0012153832,0.0005814917,0.00037644242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016824318,0.000037263657,0.0006229354,0.00017523862,0.0000575441,0.00050029735,0.00016421972,0.8519275,0.02910223,0.033105444,0.0011819213,0.08295717],"study_design_scores_gemma":[0.000032266667,0.00014577311,0.00029454334,0.000016835129,0.000027593722,0.0002563578,0.000029919585,0.97072697,0.0057526226,0.019220915,0.0034725768,0.000023657236],"about_ca_topic_score_codex":0.00057792536,"about_ca_topic_score_gemma":0.00033875863,"teacher_disagreement_score":0.0013868978,"about_ca_system_score_codex":0.0004018647,"about_ca_system_score_gemma":0.00027381408,"threshold_uncertainty_score":0.0065384507},"labels":[],"label_agreement":null},{"id":"W1964328281","doi":"10.1117/12.603274","title":"A network-centric input-output feedback linearization-based control strategy for unmanned systems","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Linearization; Control theory (sociology); Feedback linearization; Distributed computing; Control system; Control engineering; Resource allocation; Nonlinear system; Bandwidth (computing); Control (management); Engineering; Computer network","score_opus":0.012269432487819395,"score_gpt":0.22117952861396722,"score_spread":0.20891009612614783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964328281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010061436,0.00021009486,0.9830277,0.00014192525,0.00005997893,0.00007915301,0.000015186817,0.00026954216,0.006134809],"genre_scores_gemma":[0.91941893,0.00032791126,0.0732427,0.00022133271,0.000070943446,0.00022052259,0.000046827925,0.000021681186,0.00642917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972755,0.00004965475,0.000015094302,0.0000771025,0.000094948104,0.00003561389],"domain_scores_gemma":[0.99984336,0.000029249502,0.000057219488,0.000011795595,0.00004666601,0.000011639853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040219777,0.0008436217,0.00041887074,0.0003056227,0.00038814178,0.0006525562,0.0007489517,0.0005544696,0.0013963033],"category_scores_gemma":[0.00035516595,0.00019810333,0.0004105181,0.000224822,0.0007233405,0.0005942275,0.00096357346,0.0006584392,0.00032757618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010211149,0.00011420991,0.0003212739,0.00034598602,0.00006559562,0.00033531478,0.00038329494,0.82251817,0.05713293,0.027470307,0.0022722473,0.08893848],"study_design_scores_gemma":[0.000020115347,0.00031032984,0.00022847505,0.000020888563,0.000018733372,0.00005716765,0.000034553013,0.98811626,0.006436064,0.0027436416,0.0019956124,0.000018240227],"about_ca_topic_score_codex":0.0037070028,"about_ca_topic_score_gemma":0.0030810619,"teacher_disagreement_score":0.0037070028,"about_ca_system_score_codex":0.00060575665,"about_ca_system_score_gemma":0.00079016935,"threshold_uncertainty_score":0.0073708296},"labels":[],"label_agreement":null},{"id":"W1964389477","doi":"10.1155/2011/402308","title":"Optimal Hidden Node Area for Enhancing Routing Protocol Performance in IEEE 802.11 Multihop MANETs","year":2011,"lang":"en","type":"article","venue":"Journal of Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Hop (telecommunications); Computer science; Network packet; Routing protocol; Node (physics); Hidden node problem; Spread spectrum; Routing Information Protocol; Metrics; IEEE 802.11; Dynamic Source Routing; Wireless; Wireless network; Engineering; Telecommunications; Channel (broadcasting)","score_opus":0.014644311398004857,"score_gpt":0.21572504184287566,"score_spread":0.20108073044487082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964389477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2742163,0.0018682431,0.71888953,0.00040534695,0.0000962373,0.000039154842,0.000025868838,0.00034189085,0.0041173534],"genre_scores_gemma":[0.9717762,0.0004747492,0.027330715,0.000026744823,0.000022741782,0.000014411868,0.0000067455326,0.000018746636,0.0003289878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926966,0.00028614167,0.00003339112,0.00006462311,0.00024174679,0.000104528066],"domain_scores_gemma":[0.9978103,0.0015056019,0.00030102217,0.00016671034,0.00016066554,0.00005558959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013881531,0.000634328,0.00047924992,0.0005963703,0.0004145488,0.0009496174,0.0006377101,0.0005945049,0.0004940249],"category_scores_gemma":[0.006799193,0.0003606514,0.0002787226,0.0005746703,0.0010283721,0.0018032101,0.0009456853,0.0005525247,0.0001092369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012659392,0.00008974816,0.0011147093,0.00009601677,0.000035545694,0.00014394551,0.00010029447,0.9244303,0.022238266,0.02892731,0.00026439826,0.022432897],"study_design_scores_gemma":[0.000010826564,0.00014504362,0.00026816342,0.000014331476,0.00002222766,0.00006611682,0.000035329293,0.9845558,0.0051437463,0.009436337,0.000287727,0.000014301276],"about_ca_topic_score_codex":0.00076421554,"about_ca_topic_score_gemma":0.001286406,"teacher_disagreement_score":0.0013881531,"about_ca_system_score_codex":0.00072884146,"about_ca_system_score_gemma":0.0008642124,"threshold_uncertainty_score":0.0073413253},"labels":[],"label_agreement":null},{"id":"W1964519784","doi":"10.1007/s11036-009-0164-7","title":"A Secure Mechanism Design-Based and Game Theoretical Model for MANETs","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Node (physics); Computer science; Computer network; Certificate; Mobile ad hoc network; Resource (disambiguation); Computer security; Network packet; Theoretical computer science; Engineering","score_opus":0.009563666881161288,"score_gpt":0.23606371586604605,"score_spread":0.22650004898488477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964519784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007418309,0.00019669668,0.9793584,0.0014955855,0.00009561049,0.00021702085,0.00014425263,0.00011209128,0.010961966],"genre_scores_gemma":[0.722338,0.0010400391,0.2514281,0.00070652645,0.00030896292,0.0010424993,0.00020107985,0.000077315126,0.022857372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637693,0.0018118566,0.00018267821,0.0003905622,0.00089591934,0.00034199323],"domain_scores_gemma":[0.995998,0.002405753,0.00035779353,0.00059470034,0.00039617208,0.0002476112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038146954,0.0011769964,0.0013568063,0.0011741929,0.0013550757,0.004399618,0.003696776,0.0036346205,0.005144109],"category_scores_gemma":[0.007770228,0.00092065614,0.0015376433,0.0016731826,0.004029549,0.0066464,0.0029019807,0.0043455083,0.001136667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003386255,0.00003827284,0.000077128636,0.000052511507,0.000019646346,0.000091858536,0.00009632569,0.06228378,0.00056113134,0.93281454,0.00082658103,0.0031044583],"study_design_scores_gemma":[0.00007451803,0.00007862248,0.00004307236,0.0000230395,0.000028640354,0.00013552047,0.000043874916,0.31520936,0.00036503567,0.67956626,0.0044058487,0.000026131313],"about_ca_topic_score_codex":0.0018088613,"about_ca_topic_score_gemma":0.0012012967,"teacher_disagreement_score":0.005144109,"about_ca_system_score_codex":0.002748099,"about_ca_system_score_gemma":0.002788791,"threshold_uncertainty_score":0.020174265},"labels":[],"label_agreement":null},{"id":"W1964672542","doi":"10.1016/j.comgeo.2009.06.005","title":"Homogeneous 2-hop broadcast in 2D","year":2009,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Homogeneous; Hop (telecommunications); Range (aeronautics); Computer science; Power consumption; Mathematics; Set (abstract data type); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Power (physics); Computer network; Physics; Engineering","score_opus":0.010821408733593264,"score_gpt":0.24448745983221187,"score_spread":0.2336660510986186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964672542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11153211,0.00092530716,0.87212086,0.00050158706,0.000156407,0.000105266976,0.000624975,0.0004950427,0.013538486],"genre_scores_gemma":[0.8847884,0.0012108075,0.09797324,0.00023425814,0.0002348126,0.00017422454,0.00065457233,0.0001522477,0.014577541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918646,0.00029381554,0.000033445827,0.00013946346,0.00018931572,0.00015750183],"domain_scores_gemma":[0.99792385,0.0013971662,0.00018171225,0.00022252984,0.00015038165,0.0001244554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006670859,0.00060158415,0.0013302288,0.0011635802,0.00087646424,0.0015451235,0.001278962,0.0010948286,0.003032916],"category_scores_gemma":[0.0031377994,0.0007087343,0.00043221496,0.0018253408,0.001087389,0.0016764746,0.0020854978,0.0006937248,0.0006962715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008349746,0.00010851628,0.0011816702,0.00030684748,0.00007178475,0.00049264607,0.000454425,0.7516382,0.008906884,0.18750226,0.007190576,0.04131122],"study_design_scores_gemma":[0.00005649428,0.00004854012,0.0003360856,0.000010890081,0.000019350786,0.000103348924,0.000103225495,0.94677377,0.0014355174,0.049133115,0.0019605502,0.000019081599],"about_ca_topic_score_codex":0.0031782538,"about_ca_topic_score_gemma":0.002886235,"teacher_disagreement_score":0.0031782538,"about_ca_system_score_codex":0.00093381817,"about_ca_system_score_gemma":0.0005344842,"threshold_uncertainty_score":0.010146141},"labels":[],"label_agreement":null},{"id":"W1964883322","doi":"10.1109/wimob.2010.5644874","title":"A trust evaluation model using controlled Markov process for MANET","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Markov chain; Markov process; Process (computing); Hidden Markov model; Markov model; Trustworthiness; Data mining; Continuous-time Markov chain; Theoretical computer science; Artificial intelligence; Machine learning; Variable-order Markov model; Mathematics; Statistics; Computer security","score_opus":0.03803628974776117,"score_gpt":0.3221599359842946,"score_spread":0.2841236462365334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964883322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012316747,0.0002476265,0.984703,0.00031024803,0.000058204274,0.00006400779,0.000111723704,0.00020169039,0.0019867485],"genre_scores_gemma":[0.915739,0.00071426475,0.07669732,0.00010402163,0.00009984753,0.0003805708,0.0002546712,0.000057039448,0.005953189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983429,0.000612542,0.00009330245,0.00033267142,0.0004361039,0.0001825516],"domain_scores_gemma":[0.9962388,0.0024130878,0.00042688477,0.00014577781,0.00061580865,0.0001596345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023986835,0.00086746964,0.0012099659,0.00079821487,0.0007204494,0.0017299232,0.0019734926,0.0013224953,0.0025358493],"category_scores_gemma":[0.007840851,0.0005110133,0.0007986549,0.0010357068,0.0013270892,0.002388878,0.0010969557,0.0017369012,0.0005078967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006441829,0.000023690369,0.0005205384,0.00003825082,0.000026104553,0.0001423415,0.00008480207,0.94691217,0.0005401399,0.04503624,0.0005760413,0.00603524],"study_design_scores_gemma":[0.0000062134113,0.00001252784,0.000038177037,0.0000028360496,0.0000056657764,0.0000127155545,0.0000042630904,0.9928631,0.000059616756,0.0068280916,0.00016103803,0.000005795348],"about_ca_topic_score_codex":0.014726981,"about_ca_topic_score_gemma":0.00907963,"teacher_disagreement_score":0.014726981,"about_ca_system_score_codex":0.0020411052,"about_ca_system_score_gemma":0.0015377774,"threshold_uncertainty_score":0.02928251},"labels":[],"label_agreement":null},{"id":"W1965061176","doi":"10.1109/pimrc.2011.6140066","title":"CVI: Connected Vehicle Infrastructure for ITS","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Cluster analysis; Computer science; Overhead (engineering); Resilience (materials science); Intelligent transportation system; Computer network; Wireless sensor network; Distributed computing; Aggregate (composite); Real-time computing; Engineering; Artificial intelligence; Transport engineering","score_opus":0.023671354362393125,"score_gpt":0.22492568537186267,"score_spread":0.20125433100946954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965061176","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024581688,0.0027004564,0.84132177,0.0013724443,0.0010066609,0.0010627246,0.0023281267,0.02066594,0.10496021],"genre_scores_gemma":[0.6663746,0.0024352255,0.28808743,0.00038829434,0.00025788244,0.00096149876,0.008741594,0.00064517575,0.03210828],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945766,0.00007865432,0.000022722763,0.00007468591,0.0002688753,0.00009738055],"domain_scores_gemma":[0.9996544,0.00003415382,0.000034068853,0.00007578889,0.00014207097,0.000059554703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003338512,0.00057419395,0.00032461344,0.001120989,0.0006595926,0.0013737438,0.0015802499,0.0007051374,0.007015442],"category_scores_gemma":[0.0011757397,0.00017986499,0.00035146103,0.0014183836,0.00042530926,0.0010579379,0.0015156341,0.00069546205,0.0023417694],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028737602,0.00011458785,0.002453591,0.0006906891,0.00008626148,0.00040902643,0.00019748013,0.12828723,0.016756888,0.25835562,0.1478183,0.44454294],"study_design_scores_gemma":[0.000121256795,0.0003728671,0.0017762253,0.00015345144,0.00008484186,0.00076863443,0.00020846936,0.44052255,0.015342131,0.05027062,0.4902981,0.00008076504],"about_ca_topic_score_codex":0.0058392547,"about_ca_topic_score_gemma":0.0057516154,"teacher_disagreement_score":0.007015442,"about_ca_system_score_codex":0.0012713609,"about_ca_system_score_gemma":0.0018171907,"threshold_uncertainty_score":0.023468971},"labels":[],"label_agreement":null},{"id":"W1965195797","doi":"10.1109/vetecf.2010.5594522","title":"MYRPA: An Incentive System with Reduced Payment Receipts for Multi-hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Receipt; Computer network; Incentive; Payment; Computer science; Collusion; Network packet; Payment system; Overhead (engineering); Hop (telecommunications); Computer security; Business; Microeconomics; Economics; Industrial organization","score_opus":0.018136293224886347,"score_gpt":0.25420664491828165,"score_spread":0.2360703516933953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965195797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04120828,0.00057390035,0.9501394,0.00071394996,0.0006306988,0.0005074486,0.000120659,0.0028683827,0.0032372738],"genre_scores_gemma":[0.6570064,0.0003417521,0.33468574,0.00032857756,0.00038502135,0.00052227697,0.00017767766,0.00010430179,0.006448254],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982652,0.0005944654,0.0001808621,0.0002668883,0.00052975735,0.00016278948],"domain_scores_gemma":[0.9972645,0.0007431858,0.0004431713,0.0004828152,0.0006545145,0.00041175247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002715865,0.00041742178,0.00089852524,0.00084603915,0.0013505548,0.0010790501,0.0025515058,0.0009231054,0.0023694672],"category_scores_gemma":[0.0057390854,0.00030592558,0.0003996424,0.0007316878,0.0006945202,0.0031487755,0.0023870696,0.0012860525,0.00062670466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023890678,0.0012792082,0.0057437504,0.0010447097,0.0002341061,0.0013978347,0.00086662517,0.09004974,0.07114888,0.23057623,0.022824565,0.57244533],"study_design_scores_gemma":[0.0004087418,0.0011558895,0.0019352335,0.00007932308,0.0001422736,0.0012062961,0.00010478699,0.8781791,0.017858231,0.03301632,0.06568097,0.00023282379],"about_ca_topic_score_codex":0.00064088573,"about_ca_topic_score_gemma":0.00063508656,"teacher_disagreement_score":0.002715865,"about_ca_system_score_codex":0.0005835165,"about_ca_system_score_gemma":0.0017522749,"threshold_uncertainty_score":0.01436305},"labels":[],"label_agreement":null},{"id":"W1965599710","doi":"10.1007/s11042-011-0800-7","title":"Links organization for channel assignment in multi-radio wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Wireless mesh network; Heuristic; Particle swarm optimization; Channel (broadcasting); Interference (communication); Channel allocation schemes; Mesh networking; Distributed computing; Wireless network; Key (lock); Computer network; Wireless; Mathematical optimization; Algorithm; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.03787850148303522,"score_gpt":0.24340266795815318,"score_spread":0.20552416647511795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965599710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089315884,0.00088514603,0.8981027,0.0005151158,0.00021104455,0.00014669295,0.00014127827,0.0005127803,0.010169297],"genre_scores_gemma":[0.78998786,0.00060097006,0.20329146,0.00011535697,0.00016944771,0.00020783352,0.00021141912,0.0001370516,0.005278557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994733,0.00023729641,0.000023793395,0.0000766479,0.00008001772,0.00010885617],"domain_scores_gemma":[0.9983582,0.00080320146,0.00015656247,0.00032904634,0.00017586332,0.00017704142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007905617,0.00031266766,0.00041907307,0.00092042977,0.0015257043,0.0015534925,0.0010977822,0.000652291,0.005058851],"category_scores_gemma":[0.0036909904,0.00036618908,0.00022654839,0.0010598268,0.0007986291,0.001933995,0.0011338346,0.00078904186,0.0007723502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079796417,0.00043663316,0.0026228626,0.0003219743,0.000055930206,0.0002374606,0.00044520592,0.4079283,0.023775065,0.17984813,0.009588204,0.3739423],"study_design_scores_gemma":[0.00005821644,0.00021681211,0.0009414741,0.000036837515,0.00004643793,0.00015978492,0.00022950774,0.9055555,0.006326569,0.079903536,0.0064936103,0.000031595755],"about_ca_topic_score_codex":0.0008592943,"about_ca_topic_score_gemma":0.0022359693,"teacher_disagreement_score":0.005058851,"about_ca_system_score_codex":0.00061297533,"about_ca_system_score_gemma":0.00072911894,"threshold_uncertainty_score":0.016923547},"labels":[],"label_agreement":null},{"id":"W1965604350","doi":"10.1007/s11276-006-0799-2","title":"A rendezvous reservation protocol for energy constrained wireless infrastructure networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Rendezvous; Computer network; Quality of service; Network packet; Energy consumption; Reservation; Packet forwarding; Latency (audio); Wireless; Wireless sensor network; Distributed computing; Telecommunications","score_opus":0.01045419804266753,"score_gpt":0.24405300938538096,"score_spread":0.23359881134271343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965604350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091790214,0.0025125751,0.87961143,0.0013926593,0.000978171,0.00048192998,0.00029905484,0.0034382846,0.019495679],"genre_scores_gemma":[0.82513404,0.0009518328,0.1600307,0.00028723472,0.0002685659,0.00038636493,0.0003818387,0.00021198133,0.01234747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996569,0.00007153687,0.000028042146,0.00004407629,0.00012922056,0.00007026578],"domain_scores_gemma":[0.99921143,0.00033381482,0.000049090937,0.00018348395,0.00013864327,0.00008348292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008908202,0.00046708665,0.00068875344,0.0005915217,0.0012537284,0.0009138197,0.0016825381,0.00054702885,0.0029522101],"category_scores_gemma":[0.0018182192,0.00030252544,0.00030145238,0.0005497047,0.0008301099,0.0014105438,0.0015596814,0.0013241823,0.0005977523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002323069,0.0003786029,0.001105372,0.00047028155,0.00019251491,0.0013909546,0.0011585823,0.16612805,0.10024853,0.22735086,0.028401963,0.47085133],"study_design_scores_gemma":[0.00039726731,0.00046150354,0.0005269448,0.00004503859,0.00017321989,0.00089160295,0.00031585922,0.88702464,0.021733532,0.044987906,0.043295167,0.00014730409],"about_ca_topic_score_codex":0.0024575023,"about_ca_topic_score_gemma":0.0039264527,"teacher_disagreement_score":0.0029522101,"about_ca_system_score_codex":0.0004909697,"about_ca_system_score_gemma":0.00076215045,"threshold_uncertainty_score":0.009876132},"labels":[],"label_agreement":null},{"id":"W1965804605","doi":"10.1109/mesh.2010.11","title":"The Achievable Cell Capacity in Cellular Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Radio resource management; Wireless network; Switched mesh; Shared mesh; Wireless; Default gateway; Cellular network; Mesh networking; Telecommunications","score_opus":0.010978320879551117,"score_gpt":0.19537496362787607,"score_spread":0.18439664274832496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965804605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19080621,0.0025553384,0.78173196,0.000713311,0.000092399,0.000058609003,0.0002506989,0.0004338912,0.023357628],"genre_scores_gemma":[0.9876952,0.00060912746,0.010520032,0.000051582185,0.000032116168,0.00006204247,0.000058079764,0.000028981382,0.00094275957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986601,0.00045212044,0.000041835825,0.00008633644,0.0005217279,0.00023792581],"domain_scores_gemma":[0.99501085,0.004077449,0.00016188149,0.00029387997,0.0003601259,0.00009584678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018563935,0.000569935,0.00045215228,0.00054393295,0.0007718701,0.0015065561,0.0009367415,0.00069919095,0.0009639523],"category_scores_gemma":[0.011946264,0.0002649965,0.00021142606,0.00077968586,0.0013434452,0.0023362336,0.0012482984,0.0006777185,0.0001903928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011520458,0.000027513714,0.0010057498,0.00015443313,0.000027998905,0.0002917848,0.00027796163,0.6217994,0.009419207,0.3437081,0.0013227753,0.021849865],"study_design_scores_gemma":[0.000011387389,0.000045172812,0.00025053788,0.00003982117,0.00001451757,0.000104088314,0.00009398818,0.8437704,0.0063769133,0.14673574,0.0025404827,0.000017055705],"about_ca_topic_score_codex":0.0011841637,"about_ca_topic_score_gemma":0.0005659838,"teacher_disagreement_score":0.0018563935,"about_ca_system_score_codex":0.00095126685,"about_ca_system_score_gemma":0.00062290096,"threshold_uncertainty_score":0.0098176},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.09991202871269256,"score_gpt":0.3247099436215215,"score_spread":0.22479791490882894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965878030","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004138109,0.78797436,0.15156667,0.005823788,0.002511396,0.0003953089,0.00035316136,0.00029994117,0.04693728],"genre_scores_gemma":[0.043650534,0.88521665,0.056173045,0.00092161563,0.0032784012,0.00046808794,0.00049931736,0.000064319545,0.009728017],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989467,0.00028634944,0.00008525396,0.00014969087,0.0004311839,0.000100819176],"domain_scores_gemma":[0.9980736,0.00123442,0.00016690006,0.00013550915,0.00033503518,0.000054470558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017386854,0.0014444758,0.0014700965,0.0030854999,0.00069847866,0.0029843708,0.0024313778,0.002025209,0.003007787],"category_scores_gemma":[0.0036814217,0.0005629028,0.00083549187,0.006380913,0.0015606664,0.005352382,0.0011987985,0.0020435785,0.0014465027],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042680065,0.00013001605,0.0011597768,0.0035682474,0.000071365044,0.00021032743,0.00025643062,0.023277331,0.0005240422,0.38315195,0.040907115,0.5467008],"study_design_scores_gemma":[0.000029165483,0.00012076289,0.0012094829,0.0033331737,0.00012130239,0.0016431328,0.00049520505,0.04874328,0.0005660893,0.4081327,0.53550416,0.00010167597],"about_ca_topic_score_codex":0.0020398467,"about_ca_topic_score_gemma":0.0014358247,"teacher_disagreement_score":0.0030854999,"about_ca_system_score_codex":0.0017846691,"about_ca_system_score_gemma":0.0015477254,"threshold_uncertainty_score":0.012948751},"labels":[],"label_agreement":null},{"id":"W1966246302","doi":"10.1109/pccc.2012.6407784","title":"Secure multipath routing for AMI network in Smart Grid","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Smart grid; Multipath routing; Routing protocol; Wireless mesh network; Wireless Routing Protocol; Dynamic Source Routing; Wireless network; Wireless; Distributed computing; Routing (electronic design automation); Telecommunications; Engineering","score_opus":0.016850097687704787,"score_gpt":0.24731589899871032,"score_spread":0.23046580131100552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966246302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17072758,0.003221393,0.81517625,0.0013562067,0.00026946835,0.00022007634,0.00012734358,0.0016005421,0.007301215],"genre_scores_gemma":[0.9524647,0.00097402965,0.04469653,0.0000624202,0.000054581476,0.000074542375,0.00007142669,0.000019728457,0.0015819595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949443,0.0001676114,0.000031507367,0.000067317975,0.00016120462,0.0000779426],"domain_scores_gemma":[0.9992273,0.00028559903,0.00016970183,0.00014067219,0.00014756498,0.000029091758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056210364,0.00036316918,0.00034365006,0.0006082362,0.0006904566,0.00063225196,0.0005031471,0.00057724165,0.00090451655],"category_scores_gemma":[0.001568928,0.00016019076,0.00036838587,0.0005740919,0.00058171037,0.0014925004,0.0007342264,0.00051057443,0.00014191493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005734171,0.000088181,0.0032450438,0.00046488177,0.00015821814,0.0011953935,0.00041336322,0.60370797,0.062480476,0.16089594,0.006460024,0.16031717],"study_design_scores_gemma":[0.000040686315,0.00033685888,0.00073417433,0.000033167293,0.00008508359,0.00084313535,0.00014322744,0.92995864,0.017385291,0.039823573,0.010557873,0.000058344463],"about_ca_topic_score_codex":0.0012548072,"about_ca_topic_score_gemma":0.0011777921,"teacher_disagreement_score":0.0012548072,"about_ca_system_score_codex":0.0008395111,"about_ca_system_score_gemma":0.0007415221,"threshold_uncertainty_score":0.006091118},"labels":[],"label_agreement":null},{"id":"W1967265256","doi":"10.1109/music.2012.34","title":"Data Overhead Impact of Multipath Routing for Multicast in Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Multicast; Xcast; Protocol Independent Multicast; Multipath routing; Source-specific multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Dynamic Source Routing; Routing protocol; Routing (electronic design automation)","score_opus":0.0530648101102676,"score_gpt":0.32975652874391037,"score_spread":0.2766917186336428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967265256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7688102,0.014353964,0.19956236,0.0017576374,0.00069134997,0.00017551106,0.00034027244,0.0010635285,0.013245125],"genre_scores_gemma":[0.9876903,0.0009641311,0.010661943,0.00007562836,0.00007932787,0.000026720394,0.000052744566,0.000047563393,0.00040145437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00049749383,0.000092931376,0.000090771784,0.0008394361,0.00016750538],"domain_scores_gemma":[0.9838674,0.01332851,0.00085010263,0.0007930503,0.0010100091,0.00015094187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001640661,0.0006398784,0.0004384435,0.0009731858,0.00079834,0.0007819333,0.0005935701,0.00057098415,0.0011232124],"category_scores_gemma":[0.0136477435,0.00019984723,0.00029646826,0.0010716654,0.00050536165,0.0013712713,0.00077953807,0.00046298583,0.000121392244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014609399,0.00028397547,0.010573002,0.00074631465,0.00014772218,0.0010791307,0.000279146,0.7443909,0.051782593,0.016481979,0.0024221744,0.17035216],"study_design_scores_gemma":[0.00010712289,0.0013339417,0.0052441712,0.00013844289,0.0003098563,0.0017281908,0.00019083975,0.92810833,0.043087546,0.013944624,0.0057340204,0.000072864306],"about_ca_topic_score_codex":0.00065094366,"about_ca_topic_score_gemma":0.0008142685,"teacher_disagreement_score":0.001640661,"about_ca_system_score_codex":0.0010370995,"about_ca_system_score_gemma":0.00046900802,"threshold_uncertainty_score":0.008676767},"labels":[],"label_agreement":null},{"id":"W1967272974","doi":"10.1109/mobhoc.2006.278648","title":"Analysis of Bottleneck Delay and Throughput in Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Wireless mesh network; Computer network; Order One Network Protocol; Switched mesh; Computer science; Shared mesh; Mesh networking; IEEE 802.11s; Wireless network; Bottleneck; Throughput; H.248; Distributed computing; Wireless; Default gateway; Telecommunications; Embedded system","score_opus":0.007089321756609326,"score_gpt":0.22182575775059118,"score_spread":0.21473643599398184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967272974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15301259,0.0022930175,0.83751214,0.00036677642,0.00010332133,0.00006653962,0.00019526815,0.00052697974,0.0059233145],"genre_scores_gemma":[0.9758297,0.0010546519,0.021456221,0.000047320165,0.00008054284,0.00006999164,0.00009647376,0.00008856773,0.0012765684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903166,0.00027422621,0.000037792888,0.0001341905,0.00033529903,0.00018689995],"domain_scores_gemma":[0.99524635,0.0036049967,0.00034970895,0.00019944436,0.0005189262,0.000080520585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027910979,0.0007782254,0.0007284033,0.0015467281,0.00045623715,0.0009474005,0.001251132,0.00058251515,0.001019481],"category_scores_gemma":[0.013126181,0.00050547824,0.0004125076,0.0010341697,0.00084656733,0.0023620415,0.0005989641,0.0006587294,0.00020098289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012337661,0.00004491831,0.0017150665,0.00008883069,0.00004242742,0.00011286304,0.00008843578,0.94383574,0.0051377146,0.037348207,0.0006206938,0.010841808],"study_design_scores_gemma":[0.0000023101968,0.00001310403,0.00016102723,0.000003772701,0.0000055932715,0.000015474876,0.000007767126,0.9950658,0.000606636,0.0039296485,0.00018520551,0.0000035327628],"about_ca_topic_score_codex":0.0042768577,"about_ca_topic_score_gemma":0.0015170822,"teacher_disagreement_score":0.0042768577,"about_ca_system_score_codex":0.0029422825,"about_ca_system_score_gemma":0.0009853687,"threshold_uncertainty_score":0.02134782},"labels":[],"label_agreement":null},{"id":"W1967637888","doi":"10.1142/s0219265905001320","title":"(QUASI) SPANNERS FOR MOBILE AD HOC NETWORKS","year":2005,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Spanner; Computer science; Wireless ad hoc network; Mobile ad hoc network; Class (philosophy); Post hoc; Wireless; Computer network; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.01081509108304547,"score_gpt":0.25244958032924825,"score_spread":0.2416344892462028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967637888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017402606,0.00094097655,0.9761816,0.0002960307,0.00015658418,0.00007178106,0.00014913209,0.00039142816,0.0044098436],"genre_scores_gemma":[0.28152758,0.0022387851,0.7068515,0.00033746875,0.0004798688,0.00031362884,0.00060973485,0.00017008746,0.0074714012],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995492,0.00013788331,0.000041521507,0.000102919126,0.00012212056,0.000046367524],"domain_scores_gemma":[0.9991462,0.00034282487,0.00011148958,0.00021654826,0.00011142389,0.00007158384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057646533,0.0005874441,0.00040481074,0.0007923696,0.00047878534,0.0010766755,0.00079296966,0.00057767646,0.0056328606],"category_scores_gemma":[0.0021551114,0.00025784704,0.0005558205,0.0013713177,0.0008160811,0.0036581252,0.0014720269,0.0013194035,0.001561553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009562416,0.000048926846,0.00036546183,0.00024439732,0.000033520755,0.00013476939,0.00015843018,0.068206616,0.0074109607,0.7990263,0.0046664868,0.11960846],"study_design_scores_gemma":[0.000015619731,0.00010878141,0.00015998373,0.0000213873,0.000007997386,0.00023040074,0.000047134632,0.17255141,0.001659125,0.8102813,0.014904045,0.000012932527],"about_ca_topic_score_codex":0.0002843498,"about_ca_topic_score_gemma":0.0005034661,"teacher_disagreement_score":0.0056328606,"about_ca_system_score_codex":0.00040934322,"about_ca_system_score_gemma":0.0003094489,"threshold_uncertainty_score":0.01884377},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009556968764721176,"score_gpt":0.2361285238498626,"score_spread":0.22657155508514143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967996014","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021981744,0.0003162242,0.97566015,0.00010950219,0.000029642455,0.00004355522,0.000042415693,0.00029344298,0.0015232727],"genre_scores_gemma":[0.48280174,0.00061966554,0.51429564,0.000040751147,0.000049965263,0.000115811,0.00017660417,0.00006227518,0.001837528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946505,0.00025646837,0.000025582991,0.000072838724,0.00012491168,0.00005520743],"domain_scores_gemma":[0.9994217,0.00031085798,0.000099028875,0.00008030807,0.00006644389,0.00002165395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063674775,0.0005191472,0.00064592715,0.000797211,0.0005168023,0.00052097,0.0008902607,0.0007907317,0.0010180213],"category_scores_gemma":[0.002270206,0.00043905352,0.00026023184,0.0011384359,0.00040205728,0.0009795247,0.00077775866,0.00032392284,0.00030466818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112420035,0.00003505248,0.00081470783,0.00011141738,0.00002742648,0.00017808132,0.00005349786,0.88639545,0.0076045035,0.013019963,0.0018979531,0.08974956],"study_design_scores_gemma":[0.000013039299,0.00003913064,0.00011238162,0.0000059681297,0.000005964522,0.00006688819,0.000025453444,0.99112344,0.0018793234,0.005548564,0.0011744769,0.000005400597],"about_ca_topic_score_codex":0.0014503925,"about_ca_topic_score_gemma":0.0018439377,"teacher_disagreement_score":0.0014503925,"about_ca_system_score_codex":0.00049783115,"about_ca_system_score_gemma":0.00044784424,"threshold_uncertainty_score":0.0036120415},"labels":[],"label_agreement":null},{"id":"W1968335870","doi":"10.1007/s11276-011-0391-2","title":"Intelligent wireless mesh path selection algorithm using fuzzy decision making","year":2011,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Concordia University","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Order One Network Protocol; Selection algorithm; Path (computing); Fuzzy logic; Channel (broadcasting); Algorithm; Wireless network; Routing (electronic design automation); Distributed computing; Wireless; Selection (genetic algorithm); Telecommunications; Machine learning; Artificial intelligence","score_opus":0.026751715617471184,"score_gpt":0.2583315686383826,"score_spread":0.23157985302091139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968335870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039313044,0.00014442991,0.9582173,0.000108318665,0.00006765369,0.00006684924,0.000031148833,0.00019544459,0.0018557712],"genre_scores_gemma":[0.7189504,0.00011551261,0.2789722,0.00007289862,0.000039682778,0.00014220411,0.000064538726,0.000022318178,0.0016202411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996044,0.00008248587,0.00003134398,0.000086879256,0.00013956093,0.00005539699],"domain_scores_gemma":[0.9992473,0.00041811887,0.00006133668,0.000031441385,0.00021040524,0.000031429066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012243213,0.0005623552,0.0008250323,0.0009831716,0.00067407714,0.0007867808,0.0010622744,0.00076116004,0.001541998],"category_scores_gemma":[0.0016653389,0.000313519,0.00056412735,0.00065281714,0.00037509034,0.0007558708,0.00045503082,0.00047999423,0.00013041105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036340643,0.00019608904,0.0022985819,0.00011727317,0.00013099748,0.00016755183,0.0001253415,0.7077657,0.009616432,0.009160495,0.0018097565,0.2682484],"study_design_scores_gemma":[0.00001818455,0.000044883403,0.00015049084,0.0000043793884,0.000020660793,0.000021372533,0.000010323143,0.99693656,0.0010978621,0.0015072488,0.00018217713,0.0000058206456],"about_ca_topic_score_codex":0.0034562815,"about_ca_topic_score_gemma":0.0032414987,"teacher_disagreement_score":0.0034562815,"about_ca_system_score_codex":0.0008435944,"about_ca_system_score_gemma":0.00077374757,"threshold_uncertainty_score":0.006872356},"labels":[],"label_agreement":null},{"id":"W1968399767","doi":"10.1145/1185373.1185402","title":"Optimal placement of relay infrastructure in heterogeneous wireless mesh networks by Bender's decomposition","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Decomposition; Relay; Wireless mesh network; Computer science; Wireless; Computer network; Wireless network; Distributed computing; Telecommunications; Chemistry; Physics","score_opus":0.003694554311665332,"score_gpt":0.21477933797527277,"score_spread":0.21108478366360744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968399767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028931271,0.0003792784,0.9656592,0.00024690523,0.000031791984,0.000057037,0.00012873027,0.00012858867,0.0044372384],"genre_scores_gemma":[0.6423681,0.0011495817,0.34710696,0.00014993428,0.00007514218,0.00031577583,0.00044949498,0.00020157151,0.008183387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966526,0.00016442708,0.000011646096,0.000048911774,0.00004561388,0.00006410468],"domain_scores_gemma":[0.9995359,0.00029034144,0.000065229244,0.000022143135,0.000050090515,0.00003642721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012039916,0.0011500973,0.0009490747,0.00079486106,0.0003843824,0.0009375745,0.0009066737,0.001048645,0.002629772],"category_scores_gemma":[0.0022675972,0.00080688094,0.0007067544,0.0007146659,0.00072961283,0.001269859,0.0009245574,0.00076173985,0.00041126096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003891343,0.000016201728,0.00019448888,0.000024740048,0.000013291535,0.000027239343,0.000017963013,0.97850114,0.00065713306,0.013250782,0.00066530186,0.0065928837],"study_design_scores_gemma":[0.000007798714,0.000014821462,0.00005442607,0.0000041846865,0.000004165697,0.0000064532933,0.000013130612,0.9892174,0.00009628304,0.010312113,0.00026584018,0.0000034086731],"about_ca_topic_score_codex":0.0038078628,"about_ca_topic_score_gemma":0.0032735595,"teacher_disagreement_score":0.0038078628,"about_ca_system_score_codex":0.0013074769,"about_ca_system_score_gemma":0.000811022,"threshold_uncertainty_score":0.009486437},"labels":[],"label_agreement":null},{"id":"W1968750272","doi":"10.1109/vtcfall.2012.6399163","title":"TIEGeR: An Energy-Efficient Multi-Parameter Geographic Routing Algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Static routing; Dynamic Source Routing; Link-state routing protocol; Computer science; Equal-cost multi-path routing; Destination-Sequenced Distance Vector routing; Multipath routing; Geographic routing; Policy-based routing; Computer network; Distributed computing; Routing Information Protocol; Routing (electronic design automation); Routing protocol","score_opus":0.017935409272496452,"score_gpt":0.24478054100880206,"score_spread":0.2268451317363056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968750272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014008173,0.00045322743,0.97813433,0.0002420005,0.00010354286,0.00013533361,0.00012308209,0.0034964916,0.00330388],"genre_scores_gemma":[0.31884712,0.00064824143,0.6712743,0.00025814233,0.00006689492,0.00041390804,0.00058900105,0.000309877,0.0075926506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997825,0.000051902956,0.0000109931125,0.00003538509,0.000083807194,0.000035482917],"domain_scores_gemma":[0.99975663,0.000078217075,0.000042004758,0.000044220345,0.000052041334,0.000026837908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039644612,0.0005977357,0.000811746,0.0009268717,0.0005875239,0.000786834,0.0018234678,0.0008843084,0.002256317],"category_scores_gemma":[0.0013082749,0.00026472527,0.00042030987,0.0009063058,0.0003663885,0.0016856149,0.0016546557,0.0006826359,0.00075227174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031016063,0.00013948046,0.0013821446,0.00019257091,0.00008563985,0.0002872189,0.00021764995,0.48810366,0.011673382,0.025094427,0.014434209,0.45807955],"study_design_scores_gemma":[0.00008097734,0.00015613167,0.0002452689,0.000014588179,0.000022539003,0.00021619817,0.000052420746,0.97223526,0.0029454336,0.010378077,0.013619437,0.000033759305],"about_ca_topic_score_codex":0.001879284,"about_ca_topic_score_gemma":0.002708665,"teacher_disagreement_score":0.002256317,"about_ca_system_score_codex":0.00043869266,"about_ca_system_score_gemma":0.0007731546,"threshold_uncertainty_score":0.007548094},"labels":[],"label_agreement":null},{"id":"W1968979245","doi":"10.1109/milcom.2013.229","title":"Efficient Broadcasting in Tactical Networks: The Impact of Local Topology Information Accuracy","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Multicast; Computer science; Computer network; Broadcasting (networking); Flooding (psychology); Network topology; Network packet; Probabilistic logic; Distributed computing; Quality of service; Topology (electrical circuits); Multimedia Broadcast Multicast Service; Engineering","score_opus":0.009344962888489971,"score_gpt":0.26370708831832784,"score_spread":0.2543621254298379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968979245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7472157,0.005581744,0.23846187,0.0010954178,0.00007468614,0.000099035766,0.00013949577,0.00058436376,0.0067477915],"genre_scores_gemma":[0.9813781,0.0011639296,0.016880404,0.000036223617,0.00003280133,0.00001813048,0.000060564005,0.000034621593,0.0003952325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977544,0.00095535116,0.00007727559,0.00015981516,0.00076160044,0.00029150018],"domain_scores_gemma":[0.982268,0.014468623,0.0009667722,0.0014180475,0.0007416353,0.00013685304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030377225,0.00053728995,0.0007316118,0.00069557043,0.0005916576,0.00086418,0.0008260892,0.0007459966,0.0005605237],"category_scores_gemma":[0.021462323,0.00025036762,0.00018775213,0.0008769304,0.000717907,0.0029879755,0.0008858176,0.00060273113,0.00015402153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005621429,0.00015411148,0.0074122795,0.00037759062,0.000090449066,0.0002426265,0.00033266275,0.82798356,0.037677556,0.008465384,0.000912254,0.115789406],"study_design_scores_gemma":[0.000052364983,0.00063157146,0.004919972,0.00004269497,0.00008538722,0.00046046503,0.00024035799,0.95011747,0.03484154,0.006896445,0.0016767832,0.00003504792],"about_ca_topic_score_codex":0.0027715282,"about_ca_topic_score_gemma":0.0030183971,"teacher_disagreement_score":0.0030377225,"about_ca_system_score_codex":0.0007136977,"about_ca_system_score_gemma":0.0005836964,"threshold_uncertainty_score":0.01606518},"labels":[],"label_agreement":null},{"id":"W1970430051","doi":"10.1002/wcm.1016","title":"An efficient mesh‐based multicast routing protocol in mobile<i>ad hoc</i>networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Source-specific multicast; Xcast; Reliable multicast; Pragmatic General Multicast; Wireless mesh network; Wireless network; Wireless; Operating system","score_opus":0.014713151009110961,"score_gpt":0.29963104117183675,"score_spread":0.2849178901627258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970430051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12601598,0.0011260397,0.8672164,0.00035401288,0.00016615138,0.00013048139,0.00008459904,0.001080827,0.0038254878],"genre_scores_gemma":[0.80256504,0.0003909295,0.19451602,0.00009342004,0.0000737971,0.00011804547,0.00022504796,0.000041711195,0.0019759983],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997242,0.00011517753,0.000018300503,0.000029855995,0.00008402454,0.000028361192],"domain_scores_gemma":[0.9996518,0.00011576184,0.00005395751,0.000047646405,0.00010476458,0.000026038206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004944229,0.00022633336,0.00028680076,0.0005345163,0.00037575228,0.0005101862,0.0007992949,0.00042434142,0.0005213646],"category_scores_gemma":[0.0009783789,0.00012506972,0.00023025059,0.00039241437,0.00027133382,0.00072980684,0.00057984825,0.0003405308,0.00018056075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007983967,0.0002106222,0.0030768814,0.00030324562,0.00016764391,0.0006781729,0.0003646239,0.3048075,0.19271478,0.079829544,0.012219786,0.4048288],"study_design_scores_gemma":[0.0000674582,0.0004990641,0.00071031763,0.000022284401,0.000074017786,0.00031694685,0.000065814835,0.9462508,0.028767046,0.011328194,0.011865292,0.000032769603],"about_ca_topic_score_codex":0.0005972457,"about_ca_topic_score_gemma":0.00070893264,"teacher_disagreement_score":0.0007992949,"about_ca_system_score_codex":0.00035909793,"about_ca_system_score_gemma":0.00033346628,"threshold_uncertainty_score":0.0026147962},"labels":[],"label_agreement":null},{"id":"W1970955949","doi":"10.1109/wimob.2013.6673390","title":"Assigning and scheduling partially overlapping channels in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless mesh network; Scheduling (production processes); Exploit; Computer network; Throughput; Channel (broadcasting); Mesh networking; Wireless; Wireless network; Channel allocation schemes; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.013914641370660624,"score_gpt":0.2251417378696289,"score_spread":0.2112270964989683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970955949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2474342,0.0009506215,0.74952954,0.00019464854,0.000059452723,0.000070477334,0.00004198981,0.00023811364,0.001480982],"genre_scores_gemma":[0.90475464,0.0004441096,0.094126925,0.0000317145,0.00004249308,0.00007814011,0.000034610468,0.000026055932,0.00046126128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908006,0.0005634829,0.000044152046,0.00007377552,0.00011572918,0.00012270002],"domain_scores_gemma":[0.9976546,0.0016585486,0.0002817409,0.00020653415,0.000107905085,0.000090698275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012871223,0.00038820022,0.00054730324,0.0004571152,0.00067434536,0.00053183857,0.00060027716,0.00039940554,0.0003490747],"category_scores_gemma":[0.0048643462,0.00038466539,0.00024860527,0.0006436758,0.00085348234,0.0010580367,0.00095029257,0.00030755508,0.00006873599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018574818,0.000036387555,0.0013451885,0.00009686992,0.000031420608,0.00009318678,0.00012839581,0.92814213,0.0077823144,0.010652587,0.00040826836,0.051097456],"study_design_scores_gemma":[0.00001351367,0.0000616566,0.000256841,0.000007604181,0.000011869811,0.000032625438,0.000045996698,0.9875229,0.0018188795,0.009637779,0.00058170955,0.000008697234],"about_ca_topic_score_codex":0.0015066435,"about_ca_topic_score_gemma":0.0015034819,"teacher_disagreement_score":0.0015066435,"about_ca_system_score_codex":0.00038663208,"about_ca_system_score_gemma":0.0005856178,"threshold_uncertainty_score":0.0068070292},"labels":[],"label_agreement":null},{"id":"W1971091905","doi":"10.1109/ccece.2012.6334846","title":"Interference measurements in an 802.11n Wireless Mesh Network testbed","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Mesh networking; MIMO; Switched mesh; Shared mesh; Wireless network; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.053626168074472645,"score_gpt":0.27401409682269345,"score_spread":0.2203879287482208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971091905","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9444287,0.00022622714,0.04834138,0.00017010626,0.000116631134,0.00017798411,0.00036263285,0.0009558296,0.005220576],"genre_scores_gemma":[0.9839336,0.0001247377,0.014428726,0.000056419834,0.0000129403525,0.00014442086,0.0004981479,0.000032853834,0.0007681074],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999014,0.00019224842,0.00007131348,0.00012707365,0.00042027736,0.00017501396],"domain_scores_gemma":[0.99891376,0.00025708214,0.00019050106,0.00013438327,0.00038360804,0.00012070037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010146647,0.0004981969,0.0004640478,0.0005199676,0.00065821956,0.00039378743,0.0009511694,0.00042313163,0.0005845872],"category_scores_gemma":[0.0015308674,0.00012153645,0.00013828005,0.00066959835,0.00038147677,0.0005078561,0.0004564534,0.0004569255,0.00015721124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015872158,0.0018435006,0.028186757,0.00048318008,0.00014067968,0.0018201389,0.0006494326,0.17004076,0.7076168,0.005264406,0.0064912327,0.07587589],"study_design_scores_gemma":[0.00024215819,0.0059297765,0.040955387,0.000048172067,0.00009426084,0.000937493,0.0005522446,0.46854535,0.46912023,0.0014438967,0.012031973,0.00009910005],"about_ca_topic_score_codex":0.0017498187,"about_ca_topic_score_gemma":0.0013655871,"teacher_disagreement_score":0.0017498187,"about_ca_system_score_codex":0.00079960615,"about_ca_system_score_gemma":0.0002985092,"threshold_uncertainty_score":0.005801618},"labels":[],"label_agreement":null},{"id":"W1971576216","doi":"10.1016/j.simpat.2013.04.005","title":"LEADMesh: Design and analysis of an efficient leader election protocol for wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Simulation Modelling Practice and Theory","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Order One Network Protocol; Leader election; Distributed computing; Wireless network; Wireless ad hoc network; Mesh networking; Node (physics); Correctness; Protocol (science); Wireless; Engineering; Algorithm; Telecommunications","score_opus":0.04293920616415737,"score_gpt":0.32204641139881507,"score_spread":0.2791072052346577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971576216","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020736014,0.0002798916,0.97571814,0.00015496551,0.00004023923,0.00012524548,0.000055278,0.0005598668,0.0023303302],"genre_scores_gemma":[0.7361325,0.00062674325,0.25776124,0.00009748114,0.000050284772,0.0004134875,0.00017853972,0.00025604997,0.004483735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992337,0.00025896574,0.00002495267,0.00007524175,0.00032571075,0.00008153507],"domain_scores_gemma":[0.99877435,0.0007924857,0.0000892329,0.000092094255,0.00021654778,0.000035295914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015218585,0.00055706897,0.0006735403,0.00058400445,0.00050446886,0.0009790988,0.001429516,0.0006761266,0.002592049],"category_scores_gemma":[0.004470011,0.00047567926,0.00042161046,0.00046715632,0.00062954193,0.0011502003,0.0008323491,0.0006756915,0.00039345777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009457335,0.000045920347,0.0005771733,0.00010848587,0.000033405468,0.00006401076,0.000074225885,0.93438137,0.00577423,0.028147254,0.0014303131,0.029269094],"study_design_scores_gemma":[0.000008054876,0.0000252053,0.000032504337,0.000002573737,0.0000059728745,0.000014231857,0.0000068438208,0.99602914,0.0010317963,0.002297372,0.00054318464,0.0000031740276],"about_ca_topic_score_codex":0.0020345624,"about_ca_topic_score_gemma":0.0023023952,"teacher_disagreement_score":0.002592049,"about_ca_system_score_codex":0.0011138358,"about_ca_system_score_gemma":0.0015686107,"threshold_uncertainty_score":0.008671284},"labels":[],"label_agreement":null},{"id":"W1971600804","doi":"10.1016/j.procs.2014.05.462","title":"Implementation of A3ACKs Intrusion Detection System under Various Mobility Speeds","year":2014,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"King Fahd University of Petroleum and Minerals; Acadia University","keywords":"Computer science; Intrusion detection system; Intrusion; Real-time computing; Computer security","score_opus":0.008381639985172057,"score_gpt":0.24689474044692405,"score_spread":0.238513100461752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971600804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85534817,0.00026223666,0.12600863,0.00018470178,0.00021002174,0.00040680263,0.00017260782,0.014546408,0.0028604376],"genre_scores_gemma":[0.9677432,0.000072156654,0.031020517,0.00004940118,0.000007942681,0.000102287464,0.00019791196,0.00004009262,0.0007664649],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992893,0.00013269446,0.000098046025,0.00016046879,0.00019718093,0.00012240079],"domain_scores_gemma":[0.99874383,0.00025363278,0.0001827263,0.000232804,0.0004391351,0.00014795213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079758145,0.00058333937,0.0005597333,0.0005555284,0.00037831822,0.00041073575,0.0011528521,0.0004041242,0.0008412801],"category_scores_gemma":[0.0020348073,0.00021786845,0.00025400645,0.00026713748,0.0002905869,0.00083206914,0.0004418719,0.00038815435,0.0001856078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044105942,0.0018977184,0.05909119,0.00080650457,0.0006135077,0.0020256427,0.0014301034,0.12042021,0.4449395,0.0065431744,0.008224134,0.34959763],"study_design_scores_gemma":[0.00031240605,0.0024199197,0.010945013,0.00003472529,0.00021659018,0.0007234153,0.00017779287,0.71662265,0.2628385,0.0008272633,0.004795601,0.00008610926],"about_ca_topic_score_codex":0.0012713223,"about_ca_topic_score_gemma":0.0006241885,"teacher_disagreement_score":0.0012713223,"about_ca_system_score_codex":0.00034979705,"about_ca_system_score_gemma":0.000513896,"threshold_uncertainty_score":0.0042181015},"labels":[],"label_agreement":null},{"id":"W1972421518","doi":"10.1007/s11276-014-0774-2","title":"Bandwidth-aware routing and admission control for efficient video streaming over MANETs","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Computer network; Bandwidth (computing); Quality of service; Admission control; Backup; Multipath routing; Handover; Video quality; Real-time computing; Distributed computing; Routing (electronic design automation); Routing protocol; Dynamic Source Routing","score_opus":0.00611654782247942,"score_gpt":0.22078866884170673,"score_spread":0.2146721210192273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972421518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07560525,0.0010756372,0.918958,0.00045702024,0.00026105277,0.00008789721,0.00005363465,0.00061420316,0.0028871999],"genre_scores_gemma":[0.9479708,0.00041905677,0.04910333,0.000069258254,0.0001507924,0.0000495708,0.00005203742,0.00004409154,0.0021409758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940324,0.00015299932,0.000038350492,0.00008980934,0.00019718743,0.00011847024],"domain_scores_gemma":[0.99857926,0.0008773407,0.00012464965,0.00010901945,0.00021890992,0.000090872076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100754,0.0005756242,0.0008192694,0.0008023057,0.00085079344,0.0010882242,0.0012851929,0.000612088,0.00089115516],"category_scores_gemma":[0.004292755,0.00037375538,0.00027903155,0.00076724193,0.0007419102,0.0012401732,0.0009890449,0.0011579087,0.0001474949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004310427,0.00023445222,0.0008479203,0.00010459024,0.00006970908,0.00017015249,0.00021553398,0.7866314,0.02575356,0.037098017,0.0025685474,0.14587502],"study_design_scores_gemma":[0.0000062724894,0.000021715887,0.000065854685,0.0000021785822,0.0000069560956,0.00001956443,0.000016113288,0.9941393,0.0010876423,0.0043928362,0.00023619212,0.000005366321],"about_ca_topic_score_codex":0.00389567,"about_ca_topic_score_gemma":0.005049001,"teacher_disagreement_score":0.00389567,"about_ca_system_score_codex":0.0010775088,"about_ca_system_score_gemma":0.00081444194,"threshold_uncertainty_score":0.007817864},"labels":[],"label_agreement":null},{"id":"W1973843496","doi":"","title":"Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of British Columbia; University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Wireless network; Wireless; Wireless sensor network; Mobile ad hoc network; Telecommunications; Event (particle physics); Computer network; Multimedia","score_opus":0.010131191332627413,"score_gpt":0.2428241501846217,"score_spread":0.23269295885199429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973843496","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010174373,0.061824173,0.73603636,0.015920514,0.026343219,0.00096090604,0.006214222,0.009294707,0.1332314],"genre_scores_gemma":[0.10669128,0.09505509,0.4196897,0.0046514566,0.0075493217,0.0023033815,0.02249468,0.002816317,0.33874878],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99815184,0.0005924208,0.00018739597,0.00021352303,0.0007241807,0.00013057169],"domain_scores_gemma":[0.99676275,0.001100164,0.0001333391,0.00080450386,0.0008195123,0.00037969887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031316397,0.0020590473,0.0021097572,0.0010995839,0.0005268548,0.0042819153,0.0022293557,0.002069823,0.048427045],"category_scores_gemma":[0.0058478923,0.00089607784,0.0019370866,0.0009836743,0.0007848892,0.0029712573,0.0025432236,0.0040341155,0.016717067],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029312988,0.00040579273,0.0035915163,0.0010063677,0.0005006871,0.00043847,0.00038340146,0.059736136,0.0041000852,0.050545704,0.45439076,0.42460802],"study_design_scores_gemma":[0.00006156092,0.00013451166,0.0012996062,0.00038534912,0.00015398223,0.00027649477,0.00011288961,0.10662282,0.0011421341,0.02778759,0.8619666,0.000056370758],"about_ca_topic_score_codex":0.0079737585,"about_ca_topic_score_gemma":0.006722028,"teacher_disagreement_score":0.048427045,"about_ca_system_score_codex":0.0009272798,"about_ca_system_score_gemma":0.002489127,"threshold_uncertainty_score":0.16200459},"labels":[],"label_agreement":null},{"id":"W1973907029","doi":"10.1002/wcm.441","title":"MAPLE: a framework for mobility‐aware pro‐active low energy clustering in ad hoc mobile wireless networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Wireless ad hoc network; Distributed computing; Node (physics); Wireless sensor network; Overhead (engineering); Wireless; Data mining; Machine learning; Telecommunications","score_opus":0.013842662876010686,"score_gpt":0.2661954741005847,"score_spread":0.252352811224574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973907029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009949311,0.00019456394,0.9967253,0.0001113056,0.000034658304,0.00004888457,0.00003705344,0.0010316414,0.00082158967],"genre_scores_gemma":[0.11035054,0.00080680207,0.88331753,0.00016582747,0.000103990926,0.0005825388,0.00030015278,0.0002944394,0.004078274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937797,0.00021847701,0.000031858857,0.000064439446,0.00025362588,0.000053581676],"domain_scores_gemma":[0.99957913,0.00015716409,0.000039248665,0.000075458505,0.0000905629,0.000058449277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012600704,0.0006730728,0.0007220175,0.0007981395,0.0008711893,0.001643221,0.002677403,0.00139826,0.0023067521],"category_scores_gemma":[0.00228515,0.000490004,0.0007648464,0.00078990846,0.00078430976,0.0020627514,0.0025021965,0.0015954351,0.0010938273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012128746,0.00010591752,0.00057324907,0.00041207403,0.00012438724,0.00044623145,0.0004636742,0.4987869,0.00791586,0.2853738,0.018148152,0.18752843],"study_design_scores_gemma":[0.000037090416,0.000050569688,0.00012568099,0.00004401975,0.000020099103,0.00014005587,0.00006042646,0.9034207,0.002744823,0.054441877,0.038874187,0.000040418803],"about_ca_topic_score_codex":0.0018751222,"about_ca_topic_score_gemma":0.00263492,"teacher_disagreement_score":0.002677403,"about_ca_system_score_codex":0.0007088728,"about_ca_system_score_gemma":0.00093962596,"threshold_uncertainty_score":0.007716894},"labels":[],"label_agreement":null},{"id":"W1973953001","doi":"10.1016/j.comnet.2009.05.019","title":"The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Joint (building); Reuse; Computer network; Gateway (web page); Mesh networking; Default gateway; Wireless; Switched mesh; Distributed computing; Wireless network; Telecommunications; World Wide Web","score_opus":0.009909803166587164,"score_gpt":0.21106855384679976,"score_spread":0.2011587506802126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973953001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090394944,0.0022092732,0.89793754,0.0018280061,0.00021314554,0.00017233811,0.00033974266,0.00033734512,0.006567684],"genre_scores_gemma":[0.81177324,0.0022029895,0.17583062,0.0002461439,0.00049971486,0.00020916933,0.00043917866,0.00022022614,0.008578773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971522,0.0014104358,0.00013563427,0.00040609238,0.00051091757,0.0003847608],"domain_scores_gemma":[0.9912917,0.0065602087,0.0006832942,0.0007420565,0.00038983606,0.00033293825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00445447,0.0013459624,0.0028530916,0.0012110306,0.0013473211,0.002392977,0.0036357103,0.003663061,0.0036364512],"category_scores_gemma":[0.015716892,0.0019073698,0.0012903835,0.0034520372,0.0024273759,0.0061782836,0.0031377266,0.0014072325,0.0005641214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047198625,0.00014060107,0.0012119587,0.00031056366,0.00015685287,0.0003596769,0.00018342944,0.878588,0.00163549,0.051989608,0.006398453,0.058553424],"study_design_scores_gemma":[0.00011032764,0.000122044265,0.00045197376,0.00002437591,0.000076757344,0.00024305728,0.00015043603,0.92373884,0.0009147438,0.07248719,0.0016531866,0.000027195783],"about_ca_topic_score_codex":0.0033958228,"about_ca_topic_score_gemma":0.0030258521,"teacher_disagreement_score":0.00445447,"about_ca_system_score_codex":0.0012022972,"about_ca_system_score_gemma":0.00146063,"threshold_uncertainty_score":0.023557723},"labels":[],"label_agreement":null},{"id":"W1974426856","doi":"10.1109/wicom.2010.5600833","title":"Estimation of Packet Loss Rate at Wireless Link of VANET--RPLE","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Vehicular ad hoc network; Computer network; Packet loss; Network packet; Wireless ad hoc network; Transmission delay; Packet drop attack; Transmission (telecommunications); Real-time computing; Wireless; Routing protocol; Link-state routing protocol; Telecommunications","score_opus":0.0074166406445543825,"score_gpt":0.23102635716204464,"score_spread":0.22360971651749026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974426856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22240916,0.0004947616,0.7710438,0.000120684854,0.00010579358,0.00011993678,0.000577368,0.002901925,0.0022265539],"genre_scores_gemma":[0.93679726,0.0002614849,0.06008039,0.000037784313,0.000016650223,0.00012094786,0.0012330646,0.00011192805,0.0013405632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889284,0.00023831306,0.000080817845,0.0002602232,0.00041547912,0.00011228442],"domain_scores_gemma":[0.99804014,0.0005416898,0.00035525736,0.00025429786,0.0007504054,0.000058276422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010247007,0.00080799276,0.00062896265,0.0020473464,0.00027600102,0.000739077,0.0009616544,0.00057930354,0.00055042823],"category_scores_gemma":[0.0043115346,0.00032605042,0.00038197098,0.0010344663,0.0002573269,0.001401762,0.0006783301,0.0006012904,0.0004082365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006049493,0.00018577052,0.054214478,0.0003307368,0.00029138307,0.00052447326,0.00026203314,0.6306147,0.04169613,0.0035373196,0.002800578,0.26493746],"study_design_scores_gemma":[0.000008637395,0.0001352512,0.008198435,0.000010962868,0.000024903955,0.00029136217,0.000044590186,0.9715701,0.018227212,0.00069140526,0.0007620083,0.000035113277],"about_ca_topic_score_codex":0.0021184173,"about_ca_topic_score_gemma":0.0015652112,"teacher_disagreement_score":0.0021184173,"about_ca_system_score_codex":0.00048871496,"about_ca_system_score_gemma":0.0002944469,"threshold_uncertainty_score":0.0054192543},"labels":[],"label_agreement":null},{"id":"W1974698572","doi":"10.1109/glocom.2012.6504007","title":"Enabling relay-aided IP communications in 802.11p/WAVE Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; IEEE 802.11p; Software deployment; Relay; Telecommunications; Wireless; Vehicular ad hoc network; Wireless ad hoc network","score_opus":0.04889140378435274,"score_gpt":0.2763925765116612,"score_spread":0.22750117272730846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974698572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05004797,0.0008631218,0.9347008,0.00023406805,0.000090454436,0.000114638715,0.000044836135,0.0010332582,0.01287092],"genre_scores_gemma":[0.805255,0.0013149851,0.18939489,0.000107835185,0.000093112794,0.00012912584,0.00016395269,0.000048086436,0.003493057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995359,0.0001564164,0.000028325092,0.000055595414,0.00012856735,0.00009517665],"domain_scores_gemma":[0.99947697,0.00019031858,0.000058195863,0.00011872386,0.00013515235,0.000020704278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010707179,0.0004858706,0.00029035457,0.0005031154,0.00032929424,0.00092106854,0.0009822999,0.00054916163,0.0011126031],"category_scores_gemma":[0.0016959106,0.00022722615,0.00021876395,0.00038152153,0.00057031383,0.0015481153,0.001125928,0.00061906583,0.00058947224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000360103,0.00020418248,0.0029484942,0.0004545201,0.000051595118,0.0012903463,0.0006454198,0.19707586,0.102021,0.1887827,0.0067935186,0.4993723],"study_design_scores_gemma":[0.000059910435,0.0007199211,0.001153708,0.000076983844,0.00008205162,0.0014056376,0.00031256635,0.8262802,0.07742297,0.03820294,0.054212265,0.00007082162],"about_ca_topic_score_codex":0.0005955166,"about_ca_topic_score_gemma":0.0007094571,"teacher_disagreement_score":0.0011126031,"about_ca_system_score_codex":0.0002868538,"about_ca_system_score_gemma":0.00039846048,"threshold_uncertainty_score":0.00566262},"labels":[],"label_agreement":null},{"id":"W1974718755","doi":"10.1016/j.adhoc.2006.07.001","title":"Non-Euclidian geographic routing in wireless networks","year":2006,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Geographic routing; Computer science; Equal-cost multi-path routing; Link-state routing protocol; Static routing; Dynamic Source Routing; Multipath routing; Distributed computing; Computer network; Destination-Sequenced Distance Vector routing; Euclidean distance; Private Network-to-Network Interface; Routing (electronic design automation); Routing protocol; Artificial intelligence","score_opus":0.0057415191923683205,"score_gpt":0.2058473296310674,"score_spread":0.20010581043869907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974718755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012901941,0.0053304527,0.9744658,0.00043349102,0.00045866106,0.00004990001,0.0000936183,0.00036025723,0.0059059197],"genre_scores_gemma":[0.39996547,0.007998226,0.5739703,0.00026134303,0.00049054495,0.00019341607,0.000479413,0.00017215568,0.016469069],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984535,0.0006578142,0.00010432424,0.00022859381,0.00046632596,0.00008942826],"domain_scores_gemma":[0.99800915,0.00094932853,0.00024082094,0.00034229126,0.00037206264,0.00008640104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014795201,0.0004502499,0.00082663406,0.00081961456,0.00077703426,0.0016339475,0.001268446,0.00096699654,0.0014486919],"category_scores_gemma":[0.004352012,0.00035244887,0.00023726941,0.0021099036,0.0010385603,0.002972434,0.0010697983,0.00075672916,0.0007270901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032542204,0.00006096158,0.0011963431,0.00045152035,0.000058976384,0.00013041156,0.00021815803,0.2832121,0.0046578143,0.34378612,0.012231609,0.35367063],"study_design_scores_gemma":[0.000043916498,0.00020212938,0.000830883,0.0000660863,0.0000305472,0.00067679404,0.00017615402,0.6938896,0.003930625,0.24805544,0.05205038,0.00004742125],"about_ca_topic_score_codex":0.0009707355,"about_ca_topic_score_gemma":0.0014035567,"teacher_disagreement_score":0.0016339475,"about_ca_system_score_codex":0.00080001267,"about_ca_system_score_gemma":0.00089720427,"threshold_uncertainty_score":0.00782454},"labels":[],"label_agreement":null},{"id":"W1975358388","doi":"10.1109/infcomw.2011.5928774","title":"Lightweight privacy-preserving routing and incentive protocol for hybrid ad hoc wireless network","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Computer security; Node (physics); Overhead (engineering); Routing protocol; Vehicular ad hoc network; Protocol (science); Cryptography; Payment; Hash function; Routing (electronic design automation); Wireless; Telecommunications; World Wide Web","score_opus":0.033400603821031244,"score_gpt":0.2653636414735488,"score_spread":0.23196303765251755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975358388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01971319,0.00045014228,0.97704667,0.00030556312,0.00012717958,0.00015420624,0.000040107774,0.00052305136,0.0016399035],"genre_scores_gemma":[0.7551328,0.00041115703,0.239215,0.00023494812,0.00013418167,0.00049427286,0.0001769844,0.000043322943,0.004157357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985252,0.000533206,0.00012587196,0.00015405986,0.0005432299,0.00011847311],"domain_scores_gemma":[0.9986172,0.00045044278,0.0002384578,0.00033539542,0.00023179711,0.00012681015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018572154,0.0004684169,0.00066632056,0.0005390749,0.00086450856,0.0008746848,0.0018404812,0.00088818785,0.0008263788],"category_scores_gemma":[0.0020565307,0.00027805907,0.00048445177,0.0006375776,0.00069192547,0.002349424,0.0020224699,0.001016489,0.00023011102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008590736,0.00047219679,0.0026964068,0.00089706044,0.00031184996,0.0018307528,0.00089624635,0.17665306,0.09761194,0.35367697,0.010738906,0.3533556],"study_design_scores_gemma":[0.00019303325,0.00061345956,0.00060059474,0.000032748292,0.00012752187,0.0014099583,0.00011388615,0.8653491,0.016483748,0.08803497,0.026914967,0.00012601996],"about_ca_topic_score_codex":0.000308371,"about_ca_topic_score_gemma":0.00034716207,"teacher_disagreement_score":0.0018572154,"about_ca_system_score_codex":0.00054419145,"about_ca_system_score_gemma":0.00073401234,"threshold_uncertainty_score":0.009822071},"labels":[],"label_agreement":null},{"id":"W1976033174","doi":"10.1109/ccece.2008.4564534","title":"Évaluation du délai dans un réseau mobile Ad hoc multi-services","year":2008,"lang":"fr","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mobile ad hoc network; Wireless ad hoc network; Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Humanities; Vehicular ad hoc network; Telecommunications; Art; Wireless","score_opus":0.04879173138511198,"score_gpt":0.26001978037608053,"score_spread":0.21122804899096856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976033174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7957379,0.0014584548,0.1897692,0.0002620602,0.00014649794,0.00063648156,0.00022949275,0.0008921683,0.010867783],"genre_scores_gemma":[0.94775385,0.00036704738,0.048079696,0.000028783048,0.000014111814,0.00015347629,0.00015250646,0.0000703532,0.0033802239],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99584585,0.0013142186,0.0001666516,0.00032908993,0.0021565529,0.00018760693],"domain_scores_gemma":[0.99141085,0.0044580223,0.0003758618,0.000417828,0.0030739503,0.0002634419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034401272,0.00067166175,0.0006707045,0.0016158236,0.00073780114,0.0016453501,0.00072744704,0.00076372264,0.001853219],"category_scores_gemma":[0.011547967,0.0002887815,0.00039510278,0.0008622787,0.00068855326,0.0014703667,0.00073276134,0.0004977526,0.0004719554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005378212,0.0010364258,0.03561359,0.0016512682,0.00034602397,0.0010246795,0.0036783263,0.25077674,0.23483774,0.007699486,0.0019053338,0.45605227],"study_design_scores_gemma":[0.00020644724,0.00489821,0.02466974,0.00017453509,0.00029678404,0.0006089692,0.0025706918,0.7160783,0.2349833,0.0025542295,0.012760593,0.00019811904],"about_ca_topic_score_codex":0.007381339,"about_ca_topic_score_gemma":0.005836905,"teacher_disagreement_score":0.007381339,"about_ca_system_score_codex":0.0013386761,"about_ca_system_score_gemma":0.0008600385,"threshold_uncertainty_score":0.018193364},"labels":[],"label_agreement":null},{"id":"W1976241251","doi":"10.1109/tvt.2014.2320228","title":"Cross-Layer Design and Performance Analysis of Tactical Radio Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Computer network; Computer science; Network packet; Throughput; Reliability (semiconductor); Network architecture; Distributed computing; Wireless; Telecommunications","score_opus":0.011162581874851476,"score_gpt":0.23936500145793044,"score_spread":0.22820241958307896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976241251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051674582,0.0014196727,0.937664,0.00017633385,0.0000814369,0.00011970814,0.000078116966,0.0005196992,0.008266418],"genre_scores_gemma":[0.8389855,0.00159147,0.15440798,0.00019392197,0.000083074956,0.00025036777,0.00020491894,0.00017285519,0.0041099056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830234,0.000609182,0.00007625876,0.00016443436,0.00062023744,0.00022746738],"domain_scores_gemma":[0.9980921,0.0007677197,0.0002574335,0.00024067174,0.0005996015,0.00004240058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032042908,0.00097479817,0.0004454247,0.00064277527,0.00041206763,0.0015763515,0.0009512432,0.00054039265,0.0023651775],"category_scores_gemma":[0.004767777,0.00045978907,0.0005045776,0.0004556272,0.00042594384,0.0015191691,0.0007943027,0.00083431404,0.00049425446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011301562,0.000094210416,0.0018144603,0.00017927749,0.00012747667,0.00016527221,0.00011239608,0.8861518,0.0235358,0.0390528,0.0012911155,0.047362376],"study_design_scores_gemma":[0.0000042994843,0.00005599016,0.00020733407,0.000010243602,0.000021651756,0.000040705632,0.000012508735,0.9919835,0.003912536,0.0025801754,0.0011634709,0.000007609264],"about_ca_topic_score_codex":0.0018788314,"about_ca_topic_score_gemma":0.0015604768,"teacher_disagreement_score":0.0032042908,"about_ca_system_score_codex":0.0013136757,"about_ca_system_score_gemma":0.0009216658,"threshold_uncertainty_score":0.016946077},"labels":[],"label_agreement":null},{"id":"W1976535884","doi":"10.1109/wicom.2007.365","title":"Link Failure Rate and Speed of Nodes in Wireless Network","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Waypoint; Mobility model; Computer science; Wireless network; Computer network; Failure rate; Wireless; Stochastic geometry models of wireless networks; Property (philosophy); Real-time computing; Engineering; Key distribution in wireless sensor networks; Telecommunications; Reliability engineering","score_opus":0.008529485796925494,"score_gpt":0.22595290380694485,"score_spread":0.21742341801001935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976535884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6406861,0.0050972593,0.34669787,0.0010761849,0.00027856883,0.00013566246,0.00066817884,0.00066197774,0.0046982653],"genre_scores_gemma":[0.98787713,0.0017301905,0.008556617,0.000054430606,0.0000877149,0.000082338,0.00037614716,0.00005825812,0.0011771893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718505,0.00059582316,0.00018560987,0.00056343334,0.0010285854,0.00044150438],"domain_scores_gemma":[0.9756359,0.016051978,0.0033151722,0.0020902266,0.0023959973,0.0005107587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042750956,0.0007798297,0.0009359711,0.0023052425,0.0006927153,0.0011539733,0.0015718768,0.0016969418,0.0011536897],"category_scores_gemma":[0.03721587,0.000514261,0.00056304655,0.0023667926,0.0011446587,0.0042635435,0.0010394373,0.0012235122,0.00039208794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034062465,0.00012492437,0.055768754,0.00036925054,0.00023979998,0.0008110457,0.00048431134,0.84664494,0.007971139,0.034997735,0.002068719,0.05017884],"study_design_scores_gemma":[0.000039264785,0.00035267236,0.015803665,0.000078325116,0.00017710595,0.00212915,0.00025415118,0.9420607,0.0065559903,0.028966013,0.0034491625,0.00013382077],"about_ca_topic_score_codex":0.0015252852,"about_ca_topic_score_gemma":0.00082095823,"teacher_disagreement_score":0.0042750956,"about_ca_system_score_codex":0.0011021969,"about_ca_system_score_gemma":0.0005142674,"threshold_uncertainty_score":0.022609174},"labels":[],"label_agreement":null},{"id":"W1976780441","doi":"10.1016/j.adhoc.2014.11.019","title":"On the impact of interference models on channel assignment in multi-radio multi-channel wireless mesh networks","year":2014,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Interference (communication); Computer science; Wireless mesh network; Channel (broadcasting); Co-channel interference; Wireless network; Computer network; Channel allocation schemes; Wireless; Node (physics); Mesh networking; Radio resource management; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.035527973412938216,"score_gpt":0.26449047972157264,"score_spread":0.2289625063086344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976780441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25536382,0.015112549,0.67109936,0.005345283,0.0012435535,0.0001801375,0.0004989705,0.0005770649,0.050579198],"genre_scores_gemma":[0.9689859,0.004448177,0.021725032,0.00034986783,0.00044627933,0.000047874764,0.00012256208,0.00022160873,0.0036527785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959727,0.0025239857,0.000085620246,0.00021868027,0.0007229313,0.00047610447],"domain_scores_gemma":[0.9424471,0.053198226,0.0010372805,0.0011585018,0.0017638059,0.00039510577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004827627,0.0012288339,0.0012698548,0.0011876583,0.0013713548,0.0021500334,0.0018567462,0.0012714984,0.0035001491],"category_scores_gemma":[0.040269524,0.00080467795,0.0006982201,0.0017651806,0.0020218426,0.005967905,0.0019421948,0.0019965246,0.00038900654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035233813,0.00016123848,0.0009920376,0.0001186068,0.000049170412,0.00011339709,0.00008087263,0.95091546,0.0008460673,0.022554986,0.0023612278,0.021454634],"study_design_scores_gemma":[0.000014683788,0.00006469481,0.00020909526,0.000022722079,0.000038730555,0.000048788348,0.00006372637,0.98783666,0.0004313176,0.010823735,0.0004335022,0.0000123742975],"about_ca_topic_score_codex":0.007636476,"about_ca_topic_score_gemma":0.009762105,"teacher_disagreement_score":0.007636476,"about_ca_system_score_codex":0.0022557524,"about_ca_system_score_gemma":0.001010232,"threshold_uncertainty_score":0.025531292},"labels":[],"label_agreement":null},{"id":"W1977017912","doi":"10.1145/1321211.1321253","title":"A service-centric approach to access control and monitoring based on distributed trust","year":2007,"lang":"en","type":"article","venue":"Proceedings of CASCON","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Access control; Service (business); Computer security; Computer network; Distributed computing; Business","score_opus":0.016213508041266735,"score_gpt":0.25195540076801826,"score_spread":0.23574189272675153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977017912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016532621,0.00017710822,0.9954106,0.00029659536,0.000046194127,0.00006357238,0.000009089164,0.0002448192,0.002098733],"genre_scores_gemma":[0.35682255,0.0010243731,0.63339627,0.000276703,0.0002749147,0.00027168592,0.000080736325,0.00011248408,0.0077403164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959921,0.0010028812,0.00024268951,0.0005542914,0.0019260682,0.00028198745],"domain_scores_gemma":[0.9967225,0.0009986362,0.00039442602,0.0007667452,0.0008192363,0.00029838015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032953029,0.00072004815,0.0010312005,0.0013347975,0.0014215478,0.0035771907,0.0031224787,0.0018289107,0.0015940162],"category_scores_gemma":[0.004807678,0.000571524,0.00096715416,0.0012607871,0.0031678258,0.004769119,0.0025249752,0.003180749,0.0006156012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105517945,0.00016942267,0.0011139956,0.00027233103,0.00011781924,0.0004839781,0.001302843,0.09831356,0.015576409,0.74711,0.0032481384,0.13218601],"study_design_scores_gemma":[0.000044332563,0.00023730632,0.00034324772,0.00008098479,0.000101882615,0.0005886431,0.0002102935,0.67337614,0.008266013,0.27545345,0.041211203,0.00008651498],"about_ca_topic_score_codex":0.0036276404,"about_ca_topic_score_gemma":0.0031025996,"teacher_disagreement_score":0.0036276404,"about_ca_system_score_codex":0.002246235,"about_ca_system_score_gemma":0.0027167795,"threshold_uncertainty_score":0.017427444},"labels":[],"label_agreement":null},{"id":"W1977940430","doi":"10.1109/aina.2012.63","title":"A Rate Adaptive Admission Control Protocol for Multimedia Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Quality of service; Admission control; Throughput; Adaptive quality of service multi-hop routing; Routing protocol; Wireless ad hoc network; Network packet; Wireless network; Mesh networking; Network congestion; Packet loss; Distributed computing; Wireless; Wireless Routing Protocol; Telecommunications","score_opus":0.023568482294411556,"score_gpt":0.2849247837959725,"score_spread":0.261356301501561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977940430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012653559,0.003109734,0.9699509,0.0008905799,0.0007101182,0.000729178,0.00017340385,0.0028467535,0.008935703],"genre_scores_gemma":[0.6184407,0.002631722,0.363487,0.00090427155,0.0009928908,0.001393549,0.0005603423,0.00017919626,0.011410236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989011,0.00030616575,0.000075396674,0.00011321276,0.0005255629,0.00007846956],"domain_scores_gemma":[0.9991186,0.00034305875,0.00010012531,0.00013438071,0.00023669314,0.000067077184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661579,0.00050211337,0.00054539955,0.0006746202,0.0010459911,0.0008812727,0.0018835156,0.0009839423,0.0020742638],"category_scores_gemma":[0.003079681,0.00016846342,0.00040501606,0.0008788828,0.00071207166,0.0010382398,0.0010396339,0.0015406338,0.0005553505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059932575,0.00039317674,0.0011069926,0.0005817025,0.0001914364,0.0007129153,0.00048004166,0.10572202,0.073064245,0.11652671,0.022469863,0.6781515],"study_design_scores_gemma":[0.00015768483,0.0005276311,0.0007669577,0.00006212197,0.00016427116,0.0010867524,0.00007365343,0.853714,0.02415959,0.03202566,0.087119415,0.00014220893],"about_ca_topic_score_codex":0.0015896012,"about_ca_topic_score_gemma":0.0013956047,"teacher_disagreement_score":0.0020742638,"about_ca_system_score_codex":0.0006111486,"about_ca_system_score_gemma":0.00082289,"threshold_uncertainty_score":0.006939113},"labels":[],"label_agreement":null},{"id":"W1978184999","doi":"10.1109/music.2012.44","title":"Towards Global Connectivity by Joint Routing and Scheduling in Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Computer network; Wireless mesh network; Static routing; Dynamic Source Routing; Geographic routing; Policy-based routing; Link-state routing protocol; Wireless network; Wireless; Routing (electronic design automation); Routing protocol; Mathematical optimization; Telecommunications","score_opus":0.015939041876955343,"score_gpt":0.24536714218454694,"score_spread":0.2294281003075916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978184999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023370596,0.00066947885,0.97309494,0.0003144551,0.000045939883,0.00003855124,0.000018018853,0.00025060124,0.0021974111],"genre_scores_gemma":[0.70186055,0.0017189793,0.2934998,0.00015712989,0.00023092263,0.0001888867,0.00009623414,0.00015288868,0.002094657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990011,0.00055210415,0.0000391888,0.00011756343,0.00019502807,0.00009506695],"domain_scores_gemma":[0.9987288,0.00075090176,0.0001510145,0.0002259263,0.000081921906,0.00006145752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021437274,0.00078328495,0.00079114205,0.0007867047,0.000567864,0.0011954745,0.0011033624,0.0010574738,0.00088727125],"category_scores_gemma":[0.0043891035,0.00052385405,0.00054450304,0.0012113549,0.001494199,0.0034141692,0.0017710162,0.0011612677,0.00023242451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052338226,0.00002807117,0.00032951197,0.000049163275,0.000023223596,0.00003614557,0.000068427595,0.91374004,0.0019063826,0.04965643,0.00063399086,0.033476293],"study_design_scores_gemma":[0.00001424082,0.00004602985,0.00008526372,0.000009310473,0.000013642324,0.000024898707,0.000022097287,0.9574445,0.0005178717,0.040325955,0.0014892517,0.0000068438085],"about_ca_topic_score_codex":0.0009585329,"about_ca_topic_score_gemma":0.0013474218,"teacher_disagreement_score":0.0021437274,"about_ca_system_score_codex":0.00057852967,"about_ca_system_score_gemma":0.0007126935,"threshold_uncertainty_score":0.011337221},"labels":[],"label_agreement":null},{"id":"W1978199915","doi":"10.1109/ccece.2008.4564852","title":"Implementation et performances du protocole de routage DSR","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.016201500135134127,"score_gpt":0.2897174947568678,"score_spread":0.2735159946217337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978199915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28932896,0.0027090025,0.6780181,0.0009194459,0.0006139052,0.0006764082,0.0003677557,0.008617743,0.018748691],"genre_scores_gemma":[0.741017,0.0022417216,0.24475996,0.00019248102,0.00006326791,0.00037089732,0.00065739703,0.0005194136,0.010177936],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969296,0.0012171522,0.00025804355,0.00026906698,0.0011339752,0.0001922187],"domain_scores_gemma":[0.9963315,0.0014243425,0.00020507595,0.0007274506,0.0012266268,0.00008491165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038274915,0.0006104451,0.00051372533,0.0008955346,0.0005895135,0.0018617114,0.0008451287,0.0009309767,0.0024672423],"category_scores_gemma":[0.008574923,0.00037314088,0.00035036763,0.0004796199,0.0005625123,0.0019065638,0.0005837173,0.0007724922,0.0009542266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002112925,0.00070691964,0.00834759,0.0016573061,0.00040210196,0.0010880432,0.0017897608,0.29084525,0.22812252,0.061771225,0.007491749,0.39566457],"study_design_scores_gemma":[0.00044651737,0.0024334549,0.002432941,0.00016336999,0.00020704514,0.0011486954,0.0006401515,0.60126615,0.31263918,0.00455999,0.073892094,0.00017046035],"about_ca_topic_score_codex":0.003703607,"about_ca_topic_score_gemma":0.0017199223,"teacher_disagreement_score":0.0038274915,"about_ca_system_score_codex":0.0008522125,"about_ca_system_score_gemma":0.0010098092,"threshold_uncertainty_score":0.020241976},"labels":[],"label_agreement":null},{"id":"W1978768900","doi":"10.1109/chinacom.2008.4685101","title":"QoS routing and link scheduling in wireless mesh backbone","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Quality of service; Distributed computing; Scheduling (production processes); Exploit; Switched mesh; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.01784539920118559,"score_gpt":0.22846259980540684,"score_spread":0.21061720060422126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978768900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05513727,0.005838351,0.92579865,0.0013097392,0.00041576748,0.0000628177,0.00007950343,0.00031896104,0.01103895],"genre_scores_gemma":[0.8556203,0.0043774466,0.13463424,0.00020238887,0.0005600492,0.00012041842,0.00012822497,0.00007742633,0.004279419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995178,0.0002024831,0.000020333697,0.000056807916,0.00015138567,0.000051068186],"domain_scores_gemma":[0.9993512,0.00038330146,0.00008024867,0.000052059786,0.00009701185,0.000036217916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015491586,0.00025929097,0.00030195317,0.00056122406,0.00042931302,0.0009032497,0.0005881335,0.0005710296,0.000961081],"category_scores_gemma":[0.0033559436,0.0002498378,0.00019495083,0.0007534849,0.0007077499,0.0012180749,0.0005026138,0.00050555076,0.00015954838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010104937,0.0000400291,0.00082852854,0.00008686769,0.000019365023,0.00013917989,0.000108688626,0.6064493,0.0042376807,0.31002504,0.0030317083,0.07493262],"study_design_scores_gemma":[0.000010803688,0.000022980728,0.00016646169,0.000009135019,0.0000076315455,0.00003525555,0.000026935433,0.9205935,0.0008057818,0.07432711,0.0039870627,0.0000074003465],"about_ca_topic_score_codex":0.002713998,"about_ca_topic_score_gemma":0.001564686,"teacher_disagreement_score":0.002713998,"about_ca_system_score_codex":0.0010977413,"about_ca_system_score_gemma":0.00075260154,"threshold_uncertainty_score":0.008192837},"labels":[],"label_agreement":null},{"id":"W1978887885","doi":"10.1145/1641876.1641886","title":"A new local algorithm for backbone formation in ad hoc networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Unit disk graph; Scalability; Algorithm; Connected dominating set; Mobile ad hoc network; Distributed algorithm; Graph; Approximation algorithm; Distributed computing; Computer network; Wireless; Wireless network; Theoretical computer science","score_opus":0.009838630177875306,"score_gpt":0.23266424497224497,"score_spread":0.22282561479436966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978887885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033597,0.0003638829,0.9930594,0.00011275544,0.00005918776,0.00009522946,0.00002913111,0.0011047405,0.0018159527],"genre_scores_gemma":[0.108103424,0.00037302845,0.8861472,0.00022127989,0.00010168159,0.00050402107,0.00025695906,0.00026809718,0.0040243263],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886227,0.00032172247,0.00006241665,0.00025916912,0.0004018441,0.00009262267],"domain_scores_gemma":[0.99842036,0.00056818186,0.00014370149,0.0003845017,0.0003576469,0.0001256484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016492036,0.0008832524,0.0013111613,0.0015783634,0.0014155835,0.0014344457,0.003127446,0.0012962205,0.003567284],"category_scores_gemma":[0.004406037,0.0004831939,0.0007102959,0.00145865,0.0010952458,0.003628468,0.0029605958,0.0013777011,0.0017901482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002830064,0.00022024204,0.00087359117,0.0004051215,0.00010441173,0.00015098571,0.00041575334,0.282871,0.011639432,0.0515787,0.014359398,0.6370984],"study_design_scores_gemma":[0.00018226846,0.000302003,0.0001645776,0.000042273714,0.00004956865,0.00025690836,0.0000888082,0.9450286,0.007834489,0.025757384,0.02024487,0.00004826852],"about_ca_topic_score_codex":0.0013452632,"about_ca_topic_score_gemma":0.0018494115,"teacher_disagreement_score":0.003567284,"about_ca_system_score_codex":0.001024629,"about_ca_system_score_gemma":0.001207854,"threshold_uncertainty_score":0.011933744},"labels":[],"label_agreement":null},{"id":"W1979027167","doi":"10.1109/innovations.2006.301890","title":"Cross-layer Framework for Rate Allocation in Heterogeneous Wireless Multicast","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Xcast; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; IP multicast; Multicast address; Heterogeneous network; Wireless network; Wireless; Telecommunications","score_opus":0.018250244874320712,"score_gpt":0.2888081622207272,"score_spread":0.2705579173464065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979027167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012403234,0.00022023323,0.9966085,0.0001106736,0.000041511743,0.000036373902,0.000009802636,0.00016378975,0.001568727],"genre_scores_gemma":[0.20956448,0.0008002823,0.7832323,0.000265121,0.00023152704,0.0005306474,0.00007939124,0.0001797325,0.005116556],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981851,0.00082310336,0.00007804416,0.00014767757,0.0006168779,0.00014918711],"domain_scores_gemma":[0.99926335,0.0003209943,0.00007360413,0.00013751836,0.00015712582,0.000047446683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041888445,0.00094334997,0.00068860187,0.00072494044,0.0007357243,0.0017830984,0.00267015,0.0011615875,0.0026521373],"category_scores_gemma":[0.00364452,0.00048487776,0.0009887731,0.00070072047,0.0011008118,0.0020365259,0.0017569981,0.0020097634,0.0007907531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059421516,0.00009851348,0.0001995019,0.00008718294,0.000063204,0.00021496115,0.00022568915,0.430412,0.005132712,0.51768804,0.0026960792,0.04312275],"study_design_scores_gemma":[0.000021395399,0.000033298867,0.000040600637,0.00001518174,0.000019549128,0.000055351305,0.000015117218,0.9555107,0.000989042,0.037779145,0.005507844,0.000012771294],"about_ca_topic_score_codex":0.0019990935,"about_ca_topic_score_gemma":0.0019024016,"teacher_disagreement_score":0.0041888445,"about_ca_system_score_codex":0.0014078063,"about_ca_system_score_gemma":0.0013015685,"threshold_uncertainty_score":0.02215302},"labels":[],"label_agreement":null},{"id":"W1979505601","doi":"10.1109/wcnc.2014.6952782","title":"Opportunistic routing protocols in wireless networks: A performance comparison","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Forwarder; Computer science; Computer network; Routing protocol; Interior gateway protocol; Link-state routing protocol; Wireless; Dynamic Source Routing; Network packet; Geographic routing; Distributed computing; Wireless network; Telecommunications","score_opus":0.029074768601221823,"score_gpt":0.27887348512963045,"score_spread":0.24979871652840863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979505601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49852094,0.08086611,0.33582816,0.0026098688,0.0013958794,0.0010670053,0.0008588232,0.0017982934,0.07705488],"genre_scores_gemma":[0.91505396,0.016569689,0.06411634,0.00014511934,0.00029248704,0.00030727626,0.00044332384,0.00010476976,0.0029671036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574995,0.0013872352,0.00032505346,0.00026397716,0.001988355,0.00028545762],"domain_scores_gemma":[0.99250776,0.0047743907,0.00054751366,0.0005706962,0.0014331712,0.00016641215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038265716,0.0008697531,0.0007842701,0.002080311,0.00055229675,0.0018800676,0.0010610325,0.0010412306,0.0008805807],"category_scores_gemma":[0.008134298,0.00021411995,0.0003607905,0.0023482074,0.00047041394,0.0026058236,0.0010084867,0.00049722247,0.00024670566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012537877,0.00071532273,0.007882765,0.0019192109,0.00053116365,0.00039143072,0.00035252978,0.47030795,0.020187873,0.033550307,0.005935731,0.45697203],"study_design_scores_gemma":[0.00015715264,0.0027976478,0.007259734,0.00028804902,0.0004446696,0.0016771543,0.0007064987,0.920281,0.021986285,0.017128825,0.02709602,0.00017701158],"about_ca_topic_score_codex":0.0009639734,"about_ca_topic_score_gemma":0.00081139605,"teacher_disagreement_score":0.0038265716,"about_ca_system_score_codex":0.001125758,"about_ca_system_score_gemma":0.00085695746,"threshold_uncertainty_score":0.020237088},"labels":[],"label_agreement":null},{"id":"W1979606421","doi":"10.1109/pacrim.2011.6032897","title":"Replay attacks and detection in tactical MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Communications Research Centre Canada","funders":"","keywords":"Computer science; Mobile ad hoc network; Overhead (engineering); Replay attack; Computer network; Scheme (mathematics); Wireless ad hoc network; Protocol (science); Mobile radio; Telecommunications; Wireless","score_opus":0.02239472375524575,"score_gpt":0.23358617039181703,"score_spread":0.21119144663657127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979606421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19568701,0.002191867,0.79907626,0.00027904625,0.00006537137,0.00008818208,0.000045738358,0.0009977346,0.0015688576],"genre_scores_gemma":[0.97414225,0.00056542543,0.024739496,0.000045356628,0.000050488834,0.000033850887,0.000044829103,0.000031439045,0.0003467789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973673,0.0009790744,0.00015453389,0.00032572245,0.0009946544,0.00017871143],"domain_scores_gemma":[0.9860319,0.00806053,0.0029017492,0.0014489492,0.0013727708,0.00018411555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022447137,0.0009921324,0.0011212213,0.0015530178,0.00064858614,0.0014069745,0.00091556145,0.0011857236,0.00036528552],"category_scores_gemma":[0.013565665,0.00060637615,0.00040977175,0.0010047082,0.0012624261,0.0036301888,0.001377984,0.0010604211,0.00019922131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013441287,0.00020249841,0.017365666,0.00038512706,0.0004122488,0.0013797594,0.0006574139,0.70514053,0.04466761,0.016623616,0.0016036206,0.21021773],"study_design_scores_gemma":[0.0000153278,0.00038507028,0.0024508217,0.000023535898,0.00005031921,0.0010775501,0.00013972135,0.97649765,0.012383632,0.006078139,0.0008581864,0.000040071245],"about_ca_topic_score_codex":0.0005267122,"about_ca_topic_score_gemma":0.00036278545,"teacher_disagreement_score":0.0022447137,"about_ca_system_score_codex":0.0005950925,"about_ca_system_score_gemma":0.000424412,"threshold_uncertainty_score":0.011871278},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04842265875544571,"score_gpt":0.25296531883940904,"score_spread":0.20454266008396332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979634439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008080977,0.0009421257,0.98488253,0.00021817024,0.00039103293,0.00030170265,0.00013483768,0.000986383,0.004062239],"genre_scores_gemma":[0.21946988,0.0014284642,0.7663109,0.00023776868,0.00017703825,0.00047915574,0.00081282953,0.0001393233,0.010944716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992567,0.0001344213,0.00006296501,0.00013982218,0.00033783462,0.0000682294],"domain_scores_gemma":[0.99935955,0.00006290774,0.000049102615,0.0001441653,0.00033510904,0.000049142618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005472846,0.0007022738,0.0007290408,0.0012439401,0.0012592503,0.0006681656,0.0024424805,0.0010735277,0.0012410359],"category_scores_gemma":[0.0011523344,0.00024139523,0.0006254543,0.002070678,0.0003685856,0.0015441299,0.0009859308,0.0008801495,0.0011475228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034833446,0.0001825083,0.00076393737,0.00045716084,0.00015919082,0.00040875457,0.00037417462,0.18053223,0.075671874,0.057177104,0.019324223,0.66460055],"study_design_scores_gemma":[0.00009584999,0.0003368862,0.00064722385,0.00004335586,0.00007756486,0.0009824835,0.000105520696,0.8765997,0.029108878,0.0139404675,0.077911586,0.00015052108],"about_ca_topic_score_codex":0.0031497814,"about_ca_topic_score_gemma":0.0049793893,"teacher_disagreement_score":0.0031497814,"about_ca_system_score_codex":0.0010115717,"about_ca_system_score_gemma":0.0009961126,"threshold_uncertainty_score":0.0073394775},"labels":[],"label_agreement":null},{"id":"W1979724779","doi":"10.1007/s11276-013-0545-5","title":"A token circulation scheme for code assignment and cooperative transmission scheduling in CDMA-based UAV ad hoc networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Security token; Code division multiple access; Network packet; Scheduling (production processes); Schedule; Token passing; Real-time computing; Wireless; Telecommunications","score_opus":0.013939458214739981,"score_gpt":0.2369988082996166,"score_spread":0.2230593500848766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979724779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1002736,0.00042839514,0.8951176,0.00021696421,0.00021204032,0.0001719595,0.00007930271,0.0009458644,0.0025542201],"genre_scores_gemma":[0.8905792,0.00014499098,0.10593731,0.00005823257,0.00006238179,0.000103987855,0.000067256624,0.00004674734,0.0029998226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949396,0.00015779134,0.000031986558,0.00006897463,0.00012274664,0.00012456517],"domain_scores_gemma":[0.9984084,0.0006716526,0.00012419396,0.0002994872,0.0003270768,0.00016925966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010095258,0.00024869465,0.0005931428,0.0006262169,0.0011401756,0.00092635566,0.0013019411,0.00042249056,0.0017644076],"category_scores_gemma":[0.0027362888,0.00021296043,0.0001875156,0.00089246756,0.00073880376,0.0010599394,0.0009803015,0.0006697314,0.0002973577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027328664,0.00050426985,0.0021957462,0.00018349093,0.000080790196,0.00040810698,0.00055242365,0.21468316,0.116823316,0.13916521,0.009094781,0.513576],"study_design_scores_gemma":[0.00012168298,0.0002786839,0.00028350236,0.000011466494,0.000037277357,0.00013973431,0.00004375009,0.97220963,0.013992915,0.008319429,0.004522414,0.000039465067],"about_ca_topic_score_codex":0.003826279,"about_ca_topic_score_gemma":0.0052548596,"teacher_disagreement_score":0.003826279,"about_ca_system_score_codex":0.0012922684,"about_ca_system_score_gemma":0.0018904868,"threshold_uncertainty_score":0.009376168},"labels":[],"label_agreement":null},{"id":"W1980444717","doi":"10.1109/isie.2006.296035","title":"Scenarios Generator for Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Wireless ad hoc network; Distributed computing; Software deployment; Mobile ad hoc network; Vehicular ad hoc network; Mobility model; Generator (circuit theory); Network topology; Scale (ratio); Topology (electrical circuits); Computer network; Wireless; Software engineering; Telecommunications; Power (physics)","score_opus":0.009614487392077252,"score_gpt":0.21725698465549392,"score_spread":0.20764249726341666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980444717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008792745,0.00020529398,0.98121715,0.00017443474,0.000118004245,0.00029637164,0.0015699104,0.011140638,0.0043988856],"genre_scores_gemma":[0.07032383,0.00093038025,0.90279037,0.0002471701,0.00016060642,0.0027840815,0.010058746,0.0030148202,0.009689942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987508,0.00056536956,0.00012205946,0.0001493094,0.00034456613,0.0000679209],"domain_scores_gemma":[0.998417,0.00096134684,0.00008071289,0.00027045087,0.00020147926,0.0000689408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016545604,0.0017187292,0.00072891894,0.0016264553,0.0006356451,0.0019926045,0.002650527,0.0015827074,0.02534775],"category_scores_gemma":[0.0070496453,0.00086415856,0.0012326884,0.001033818,0.00060056016,0.0021400158,0.0020469616,0.0021535023,0.008886781],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027355185,0.0001373402,0.0011651693,0.0009838048,0.00014128801,0.0008600011,0.00041251874,0.1526585,0.0048224004,0.50096333,0.07946688,0.25811523],"study_design_scores_gemma":[0.00015957245,0.00006262925,0.00014863563,0.00016796877,0.000031364016,0.00044847152,0.00004904943,0.63266075,0.0041141342,0.20341344,0.15870093,0.000042969234],"about_ca_topic_score_codex":0.0006247807,"about_ca_topic_score_gemma":0.0006349661,"teacher_disagreement_score":0.02534775,"about_ca_system_score_codex":0.0006180901,"about_ca_system_score_gemma":0.0006216736,"threshold_uncertainty_score":0.08479661},"labels":[],"label_agreement":null},{"id":"W1980459816","doi":"10.1002/wcm.167","title":"A performance evaluation of a pre‐emptive on‐demand distance vector routing protocol for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless ad hoc network; Ad hoc wireless distribution service; Network packet; Destination-Sequenced Distance Vector routing; Distributed computing; Wireless Routing Protocol; Routing protocol; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.03375998156058319,"score_gpt":0.32531534007138974,"score_spread":0.29155535851080655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980459816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9689145,0.0004255915,0.02625782,0.00017073876,0.00007477015,0.0001701153,0.00007881343,0.00040273258,0.0035049675],"genre_scores_gemma":[0.9942368,0.00010629314,0.0050588674,0.000015228409,0.0000066486955,0.000027915117,0.0000984751,0.000010973122,0.00043875622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998801,0.00040646023,0.00006754719,0.00010588405,0.00048512794,0.00013405834],"domain_scores_gemma":[0.9960194,0.0022238356,0.0002943586,0.0003234605,0.0009490899,0.00018985762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020142875,0.0008116911,0.00046706817,0.00067889824,0.00038254948,0.0007801221,0.00096011354,0.0005404766,0.0008830299],"category_scores_gemma":[0.00495145,0.00020508333,0.00020088979,0.0004660586,0.00052001147,0.0010344555,0.0004007954,0.00041808508,0.00012880823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025986233,0.001310318,0.012918858,0.0004825176,0.00022717076,0.00030023023,0.00026700713,0.78523254,0.06641547,0.0048850533,0.002118753,0.12324347],"study_design_scores_gemma":[0.00008006717,0.001747889,0.0015366073,0.000005867089,0.00003283253,0.00008301003,0.00005271369,0.9843634,0.011409724,0.00035257384,0.0003221532,0.000013165044],"about_ca_topic_score_codex":0.0038602196,"about_ca_topic_score_gemma":0.0022899266,"teacher_disagreement_score":0.0038602196,"about_ca_system_score_codex":0.0012735752,"about_ca_system_score_gemma":0.00064168725,"threshold_uncertainty_score":0.010652721},"labels":[],"label_agreement":null},{"id":"W1980559443","doi":"10.1109/aina.2014.26","title":"Efficient Beacon-Less Broadcasting in MANETs","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Broadcasting (networking); Flooding (psychology); Mobile ad hoc network; Node (physics); Beacon; Wireless ad hoc network; Overhead (engineering); Simple (philosophy); Distributed computing; Telecommunications; Wireless; Network packet; Engineering","score_opus":0.012168581685197187,"score_gpt":0.2215337351745744,"score_spread":0.2093651534893772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980559443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015436761,0.0025680135,0.9772207,0.0002529366,0.00012066406,0.000104443076,0.00007114863,0.0006942824,0.003531012],"genre_scores_gemma":[0.60241234,0.00534318,0.38368618,0.00029413946,0.00031655576,0.00028999062,0.00043159304,0.00021238191,0.0070136962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990723,0.0003334003,0.00005415423,0.0001278759,0.0003307291,0.00008143325],"domain_scores_gemma":[0.9987274,0.0006831994,0.0001703498,0.00018617761,0.00017901932,0.000053771957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095045555,0.0004778352,0.0008607645,0.0008846603,0.00058477506,0.0006732845,0.0013347764,0.00072148646,0.00096398254],"category_scores_gemma":[0.0033639309,0.00044372724,0.00027023687,0.0011786484,0.0006635585,0.00135041,0.0008914558,0.0006717866,0.0006315425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064120296,0.00018800072,0.0010772324,0.0012454581,0.00008299685,0.00044507367,0.00051613624,0.39703035,0.08724312,0.15307973,0.01018453,0.34826627],"study_design_scores_gemma":[0.000120557386,0.0004911689,0.0006214632,0.00008856411,0.000055953824,0.00059078477,0.0001217997,0.87445384,0.023142064,0.07351992,0.026737614,0.00005631453],"about_ca_topic_score_codex":0.00065683684,"about_ca_topic_score_gemma":0.00066545495,"teacher_disagreement_score":0.0013347764,"about_ca_system_score_codex":0.00046181402,"about_ca_system_score_gemma":0.00043651703,"threshold_uncertainty_score":0.005026579},"labels":[],"label_agreement":null},{"id":"W1980789694","doi":"10.1145/1641913.1641929","title":"Mobility management protocols for wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Mobility management; Wireless network; Mesh networking; Wireless; Telecommunications","score_opus":0.018192631723860146,"score_gpt":0.28103131312295876,"score_spread":0.2628386813990986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980789694","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031316627,0.04676122,0.9027137,0.003674297,0.0032847677,0.0007454877,0.00058211933,0.0019342776,0.037172485],"genre_scores_gemma":[0.15165563,0.087213136,0.7070317,0.002560799,0.00444781,0.003977072,0.0031024492,0.0005542435,0.03945713],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998544,0.00047913214,0.00020065824,0.00013756177,0.0005307621,0.00010789009],"domain_scores_gemma":[0.9988431,0.00040805657,0.00017033852,0.00023638473,0.0002955779,0.000046525474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015952528,0.0010368283,0.0008718922,0.0013264524,0.001044474,0.0019569937,0.002099797,0.0015397494,0.0049625747],"category_scores_gemma":[0.004490618,0.00050258695,0.0006330829,0.0022537496,0.00081424095,0.0040195296,0.0023396593,0.0022023804,0.0036688661],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011312887,0.000104444865,0.000442061,0.0014598647,0.00013112732,0.00045369472,0.00047830408,0.023434907,0.008680707,0.36820322,0.060933877,0.53556466],"study_design_scores_gemma":[0.0000653874,0.00013381547,0.00034215258,0.0006360242,0.00011313747,0.000931062,0.00019513982,0.07507347,0.0054831905,0.23629895,0.6806306,0.000097094045],"about_ca_topic_score_codex":0.0006807726,"about_ca_topic_score_gemma":0.00057572924,"teacher_disagreement_score":0.0049625747,"about_ca_system_score_codex":0.00070892146,"about_ca_system_score_gemma":0.00087956554,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W1981307456","doi":"10.1109/icc.2010.5502372","title":"Cross-Layer Mixed Bias Scheduling for Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Queue; Wireless mesh network; Scheduling (production processes); Wireless network; Node (physics); Computer network; Queueing theory; Distributed computing; Wireless; Mathematical optimization; Telecommunications; Mathematics; Engineering","score_opus":0.030564063246246286,"score_gpt":0.28456343860427247,"score_spread":0.2539993753580262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981307456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049236484,0.0008804114,0.9480891,0.00014685576,0.00011389128,0.00004171311,0.00002092518,0.00032748352,0.0011431719],"genre_scores_gemma":[0.8319489,0.00031692412,0.16577289,0.00021011951,0.00015611063,0.00007796667,0.00006615551,0.00008517931,0.0013657543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887437,0.0005181913,0.00004475702,0.000118302916,0.00034010434,0.00010423402],"domain_scores_gemma":[0.99839514,0.0007720485,0.00020343262,0.00022939585,0.00030994546,0.00009005616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001940977,0.0005125121,0.00050477096,0.00042732278,0.00042271698,0.0006455148,0.0011649206,0.00040847124,0.00085521175],"category_scores_gemma":[0.0033197543,0.00029410908,0.00027781422,0.0005136181,0.00038750403,0.0010972824,0.0010657716,0.00068914314,0.00021640866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012079508,0.00028294584,0.006603211,0.00023402437,0.00024657862,0.00014721986,0.00023515987,0.49343628,0.06419472,0.031966552,0.0025606898,0.3988846],"study_design_scores_gemma":[0.000038945647,0.00021044385,0.00059988705,0.000008620169,0.00002555234,0.000056748922,0.000017976225,0.98409075,0.0071241376,0.0062670116,0.0015447554,0.00001521686],"about_ca_topic_score_codex":0.0005848567,"about_ca_topic_score_gemma":0.0010688875,"teacher_disagreement_score":0.001940977,"about_ca_system_score_codex":0.0005610454,"about_ca_system_score_gemma":0.00060017675,"threshold_uncertainty_score":0.010264993},"labels":[],"label_agreement":null},{"id":"W1981783992","doi":"10.1016/j.adhoc.2012.01.009","title":"Extended sliding frame R-Aloha: Medium access control (MAC) protocol for mobile networks","year":2012,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Aloha; Computer network; Computer science; Frame (networking); Protocol (science); Access control; Multiple Access with Collision Avoidance for Wireless; Throughput; Telecommunications; Wireless; Network packet; Optimized Link State Routing Protocol; Medicine; Routing protocol","score_opus":0.025484743155133893,"score_gpt":0.31815320748132425,"score_spread":0.29266846432619037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981783992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009183936,0.0025406047,0.9769637,0.00035606365,0.00065770466,0.00030125128,0.00027744388,0.004508348,0.0052110283],"genre_scores_gemma":[0.5120458,0.003346406,0.45420715,0.0007203479,0.0007992353,0.0010394496,0.001119433,0.00036441232,0.026357742],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.00029107,0.00007195726,0.0001648982,0.00030218845,0.00014778461],"domain_scores_gemma":[0.9981427,0.0005098453,0.00014365467,0.00041841317,0.00068036484,0.00010508157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718641,0.0009073547,0.0010428398,0.0012427109,0.0010123488,0.0013479841,0.001748107,0.0012443081,0.0064763725],"category_scores_gemma":[0.0033371574,0.00023937305,0.00041616074,0.0012695845,0.0007397837,0.0018113513,0.0013315991,0.0016818743,0.0022839971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022978773,0.00026278818,0.00067167485,0.001106416,0.00017273347,0.0008722736,0.0006231183,0.038174685,0.07973694,0.08904299,0.033480998,0.7535575],"study_design_scores_gemma":[0.00044050356,0.0015487275,0.0011033809,0.00019916345,0.00034176745,0.001503721,0.00024687385,0.71656746,0.07000669,0.059565853,0.14824781,0.00022802234],"about_ca_topic_score_codex":0.001764742,"about_ca_topic_score_gemma":0.001454488,"teacher_disagreement_score":0.0064763725,"about_ca_system_score_codex":0.0005961367,"about_ca_system_score_gemma":0.001211288,"threshold_uncertainty_score":0.021665633},"labels":[],"label_agreement":null},{"id":"W1981902032","doi":"10.1109/milcom.2012.6415657","title":"Enabling secure and reliable policy-based routing in MANETs","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Multipath routing; Dynamic Source Routing; Policy-based routing; Link-state routing protocol; Routing protocol; Distributed computing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation)","score_opus":0.011644046601782056,"score_gpt":0.2418291982711149,"score_spread":0.23018515166933284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981902032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017951636,0.00034756633,0.97564405,0.0005075863,0.00011386847,0.00012704569,0.000027923543,0.0010813095,0.0041990504],"genre_scores_gemma":[0.5459204,0.00095425075,0.44945952,0.00024159784,0.00016204063,0.00025670909,0.000080800055,0.00011410707,0.0028105897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987803,0.00040288514,0.000078619465,0.00013324429,0.00046777987,0.000137162],"domain_scores_gemma":[0.9985354,0.0005230705,0.00021764821,0.0003924522,0.00019179692,0.00013976777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002226574,0.00046503215,0.0004844594,0.0005753776,0.0008158303,0.0017220211,0.0013375953,0.0010085765,0.0009683643],"category_scores_gemma":[0.0031424505,0.0003954907,0.0005630812,0.00039631213,0.0017625793,0.002611521,0.0017709555,0.0013743928,0.000601879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001262989,0.00019839026,0.0014982332,0.00027600804,0.00007347037,0.00091335305,0.0008390272,0.31909308,0.02445127,0.5430557,0.0025787796,0.106896296],"study_design_scores_gemma":[0.000060906466,0.00027685723,0.00036376703,0.00008817714,0.000057952533,0.00045216695,0.00015281819,0.77076316,0.014299317,0.17122413,0.04218166,0.00007902897],"about_ca_topic_score_codex":0.0014021504,"about_ca_topic_score_gemma":0.0010325492,"teacher_disagreement_score":0.002226574,"about_ca_system_score_codex":0.00056848215,"about_ca_system_score_gemma":0.0013232569,"threshold_uncertainty_score":0.011775374},"labels":[],"label_agreement":null},{"id":"W1982683119","doi":"10.1109/bwcca.2010.144","title":"Adaptive Mixed Bias Resource Allocation for Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Wireless mesh network; Computer science; Tabu search; Computer network; Network packet; Wireless network; Wireless; Scheduling (production processes); Distributed computing; Mesh networking; Order One Network Protocol; Algorithm; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.02374924274391808,"score_gpt":0.23896901821557043,"score_spread":0.21521977547165236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982683119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038609024,0.0010835254,0.95798016,0.00015251047,0.000049897335,0.000051937943,0.000024631743,0.00030207448,0.0017462341],"genre_scores_gemma":[0.80404514,0.00042291838,0.19385211,0.000106447165,0.000046671263,0.0001376935,0.000050374805,0.000048658898,0.0012899825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996445,0.0001903599,0.000011251244,0.000029867711,0.00008871168,0.000035410314],"domain_scores_gemma":[0.9994541,0.00032974666,0.000065460765,0.00004780633,0.000083464496,0.000019380248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008456325,0.00028107574,0.00030306526,0.00042254513,0.00026767212,0.00038378793,0.00074809213,0.000319126,0.0007709482],"category_scores_gemma":[0.0024328632,0.00014010769,0.00017362028,0.00052875624,0.0003132776,0.0005810036,0.00045851324,0.000288931,0.00015097282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002250515,0.000059864793,0.0014976572,0.00008870364,0.00006183382,0.000053221243,0.00006615006,0.73910546,0.009441535,0.018049119,0.0015432253,0.22980827],"study_design_scores_gemma":[0.000015398615,0.000054898883,0.0001878293,0.0000046823234,0.0000063305692,0.000025312764,0.000011070917,0.99077797,0.001287568,0.0068020783,0.00082207756,0.00000480704],"about_ca_topic_score_codex":0.0010952386,"about_ca_topic_score_gemma":0.0015910016,"teacher_disagreement_score":0.0010952386,"about_ca_system_score_codex":0.00042624606,"about_ca_system_score_gemma":0.0004526458,"threshold_uncertainty_score":0.0044721365},"labels":[],"label_agreement":null},{"id":"W1982951122","doi":"10.3844/jcssp.2008.967.975","title":"A Novel Approach to Modeling and Flooding in Ad-hoc Wireless Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Flooding (psychology); Ad hoc wireless distribution service; Computer network; Wireless; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.028785381404187703,"score_gpt":0.2364272562488866,"score_spread":0.2076418748446989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982951122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002586713,0.00018084898,0.99558496,0.00018085743,0.000036155412,0.000023525005,0.000020447747,0.000044402037,0.0013420715],"genre_scores_gemma":[0.29640338,0.0014321209,0.6945932,0.000234909,0.0002844752,0.0004193161,0.00014513831,0.00006374151,0.0064236447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913895,0.0003058283,0.000057100704,0.00011935338,0.0003353616,0.000043335527],"domain_scores_gemma":[0.99935,0.00032886225,0.00007826397,0.00008122518,0.00012802203,0.000033610904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001046164,0.0006284955,0.00060297013,0.0007887329,0.0006308516,0.0011131533,0.0018222826,0.001189549,0.000940338],"category_scores_gemma":[0.0024683152,0.0004146759,0.00091366563,0.00080503273,0.0010546799,0.0024265503,0.0014467431,0.0014231293,0.00028539493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026642758,0.000048555547,0.00062581414,0.00015344076,0.0000594034,0.00025580448,0.00034206602,0.5230617,0.004350663,0.4359481,0.0016068827,0.03352088],"study_design_scores_gemma":[0.0000069757443,0.00002231338,0.000052021212,0.000014835944,0.000013862966,0.00009660956,0.00002511947,0.9157285,0.00064564706,0.07660783,0.006776846,0.000009449926],"about_ca_topic_score_codex":0.001781985,"about_ca_topic_score_gemma":0.0012604065,"teacher_disagreement_score":0.0018222826,"about_ca_system_score_codex":0.00090883515,"about_ca_system_score_gemma":0.00089487346,"threshold_uncertainty_score":0.0065941215},"labels":[],"label_agreement":null},{"id":"W1983111002","doi":"10.1109/ccece.2012.6334994","title":"Capacity regions for multi-hop ad-hoc wireless networks using conflict graphs","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computation; Wireless ad hoc network; Computer science; Computational complexity theory; Wireless; Theoretical computer science; Wireless network; Topology (electrical circuits); Graph; Communication complexity; Distributed computing; Hop (telecommunications); Reduction (mathematics); Algorithm; Mathematics; Computer network; Telecommunications; Combinatorics","score_opus":0.09745314554039257,"score_gpt":0.29833268278662467,"score_spread":0.2008795372462321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983111002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012612368,0.0012240441,0.9785718,0.00026902033,0.000026488655,0.000059133363,0.00015220857,0.000118311444,0.0069665727],"genre_scores_gemma":[0.76774514,0.0029433158,0.22421706,0.0002516314,0.00021789822,0.000607135,0.00048301776,0.00027487884,0.0032599568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974861,0.0013275773,0.00010136579,0.00022036853,0.0005951329,0.00026946559],"domain_scores_gemma":[0.9908235,0.0072824727,0.0004552522,0.00040927026,0.00086320774,0.00016634965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037466807,0.001473343,0.000949526,0.0022485177,0.0006572868,0.0023880247,0.0020405147,0.00079236814,0.0022368405],"category_scores_gemma":[0.011952197,0.0006672347,0.0015265252,0.002090978,0.0018722295,0.0040693143,0.0018696355,0.0022205452,0.00040292265],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007344124,0.000027683347,0.00038657567,0.00016371596,0.00004735577,0.00009143589,0.00014386093,0.6561445,0.001475519,0.32586578,0.001441791,0.014138331],"study_design_scores_gemma":[0.000007399985,0.00002529049,0.0001307809,0.00003339593,0.000011050557,0.00005564558,0.000037304773,0.8675177,0.001085237,0.12957978,0.0014975565,0.000018951967],"about_ca_topic_score_codex":0.0020690232,"about_ca_topic_score_gemma":0.0007914132,"teacher_disagreement_score":0.0037466807,"about_ca_system_score_codex":0.0021703558,"about_ca_system_score_gemma":0.000999537,"threshold_uncertainty_score":0.01981455},"labels":[],"label_agreement":null},{"id":"W1983406788","doi":"10.1109/bwcca.2011.29","title":"On Assessing the Impact of Jamming Strategies on the Behavior of DYMO-Based MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Jamming; Mobile ad hoc network; Computer science; Software deployment; Computer network; Computer security; Network packet; Routing protocol; Wireless; Telecommunications","score_opus":0.04986347961326204,"score_gpt":0.3104410285573991,"score_spread":0.26057754894413704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983406788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9839298,0.00018526116,0.013449493,0.000093089264,0.000020297255,0.00007793387,0.000094698065,0.00006606969,0.0020832869],"genre_scores_gemma":[0.99522203,0.00017037372,0.0040806876,0.000028726448,0.000005956412,0.00003348714,0.00008470287,0.0000074391987,0.00036657462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991148,0.00045021364,0.000039289363,0.00009989431,0.00014511518,0.0001507193],"domain_scores_gemma":[0.9909864,0.006640926,0.0009815322,0.00047455216,0.0005458945,0.00037064208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015868035,0.000652263,0.0004654832,0.0011448342,0.0005468177,0.00060701167,0.00045605976,0.00062912086,0.00065431953],"category_scores_gemma":[0.009205046,0.0001960624,0.00027796443,0.0005617536,0.00053989684,0.0011943444,0.0008016301,0.00056912267,0.00018455848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010929406,0.0006146628,0.07043858,0.00030295586,0.00026431362,0.00038626115,0.00042933892,0.8612113,0.028518936,0.0057454663,0.0005144783,0.03048072],"study_design_scores_gemma":[0.000022662483,0.0015602221,0.019360691,0.000026888047,0.000057276924,0.0002827058,0.00038937814,0.9706872,0.0057645207,0.0013033203,0.00051117205,0.000033894896],"about_ca_topic_score_codex":0.0024331305,"about_ca_topic_score_gemma":0.0026522723,"teacher_disagreement_score":0.0024331305,"about_ca_system_score_codex":0.0006504042,"about_ca_system_score_gemma":0.00039376414,"threshold_uncertainty_score":0.008391976},"labels":[],"label_agreement":null},{"id":"W1983709447","doi":"10.1016/j.dam.2012.08.004","title":"Strongly connected orientations of plane graphs","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Digraph; Mathematics; Combinatorics; Bounded function; Orientation (vector space); Strongly connected component; Plane (geometry); Simply connected space; Connectivity; Graph; Planar graph; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.014305243039027757,"score_gpt":0.2447293648818942,"score_spread":0.23042412184286645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983709447","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81620127,0.00051242276,0.1380117,0.000942211,0.00014490205,0.00011213127,0.00070264004,0.00018129795,0.043191496],"genre_scores_gemma":[0.95221895,0.0009975998,0.031841025,0.00020771848,0.000155251,0.00015263722,0.0011854538,0.00011512962,0.013126278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963045,0.00008831243,0.00001958569,0.00007307929,0.00009962212,0.000088921755],"domain_scores_gemma":[0.997914,0.00079438294,0.0004762681,0.00011406982,0.0002604638,0.00044085566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030230315,0.0005708718,0.0004805734,0.0016489577,0.0010947766,0.0026847483,0.0007487511,0.00078988104,0.004743074],"category_scores_gemma":[0.002437238,0.00060673314,0.00039709877,0.0012821124,0.0014191639,0.0019675132,0.0014344772,0.0018353132,0.00073195074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026818307,0.00007526981,0.0028434393,0.000090480076,0.000023587925,0.00028397777,0.0006948912,0.008613311,0.0063929535,0.9573633,0.002414997,0.02093555],"study_design_scores_gemma":[0.00006927845,0.000049793292,0.001767963,0.000035249413,0.000025945548,0.00022195524,0.00070949487,0.022265876,0.0019802381,0.9657389,0.0071139303,0.000021248074],"about_ca_topic_score_codex":0.0015317322,"about_ca_topic_score_gemma":0.0017468135,"teacher_disagreement_score":0.004743074,"about_ca_system_score_codex":0.0007540322,"about_ca_system_score_gemma":0.00048329408,"threshold_uncertainty_score":0.015867174},"labels":[],"label_agreement":null},{"id":"W1983880253","doi":"10.1145/1400751.1400809","title":"On ad hoc routing with guaranteed delivery","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless ad hoc network; Overhead (engineering); Routing (electronic design automation); Logarithm; Computer network; Simple (philosophy); Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Distributed computing; Mobile ad hoc network; Dynamic Source Routing; Routing protocol; Mathematics; Telecommunications; Wireless","score_opus":0.01281366178191945,"score_gpt":0.19983394808420127,"score_spread":0.18702028630228182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983880253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00606202,0.0029878288,0.9808934,0.00067401235,0.00039593398,0.00014723715,0.00006519343,0.0009094452,0.007864853],"genre_scores_gemma":[0.2607562,0.013977692,0.7081531,0.0009677472,0.0017161205,0.0010265417,0.00041340975,0.0005782122,0.012410878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998184,0.0007001797,0.00010752298,0.00020017543,0.00058506895,0.00022290375],"domain_scores_gemma":[0.9956554,0.003176776,0.0001552063,0.0005825487,0.00032827762,0.000101692654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282573,0.0026582023,0.001500117,0.00195571,0.0011541987,0.0014718125,0.0026940089,0.001444315,0.0043550152],"category_scores_gemma":[0.0093948925,0.0006957226,0.00071134255,0.0036636335,0.0024807588,0.006072495,0.0035698,0.0024873922,0.001906347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069897104,0.00016837653,0.00045703776,0.00084233645,0.00009763724,0.00043022603,0.00024895192,0.2570004,0.0070422795,0.35913396,0.017810505,0.35606933],"study_design_scores_gemma":[0.00016651943,0.00048587358,0.00021282991,0.00017255408,0.000069016794,0.00062058395,0.000053275002,0.5987096,0.0049021305,0.3648361,0.029697694,0.000073812254],"about_ca_topic_score_codex":0.0008179156,"about_ca_topic_score_gemma":0.00059253204,"teacher_disagreement_score":0.0043550152,"about_ca_system_score_codex":0.0012374423,"about_ca_system_score_gemma":0.00073936646,"threshold_uncertainty_score":0.0145689845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.0414720452036481,"score_gpt":0.30743592333009967,"score_spread":0.26596387812645156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984044090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030289334,0.17256859,0.8004511,0.0070792204,0.002205244,0.0003066482,0.00015885291,0.00057856075,0.013622845],"genre_scores_gemma":[0.07689177,0.26979926,0.63399047,0.0012561057,0.006158362,0.00079509855,0.00055715995,0.00026686274,0.010284959],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.00073917327,0.00015069106,0.00015915814,0.0006725206,0.00008027197],"domain_scores_gemma":[0.9975495,0.001697222,0.00014083029,0.00016829703,0.0003877033,0.000056486213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003238605,0.0018170391,0.0014990402,0.0015943736,0.0012571602,0.003873315,0.0022304135,0.0029751498,0.0026999933],"category_scores_gemma":[0.005151555,0.00070584234,0.0006112113,0.0050552282,0.002120973,0.005788833,0.0013064682,0.0027375824,0.0014971851],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048336697,0.000086529675,0.0005650252,0.0021390757,0.000084430794,0.00019529616,0.00034832538,0.05699544,0.0016621691,0.27651986,0.03445375,0.6269018],"study_design_scores_gemma":[0.00003909037,0.00010246059,0.00036474774,0.0007578557,0.00006286731,0.00062211463,0.00045544858,0.22937761,0.0015495437,0.53596944,0.23062438,0.00007445641],"about_ca_topic_score_codex":0.001764364,"about_ca_topic_score_gemma":0.0014565255,"teacher_disagreement_score":0.003873315,"about_ca_system_score_codex":0.0014121145,"about_ca_system_score_gemma":0.0013828955,"threshold_uncertainty_score":0.017127573},"labels":[],"label_agreement":null},{"id":"W1984525179","doi":"10.1109/pdcat.2012.53","title":"Analysis of a Forwarding Game without Payments","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Node (physics); Relay; Nash equilibrium; Computer network; Network packet; Packet forwarding; Flow (mathematics); Payment; Game theory; Incentive; Flow network; Outcome (game theory); Mathematical economics; Mathematical optimization; Mathematics; Microeconomics; Economics","score_opus":0.017339821629338538,"score_gpt":0.26848045287878375,"score_spread":0.2511406312494452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984525179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20610806,0.0005831033,0.7260138,0.00227502,0.00011052621,0.00047488068,0.00067580683,0.00024610947,0.0635128],"genre_scores_gemma":[0.9352849,0.00060913677,0.045227204,0.00030597218,0.00010061757,0.0004008962,0.0003222871,0.00010740388,0.017641632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986442,0.0005735652,0.000051440657,0.00017875158,0.00021233411,0.00033969036],"domain_scores_gemma":[0.99366885,0.004727032,0.00055155216,0.00018290173,0.00040191266,0.00046780528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023571844,0.0016356154,0.0014624664,0.001313049,0.0012850717,0.0022948857,0.0018130323,0.0027286874,0.01045552],"category_scores_gemma":[0.01000465,0.00068606815,0.0013097747,0.00096193847,0.002343411,0.0034683053,0.0017349288,0.0020669694,0.00064576586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012627317,0.00013123822,0.00074235356,0.00010431441,0.000049019192,0.00025452016,0.00021019904,0.6494931,0.0019341613,0.34019402,0.001761829,0.0049990616],"study_design_scores_gemma":[0.000040078223,0.000052113573,0.00018793182,0.000014590427,0.00001572737,0.000054068336,0.00005588571,0.9062588,0.00017478707,0.09233565,0.000794664,0.000015622283],"about_ca_topic_score_codex":0.009492884,"about_ca_topic_score_gemma":0.0039129574,"teacher_disagreement_score":0.01045552,"about_ca_system_score_codex":0.0037038904,"about_ca_system_score_gemma":0.0026436702,"threshold_uncertainty_score":0.034977198},"labels":[],"label_agreement":null},{"id":"W1985270549","doi":"10.1109/itst.2007.4295831","title":"Smart Protocol for Communication in Mobile Ad Hoc Network of Vehicles","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Retransmission; Routing protocol; Wireless Routing Protocol; Unicast; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless ad hoc network; Flooding (psychology); Distributed computing; Protocol (science); Ad hoc On-Demand Distance Vector Routing; Ad hoc wireless distribution service; Network packet; Wireless; Telecommunications","score_opus":0.022773238673540128,"score_gpt":0.3100080449026278,"score_spread":0.28723480622908765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985270549","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004516261,0.011085171,0.9192557,0.001784125,0.0037975025,0.0026188588,0.0012836198,0.004720678,0.05093813],"genre_scores_gemma":[0.12019898,0.013941642,0.7241478,0.004772126,0.001534509,0.010605433,0.010043742,0.0011016873,0.11365408],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702233,0.0011576175,0.00034432363,0.00020648082,0.0010646211,0.00020466639],"domain_scores_gemma":[0.99830353,0.00046136059,0.00019900246,0.00028746048,0.0006034134,0.00014526142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002072118,0.00085914735,0.0012513143,0.0014378272,0.0010897876,0.0018322242,0.001947745,0.0019302013,0.008442729],"category_scores_gemma":[0.0026750762,0.00047454116,0.0006889983,0.0019645174,0.0015235099,0.0021004805,0.0024420575,0.0034664187,0.006456237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057792984,0.0002011158,0.0010560048,0.0024207523,0.00028206184,0.0018784424,0.0009854657,0.014830418,0.025097083,0.36485776,0.16361049,0.42420247],"study_design_scores_gemma":[0.00020483456,0.00045099307,0.00047288064,0.00036097105,0.000116330295,0.0012489796,0.00020917058,0.029214326,0.007783524,0.04875037,0.91105956,0.00012816057],"about_ca_topic_score_codex":0.0009905881,"about_ca_topic_score_gemma":0.001251588,"teacher_disagreement_score":0.008442729,"about_ca_system_score_codex":0.00086162693,"about_ca_system_score_gemma":0.0018299817,"threshold_uncertainty_score":0.02824372},"labels":[],"label_agreement":null},{"id":"W1985384853","doi":"10.1109/glocom.2006.267","title":"NIS02-1: Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wormhole; Computer science; Computer network; Wireless ad hoc network; Countermeasure; Network packet; Distance-vector routing protocol; Routing protocol; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless; Wireless network; Computer security; Telecommunications; Engineering","score_opus":0.007356705943957545,"score_gpt":0.22036796923443552,"score_spread":0.21301126329047798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985384853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17653538,0.0061235954,0.7838767,0.0013223162,0.0003880598,0.0005106633,0.00021905775,0.0021349746,0.028889263],"genre_scores_gemma":[0.9155928,0.0026512544,0.07465219,0.0001430057,0.000121541554,0.00029786504,0.00039181396,0.00009577875,0.0060537644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859613,0.00032532756,0.000083715095,0.0000604156,0.00083891285,0.0000955792],"domain_scores_gemma":[0.99793756,0.0009469245,0.00029676384,0.00023120105,0.0005378011,0.00004967085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097387074,0.0007952592,0.0006591914,0.001650014,0.00040144718,0.0009358712,0.0008375767,0.0011086345,0.0010264794],"category_scores_gemma":[0.004415078,0.00023126267,0.0005592971,0.0011290024,0.00079712336,0.0016911888,0.0007645768,0.00080285704,0.00028895857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005604058,0.00041863899,0.011271343,0.00081137294,0.0003122031,0.0008673703,0.00021804604,0.6073112,0.03356083,0.11131237,0.00924001,0.2241162],"study_design_scores_gemma":[0.000015277283,0.0002403522,0.001341998,0.000027317057,0.00003982356,0.0006116132,0.000034789264,0.9747489,0.009261649,0.0093752965,0.0042750062,0.00002802857],"about_ca_topic_score_codex":0.00070894306,"about_ca_topic_score_gemma":0.0007071617,"teacher_disagreement_score":0.001650014,"about_ca_system_score_codex":0.000847741,"about_ca_system_score_gemma":0.0006579571,"threshold_uncertainty_score":0.0061508417},"labels":[],"label_agreement":null},{"id":"W1985708909","doi":"10.1109/mobhoc.2006.278559","title":"Max-Min Fair Capacity of Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Fairness measure; Bandwidth (computing); Network topology; Wireless network; Context (archaeology); Wireless; Protocol (science); Distributed computing; Max-min fairness; Collision; Mathematical optimization; Resource allocation; Telecommunications; Mathematics; Throughput; Computer security","score_opus":0.010425601449812357,"score_gpt":0.2038039264624128,"score_spread":0.19337832501260044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985708909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017468119,0.0015357323,0.9721942,0.0004059721,0.0001224016,0.00006286409,0.0001291809,0.00040116181,0.007680265],"genre_scores_gemma":[0.8545865,0.0011675459,0.13854502,0.00016808996,0.00019275102,0.0003236887,0.00017117654,0.0001994953,0.0046457695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701774,0.0012776766,0.00010914804,0.00038077086,0.0007988758,0.0004157557],"domain_scores_gemma":[0.9918315,0.0060661035,0.00036480406,0.0008080872,0.00074688677,0.00018264416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006858417,0.0007722397,0.00090351177,0.0014735829,0.0012603315,0.0027862235,0.0023684392,0.0007829951,0.0025276442],"category_scores_gemma":[0.01894522,0.0004977211,0.00052889937,0.0015658485,0.0028638956,0.004856823,0.0017596404,0.0011679862,0.00034729566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019294996,0.00003572309,0.0005583732,0.00014470445,0.000038015824,0.00006186522,0.00017551302,0.5508887,0.002215163,0.4004549,0.0022273252,0.04300677],"study_design_scores_gemma":[0.0000072504154,0.000016924474,0.000115273935,0.00002408538,0.000007880676,0.000028259792,0.000020732821,0.8482294,0.0018361658,0.14767882,0.0020189902,0.000016309983],"about_ca_topic_score_codex":0.002669811,"about_ca_topic_score_gemma":0.0017325274,"teacher_disagreement_score":0.006858417,"about_ca_system_score_codex":0.0035152812,"about_ca_system_score_gemma":0.0027958294,"threshold_uncertainty_score":0.036271214},"labels":[],"label_agreement":null},{"id":"W1986244367","doi":"10.1109/mcom.2014.6736757","title":"Planning for energy-aware wireless networks","year":2014,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless network; Wireless; Computer network; Key (lock); Wireless mesh network; Energy (signal processing); Wireless WAN; Network resource planning; Radio resource management; Wi-Fi array; Distributed computing; Telecommunications; Network planning and design; Computer security","score_opus":0.029209971050524294,"score_gpt":0.27849996310904496,"score_spread":0.24928999205852065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986244367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033553152,0.000609171,0.98649395,0.0007971461,0.000053711312,0.000043314525,0.000075872544,0.00008477751,0.00848675],"genre_scores_gemma":[0.60745746,0.004959271,0.37246418,0.00033874947,0.00021339372,0.0006115958,0.00034861438,0.00019585152,0.013410899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995353,0.00019902847,0.000017463091,0.00006961821,0.00012225298,0.000056263758],"domain_scores_gemma":[0.9994431,0.00038040467,0.00004905925,0.00003331713,0.00006124172,0.00003280704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088977517,0.0008949319,0.0008017302,0.00036223713,0.0005769534,0.0012906822,0.0014388607,0.0008853277,0.002700353],"category_scores_gemma":[0.0019378546,0.0006322824,0.000591161,0.0007127305,0.0011513567,0.0018135365,0.001239568,0.001401581,0.00031506663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012003273,0.000012617913,0.00006794833,0.0000494403,0.00001053426,0.000034773788,0.000039829276,0.8205833,0.00026432876,0.16892134,0.001138284,0.008865539],"study_design_scores_gemma":[0.000006902952,0.000010144524,0.000030881172,0.00001597779,0.000005082574,0.000013586038,0.000025353369,0.89745384,0.00017302518,0.098215595,0.004042912,0.0000066468665],"about_ca_topic_score_codex":0.0063530114,"about_ca_topic_score_gemma":0.0060532745,"teacher_disagreement_score":0.0063530114,"about_ca_system_score_codex":0.0017084358,"about_ca_system_score_gemma":0.001742948,"threshold_uncertainty_score":0.012632072},"labels":[],"label_agreement":null},{"id":"W1986337600","doi":"10.1145/1089444.1089448","title":"Certain limitations of reputation--based schemes in mobile environments","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Selfishness; Reputation; Mobile ad hoc network; Computer science; Wireless ad hoc network; Computer network; Enforcement; Node (physics); Energy consumption; Network packet; Computer security; Reputation system; Wireless; Telecommunications; Engineering","score_opus":0.02434515463773154,"score_gpt":0.2446459930283455,"score_spread":0.22030083839061396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986337600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10141551,0.0293229,0.74091583,0.04246885,0.0010421394,0.0006346911,0.0003212151,0.001588281,0.08229061],"genre_scores_gemma":[0.9007888,0.007309161,0.084717035,0.0011277607,0.00076973514,0.00025587325,0.00007110692,0.00008167991,0.0048789373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98706865,0.0072768857,0.00048392126,0.00064517785,0.0041110483,0.00041426832],"domain_scores_gemma":[0.90360653,0.06234038,0.0058525447,0.017762318,0.0093847085,0.0010534028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020342281,0.00063123653,0.001184012,0.0012712822,0.0019192246,0.0035782226,0.0036578507,0.0037388108,0.0030510519],"category_scores_gemma":[0.06417111,0.0004948612,0.00094015035,0.0017815814,0.0025739132,0.010287107,0.0023745324,0.0028984533,0.0020322043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039969388,0.00023627377,0.009662114,0.0016472561,0.00041094795,0.0005576963,0.0018032202,0.053779207,0.0065544536,0.5132365,0.013115545,0.39859706],"study_design_scores_gemma":[0.00037618596,0.0014405733,0.008418101,0.0013024807,0.00042659743,0.0049436004,0.0015756622,0.44119462,0.007876342,0.41361323,0.118481666,0.00035092654],"about_ca_topic_score_codex":0.0013746887,"about_ca_topic_score_gemma":0.0009439686,"teacher_disagreement_score":0.020342281,"about_ca_system_score_codex":0.0013025859,"about_ca_system_score_gemma":0.0012232659,"threshold_uncertainty_score":0.107581496},"labels":[],"label_agreement":null},{"id":"W1987386756","doi":"10.1002/sec.248","title":"A self‐stabilized random access protocol against denial of service attack in wireless networks","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Aloha; Computer science; Computer network; Network packet; Encryption; Random access; Denial-of-service attack; Throughput; Computer security; Wireless; Telecommunications; The Internet","score_opus":0.013874855695406993,"score_gpt":0.28613336591809907,"score_spread":0.2722585102226921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987386756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15684338,0.00057401403,0.8365156,0.00020613584,0.00015556197,0.00016249016,0.000030709303,0.0020353785,0.0034766423],"genre_scores_gemma":[0.96610963,0.00010236733,0.03204318,0.00007596767,0.00005506962,0.00009320767,0.00003147351,0.000019362547,0.0014697836],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00033096768,0.00006915153,0.00015510825,0.00030024708,0.00008817362],"domain_scores_gemma":[0.9980964,0.00051918137,0.00039929769,0.00029269673,0.00061128096,0.00008112577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010780842,0.00037430486,0.00059266,0.00084227993,0.00055393425,0.00069569837,0.00093049067,0.0005905947,0.0010247481],"category_scores_gemma":[0.0024568804,0.00014625616,0.00025653688,0.00032658022,0.0007205671,0.0009047282,0.00077912357,0.00038343575,0.0004858458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002483384,0.00040836527,0.001988541,0.0004364976,0.00029142303,0.0009596434,0.0009411576,0.25152126,0.37078425,0.05114701,0.0045040506,0.31453446],"study_design_scores_gemma":[0.00016748803,0.001215343,0.00059135765,0.000040064057,0.00011017507,0.00069582264,0.00010191696,0.93473715,0.0461906,0.0107241385,0.005366737,0.000059252307],"about_ca_topic_score_codex":0.0003545494,"about_ca_topic_score_gemma":0.00029163438,"teacher_disagreement_score":0.0010780842,"about_ca_system_score_codex":0.00031380428,"about_ca_system_score_gemma":0.00042878458,"threshold_uncertainty_score":0.005701542},"labels":[],"label_agreement":null},{"id":"W1987818736","doi":"10.1016/j.tcs.2011.10.010","title":"Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks","year":2011,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Polynomial-time approximation scheme; Approximation algorithm; Mathematics; Combinatorics; Shortest path problem; Routing (electronic design automation); Time complexity; Wireless sensor network; Discrete mathematics; Constant (computer programming); Scheme (mathematics); Constraint (computer-aided design); Wireless network; Polynomial; Path (computing); Graph; Wireless; Computer science; Computer network; Telecommunications","score_opus":0.02154726848785673,"score_gpt":0.24917111550351476,"score_spread":0.22762384701565802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987818736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06183627,0.0013603006,0.92824763,0.0011404455,0.00026308684,0.00038971682,0.0006923771,0.0014004112,0.00466971],"genre_scores_gemma":[0.6149799,0.00078232225,0.37846154,0.0003367357,0.0001630956,0.0004800433,0.0011977426,0.00019513065,0.0034034345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979736,0.00051499816,0.000112691814,0.00046591606,0.0005546145,0.0003781201],"domain_scores_gemma":[0.99656916,0.0020815264,0.0002547613,0.0005318323,0.00034850813,0.00021421835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020026364,0.0014081213,0.003197005,0.0010211198,0.0011783353,0.0022202071,0.0042638816,0.0015115745,0.0035932595],"category_scores_gemma":[0.0062140557,0.00066078996,0.0011104405,0.002828082,0.00074039976,0.0037919364,0.0020741127,0.0019214391,0.00045049138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012996716,0.0004470191,0.0009202948,0.0008613442,0.00017301872,0.00017585134,0.00033028255,0.78720635,0.006841787,0.03919378,0.01366817,0.14888245],"study_design_scores_gemma":[0.00008453406,0.00007429746,0.00010025829,0.000012093497,0.000032311764,0.0000566246,0.000050796945,0.9848092,0.00088961766,0.013130718,0.0007495863,0.000009835132],"about_ca_topic_score_codex":0.0054885377,"about_ca_topic_score_gemma":0.0074113435,"teacher_disagreement_score":0.0054885377,"about_ca_system_score_codex":0.0029319113,"about_ca_system_score_gemma":0.0034258564,"threshold_uncertainty_score":0.0212726},"labels":[],"label_agreement":null},{"id":"W1988228294","doi":"10.1109/chinacom.2009.5339942","title":"Routing in IEEE 802.16 based distributed wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; IEEE 802.11s; Distributed computing; Dynamic Source Routing; Routing (electronic design automation); Queueing theory; Mesh networking; Hazy Sighted Link State Routing Protocol; Order One Network Protocol; Wireless network; Wireless; Routing protocol; Telecommunications","score_opus":0.010675220187817951,"score_gpt":0.22882499348234606,"score_spread":0.21814977329452812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988228294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04913842,0.0038933852,0.9357908,0.0008336917,0.00042998607,0.00009642222,0.00008606285,0.000689118,0.0090422835],"genre_scores_gemma":[0.7671322,0.0036911026,0.21902525,0.0002481039,0.000221542,0.00018621063,0.00017908879,0.00007897598,0.009237513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936706,0.00026206757,0.00005716981,0.00007927431,0.0001809454,0.00005343005],"domain_scores_gemma":[0.9995449,0.00021127009,0.000064336964,0.00007218177,0.00009101705,0.000016199683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012926402,0.0002488379,0.00028784692,0.00044565214,0.00040645702,0.0009270382,0.0007332849,0.0006482543,0.00089125114],"category_scores_gemma":[0.0026992436,0.00021292956,0.00023609147,0.0006570006,0.0004042924,0.0013900329,0.00054207904,0.00043536944,0.00018772867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002048826,0.00008426306,0.0020861328,0.00028620643,0.00007160807,0.00053216604,0.00030379777,0.51530164,0.016169738,0.2078123,0.0061082384,0.251039],"study_design_scores_gemma":[0.000037378817,0.00012044393,0.0005771321,0.000040423154,0.00003690784,0.00032773966,0.00009402645,0.880713,0.0044995626,0.089451686,0.02406773,0.00003394825],"about_ca_topic_score_codex":0.0012959915,"about_ca_topic_score_gemma":0.0014205505,"teacher_disagreement_score":0.0012959915,"about_ca_system_score_codex":0.0006205424,"about_ca_system_score_gemma":0.0004020824,"threshold_uncertainty_score":0.0068362355},"labels":[],"label_agreement":null},{"id":"W1988598963","doi":"10.1016/j.comcom.2007.02.014","title":"DREAM: A system for detection and reaction against MAC layer misbehavior in ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Timeout; Computer science; Computer network; Network packet; Node (physics); Transmission (telecommunications); Protocol (science); Intrusion detection system; Wireless ad hoc network; Process (computing); Channel (broadcasting); Computer security; Wireless; Telecommunications","score_opus":0.029708930919617512,"score_gpt":0.2769009724109808,"score_spread":0.24719204149136326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988598963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11458865,0.0010714832,0.53631526,0.00070332,0.00085168064,0.001321074,0.0018202867,0.33669576,0.006632554],"genre_scores_gemma":[0.77502567,0.0003659783,0.20688301,0.00079606235,0.00022812483,0.0006827142,0.002352208,0.0016777656,0.011988431],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973271,0.0008192306,0.0003463948,0.00043706258,0.0009013853,0.00016877026],"domain_scores_gemma":[0.99228996,0.0027956099,0.00091635325,0.0019915397,0.0013101455,0.000696273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039276616,0.0013364512,0.0015300289,0.0022836397,0.00065266254,0.0014189442,0.002944089,0.0014098824,0.0037986431],"category_scores_gemma":[0.010560529,0.0007910357,0.0003524934,0.00045842672,0.00064111874,0.0025725903,0.002330915,0.0012794018,0.0019424546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009042959,0.0017531887,0.038819212,0.0011675124,0.000858026,0.0011935784,0.0012751096,0.036380846,0.06588661,0.00858211,0.07968614,0.7553547],"study_design_scores_gemma":[0.0007366735,0.0015360874,0.006081685,0.00008171004,0.00036585375,0.00084529654,0.00023895677,0.9125714,0.051711187,0.0070706154,0.018542333,0.00021823094],"about_ca_topic_score_codex":0.0014080857,"about_ca_topic_score_gemma":0.0014451541,"teacher_disagreement_score":0.0039276616,"about_ca_system_score_codex":0.0005730396,"about_ca_system_score_gemma":0.0011963351,"threshold_uncertainty_score":0.020771742},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0117247028281354,"score_gpt":0.2278753296525496,"score_spread":0.21615062682441422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988969082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028999032,0.0007291242,0.95423746,0.00023222456,0.00037066563,0.00024124837,0.00025521472,0.0064057894,0.008529164],"genre_scores_gemma":[0.26417258,0.0006180124,0.71576583,0.00022768039,0.000102773236,0.0003944628,0.0007107549,0.0006585176,0.017349381],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998115,0.000045684854,0.000008373545,0.000021709753,0.000096034884,0.000016809516],"domain_scores_gemma":[0.99979085,0.00007935574,0.000016176895,0.000022827267,0.000073382194,0.000017300345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029194984,0.00043554918,0.00051716674,0.0004968949,0.00040488655,0.00044301173,0.00097493693,0.00053173845,0.0030328585],"category_scores_gemma":[0.0007464255,0.00022794656,0.00020879449,0.00046636257,0.0001942,0.00067731785,0.00059029646,0.00048811064,0.00067206647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003532565,0.00021798056,0.0012089151,0.0002701281,0.00014959798,0.00016045083,0.000099764984,0.4518947,0.014453753,0.012273741,0.019081892,0.4998358],"study_design_scores_gemma":[0.00007064912,0.00011916258,0.00022334082,0.000009765122,0.000029121118,0.00007463244,0.000018144696,0.9806724,0.004128499,0.00291149,0.011726694,0.000016233096],"about_ca_topic_score_codex":0.0015948517,"about_ca_topic_score_gemma":0.003261113,"teacher_disagreement_score":0.0030328585,"about_ca_system_score_codex":0.00023884802,"about_ca_system_score_gemma":0.00052223454,"threshold_uncertainty_score":0.010145962},"labels":[],"label_agreement":null},{"id":"W1989143253","doi":"10.5555/1791889.1791935","title":"A performance guaranteed distributed multicast algorithm for long-lived directional communications in WANETs","year":2008,"lang":"en","type":"article","venue":"IEEE International Conference on High Performance Computing, Data, and Analytics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Node (physics); Bounded function; Upper and lower bounds; Wireless ad hoc network; Distributed computing; Computer network; Algorithm; Mathematical optimization; Mathematics; Telecommunications; Wireless; Engineering","score_opus":0.10208641381769945,"score_gpt":0.33079566844890756,"score_spread":0.22870925463120811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989143253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08226491,0.0005750068,0.9130797,0.0003829011,0.000135405,0.00014329333,0.00009826491,0.001406224,0.0019143767],"genre_scores_gemma":[0.6820167,0.00017826342,0.31502715,0.00011373345,0.00008844444,0.00016629054,0.0002089155,0.00013561784,0.002064867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892384,0.00029547466,0.00007626637,0.00014315991,0.0004051502,0.00015620497],"domain_scores_gemma":[0.99688846,0.0014886428,0.00023211127,0.0005196025,0.00065653597,0.00021458004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024342996,0.0007162143,0.001557734,0.0009463996,0.0015166714,0.0011086114,0.002963525,0.0012163445,0.0015460668],"category_scores_gemma":[0.006074415,0.0004372285,0.00036013778,0.0008857239,0.0006291308,0.001793051,0.0021712407,0.0012960309,0.0003367391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002889603,0.0004626408,0.0019239894,0.00025000883,0.00017612021,0.00020190107,0.00048008998,0.57039976,0.030849267,0.032357723,0.008579417,0.3514295],"study_design_scores_gemma":[0.00011761791,0.00014997834,0.00014504077,0.0000069986972,0.000020614305,0.000051677678,0.000040920353,0.98963124,0.0024887878,0.0065151914,0.00081930315,0.000012739796],"about_ca_topic_score_codex":0.0019185827,"about_ca_topic_score_gemma":0.0026048883,"teacher_disagreement_score":0.002963525,"about_ca_system_score_codex":0.0015926249,"about_ca_system_score_gemma":0.001384548,"threshold_uncertainty_score":0.012873948},"labels":[],"label_agreement":null},{"id":"W1989200670","doi":"10.1109/pimrc.2011.6139675","title":"Replication schemes for Peer-to-Peer content in wireless mesh networks with network support","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless mesh network; Computer science; Replication (statistics); Computer network; Distributed computing; Peer-to-peer; Provisioning; Mesh networking; Wireless network; Wireless; Order One Network Protocol","score_opus":0.04888445547869373,"score_gpt":0.2583057382016605,"score_spread":0.20942128272296673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989200670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06962716,0.0014874829,0.9250428,0.00044482955,0.0001185707,0.00026089427,0.000051643343,0.00034769997,0.0026190125],"genre_scores_gemma":[0.722392,0.0006785658,0.27430767,0.000069887064,0.00013724128,0.00029210298,0.000059647165,0.000055892164,0.002007047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979831,0.00086017355,0.00015765833,0.00027067514,0.000603497,0.00012484878],"domain_scores_gemma":[0.9962374,0.0016393821,0.00040602463,0.0009834121,0.0006213972,0.000112401394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025971478,0.00051747664,0.0009788176,0.00092329056,0.001299693,0.0011393321,0.00280843,0.0013470555,0.0009789412],"category_scores_gemma":[0.00967715,0.00039478313,0.00056576915,0.0010003104,0.0010432915,0.0030614645,0.0015586021,0.00061206234,0.000388687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005089669,0.00018548242,0.0017750947,0.00046281188,0.0001628197,0.00066214346,0.00075659476,0.6334408,0.03329285,0.14195494,0.0036731516,0.18312426],"study_design_scores_gemma":[0.0000781909,0.00018475325,0.00021964822,0.000021776594,0.000051229814,0.00031036366,0.00010392015,0.9508444,0.0050194017,0.03825521,0.004866062,0.00004494341],"about_ca_topic_score_codex":0.0009820187,"about_ca_topic_score_gemma":0.0008623551,"teacher_disagreement_score":0.00280843,"about_ca_system_score_codex":0.0009096646,"about_ca_system_score_gemma":0.0005900175,"threshold_uncertainty_score":0.013735235},"labels":[],"label_agreement":null},{"id":"W1989277402","doi":"10.1007/s00530-009-0166-0","title":"Video transmission enhancement in presence of misbehaving nodes in MANETs","year":2009,"lang":"en","type":"article","venue":"Multimedia Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Network packet; Overhead (engineering); Transmission (telecommunications); Wireless ad hoc network; Network topology; Intrusion detection system; Wireless network; Context (archaeology); Wireless; Computer security; Telecommunications","score_opus":0.01365844244102321,"score_gpt":0.2505976676590286,"score_spread":0.23693922521800537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989277402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7900596,0.0009871623,0.20360786,0.0002487274,0.00012930747,0.000042289965,0.00007811708,0.00043113224,0.0044158217],"genre_scores_gemma":[0.98688436,0.0002332085,0.011592479,0.00002560636,0.000042002415,0.0000050352573,0.000037561673,0.000016260072,0.0011634971],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977,0.00005407135,0.000012849614,0.000033744916,0.000089816,0.00003945207],"domain_scores_gemma":[0.9982462,0.0009019115,0.00015524654,0.00012733761,0.00048677495,0.000082502804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004497047,0.00030696538,0.00033407978,0.00041612677,0.00028442303,0.00040704932,0.00034075178,0.00046729218,0.00071585097],"category_scores_gemma":[0.002076217,0.0001682496,0.00009682136,0.00033182386,0.00021950631,0.0006009429,0.00030788954,0.00031705628,0.00019239125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029758934,0.0002641514,0.0127392905,0.000326627,0.00010870256,0.0029778837,0.00063519913,0.119550526,0.629447,0.003518638,0.0015947697,0.22586124],"study_design_scores_gemma":[0.000023717168,0.00065640116,0.008844196,0.00001930426,0.0001024166,0.0015264141,0.00028260096,0.82057786,0.16425009,0.0018525824,0.0018420481,0.00002246276],"about_ca_topic_score_codex":0.0008280366,"about_ca_topic_score_gemma":0.0009651658,"teacher_disagreement_score":0.0008280366,"about_ca_system_score_codex":0.00018552093,"about_ca_system_score_gemma":0.00015149615,"threshold_uncertainty_score":0.0023947358},"labels":[],"label_agreement":null},{"id":"W1989582478","doi":"10.1007/s11276-013-0592-y","title":"Reinforcement learning based routing in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"Indian Institute of Management Ahmedabad","keywords":"Computer science; Reinforcement learning; Wireless mesh network; Computer network; Routing (electronic design automation); Wireless; Distributed computing; Wireless network; Artificial intelligence; Telecommunications","score_opus":0.009361942659421276,"score_gpt":0.2149593549571089,"score_spread":0.20559741229768763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989582478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04397024,0.00062185514,0.951767,0.0004575948,0.000117610936,0.000038756792,0.000025491752,0.0002411662,0.002760221],"genre_scores_gemma":[0.9483945,0.0003745467,0.04808644,0.00007693203,0.00007084067,0.00006438108,0.000037302976,0.00003279511,0.0028622863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995365,0.0002242585,0.000020065696,0.00006320406,0.00008900393,0.000067000816],"domain_scores_gemma":[0.99752873,0.001831926,0.00017251223,0.000106774714,0.0002601143,0.00009997837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013374125,0.0003385906,0.0006854427,0.00034844893,0.0003423512,0.00057895464,0.0010696612,0.00071765593,0.0013573298],"category_scores_gemma":[0.0049407813,0.00023640072,0.00022032301,0.00035296738,0.00082160934,0.0009886958,0.00074102305,0.00084713707,0.00015131035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007497143,0.000044940854,0.00048405633,0.00003443964,0.000021911741,0.000025965384,0.000028656079,0.95197535,0.00078236987,0.013976858,0.0007347204,0.03181576],"study_design_scores_gemma":[0.000005987827,0.000015146827,0.000039530707,0.0000016454234,0.000002902242,0.000004846654,0.0000031811849,0.9945634,0.000104998224,0.0051192115,0.00013757865,0.0000017066674],"about_ca_topic_score_codex":0.003265954,"about_ca_topic_score_gemma":0.00217343,"teacher_disagreement_score":0.003265954,"about_ca_system_score_codex":0.0007349538,"about_ca_system_score_gemma":0.0006319399,"threshold_uncertainty_score":0.007072985},"labels":[],"label_agreement":null},{"id":"W1989857303","doi":"10.1109/icc.2013.6654762","title":"Online heuristics for monetary-based courier relaying in RFID-Sensor Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Network packet; Computer network; Heuristics; Relay; Wireless; Transmission (telecommunications); Telecommunications","score_opus":0.015512855830375696,"score_gpt":0.2379998679691362,"score_spread":0.2224870121387605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989857303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076004684,0.0004226638,0.91356325,0.00062704284,0.00006493708,0.00025679264,0.00009066274,0.00018343936,0.008786631],"genre_scores_gemma":[0.8714729,0.00037489602,0.12401119,0.00013281555,0.00003989642,0.0001847695,0.000061024784,0.000054611875,0.003668012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983784,0.0009824326,0.000078300334,0.00017664951,0.0001735109,0.00021064172],"domain_scores_gemma":[0.99030745,0.007831963,0.0007717314,0.0003167194,0.00034911744,0.00042303203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030828565,0.0011263406,0.0010119231,0.00071136723,0.0006439335,0.0017231102,0.0017027232,0.0015252184,0.0033507037],"category_scores_gemma":[0.011820766,0.0005259986,0.00058519567,0.0006777194,0.0016390379,0.0028171048,0.0011823744,0.0014734322,0.00029458728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012852195,0.00009506049,0.00033306438,0.000097442855,0.000027508277,0.00011909664,0.00016265702,0.89452124,0.00092328293,0.091826186,0.00086981617,0.010896142],"study_design_scores_gemma":[0.00003258293,0.00007740746,0.00006968049,0.000014388972,0.000010560128,0.000031619067,0.00005220476,0.96212584,0.00036851404,0.036451586,0.00075127656,0.000014281967],"about_ca_topic_score_codex":0.002400647,"about_ca_topic_score_gemma":0.0024498564,"teacher_disagreement_score":0.0033507037,"about_ca_system_score_codex":0.0023827688,"about_ca_system_score_gemma":0.0014165686,"threshold_uncertainty_score":0.017288268},"labels":[],"label_agreement":null},{"id":"W1990063189","doi":"10.1007/s11277-006-9096-8","title":"Dropping Rate Reduction in Hybrid WLAN/Cellular Systems by Mobile Ad Hoc Relaying","year":2006,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Reduction (mathematics); Mobile ad hoc network; Vehicular ad hoc network; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.015193458017372059,"score_gpt":0.23754112650882356,"score_spread":0.2223476684914515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990063189","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59821707,0.001307344,0.39122972,0.00017747536,0.00010348216,0.00005919392,0.00009741685,0.0012338127,0.007574528],"genre_scores_gemma":[0.9844907,0.00026596533,0.013570236,0.000035069093,0.000045522615,0.000014277792,0.000051087067,0.00004420762,0.001482915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938595,0.00015553515,0.000027683582,0.00005052705,0.00022079791,0.00015962175],"domain_scores_gemma":[0.9974354,0.0014913541,0.00014059036,0.00030193932,0.0005549586,0.00007588724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010473566,0.00082030287,0.00092777645,0.0008419064,0.0006919348,0.0011032552,0.0009460966,0.0006165783,0.0014398161],"category_scores_gemma":[0.002771684,0.00042838464,0.0003195632,0.00089068874,0.0005570042,0.0006656338,0.00065975107,0.0005115248,0.00047182114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022343255,0.0005540399,0.009343003,0.00024490198,0.00023427936,0.0010605127,0.00062283414,0.42048672,0.33273086,0.010911479,0.0021060363,0.21947102],"study_design_scores_gemma":[0.000052738946,0.00040514077,0.0021133055,0.000009352785,0.00018806382,0.0004559162,0.00008783486,0.96214706,0.031738628,0.0018696787,0.00090401457,0.00002821311],"about_ca_topic_score_codex":0.0024079278,"about_ca_topic_score_gemma":0.003504266,"teacher_disagreement_score":0.0024079278,"about_ca_system_score_codex":0.00074567646,"about_ca_system_score_gemma":0.00043425508,"threshold_uncertainty_score":0.005539},"labels":[],"label_agreement":null},{"id":"W1990105444","doi":"10.1016/j.adhoc.2006.05.017","title":"An overlay approach to data security in ad-hoc networks","year":2006,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Overlay; Overlay network; Vehicular ad hoc network; Overhead (engineering); Key management; Encryption; Adaptive quality of service multi-hop routing; Node (physics); Key (lock); Network layer; Optimized Link State Routing Protocol; Distributed computing; Layer (electronics); Computer security; Wireless; Routing protocol; Telecommunications; The Internet; Engineering; Operating system; Routing (electronic design automation)","score_opus":0.015957487558177445,"score_gpt":0.24971047214340436,"score_spread":0.23375298458522692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990105444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00852577,0.0026883218,0.97780114,0.0013033368,0.00028931332,0.00009929348,0.000067984365,0.00030388933,0.00892087],"genre_scores_gemma":[0.53285855,0.010548543,0.4419339,0.00037857099,0.00097280403,0.00026322532,0.0001865545,0.00014275462,0.012715053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981906,0.00057976006,0.00013664349,0.00020518916,0.00074593606,0.00014191869],"domain_scores_gemma":[0.9971908,0.0013095029,0.00013714732,0.00070928846,0.00049580104,0.00015750101],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019461439,0.00055635686,0.0008985324,0.0013483396,0.0017230781,0.002865805,0.0017372038,0.0015939979,0.0025667627],"category_scores_gemma":[0.0060563935,0.0004523137,0.00059013866,0.0020760905,0.0021922614,0.0073319036,0.0030493857,0.0021668947,0.0006068514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121725396,0.00006928221,0.000544716,0.00032767677,0.00006732259,0.00031269254,0.0005248972,0.04994624,0.005917652,0.8159658,0.0058521708,0.12034992],"study_design_scores_gemma":[0.000040728894,0.00015316605,0.00029525644,0.00009207679,0.00011061193,0.00057081593,0.0003689289,0.31103507,0.0050948253,0.62312156,0.05907262,0.000044341774],"about_ca_topic_score_codex":0.001261935,"about_ca_topic_score_gemma":0.0013389533,"teacher_disagreement_score":0.002865805,"about_ca_system_score_codex":0.0011352191,"about_ca_system_score_gemma":0.0011093069,"threshold_uncertainty_score":0.010292351},"labels":[],"label_agreement":null},{"id":"W1990241714","doi":"10.1007/s11276-010-0255-1","title":"RADAR: A reputation-driven anomaly detection system for wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Intrusion detection system; Wireless mesh network; Anomaly detection; Backup; Computer network; Constant false alarm rate; Radar; Wireless network; Wireless; Node (physics); Real-time computing; Telecommunications; Data mining; Artificial intelligence","score_opus":0.007287493965365962,"score_gpt":0.21761641567659964,"score_spread":0.21032892171123369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990241714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03328407,0.0006545068,0.8818712,0.00045644442,0.00044634164,0.0003147362,0.00072151574,0.07987327,0.0023778828],"genre_scores_gemma":[0.5885479,0.00041175907,0.40079823,0.00044489026,0.0003979749,0.0003164712,0.0020035678,0.0014405389,0.005638733],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827516,0.0003653886,0.00015160318,0.00037794985,0.0007113604,0.00011854446],"domain_scores_gemma":[0.9941195,0.0019905153,0.00074663054,0.0014041775,0.0013532825,0.00038599348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029179356,0.0009888159,0.0016064714,0.0024021594,0.0005711934,0.0013211268,0.0032724396,0.0013692492,0.002763214],"category_scores_gemma":[0.010297351,0.0004954847,0.0003975351,0.001101439,0.00042835236,0.0031836622,0.0019701885,0.0013553585,0.0016830099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024242674,0.00075817446,0.010727707,0.00036065475,0.00052440393,0.00045642973,0.00019217592,0.05246728,0.049010456,0.0077567273,0.054847,0.8204748],"study_design_scores_gemma":[0.00012925222,0.00032523053,0.0016870399,0.000013258115,0.00007796464,0.0003278411,0.00002449007,0.9684369,0.017955722,0.0046618655,0.006287958,0.00007254155],"about_ca_topic_score_codex":0.0014036737,"about_ca_topic_score_gemma":0.0015625309,"teacher_disagreement_score":0.0032724396,"about_ca_system_score_codex":0.00058115675,"about_ca_system_score_gemma":0.0006846824,"threshold_uncertainty_score":0.015431702},"labels":[],"label_agreement":null},{"id":"W1990417591","doi":"10.1007/s12083-015-0345-z","title":"Energy-efficient routing over coordinated sleep scheduling in wireless ad hoc networks","year":2015,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Distributed computing; Wireless Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Routing protocol; Routing (electronic design automation)","score_opus":0.017357168115842543,"score_gpt":0.25704727503097685,"score_spread":0.23969010691513432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990417591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15560903,0.0040483163,0.8335369,0.0006176028,0.0003889103,0.00006808425,0.00009097309,0.0006597992,0.0049802978],"genre_scores_gemma":[0.9734623,0.0005836132,0.024286432,0.000046062534,0.00009435559,0.000025135407,0.000040878556,0.00004155542,0.0014195351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961036,0.00013456254,0.000022167795,0.00005523099,0.000105317,0.00007237544],"domain_scores_gemma":[0.9990056,0.0005678051,0.000112373265,0.000093060546,0.00016204342,0.000059055033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009690569,0.00041493037,0.0006836411,0.000609226,0.00061502267,0.0009101645,0.0008801713,0.00036961376,0.00068432395],"category_scores_gemma":[0.0021325417,0.00031309784,0.00021974587,0.0007645214,0.00048301107,0.0009260851,0.0006136874,0.00035826516,0.00011490576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046358342,0.00012567425,0.001263891,0.00014281111,0.00009327274,0.0001275819,0.0001535826,0.8245718,0.014132713,0.02979984,0.0033326577,0.1257926],"study_design_scores_gemma":[0.000020769176,0.00008171964,0.00035725377,0.0000061365936,0.000025811396,0.000042685213,0.000044240693,0.9878889,0.0015494779,0.009139527,0.0008345166,0.000009037783],"about_ca_topic_score_codex":0.0022227417,"about_ca_topic_score_gemma":0.0050793863,"teacher_disagreement_score":0.0022227417,"about_ca_system_score_codex":0.00063432223,"about_ca_system_score_gemma":0.0009414752,"threshold_uncertainty_score":0.0051249266},"labels":[],"label_agreement":null},{"id":"W1991133116","doi":"10.1109/wowmom.2007.4351712","title":"Generating Random Graphs for Wireless Actuator Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless sensor network; Node (physics); Degree (music); Actuator; Wireless ad hoc network; Random graph; Graph; Computer network; Topology (electrical circuits); Algorithm; Wireless; Theoretical computer science; Mathematics; Engineering; Combinatorics; Artificial intelligence","score_opus":0.011508941803643256,"score_gpt":0.24306802406148684,"score_spread":0.23155908225784358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991133116","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042917915,0.00026830926,0.95371944,0.00027632888,0.00004124057,0.00017993123,0.000216844,0.0003842979,0.001995763],"genre_scores_gemma":[0.49056226,0.0010430437,0.50072795,0.00029437692,0.00010933231,0.00096738065,0.0014290266,0.00027104997,0.0045955484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988795,0.00057472487,0.00003844872,0.00018706085,0.00024956497,0.00007069179],"domain_scores_gemma":[0.99241614,0.005676566,0.0005636184,0.00078182004,0.00041890037,0.00014292753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011600289,0.0005742868,0.0005435381,0.0013641553,0.00063673686,0.0007054251,0.0009091469,0.00075567164,0.0018554758],"category_scores_gemma":[0.01000807,0.00040808416,0.00073466776,0.0009864466,0.00083879905,0.0016365842,0.0007855357,0.000766459,0.00040284605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008408369,0.000068575035,0.0012498314,0.00015791906,0.00005346755,0.00019831002,0.0001948241,0.76712424,0.0032055466,0.18708393,0.002824612,0.037754655],"study_design_scores_gemma":[0.000034894103,0.00005542624,0.000326884,0.0000149284415,0.000014903704,0.00013035623,0.000050215032,0.8776077,0.0011924403,0.11733055,0.003225714,0.000016015103],"about_ca_topic_score_codex":0.0011647058,"about_ca_topic_score_gemma":0.0013531445,"teacher_disagreement_score":0.0018554758,"about_ca_system_score_codex":0.000820308,"about_ca_system_score_gemma":0.0004846504,"threshold_uncertainty_score":0.006207168},"labels":[],"label_agreement":null},{"id":"W1991586137","doi":"10.1016/j.adhoc.2011.12.001","title":"Decomposing broadcast algorithms using abstract MAC layers","year":2011,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Probabilistic logic; Randomized algorithm; Algorithm; Node (physics); Layer (electronics); Upper and lower bounds; Probabilistic analysis of algorithms; Graph; Message passing; Broadcasting (networking); Physical layer; Computer network; Wireless; Theoretical computer science; Distributed computing; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.043519398581772166,"score_gpt":0.2606728368978957,"score_spread":0.21715343831612355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991586137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009963579,0.0004968767,0.9860671,0.0002824729,0.00006421883,0.000110315515,0.00002661227,0.00034889,0.002639909],"genre_scores_gemma":[0.40264466,0.0013565678,0.5916352,0.00065500214,0.00039376927,0.0005620402,0.00021080005,0.0003028402,0.0022390713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99083835,0.0031933307,0.00067116495,0.0010710241,0.0030882065,0.0011380119],"domain_scores_gemma":[0.982051,0.010413445,0.001196133,0.004496549,0.0014956155,0.00034728847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066011907,0.0017900792,0.0015376147,0.001718771,0.0010214307,0.0041254745,0.003077685,0.0016655037,0.0018709414],"category_scores_gemma":[0.017350176,0.0012901274,0.0018353699,0.0016245509,0.0030068464,0.01048685,0.004687205,0.0047188574,0.0005609147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004642063,0.0001685675,0.0012843527,0.00044864413,0.0001623393,0.00012318627,0.00053553074,0.45503795,0.012952094,0.424088,0.0031239449,0.101611175],"study_design_scores_gemma":[0.000054089152,0.00011737645,0.00014862104,0.00003992154,0.00006842728,0.000057134217,0.00005943291,0.87181544,0.0041307015,0.11968861,0.0037884288,0.00003183858],"about_ca_topic_score_codex":0.0016987644,"about_ca_topic_score_gemma":0.0013266028,"teacher_disagreement_score":0.0066011907,"about_ca_system_score_codex":0.0028895757,"about_ca_system_score_gemma":0.002821593,"threshold_uncertainty_score":0.034910798},"labels":[],"label_agreement":null},{"id":"W1991623709","doi":"10.1145/2642687.2642692","title":"Trust-aware opportunistic routing protocol for wireless networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Routing protocol; Network packet; Forwarder; Dynamic Source Routing; Wireless Routing Protocol; Geographic routing; Packet forwarding; Link-state routing protocol; Wireless network; Wireless; Distributed computing; Telecommunications","score_opus":0.029553729183569636,"score_gpt":0.2863653893008407,"score_spread":0.2568116601172711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991623709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011546259,0.005534013,0.96535206,0.0011165199,0.00065341376,0.00047989443,0.00025816224,0.0009710225,0.01408871],"genre_scores_gemma":[0.7059614,0.008114313,0.26984674,0.0006402724,0.00038721226,0.0014236196,0.00079072284,0.00010963274,0.0127260955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933165,0.00021882533,0.00006529022,0.000057398927,0.0002651663,0.00006167592],"domain_scores_gemma":[0.99898225,0.00045936086,0.00015567262,0.00011977933,0.00020726905,0.000075710486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077424024,0.00044733952,0.00060006574,0.00055008783,0.00092653534,0.0009623101,0.0009765434,0.0007376865,0.0008383815],"category_scores_gemma":[0.0023687389,0.00017434606,0.00032239346,0.000982305,0.00058679696,0.0014090885,0.001035807,0.0008833909,0.00037555673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040579063,0.00017121261,0.0017756649,0.0017845102,0.00028182272,0.0028158296,0.0009864086,0.12856515,0.040519398,0.32602772,0.039961763,0.45670488],"study_design_scores_gemma":[0.00012246119,0.0003589967,0.0011991308,0.00025535983,0.00018231131,0.0026534058,0.00044447713,0.6384052,0.008532896,0.18413143,0.16354257,0.00017184022],"about_ca_topic_score_codex":0.0015247856,"about_ca_topic_score_gemma":0.002192101,"teacher_disagreement_score":0.0015247856,"about_ca_system_score_codex":0.00062579056,"about_ca_system_score_gemma":0.0012747707,"threshold_uncertainty_score":0.0045404434},"labels":[],"label_agreement":null},{"id":"W1991971210","doi":"10.1109/mascots.2014.64","title":"Opportunistic Routing in Wireless Multi-hop Networks: A Tutorial","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Forwarder; Computer network; Computer science; Network packet; Hop (telecommunications); Wireless; Geographic routing; Source routing; Wireless network; Routing protocol; Distributed computing; Routing table; Link-state routing protocol; Telecommunications","score_opus":0.0203019097710801,"score_gpt":0.24479521580782293,"score_spread":0.22449330603674283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991971210","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011367308,0.8898502,0.06791401,0.0018514795,0.0047985,0.00013081533,0.00015761112,0.00029815012,0.03386252],"genre_scores_gemma":[0.012751876,0.9019238,0.052391946,0.0013513278,0.009352009,0.00021002933,0.0003766971,0.000131429,0.02151096],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999668,0.000071494156,0.000023825782,0.00006129852,0.00014302984,0.00003237597],"domain_scores_gemma":[0.9996319,0.00023763189,0.000022870221,0.000019104413,0.000059778577,0.000028619013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056301785,0.0016838915,0.001072927,0.0012911563,0.00045611238,0.0018472212,0.0011839167,0.0019456919,0.005706286],"category_scores_gemma":[0.00076106394,0.00051615713,0.0005837073,0.0030575842,0.000655931,0.0037409714,0.0008174314,0.0023011346,0.004187009],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069094705,0.00025895113,0.00038515794,0.004894603,0.000072528404,0.00038824562,0.00025044536,0.012584931,0.0028621964,0.113992155,0.14350897,0.7207327],"study_design_scores_gemma":[0.00001250408,0.00016447852,0.00061346503,0.001496753,0.000050694387,0.0010341285,0.000087584114,0.012610116,0.0005459446,0.048911147,0.9344147,0.00005852186],"about_ca_topic_score_codex":0.0009015163,"about_ca_topic_score_gemma":0.0008257763,"teacher_disagreement_score":0.005706286,"about_ca_system_score_codex":0.00074887095,"about_ca_system_score_gemma":0.00069670123,"threshold_uncertainty_score":0.0190894},"labels":[],"label_agreement":null},{"id":"W1992330282","doi":"10.1016/j.adhoc.2011.10.002","title":"Multicast with cooperative gateways in multi-channel wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Simon Fraser University","funders":"","keywords":"Multicast; Computer network; Wireless mesh network; Computer science; Channel (broadcasting); Source-specific multicast; Protocol Independent Multicast; Wireless network; Wireless; Distributed computing; Telecommunications","score_opus":0.029663942456499014,"score_gpt":0.23525406137479662,"score_spread":0.20559011891829762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992330282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1782553,0.0015963973,0.81457275,0.0005431895,0.0001662045,0.00008941621,0.00005257947,0.00054148375,0.00418274],"genre_scores_gemma":[0.92937154,0.00040119005,0.06800649,0.00008653957,0.000117719515,0.00007225495,0.00005406818,0.000034286244,0.0018558148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902344,0.00043943652,0.000047323236,0.000108023254,0.00025231228,0.00012947187],"domain_scores_gemma":[0.9966192,0.00228978,0.0002059027,0.00041885505,0.0003266361,0.00013966502],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026731216,0.000379091,0.0009124229,0.0008367893,0.0009646532,0.00092792016,0.0013287744,0.0011125798,0.0008935401],"category_scores_gemma":[0.0047221393,0.00055774,0.00040255315,0.00088862295,0.0008302116,0.0020495553,0.0019372313,0.0007188894,0.00018555913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013702775,0.00042512763,0.004600186,0.00031778248,0.00017663835,0.00093652494,0.0012250881,0.6235994,0.031369343,0.1362982,0.0051511084,0.19453035],"study_design_scores_gemma":[0.00006261561,0.00017012931,0.0003594363,0.000014071641,0.000049286067,0.00015461862,0.00012301421,0.9601433,0.0031604692,0.034195334,0.0015514637,0.000016290294],"about_ca_topic_score_codex":0.0007192392,"about_ca_topic_score_gemma":0.0010721969,"teacher_disagreement_score":0.0026731216,"about_ca_system_score_codex":0.00056765025,"about_ca_system_score_gemma":0.00040211153,"threshold_uncertainty_score":0.01413697},"labels":[],"label_agreement":null},{"id":"W1992405447","doi":"10.1504/ijahuc.2007.011600","title":"New hierarchical approach to reactive routing protocols for wireless ad hoc networks with cross-layer design","year":2006,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Distributed computing; Dynamic Source Routing; Zone Routing Protocol; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Hierarchical routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.024139021160758327,"score_gpt":0.299834536240636,"score_spread":0.27569551507987766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992405447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093747245,0.0014927088,0.99376845,0.00015805823,0.00029205548,0.00013025157,0.000030415467,0.00074654695,0.0024440065],"genre_scores_gemma":[0.06226829,0.0026372583,0.9272666,0.0005258991,0.00039633625,0.0006958134,0.00023895215,0.00015138485,0.005819449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846387,0.0003390546,0.00017224482,0.0001766621,0.0007461962,0.00010197551],"domain_scores_gemma":[0.99885607,0.0002769347,0.00013812014,0.00024720645,0.0004061281,0.00007556352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019208329,0.0009251702,0.00067860004,0.000928269,0.00077383127,0.0015612489,0.0027467741,0.0010240342,0.0016416493],"category_scores_gemma":[0.0018569521,0.000613502,0.00084163685,0.0008495018,0.0010052171,0.0024502166,0.001513648,0.0021661741,0.0009363814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013308281,0.00017438155,0.00067215296,0.0012625449,0.0002817359,0.00059820904,0.0007927095,0.07399824,0.05179066,0.47438705,0.018629652,0.37727958],"study_design_scores_gemma":[0.00010952345,0.00062777323,0.0005802848,0.00021195968,0.00035754673,0.0012367786,0.00016100102,0.6012023,0.019540725,0.16131757,0.2144628,0.00019175312],"about_ca_topic_score_codex":0.0011343121,"about_ca_topic_score_gemma":0.0017645479,"teacher_disagreement_score":0.0027467741,"about_ca_system_score_codex":0.00084810617,"about_ca_system_score_gemma":0.0010913361,"threshold_uncertainty_score":0.010158479},"labels":[],"label_agreement":null},{"id":"W1992920697","doi":"10.1109/ccece.2006.277584","title":"Spécification et Définition de Scénarios Pour Les Réseaux Ad Hoc : Application au Domaine Militaire","year":2006,"lang":"fr","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobility model; Distributed computing; Telecommunications","score_opus":0.02196484970975397,"score_gpt":0.2652695942911333,"score_spread":0.24330474458137932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992920697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008090405,0.0001696023,0.9869314,0.00016388843,0.000024705725,0.00020398405,0.0002770706,0.00075075106,0.0033880787],"genre_scores_gemma":[0.155074,0.0007298393,0.8387172,0.000104396335,0.000034736826,0.00081606023,0.0013840186,0.00029486287,0.0028447956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972982,0.0013512739,0.00025587596,0.00021778254,0.0007030368,0.00017394993],"domain_scores_gemma":[0.99767154,0.0013560225,0.00019577748,0.0003009743,0.00036554833,0.00011004653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026993554,0.0012211406,0.0005694263,0.0012144956,0.000864014,0.003094179,0.0016118813,0.0017823321,0.0024515453],"category_scores_gemma":[0.0062186634,0.000833803,0.0013598935,0.00088637567,0.0014733053,0.0022950592,0.0014172473,0.0020982958,0.0009154389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096131684,0.000101993865,0.0027273884,0.000418961,0.00005719602,0.0010754309,0.0013471841,0.36887726,0.008185353,0.55209744,0.0039839717,0.061031688],"study_design_scores_gemma":[0.00005011537,0.000094708725,0.00034736755,0.00027060273,0.000029080524,0.0007225259,0.00037349996,0.81604344,0.0107908035,0.08505331,0.08615784,0.00006671183],"about_ca_topic_score_codex":0.0034193697,"about_ca_topic_score_gemma":0.0034579507,"teacher_disagreement_score":0.0034193697,"about_ca_system_score_codex":0.00086545554,"about_ca_system_score_gemma":0.0013207344,"threshold_uncertainty_score":0.01427573},"labels":[],"label_agreement":null},{"id":"W1993027189","doi":"10.1109/icces.2007.4447017","title":"Message security in mobile ad-hoc networks: Using trust-based multi-path routing approach","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Routing (electronic design automation); Optimized Link State Routing Protocol; Path (computing); Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Routing protocol; Distributed computing; Computer security; Telecommunications; Wireless","score_opus":0.01994637475459959,"score_gpt":0.26495275822709724,"score_spread":0.24500638347249765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993027189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010743905,0.0010619222,0.98542136,0.00042369362,0.00007367748,0.00008214396,0.000013915052,0.00026554306,0.0019139104],"genre_scores_gemma":[0.58430046,0.0018999882,0.41071892,0.00014100243,0.00012435307,0.00014832005,0.00006334179,0.000062048144,0.0025415244],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.0006298299,0.00010447359,0.00016646883,0.0005362218,0.000096954114],"domain_scores_gemma":[0.9986634,0.0005790625,0.00017969133,0.00024662455,0.00026345896,0.00006777817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014294847,0.00059548765,0.0006574362,0.0009802525,0.0007058978,0.0016575743,0.0011687257,0.0011124765,0.0006489188],"category_scores_gemma":[0.0028817013,0.0002954708,0.0006812305,0.0007412791,0.00094747636,0.0038137767,0.0014149238,0.00097035227,0.00030709387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003017456,0.0001703942,0.001941813,0.0006542806,0.0002922405,0.0012052426,0.0012276516,0.3521982,0.036805276,0.2145158,0.0044412906,0.38624603],"study_design_scores_gemma":[0.000033937104,0.0002300239,0.00029288064,0.00006709102,0.000093142844,0.00061800313,0.0001664819,0.91714126,0.00864112,0.062113147,0.010538787,0.00006409543],"about_ca_topic_score_codex":0.00083096145,"about_ca_topic_score_gemma":0.0007525058,"teacher_disagreement_score":0.0016575743,"about_ca_system_score_codex":0.0008077145,"about_ca_system_score_gemma":0.0006579897,"threshold_uncertainty_score":0.0075598955},"labels":[],"label_agreement":null},{"id":"W1993549324","doi":"10.1109/twc.2012.121412.120635","title":"Cross-Layer Schemes for Reducing Delay in Multihop Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Distributed computing; Static routing; Equal-cost multi-path routing; Network packet; Routing protocol; Mathematical optimization; Mathematics","score_opus":0.0417671919760906,"score_gpt":0.31506698269175415,"score_spread":0.27329979071566357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993549324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023933617,0.0018482864,0.97099835,0.00017217222,0.00009287339,0.00008327706,0.00003415354,0.000383414,0.0024538436],"genre_scores_gemma":[0.7245428,0.0020241872,0.2701898,0.0002489935,0.00011274714,0.00018971371,0.00009383874,0.000111451016,0.002486606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992287,0.0002335975,0.000052817788,0.00009936504,0.00028427283,0.000101346195],"domain_scores_gemma":[0.9989052,0.0004943826,0.00020614425,0.00016294216,0.00018162039,0.00004974581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017810506,0.0009846387,0.0005131603,0.00047070955,0.00053286075,0.00081478077,0.0011592777,0.00059655134,0.0016690984],"category_scores_gemma":[0.002722518,0.00032798556,0.00049575587,0.0006899488,0.00056377717,0.0012706848,0.0014585048,0.00080593844,0.00029961206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013969494,0.00012955982,0.000638555,0.0002896109,0.00009774951,0.00011377097,0.00014708603,0.8223733,0.025912464,0.033526625,0.0016808921,0.11495063],"study_design_scores_gemma":[0.00003083162,0.00016485051,0.0002307338,0.000019221501,0.000055926208,0.000076811324,0.000025826954,0.98126525,0.007180835,0.0077391104,0.0031924122,0.000018176523],"about_ca_topic_score_codex":0.0013753951,"about_ca_topic_score_gemma":0.0019436522,"teacher_disagreement_score":0.0017810506,"about_ca_system_score_codex":0.0007672456,"about_ca_system_score_gemma":0.0009929177,"threshold_uncertainty_score":0.009419203},"labels":[],"label_agreement":null},{"id":"W1994294998","doi":"10.1145/1998476.1998486","title":"Energy efficient data gathering in multi-hop hierarchical wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"U.S. Air Force","keywords":"Wireless ad hoc network; Base station; Computer science; Computer network; Hop (telecommunications); Data collection; Wireless sensor network; Wireless; Vehicular ad hoc network; Wireless network; Data aggregator; Ad hoc wireless distribution service; Transmission (telecommunications); Distributed computing; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.05071004359691867,"score_gpt":0.2541661176612482,"score_spread":0.20345607406432953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994294998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06685797,0.0072870855,0.9185283,0.00064477883,0.00011403556,0.00008887393,0.00010148764,0.0002511613,0.0061263186],"genre_scores_gemma":[0.880498,0.0046138307,0.11066433,0.00012313343,0.00013417668,0.00010389137,0.00013520273,0.000054992004,0.0036725795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994838,0.00019112289,0.000026126952,0.000061780214,0.00018305205,0.000054193017],"domain_scores_gemma":[0.9990951,0.00061687874,0.00009964667,0.00007403417,0.000079611884,0.000034774315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082599546,0.0004465607,0.00052446057,0.00062357786,0.00058634556,0.00063517794,0.00075153477,0.00058766955,0.00071796856],"category_scores_gemma":[0.0020328755,0.00027611418,0.00022805677,0.0010370229,0.00063418865,0.001727591,0.0009445407,0.00034494593,0.00022485714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012493833,0.00007596417,0.0009144848,0.00054709334,0.00005399514,0.00025005414,0.00024483094,0.824758,0.013713758,0.04283682,0.0024689913,0.11401101],"study_design_scores_gemma":[0.00002665471,0.00012642356,0.0007113046,0.00003151719,0.00001947658,0.00013353322,0.00012669465,0.95603526,0.0032464808,0.03485422,0.0046692896,0.000019105262],"about_ca_topic_score_codex":0.000744296,"about_ca_topic_score_gemma":0.0010501667,"teacher_disagreement_score":0.00082599546,"about_ca_system_score_codex":0.00041987398,"about_ca_system_score_gemma":0.0003143966,"threshold_uncertainty_score":0.004368365},"labels":[],"label_agreement":null},{"id":"W1994608780","doi":"10.1145/2810379.2810386","title":"On the Effect of Black-hole Attack on Opportunistic Routing Protocols","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Link-state routing protocol; Packet drop attack; Dynamic Source Routing; Static routing; Routing protocol; Multipath routing; Zone Routing Protocol; Wireless Routing Protocol; Network packet; Distributed computing","score_opus":0.0730564773320043,"score_gpt":0.32516597082088244,"score_spread":0.2521094934888781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994608780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43002996,0.005503623,0.52167225,0.0019791352,0.00045985496,0.0003772501,0.00014381854,0.00048928434,0.039344814],"genre_scores_gemma":[0.9842672,0.0017784197,0.012465354,0.00014810952,0.000054550605,0.000045368495,0.000022560916,0.000029957531,0.0011884489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743927,0.0012546108,0.000086602995,0.00014953356,0.0007712586,0.00029880725],"domain_scores_gemma":[0.9822894,0.0136574665,0.0014897654,0.0010026767,0.0013672211,0.00019350843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002054076,0.0007088448,0.0006797292,0.0009219223,0.0008232398,0.0011842698,0.0007448984,0.0008069109,0.0012899904],"category_scores_gemma":[0.011778064,0.00028277666,0.0005860282,0.0006655941,0.0012816357,0.00243024,0.0011055171,0.0009796415,0.00018220671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003740156,0.00020008504,0.004039769,0.00031219106,0.00014638645,0.00080710626,0.00025709634,0.8718641,0.014422144,0.0690165,0.0017131882,0.036847416],"study_design_scores_gemma":[0.000012408317,0.0002550217,0.0007263133,0.000050587056,0.00007704313,0.00042454884,0.00010812767,0.98085326,0.0045947856,0.011517135,0.0013523675,0.000028369353],"about_ca_topic_score_codex":0.0018113229,"about_ca_topic_score_gemma":0.0015461656,"teacher_disagreement_score":0.002054076,"about_ca_system_score_codex":0.0011516041,"about_ca_system_score_gemma":0.00092795375,"threshold_uncertainty_score":0.010863125},"labels":[],"label_agreement":null},{"id":"W1994988309","doi":"10.1109/wons.2013.6578335","title":"The analysis of the additive-increase multiplicative-decrease MAC protocol","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Multiplicative function; Network packet; Protocol (science); Wireless; Set (abstract data type); Throughput; Exploit; Wireless network; Distributed computing; Mathematics; Telecommunications; Computer security","score_opus":0.008350623229338747,"score_gpt":0.2525801096197599,"score_spread":0.24422948639042116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994988309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070328955,0.0018504295,0.9693825,0.00067700166,0.00023506924,0.0002783095,0.00010970857,0.00025112927,0.020182975],"genre_scores_gemma":[0.6332141,0.005900796,0.33682746,0.0010004898,0.0007850277,0.0012833154,0.00038110852,0.0002702044,0.02033747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980757,0.0003985071,0.000087726505,0.00021272243,0.0010330573,0.00019223076],"domain_scores_gemma":[0.99762434,0.0009960085,0.00023388753,0.00033379134,0.0007500907,0.000061929706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015017593,0.00095118576,0.0007005415,0.0012179676,0.00088225777,0.0020226461,0.0020690518,0.0008833686,0.0034686478],"category_scores_gemma":[0.006502344,0.00043971068,0.0007261937,0.0012564379,0.0010813469,0.0027268713,0.0016766064,0.0016357548,0.0011628468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021419504,0.00009865198,0.0009766696,0.00048294966,0.00009184071,0.00056460843,0.00034009042,0.23169208,0.019990832,0.6436082,0.0097608445,0.09217907],"study_design_scores_gemma":[0.00001851356,0.00014361035,0.00028320696,0.000058969617,0.00005525115,0.0006317981,0.000047618156,0.89494294,0.0050438233,0.07737491,0.021359371,0.000039924358],"about_ca_topic_score_codex":0.0015604738,"about_ca_topic_score_gemma":0.00090264494,"teacher_disagreement_score":0.0034686478,"about_ca_system_score_codex":0.0012145824,"about_ca_system_score_gemma":0.0016806129,"threshold_uncertainty_score":0.011603832},"labels":[],"label_agreement":null},{"id":"W1995242280","doi":"10.1109/ccece.2010.5575141","title":"Fast authentication for mobile clients in wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Roaming; Computer network; Wireless mesh network; Authentication protocol; Authentication server; Authentication (law); Lightweight Extensible Authentication Protocol; Wireless network; IEEE 802.11s; Switched mesh; Mesh networking; Computer security; Wireless; Telecommunications","score_opus":0.008602687348397586,"score_gpt":0.2492581917189363,"score_spread":0.2406555043705387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995242280","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08563255,0.0010426305,0.90592974,0.0006654225,0.00016068041,0.00022960962,0.00006647254,0.0015226945,0.004750051],"genre_scores_gemma":[0.88413656,0.00060728175,0.109562226,0.00011515883,0.00014357684,0.00021820338,0.00015292046,0.00008954016,0.004974681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997509,0.0008756886,0.0001774227,0.0002043574,0.0009561757,0.0002773237],"domain_scores_gemma":[0.9964502,0.0013115031,0.0003959624,0.0011189597,0.000594319,0.00012917224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003081201,0.0005934437,0.00065537984,0.0008193345,0.0015366538,0.0017298079,0.0015996599,0.0016589677,0.0021339608],"category_scores_gemma":[0.008138681,0.0005202742,0.0004576299,0.00072752294,0.001343529,0.0059147915,0.0031781027,0.0015510095,0.0012922487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001755212,0.00023259442,0.008525004,0.00045836592,0.00011628374,0.0014550427,0.0020267726,0.13094732,0.08460556,0.4146617,0.009451686,0.34576455],"study_design_scores_gemma":[0.00010593371,0.00028689875,0.0007543991,0.00006685553,0.00005309675,0.0005301052,0.00031163037,0.8696901,0.021863371,0.093202315,0.013062704,0.00007254801],"about_ca_topic_score_codex":0.0012341975,"about_ca_topic_score_gemma":0.0008744193,"teacher_disagreement_score":0.003081201,"about_ca_system_score_codex":0.001113542,"about_ca_system_score_gemma":0.0009970602,"threshold_uncertainty_score":0.016295135},"labels":[],"label_agreement":null},{"id":"W1995517322","doi":"10.1155/2015/539048","title":"BandEst: Measurement-Based Available Bandwidth Estimation and Flow Admission Control Algorithm for Ad Hoc IEEE 802.15.4-Based Wireless Multimedia Networks","year":2015,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Bandwidth (computing); Admission control; Vehicular ad hoc network; Optimized Link State Routing Protocol; Algorithm; IEEE 802.11; Mobile ad hoc network; Wireless; Wireless network; Telecommunications; Quality of service; Network packet","score_opus":0.022408716352266347,"score_gpt":0.2507651398933453,"score_spread":0.22835642354107896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995517322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01334682,0.00054649485,0.9825209,0.00015998459,0.000092067006,0.00007944282,0.000026151209,0.0022450576,0.0009831693],"genre_scores_gemma":[0.4741613,0.00058426434,0.5222138,0.00018402726,0.00013244888,0.00027775418,0.00014223997,0.00013984868,0.0021643166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898547,0.00026468368,0.00005027287,0.00011626268,0.0004717952,0.000111431895],"domain_scores_gemma":[0.99874204,0.00055689807,0.00019134511,0.00015598319,0.0002944328,0.000059330643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002021275,0.000855094,0.0011929885,0.001128158,0.00064126635,0.0009458926,0.001991353,0.0006632544,0.00095306535],"category_scores_gemma":[0.0049812747,0.00039995453,0.00030656878,0.0006228378,0.00072679605,0.001575374,0.0013046899,0.00155472,0.00028671682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043500288,0.00029436222,0.0018898078,0.00014243933,0.00011669547,0.0000885176,0.00017573366,0.4175337,0.012760526,0.013044477,0.0050319023,0.5484869],"study_design_scores_gemma":[0.000016865446,0.000094070594,0.00024550396,0.000011514734,0.0000104198125,0.00004657245,0.000010956275,0.99052215,0.004887265,0.0020736943,0.0020626383,0.000018309014],"about_ca_topic_score_codex":0.0029904323,"about_ca_topic_score_gemma":0.002620288,"teacher_disagreement_score":0.0029904323,"about_ca_system_score_codex":0.00073175435,"about_ca_system_score_gemma":0.0011199072,"threshold_uncertainty_score":0.010689616},"labels":[],"label_agreement":null},{"id":"W1995539722","doi":"10.1109/surv.2013.081313.00039","title":"Scaling Laws for Throughput Capacity and Delay in Wireless Networks — A Survey","year":2013,"lang":"en","type":"article","venue":"IEEE Communications Surveys & Tutorials","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Throughput; Scaling law; Computer network; Wireless; Wireless network; Scaling; Telecommunications; Mathematics","score_opus":0.07393034978701164,"score_gpt":0.29849844025866595,"score_spread":0.22456809047165432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995539722","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025318982,0.5110932,0.35071394,0.0061601996,0.001708216,0.000096504504,0.00055594597,0.0006031411,0.10374997],"genre_scores_gemma":[0.39339238,0.5460511,0.044108573,0.0010857293,0.005096011,0.00032670546,0.000498743,0.00017419124,0.009266662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99925894,0.0001611946,0.00005963433,0.0001481916,0.00030575422,0.00006622275],"domain_scores_gemma":[0.99716824,0.0020350842,0.00014979948,0.0001645853,0.00043107476,0.00005128558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012365038,0.0007399614,0.00079524255,0.0021112864,0.0004778837,0.0021713504,0.00097243366,0.0011607076,0.003424557],"category_scores_gemma":[0.0045924555,0.00051723473,0.00042113123,0.0035405364,0.001392807,0.0039074374,0.00076365424,0.0022872493,0.0009502373],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004030296,0.00009792961,0.0017728138,0.0013433968,0.000041738018,0.00018503275,0.00021368734,0.037619624,0.0019879525,0.76033396,0.017107328,0.17925633],"study_design_scores_gemma":[0.000012596255,0.00011508844,0.0019080932,0.00082138495,0.000036667145,0.0008519201,0.00020593891,0.16113505,0.0017133032,0.66628677,0.16684331,0.000069745976],"about_ca_topic_score_codex":0.0012256749,"about_ca_topic_score_gemma":0.00036825018,"teacher_disagreement_score":0.003424557,"about_ca_system_score_codex":0.0017344855,"about_ca_system_score_gemma":0.0007658234,"threshold_uncertainty_score":0.012584567},"labels":[],"label_agreement":null},{"id":"W1995584062","doi":"10.1007/s11276-007-0041-x","title":"A framework for the multicast lifetime maximization problem in energy-constrained wireless ad-hoc networks","year":2007,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Northern British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Maximization; Source-specific multicast; Heuristic; Wireless ad hoc network; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Wireless; Mathematical optimization; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.01113469682837929,"score_gpt":0.24339754883967532,"score_spread":0.23226285201129604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995584062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014286248,0.0008419809,0.99342585,0.00046010813,0.00008176919,0.00003804006,0.00005968503,0.00007028405,0.0035936371],"genre_scores_gemma":[0.28687707,0.006632301,0.68863326,0.0005966791,0.0011735115,0.0007448407,0.0003566332,0.00033212538,0.014653627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848783,0.00071466883,0.0000618251,0.00019943401,0.00039486017,0.00014144917],"domain_scores_gemma":[0.99851376,0.0009733823,0.00009800282,0.000114594615,0.00020259595,0.00009767457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025261838,0.0015369429,0.0015535066,0.0011147158,0.0011989025,0.0024138016,0.0038589528,0.0025302798,0.003647196],"category_scores_gemma":[0.0053947745,0.0007956086,0.001244135,0.0024252683,0.0016665283,0.004272417,0.0026686483,0.0028754673,0.00083466584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003982108,0.0000717544,0.00016188389,0.00026523924,0.000047907575,0.00015010055,0.00018391002,0.3480598,0.0011661544,0.60662025,0.00742525,0.035807915],"study_design_scores_gemma":[0.000018411265,0.000031059164,0.00006159658,0.000039004204,0.000023377213,0.00007608446,0.000041788975,0.76157516,0.00024291645,0.22988892,0.007984218,0.000017430553],"about_ca_topic_score_codex":0.002604062,"about_ca_topic_score_gemma":0.0029829084,"teacher_disagreement_score":0.0038589528,"about_ca_system_score_codex":0.0017732135,"about_ca_system_score_gemma":0.0015110989,"threshold_uncertainty_score":0.013359845},"labels":[],"label_agreement":null},{"id":"W1996690138","doi":"10.1109/wcnc.2013.6554721","title":"Attainable throughput, delay and scalability for geographic routing on Smart Grid neighbor area networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scalability; Smart grid; Throughput; Routing protocol; Distributed computing; Routing (electronic design automation); Engineering; Wireless; Telecommunications","score_opus":0.01237345079554327,"score_gpt":0.22250613053027235,"score_spread":0.21013267973472907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996690138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6146438,0.0025347646,0.3676222,0.0006656057,0.00010060847,0.0001156116,0.00015848974,0.0008261133,0.0133327795],"genre_scores_gemma":[0.9873219,0.00035681334,0.0116928555,0.000020225987,0.000022037142,0.000028848237,0.000039113344,0.000014254598,0.0005038965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949515,0.00016079661,0.000020476635,0.000061166924,0.000154059,0.00010828452],"domain_scores_gemma":[0.9984681,0.0010743021,0.0001243754,0.00013346688,0.00016925152,0.000030490955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576007,0.00032151592,0.0003877102,0.00041148058,0.0004408449,0.0005969136,0.00039805312,0.00032347132,0.00075489754],"category_scores_gemma":[0.0035283589,0.00015729971,0.00013798421,0.00050243415,0.00048868696,0.0015170071,0.000526958,0.00031217115,0.00012482714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032309192,0.000081626735,0.0029223075,0.0001601697,0.00003263334,0.00024592856,0.00026458036,0.8443355,0.03271869,0.051167373,0.0018372806,0.06591081],"study_design_scores_gemma":[0.00001458448,0.00013333932,0.0005133788,0.000008140851,0.0000125231845,0.000107233245,0.000090144575,0.97976905,0.0066585504,0.011754334,0.0009273762,0.000011371388],"about_ca_topic_score_codex":0.0012197254,"about_ca_topic_score_gemma":0.0014934195,"teacher_disagreement_score":0.0012197254,"about_ca_system_score_codex":0.0007425924,"about_ca_system_score_gemma":0.0003632064,"threshold_uncertainty_score":0.0055931807},"labels":[],"label_agreement":null},{"id":"W1996719782","doi":"10.1142/s0219265907002107","title":"ENHANCED ROUTING METRIC FOR LOAD-BALANCING IN WIRELESS MESH NETWORKS","year":2007,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Computer science; Load balancing (electrical power); Computer network; Shared mesh; Distributed computing; Order One Network Protocol; Metrics; Dynamic Source Routing; Router; Routing protocol; Wireless network; Network packet; Wireless; Grid; Telecommunications; Mathematics","score_opus":0.010555558837438759,"score_gpt":0.2570016394685372,"score_spread":0.24644608063109846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996719782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03919786,0.0015891825,0.95449954,0.00025404157,0.0002628863,0.00013310327,0.00015967319,0.00059810077,0.0033057097],"genre_scores_gemma":[0.703637,0.0008076054,0.29243988,0.00012510053,0.0001738793,0.00021636348,0.0005518626,0.000094455245,0.0019538342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983675,0.000650625,0.00014542819,0.00015820866,0.0006121161,0.00006621575],"domain_scores_gemma":[0.99849796,0.0005021086,0.00022110176,0.0001402821,0.00058892975,0.000049581482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014712927,0.0007592823,0.0006451661,0.0012960322,0.00035137028,0.0007753847,0.0010275387,0.000581028,0.0009410461],"category_scores_gemma":[0.006304648,0.00012035583,0.00024954995,0.0016635933,0.0002762664,0.0018025829,0.00067341444,0.00046486064,0.00020460755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045230245,0.00013847591,0.002654529,0.00043680574,0.00014044894,0.00021005422,0.00010291342,0.58008903,0.04457346,0.049811676,0.005705881,0.31568435],"study_design_scores_gemma":[0.000019834071,0.00018252105,0.00063837174,0.0000119067145,0.000027909186,0.00015096531,0.000020186244,0.9798782,0.006945481,0.007460177,0.0046391427,0.0000252375],"about_ca_topic_score_codex":0.000629051,"about_ca_topic_score_gemma":0.0009130681,"teacher_disagreement_score":0.0014712927,"about_ca_system_score_codex":0.00085131614,"about_ca_system_score_gemma":0.00048780435,"threshold_uncertainty_score":0.0077810287},"labels":[],"label_agreement":null},{"id":"W1997269689","doi":"10.1109/iwcmc.2013.6583715","title":"Detecting attacks in QoS-OLSR protocol","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Optimized Link State Routing Protocol; Quality of service; Computer network; Spoofing attack; Protocol (science); Routing protocol; Routing (electronic design automation); Medicine","score_opus":0.014637451152450779,"score_gpt":0.26907487724365503,"score_spread":0.25443742609120423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997269689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5449671,0.00073004985,0.44889492,0.00033966597,0.00007209443,0.00023578492,0.00011564446,0.0018479467,0.0027967698],"genre_scores_gemma":[0.97574675,0.00015173269,0.023445314,0.00006277894,0.000014759554,0.00003103761,0.00006969895,0.000018510103,0.00045940155],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723226,0.0005948306,0.00017359143,0.0003560296,0.0014224197,0.00022091922],"domain_scores_gemma":[0.9938174,0.0029125642,0.0014400292,0.0007015766,0.0009714071,0.00015708801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001473019,0.00068264926,0.0007671114,0.0012819666,0.00042142623,0.0007340638,0.0007623356,0.0011189891,0.00024361278],"category_scores_gemma":[0.006653528,0.00028719477,0.00047284202,0.00037033117,0.00049179007,0.0019785508,0.0009671164,0.0007527801,0.00016839341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018378337,0.0006733497,0.16598472,0.0005479701,0.0005261381,0.004565214,0.0013027334,0.24443133,0.21821566,0.02160859,0.0026718096,0.33763474],"study_design_scores_gemma":[0.000023734348,0.00039054974,0.00840564,0.000021192085,0.00007233154,0.0019949554,0.00011891351,0.9457252,0.03879011,0.0034511185,0.00096753525,0.000038782728],"about_ca_topic_score_codex":0.00086476316,"about_ca_topic_score_gemma":0.00052519445,"teacher_disagreement_score":0.001473019,"about_ca_system_score_codex":0.0003929716,"about_ca_system_score_gemma":0.00038688243,"threshold_uncertainty_score":0.007790208},"labels":[],"label_agreement":null},{"id":"W1998214657","doi":"10.1007/bf02944790","title":"Provisioning QoS guarantee by multipath routing and reservation in Ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Journal of Computer Science and Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Quality of service; Multipath routing; Wireless ad hoc network; Bandwidth (computing); Mobile ad hoc network; Optimized Link State Routing Protocol; Network packet; Distributed computing; Routing protocol; Dynamic Source Routing; Wireless; Telecommunications","score_opus":0.0067813075484569755,"score_gpt":0.22922571477546658,"score_spread":0.2224444072270096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998214657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19749597,0.0030628596,0.79243153,0.00087943947,0.0004219076,0.00006286476,0.00008390178,0.0016363915,0.003925204],"genre_scores_gemma":[0.9259952,0.0006987684,0.07108977,0.000072256036,0.00019418696,0.000025436877,0.00006332105,0.00006966883,0.0017915275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913967,0.00021318857,0.00006529934,0.000113518545,0.00031706895,0.00015124673],"domain_scores_gemma":[0.9964437,0.0019535492,0.00031200377,0.0005922531,0.0005228372,0.00017562369],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019247899,0.0005734086,0.0008401986,0.00089839543,0.0012568131,0.0016139362,0.0014277453,0.00089123973,0.0011035248],"category_scores_gemma":[0.0056164507,0.00058933406,0.00027441516,0.001129344,0.0008098473,0.0024000541,0.001106932,0.00094596465,0.00027047942],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017164556,0.00023591137,0.0061959424,0.0003036966,0.00020089514,0.00062398857,0.0005419678,0.46825668,0.064787224,0.07840371,0.0061550112,0.37257847],"study_design_scores_gemma":[0.000047313308,0.00013903674,0.0005011262,0.000015588754,0.00006633651,0.0002587698,0.00009878156,0.9592426,0.008565879,0.026780345,0.00424682,0.000037366313],"about_ca_topic_score_codex":0.0018934185,"about_ca_topic_score_gemma":0.0025578435,"teacher_disagreement_score":0.0019247899,"about_ca_system_score_codex":0.0008960066,"about_ca_system_score_gemma":0.0010655782,"threshold_uncertainty_score":0.010179341},"labels":[],"label_agreement":null},{"id":"W1998745036","doi":"10.1109/glocom.2014.7036829","title":"Exploiting channel-aware reputation system against selective forwarding attacks in WSNs","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"U.S. Department of Homeland Security","keywords":"Packet forwarding; Computer network; Computer science; Network packet; Packet loss; Wireless sensor network; Throughput; Node (physics); Channel (broadcasting); Reputation; Wireless; Telecommunications; Engineering","score_opus":0.011480259541264417,"score_gpt":0.22998405951823384,"score_spread":0.21850379997696942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998745036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3140179,0.0006867226,0.67950994,0.0002674331,0.0001357018,0.00011952457,0.000047077156,0.0019031662,0.0033126236],"genre_scores_gemma":[0.9890821,0.00008279725,0.01040472,0.000023135106,0.00001748756,0.000014162343,0.000017057375,0.000014055362,0.00034451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890983,0.0002815275,0.00007059753,0.0002202346,0.00032143111,0.0001963657],"domain_scores_gemma":[0.9957521,0.0015793701,0.0008458767,0.0005987642,0.00097424083,0.00024970016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018115521,0.0006315287,0.0010421263,0.0009569816,0.0007441119,0.0010049854,0.0009551224,0.0006794675,0.00038371698],"category_scores_gemma":[0.007174711,0.00026057844,0.0003638947,0.00040813125,0.00060896704,0.0019288228,0.0011824764,0.00053245254,0.0002169731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085083605,0.00031051386,0.015690548,0.00019754881,0.00021930398,0.0008864697,0.0003370529,0.6720313,0.091015436,0.014075185,0.002276532,0.2021093],"study_design_scores_gemma":[0.000013183723,0.00017260412,0.0010609763,0.000004436844,0.000041665127,0.0001455041,0.000028733055,0.9902158,0.0067963386,0.0011986193,0.00029787023,0.000024268315],"about_ca_topic_score_codex":0.0021800946,"about_ca_topic_score_gemma":0.0019969512,"teacher_disagreement_score":0.0021800946,"about_ca_system_score_codex":0.00060611527,"about_ca_system_score_gemma":0.00084915216,"threshold_uncertainty_score":0.009580493},"labels":[],"label_agreement":null},{"id":"W1999201890","doi":"10.1109/wimob.2010.5644995","title":"A load-distributive QoS routing protocol for multi-service wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Quality of service; Distributed computing; Resource Reservation Protocol; Routing protocol; Bandwidth (computing); Shared mesh; Order One Network Protocol; Dynamic Source Routing; Wireless network; Routing (electronic design automation); Wireless; Internet Protocol; The Internet; Telecommunications","score_opus":0.030336996429768566,"score_gpt":0.3060361653284269,"score_spread":0.27569916889865836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999201890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014067021,0.0019813734,0.97379273,0.00083335437,0.00074101693,0.0002945106,0.00011105331,0.0010796693,0.007099212],"genre_scores_gemma":[0.30561525,0.002498356,0.67728037,0.00072754506,0.00058662565,0.00064928096,0.00046196565,0.00023873664,0.0119417915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951947,0.000097805314,0.00003930805,0.00005962491,0.00025170387,0.00003212249],"domain_scores_gemma":[0.9996275,0.000095526564,0.000054223812,0.00006613777,0.00012543028,0.00003115644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007689203,0.00036666455,0.0004295554,0.0004901528,0.0008429314,0.00073125283,0.0011680267,0.0005659315,0.0013699007],"category_scores_gemma":[0.0012856801,0.00018462307,0.00034931133,0.0005582388,0.00049622747,0.0014521823,0.000988538,0.0008243883,0.00043734504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021966478,0.00022737615,0.000940327,0.0007238504,0.00013376433,0.0006374411,0.00045906156,0.04716204,0.11599216,0.17309035,0.015077126,0.6453369],"study_design_scores_gemma":[0.00013859567,0.00078978966,0.0013112262,0.00011250386,0.00017398038,0.0021184622,0.00019237716,0.610568,0.048064355,0.06818706,0.26818922,0.00015448155],"about_ca_topic_score_codex":0.00043034885,"about_ca_topic_score_gemma":0.0009820898,"teacher_disagreement_score":0.0013699007,"about_ca_system_score_codex":0.0005463689,"about_ca_system_score_gemma":0.00056437176,"threshold_uncertainty_score":0.0045827627},"labels":[],"label_agreement":null},{"id":"W1999405276","doi":"10.1016/j.comcom.2004.01.003","title":"Node density and connectivity properties of the random waypoint model","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Waypoint; Mobility model; Computer science; Mobile ad hoc network; Node (physics); Rectangle; Boundary (topology); Routing (electronic design automation); Topology (electrical circuits); Component (thermodynamics); Focus (optics); Connected component; Computer network; Statistical physics; Mathematics; Geometry; Physics; Real-time computing; Network packet; Artificial intelligence; Mathematical analysis","score_opus":0.0373448298187891,"score_gpt":0.23086757351019366,"score_spread":0.19352274369140454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999405276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33723322,0.0037483443,0.617173,0.0031928588,0.00015167655,0.000104325125,0.00056573027,0.000391763,0.03743902],"genre_scores_gemma":[0.98398006,0.0019437473,0.008297448,0.000110899506,0.00019378569,0.00009290422,0.00023283417,0.00006868599,0.0050796717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.0002566421,0.000019792284,0.00011075462,0.00024438102,0.00009020772],"domain_scores_gemma":[0.9931462,0.0049044783,0.00068822183,0.00036992392,0.00062358147,0.00026766447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013246464,0.0005242437,0.0009049515,0.001586601,0.0007291527,0.0014238497,0.0018367602,0.0013255279,0.003067211],"category_scores_gemma":[0.014609162,0.000748418,0.0005401392,0.0014447661,0.0014193126,0.0041788495,0.0011785267,0.0012388929,0.0005557516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073683375,0.000050514165,0.0021974875,0.00009618155,0.000032605563,0.00021788129,0.00033724192,0.30264267,0.0016325008,0.6830397,0.0024580117,0.0072215567],"study_design_scores_gemma":[0.000024658231,0.000030713956,0.00087511155,0.000019756144,0.000030245164,0.00029003326,0.00009177324,0.7889695,0.00035460223,0.20769039,0.0015966394,0.00002664861],"about_ca_topic_score_codex":0.0036013834,"about_ca_topic_score_gemma":0.0015165551,"teacher_disagreement_score":0.0036013834,"about_ca_system_score_codex":0.0009150391,"about_ca_system_score_gemma":0.00049282337,"threshold_uncertainty_score":0.01026088},"labels":[],"label_agreement":null},{"id":"W2000272237","doi":"10.1155/2007/19860","title":"Cross-Layer Path Configuration for Energy-Efficient Communication over Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"Advances in Multimedia","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Retransmission; Computer science; Computer network; Network packet; Wireless ad hoc network; Node (physics); Wireless; Hop (telecommunications); Schedule; Energy consumption; Path (computing); Mobile ad hoc network; Telecommunications; Engineering; Electrical engineering","score_opus":0.01031755166319956,"score_gpt":0.29678229168971404,"score_spread":0.28646474002651445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000272237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025591845,0.0015980448,0.9705287,0.000110420144,0.00005028538,0.00004538112,0.0000116389965,0.0001315607,0.0019320613],"genre_scores_gemma":[0.6971691,0.002558097,0.29690167,0.00012243575,0.00009992991,0.0002284822,0.00006883643,0.00010154928,0.0027499497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995795,0.0002339993,0.000012285371,0.00003795922,0.00010456676,0.000031627496],"domain_scores_gemma":[0.99933547,0.00043858806,0.00008784988,0.00004423482,0.00007573935,0.00001810224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011223957,0.00095035497,0.00036612523,0.00042769813,0.00027720118,0.0004831322,0.0005910855,0.0005375927,0.0014156125],"category_scores_gemma":[0.0021979453,0.0003310472,0.00030412115,0.00061865617,0.0005115877,0.00088624354,0.0005856689,0.00055636535,0.00024605403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033895878,0.00003710141,0.00024742095,0.000090432804,0.000034462904,0.000057336736,0.00004193829,0.9462793,0.004627595,0.010445197,0.0006018333,0.037503447],"study_design_scores_gemma":[0.000012367788,0.00010911303,0.00010588213,0.0000077701525,0.000014974676,0.000052959367,0.000009957843,0.99250084,0.0012681015,0.0049397754,0.0009708052,0.0000074519367],"about_ca_topic_score_codex":0.00045834237,"about_ca_topic_score_gemma":0.0005321819,"teacher_disagreement_score":0.0014156125,"about_ca_system_score_codex":0.00036556597,"about_ca_system_score_gemma":0.0003847195,"threshold_uncertainty_score":0.0059359074},"labels":[],"label_agreement":null},{"id":"W2000550908","doi":"10.1109/cicybs.2014.7013365","title":"Automated testing for cyber threats to ad-hoc wireless networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Exploit; Computer science; Vulnerability (computing); Wireless ad hoc network; Node (physics); Adversary; Computer network; Computer security; Protocol (science); Wireless; Distributed computing; Wireless network; Vehicular ad hoc network; Engineering","score_opus":0.022408010111218204,"score_gpt":0.26482199497987197,"score_spread":0.24241398486865376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000550908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17757156,0.0002245062,0.81294495,0.00037193688,0.000036971756,0.0001892581,0.00009904823,0.00522381,0.0033379195],"genre_scores_gemma":[0.8736446,0.000068659254,0.12515274,0.00007798431,0.000011057911,0.00009055393,0.000114362105,0.000106138286,0.0007339651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99693584,0.0014014677,0.0001128694,0.0003339458,0.0009999765,0.00021588319],"domain_scores_gemma":[0.9862634,0.010055051,0.0010068379,0.001692503,0.00076336064,0.00021873401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018031253,0.00082525954,0.0004852483,0.0010452161,0.00048626537,0.0008316277,0.0019302838,0.0010011485,0.0013457617],"category_scores_gemma":[0.014605242,0.00032740572,0.00058005494,0.0005053674,0.0020280192,0.0018069156,0.0014563708,0.0010120325,0.00017402816],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003068428,0.00039908994,0.014443491,0.00023459776,0.00011472567,0.0006297131,0.0004456167,0.6801169,0.026150204,0.028293496,0.0017302758,0.24713501],"study_design_scores_gemma":[0.000027929756,0.00013704064,0.0006754227,0.000018779645,0.00001739706,0.00013816974,0.000042416905,0.9735439,0.010576841,0.01392031,0.00088906137,0.000012650814],"about_ca_topic_score_codex":0.0023699382,"about_ca_topic_score_gemma":0.002744274,"teacher_disagreement_score":0.0023699382,"about_ca_system_score_codex":0.0008424805,"about_ca_system_score_gemma":0.0012699866,"threshold_uncertainty_score":0.009535968},"labels":[],"label_agreement":null},{"id":"W2001313361","doi":"10.1002/wcm.118","title":"Medium access control protocols for wireless mobile ad hoc networks: issues and approaches","year":2003,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Ad hoc wireless distribution service; Access control; Mobile ad hoc network; Multiple Access with Collision Avoidance for Wireless; Throughput; Node (physics); Optimized Link State Routing Protocol; Vehicular ad hoc network; Media access control; Wireless; Wireless network; Routing protocol; Distributed computing; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.0528242933603785,"score_gpt":0.32246099133753753,"score_spread":0.26963669797715906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001313361","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020458333,0.44389725,0.50118124,0.016144492,0.004155449,0.000347448,0.000071109214,0.00035601738,0.03180113],"genre_scores_gemma":[0.09410512,0.49246016,0.37460303,0.0053360737,0.014292537,0.0019298352,0.00021339358,0.00017079164,0.016889011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992737,0.0026949327,0.00063011656,0.0005371256,0.0031946094,0.00020631262],"domain_scores_gemma":[0.9903019,0.005449333,0.0005644913,0.00093314575,0.0024940881,0.00025690833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009778125,0.0016133584,0.0018264889,0.0042795474,0.0018973787,0.008361229,0.004737835,0.006189437,0.0020099806],"category_scores_gemma":[0.016545486,0.0013768164,0.0007472489,0.006003877,0.0068720356,0.011868545,0.0040488425,0.007848054,0.0019363104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032298984,0.00011209675,0.0003822608,0.0013457673,0.00005813844,0.0003168487,0.0007057469,0.008614763,0.0010711378,0.76129794,0.010106865,0.21595612],"study_design_scores_gemma":[0.000032232936,0.00016021382,0.00038155846,0.00217209,0.00006462903,0.001045757,0.00051281153,0.04034658,0.0011092561,0.6260765,0.32799864,0.00009977354],"about_ca_topic_score_codex":0.0013877479,"about_ca_topic_score_gemma":0.0007777491,"teacher_disagreement_score":0.009778125,"about_ca_system_score_codex":0.0024138568,"about_ca_system_score_gemma":0.0024323056,"threshold_uncertainty_score":0.051712275},"labels":[],"label_agreement":null},{"id":"W2001408087","doi":"10.1109/ccece.2013.6567748","title":"Stable connections using multi-paths and conservative neighborhood ranges in mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Backup; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Node (physics); Routing protocol; Wireless Routing Protocol; Reliability (semiconductor); Throughput; Routing (electronic design automation); Wireless; Engineering; Network packet; Telecommunications","score_opus":0.023456801166263475,"score_gpt":0.2518919380416924,"score_spread":0.22843513687542893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001408087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03738286,0.005105318,0.9536417,0.00038987372,0.00012048492,0.00007201595,0.000023205732,0.00036249333,0.0029020396],"genre_scores_gemma":[0.7836394,0.005193057,0.20833142,0.0001487754,0.00031140368,0.0002170182,0.00006936874,0.0000948748,0.0019948583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989524,0.00041620625,0.00005606383,0.00013698703,0.00038857321,0.00004968145],"domain_scores_gemma":[0.9974491,0.0016524284,0.00024305402,0.00035533693,0.00021949079,0.00008054479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013203783,0.000515123,0.0005524244,0.0009540129,0.0007595464,0.0009352967,0.0010488889,0.000607314,0.000451492],"category_scores_gemma":[0.0060578207,0.00035730927,0.00033192418,0.0009832516,0.0014054211,0.0031140847,0.0014307915,0.00083227013,0.00017435903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002325025,0.00009670362,0.0026273597,0.0004526975,0.00009820567,0.00087541627,0.0011427797,0.48067707,0.015919203,0.23170693,0.0024513588,0.26371974],"study_design_scores_gemma":[0.000058031517,0.00040296972,0.0009128398,0.000091640606,0.00009576981,0.0011792989,0.00026648445,0.7324883,0.0061441297,0.24588145,0.012383977,0.00009509595],"about_ca_topic_score_codex":0.0007225457,"about_ca_topic_score_gemma":0.00085928413,"teacher_disagreement_score":0.0013203783,"about_ca_system_score_codex":0.0004312246,"about_ca_system_score_gemma":0.00039646914,"threshold_uncertainty_score":0.0069829226},"labels":[],"label_agreement":null},{"id":"W2001856473","doi":"10.1117/12.918035","title":"Distributed geolocation algorithm in mobile ad hoc networks using received signal strength differences","year":2012,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mobile ad hoc network; Geolocation; Computer network; Wireless ad hoc network; Wireless; Telecommunications; Network packet","score_opus":0.01250170148428388,"score_gpt":0.2284194464722243,"score_spread":0.21591774498794042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001856473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018197991,0.00031058548,0.9784153,0.000107619606,0.00010141756,0.000095904164,0.000022266224,0.0009379045,0.0018110601],"genre_scores_gemma":[0.50481653,0.00037521392,0.4895627,0.00008705709,0.000067043984,0.0003022817,0.00016567863,0.000063399915,0.0045601665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999546,0.000095128424,0.00003513591,0.00011210086,0.00016914123,0.00004241653],"domain_scores_gemma":[0.99949276,0.00014909064,0.00007714484,0.000055559038,0.00019754523,0.00002791226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072720554,0.0006262524,0.00066463416,0.0009186398,0.0005867492,0.0008019743,0.0012078839,0.00064768334,0.0009320879],"category_scores_gemma":[0.0014751534,0.00022118325,0.000326079,0.0007541555,0.00044680363,0.001186683,0.0007799757,0.0004868999,0.00054743234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024917867,0.0001237916,0.0022277294,0.000116303316,0.000077593395,0.00016806638,0.00019838737,0.57812625,0.01803219,0.01013687,0.0025816842,0.38796192],"study_design_scores_gemma":[0.000058924667,0.00017113105,0.00044366153,0.000009188782,0.000018765524,0.00011176659,0.00005804123,0.9875408,0.0054100608,0.00321696,0.0029407653,0.000020003075],"about_ca_topic_score_codex":0.0018152671,"about_ca_topic_score_gemma":0.0017623177,"teacher_disagreement_score":0.0018152671,"about_ca_system_score_codex":0.0006478146,"about_ca_system_score_gemma":0.0007276644,"threshold_uncertainty_score":0.0047002435},"labels":[],"label_agreement":null},{"id":"W2001909640","doi":"10.1007/s11276-008-0146-x","title":"Hierarchical geographic multicast routing for wireless sensor networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; National Science Foundation","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Xcast; Distributed computing; Pragmatic General Multicast; IP multicast","score_opus":0.016770784871156675,"score_gpt":0.23571847125484421,"score_spread":0.21894768638368753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001909640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06398117,0.003851369,0.9206149,0.0012113925,0.0003498172,0.0001387778,0.00026328367,0.0017114992,0.007877838],"genre_scores_gemma":[0.7573344,0.0017919658,0.23273715,0.00020273906,0.00024642923,0.00012701783,0.0005851051,0.000102606966,0.006872445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995751,0.00012588529,0.000025502786,0.000050317318,0.0001662231,0.00005697965],"domain_scores_gemma":[0.99945956,0.00018824964,0.00006848272,0.00014548012,0.000104892584,0.000033369764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000665617,0.00029397005,0.00041619444,0.0005925173,0.00062696426,0.0005288631,0.0007885589,0.0005455101,0.0016218317],"category_scores_gemma":[0.0017412206,0.00023208348,0.00021277086,0.00083147036,0.0004197233,0.0012781571,0.0009808779,0.00049322494,0.00030705464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003696022,0.00012642804,0.0020053065,0.00053943455,0.00009198819,0.00029902084,0.00043064464,0.3432666,0.033801474,0.11402145,0.020294022,0.48475397],"study_design_scores_gemma":[0.000049246148,0.00016104913,0.0012604687,0.000037345242,0.000067221954,0.00022471516,0.00019101672,0.8657902,0.008111849,0.098655805,0.025423978,0.000027141274],"about_ca_topic_score_codex":0.00179758,"about_ca_topic_score_gemma":0.00279957,"teacher_disagreement_score":0.00179758,"about_ca_system_score_codex":0.00055472413,"about_ca_system_score_gemma":0.0005305859,"threshold_uncertainty_score":0.005425632},"labels":[],"label_agreement":null},{"id":"W2002077709","doi":"10.1016/j.tcs.2014.10.029","title":"Data gathering and personalized broadcasting in radio grids with interference","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Communication source; Broadcasting (networking); Computer network; Base station; Graph; Job shop scheduling; Schedule; Node (physics); Scheduling (production processes); Unicast; Distributed computing; Theoretical computer science; Mathematical optimization; Multicast; Mathematics; Routing (electronic design automation)","score_opus":0.018518143503911323,"score_gpt":0.2468621790266305,"score_spread":0.22834403552271917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002077709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16113245,0.0005615079,0.82941395,0.00051767175,0.00008878458,0.000059863618,0.00008080028,0.00047472032,0.0076702973],"genre_scores_gemma":[0.97168565,0.00019281011,0.02549663,0.000047502173,0.000056177767,0.000028397217,0.0000428851,0.000040088296,0.0024098335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992562,0.00023741485,0.000028995655,0.00016145002,0.0001609493,0.00015500013],"domain_scores_gemma":[0.99661773,0.0022724199,0.00032274154,0.00037124337,0.0002724724,0.00014335915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082178746,0.00036118383,0.00080323126,0.0006228179,0.0012001228,0.0012924352,0.0010757692,0.0006958519,0.0016082918],"category_scores_gemma":[0.005675675,0.0004925731,0.00038129117,0.0012373597,0.0010558219,0.0014091905,0.0012659457,0.00072412635,0.0002675343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086835015,0.00015475592,0.0054435474,0.00019841231,0.00009427887,0.00083968317,0.0008003046,0.7924411,0.014835883,0.10551737,0.0032597417,0.0755465],"study_design_scores_gemma":[0.00002448691,0.00005480256,0.0005434096,0.000005388235,0.000021828617,0.00021096185,0.00015437051,0.96608615,0.002175616,0.029788785,0.00092202285,0.0000121883795],"about_ca_topic_score_codex":0.0031808456,"about_ca_topic_score_gemma":0.0029117535,"teacher_disagreement_score":0.0031808456,"about_ca_system_score_codex":0.0008473041,"about_ca_system_score_gemma":0.00061996304,"threshold_uncertainty_score":0.006324649},"labels":[],"label_agreement":null},{"id":"W2003002196","doi":"10.1016/j.jcss.2013.04.003","title":"Leader election in ad hoc radio networks: A keen ear helps","year":2013,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; Université du Québec en Outaouais","keywords":"Node (physics); Collision; Wireless ad hoc network; Collision detection; Leader election; Computer science; Computer network; Radio networks; Algorithm; Computer security; Telecommunications; Physics; Wireless network; Wireless","score_opus":0.012126426616974816,"score_gpt":0.22011064574566236,"score_spread":0.20798421912868753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003002196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01580207,0.21231402,0.5740223,0.14501871,0.015022005,0.00012887716,0.0001491693,0.001220838,0.03632204],"genre_scores_gemma":[0.50320995,0.18480603,0.17555362,0.022500625,0.0484809,0.00021677365,0.0003210264,0.000548902,0.06436217],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941949,0.0026845115,0.00026204585,0.0010973627,0.0013464275,0.00041468104],"domain_scores_gemma":[0.9756512,0.017782014,0.00073106826,0.0020210939,0.0029226437,0.00089188566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008026032,0.0014082801,0.002583407,0.0018748029,0.0023300292,0.007448284,0.002898332,0.0067147436,0.0058202357],"category_scores_gemma":[0.026428292,0.0009716835,0.00083388435,0.0023232938,0.0063233795,0.021287907,0.0035893875,0.007583508,0.0031235043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005793244,0.00031058246,0.004034528,0.0016259399,0.00026924958,0.0005250973,0.0012622686,0.023879787,0.0023891525,0.26300246,0.10573673,0.596385],"study_design_scores_gemma":[0.00025407996,0.0005280924,0.0011948275,0.0007715623,0.00019138181,0.00095535436,0.0021675783,0.12616558,0.0026954424,0.621253,0.24361351,0.00020953974],"about_ca_topic_score_codex":0.0017564228,"about_ca_topic_score_gemma":0.0017431471,"teacher_disagreement_score":0.008026032,"about_ca_system_score_codex":0.0011973253,"about_ca_system_score_gemma":0.0014823907,"threshold_uncertainty_score":0.042446256},"labels":[],"label_agreement":null},{"id":"W2003331630","doi":"10.1016/j.comcom.2012.03.013","title":"A hybrid nature-inspired optimizer for wireless mesh networks design","year":2012,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Software deployment; Particle swarm optimization; Throughput; Distributed computing; Genetic algorithm; Network performance; Network planning and design; Key (lock); Wireless network; Mathematical optimization; Wireless; Computer network; Machine learning","score_opus":0.03817291486835299,"score_gpt":0.28048897545014223,"score_spread":0.24231606058178923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003331630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018606015,0.00018529102,0.9759749,0.00013085669,0.0000544818,0.0000410658,0.000025931091,0.00022860343,0.0047528124],"genre_scores_gemma":[0.5338277,0.0002390554,0.4592243,0.00019352522,0.00009890166,0.00024666477,0.00007445254,0.00016645729,0.005928936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982244,0.00006209363,0.0000070120923,0.000021807791,0.00006906834,0.000017628365],"domain_scores_gemma":[0.9997838,0.00010449402,0.000026902473,0.000022248061,0.00004943754,0.00001301297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059369573,0.00044108852,0.00056084787,0.00036563392,0.00026427137,0.00049148547,0.00085569435,0.0007491661,0.0017965903],"category_scores_gemma":[0.00091018796,0.0002762717,0.00049627596,0.0003474993,0.0002945224,0.00040877642,0.0005438479,0.00049973483,0.00026787046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005044889,0.000038402926,0.00033799585,0.00004306571,0.000043323,0.000036789992,0.00002560881,0.93519807,0.0052761235,0.011239158,0.0009050584,0.04680602],"study_design_scores_gemma":[0.000005145868,0.00001813589,0.000029096413,0.0000015020912,0.000003642371,0.0000067121614,0.0000014188,0.9985488,0.00020798088,0.00088808185,0.00028807073,0.000001503073],"about_ca_topic_score_codex":0.0008324494,"about_ca_topic_score_gemma":0.0012125232,"teacher_disagreement_score":0.0017965903,"about_ca_system_score_codex":0.00035154904,"about_ca_system_score_gemma":0.000399443,"threshold_uncertainty_score":0.0060102344},"labels":[],"label_agreement":null},{"id":"W2003445378","doi":"","title":"ARMA: a scalable secure routing protocol with privacy protection for mobile ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Computer security; Routing protocol; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Encryption; Distributed computing; Routing (electronic design automation); Wireless; Network packet","score_opus":0.010720986340657435,"score_gpt":0.25048432421257527,"score_spread":0.23976333787191784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003445378","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012446952,0.002059854,0.9672209,0.0009881819,0.00049659156,0.000918014,0.00031607633,0.00640779,0.009145675],"genre_scores_gemma":[0.35356438,0.0023301924,0.62263936,0.00087555056,0.00046052816,0.0020047114,0.0012677388,0.0005324936,0.016325047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796873,0.0006563142,0.00017538192,0.00016966468,0.0009164545,0.000113517934],"domain_scores_gemma":[0.99855274,0.00040026754,0.00032425878,0.00037759266,0.0002300938,0.00011505223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021720137,0.000797984,0.00083777343,0.0011881725,0.0012864843,0.0013622943,0.002297467,0.0013493018,0.0025264588],"category_scores_gemma":[0.0032877547,0.00038871478,0.0011082017,0.0011960401,0.0011407624,0.002779755,0.002806884,0.0017275459,0.0014648793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008984584,0.00039604696,0.0012817021,0.0017114934,0.00039963884,0.0023515143,0.00082688057,0.12914813,0.08455983,0.23970903,0.047117505,0.49159968],"study_design_scores_gemma":[0.0003226125,0.0008438759,0.0006695112,0.00016991213,0.00024781696,0.0025124766,0.00015665598,0.681055,0.022428885,0.09060989,0.20076148,0.00022170781],"about_ca_topic_score_codex":0.00060172664,"about_ca_topic_score_gemma":0.0008905911,"teacher_disagreement_score":0.0025264588,"about_ca_system_score_codex":0.000570201,"about_ca_system_score_gemma":0.0016266451,"threshold_uncertainty_score":0.011486828},"labels":[],"label_agreement":null},{"id":"W2003757864","doi":"10.1109/vtcspring.2014.7022895","title":"Dynamic Probabilistic Forwarding in Wireless Ad Hoc Networks Based on Game Theory","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Packet forwarding; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Routing protocol; Distributed computing; Virtual routing and forwarding; Ad hoc wireless distribution service; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Network packet; Wireless; Telecommunications","score_opus":0.005634737078690513,"score_gpt":0.21486336425028332,"score_spread":0.2092286271715928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003757864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009024048,0.0006940797,0.98281324,0.0003625164,0.00008295792,0.00012365881,0.000033224096,0.00009248545,0.006773712],"genre_scores_gemma":[0.7005246,0.0029802972,0.2901644,0.00027735467,0.00017400944,0.0006498102,0.00009605646,0.00004853336,0.0050848313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987947,0.00059670495,0.000053020234,0.00010756034,0.0003687928,0.00007930904],"domain_scores_gemma":[0.99895144,0.00076723914,0.000075146214,0.000045374123,0.00011850684,0.00004235206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014268713,0.00070545566,0.0009097539,0.00073960255,0.00072324055,0.0014028095,0.001244138,0.0008579857,0.00085971283],"category_scores_gemma":[0.0029639532,0.00042662086,0.0009898848,0.0007950682,0.0016402346,0.002224538,0.001033557,0.001062821,0.0001442673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003219806,0.00005337086,0.00064105797,0.00012905264,0.00007743398,0.00017116487,0.00019185797,0.5907228,0.0016514447,0.37980857,0.0010415323,0.025479468],"study_design_scores_gemma":[0.000016875718,0.000041832383,0.00012695741,0.000015749458,0.000019501344,0.00007292797,0.000030674597,0.89184326,0.0002581042,0.10512951,0.0024263929,0.000018321844],"about_ca_topic_score_codex":0.00483258,"about_ca_topic_score_gemma":0.0035641973,"teacher_disagreement_score":0.00483258,"about_ca_system_score_codex":0.0014100502,"about_ca_system_score_gemma":0.0016097764,"threshold_uncertainty_score":0.01023072},"labels":[],"label_agreement":null},{"id":"W2004011015","doi":"10.1109/iscc.2014.6912513","title":"An efficient heuristic candidate selection algorithm for Opportunistic Routing in wireless multihop networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Selection algorithm; Network packet; Selection (genetic algorithm); Heuristic; Algorithm; Computer network; Node (physics); Wireless; Routing (electronic design automation); Reliability (semiconductor); Wireless network; Engineering; Artificial intelligence","score_opus":0.010509225871540628,"score_gpt":0.24846019783324585,"score_spread":0.23795097196170523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004011015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016101833,0.00064175687,0.9809054,0.00009227521,0.000076507,0.00018673304,0.000068826,0.00039157522,0.001534988],"genre_scores_gemma":[0.38535812,0.00059804437,0.61036325,0.00014777643,0.00009185479,0.00045349015,0.00039569923,0.00007093813,0.00252078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.0002425573,0.000036877813,0.00008869344,0.00022965761,0.00009171673],"domain_scores_gemma":[0.9987436,0.0007371011,0.00014874848,0.00011068754,0.00020398297,0.000055953198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011020325,0.0007097188,0.0011193638,0.0013164224,0.00085471565,0.0006388105,0.0012409195,0.00061291055,0.001147654],"category_scores_gemma":[0.0030352427,0.00031215866,0.00048750872,0.0012394689,0.00043666354,0.0009888352,0.0008485868,0.00039581623,0.0002936059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004113054,0.00017677629,0.0017944244,0.00020860191,0.00013937052,0.00033153934,0.00016831426,0.5038721,0.0076155504,0.020136539,0.006524613,0.45862076],"study_design_scores_gemma":[0.000055085482,0.00012427101,0.0002847901,0.000012751458,0.00003079322,0.00020176795,0.00003155962,0.98886454,0.0017065965,0.0056434143,0.0030263073,0.000018091734],"about_ca_topic_score_codex":0.0015622252,"about_ca_topic_score_gemma":0.0023531334,"teacher_disagreement_score":0.0015622252,"about_ca_system_score_codex":0.00048061326,"about_ca_system_score_gemma":0.0011054003,"threshold_uncertainty_score":0.005828142},"labels":[],"label_agreement":null},{"id":"W2004059010","doi":"10.1145/1143549.1143775","title":"An efficient leader election protocol for mobile networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Leader election; Optimized Link State Routing Protocol; Protocol (science); Ad hoc wireless distribution service; Distributed computing; Wireless Routing Protocol; Scheme (mathematics); Neighbor Discovery Protocol; Routing protocol; Internet protocol suite; Wireless; Routing (electronic design automation); The Internet; Engineering; Telecommunications; World Wide Web; Network packet","score_opus":0.012283331080273968,"score_gpt":0.2834754200567332,"score_spread":0.27119208897645924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004059010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069849147,0.0027858387,0.9766573,0.0006687007,0.0009149356,0.0005400471,0.00016916436,0.0013032798,0.009975802],"genre_scores_gemma":[0.23024304,0.0044150995,0.738424,0.00052699295,0.000783613,0.0015709476,0.00092421105,0.00018782441,0.022924328],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908304,0.00027296858,0.000067210676,0.00009646104,0.00041602633,0.00006434405],"domain_scores_gemma":[0.9994356,0.00018535017,0.00006831995,0.000102910766,0.00016264696,0.000045174136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010079603,0.00050238625,0.00060504547,0.0007461626,0.00093913375,0.00086971006,0.0010888999,0.0006572918,0.002089145],"category_scores_gemma":[0.0022454048,0.00024584885,0.00025033567,0.0010815277,0.00045864898,0.0020665526,0.00125257,0.00091204216,0.0010971365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003159029,0.00021036666,0.0006412722,0.0009708285,0.00016986873,0.0010231487,0.000534574,0.055885844,0.048036736,0.1772509,0.052040044,0.6629205],"study_design_scores_gemma":[0.00037820623,0.0008292755,0.0005204592,0.00015823136,0.00018270804,0.0013479989,0.00024039939,0.3732459,0.02758032,0.07700092,0.5183942,0.00012144764],"about_ca_topic_score_codex":0.00031228934,"about_ca_topic_score_gemma":0.00055606954,"teacher_disagreement_score":0.002089145,"about_ca_system_score_codex":0.000301011,"about_ca_system_score_gemma":0.0006935695,"threshold_uncertainty_score":0.006988883},"labels":[],"label_agreement":null},{"id":"W2005100786","doi":"10.1007/s11235-011-9490-8","title":"A self-optimized random access protocol for an infrastructure-less mission critical wireless networking system","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Retransmission; Computer science; Computer network; Throughput; Node (physics); Network packet; Wireless network; Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.08347031809098576,"score_gpt":0.34575105494359165,"score_spread":0.2622807368526059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005100786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056065485,0.00054786657,0.93818367,0.00030538827,0.00019748097,0.00021318701,0.000057023382,0.0017303254,0.0026994946],"genre_scores_gemma":[0.87487715,0.00022493322,0.12096001,0.00018797208,0.00012487249,0.00016433757,0.000100523284,0.00007188694,0.0032883724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990891,0.00032840064,0.00006659328,0.00011009301,0.00028306048,0.00012273602],"domain_scores_gemma":[0.9987903,0.000433407,0.00014119789,0.00020317416,0.00036387105,0.000068099485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012603117,0.0005479094,0.00070656376,0.000578286,0.0006052652,0.0008027029,0.0013617637,0.0005216644,0.0013201218],"category_scores_gemma":[0.0018727711,0.0002279796,0.00032592393,0.0003457438,0.00046376896,0.00090193306,0.00089521846,0.0007089809,0.00036126803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021473747,0.0005454917,0.001997123,0.00037569497,0.00028624633,0.0009461135,0.0003693075,0.4305176,0.1810608,0.054129716,0.009191369,0.31843317],"study_design_scores_gemma":[0.000079701014,0.0004910898,0.00024581456,0.00000782337,0.00006869537,0.0002721602,0.000021835747,0.9855806,0.008130485,0.0027048243,0.002366001,0.000030934207],"about_ca_topic_score_codex":0.0009053012,"about_ca_topic_score_gemma":0.0017567197,"teacher_disagreement_score":0.0013617637,"about_ca_system_score_codex":0.00048170163,"about_ca_system_score_gemma":0.0007135944,"threshold_uncertainty_score":0.00666523},"labels":[],"label_agreement":null},{"id":"W2005346846","doi":"10.4018/jmcmc.2009070103","title":"Performance Enhancement of Routing Protocols in Mobile Ad hoc Networks","year":2009,"lang":"en","type":"article","venue":"International Journal of Mobile Computing and Multimedia Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Computer science; Backbone network; Connected dominating set; Wireless ad hoc network; Distributed computing; Computer network; Flooding (psychology); Mobile ad hoc network; Scalability; Bundle; Minimum spanning tree; Wireless; Network packet; Algorithm","score_opus":0.020630815021459113,"score_gpt":0.32530025639824217,"score_spread":0.30466944137678303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005346846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21399687,0.05120928,0.6479654,0.0037907097,0.0022384091,0.00035561903,0.00029707953,0.006518246,0.07362834],"genre_scores_gemma":[0.8878256,0.00995102,0.09393004,0.00026847847,0.00068059575,0.00014939359,0.00035662483,0.00026535543,0.0065728202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972861,0.0009980076,0.00014117306,0.00021147585,0.0011746916,0.00018860189],"domain_scores_gemma":[0.99694985,0.0014067056,0.0002564407,0.0004437774,0.00085893396,0.00008436732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002271317,0.00089216745,0.00068153214,0.00094402384,0.0006538511,0.0017065681,0.0009810111,0.00088945177,0.0012966335],"category_scores_gemma":[0.0075611006,0.00024018924,0.0002540287,0.0014324841,0.00043514685,0.0023967035,0.00093073543,0.00075132673,0.000751827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080960686,0.00031492693,0.004226774,0.0011034089,0.00015476969,0.00054620666,0.00049672794,0.19708148,0.06080973,0.051622577,0.011813974,0.6710198],"study_design_scores_gemma":[0.00009711139,0.0020820776,0.003838128,0.00016475216,0.00028890095,0.0016895407,0.00039039308,0.8416725,0.04794593,0.032387514,0.06934925,0.000093905444],"about_ca_topic_score_codex":0.00043716663,"about_ca_topic_score_gemma":0.0003274616,"teacher_disagreement_score":0.002271317,"about_ca_system_score_codex":0.0006483671,"about_ca_system_score_gemma":0.0005700934,"threshold_uncertainty_score":0.012012005},"labels":[],"label_agreement":null},{"id":"W2005422367","doi":"10.1007/s11277-013-1419-y","title":"Reputation-Based Cooperative Detection Model of Selfish Nodes in Cluster-Based QoS-OLSR Protocol","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Selfishness; Computer network; Network packet; Quality of service; Mobile ad hoc network; Routing protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Reputation; Distributed computing; Denial-of-service attack; Selection algorithm; Protocol (science); Selection (genetic algorithm); Wireless","score_opus":0.0314357788660507,"score_gpt":0.28691857908479096,"score_spread":0.25548280021874026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005422367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14343143,0.0007838886,0.8482853,0.0006825585,0.0001534889,0.00013315599,0.00007513154,0.00041413915,0.006040813],"genre_scores_gemma":[0.98393005,0.00014799893,0.014337218,0.000038132388,0.000032532018,0.00003350719,0.000026062993,0.000015456988,0.0014391225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983714,0.0005691747,0.00007465206,0.00034172487,0.00042837873,0.00021471384],"domain_scores_gemma":[0.99700963,0.0012383164,0.00037827832,0.0003178504,0.00091021083,0.00014571293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026697728,0.0004502186,0.0008766634,0.0007105894,0.0007908989,0.0013313732,0.003025346,0.0009888263,0.0007968651],"category_scores_gemma":[0.0057161534,0.00035190262,0.0005094954,0.0007196756,0.0010795128,0.0023849302,0.0010613636,0.0008119658,0.0002125448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062170904,0.00018852114,0.005289428,0.00018608471,0.00014688511,0.0005925966,0.0008856608,0.7875523,0.016446711,0.13365829,0.0033146925,0.05111712],"study_design_scores_gemma":[0.000010032887,0.000052224535,0.00022089979,0.0000034371326,0.000023649023,0.00005387035,0.000030074834,0.9937024,0.00055320177,0.005120698,0.00021469413,0.000014969045],"about_ca_topic_score_codex":0.00438257,"about_ca_topic_score_gemma":0.0031655622,"teacher_disagreement_score":0.00438257,"about_ca_system_score_codex":0.0013160212,"about_ca_system_score_gemma":0.0011167891,"threshold_uncertainty_score":0.014119267},"labels":[],"label_agreement":null},{"id":"W2005760434","doi":"10.1109/icwmc.2007.95","title":"WLAN Mesh Network Interference Management Using FSO Link Deployment","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Interference (communication); Channel allocation schemes; Frequency assignment; Heuristic; Wireless mesh network; Channel (broadcasting); Frequency allocation; Computer network; Link (geometry); Wireless network; Wireless; Algorithm; Telecommunications","score_opus":0.023703778092653685,"score_gpt":0.2647000579527715,"score_spread":0.24099627986011785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005760434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24030596,0.0004688646,0.7536664,0.00023659262,0.000030173413,0.00008513631,0.000035704918,0.0005855704,0.004585652],"genre_scores_gemma":[0.9553169,0.00010445487,0.04390783,0.000022082842,0.000016292404,0.000034664834,0.000026413225,0.000012623458,0.000558875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955076,0.00019521039,0.00001520978,0.000059427006,0.00007478182,0.000104554885],"domain_scores_gemma":[0.9993156,0.00037802625,0.0001382794,0.00007159051,0.000055594024,0.000040857347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081262866,0.0004659298,0.00042234198,0.0006615439,0.00041473994,0.0005354921,0.00070361025,0.00043061827,0.00049374806],"category_scores_gemma":[0.0017542538,0.0002150714,0.00021808439,0.00071145105,0.0004940258,0.0008837601,0.0007933964,0.00030297603,0.00010013932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003414922,0.00016460152,0.0029470604,0.00006938788,0.000048304915,0.00014184816,0.00012725097,0.7844149,0.011130308,0.0074303485,0.0008252321,0.19235928],"study_design_scores_gemma":[0.0000405439,0.00012906457,0.0007010611,0.000006153804,0.00003094405,0.00007219534,0.00005658393,0.9909184,0.00453462,0.0026808109,0.00082058663,0.000009098437],"about_ca_topic_score_codex":0.001741636,"about_ca_topic_score_gemma":0.0026837473,"teacher_disagreement_score":0.001741636,"about_ca_system_score_codex":0.0007899544,"about_ca_system_score_gemma":0.0004690145,"threshold_uncertainty_score":0.0057315826},"labels":[],"label_agreement":null},{"id":"W2005903960","doi":"10.1145/2489253.2489263","title":"Distributed lifetime-maximized target coverage game","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Science Council","keywords":"Computer science; Wireless sensor network; Correctness; Set (abstract data type); Task (project management); Cover (algebra); Distributed computing; Convergence (economics); Mathematical proof; Potential game; Energy (signal processing); Simple (philosophy); Game theory; Computer network; Algorithm","score_opus":0.009562284462681023,"score_gpt":0.2169701270517217,"score_spread":0.20740784258904066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005903960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12286618,0.0004088441,0.8350003,0.0018379625,0.00012095307,0.00052696734,0.00056155975,0.00025762332,0.038419653],"genre_scores_gemma":[0.95502496,0.0002225583,0.034954116,0.0002419525,0.0000373011,0.00041530895,0.00016003329,0.000030394898,0.008913363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981894,0.00083073945,0.00007671241,0.00029349045,0.00033200704,0.0002776492],"domain_scores_gemma":[0.9965663,0.00229083,0.00028181626,0.00016210641,0.00031789363,0.00038106093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019635689,0.0012181418,0.0012902515,0.00060967385,0.00057257846,0.0017369045,0.0024622246,0.001877099,0.0033527142],"category_scores_gemma":[0.006716341,0.00041235803,0.0006533736,0.00060333026,0.001410349,0.0020971647,0.0018845872,0.001469823,0.00038328834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000511483,0.00021518872,0.0012401917,0.00023129837,0.00011803081,0.0007152782,0.00048647868,0.75173074,0.0069325427,0.2110085,0.0040956745,0.022714527],"study_design_scores_gemma":[0.000088701585,0.00009546897,0.00019505131,0.000011790626,0.000017028999,0.00010777325,0.000056666027,0.9504321,0.0005442629,0.04707201,0.0013612635,0.000017839806],"about_ca_topic_score_codex":0.002655977,"about_ca_topic_score_gemma":0.0019111116,"teacher_disagreement_score":0.0033527142,"about_ca_system_score_codex":0.0026261278,"about_ca_system_score_gemma":0.0015850887,"threshold_uncertainty_score":0.019053936},"labels":[],"label_agreement":null},{"id":"W2006423697","doi":"10.1109/milcom.2011.6127772","title":"A location service for VHF tactical networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Gossip protocol; Network packet; Node (physics); Bandwidth (computing); Gossip; Quality of service; Routing protocol; Distributed computing; Engineering; Scalability","score_opus":0.03574682266616944,"score_gpt":0.2464392949428099,"score_spread":0.21069247227664045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006423697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032734387,0.0027073831,0.9192212,0.0015596526,0.000724115,0.0002348903,0.00032902265,0.017360816,0.025128428],"genre_scores_gemma":[0.7035658,0.002155959,0.25178128,0.0006158864,0.0007118458,0.0001838101,0.0010517138,0.00037222382,0.039561573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996276,0.00007640268,0.000023002152,0.00003755874,0.00017891788,0.00005653483],"domain_scores_gemma":[0.99952877,0.00006907071,0.000046738252,0.00012317777,0.00016493905,0.000067347384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050834013,0.0003076932,0.0003171509,0.00065168546,0.0007622369,0.0011970829,0.00076412124,0.0011284084,0.005502042],"category_scores_gemma":[0.0013751867,0.00017072019,0.00024836196,0.0005413164,0.00039829925,0.001159513,0.0011540184,0.0007964453,0.0032223018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061360974,0.00017996875,0.0022102098,0.0003357973,0.000056055178,0.0010298633,0.00027301649,0.028040433,0.07633916,0.1586365,0.052542403,0.679743],"study_design_scores_gemma":[0.00018071481,0.00063581613,0.0019897406,0.000073528834,0.00008172361,0.0022294025,0.00015811712,0.5553071,0.042392645,0.024029206,0.37282637,0.00009569731],"about_ca_topic_score_codex":0.002441507,"about_ca_topic_score_gemma":0.0022131167,"teacher_disagreement_score":0.005502042,"about_ca_system_score_codex":0.0007542763,"about_ca_system_score_gemma":0.00072950503,"threshold_uncertainty_score":0.018406153},"labels":[],"label_agreement":null},{"id":"W2006782943","doi":"10.3844/jcssp.2007.533.539","title":"Proximity Aware Routing in Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Routing (electronic design automation); Ad hoc On-Demand Distance Vector Routing; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Wireless; Network packet","score_opus":0.012351878398194698,"score_gpt":0.25582226087696663,"score_spread":0.24347038247877192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006782943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057806103,0.03542209,0.9346857,0.0012185705,0.0012327046,0.00037248107,0.00011849475,0.0016634754,0.019505909],"genre_scores_gemma":[0.28891534,0.068858124,0.61865735,0.0009932019,0.0020453595,0.0007458614,0.0006156444,0.00018867484,0.01898038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987538,0.00037904127,0.000085660264,0.00014635839,0.0005822282,0.000053049018],"domain_scores_gemma":[0.9991875,0.00040673793,0.000085098545,0.00011565103,0.00016578827,0.00003920307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076843135,0.0007735954,0.00085130235,0.0009195611,0.0008558456,0.0017970855,0.001257383,0.0016129469,0.0020860645],"category_scores_gemma":[0.002566647,0.00049164734,0.0003810766,0.0020123445,0.0008952653,0.002748236,0.00163956,0.0012092032,0.0015660907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010024136,0.00009675097,0.0010459943,0.0020295877,0.000100672376,0.0007035495,0.000513328,0.11214525,0.011883114,0.18482062,0.01970542,0.6668555],"study_design_scores_gemma":[0.000081222766,0.00040050075,0.0010010959,0.0006050531,0.00015162476,0.0027253355,0.00047807206,0.35811704,0.009421757,0.24151015,0.38533148,0.00017661157],"about_ca_topic_score_codex":0.00081659097,"about_ca_topic_score_gemma":0.00065158674,"teacher_disagreement_score":0.0020860645,"about_ca_system_score_codex":0.00049084146,"about_ca_system_score_gemma":0.00050846854,"threshold_uncertainty_score":0.006978631},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023486586340031958,"score_gpt":0.29575098711842135,"score_spread":0.27226440077838937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007217169","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008255937,0.69430834,0.2723196,0.0032308598,0.0023014124,0.00032368922,0.00036616513,0.00081066636,0.018083256],"genre_scores_gemma":[0.058033288,0.7829138,0.14386189,0.0010732036,0.003215079,0.00032657417,0.0011225083,0.00016484933,0.0092889145],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837166,0.0002781046,0.00023634752,0.00028867353,0.0006903508,0.00013481532],"domain_scores_gemma":[0.9973355,0.0010748922,0.0002241113,0.00033118564,0.00090153696,0.00013270584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021358319,0.0011751368,0.0015639113,0.0031404393,0.0011107023,0.0026446735,0.0027307537,0.001596508,0.0029752788],"category_scores_gemma":[0.004283363,0.00094453717,0.0006514461,0.006910337,0.0006557504,0.0050194873,0.0016896599,0.0019223071,0.0015946985],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015073518,0.00016030474,0.0008863797,0.004489236,0.00011669661,0.0001145134,0.000102461665,0.014311748,0.004269503,0.031320754,0.02094188,0.9231358],"study_design_scores_gemma":[0.000062657506,0.00077503256,0.0015327099,0.0017324232,0.00035942494,0.0017819102,0.00030061262,0.06288611,0.0072320215,0.04977731,0.8734265,0.00013332254],"about_ca_topic_score_codex":0.0013458116,"about_ca_topic_score_gemma":0.0012161933,"teacher_disagreement_score":0.0031404393,"about_ca_system_score_codex":0.0012013533,"about_ca_system_score_gemma":0.001906163,"threshold_uncertainty_score":0.011295497},"labels":[],"label_agreement":null},{"id":"W2007474060","doi":"10.1109/milcom.2012.6415705","title":"A multicast routing technique for tactical networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Multicast; Computer network; Computer science; Network packet; Distributed computing; Flooding (psychology); Routing (electronic design automation); Protocol Independent Multicast; Overhead (engineering)","score_opus":0.021951072550245712,"score_gpt":0.2799373865325624,"score_spread":0.2579863139823167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007474060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027868101,0.0019687605,0.95604384,0.00065917615,0.00029841642,0.00021336907,0.00012167147,0.0013408002,0.011485759],"genre_scores_gemma":[0.43373844,0.0018334062,0.5541656,0.00046420222,0.00030099432,0.00028247366,0.00032162582,0.00010588035,0.008787371],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00011127337,0.000020199923,0.00005213145,0.00018756416,0.000044477038],"domain_scores_gemma":[0.9995598,0.00012223233,0.000059112703,0.00011893837,0.00012234905,0.000017546256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006298261,0.00034607854,0.000320334,0.0008176328,0.00084406394,0.00037417552,0.0007259508,0.0006163645,0.0012998707],"category_scores_gemma":[0.0011959124,0.0001709378,0.0004417268,0.00060206227,0.00033508198,0.0008816839,0.0007953509,0.0006737958,0.00030973164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032115594,0.00012456434,0.0011496375,0.0004772369,0.00016033,0.00066419266,0.00043609773,0.030513108,0.124710806,0.07452341,0.011664895,0.7552545],"study_design_scores_gemma":[0.00017774504,0.0017089403,0.003966972,0.0002815154,0.00047712878,0.0067905183,0.00035161147,0.5302049,0.12689584,0.064955585,0.26400304,0.00018624662],"about_ca_topic_score_codex":0.00080062164,"about_ca_topic_score_gemma":0.0013793389,"teacher_disagreement_score":0.0012998707,"about_ca_system_score_codex":0.00047085807,"about_ca_system_score_gemma":0.00034054992,"threshold_uncertainty_score":0.004348457},"labels":[],"label_agreement":null},{"id":"W2007993435","doi":"10.1145/1163673.1163697","title":"MSBR","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Metric (unit); Computer science; Reliability (semiconductor); Protocol (science); Quality of service; Reliability engineering; Computer network; Engineering; Medicine","score_opus":0.005699839709942426,"score_gpt":0.1986399059458888,"score_spread":0.19294006623594637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007993435","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011255207,0.007492341,0.42428917,0.005263686,0.0060257055,0.0011258443,0.0049649742,0.021679014,0.51790404],"genre_scores_gemma":[0.16881071,0.0089227455,0.28963798,0.0048297266,0.0025224322,0.0013313781,0.014854318,0.004583296,0.5045075],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99876714,0.00021919806,0.00007662239,0.00021689323,0.00061392656,0.000106282496],"domain_scores_gemma":[0.9989881,0.00015227444,0.00006950163,0.00030693706,0.00038812877,0.000094989766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007038004,0.0006963455,0.00056117325,0.0011105293,0.00086525147,0.0018279796,0.0020364036,0.001007143,0.065492],"category_scores_gemma":[0.002308332,0.000320517,0.00041164475,0.00094151375,0.00043330897,0.0025781963,0.00253757,0.0010912716,0.03991356],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048539505,0.0001566959,0.00058644096,0.0008041831,0.000052873293,0.00033882953,0.00032475885,0.0046110596,0.017772663,0.120857045,0.23669505,0.617315],"study_design_scores_gemma":[0.000034108838,0.0000999883,0.00014863402,0.000057133486,0.000017663802,0.00035914284,0.000058175454,0.0060797813,0.0050251344,0.008509947,0.97958666,0.000023629567],"about_ca_topic_score_codex":0.0013708848,"about_ca_topic_score_gemma":0.0015619225,"teacher_disagreement_score":0.065492,"about_ca_system_score_codex":0.00065947726,"about_ca_system_score_gemma":0.00089778326,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2008050824","doi":"10.1002/dac.776","title":"MAC‐assisted topology control for<i>ad hoc</i>wireless networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Topology control; Power control; Reachability; Node (physics); Topology (electrical circuits); Wireless network; Wireless; Network topology; Transmission (telecommunications); Mobile ad hoc network; Graph; Distributed computing; Power (physics); Algorithm; Theoretical computer science; Telecommunications; Key distribution in wireless sensor networks; Mathematics; Network packet","score_opus":0.013953122403790954,"score_gpt":0.2731992003979177,"score_spread":0.25924607799412674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008050824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038257375,0.00066999893,0.9548793,0.0003361455,0.00010759168,0.000056774858,0.00004956749,0.0006991434,0.004944118],"genre_scores_gemma":[0.8894396,0.00047747054,0.106764674,0.00011795435,0.0000907534,0.00009898426,0.000101999234,0.0000615074,0.0028471535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966776,0.00014317773,0.0000169119,0.000047706733,0.00009225165,0.000032211534],"domain_scores_gemma":[0.99914896,0.0003770081,0.0001421894,0.00012540694,0.0001548179,0.000051593102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005705968,0.00047786068,0.00037879948,0.00045087136,0.0003798239,0.0006829004,0.000869637,0.0002832715,0.0010504839],"category_scores_gemma":[0.001696358,0.00016113013,0.00021798293,0.00043984147,0.0005987407,0.0009865481,0.0005220561,0.00053932564,0.00019502595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028418854,0.00010252754,0.0011818627,0.00021849318,0.00006738043,0.00018713235,0.00019442139,0.6776335,0.029167717,0.04885455,0.0041804714,0.23792769],"study_design_scores_gemma":[0.000021523214,0.00009629868,0.00025641813,0.000011970783,0.000016061877,0.00006814502,0.000026928765,0.9737346,0.0053891498,0.016371557,0.003997599,0.000009618463],"about_ca_topic_score_codex":0.00086272374,"about_ca_topic_score_gemma":0.00084697845,"teacher_disagreement_score":0.0010504839,"about_ca_system_score_codex":0.00035592282,"about_ca_system_score_gemma":0.00030707923,"threshold_uncertainty_score":0.0035141706},"labels":[],"label_agreement":null},{"id":"W2008356687","doi":"10.1145/1143549.1143576","title":"QoS support based on a mobile routing backbone for ad hoc wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Distributed computing; Quality of service; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Mobile ad hoc network; Routing protocol; Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications; Network packet","score_opus":0.008765406311536661,"score_gpt":0.22736093125950269,"score_spread":0.21859552494796602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008356687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07303032,0.0031631812,0.8994907,0.0014549154,0.0005959901,0.00029544477,0.00006367276,0.0022018005,0.019703995],"genre_scores_gemma":[0.632729,0.0023980734,0.35791847,0.00038720938,0.00058500806,0.00021514954,0.00023060098,0.00013741267,0.005399029],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.00010237348,0.000026264668,0.00004947428,0.00017550848,0.00004000128],"domain_scores_gemma":[0.9990702,0.00029812532,0.00010874225,0.00023047402,0.00020341667,0.00008909434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095038,0.00038755243,0.0002854616,0.00050630816,0.000577177,0.00101926,0.0009878277,0.0006863369,0.0015150721],"category_scores_gemma":[0.0020661887,0.00020437651,0.00018250385,0.00042207414,0.00062950054,0.002452985,0.00092912425,0.0009110989,0.0005171433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050918455,0.00028659037,0.0021042249,0.00050443877,0.00008611669,0.0005955526,0.0005253859,0.04672136,0.18548544,0.3304094,0.008231006,0.42454135],"study_design_scores_gemma":[0.00016937683,0.00114171,0.0016668253,0.00016810217,0.0001952349,0.0014193418,0.00028868686,0.69688886,0.06167713,0.10344874,0.13282429,0.00011169328],"about_ca_topic_score_codex":0.00031776924,"about_ca_topic_score_gemma":0.0004590146,"teacher_disagreement_score":0.0015150721,"about_ca_system_score_codex":0.0003998522,"about_ca_system_score_gemma":0.00034543083,"threshold_uncertainty_score":0.0050683618},"labels":[],"label_agreement":null},{"id":"W2008776104","doi":"10.1109/glocom.2013.6831120","title":"Pure asynchronous neighbor discovery algorithms in ad hoc networks using directional antennas","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Neighbor Discovery Protocol; Computer science; Asynchronous communication; Wireless ad hoc network; Initialization; Mobile ad hoc network; Distributed computing; Computer network; Asynchronous system; Vehicular ad hoc network; Algorithm; Wireless; Network packet; Telecommunications; The Internet","score_opus":0.01182732489859794,"score_gpt":0.22861457918992276,"score_spread":0.2167872542913248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008776104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015889268,0.00050275243,0.9814419,0.00007667539,0.00005809118,0.000053336247,0.0000128835145,0.00026109852,0.0017040147],"genre_scores_gemma":[0.55766594,0.0012480597,0.4353595,0.00013582235,0.00018804411,0.00025697533,0.0001223323,0.00009390543,0.004929386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984503,0.00052181905,0.000103441685,0.00024678482,0.0005588411,0.00011884647],"domain_scores_gemma":[0.9973839,0.0012733705,0.0002823586,0.00044136206,0.0005356076,0.000083380866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021751616,0.00065623055,0.000641779,0.001005378,0.0010780744,0.0012056459,0.0016760023,0.0007838218,0.00077312405],"category_scores_gemma":[0.005128527,0.00039502518,0.00042312153,0.0012017825,0.0006548317,0.0025209659,0.0008985453,0.0007497308,0.00039106325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040402845,0.00016866974,0.00299356,0.0003446209,0.00010991764,0.00014300419,0.000558729,0.47580576,0.017333694,0.17571712,0.003091991,0.32332885],"study_design_scores_gemma":[0.00005141262,0.00012503476,0.00024061489,0.000011797023,0.000033915683,0.00013552333,0.000051613442,0.96418357,0.0041083167,0.026434788,0.0046016783,0.000021741876],"about_ca_topic_score_codex":0.0011121851,"about_ca_topic_score_gemma":0.0013959656,"teacher_disagreement_score":0.0021751616,"about_ca_system_score_codex":0.00076383946,"about_ca_system_score_gemma":0.0008079011,"threshold_uncertainty_score":0.011503518},"labels":[],"label_agreement":null},{"id":"W2009091399","doi":"10.1109/secon.2010.5508258","title":"Throughput and Energy Efficiency in Wireless Ad Hoc Networks with Gaussian Channels","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Wireless ad hoc network; Computer science; Throughput; Computer network; Wireless network; Gaussian; Bandwidth (computing); Power control; Channel (broadcasting); Topology (electrical circuits); Wireless; Channel capacity; Distributed computing; Power (physics); Mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.005616999680836369,"score_gpt":0.20399349704245684,"score_spread":0.19837649736162047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009091399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13405645,0.0031881873,0.85272664,0.0011158446,0.00007566137,0.000070296184,0.00012134895,0.000422993,0.008222581],"genre_scores_gemma":[0.96041596,0.0018721565,0.03476784,0.00013914709,0.0001342321,0.00010055016,0.000069660084,0.00009999762,0.0024005575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977684,0.0010556584,0.00006578991,0.00020847259,0.000517041,0.00038468838],"domain_scores_gemma":[0.98951834,0.0088642705,0.0005886422,0.00041887508,0.0004547531,0.00015514558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034891362,0.0008856374,0.00088651717,0.0011357729,0.00064512395,0.0015242412,0.0010821337,0.00087953545,0.0007809607],"category_scores_gemma":[0.01573883,0.0004940211,0.00038061134,0.001760163,0.0025036917,0.0030001083,0.001082328,0.0006868411,0.00029517317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017489062,0.00006388366,0.0008842906,0.00008790917,0.0000463399,0.000087867425,0.000113413895,0.90589595,0.0018089117,0.07440575,0.00080389366,0.01562694],"study_design_scores_gemma":[0.000022869133,0.00005653195,0.00033280408,0.000011858355,0.000017549848,0.000041049305,0.000033383192,0.94264203,0.0011057648,0.05510797,0.00061963394,0.000008603384],"about_ca_topic_score_codex":0.0012319947,"about_ca_topic_score_gemma":0.00082839763,"teacher_disagreement_score":0.0034891362,"about_ca_system_score_codex":0.0018313045,"about_ca_system_score_gemma":0.00087807584,"threshold_uncertainty_score":0.018452525},"labels":[],"label_agreement":null},{"id":"W2009134105","doi":"10.1002/dac.506","title":"Virtual base stations for wireless mobile<i>ad hoc</i>communications: an infrastructure for the infrastructure‐less","year":2001,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Base station; Wireless ad hoc network; Quality of service; Wireless Routing Protocol; Mobile ad hoc network; Routing protocol; Ad hoc wireless distribution service; Wireless network; Distributed computing; Protocol (science); Node (physics); Mobile IP; Correctness; Optimized Link State Routing Protocol; Wireless; Mobile computing; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.025998352027882265,"score_gpt":0.3130457417607179,"score_spread":0.28704738973283567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009134105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040918246,0.00371678,0.9380861,0.0010620436,0.00068843074,0.0001369089,0.00005616684,0.00082400703,0.0145113645],"genre_scores_gemma":[0.7886713,0.004576812,0.19777426,0.00038580134,0.00050357205,0.00024013953,0.00020664002,0.00009036711,0.007551024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996146,0.00014500387,0.000019731462,0.000036622987,0.00012482854,0.000059119106],"domain_scores_gemma":[0.9992712,0.00023443277,0.00010739257,0.00015513379,0.00014718872,0.00008451781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007401162,0.00038737786,0.0002892709,0.00039551524,0.0006370668,0.0017848051,0.0013820273,0.0006245497,0.002286664],"category_scores_gemma":[0.001742374,0.00028627925,0.00028414954,0.00039649033,0.0010221082,0.0020231188,0.0010375516,0.0011122253,0.00060627674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003101418,0.00011898846,0.0016353917,0.00041732745,0.000080597434,0.0004349118,0.00040853166,0.090679854,0.049212273,0.6328302,0.010983633,0.21288821],"study_design_scores_gemma":[0.00019198889,0.000913331,0.0011700145,0.00019719268,0.00022943308,0.0009348679,0.0003480301,0.58593476,0.033123836,0.14741519,0.22943652,0.00010486396],"about_ca_topic_score_codex":0.0009277455,"about_ca_topic_score_gemma":0.00080593233,"teacher_disagreement_score":0.002286664,"about_ca_system_score_codex":0.000546151,"about_ca_system_score_gemma":0.00059214554,"threshold_uncertainty_score":0.00764966},"labels":[],"label_agreement":null},{"id":"W2010192150","doi":"10.1109/cits.2012.6220364","title":"Detecting blackhole attacks on DSR-based mobile ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Computer security; Telecommunications; Wireless; Network packet","score_opus":0.01581044807024435,"score_gpt":0.25403746498279195,"score_spread":0.2382270169125476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010192150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4106776,0.002051627,0.58037573,0.00029709633,0.00018624963,0.00040710738,0.000082409846,0.0024057154,0.0035164587],"genre_scores_gemma":[0.96350336,0.00048673034,0.035404228,0.000044044205,0.000027763052,0.000052501993,0.00004078204,0.000016774371,0.00042380576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979634,0.0008110719,0.0001417487,0.00017794655,0.00076023495,0.00014554965],"domain_scores_gemma":[0.99484235,0.0028548,0.00094617857,0.00057000195,0.0006487161,0.00013796928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015005457,0.0007999921,0.00089020253,0.0016936307,0.0004660955,0.00079421035,0.0007206993,0.000873557,0.00025316456],"category_scores_gemma":[0.00793156,0.00031762265,0.0003508757,0.0005601056,0.0007289797,0.002279042,0.0012052595,0.00046568204,0.00012080321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021103085,0.00042729347,0.013150587,0.0008922613,0.00046167412,0.0023717966,0.00081495184,0.39857337,0.20598768,0.0268326,0.0025762483,0.34580123],"study_design_scores_gemma":[0.00007828866,0.0010607644,0.0015784014,0.000036275316,0.00009485756,0.0012618031,0.00011567754,0.9506905,0.0370549,0.00558237,0.0023863127,0.000059775786],"about_ca_topic_score_codex":0.0004808107,"about_ca_topic_score_gemma":0.00038264302,"teacher_disagreement_score":0.0016936307,"about_ca_system_score_codex":0.0004384577,"about_ca_system_score_gemma":0.00037315403,"threshold_uncertainty_score":0.007935762},"labels":[],"label_agreement":null},{"id":"W2010212882","doi":"10.1109/ccece.2013.6567742","title":"Hierarchical networks: Routing and clustering (A concise survey)","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Cluster analysis; Routing (electronic design automation); Hierarchical routing; Hierarchical clustering; Computer network; Routing protocol; Artificial intelligence; Static routing","score_opus":0.016008593875572765,"score_gpt":0.22958107954918933,"score_spread":0.21357248567361656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010212882","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022982163,0.8230082,0.13779922,0.0019398592,0.0026167617,0.00014609558,0.00049140636,0.00055341556,0.03114689],"genre_scores_gemma":[0.026691886,0.87283593,0.07179813,0.0013160398,0.00447291,0.00027844094,0.0015409479,0.0002138663,0.02085183],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99941456,0.00012083622,0.00004719999,0.0001001076,0.0002646883,0.00005256779],"domain_scores_gemma":[0.9994266,0.00025920427,0.000053552914,0.00005939266,0.00016811454,0.000033193017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006079157,0.0008770261,0.0009752533,0.0022563578,0.00049215584,0.0019033336,0.0012667617,0.0014399661,0.006822934],"category_scores_gemma":[0.0012663744,0.0006249969,0.0005090592,0.006211577,0.0007441484,0.0031384737,0.0008716023,0.0012431075,0.004232162],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047048758,0.00009836214,0.0006492936,0.0045235525,0.00007239999,0.00025440066,0.0002424579,0.0129772425,0.001321436,0.07951483,0.10417988,0.7961191],"study_design_scores_gemma":[0.000010593299,0.0001084309,0.0010973397,0.001067047,0.00004607364,0.0013979303,0.00020950615,0.009527822,0.0006741266,0.07055125,0.91525775,0.000052264764],"about_ca_topic_score_codex":0.0023060585,"about_ca_topic_score_gemma":0.0018799272,"teacher_disagreement_score":0.006822934,"about_ca_system_score_codex":0.00083774235,"about_ca_system_score_gemma":0.00090388936,"threshold_uncertainty_score":0.022825003},"labels":[],"label_agreement":null},{"id":"W2010656265","doi":"10.1109/pacrim.2013.6625494","title":"Non-equilibrium statistical behaviors within common MANET routing protocols","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Ergodicity; Computer science; Mobile ad hoc network; Quality of service; Monte Carlo method; Routing protocol; Routing (electronic design automation); Ergodic theory; Quality (philosophy); Computer network; Distributed computing; Mathematics; Statistics; Network packet","score_opus":0.015583166329854608,"score_gpt":0.28242569440150356,"score_spread":0.26684252807164893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010656265","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6484497,0.000616402,0.34539986,0.00045123108,0.000052196992,0.00014738101,0.00015022165,0.00039450877,0.0043385495],"genre_scores_gemma":[0.9895886,0.00017156458,0.009546831,0.0000468676,0.000018967345,0.00009879948,0.00010215331,0.000035400673,0.00039085545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99620545,0.0015128433,0.00016788527,0.0008351727,0.00092796213,0.00035063765],"domain_scores_gemma":[0.98194283,0.009960772,0.0027709987,0.003231668,0.0016637977,0.0004299228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004548445,0.00037631666,0.0008633368,0.0014832937,0.0012228446,0.0013427768,0.0013633644,0.0008371127,0.0005504857],"category_scores_gemma":[0.024470268,0.00047219955,0.0006810085,0.0008716136,0.0028855407,0.0023726386,0.0012740636,0.0013633904,0.000112654736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017037467,0.0002520377,0.03930007,0.00021069223,0.0003433726,0.0007225861,0.0016786016,0.63751745,0.013097376,0.2821552,0.0014804207,0.023071839],"study_design_scores_gemma":[0.000010081407,0.0000956584,0.0058392026,0.000020839814,0.000029633304,0.00024898845,0.00018014015,0.89815474,0.001861323,0.09233249,0.0011829545,0.0000439588],"about_ca_topic_score_codex":0.00228521,"about_ca_topic_score_gemma":0.0025477465,"teacher_disagreement_score":0.004548445,"about_ca_system_score_codex":0.0016078079,"about_ca_system_score_gemma":0.0010149315,"threshold_uncertainty_score":0.024054766},"labels":[],"label_agreement":null},{"id":"W2010709573","doi":"10.1109/aiccsa.2013.6616479","title":"Multiparty/multimedia conferencing in mobile Ad Hoc networks for improving communications between firefighters","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University","keywords":"Computer science; Scalability; Multimedia; Wireless ad hoc network; Videoconferencing; Wireless; Mobile radio; Communications system; Mobile telephony; Computer network; Teleconference; Telecommunications","score_opus":0.02689968431829135,"score_gpt":0.26478867695363495,"score_spread":0.2378889926353436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010709573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23356147,0.0057875714,0.7403568,0.00028955136,0.00017557923,0.00031441625,0.000081336315,0.0018185471,0.017614797],"genre_scores_gemma":[0.79666597,0.001409046,0.19326639,0.000095924464,0.00012962511,0.00012473215,0.00010775023,0.00006429656,0.008136309],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.00025051722,0.000014935767,0.00004764545,0.00017743098,0.000034145232],"domain_scores_gemma":[0.99951553,0.00021127316,0.000041599098,0.00006483299,0.00012213217,0.00004470808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071671064,0.0003364944,0.00025776398,0.00049576623,0.00040334425,0.00051315664,0.0004787299,0.00045709102,0.0019707293],"category_scores_gemma":[0.0007790958,0.00014156502,0.00022253385,0.0003525394,0.00022644667,0.0006100528,0.00042206488,0.00031901803,0.0005705982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005067351,0.00030863038,0.0023660432,0.00058716576,0.000105226754,0.0007646606,0.0005042572,0.029433014,0.45505795,0.015902683,0.0038802,0.4905835],"study_design_scores_gemma":[0.00015775739,0.002748778,0.009285504,0.00013647167,0.00036163753,0.0036133623,0.0005318745,0.44814885,0.44131127,0.012201394,0.0813141,0.00018885698],"about_ca_topic_score_codex":0.00046037565,"about_ca_topic_score_gemma":0.00078344176,"teacher_disagreement_score":0.0019707293,"about_ca_system_score_codex":0.000259243,"about_ca_system_score_gemma":0.00025943117,"threshold_uncertainty_score":0.0065927505},"labels":[],"label_agreement":null},{"id":"W2011329639","doi":"10.1109/wcnc.2010.5506323","title":"Cross-Layer Optimization for Wireless Mesh Networks with Multi-Antenna Beam-Forming","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Node (physics); Computer science; Interference (communication); Directional antenna; Wireless mesh network; Wireless network; Transmission (telecommunications); Optimization problem; Antenna (radio); Computer network; Wireless; Electronic engineering; Engineering; Algorithm; Channel (broadcasting); Telecommunications","score_opus":0.015447541351677837,"score_gpt":0.2611336027664598,"score_spread":0.24568606141478197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011329639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011269593,0.0004361365,0.9866952,0.000106610176,0.000024988367,0.000015801834,0.000017057333,0.00006896464,0.00136564],"genre_scores_gemma":[0.74025303,0.0010571581,0.25286058,0.00017747856,0.0000954211,0.00021970358,0.00012934937,0.00015786685,0.0050494154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933296,0.0003916137,0.000015754664,0.00007542971,0.00010339834,0.000080871265],"domain_scores_gemma":[0.9991781,0.0005705872,0.0000919198,0.000039248374,0.00009349742,0.000026635431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017809838,0.0010244752,0.0007818845,0.00033530826,0.00028935447,0.00090020086,0.0005509376,0.000726346,0.0015035636],"category_scores_gemma":[0.0019020685,0.00047046618,0.0006462932,0.00057112484,0.0006506401,0.0009631425,0.0009792154,0.00088425784,0.00024785145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027848588,0.000019983623,0.00019243766,0.000041377385,0.00002897889,0.000025699104,0.000018061484,0.9834035,0.0014835912,0.0060457475,0.00032208502,0.008390647],"study_design_scores_gemma":[0.000004094459,0.000025253237,0.00006220504,0.0000026143305,0.0000057915236,0.000007582737,0.0000062363183,0.99743444,0.00034332843,0.0018976262,0.00020825857,0.0000024696153],"about_ca_topic_score_codex":0.0016591651,"about_ca_topic_score_gemma":0.0010888231,"teacher_disagreement_score":0.0017809838,"about_ca_system_score_codex":0.0008353111,"about_ca_system_score_gemma":0.0006640684,"threshold_uncertainty_score":0.009418845},"labels":[],"label_agreement":null},{"id":"W2011395354","doi":"10.1145/1089444.1089458","title":"Randomized energy aware routing algorithms in mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Geographic routing; Dynamic Source Routing; Static routing; Computer network; Distributed computing; Routing table; Wireless Routing Protocol; Multipath routing; Policy-based routing; Routing protocol; Randomized algorithm; Algorithm; Network packet","score_opus":0.008769767378210818,"score_gpt":0.23410031583856117,"score_spread":0.22533054846035036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011395354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014214211,0.00204678,0.979957,0.00041452868,0.00016321393,0.00011256839,0.000047164933,0.00074724754,0.0022973479],"genre_scores_gemma":[0.41369602,0.0028293976,0.578698,0.0005005899,0.00027977928,0.00054905895,0.0002672741,0.00015207448,0.0030278373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980996,0.0010260295,0.000089519745,0.00023299755,0.0004349374,0.00011697633],"domain_scores_gemma":[0.99683326,0.0021147623,0.00036651632,0.00036255075,0.00026074634,0.00006226479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001976755,0.00086851505,0.0010100103,0.0007830309,0.00075609196,0.0012561781,0.0015767502,0.0015212992,0.0011536272],"category_scores_gemma":[0.008210085,0.0004647567,0.0004435399,0.0014177104,0.0011696595,0.0024153085,0.0009905961,0.0009500404,0.00045864898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015934267,0.0000974308,0.0005505777,0.00017520743,0.00009168318,0.000088638175,0.00007240366,0.848566,0.002761171,0.06262808,0.0027924697,0.08201707],"study_design_scores_gemma":[0.00009756892,0.00013153648,0.0001117488,0.000022350654,0.000031452004,0.000109960914,0.000026934722,0.9544929,0.0011957079,0.03905394,0.004704747,0.00002107174],"about_ca_topic_score_codex":0.0009036461,"about_ca_topic_score_gemma":0.0010832739,"teacher_disagreement_score":0.001976755,"about_ca_system_score_codex":0.00067381124,"about_ca_system_score_gemma":0.0008488973,"threshold_uncertainty_score":0.010454237},"labels":[],"label_agreement":null},{"id":"W2011440385","doi":"10.1109/chinacom.2011.6158238","title":"A busy tone based medium access control scheme over vehicle-to-infrastructure communication networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Provisioning; Quality of service; Channel (broadcasting); Access control; Control channel; Wireless; Media access control; Wireless network; Telecommunications; Base station","score_opus":0.016658926393961455,"score_gpt":0.26495696829817705,"score_spread":0.2482980419042156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011440385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14024872,0.0013562151,0.8540066,0.00019969617,0.00022395753,0.00013909115,0.00004379578,0.000797358,0.0029845317],"genre_scores_gemma":[0.97278905,0.00026283765,0.025762044,0.00007082375,0.00006158722,0.00006836198,0.000026880047,0.00001278138,0.00094564236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947804,0.00014049308,0.000036357702,0.00008574854,0.00016434879,0.00009511597],"domain_scores_gemma":[0.9986179,0.0006431431,0.00018007305,0.00014243879,0.00030968545,0.000106785345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008957232,0.0004871099,0.0005370915,0.0005547516,0.0008204201,0.0007677997,0.0009935995,0.00049487955,0.0006511953],"category_scores_gemma":[0.0030108686,0.00020385142,0.00022722353,0.00041498215,0.0007131759,0.00092025753,0.00092833664,0.0005577158,0.00014862603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014332513,0.00028966434,0.0032829142,0.00052311417,0.00024001425,0.001440492,0.0011392286,0.3122172,0.26680693,0.0923386,0.0039079934,0.31638062],"study_design_scores_gemma":[0.000079616126,0.00059569674,0.00063209207,0.000017965938,0.00011387693,0.00041868258,0.00006784362,0.97291136,0.014458435,0.006598232,0.0040401574,0.000066112065],"about_ca_topic_score_codex":0.0013880044,"about_ca_topic_score_gemma":0.0017244944,"teacher_disagreement_score":0.0013880044,"about_ca_system_score_codex":0.00047380646,"about_ca_system_score_gemma":0.00064473023,"threshold_uncertainty_score":0.004737079},"labels":[],"label_agreement":null},{"id":"W2011657711","doi":"10.1109/worldcis.2013.6751012","title":"Full function Firewalls on MANETs: A routing storage and query mechanism for ROFL","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Computer network; Firewall (physics); DSRFLOW; Distributed computing; Dynamic Source Routing; Source routing; Routing protocol; Network packet","score_opus":0.010894741430672586,"score_gpt":0.20717927271697817,"score_spread":0.19628453128630557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011657711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04675537,0.0013012935,0.93236065,0.000904889,0.0003040345,0.0004606676,0.00024443073,0.012381502,0.0052871206],"genre_scores_gemma":[0.7130686,0.0009975914,0.27265522,0.00086720206,0.000522961,0.00041860546,0.0006763186,0.00081445737,0.009979116],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973464,0.0005545954,0.00037979873,0.00033291004,0.0010012938,0.00038498768],"domain_scores_gemma":[0.9928925,0.0013778603,0.0005758063,0.003874597,0.0010203278,0.00025893428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005419004,0.00076671166,0.0012752679,0.0027302606,0.0015536345,0.0033928729,0.0044245683,0.0019612992,0.0028941128],"category_scores_gemma":[0.0051611825,0.0008727109,0.00091880054,0.0011689517,0.0020953992,0.009299336,0.004043917,0.0015944161,0.00091057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026959023,0.00049978634,0.0044657025,0.0006568321,0.00031286362,0.001308713,0.0014094011,0.046341635,0.1215449,0.34009424,0.028875992,0.45179403],"study_design_scores_gemma":[0.0004159136,0.001284265,0.0024957126,0.0002731628,0.00029463763,0.0020945796,0.00047602807,0.6426895,0.14681458,0.0719303,0.1306372,0.0005941103],"about_ca_topic_score_codex":0.0017484158,"about_ca_topic_score_gemma":0.0012104408,"teacher_disagreement_score":0.005419004,"about_ca_system_score_codex":0.0014717977,"about_ca_system_score_gemma":0.0012316627,"threshold_uncertainty_score":0.028658748},"labels":[],"label_agreement":null},{"id":"W2012550458","doi":"10.1007/s11036-005-3370-y","title":"Probabilistic Power Management for Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Probabilistic logic; Node (physics); Mobile ad hoc network; Overhead (engineering); Distributed computing; Scalability; Topology (electrical circuits); Network topology; Connected dominating set; Wireless; Algorithm; Telecommunications; Network packet","score_opus":0.006374554616328747,"score_gpt":0.22941351015696626,"score_spread":0.22303895554063752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012550458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032603543,0.0015399178,0.9923375,0.00031034581,0.00011536294,0.000029834067,0.00003265479,0.00020041656,0.002173639],"genre_scores_gemma":[0.7695765,0.00652951,0.20595059,0.00029571436,0.0009915449,0.00031987156,0.00026206137,0.00022971144,0.015844459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989825,0.00032968065,0.00004954082,0.00014384398,0.00041322404,0.00008124473],"domain_scores_gemma":[0.9982333,0.0011201479,0.00014413403,0.00023169852,0.00022362487,0.000047139256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013968964,0.0006665717,0.0009586977,0.0004983406,0.0006744061,0.0012685601,0.0015890199,0.0008706669,0.0026646508],"category_scores_gemma":[0.006705232,0.0005881826,0.00042885123,0.0011139876,0.000937282,0.0024831966,0.0010386197,0.0012729106,0.0005544162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091353686,0.000054153556,0.0003904029,0.00022735729,0.000055765846,0.000065324966,0.000079656165,0.70702827,0.002386897,0.14402561,0.0047401786,0.14085509],"study_design_scores_gemma":[0.000012459541,0.000030879743,0.000139137,0.000014063253,0.000017923643,0.00005957951,0.0000133545345,0.8795052,0.0004843743,0.11570334,0.004008449,0.000011267266],"about_ca_topic_score_codex":0.0010773846,"about_ca_topic_score_gemma":0.0013218102,"teacher_disagreement_score":0.0026646508,"about_ca_system_score_codex":0.00074845436,"about_ca_system_score_gemma":0.00069298566,"threshold_uncertainty_score":0.008914173},"labels":[],"label_agreement":null},{"id":"W2012551834","doi":"10.1109/mobhoc.2006.278545","title":"Cross-Layer Optimization Framework for Rate Allocation in Wireless Multicast","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multicast; Computer network; Distributed computing; Wireless ad hoc network; Source-specific multicast; Xcast; Asynchronous communication; Protocol Independent Multicast; Pragmatic General Multicast; Wireless network; IP multicast; Wireless; Telecommunications","score_opus":0.01606733062981637,"score_gpt":0.2844581101679201,"score_spread":0.26839077953810375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012551834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010088109,0.00033847633,0.99674726,0.00010535471,0.00003517691,0.00002106895,0.000011285444,0.0000828673,0.0016497443],"genre_scores_gemma":[0.27824467,0.0016974049,0.7112727,0.00029534026,0.0003835376,0.00059835956,0.00011199902,0.00029347287,0.0071025654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998185,0.000932591,0.000061019444,0.00012691447,0.0005745049,0.00011999529],"domain_scores_gemma":[0.99922466,0.00040251928,0.00007477774,0.00007639009,0.00018956378,0.000032083448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045464267,0.0013059891,0.00085129455,0.0007401158,0.00054991664,0.0015020653,0.0018121705,0.00092659047,0.0024314078],"category_scores_gemma":[0.004117331,0.00048450628,0.0007372684,0.0008541934,0.0009110394,0.001623113,0.0013479077,0.0016548054,0.0007108505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032240016,0.000065526656,0.00014172423,0.0000757084,0.000049857612,0.00007954377,0.000094680094,0.71376073,0.001969043,0.25049958,0.0020990758,0.031132242],"study_design_scores_gemma":[0.000007667011,0.00002075646,0.0000334482,0.000008467739,0.000009983641,0.000016470683,0.0000075210123,0.97800946,0.00034939204,0.01956312,0.0019673163,0.000006337509],"about_ca_topic_score_codex":0.0018940531,"about_ca_topic_score_gemma":0.0013423453,"teacher_disagreement_score":0.0045464267,"about_ca_system_score_codex":0.0012100736,"about_ca_system_score_gemma":0.0012632103,"threshold_uncertainty_score":0.024044156},"labels":[],"label_agreement":null},{"id":"W201329864","doi":"","title":"Clustering in mobile wireless ad hoc networks: issues and approaches","year":2004,"lang":"en","type":"book","venue":"Plenum Press eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Wireless ad hoc network; Computer science; Cluster analysis; Optimized Link State Routing Protocol; Mobile ad hoc network; Ad hoc wireless distribution service; Vehicular ad hoc network; Adaptive quality of service multi-hop routing; Distributed computing; Wireless Routing Protocol; Base station; Routing protocol; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.03460864183907541,"score_gpt":0.23460844958451882,"score_spread":0.1999998077454434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201329864","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002734893,0.6068929,0.2665921,0.010337387,0.005572484,0.0002269148,0.00012818619,0.0007253909,0.106789894],"genre_scores_gemma":[0.07508749,0.6141986,0.22109447,0.0030639004,0.009044857,0.0004563818,0.00032614675,0.00032650057,0.07640175],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866843,0.00042299603,0.000066320725,0.00016649162,0.00060877163,0.00006699423],"domain_scores_gemma":[0.998599,0.00065229816,0.00008025895,0.00015856016,0.0004308709,0.00007915743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017650317,0.0012285917,0.0012300524,0.0021893324,0.0010236611,0.003562968,0.0029511969,0.0025460748,0.003148723],"category_scores_gemma":[0.0035594248,0.0008028712,0.00046525162,0.0069591478,0.0022335227,0.0057124547,0.0017991397,0.0020681904,0.002958689],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030420188,0.0000835885,0.00044776493,0.0018216572,0.000060809667,0.0002258751,0.0007154352,0.015914394,0.0006190566,0.42149362,0.086784445,0.47180292],"study_design_scores_gemma":[0.000016121136,0.000096904456,0.00065762503,0.0010780658,0.0000371755,0.000968797,0.00058469386,0.018746594,0.00037778745,0.37423387,0.6031448,0.00005758821],"about_ca_topic_score_codex":0.0018337378,"about_ca_topic_score_gemma":0.0017337945,"teacher_disagreement_score":0.003562968,"about_ca_system_score_codex":0.0014722275,"about_ca_system_score_gemma":0.0011779105,"threshold_uncertainty_score":0.010681868},"labels":[],"label_agreement":null},{"id":"W2013704887","doi":"10.1109/lcn.2014.6925755","title":"On the potential of MPT/MPR wireless networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Network packet; Wireless; Computer network; Wireless network; Wireless sensor network; Schedule; Leverage (statistics); Heuristic; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.006176241884540086,"score_gpt":0.19683033690973137,"score_spread":0.1906540950251913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013704887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032396697,0.0033141216,0.9377998,0.0017116559,0.00012314194,0.00005113341,0.0000697484,0.00020593643,0.024327701],"genre_scores_gemma":[0.64316785,0.005130544,0.34233057,0.00039152824,0.00024921296,0.00015803716,0.00009443851,0.0001452132,0.008332573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993285,0.00034175412,0.000019559468,0.00007090247,0.00015782601,0.0000815135],"domain_scores_gemma":[0.99801886,0.0014638864,0.00010295274,0.0002309356,0.000104676474,0.0000787026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017019688,0.0005454646,0.00045689978,0.000615081,0.00084443274,0.0013965447,0.0009735205,0.0006061557,0.0027263593],"category_scores_gemma":[0.0055115214,0.000414819,0.00047245636,0.0009370427,0.0017783442,0.0033528577,0.0018701926,0.0011964861,0.00054772093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014677919,0.000026013882,0.00028086719,0.00012197876,0.000020220563,0.00012354566,0.00014906617,0.50470614,0.0025237866,0.4182519,0.0019775725,0.07167205],"study_design_scores_gemma":[0.000018289044,0.00008896219,0.00008804792,0.000043555632,0.000012925571,0.00011613494,0.00007159324,0.7350621,0.0013932494,0.25341713,0.009672151,0.000015883266],"about_ca_topic_score_codex":0.001274305,"about_ca_topic_score_gemma":0.0016649369,"teacher_disagreement_score":0.0027263593,"about_ca_system_score_codex":0.0008250728,"about_ca_system_score_gemma":0.00079067325,"threshold_uncertainty_score":0.009120524},"labels":[],"label_agreement":null},{"id":"W2014296998","doi":"10.1093/ietcom/e91-b.11.3574","title":"Efficient and Secure Self-Organized Public Key Management for Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"IEICE Transactions on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Mobile ad hoc network; Key (lock); Wireless ad hoc network; Key management; Computer network; Public-key cryptography; Computer security; Vehicular ad hoc network; Telecommunications; Wireless; Cryptography; Encryption","score_opus":0.019680809742869163,"score_gpt":0.2440656961427959,"score_spread":0.22438488639992676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014296998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029691719,0.0007761577,0.96729404,0.00015932534,0.000047044137,0.000079504694,0.000022647406,0.00041322224,0.0015163473],"genre_scores_gemma":[0.8739324,0.00064470735,0.12294832,0.000064643325,0.00008507869,0.00012871958,0.00011691907,0.000030537096,0.0020487662],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884737,0.00034286355,0.000069306465,0.000115172916,0.00050691643,0.000118356365],"domain_scores_gemma":[0.99875,0.00034566483,0.00025730784,0.0004025503,0.00020394498,0.000040614363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009096664,0.0003791768,0.00048870395,0.00055032776,0.0005994693,0.0008519966,0.0011482309,0.00049725734,0.00058796426],"category_scores_gemma":[0.0018325843,0.000297012,0.00029420893,0.0005593035,0.0007111124,0.0026997714,0.0015116947,0.0005518987,0.00032997903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045262024,0.0003205404,0.0012735341,0.00038137275,0.00017367468,0.00048450654,0.00040690528,0.37381357,0.077354595,0.13710564,0.005145416,0.40308765],"study_design_scores_gemma":[0.00006608681,0.0002807336,0.00038637003,0.000020095456,0.000036144684,0.00032315287,0.000048962742,0.9469896,0.01207662,0.032360934,0.0073790974,0.000032284777],"about_ca_topic_score_codex":0.00022768938,"about_ca_topic_score_gemma":0.00031623093,"teacher_disagreement_score":0.0011482309,"about_ca_system_score_codex":0.00044664502,"about_ca_system_score_gemma":0.0006983352,"threshold_uncertainty_score":0.0048108697},"labels":[],"label_agreement":null},{"id":"W2014492395","doi":"10.1109/wcnc.2010.5506390","title":"Efficient Algorithms for Connected Dominating Sets in Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Connected dominating set; Locality; Distributed algorithm; Algorithm; Routing (electronic design automation); Flexibility (engineering); Set (abstract data type); Distributed computing; Computer network; Minimum spanning tree; Mathematics","score_opus":0.011739753426009442,"score_gpt":0.25857812668814206,"score_spread":0.24683837326213262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014492395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002075638,0.000813427,0.9935395,0.00022410431,0.00010063089,0.00027414216,0.00010657941,0.00040949372,0.0024565256],"genre_scores_gemma":[0.08509999,0.0011606759,0.9083154,0.0002068224,0.0001776476,0.0012704018,0.00052988133,0.00020693742,0.0030322007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961516,0.0016389814,0.0002880745,0.0006172043,0.0010556739,0.00024842008],"domain_scores_gemma":[0.99458045,0.003785714,0.0003260301,0.00057220325,0.0005940125,0.0001415039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039420915,0.0025918926,0.0023282163,0.0022015506,0.0016400637,0.0028388493,0.004261451,0.0022822602,0.004055031],"category_scores_gemma":[0.014811214,0.0012725391,0.0012406843,0.0036781507,0.0016841062,0.0036907606,0.0037878302,0.002486155,0.001541322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012155579,0.00012746302,0.00028298845,0.0004880871,0.00010678329,0.00010173584,0.00027720493,0.70755357,0.0012986959,0.10274015,0.008414482,0.17848732],"study_design_scores_gemma":[0.00011643589,0.00008191819,0.000069764625,0.000047136367,0.00003039602,0.00010790044,0.00007566958,0.8521891,0.00078817265,0.1387696,0.0077019413,0.000021986229],"about_ca_topic_score_codex":0.0017855078,"about_ca_topic_score_gemma":0.002959698,"teacher_disagreement_score":0.004261451,"about_ca_system_score_codex":0.0024328725,"about_ca_system_score_gemma":0.0020020306,"threshold_uncertainty_score":0.020847976},"labels":[],"label_agreement":null},{"id":"W2014692197","doi":"10.1007/s11276-006-6147-8","title":"A Constraint Formulation for Minimum-Energy Multicast Routing in Wireless Multihop Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Multicast; Distributed computing; Integer programming; Heuristic; Ad hoc wireless distribution service; Energy consumption; Relay; Routing (electronic design automation); Wireless; Optimized Link State Routing Protocol; Routing protocol; Algorithm; Telecommunications","score_opus":0.011000723514552542,"score_gpt":0.2308510834784031,"score_spread":0.21985035996385058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014692197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041584503,0.00084748253,0.98310316,0.00080598256,0.00018147037,0.00015116677,0.000575391,0.00010069158,0.010076172],"genre_scores_gemma":[0.26015225,0.0027136547,0.7175054,0.0005959539,0.00047114483,0.0010107133,0.0012742621,0.0002586354,0.016018014],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987232,0.0005210522,0.0000632168,0.00016833862,0.00039776784,0.00012642499],"domain_scores_gemma":[0.99738926,0.0019616021,0.00015286205,0.00007492138,0.00034800248,0.000073342126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020709706,0.0015105047,0.0015496056,0.00088748947,0.0008350959,0.0022845643,0.0029650046,0.0025501566,0.007860093],"category_scores_gemma":[0.0069059245,0.0010230229,0.0009379109,0.0029205075,0.00075576745,0.0026639833,0.001378618,0.0021956468,0.00085452956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053937365,0.00007470208,0.00021000145,0.0003841648,0.000044105724,0.00028705577,0.000085198466,0.87475306,0.0007780506,0.08645543,0.0071776197,0.029696746],"study_design_scores_gemma":[0.00002962219,0.00002595018,0.00009142508,0.000049113936,0.000015319443,0.000058655463,0.00003564596,0.96955496,0.00027426964,0.02554077,0.004312002,0.000012292556],"about_ca_topic_score_codex":0.009522413,"about_ca_topic_score_gemma":0.009707619,"teacher_disagreement_score":0.009522413,"about_ca_system_score_codex":0.0015168765,"about_ca_system_score_gemma":0.0016026701,"threshold_uncertainty_score":0.026294649},"labels":[],"label_agreement":null},{"id":"W2015247078","doi":"10.1109/mmsp.2006.285340","title":"Scalable Video Multicast over MANETs","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Multicast; Computer network; Scalability; Mobile ad hoc network; Codec; Bandwidth (computing); Scalable Video Coding; Real-time computing; Network packet; Computer hardware","score_opus":0.007293541457033475,"score_gpt":0.2189852631194444,"score_spread":0.21169172166241093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015247078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07799983,0.0039694286,0.9027011,0.00074354565,0.0003135867,0.00017475733,0.00017518115,0.0019992478,0.011923383],"genre_scores_gemma":[0.83188313,0.0022044133,0.1608989,0.00021715093,0.00025332978,0.00013556055,0.00029422174,0.000054754288,0.0040584537],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997348,0.00007381141,0.00001177065,0.000035143687,0.00010569418,0.000038725288],"domain_scores_gemma":[0.99974245,0.00009666188,0.000025577136,0.00004393527,0.00006799657,0.000023286737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041160593,0.00032069642,0.00035505288,0.0005293223,0.00044690652,0.00042491156,0.0005293062,0.00037199276,0.0010396556],"category_scores_gemma":[0.0008985055,0.000116094336,0.00018539572,0.0005623874,0.00021227605,0.0008201751,0.00067055627,0.0003860172,0.00021145085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044934242,0.00013090168,0.0010904521,0.00042428446,0.0001246054,0.00084527634,0.00030375758,0.244435,0.065233424,0.092452906,0.011164776,0.58334535],"study_design_scores_gemma":[0.000057134053,0.00024279687,0.00043690606,0.000030410178,0.000040581777,0.00035530273,0.00009689806,0.9227,0.01079139,0.043156203,0.022069404,0.000022887874],"about_ca_topic_score_codex":0.0008348846,"about_ca_topic_score_gemma":0.00089756685,"teacher_disagreement_score":0.0010396556,"about_ca_system_score_codex":0.00031132056,"about_ca_system_score_gemma":0.00025591662,"threshold_uncertainty_score":0.0034779906},"labels":[],"label_agreement":null},{"id":"W2015302176","doi":"10.5555/365411.365546","title":"Stability preserving transformations: packet routing networks with edge capacities and speeds","year":2001,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Network packet; Routing (electronic design automation); Stability (learning theory); Static routing; Distributed computing; Routing protocol; Topology (electrical circuits); Mathematical optimization; Computer network; Mathematics","score_opus":0.019615042922626363,"score_gpt":0.21460026449721417,"score_spread":0.1949852215745878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015302176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21182178,0.00016737028,0.77642405,0.0005241726,0.000055826567,0.00005666339,0.000103175014,0.00042378312,0.010423185],"genre_scores_gemma":[0.9870041,0.00012588614,0.010734491,0.000044520093,0.000025826475,0.0000256295,0.000031941297,0.00003484289,0.001972666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.00027215047,0.000032682154,0.00014114956,0.00018431329,0.00014134822],"domain_scores_gemma":[0.996591,0.0017102512,0.00057909876,0.0006676112,0.00027063652,0.00018150867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000923057,0.0005457901,0.00050587975,0.00041680547,0.00065162923,0.0009858392,0.0007315187,0.0006488888,0.0016636763],"category_scores_gemma":[0.0063932748,0.00020778779,0.00056336087,0.0005019856,0.0019380058,0.0027155755,0.0017510193,0.0012669234,0.0002305276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017734159,0.000049712376,0.00054078473,0.00003576696,0.000036798476,0.0003217286,0.0002229731,0.69081503,0.010493053,0.27932218,0.00074166723,0.017242901],"study_design_scores_gemma":[0.000010710187,0.00005683022,0.00014018557,0.0000042622014,0.000009849464,0.00006519402,0.000041266278,0.87369394,0.0029746722,0.122272916,0.0007212024,0.0000089967525],"about_ca_topic_score_codex":0.0014201704,"about_ca_topic_score_gemma":0.00059551286,"teacher_disagreement_score":0.0016636763,"about_ca_system_score_codex":0.0008350303,"about_ca_system_score_gemma":0.00045495643,"threshold_uncertainty_score":0.0060586333},"labels":[],"label_agreement":null},{"id":"W2016444633","doi":"10.1049/iet-com:20060224","title":"Cross-layer distributed approach for optimal rate allocation for homogeneous wireless multicast","year":2007,"lang":"en","type":"article","venue":"IET Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Distributed computing; Xcast; Pragmatic General Multicast; Wireless network; Protocol Independent Multicast; Wireless ad hoc network; Asynchronous communication; Distributed algorithm; Heterogeneous network; Wireless","score_opus":0.04813557615985369,"score_gpt":0.3299883542239474,"score_spread":0.2818527780640937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016444633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032172205,0.00010343819,0.9956411,0.000048353297,0.000019394227,0.00001963834,0.0000033424408,0.00009522269,0.0008522981],"genre_scores_gemma":[0.48161718,0.00032514724,0.5140176,0.00013451013,0.0001121058,0.0002103586,0.00003832201,0.00013201043,0.0034127352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877745,0.00045492884,0.000057400204,0.00016468733,0.00043273665,0.00011269432],"domain_scores_gemma":[0.99868387,0.00072500913,0.00011103329,0.00015793976,0.00027112366,0.00005101974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032288914,0.00079171825,0.0008977759,0.0006704866,0.0005284353,0.001346883,0.0017061149,0.00089306565,0.0018085385],"category_scores_gemma":[0.0038824843,0.00048569927,0.0006241011,0.0006512384,0.00090363325,0.0011791122,0.0013090763,0.0010995955,0.00043190503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009029853,0.000098917735,0.00023929546,0.000057621,0.00006757767,0.00009477112,0.00015022143,0.8740574,0.005802634,0.064607255,0.0010362095,0.053697757],"study_design_scores_gemma":[0.000010964303,0.000019961226,0.000019716368,0.0000017652052,0.000005511673,0.00001208527,0.000004969145,0.99550533,0.00050464494,0.0035133148,0.00039818135,0.0000035884368],"about_ca_topic_score_codex":0.0013391249,"about_ca_topic_score_gemma":0.0011939558,"teacher_disagreement_score":0.0032288914,"about_ca_system_score_codex":0.0011681508,"about_ca_system_score_gemma":0.0010186951,"threshold_uncertainty_score":0.017076194},"labels":[],"label_agreement":null},{"id":"W2016884675","doi":"10.1145/1454503.1454550","title":"A hybrid-routing based intra-domain mobility management scheme for wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Mobility management; Handover; Routing (electronic design automation); Distributed computing; Scheme (mathematics); Dynamic Source Routing; Wireless ad hoc network; Routing protocol; Wireless; Wireless network; Telecommunications","score_opus":0.01516895177005139,"score_gpt":0.23028333515450425,"score_spread":0.21511438338445285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016884675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045770988,0.0013280301,0.94251555,0.0004289271,0.0003957752,0.00019408575,0.00015406602,0.0014461621,0.0077663963],"genre_scores_gemma":[0.6539757,0.0007323582,0.3334387,0.00025931836,0.00020335185,0.00027320214,0.0006005789,0.00008843168,0.010428377],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997309,0.00007866795,0.000024424939,0.00004133146,0.000090743786,0.000033977456],"domain_scores_gemma":[0.99968076,0.000050500566,0.000039421924,0.00010490139,0.000099525154,0.000024946672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205103,0.0002939465,0.00028532065,0.0005293097,0.00046903532,0.00036639968,0.0010862764,0.00047840396,0.0011945013],"category_scores_gemma":[0.00064324774,0.000105383435,0.000289432,0.0003783476,0.00026696993,0.0010152855,0.00077613874,0.00046625698,0.0004851748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004217349,0.00017639053,0.0012041455,0.00025096608,0.00012170313,0.0002932692,0.00023330929,0.03225357,0.20632009,0.06005497,0.008458341,0.6902115],"study_design_scores_gemma":[0.00012330279,0.0012596431,0.0027828973,0.0000605319,0.00017455022,0.0019185359,0.00012213888,0.7682581,0.076072164,0.02333573,0.12570585,0.00018656468],"about_ca_topic_score_codex":0.00033308662,"about_ca_topic_score_gemma":0.0006241106,"teacher_disagreement_score":0.0011945013,"about_ca_system_score_codex":0.00032695188,"about_ca_system_score_gemma":0.00020058698,"threshold_uncertainty_score":0.0039960146},"labels":[],"label_agreement":null},{"id":"W2017280665","doi":"10.1002/dac.853","title":"Integration of mobility and intrusion detection for wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobility model; Metric (unit); Mobile ad hoc network; Wireless ad hoc network; Waypoint; Intrusion detection system; Obstacle; Markov chain; Scheme (mathematics); Vehicular ad hoc network; Computer network; Wireless; Distributed computing; Network packet; Real-time computing; Data mining; Machine learning; Telecommunications","score_opus":0.013001155011868945,"score_gpt":0.26343356268355594,"score_spread":0.250432407671687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017280665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18775713,0.00079967483,0.80716103,0.00053225644,0.00010912359,0.000074166644,0.00002427978,0.001059731,0.002482615],"genre_scores_gemma":[0.9601816,0.00023460513,0.039030366,0.00004652921,0.000043366108,0.000021106069,0.00002411635,0.00002042715,0.00039788452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892896,0.00044286062,0.00007390237,0.00015621829,0.00029766385,0.00010032087],"domain_scores_gemma":[0.9960802,0.002143991,0.0005492303,0.00047194105,0.0005978761,0.00015682289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013683204,0.00047924105,0.0005712425,0.0007558218,0.00032348244,0.00071865035,0.00071462506,0.0004056579,0.0003618409],"category_scores_gemma":[0.006174856,0.00026478257,0.00042437718,0.00050806545,0.00089767284,0.0015259947,0.0009506041,0.0005802889,0.0001011201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006290759,0.00022964428,0.042783305,0.00018516586,0.00032324417,0.0005895003,0.00028972837,0.49090263,0.042400584,0.030754635,0.0017681755,0.3891442],"study_design_scores_gemma":[0.000008909922,0.00018699277,0.0022811424,0.000012144982,0.000051815696,0.00026864652,0.00003300747,0.98226124,0.008717486,0.00531659,0.0008433164,0.000018800923],"about_ca_topic_score_codex":0.0015745005,"about_ca_topic_score_gemma":0.001075902,"teacher_disagreement_score":0.0015745005,"about_ca_system_score_codex":0.0005516108,"about_ca_system_score_gemma":0.00043690833,"threshold_uncertainty_score":0.007236421},"labels":[],"label_agreement":null},{"id":"W2017300675","doi":"10.1007/s10586-007-0009-8","title":"Enabling ad-hoc collaboration between mobile users in the $\\mathcal{MESSENGER}$ project","year":2007,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; World Wide Web; Wireless ad hoc network; Web service; Telecommunications; Wireless","score_opus":0.022454425732741777,"score_gpt":0.29919943913432806,"score_spread":0.2767450134015863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017300675","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5759799,0.0006206662,0.37241974,0.0022767943,0.0003128842,0.0004151805,0.00016944153,0.004709199,0.043096133],"genre_scores_gemma":[0.9176295,0.00016618702,0.073073566,0.00013669168,0.000043883123,0.00014818877,0.00013702006,0.00011279307,0.008552243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993112,0.00028593699,0.000018670326,0.00008169458,0.0001646459,0.00013783798],"domain_scores_gemma":[0.9990146,0.0003470178,0.000055630735,0.00014589571,0.00012288298,0.00031399206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011699989,0.0002818427,0.00032020485,0.00031331132,0.0012426926,0.0010551317,0.00082382327,0.0009091084,0.002773693],"category_scores_gemma":[0.0014713346,0.00019212159,0.00017730115,0.00039190968,0.00055296306,0.0015286752,0.0021628148,0.0006971618,0.0006683319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004353659,0.0021293683,0.0073528676,0.00042134683,0.000095288924,0.0018890777,0.0045183385,0.045208275,0.20272136,0.18106785,0.048374146,0.5018684],"study_design_scores_gemma":[0.0005980816,0.0014702778,0.0036863312,0.00008261756,0.00013216154,0.0009075672,0.0032957576,0.6404467,0.12475679,0.0831166,0.1413745,0.00013270375],"about_ca_topic_score_codex":0.0018907243,"about_ca_topic_score_gemma":0.002828796,"teacher_disagreement_score":0.002773693,"about_ca_system_score_codex":0.00032439813,"about_ca_system_score_gemma":0.0009123729,"threshold_uncertainty_score":0.009278953},"labels":[],"label_agreement":null},{"id":"W2017319093","doi":"10.1109/icccn.2013.6614114","title":"Channel Requirements for Interference-Free Wireless Mesh Networks to Achieve Maximum Throughput","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Throughput; Shared mesh; Switched mesh; Channel (broadcasting); Interference (communication); Mesh networking; Power control; Node (physics); Wireless network; Order One Network Protocol; Topology (electrical circuits); Radio resource management; Channel allocation schemes; Wireless; Power (physics); Telecommunications; Engineering","score_opus":0.02922618502140331,"score_gpt":0.2608461157683361,"score_spread":0.2316199307469328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017319093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08403103,0.0005146053,0.909789,0.00016544273,0.000038609607,0.00006780696,0.00009103512,0.00046358164,0.004838914],"genre_scores_gemma":[0.8846465,0.00037333727,0.113815166,0.00006425887,0.00004860344,0.00018053186,0.00009623464,0.00008465935,0.00069073983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.00025192526,0.000027272456,0.00006145075,0.0001809531,0.00009344758],"domain_scores_gemma":[0.9976412,0.0017405665,0.00021253029,0.00013209452,0.00020789729,0.00006580059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007711272,0.00043148527,0.00046397172,0.00049036095,0.0004433826,0.00046716593,0.0006394726,0.00029347048,0.0013317581],"category_scores_gemma":[0.004231519,0.00026816202,0.00018099253,0.00043936475,0.00038312646,0.0009102998,0.000573887,0.00040514523,0.00022233515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001920229,0.000077572724,0.0008911226,0.0001958035,0.00002165218,0.00015780948,0.00009398195,0.88708705,0.042044386,0.023643563,0.0014225424,0.04417245],"study_design_scores_gemma":[0.000023247312,0.00010235189,0.0003764912,0.000011765131,0.000010058606,0.000096045864,0.000031557513,0.97745204,0.008532099,0.01201936,0.0013328864,0.0000120698905],"about_ca_topic_score_codex":0.0005757358,"about_ca_topic_score_gemma":0.0008750311,"teacher_disagreement_score":0.0013317581,"about_ca_system_score_codex":0.00041574775,"about_ca_system_score_gemma":0.0004834275,"threshold_uncertainty_score":0.004455149},"labels":[],"label_agreement":null},{"id":"W2017518596","doi":"10.1109/icdt.2006.34","title":"Distributed Connection Admission Control and Dynamic Channel Allocation in Ad hoc-Cellular Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Distributed computing; Hop (telecommunications); Distributed algorithm; Wireless network; Wireless; Load balancing (electrical power); Admission control; Quality of service; Telecommunications","score_opus":0.004494812778429801,"score_gpt":0.19992985581606149,"score_spread":0.19543504303763168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017518596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016645322,0.001568117,0.9759294,0.0005016969,0.0002059297,0.000071184026,0.000031851745,0.00041759363,0.0046289754],"genre_scores_gemma":[0.9116073,0.0013412716,0.08205915,0.000158312,0.00043981473,0.00024862855,0.0000748049,0.000050394883,0.0040202937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976373,0.0009038486,0.00009151148,0.00035964683,0.00073649985,0.00027128882],"domain_scores_gemma":[0.99727625,0.0015428271,0.00022536526,0.00038620277,0.00042193328,0.00014739684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002455774,0.0006750649,0.0008090425,0.0007961944,0.0009856152,0.0016368118,0.001863794,0.0009723874,0.001100645],"category_scores_gemma":[0.0050245435,0.0003654877,0.00033638693,0.0013823267,0.0019086248,0.0015450338,0.001417248,0.0014503498,0.00020560356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016694222,0.000103680126,0.0011576865,0.00011316891,0.00006224097,0.0001593056,0.00023764401,0.64194196,0.0033202358,0.22986363,0.0031494866,0.119724005],"study_design_scores_gemma":[0.000022602328,0.000022297967,0.00013215032,0.000007081769,0.000011467254,0.000028005948,0.000020397994,0.9617949,0.00071629515,0.034600675,0.0026337523,0.000010400129],"about_ca_topic_score_codex":0.0054860297,"about_ca_topic_score_gemma":0.0037221916,"teacher_disagreement_score":0.0054860297,"about_ca_system_score_codex":0.0018586817,"about_ca_system_score_gemma":0.0022201405,"threshold_uncertainty_score":0.01348573},"labels":[],"label_agreement":null},{"id":"W201837444","doi":"","title":"Position-based routing algorithms for three-dimensional ad hoc networks","year":2009,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Connected dominating set; Computer science; Spanning tree; Algorithm; Destination-Sequenced Distance Vector routing; Theoretical computer science; Mathematics; Minimum spanning tree; Combinatorics; Routing (electronic design automation); Link-state routing protocol; Routing protocol; Computer network","score_opus":0.02279322233751263,"score_gpt":0.2751361618685168,"score_spread":0.2523429395310042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W201837444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033221343,0.0007473163,0.99263656,0.00015299045,0.00009566559,0.000102644386,0.00007861316,0.0006304459,0.0022336524],"genre_scores_gemma":[0.10453551,0.0015932245,0.8874099,0.00015886402,0.00008934508,0.00038715985,0.00055489724,0.00015357681,0.005117467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932337,0.00014009394,0.00005557967,0.00016381391,0.0002650357,0.00005205923],"domain_scores_gemma":[0.99916756,0.00026417506,0.00010014741,0.00023955021,0.00019653629,0.000032069198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058218016,0.0010253921,0.0007519972,0.0010684432,0.000992467,0.0014848263,0.0018203364,0.0007875587,0.0028675133],"category_scores_gemma":[0.0026625493,0.000413788,0.0006919245,0.0018798574,0.0007343209,0.0024509635,0.0019103413,0.0012701929,0.0014328689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008744144,0.00007591235,0.00048950454,0.00025626746,0.000059782247,0.00007262296,0.00018822285,0.46920502,0.0054446585,0.11256844,0.009671098,0.401881],"study_design_scores_gemma":[0.000035693487,0.00007665051,0.00015650684,0.000029405275,0.00001923561,0.000109608794,0.00006728072,0.89169395,0.0030881264,0.08797937,0.016715776,0.000028412425],"about_ca_topic_score_codex":0.0027374912,"about_ca_topic_score_gemma":0.003128945,"teacher_disagreement_score":0.0028675133,"about_ca_system_score_codex":0.0012648471,"about_ca_system_score_gemma":0.0010317262,"threshold_uncertainty_score":0.009592831},"labels":[],"label_agreement":null},{"id":"W2018748865","doi":"10.1016/j.tcs.2008.06.011","title":"Games to induce specified equilibria","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nash equilibrium; Computer science; Context (archaeology); Strategy; Repeated game; Mathematical economics; Best response; Node (physics); Range (aeronautics); Sequential game; Game theory; Non-cooperative game; Channel (broadcasting); A priori and a posteriori; Mathematical optimization; Mathematics; Computer network","score_opus":0.020088089347125367,"score_gpt":0.2498175850807489,"score_spread":0.22972949573362353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018748865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11477542,0.00018700138,0.7243095,0.0038448784,0.0002728444,0.0008513984,0.0006812552,0.0012179593,0.15385965],"genre_scores_gemma":[0.86414117,0.00025612296,0.08716785,0.0012050956,0.00008327626,0.0013717246,0.0006654764,0.0003124959,0.04479683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972007,0.0012533949,0.00020309046,0.0003069828,0.000490054,0.0005458281],"domain_scores_gemma":[0.991672,0.0049604666,0.00048600862,0.0010169634,0.0009461682,0.0009183425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002572699,0.0010591102,0.0009991437,0.0011023496,0.0019087256,0.0033311378,0.0018853829,0.0023148938,0.0146739315],"category_scores_gemma":[0.015044253,0.0007803459,0.0019737282,0.0010041642,0.0021865177,0.004921002,0.004929588,0.004790634,0.0017132808],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006957089,0.000060757993,0.000110197034,0.000042239153,0.000014195444,0.000042773303,0.00014937781,0.0022933353,0.00054781116,0.99213916,0.0013169126,0.0032136752],"study_design_scores_gemma":[0.000108850334,0.000040604522,0.00006890653,0.000021892965,0.00001874504,0.000040293413,0.00007123122,0.021712009,0.001096778,0.9736415,0.003167546,0.000011639249],"about_ca_topic_score_codex":0.0008151007,"about_ca_topic_score_gemma":0.0016192888,"teacher_disagreement_score":0.0146739315,"about_ca_system_score_codex":0.0022723607,"about_ca_system_score_gemma":0.0020914525,"threshold_uncertainty_score":0.049089134},"labels":[],"label_agreement":null},{"id":"W2019920090","doi":"10.1016/j.comnet.2010.01.001","title":"Special issue on “Wireless Multi-Hop Networking for Infrastructure Access”","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless; Hop (telecommunications); Telecommunications; Wireless network","score_opus":0.01553892032751443,"score_gpt":0.26640746986075364,"score_spread":0.2508685495332392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019920090","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075905223,0.0232286,0.004912836,0.012465659,0.8719214,0.00019634381,0.00038542855,0.0003763039,0.08575423],"genre_scores_gemma":[0.0048077567,0.031278748,0.0018625365,0.005437837,0.7292172,0.00019320623,0.0011759228,0.00040337784,0.22562346],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99864286,0.00019590084,0.00012638504,0.00027034595,0.00061181077,0.00015263654],"domain_scores_gemma":[0.9964414,0.0008399091,0.00025947273,0.00026850853,0.001495682,0.00069514103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015436308,0.0027556547,0.0031679766,0.0039228476,0.0016539366,0.004548406,0.0022960256,0.00375386,0.08583087],"category_scores_gemma":[0.0032900493,0.00057661365,0.0014857571,0.0025602765,0.0008779236,0.0036301403,0.0016982566,0.0028158836,0.033513542],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006278897,0.000051060026,0.00013002128,0.0004720765,0.00003066254,0.00013650578,0.000009326706,0.0002442085,0.0007329925,0.0030527771,0.95378786,0.04128961],"study_design_scores_gemma":[0.000013928408,0.00008381589,0.00049224327,0.00013450188,0.00003438941,0.00023768895,0.000013140752,0.0008019681,0.0003181397,0.0018123173,0.99604213,0.000015690717],"about_ca_topic_score_codex":0.000660926,"about_ca_topic_score_gemma":0.001686546,"teacher_disagreement_score":0.08583087,"about_ca_system_score_codex":0.0012341412,"about_ca_system_score_gemma":0.0011292552,"threshold_uncertainty_score":0.28713286},"labels":[],"label_agreement":null},{"id":"W2020263958","doi":"10.1002/wcm.1126","title":"Architectures and protocols for wireless mesh, ad hoc, and sensor networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless mesh network; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Wireless sensor network; Vehicular ad hoc network; Key distribution in wireless sensor networks; Wireless network; Optimized Link State Routing Protocol; Telecommunications; Wireless","score_opus":0.0369146653079701,"score_gpt":0.2879209071230367,"score_spread":0.2510062418150666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020263958","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011303895,0.13417532,0.7132302,0.0093273865,0.05858642,0.0012764349,0.00091347966,0.0070410543,0.07431929],"genre_scores_gemma":[0.018219793,0.22530238,0.5457571,0.0076681427,0.03454883,0.0027717361,0.0043099546,0.002696046,0.15872602],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99713147,0.0004633495,0.0003355483,0.00022459215,0.0017017195,0.00014335402],"domain_scores_gemma":[0.99698764,0.0010128292,0.00024164573,0.00045014586,0.0010700781,0.00023770434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025749528,0.001967488,0.0015070302,0.0032708535,0.00091225514,0.0026007192,0.0036059527,0.0029791275,0.02120129],"category_scores_gemma":[0.005177814,0.00095755985,0.0010488504,0.0041105812,0.0015976629,0.0057041277,0.0023648762,0.0060807317,0.017873775],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005616406,0.0001089526,0.00021125816,0.0020266022,0.00009992466,0.00038362562,0.00018289279,0.005674314,0.003601019,0.11206304,0.35428163,0.5213106],"study_design_scores_gemma":[0.000019011057,0.000075541946,0.0001689646,0.0003319398,0.000034335986,0.0006298534,0.000052226467,0.009847873,0.00064075977,0.047210254,0.94093406,0.000055121596],"about_ca_topic_score_codex":0.00114836,"about_ca_topic_score_gemma":0.0016683453,"teacher_disagreement_score":0.02120129,"about_ca_system_score_codex":0.0009513285,"about_ca_system_score_gemma":0.0018478605,"threshold_uncertainty_score":0.070925355},"labels":[],"label_agreement":null},{"id":"W2020486957","doi":"10.1109/iscc.2003.1214222","title":"CSMA/IC: a new class of collision-free MAC protocols for ad hoc wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Multiple Access with Collision Avoidance for Wireless; Computer network; Computer science; Carrier sense multiple access with collision avoidance; Hidden node problem; Wireless ad hoc network; Countdown; Throughput; Network packet; Collision; Network allocation vector; Quality of service; Media access control; Wireless network; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless; Optimized Link State Routing Protocol; IEEE 802.11; Routing protocol; Wi-Fi array; Computer security; Engineering; Telecommunications","score_opus":0.020153040916637742,"score_gpt":0.27387107235909747,"score_spread":0.25371803144245975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020486957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050919307,0.011995134,0.97007746,0.0004998855,0.0015061757,0.0003598233,0.00012560151,0.0026199794,0.007724095],"genre_scores_gemma":[0.1988772,0.023032546,0.7494464,0.0017396413,0.003829305,0.0016305941,0.0008063875,0.0005069355,0.020131044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997903,0.00027162879,0.0001904152,0.0002112385,0.0012719923,0.0001517076],"domain_scores_gemma":[0.99836236,0.000465317,0.00026681068,0.00025793727,0.0005141842,0.00013341762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019741228,0.0012923484,0.0009776484,0.0017941694,0.00096139783,0.0016998305,0.002597667,0.001190813,0.002168217],"category_scores_gemma":[0.003731045,0.00041798025,0.0005866737,0.0018300436,0.0011350461,0.0033629397,0.0011912164,0.0028087236,0.001228112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041229487,0.0002690274,0.001134229,0.0013395044,0.00023274498,0.0003931038,0.00043975876,0.01612627,0.066621035,0.13710912,0.029277353,0.74664557],"study_design_scores_gemma":[0.00031437608,0.0012617694,0.0010688974,0.0003180562,0.0004181825,0.0024072016,0.00017094084,0.22575349,0.07764179,0.051876955,0.6384993,0.0002689405],"about_ca_topic_score_codex":0.0010839475,"about_ca_topic_score_gemma":0.000947471,"teacher_disagreement_score":0.002597667,"about_ca_system_score_codex":0.00068953267,"about_ca_system_score_gemma":0.0012720423,"threshold_uncertainty_score":0.01044029},"labels":[],"label_agreement":null},{"id":"W2020637814","doi":"10.1145/1400713.1400736","title":"Simulation and performance evaulation of AMR-WB with adaptive rate control for VoIP on wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless ad hoc network; Voice over IP; Computer network; PESQ; Wireless; Wireless network; Coding (social sciences); Adaptive quality of service multi-hop routing; Adaptive control; Bandwidth (computing); Mobile ad hoc network; Vehicular ad hoc network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Control (management); Telecommunications; Network packet; Artificial intelligence; The Internet","score_opus":0.01747955518406107,"score_gpt":0.2277465694235385,"score_spread":0.2102670142394774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020637814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007647,0.00034699278,0.0837452,0.00043736718,0.000081742546,0.0001881983,0.00050350215,0.00068300904,0.013249318],"genre_scores_gemma":[0.98969954,0.00017151085,0.008537842,0.000032483422,0.000008011418,0.00010027647,0.0001668719,0.000021001437,0.0012624781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995172,0.00023567554,0.000023521738,0.000030193436,0.000105458945,0.00008795842],"domain_scores_gemma":[0.998116,0.0012847346,0.000137743,0.00010795921,0.00028095444,0.00007258809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010543584,0.0005985487,0.0005100802,0.0006833981,0.00036718274,0.00047715544,0.00080006756,0.0008201059,0.0015359882],"category_scores_gemma":[0.0025926211,0.00025615096,0.00038762408,0.00053775567,0.0004677628,0.00074428815,0.00040592984,0.00058487477,0.00014717528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000506785,0.000054882246,0.0010439543,0.000016395496,0.000011693409,0.000036669488,0.000027037868,0.9955812,0.00050573447,0.0011011672,0.00014272727,0.0014278834],"study_design_scores_gemma":[0.000008618118,0.00004170724,0.00014579,0.0000024944618,0.0000036384376,0.000005730298,0.000009749267,0.999169,0.00033974377,0.00017098711,0.00010013294,0.0000024006993],"about_ca_topic_score_codex":0.0118109,"about_ca_topic_score_gemma":0.00530519,"teacher_disagreement_score":0.0118109,"about_ca_system_score_codex":0.00087428064,"about_ca_system_score_gemma":0.00057141157,"threshold_uncertainty_score":0.02348429},"labels":[],"label_agreement":null},{"id":"W2020662527","doi":"10.1109/tmc.2010.152","title":"Distributed Multi-Interface Multichannel Random Access Using Convex Optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Channel (broadcasting); Node (physics); Wireless ad hoc network; Channel allocation schemes; Optimization problem; Interface (matter); Convex optimization; Distributed algorithm; Mathematical optimization; Algorithm; Random access; Throughput; Wireless; Distributed computing; Computer network; Regular polygon; Mathematics","score_opus":0.02669440846908288,"score_gpt":0.30193889635787863,"score_spread":0.27524448788879574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020662527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035826655,0.00016401416,0.9947955,0.000098258686,0.000010383052,0.000029920375,0.000014729972,0.00015681746,0.0011478319],"genre_scores_gemma":[0.55860925,0.00077436725,0.4364338,0.00013557894,0.00007094888,0.00047011508,0.0001484335,0.00015592783,0.003201565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777526,0.0014534083,0.00005073292,0.00023201708,0.00033571257,0.0001528744],"domain_scores_gemma":[0.9976078,0.0017960398,0.000199744,0.00016597302,0.0001788565,0.00005146805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025901007,0.0013438341,0.0012873545,0.00050428545,0.00038721264,0.0014125584,0.0012386858,0.0007345228,0.0013117072],"category_scores_gemma":[0.004652358,0.0004497645,0.00069020625,0.00094775675,0.0010491823,0.0013417362,0.0011435105,0.0011864399,0.00047862448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039522663,0.000038527563,0.00014439608,0.00003760196,0.000020895297,0.000025086363,0.000021708036,0.9600296,0.0005206974,0.017526146,0.0006710534,0.020924702],"study_design_scores_gemma":[0.000006664212,0.000010227519,0.000016335225,0.0000015315894,0.0000022577558,0.000005669349,0.000002521939,0.9964449,0.00015487023,0.003178599,0.00017438902,0.0000020642246],"about_ca_topic_score_codex":0.002482789,"about_ca_topic_score_gemma":0.0023145073,"teacher_disagreement_score":0.0025901007,"about_ca_system_score_codex":0.0013808893,"about_ca_system_score_gemma":0.0012227335,"threshold_uncertainty_score":0.013697922},"labels":[],"label_agreement":null},{"id":"W2020816751","doi":"10.1007/s11276-006-6155-8","title":"Performance Study of Proactive Flow Handoff for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Victoria","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Handover; Routing (electronic design automation); Overhead (engineering); Distributed computing; Wireless Routing Protocol; Routing protocol; Vehicular ad hoc network; Path (computing); Destination-Sequenced Distance Vector routing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Wireless; Dynamic Source Routing; Telecommunications","score_opus":0.008472984832178853,"score_gpt":0.21948248017522862,"score_spread":0.21100949534304977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020816751","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90245783,0.0040985,0.08330934,0.0006068393,0.0002554057,0.00016307956,0.00026137172,0.0005391661,0.008308515],"genre_scores_gemma":[0.99539715,0.00026603093,0.003463084,0.000026634429,0.00006257239,0.000010942284,0.000063409796,0.00001910628,0.0006911359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734783,0.0008598203,0.00008948244,0.0002277793,0.0009823618,0.0004926536],"domain_scores_gemma":[0.9867026,0.009976948,0.0005188218,0.00059471873,0.0018000187,0.00040692996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039244057,0.0010618217,0.0008773266,0.0012765712,0.00080524565,0.001150042,0.0010457569,0.0005600212,0.0021970712],"category_scores_gemma":[0.011265027,0.00024075004,0.00026127,0.0012463268,0.0006447229,0.0011916386,0.0006350508,0.0006379125,0.0002011098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041390858,0.001201908,0.013599791,0.0004232871,0.00023784596,0.00046586484,0.0003680954,0.81634915,0.039220516,0.012465661,0.003983792,0.107544936],"study_design_scores_gemma":[0.000038583865,0.000767518,0.0026350343,0.000008480504,0.000065545544,0.00015096905,0.00010327035,0.9918542,0.0030980352,0.0010404343,0.000223168,0.00001472427],"about_ca_topic_score_codex":0.005480517,"about_ca_topic_score_gemma":0.0037101756,"teacher_disagreement_score":0.005480517,"about_ca_system_score_codex":0.0017260992,"about_ca_system_score_gemma":0.0011721981,"threshold_uncertainty_score":0.020754457},"labels":[],"label_agreement":null},{"id":"W2021605542","doi":"10.1007/s12243-013-0409-0","title":"Investigating quality routing link metrics in Wireless Multi-hop Networks","year":2013,"lang":"en","type":"article","venue":"Annals of Telecommunications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Optimized Link State Routing Protocol; Computer network; Link-state routing protocol; Metrics; Dynamic Source Routing; Routing protocol; Hop (telecommunications); Routing Information Protocol; Zone Routing Protocol; Wireless Routing Protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.1311177621611516,"score_gpt":0.3639344161460248,"score_spread":0.2328166539848732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021605542","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7741439,0.0026860915,0.2194382,0.00044347587,0.00006403247,0.000096921736,0.00017008901,0.00015487282,0.0028025224],"genre_scores_gemma":[0.9801537,0.0006294247,0.018564725,0.000020286012,0.00003464263,0.000021860838,0.00012220867,0.00002784139,0.00042548403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818194,0.0008950404,0.000093179115,0.00016085204,0.00051785307,0.00015122673],"domain_scores_gemma":[0.97367245,0.021018498,0.0022958263,0.0008123366,0.0018551627,0.00034562225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004571199,0.0007996186,0.00057081523,0.0026787145,0.00046302576,0.001391971,0.0010524633,0.00087094447,0.00070236716],"category_scores_gemma":[0.027407182,0.0003649225,0.0003291756,0.0020867176,0.0008978025,0.0035274355,0.000927563,0.00061862764,0.00008357522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047078356,0.00039909218,0.057002153,0.0003665106,0.00024657592,0.0003111173,0.0005764839,0.78391093,0.02167875,0.034006495,0.0010006774,0.10003047],"study_design_scores_gemma":[0.000019411475,0.00038859993,0.0068174363,0.000027733937,0.00007920119,0.00018867369,0.00040775188,0.97313017,0.0054746447,0.012922658,0.00051955855,0.000024068677],"about_ca_topic_score_codex":0.0018107607,"about_ca_topic_score_gemma":0.0014998856,"teacher_disagreement_score":0.004571199,"about_ca_system_score_codex":0.00097560463,"about_ca_system_score_gemma":0.00040621514,"threshold_uncertainty_score":0.024175107},"labels":[],"label_agreement":null},{"id":"W2021844224","doi":"10.1109/jsyst.2014.2317453","title":"Source-Based Routing in Wireless Mesh Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Dynamic Source Routing; Routing protocol; Metrics; Interior gateway protocol; Link-state routing protocol; Equal-cost multi-path routing; Network packet; Distributed computing; Wireless; Wireless network; Telecommunications","score_opus":0.011472185397296657,"score_gpt":0.2204848093135663,"score_spread":0.20901262391626962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021844224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070127756,0.008682018,0.97530735,0.0006627479,0.00043575212,0.00014300433,0.00013528253,0.0008249824,0.0067959973],"genre_scores_gemma":[0.47026515,0.024661817,0.494352,0.00049045053,0.0010269134,0.0005844919,0.0008343104,0.00022600705,0.0075588757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.00028230718,0.00005957269,0.000102798476,0.00030476195,0.000052045376],"domain_scores_gemma":[0.9993069,0.00039145356,0.00008024503,0.00009461119,0.000109465116,0.000017231983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010075566,0.0005873602,0.00065085373,0.0010461675,0.00052206183,0.0011034954,0.001411127,0.00087572215,0.0013902659],"category_scores_gemma":[0.0023564694,0.0003687172,0.00041805918,0.0018570458,0.00064849254,0.0017594845,0.0011036736,0.0007609813,0.00044249676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011427043,0.00007857797,0.0008274668,0.0008244814,0.00013780208,0.00023640202,0.00016133167,0.3928817,0.008866264,0.18408164,0.011476944,0.40031305],"study_design_scores_gemma":[0.000037202088,0.00008113015,0.0002680096,0.00008526589,0.000046789763,0.00019196483,0.00004893439,0.8425244,0.0032459444,0.1247247,0.028709903,0.00003561537],"about_ca_topic_score_codex":0.0012081785,"about_ca_topic_score_gemma":0.0010776079,"teacher_disagreement_score":0.001411127,"about_ca_system_score_codex":0.00073803705,"about_ca_system_score_gemma":0.00068265933,"threshold_uncertainty_score":0.0053548813},"labels":[],"label_agreement":null},{"id":"W2023162496","doi":"10.4018/jbdcn.2006100102","title":"Simulating Realistic Urban Scenarios for Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Business Data Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Mobility model; Animation; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Distributed computing; Routing (electronic design automation); Routing protocol; Computer network; Optimized Link State Routing Protocol; Computer graphics (images); Telecommunications; Wireless","score_opus":0.05502246787483747,"score_gpt":0.3081332439850639,"score_spread":0.2531107761102265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023162496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041474406,0.0009245779,0.93103325,0.0005064892,0.0002638245,0.0002915368,0.0006557395,0.0021695103,0.022680623],"genre_scores_gemma":[0.36178142,0.0024271943,0.6258173,0.00013204112,0.00007299107,0.0006340779,0.0020266569,0.00045209486,0.0066562546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996228,0.0001975455,0.000017648712,0.000023273806,0.00011346702,0.000025202233],"domain_scores_gemma":[0.9995432,0.00024612038,0.000027997196,0.000075470336,0.00007621692,0.00003098942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004251891,0.0006144289,0.00032947923,0.0004566405,0.00047619373,0.0007806873,0.00061459496,0.0006261721,0.0033444706],"category_scores_gemma":[0.0019309097,0.00037207486,0.00038715248,0.0006154182,0.00025247975,0.0011061039,0.0009770376,0.0005092764,0.0009242914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053949447,0.00006658057,0.0010542234,0.00025651808,0.000046410965,0.00028991065,0.00017995399,0.8569025,0.006563172,0.057458926,0.008657469,0.068470515],"study_design_scores_gemma":[0.000022520504,0.000041304353,0.00026361662,0.000037676713,0.000016457021,0.00016249361,0.000063268344,0.92751265,0.0036349029,0.017601293,0.050623577,0.000020251886],"about_ca_topic_score_codex":0.0016006685,"about_ca_topic_score_gemma":0.0026352047,"teacher_disagreement_score":0.0033444706,"about_ca_system_score_codex":0.00038991525,"about_ca_system_score_gemma":0.00045888164,"threshold_uncertainty_score":0.011188388},"labels":[],"label_agreement":null},{"id":"W2023291727","doi":"10.1109/milcom.2012.6415724","title":"LAA: Link-layer anonymous access for tactical MANETs","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Node (physics); Wireless ad hoc network; Link layer; Network packet; Key management; Vehicular ad hoc network; Key (lock); Anonymity; Data link layer; Authentication (law); Computer security; Wireless; Physical layer; Telecommunications; Encryption; Engineering","score_opus":0.053116625725180874,"score_gpt":0.32791470471591355,"score_spread":0.27479807899073266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023291727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010488019,0.0017391853,0.9690791,0.00082842767,0.00047691504,0.0004186173,0.00020397721,0.0056149536,0.011150856],"genre_scores_gemma":[0.5445623,0.0027553677,0.4227535,0.001411281,0.0010203683,0.0026603779,0.00095097633,0.0006245672,0.023261258],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824536,0.00055361603,0.00013161488,0.00019093796,0.0006881739,0.0001902645],"domain_scores_gemma":[0.99765354,0.00052721583,0.0003698039,0.0006249365,0.00058115926,0.00024332722],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022462266,0.0005429294,0.0006045273,0.0011054613,0.0018279839,0.0022851622,0.0019354913,0.0011981416,0.0043288437],"category_scores_gemma":[0.003887546,0.0002988891,0.00046184528,0.0008953729,0.0016448888,0.0030474714,0.0030314543,0.0018141476,0.002136286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006328244,0.00027931598,0.0013930564,0.0010449851,0.00015470241,0.0011816961,0.001206808,0.023527835,0.054887354,0.4431915,0.04393648,0.42856348],"study_design_scores_gemma":[0.0003187286,0.00094472646,0.0014374268,0.00025918309,0.00018364738,0.0031700572,0.00052296015,0.37640825,0.046032023,0.14583676,0.42451584,0.00037039586],"about_ca_topic_score_codex":0.0008443608,"about_ca_topic_score_gemma":0.00073952536,"teacher_disagreement_score":0.0043288437,"about_ca_system_score_codex":0.0007235345,"about_ca_system_score_gemma":0.001616429,"threshold_uncertainty_score":0.014481425},"labels":[],"label_agreement":null},{"id":"W2023661106","doi":"10.1007/s11276-013-0654-1","title":"A QoS aware joint design for wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Quality of service; Distributed computing; Throughput; Packet loss; Scheduling (production processes); Network packet; Wireless network; Wireless; Telecommunications","score_opus":0.023224002942422096,"score_gpt":0.22952242140121365,"score_spread":0.20629841845879154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023661106","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009547691,0.00022917865,0.98773384,0.00012121081,0.00007258241,0.00004929363,0.000023039103,0.00030802438,0.0019151598],"genre_scores_gemma":[0.61919135,0.00041180153,0.3750856,0.00013999862,0.00014428212,0.00020560162,0.00008113803,0.00019247149,0.004547698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988689,0.0003605881,0.00007178393,0.00017156468,0.00038768887,0.00013943695],"domain_scores_gemma":[0.9987581,0.0004355972,0.00010394198,0.00021348958,0.00041211516,0.00007686218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793263,0.0006743923,0.0006769,0.00049190706,0.00063251954,0.001078641,0.0017176454,0.0006732255,0.002818513],"category_scores_gemma":[0.0035204114,0.00052752945,0.00045770928,0.000459763,0.00042184204,0.0015151225,0.0015963165,0.0009163347,0.0005006803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042800556,0.00025743854,0.001267991,0.00027065116,0.00012440547,0.00019141263,0.00023599794,0.56212896,0.06352599,0.0652657,0.004855029,0.30144846],"study_design_scores_gemma":[0.000017959213,0.00012410402,0.00008677881,0.000009740631,0.000034230503,0.00005993728,0.000022868522,0.9861334,0.0046903035,0.0066539785,0.0021564113,0.000010192675],"about_ca_topic_score_codex":0.00086624094,"about_ca_topic_score_gemma":0.0025089323,"teacher_disagreement_score":0.002818513,"about_ca_system_score_codex":0.0006854688,"about_ca_system_score_gemma":0.00097268895,"threshold_uncertainty_score":0.009428918},"labels":[],"label_agreement":null},{"id":"W2023890870","doi":"10.1049/iet-com:20070096","title":"Multilayer flavoured dynamic source routing in mobile <i>ad-hoc</i> networks","year":2008,"lang":"en","type":"article","venue":"IET Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Dynamic Source Routing; Computer network; DSRFLOW; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Enhanced Interior Gateway Routing Protocol; Routing (electronic design automation); Wireless Routing Protocol; Distributed computing","score_opus":0.019528976417498307,"score_gpt":0.2655844483768559,"score_spread":0.2460554719593576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023890870","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05708561,0.0134795075,0.91567606,0.0005865366,0.00018242998,0.00017275929,0.0001436127,0.00083925953,0.011834215],"genre_scores_gemma":[0.74195504,0.013831328,0.23831098,0.00018614608,0.00020574019,0.00012105965,0.00020718641,0.000068115995,0.005114394],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999286,0.00016344356,0.00006609211,0.000094804665,0.00030978597,0.00007983398],"domain_scores_gemma":[0.99943286,0.00018765884,0.00011478305,0.00012234133,0.00011356279,0.0000288092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725764,0.000511834,0.00048447648,0.00094229134,0.0004502465,0.0017522983,0.0007798433,0.0005443022,0.0008588077],"category_scores_gemma":[0.0017906211,0.00031548622,0.00046621438,0.0011256867,0.0006747549,0.0022495238,0.00094316487,0.0005756807,0.0002312199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034023335,0.00009906772,0.0033570912,0.000962342,0.00013794664,0.00043836588,0.0004227119,0.32289052,0.052182402,0.16568333,0.003929725,0.44955635],"study_design_scores_gemma":[0.000023003948,0.00056773715,0.003272927,0.00018143114,0.00019900104,0.00074703543,0.000242781,0.84451014,0.03126903,0.06318861,0.05568586,0.00011238499],"about_ca_topic_score_codex":0.0020626464,"about_ca_topic_score_gemma":0.0014550713,"teacher_disagreement_score":0.0020626464,"about_ca_system_score_codex":0.0010004658,"about_ca_system_score_gemma":0.00043136065,"threshold_uncertainty_score":0.007258892},"labels":[],"label_agreement":null},{"id":"W2024287812","doi":"10.1155/2007/98938","title":"Tree-Based Distributed Multicast Algorithms for Directional Communications and Lifetime Optimization in Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Distributed computing; Pragmatic General Multicast; Xcast; Protocol Independent Multicast; Wireless ad hoc network; Reliable multicast; Directional antenna; Omnidirectional antenna; IP multicast; Algorithm; Wireless; Antenna (radio); Telecommunications","score_opus":0.03429157620041687,"score_gpt":0.2930254583480744,"score_spread":0.2587338821476576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024287812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010988295,0.00078121544,0.9866204,0.0001597434,0.000034225824,0.0000227158,0.000018024188,0.00018109639,0.0011942866],"genre_scores_gemma":[0.48011577,0.0017156572,0.51417595,0.00016940082,0.00015080563,0.00027589058,0.0001468474,0.00010032647,0.0031493981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995584,0.0001855123,0.00001770825,0.000048569425,0.00014986483,0.000039918756],"domain_scores_gemma":[0.99910337,0.0005427374,0.00009481446,0.00006488727,0.00015950039,0.00003471013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012693881,0.00051073625,0.0008434798,0.00049462117,0.00059356017,0.0005919625,0.0011322178,0.00085506396,0.0008742669],"category_scores_gemma":[0.0028532315,0.00019275976,0.00034604804,0.00095725886,0.0004103442,0.0014318703,0.00074392086,0.000661962,0.00023479844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000116068746,0.00008297678,0.00044711313,0.00012670657,0.000049570812,0.00004075558,0.00015678181,0.76826596,0.0041128034,0.054845486,0.0034077335,0.16834797],"study_design_scores_gemma":[0.000025716985,0.000060733193,0.000058911748,0.000006548085,0.00001021625,0.000024637618,0.000016849228,0.97878826,0.0007036143,0.018676877,0.0016215193,0.0000060862462],"about_ca_topic_score_codex":0.00073949015,"about_ca_topic_score_gemma":0.00077106024,"teacher_disagreement_score":0.0012693881,"about_ca_system_score_codex":0.0005216482,"about_ca_system_score_gemma":0.0005210842,"threshold_uncertainty_score":0.0067132115},"labels":[],"label_agreement":null},{"id":"W2024365713","doi":"10.1109/iwcmc.2013.6583801","title":"Analyzing extended sliding frame reservation-aloha MAC protocol against asymmetric radio link problem in MANET/VANET","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Aloha; Computer network; Computer science; Frame (networking); Reservation; Network packet; Multiple Access with Collision Avoidance for Wireless; Wireless; Wireless ad hoc network; Throughput; Routing protocol; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.016472515854132275,"score_gpt":0.26093394653022384,"score_spread":0.24446143067609155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024365713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27681616,0.0020996435,0.7113168,0.00042153284,0.00023347478,0.00020533617,0.00005790049,0.00037699053,0.008472077],"genre_scores_gemma":[0.9803679,0.00041209537,0.018107373,0.000048978178,0.00004932674,0.00006948136,0.000041726264,0.000018208353,0.00088490534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987452,0.00044840007,0.000067217814,0.00012649858,0.00041539775,0.00019719088],"domain_scores_gemma":[0.9969759,0.0016944191,0.00036890968,0.00017272912,0.0007212074,0.000066846005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001757407,0.00053406943,0.00065533805,0.0009095424,0.0005700231,0.0007837991,0.0009803757,0.0005765362,0.0011852245],"category_scores_gemma":[0.005101229,0.00017204433,0.00045732726,0.0005998791,0.00059517217,0.0012430459,0.0005467143,0.0004684962,0.00015407296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003942262,0.00014589625,0.0053260042,0.00031400748,0.00016802248,0.00088079047,0.000333262,0.87801766,0.018533595,0.037765045,0.0019188733,0.056202605],"study_design_scores_gemma":[0.000008883051,0.00016241099,0.00041777673,0.000012584192,0.000028289896,0.00018235142,0.000083916726,0.99356395,0.0016561678,0.0033370382,0.0005362247,0.000010445195],"about_ca_topic_score_codex":0.0022596968,"about_ca_topic_score_gemma":0.0011667619,"teacher_disagreement_score":0.0022596968,"about_ca_system_score_codex":0.0005487407,"about_ca_system_score_gemma":0.0009812649,"threshold_uncertainty_score":0.009294212},"labels":[],"label_agreement":null},{"id":"W2024559717","doi":"10.1109/softcom.2007.4446072","title":"Routing intrusions on mobile ad hoc networks: Test bed and vulnerability analysis","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Industry Canada","keywords":"Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Intrusion detection system; Vulnerability (computing); Ad hoc wireless distribution service; Routing (electronic design automation); Intrusion; Routing protocol; Vulnerability assessment; Computer security; Wireless; Telecommunications; Network packet; Geology","score_opus":0.009729659396619166,"score_gpt":0.2581559064570562,"score_spread":0.24842624706043706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024559717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99017197,0.0001460727,0.00842844,0.000039604016,0.000026032167,0.00016484829,0.00014162889,0.00035899066,0.0005223596],"genre_scores_gemma":[0.99010754,0.00016798003,0.008653249,0.000028367427,0.000008472129,0.00011888735,0.00029370314,0.000029771169,0.00059203483],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846077,0.00035897223,0.0001214074,0.00014356266,0.0006818156,0.00023357074],"domain_scores_gemma":[0.9964658,0.0015995688,0.0004452137,0.00065225933,0.0006370854,0.00020001884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077914074,0.0009040694,0.00057106744,0.0011550478,0.00035453605,0.00040838245,0.0008601078,0.0006310145,0.0009252544],"category_scores_gemma":[0.0028843363,0.00028428368,0.0003361845,0.0007591419,0.0006933001,0.0008528076,0.000656391,0.00056021265,0.00023932151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030604044,0.0049892524,0.03796798,0.0009180447,0.00059503765,0.0019527612,0.0008811249,0.16812351,0.69023216,0.0027410602,0.0020150454,0.08652364],"study_design_scores_gemma":[0.00021497162,0.013105165,0.016755672,0.000035534493,0.0001677405,0.0017023674,0.0003906896,0.20937507,0.75529903,0.0006966914,0.0021785034,0.000078482655],"about_ca_topic_score_codex":0.00084639876,"about_ca_topic_score_gemma":0.00071927416,"teacher_disagreement_score":0.0011550478,"about_ca_system_score_codex":0.00050990324,"about_ca_system_score_gemma":0.00023514367,"threshold_uncertainty_score":0.0041205287},"labels":[],"label_agreement":null},{"id":"W2024842409","doi":"10.1145/2811587.2811618","title":"Mechanisms for Multi-Packet Reception Protocols in Multi-Hop Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Network packet; Hop (telecommunications); Wireless; Exploit; Wireless network; Throughput; Random access; Bundle; Multiple Access with Collision Avoidance for Wireless; Transceiver; Distributed computing; Telecommunications; Routing protocol; Computer security","score_opus":0.1152539207250268,"score_gpt":0.3458339634995523,"score_spread":0.2305800427745255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024842409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019286463,0.0021165463,0.9717765,0.00054880575,0.00025753843,0.0003175399,0.000028329836,0.0010209943,0.0046471427],"genre_scores_gemma":[0.5430697,0.0022968417,0.44719648,0.0005847899,0.000528189,0.0014176393,0.000068516805,0.00019281649,0.00464501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971603,0.0011520246,0.00023763556,0.00027515515,0.0009988424,0.00017600779],"domain_scores_gemma":[0.9924793,0.0042039584,0.0010705361,0.0012902064,0.0007672976,0.00018870029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070051355,0.0011514868,0.0007025168,0.0013170507,0.0010742765,0.0030316878,0.0036639785,0.001963576,0.0024222627],"category_scores_gemma":[0.013436818,0.00084705587,0.00072877336,0.0008210709,0.002562507,0.004962747,0.001707149,0.002577548,0.000713611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021292057,0.00023852612,0.00096856867,0.00079742476,0.00014582716,0.00042132873,0.00057824625,0.09584887,0.030579315,0.8058528,0.0020992653,0.06225698],"study_design_scores_gemma":[0.00030304387,0.0009109168,0.0005931271,0.00024879008,0.00024620697,0.0011631764,0.00015007448,0.7378741,0.02800796,0.20116366,0.029207448,0.00013143994],"about_ca_topic_score_codex":0.0003576091,"about_ca_topic_score_gemma":0.00027002723,"teacher_disagreement_score":0.0070051355,"about_ca_system_score_codex":0.000848044,"about_ca_system_score_gemma":0.0008913513,"threshold_uncertainty_score":0.037047148},"labels":[],"label_agreement":null},{"id":"W2024857760","doi":"10.1109/cjece.2007.364331","title":"An efficient medium access control protocol for mobile ad hoc networks using antenna arrays","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Directional antenna; Computer science; Omnidirectional antenna; Wireless ad hoc network; Throughput; Mobile ad hoc network; Transmission (telecommunications); Network topology; Neighbor Discovery Protocol; Antenna (radio); Wireless; Telecommunications; Internet protocol suite; Network packet","score_opus":0.011458482889626042,"score_gpt":0.2538533815517037,"score_spread":0.2423948986620777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024857760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055093654,0.0022158544,0.98744243,0.00032750168,0.00042638936,0.00043017315,0.000055126417,0.0010115256,0.002581638],"genre_scores_gemma":[0.32710153,0.004039583,0.65423995,0.00065012637,0.00083790947,0.002822015,0.00045895,0.00011509861,0.009734805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982796,0.0005299362,0.00015469648,0.00013916078,0.0008229948,0.00007363729],"domain_scores_gemma":[0.9986084,0.0004684131,0.00020053305,0.00014284582,0.0005271887,0.000052482425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020050758,0.0007425415,0.0007005589,0.00076071155,0.00096644345,0.0011228727,0.0013979852,0.00090405776,0.0010448726],"category_scores_gemma":[0.0037251755,0.0002830793,0.00038150407,0.00078963715,0.00067746505,0.0016205134,0.0008881861,0.001435969,0.0005545547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005058734,0.0004179771,0.0010423247,0.0012443097,0.00029764243,0.0011042518,0.0005525676,0.13804275,0.11039625,0.1301848,0.021280399,0.5949308],"study_design_scores_gemma":[0.00021874983,0.0011884939,0.0009318362,0.00011175046,0.00024287544,0.001360891,0.000108800385,0.81564325,0.03761612,0.01773271,0.12468761,0.00015692212],"about_ca_topic_score_codex":0.0006864223,"about_ca_topic_score_gemma":0.0013399038,"teacher_disagreement_score":0.0020050758,"about_ca_system_score_codex":0.00057718414,"about_ca_system_score_gemma":0.0008978966,"threshold_uncertainty_score":0.010603964},"labels":[],"label_agreement":null},{"id":"W2024888452","doi":"10.1109/glocomw.2012.6477720","title":"Comparison of two security protocols for preventing packet dropping and message tampering attacks on AODV-based mobile ad Hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ad hoc On-Demand Distance Vector Routing; Computer science; Computer network; Network packet; Packet drop attack; Mobile ad hoc network; Wormhole; Wireless ad hoc network; Encryption; Routing protocol; Dynamic Source Routing; Wireless; Link-state routing protocol; Telecommunications; Physics","score_opus":0.03808377107304954,"score_gpt":0.3633330859826894,"score_spread":0.3252493149096398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024888452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61207813,0.013875747,0.345693,0.00083245937,0.0010632832,0.0013837806,0.00020658698,0.0019945663,0.02287247],"genre_scores_gemma":[0.93545693,0.0026946436,0.059268076,0.00010221501,0.00006126141,0.00023711052,0.00016484644,0.0000621693,0.0019528656],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713814,0.000848202,0.00022295024,0.00014278929,0.0013971922,0.00025069862],"domain_scores_gemma":[0.99608094,0.0015889693,0.0004094671,0.0005219443,0.0012731692,0.00012560698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002724529,0.00093313865,0.0008370146,0.0022785757,0.00067332207,0.0013931707,0.0014187328,0.0008092996,0.0006510842],"category_scores_gemma":[0.00627346,0.00026438906,0.0005761275,0.000995183,0.00064359943,0.00270603,0.0009120834,0.0006527994,0.0002073158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00662831,0.0017090846,0.011084304,0.0020393368,0.0010093484,0.000980167,0.0010312399,0.17801315,0.13799137,0.07891557,0.0056626475,0.57493544],"study_design_scores_gemma":[0.00056531467,0.006323298,0.0069333888,0.00016320671,0.0007581972,0.0016664239,0.0010510565,0.8562843,0.100337826,0.010626832,0.015065967,0.00022425885],"about_ca_topic_score_codex":0.0009883492,"about_ca_topic_score_gemma":0.0010140328,"teacher_disagreement_score":0.002724529,"about_ca_system_score_codex":0.0011667435,"about_ca_system_score_gemma":0.0012793349,"threshold_uncertainty_score":0.014408827},"labels":[],"label_agreement":null},{"id":"W2025231724","doi":"10.1002/wcm.440","title":"Access control in ad hoc networks with selfish nodes","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless ad hoc network; Throughput; Network packet; Channel (broadcasting); Transmission (telecommunications); Transmission delay; Access control; Wireless; Telecommunications","score_opus":0.010411070851298214,"score_gpt":0.24898007279645873,"score_spread":0.2385690019451605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025231724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106352426,0.0010167536,0.8889864,0.0003000589,0.00009215053,0.00007515558,0.000017516782,0.00019251647,0.0029670754],"genre_scores_gemma":[0.9790511,0.00022087125,0.0194848,0.00005133841,0.00005450772,0.000048668106,0.000009115585,0.0000055745472,0.0010740007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999008,0.0003899151,0.00005246678,0.00011731582,0.0003059577,0.00012637075],"domain_scores_gemma":[0.9977582,0.0011952983,0.00036283716,0.00018731922,0.00034677397,0.0001495517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018316592,0.0004614849,0.00051890133,0.00057441456,0.0005565494,0.0011677253,0.0011659496,0.00061752455,0.00065296993],"category_scores_gemma":[0.0026730138,0.00022068,0.00028512458,0.00038135698,0.0014341057,0.0014056427,0.001038489,0.0006771697,0.0001231179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003107011,0.0002471648,0.0028233235,0.00022084336,0.0001737848,0.0006570534,0.00068360666,0.6252806,0.029096795,0.25817668,0.001553104,0.080776334],"study_design_scores_gemma":[0.000034056546,0.000101395766,0.0001680586,0.0000062663435,0.000017743037,0.000096866905,0.000027098231,0.97096205,0.0013557822,0.025992943,0.0012259274,0.000011860534],"about_ca_topic_score_codex":0.0012681651,"about_ca_topic_score_gemma":0.00085885316,"teacher_disagreement_score":0.0018316592,"about_ca_system_score_codex":0.0005903029,"about_ca_system_score_gemma":0.0004562674,"threshold_uncertainty_score":0.009686887},"labels":[],"label_agreement":null},{"id":"W2025529612","doi":"10.1007/s11235-014-9927-y","title":"Improving the communication path reliability of WiMAX mesh network using multi sponsor technique","year":2014,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Universiti Teknologi Malaysia","keywords":"Computer science; Wireless mesh network; WiMAX; Computer network; Mesh networking; Switched mesh; Reliability (semiconductor); Order One Network Protocol; Optical mesh network; Node (physics); Distributed computing; Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.023034058227306545,"score_gpt":0.26079216453422815,"score_spread":0.23775810630692162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025529612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42604208,0.0017257134,0.56791705,0.00028452583,0.00016211592,0.000038011414,0.000058856727,0.0005435828,0.0032280397],"genre_scores_gemma":[0.9581989,0.00039902222,0.040489815,0.00002416586,0.000060695176,0.000017916462,0.00003641153,0.00002116522,0.0007519697],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996227,0.000116742056,0.000017440485,0.000051807332,0.00013335541,0.000057959744],"domain_scores_gemma":[0.99873513,0.0005970431,0.00013762353,0.00015238347,0.00034624664,0.00003156307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004946829,0.0004051933,0.0004202686,0.0006592602,0.0005172091,0.0003357036,0.0005626257,0.00036238358,0.0007941539],"category_scores_gemma":[0.0017057768,0.00018678755,0.00030065706,0.0005163606,0.00017929685,0.000768843,0.00045765648,0.00049024436,0.0001271817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012245461,0.000259097,0.006704234,0.00032711585,0.00016522025,0.0003000965,0.0002837578,0.15416685,0.4535071,0.0057086153,0.0017763283,0.375577],"study_design_scores_gemma":[0.000037520167,0.0008554183,0.0046171728,0.000026572441,0.00016200177,0.0005536937,0.000094024115,0.91469234,0.07566787,0.0017861973,0.0014748536,0.000032262924],"about_ca_topic_score_codex":0.0006746674,"about_ca_topic_score_gemma":0.000977776,"teacher_disagreement_score":0.0007941539,"about_ca_system_score_codex":0.00031508465,"about_ca_system_score_gemma":0.00032806088,"threshold_uncertainty_score":0.0026566982},"labels":[],"label_agreement":null},{"id":"W2025689753","doi":"10.1109/wcnc.2010.5506330","title":"Disjoint Multipath Routing and QoS Provisioning Under Physical Interference Constraints","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multipath routing; Computer science; Computer network; Multipath interference; Dynamic Source Routing; Multipath propagation; Equal-cost multi-path routing; Wireless Routing Protocol; Distributed computing; Link-state routing protocol; Static routing; Routing protocol; Routing (electronic design automation); Channel (broadcasting)","score_opus":0.012281159139756834,"score_gpt":0.2508038383506327,"score_spread":0.23852267921087586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025689753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023978181,0.00086029456,0.9714884,0.00026916337,0.00008037822,0.000048694,0.000050568655,0.0003093118,0.002914993],"genre_scores_gemma":[0.61151344,0.0015227026,0.38347647,0.00013490274,0.00018199449,0.00013478611,0.00014747206,0.00010063342,0.0027876578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853945,0.0004358991,0.00009039032,0.00022683028,0.0005396374,0.00016794304],"domain_scores_gemma":[0.99670863,0.0017800576,0.0005414477,0.00047071092,0.00038125843,0.00011784372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013587323,0.0010500066,0.0007877647,0.000879261,0.00090261956,0.0014282506,0.0014697802,0.00089659967,0.0012073335],"category_scores_gemma":[0.005856398,0.00045268852,0.0005555096,0.0013809911,0.0009231415,0.0028365718,0.0020216473,0.00091383664,0.0003055056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001623451,0.00006042414,0.00089328823,0.00025404055,0.000110016146,0.00035080287,0.00018036821,0.7158875,0.014017927,0.10049007,0.0017301509,0.16586302],"study_design_scores_gemma":[0.000018015658,0.000105256775,0.0002698338,0.000020739457,0.000043927757,0.0004091135,0.00006753183,0.933278,0.0053815152,0.05597274,0.004404208,0.000029134131],"about_ca_topic_score_codex":0.00110756,"about_ca_topic_score_gemma":0.0014767261,"teacher_disagreement_score":0.0014697802,"about_ca_system_score_codex":0.0008561152,"about_ca_system_score_gemma":0.0010833581,"threshold_uncertainty_score":0.007185757},"labels":[],"label_agreement":null},{"id":"W2025813221","doi":"10.1002/sec.199","title":"Secure and robust threshold key management (SRKM) scheme for <i>ad hoc</i> networks","year":2010,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Computer security; Key management; Mobile ad hoc network; Adversary; Certificate authority; Public-key cryptography; Key (lock); Robustness (evolution); Wireless ad hoc network; Vulnerability (computing); Computer network; Certificate; Cryptography; Scheme (mathematics); Wireless; Encryption; Telecommunications; Network packet; Theoretical computer science","score_opus":0.010304734932633267,"score_gpt":0.22322101531910205,"score_spread":0.2129162803864688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025813221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13352062,0.0021052721,0.84970707,0.0010434837,0.00028101273,0.0004041095,0.00026799363,0.001747302,0.010923197],"genre_scores_gemma":[0.94573843,0.00033772553,0.051683422,0.00011494534,0.00004905424,0.00009111275,0.0001325033,0.000027813245,0.0018251023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987318,0.0003031925,0.00012932117,0.00017593567,0.00044795166,0.00021194102],"domain_scores_gemma":[0.9981806,0.00035629305,0.0005554002,0.00054349087,0.00021383425,0.00015033029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010132882,0.00039971044,0.0006513992,0.00058946107,0.00070292933,0.0012507502,0.0013568657,0.000912379,0.0012748471],"category_scores_gemma":[0.0025872237,0.00016283467,0.0005775911,0.00070511154,0.0010355351,0.0026603346,0.0022653178,0.00092996337,0.00041789442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014287686,0.00034556043,0.0022118504,0.0010311597,0.00025740123,0.0011857544,0.0012295513,0.17792343,0.23397583,0.3817892,0.010091468,0.18853],"study_design_scores_gemma":[0.00045748954,0.0012859767,0.0013819152,0.00014132416,0.00014892225,0.0023498854,0.00026092574,0.74573386,0.08042462,0.14303109,0.024570191,0.0002137538],"about_ca_topic_score_codex":0.00040780145,"about_ca_topic_score_gemma":0.00017646544,"teacher_disagreement_score":0.0013568657,"about_ca_system_score_codex":0.00087760034,"about_ca_system_score_gemma":0.0011460509,"threshold_uncertainty_score":0.0063675046},"labels":[],"label_agreement":null},{"id":"W2025856120","doi":"10.1016/j.procs.2012.06.126","title":"Multi-hop Interference-Aware Routing Protocol for Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless sensor network; Network packet; Scheduling (production processes); Routing protocol; Distributed computing; Cluster analysis; Signal-to-interference-plus-noise ratio; Interference (communication); Key distribution in wireless sensor networks; Wireless; Wireless network; Power (physics); Telecommunications; Channel (broadcasting)","score_opus":0.03963815977384598,"score_gpt":0.3038966078442703,"score_spread":0.2642584480704243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025856120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007217734,0.009825306,0.97127515,0.000765512,0.0007359326,0.00022150548,0.00009869429,0.00082830054,0.009031866],"genre_scores_gemma":[0.4056424,0.018978598,0.5569658,0.0009572114,0.0007555705,0.0014502635,0.00094173156,0.00023485758,0.014073614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999158,0.0002664835,0.00007242809,0.00008874531,0.00037328005,0.000041091123],"domain_scores_gemma":[0.99945444,0.00020058107,0.00008170154,0.00008227004,0.00015889529,0.000022063528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007487868,0.0006436678,0.0007061347,0.0006327107,0.00069278263,0.0007728383,0.0012473963,0.0007804032,0.0008172574],"category_scores_gemma":[0.0014439552,0.0002346165,0.0004972417,0.0012374105,0.0004250991,0.0011257768,0.00087909476,0.0010581138,0.00053250155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026237874,0.00020378108,0.0009719469,0.0016316477,0.0002934713,0.00083913247,0.00047154637,0.19767107,0.055660572,0.15141408,0.024922824,0.56565744],"study_design_scores_gemma":[0.00008820478,0.00053257466,0.00083672954,0.00024969032,0.00021541191,0.0014402237,0.00015935201,0.7210032,0.025159972,0.10853369,0.14166239,0.00011860923],"about_ca_topic_score_codex":0.00046083867,"about_ca_topic_score_gemma":0.0006997242,"teacher_disagreement_score":0.0012473963,"about_ca_system_score_codex":0.00045843326,"about_ca_system_score_gemma":0.0007055639,"threshold_uncertainty_score":0.0039600134},"labels":[],"label_agreement":null},{"id":"W2026002911","doi":"10.1016/j.procs.2011.07.054","title":"OLSR-based Topology Discovery for Mobile Situational Awareness Systems","year":2011,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"National Institute of Standards and Technology","keywords":"Computer science; Topology control; Topology (electrical circuits); Node (physics); Network topology; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless ad hoc network; Computer network; Distributed computing; Routing protocol; Routing (electronic design automation); Wireless network; Mathematics; Wireless","score_opus":0.03198087109937023,"score_gpt":0.26234842820811705,"score_spread":0.23036755710874682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026002911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044512045,0.001143883,0.9477189,0.00022349574,0.00008860624,0.00008887995,0.000103564926,0.0027304466,0.003390107],"genre_scores_gemma":[0.8011377,0.00096316054,0.19520909,0.000063444255,0.000079764286,0.0000729156,0.00028520403,0.0000960401,0.0020926932],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.00024244162,0.00003484076,0.00006449766,0.0003113065,0.0000387817],"domain_scores_gemma":[0.9994005,0.00017471422,0.000102431484,0.00014202851,0.00014286589,0.000037451715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005366678,0.00030948195,0.0004355328,0.0009166036,0.00032698616,0.00073635625,0.0006680564,0.00035630306,0.00059705845],"category_scores_gemma":[0.0013324204,0.0002201187,0.0002148351,0.0005722413,0.00031358656,0.001035038,0.0006344646,0.0003654778,0.0003300844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051178096,0.00016258487,0.0037449407,0.00032174308,0.00018184847,0.00072939147,0.0005534239,0.29395923,0.11114182,0.030325554,0.0050193607,0.55334824],"study_design_scores_gemma":[0.00001886406,0.00019021326,0.0017153473,0.000016716967,0.00003435871,0.00043446195,0.0001223089,0.9642198,0.018886717,0.0052951705,0.009028239,0.00003772224],"about_ca_topic_score_codex":0.0010284377,"about_ca_topic_score_gemma":0.0011430319,"teacher_disagreement_score":0.0010284377,"about_ca_system_score_codex":0.00024013474,"about_ca_system_score_gemma":0.00025333939,"threshold_uncertainty_score":0.0028381944},"labels":[],"label_agreement":null},{"id":"W2026423737","doi":"10.1109/pimrc.2011.6139676","title":"Performance evaluation of wireless multihop communications for an indoor environment","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless; Computer network; Throughput; Routing (electronic design automation); Discrete event simulation; Channel (broadcasting); Tracing; Wireless network; Ray tracing (physics); Routing algorithm; Routing protocol; Real-time computing; Simulation; Telecommunications","score_opus":0.12002583199601544,"score_gpt":0.2977118661187692,"score_spread":0.17768603412275377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026423737","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9282737,0.00080804736,0.066281796,0.0000892608,0.00003642716,0.00004355529,0.00007618189,0.00039219882,0.003998788],"genre_scores_gemma":[0.99672145,0.00015082385,0.0028062263,0.0000055064725,0.0000075899366,0.000008587003,0.000029911447,0.000011235582,0.00025854018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.0003445274,0.000034163197,0.000089685,0.00039269638,0.00014795514],"domain_scores_gemma":[0.996241,0.0026405926,0.00034139116,0.00023412252,0.00044511663,0.00009774153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010589482,0.0005527937,0.00041609508,0.0005810606,0.00034626483,0.0004935803,0.00042688692,0.00046093418,0.00054846326],"category_scores_gemma":[0.0039772103,0.00013466801,0.000233508,0.0006163462,0.00030806303,0.00049833895,0.00038218917,0.00025914737,0.00010941506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005915083,0.00019102855,0.00701115,0.00021374378,0.00009920349,0.0003883618,0.00011529228,0.9040011,0.043939624,0.0014775943,0.0003308712,0.04164044],"study_design_scores_gemma":[0.000020047579,0.0016388532,0.0065884897,0.000012298816,0.000072894305,0.00039486174,0.00011410132,0.95706457,0.033214893,0.00040973932,0.000439779,0.000029505465],"about_ca_topic_score_codex":0.001041078,"about_ca_topic_score_gemma":0.00071911,"teacher_disagreement_score":0.0010589482,"about_ca_system_score_codex":0.0005171186,"about_ca_system_score_gemma":0.0003013314,"threshold_uncertainty_score":0.005600333},"labels":[],"label_agreement":null},{"id":"W2026901529","doi":"10.1109/pimrc.2011.6139677","title":"On the statistical behaviors of network-level features within MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Network packet","score_opus":0.03993123474089343,"score_gpt":0.24630335238514395,"score_spread":0.2063721176442505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026901529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6624914,0.00038267914,0.33166417,0.00045002895,0.000025043286,0.000071959534,0.00025610768,0.0004045171,0.004254045],"genre_scores_gemma":[0.98985016,0.00017080057,0.009476943,0.000025811389,0.000011253836,0.000028505965,0.00011070601,0.00003331061,0.00029248206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926585,0.00029052445,0.00003356563,0.00012776487,0.00021276415,0.00006954444],"domain_scores_gemma":[0.9818673,0.01489707,0.0012671859,0.0010969446,0.0006416995,0.00022980952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026525185,0.0002963524,0.00045677178,0.0010169259,0.00047778783,0.0010125982,0.0005498189,0.000591835,0.000566977],"category_scores_gemma":[0.020013526,0.00035270397,0.00037802747,0.00087242905,0.0014029753,0.0020216194,0.00064362766,0.0008901072,0.000120042125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010808061,0.00007228686,0.018632619,0.000076806864,0.000049364367,0.00024572058,0.00028744995,0.91660386,0.004805601,0.04535017,0.00026186198,0.0135061685],"study_design_scores_gemma":[0.000004612406,0.00006091184,0.0045570335,0.0000111465715,0.0000092495075,0.00011692804,0.00006426018,0.9765336,0.0015166886,0.016794322,0.0003090837,0.000022125321],"about_ca_topic_score_codex":0.0017153984,"about_ca_topic_score_gemma":0.0013491682,"teacher_disagreement_score":0.0026525185,"about_ca_system_score_codex":0.0006806053,"about_ca_system_score_gemma":0.0003739505,"threshold_uncertainty_score":0.014028013},"labels":[],"label_agreement":null},{"id":"W2027654457","doi":"10.1109/acssc.2013.6810663","title":"Implementation of selective packet destruction on wireless open-access research platform","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; University College Dublin; Queen's University Belfast; Rice University","keywords":"Testbed; Computer network; Computer science; Acknowledgement; Network packet; Wireless; Wireless network; Telecommunications","score_opus":0.10458782629614799,"score_gpt":0.42967699457500486,"score_spread":0.32508916827885687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027654457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73415744,0.00013058096,0.24784039,0.00021701804,0.00010924035,0.00074438466,0.000074494455,0.008211014,0.008515371],"genre_scores_gemma":[0.94718313,0.000044686618,0.05004626,0.000060785962,0.000013985692,0.00017292117,0.00008568893,0.00007097849,0.002321608],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992285,0.00014823457,0.000059216603,0.000133871,0.0002394111,0.00019081312],"domain_scores_gemma":[0.9983259,0.0003640261,0.00026339703,0.00050864933,0.00027952794,0.0002585196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011025713,0.00039594906,0.0002992832,0.0005212722,0.00037608357,0.0007333747,0.001445093,0.0004135571,0.0012748812],"category_scores_gemma":[0.0019323528,0.00020409006,0.00022872248,0.00015969829,0.0004923154,0.0010610583,0.0013210261,0.00063229987,0.00037878356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019949123,0.0020401694,0.015152288,0.00033531367,0.0001434672,0.002086734,0.00083000556,0.030934481,0.7498669,0.015196269,0.0029971926,0.17842227],"study_design_scores_gemma":[0.00029863828,0.0038129324,0.009681995,0.000029566303,0.00012870824,0.000998782,0.00022380105,0.39606267,0.57042044,0.0026139144,0.015631638,0.000096866446],"about_ca_topic_score_codex":0.0005995847,"about_ca_topic_score_gemma":0.000509124,"teacher_disagreement_score":0.001445093,"about_ca_system_score_codex":0.00030779326,"about_ca_system_score_gemma":0.00049616623,"threshold_uncertainty_score":0.005831003},"labels":[],"label_agreement":null},{"id":"W2028067429","doi":"10.1016/j.comcom.2008.10.012","title":"QoS routing with traffic distribution in mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Mobile ad hoc network; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Routing protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Network packet","score_opus":0.021641454277954168,"score_gpt":0.24010513500811817,"score_spread":0.218463680730164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028067429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01287042,0.0020276369,0.9801942,0.0006656413,0.00028737035,0.00004012983,0.000030884028,0.000419677,0.0034641568],"genre_scores_gemma":[0.74879,0.0034548573,0.23707446,0.0002802661,0.0012263247,0.0001293001,0.00012179714,0.00021992002,0.008703092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983652,0.0007275923,0.00006264947,0.00017410416,0.00054073933,0.0001297845],"domain_scores_gemma":[0.99664694,0.0023743578,0.0001697908,0.00031394142,0.00040514872,0.00008977527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032712405,0.00094516104,0.00093958393,0.0011624238,0.0007553239,0.0016607605,0.0017711299,0.0012058285,0.0020715138],"category_scores_gemma":[0.0087886825,0.0007867912,0.00031150403,0.0021834217,0.0015654855,0.0035443858,0.0014207095,0.0014821542,0.0005086838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047340317,0.00015176977,0.0012159398,0.00022826469,0.000054544445,0.0001731978,0.00017397104,0.56107026,0.005279172,0.18529513,0.004564214,0.24132007],"study_design_scores_gemma":[0.0000236498,0.00004721296,0.000107299165,0.000013215396,0.000018478726,0.00009213573,0.000022069238,0.9220211,0.0011553406,0.07365783,0.0028310816,0.000010475156],"about_ca_topic_score_codex":0.0013648636,"about_ca_topic_score_gemma":0.0010522793,"teacher_disagreement_score":0.0032712405,"about_ca_system_score_codex":0.001285475,"about_ca_system_score_gemma":0.0006652111,"threshold_uncertainty_score":0.017300189},"labels":[],"label_agreement":null},{"id":"W2028202622","doi":"10.1109/glocomw.2011.6162458","title":"Fast multichannel switching for IEEE 802.11s multiradio wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; École de Technologie Supérieure","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Quality of service; Service set; Mesh networking; IEEE 802.11s; Wireless broadband; Network topology; Shared mesh; Switched mesh; Wireless; Wireless network; Telecommunications; Wi-Fi","score_opus":0.030451194232287412,"score_gpt":0.2381896019921743,"score_spread":0.2077384077598869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028202622","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08818438,0.0069061723,0.889383,0.00062145054,0.0005039591,0.00017795216,0.00009309272,0.0012533324,0.0128766205],"genre_scores_gemma":[0.7916231,0.0024441106,0.19970627,0.0001395551,0.00023412953,0.00018956483,0.00021660217,0.00010132952,0.0053453054],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00017157037,0.000019721212,0.000035678335,0.0001725735,0.000040027902],"domain_scores_gemma":[0.99938583,0.00031135802,0.0000591129,0.00011939779,0.000097953154,0.00002631819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010639025,0.00028810307,0.00020232785,0.00046082836,0.00047055294,0.00060278515,0.00053776667,0.00032573412,0.0022734413],"category_scores_gemma":[0.0015648723,0.0001441298,0.0001831927,0.00037182987,0.00033336776,0.000651529,0.00031039855,0.00055479497,0.00024125143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006468323,0.00019133306,0.0016241913,0.000431427,0.000057793863,0.0002604416,0.00024390648,0.22060859,0.09259708,0.11197214,0.006767576,0.56459874],"study_design_scores_gemma":[0.00007011698,0.00067442504,0.001277372,0.00005438897,0.00005118305,0.00030597195,0.00007082559,0.89965045,0.030627618,0.03507275,0.032090098,0.000054785964],"about_ca_topic_score_codex":0.0006646592,"about_ca_topic_score_gemma":0.0014481568,"teacher_disagreement_score":0.0022734413,"about_ca_system_score_codex":0.00047308777,"about_ca_system_score_gemma":0.00044710675,"threshold_uncertainty_score":0.0076054335},"labels":[],"label_agreement":null},{"id":"W2028453258","doi":"10.1109/hpsr.2007.4281260","title":"Efficient Localized Topology Control Algorithm","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Topology control; Network topology; Computer science; Wireless sensor network; Topology (electrical circuits); Network packet; Logical topology; Wireless ad hoc network; Algorithm design; Computer network; Energy (signal processing); Efficient energy use; Algorithm; Distributed computing; Wireless network; Wireless; Key distribution in wireless sensor networks; Engineering; Mathematics; Telecommunications","score_opus":0.00636430630783324,"score_gpt":0.24014459727360385,"score_spread":0.2337802909657706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028453258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059749573,0.00016024757,0.9908496,0.0000948924,0.000035368994,0.000070147056,0.00003032151,0.0006977935,0.0020866597],"genre_scores_gemma":[0.47784567,0.00045492407,0.5122411,0.00023101574,0.0000815758,0.0005119629,0.00033897127,0.00013064226,0.008164087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993709,0.00014920444,0.000034476445,0.00015869136,0.0002044329,0.00008234714],"domain_scores_gemma":[0.99922776,0.00024137268,0.00010471236,0.00017486287,0.0002107383,0.00004052775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005401356,0.00057350047,0.00072961766,0.0008717955,0.0006563084,0.0010463634,0.0013484817,0.0009639426,0.0033012517],"category_scores_gemma":[0.002174602,0.00025713022,0.00040710112,0.0007124297,0.0005587802,0.0012592287,0.0010772527,0.0007211878,0.0011150807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003140133,0.00014162532,0.00089075655,0.00019383959,0.00007569033,0.0002790006,0.00021705175,0.50296783,0.032117404,0.044639803,0.009381958,0.408781],"study_design_scores_gemma":[0.00009181737,0.00012663646,0.00017263519,0.000014768121,0.000025567326,0.00021283027,0.000036094207,0.9707676,0.008083227,0.012463593,0.007984551,0.000020666546],"about_ca_topic_score_codex":0.00089061493,"about_ca_topic_score_gemma":0.0009431074,"teacher_disagreement_score":0.0033012517,"about_ca_system_score_codex":0.0005459506,"about_ca_system_score_gemma":0.00088188006,"threshold_uncertainty_score":0.011043847},"labels":[],"label_agreement":null},{"id":"W2029920607","doi":"10.1145/584066.584069","title":"RNG and internal node based broadcasting algorithms for wireless one-to-one networks","year":2001,"lang":"en","type":"article","venue":"ACM SIGMOBILE Mobile Computing and Communications Review","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Broadcasting (networking); Computer network; Overhead (engineering); Transmission (telecommunications); Reduction (mathematics); Wireless network; RADIUS; Wireless; Hidden node problem; Algorithm; Distributed computing; Telecommunications; Mathematics","score_opus":0.0552295914326902,"score_gpt":0.32771465264920346,"score_spread":0.2724850612165133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029920607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006873336,0.0013158055,0.98409593,0.00027801102,0.00010818386,0.00011904993,0.000070631475,0.00097070646,0.0061684125],"genre_scores_gemma":[0.15231165,0.0031208566,0.8342505,0.0003997156,0.00018322178,0.00037940528,0.000588929,0.00032077308,0.008444965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992079,0.00024121346,0.00003291733,0.00015452567,0.00028913392,0.00007445691],"domain_scores_gemma":[0.99871254,0.0005320688,0.00016736548,0.00025634372,0.000274055,0.000057560424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008498406,0.00082889386,0.0009130081,0.0012969855,0.0007205987,0.0009294452,0.001704475,0.00081050355,0.0028274257],"category_scores_gemma":[0.0029525412,0.0003429204,0.0006055205,0.0017185311,0.00086400006,0.0019394072,0.0011458206,0.0011536963,0.001243997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015977229,0.000093489354,0.00047484267,0.0006540351,0.00007944068,0.00010526559,0.0004860256,0.22114322,0.010260477,0.14993793,0.011585279,0.60502017],"study_design_scores_gemma":[0.00009288682,0.00023191264,0.0003734542,0.00008929397,0.000091698435,0.0004014527,0.0001730568,0.82881844,0.00889384,0.12334267,0.03743732,0.000053922053],"about_ca_topic_score_codex":0.0023899795,"about_ca_topic_score_gemma":0.002671626,"teacher_disagreement_score":0.0028274257,"about_ca_system_score_codex":0.0011343284,"about_ca_system_score_gemma":0.00082437997,"threshold_uncertainty_score":0.009458721},"labels":[],"label_agreement":null},{"id":"W2030430861","doi":"10.4108/icst.robocomm2009.5856","title":"Distributed Strategies for Local Minima Escape in Motion Planning for Mobile Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Social connectedness; Computer science; Motion planning; Distributed computing; Potential field; Field (mathematics); Motion (physics); Work (physics); Mobile computing; Computer network; Artificial intelligence; Engineering; Mathematics; Robot","score_opus":0.015506096029189375,"score_gpt":0.26928751452127736,"score_spread":0.25378141849208796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030430861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008824191,0.00033945712,0.9881053,0.00025738298,0.00004250545,0.00006349047,0.000012234625,0.00008186603,0.002273535],"genre_scores_gemma":[0.69197434,0.0009347761,0.29778132,0.00022270347,0.00015666233,0.00061195437,0.00007778487,0.00011339283,0.0081270775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941385,0.00021710985,0.000033303702,0.00011274193,0.00016860224,0.00005443022],"domain_scores_gemma":[0.99881375,0.00081392576,0.00006760947,0.00009422278,0.00014737791,0.00006313595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562381,0.00082152756,0.0011520683,0.00064576924,0.00074066967,0.0010652336,0.002249272,0.0013547429,0.0030050802],"category_scores_gemma":[0.004224545,0.00045645598,0.0006922144,0.0005242414,0.0010749216,0.0019674478,0.0019470897,0.0010922868,0.00036323446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014242079,0.00013477329,0.0004252731,0.0001988419,0.000076014425,0.00018490302,0.00026334057,0.8542133,0.0042094896,0.072875604,0.0018852132,0.06539074],"study_design_scores_gemma":[0.000059234877,0.00011443329,0.0000589964,0.0000125105,0.000010879702,0.000024699246,0.000027351387,0.97889805,0.00063617417,0.018475488,0.0016746322,0.000007550307],"about_ca_topic_score_codex":0.0011836574,"about_ca_topic_score_gemma":0.0015818923,"teacher_disagreement_score":0.0030050802,"about_ca_system_score_codex":0.0007056416,"about_ca_system_score_gemma":0.00073188235,"threshold_uncertainty_score":0.010053039},"labels":[],"label_agreement":null},{"id":"W2030541204","doi":"10.5555/1460047.1460065","title":"Energy level accuracy in mobile Ad-Hoc networks using OLSR","year":2007,"lang":"en","type":"article","venue":"International Wireless Internet Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimized Link State Routing Protocol; Computer science; Link-state routing protocol; Routing protocol; Computer network; Wireless Routing Protocol; Zone Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation)","score_opus":0.04297704666613731,"score_gpt":0.299589703803858,"score_spread":0.2566126571377207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030541204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52336085,0.0013095867,0.47061828,0.00032334053,0.000085446765,0.00009508107,0.00013428708,0.0015899594,0.002483075],"genre_scores_gemma":[0.95380723,0.00024845227,0.0455611,0.000024101533,0.00001621038,0.000021072072,0.00007475316,0.000032686403,0.00021430104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968098,0.000979585,0.0002368047,0.00025303877,0.0015438411,0.00017690781],"domain_scores_gemma":[0.9935363,0.0033304596,0.0009698737,0.0014142256,0.00067337084,0.00007574769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026719703,0.00061363354,0.00071865343,0.0013333801,0.00047527018,0.0011341501,0.0008230359,0.00052570883,0.00019952375],"category_scores_gemma":[0.012580025,0.0003759509,0.00033858573,0.0013427346,0.000623579,0.0022612624,0.0011065808,0.0005762436,0.00010083085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049146777,0.0001288198,0.017473608,0.00014531873,0.00016650502,0.0001519008,0.0002907044,0.8227527,0.017507302,0.0040164087,0.0005237035,0.13635147],"study_design_scores_gemma":[0.000018633362,0.00021782209,0.0051490506,0.000018292525,0.00005165677,0.00013538288,0.00008164123,0.97336966,0.017185293,0.003203546,0.0005230485,0.000045934976],"about_ca_topic_score_codex":0.0020231977,"about_ca_topic_score_gemma":0.0016682565,"teacher_disagreement_score":0.0026719703,"about_ca_system_score_codex":0.00056625437,"about_ca_system_score_gemma":0.00050905993,"threshold_uncertainty_score":0.01413089},"labels":[],"label_agreement":null},{"id":"W2030634389","doi":"10.1016/j.comnet.2009.05.006","title":"Congestion-aware channel assignment for multi-channel wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Vedecká Grantová Agentúra MŠVVaŠ SR a SAV","keywords":"Computer science; Computer network; Wireless mesh network; Channel (broadcasting); Throughput; Network packet; Algorithm; Node (physics); Queueing theory; Wireless network; Wireless; Telecommunications","score_opus":0.027398310445537026,"score_gpt":0.2559608670494426,"score_spread":0.22856255660390556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030634389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051627044,0.0011557308,0.9429569,0.0004596632,0.00030905096,0.00009358881,0.00007626915,0.0007827117,0.0025391225],"genre_scores_gemma":[0.9129984,0.00033848642,0.08455637,0.000063432286,0.0001490303,0.00006550929,0.00007580152,0.00007110539,0.0016819269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928135,0.00027100372,0.00003502916,0.00009724385,0.00016215758,0.0001532761],"domain_scores_gemma":[0.99791855,0.0011626601,0.00018522986,0.00021756937,0.000376604,0.00013937578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013718382,0.000468433,0.00067369145,0.0009595219,0.0009558507,0.0008149178,0.0014905907,0.00043992154,0.0020145376],"category_scores_gemma":[0.005196527,0.000412842,0.0002510149,0.0008479042,0.0005200372,0.0015935609,0.0011546556,0.0008461286,0.00018075023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005542106,0.0002376251,0.0016256968,0.00018553693,0.00007528093,0.00012042312,0.00016925164,0.7239242,0.015772862,0.016040046,0.006132151,0.2351627],"study_design_scores_gemma":[0.000017752576,0.000039359675,0.0001948881,0.0000049777573,0.00001577082,0.00003043122,0.000022227934,0.9928485,0.0015330833,0.004650128,0.0006323203,0.000010503687],"about_ca_topic_score_codex":0.0022795561,"about_ca_topic_score_gemma":0.0043073627,"teacher_disagreement_score":0.0022795561,"about_ca_system_score_codex":0.00079508265,"about_ca_system_score_gemma":0.0009044394,"threshold_uncertainty_score":0.0072550774},"labels":[],"label_agreement":null},{"id":"W2031395626","doi":"10.1145/986858.986866","title":"A certificate revocation scheme for wireless ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Revocation list; Computer science; Wireless ad hoc network; Computer network; Computer security; Vehicular ad hoc network; Revocation; Mobile ad hoc network; Ad hoc wireless distribution service; Wireless network; Certificate; Certificate authority; Wireless; Optimized Link State Routing Protocol; Public-key cryptography; Telecommunications; Overhead (engineering); Encryption","score_opus":0.04820589450217993,"score_gpt":0.2634515574106783,"score_spread":0.2152456629084984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031395626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047762223,0.0030478665,0.922088,0.0018230947,0.001377172,0.0008122677,0.00018560652,0.002290155,0.020613547],"genre_scores_gemma":[0.7562663,0.0017787584,0.2220712,0.0005380768,0.0005144407,0.00048381859,0.00051994045,0.00015910837,0.017668352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973496,0.0008143417,0.000302628,0.00034919858,0.0009141315,0.00027012543],"domain_scores_gemma":[0.9945813,0.0011558812,0.00074152136,0.0021616628,0.0008723311,0.00048731526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028302935,0.0005284449,0.00082617224,0.0011422476,0.0017825442,0.0015285915,0.001943186,0.0016622918,0.0020745895],"category_scores_gemma":[0.0075716963,0.00031541646,0.0005524965,0.0013582368,0.0019506476,0.005089095,0.003499625,0.0024738538,0.0011502501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613818,0.0002676385,0.0017555443,0.0007045279,0.0001222741,0.0015482655,0.001937996,0.023872271,0.08133568,0.44012684,0.016980762,0.4301869],"study_design_scores_gemma":[0.0014940144,0.002588766,0.0018553862,0.00038079746,0.0003659283,0.007444576,0.00063245045,0.2506685,0.06198292,0.16451429,0.507391,0.00068144884],"about_ca_topic_score_codex":0.0005551391,"about_ca_topic_score_gemma":0.00046199062,"teacher_disagreement_score":0.0028302935,"about_ca_system_score_codex":0.0012655739,"about_ca_system_score_gemma":0.0013604778,"threshold_uncertainty_score":0.014968216},"labels":[],"label_agreement":null},{"id":"W2031628231","doi":"10.1145/1868497.1868499","title":"Adaptive routing in mobile ad hoc networks based on decision aid approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobile ad hoc network; Routing (electronic design automation); Adaptation (eye); Limiting; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Voting; Adaptive quality of service multi-hop routing; Distributed computing; Optimized Link State Routing Protocol; Work (physics); Scale (ratio); Routing protocol; Process (computing); Computer network; Link-state routing protocol; Wireless; Engineering","score_opus":0.011598265893042426,"score_gpt":0.23241140045264796,"score_spread":0.22081313455960555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031628231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0085523445,0.00058054616,0.98744684,0.0002833436,0.000071562165,0.00007794409,0.000015765925,0.00008424961,0.0028873056],"genre_scores_gemma":[0.577243,0.0014567925,0.4172721,0.00022475747,0.0001649257,0.00024360472,0.00005753731,0.000027501068,0.0033097747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986082,0.0007257829,0.000066141954,0.00013698227,0.0003827789,0.000080161095],"domain_scores_gemma":[0.998398,0.0011979444,0.00009396725,0.000056987716,0.00019889245,0.000054163993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020742982,0.0006366328,0.00085016905,0.00077212637,0.00048408203,0.0014060825,0.0010072787,0.00083440426,0.0012594614],"category_scores_gemma":[0.0028495737,0.00026603084,0.0005649204,0.0009009745,0.00092702237,0.0013072833,0.000976919,0.0010243278,0.00022545588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019161814,0.00017173558,0.0011851382,0.00046770886,0.00018589667,0.00037180132,0.00027597536,0.7021073,0.0042606564,0.11942167,0.0015778939,0.16978265],"study_design_scores_gemma":[0.000028413388,0.00010184739,0.00013814584,0.000027203023,0.000034431287,0.00006661045,0.000049559876,0.95934725,0.0011233583,0.036216993,0.002848897,0.000017264765],"about_ca_topic_score_codex":0.0008897078,"about_ca_topic_score_gemma":0.0010018359,"teacher_disagreement_score":0.0020742982,"about_ca_system_score_codex":0.0005867388,"about_ca_system_score_gemma":0.0007743295,"threshold_uncertainty_score":0.010970056},"labels":[],"label_agreement":null},{"id":"W2031878414","doi":"10.1109/iscc.2009.5202337","title":"An efficient scheduling scheme for MIMO wireless mesh networks with fairness constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Wireless broadband; Maximum throughput scheduling; MIMO; Fairness measure; Scheduling (production processes); Distributed computing; Mesh networking; Max-min fairness; Wireless network; Broadband; Wireless; Broadband networks; Shared mesh; Switched mesh; Throughput; Dynamic priority scheduling; Round-robin scheduling; Mathematical optimization; Channel (broadcasting); Telecommunications; Quality of service; Mathematics","score_opus":0.010916708212757968,"score_gpt":0.2447810859494438,"score_spread":0.23386437773668584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031878414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025026198,0.0003370657,0.9720305,0.00015441251,0.00022966163,0.00016442238,0.00006812398,0.00034916835,0.0016403701],"genre_scores_gemma":[0.77291024,0.0002371379,0.2238122,0.0001520509,0.00022716158,0.00019473882,0.00011779381,0.000050805607,0.0022978813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988695,0.00033991266,0.000086995235,0.00014804091,0.0003522037,0.00020326779],"domain_scores_gemma":[0.9981521,0.0007816721,0.00019539603,0.00030246074,0.00040881702,0.0001595313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025934316,0.0005766296,0.00076855253,0.0008110695,0.001546131,0.00089359586,0.0014320592,0.0006692666,0.0012537069],"category_scores_gemma":[0.003837477,0.00024039912,0.00047451898,0.00083672826,0.0006528445,0.0009286591,0.0008627241,0.000652066,0.00029277406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084438635,0.00041484318,0.0018437677,0.00022831514,0.00018224599,0.00051007903,0.00047697866,0.5038517,0.06950527,0.13833663,0.00625947,0.27754638],"study_design_scores_gemma":[0.00007834127,0.00020839904,0.00031208087,0.000008633312,0.000040015475,0.00015406073,0.00003453559,0.9724769,0.007819601,0.015033357,0.0037949844,0.000039012357],"about_ca_topic_score_codex":0.0023094302,"about_ca_topic_score_gemma":0.0034599346,"teacher_disagreement_score":0.0025934316,"about_ca_system_score_codex":0.0015329564,"about_ca_system_score_gemma":0.0016994752,"threshold_uncertainty_score":0.013715506},"labels":[],"label_agreement":null},{"id":"W2031975490","doi":"10.1145/1868521.1868535","title":"Design and performance evaluation of QoS aware and location based service discovery protocol for vehicular networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Service discovery; Computer science; Computer network; Mobile QoS; Service provider; Quality of service; Service (business); Routing protocol; Service delivery framework; Protocol (science); Routing (electronic design automation); Web service; World Wide Web; Medicine","score_opus":0.03083562000809888,"score_gpt":0.2868691960710009,"score_spread":0.25603357606290206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031975490","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56891125,0.005199302,0.40558812,0.0007213117,0.00041897362,0.0017571751,0.00036968422,0.0018990618,0.0151351765],"genre_scores_gemma":[0.91782224,0.0011290691,0.077630945,0.00008632605,0.000042030977,0.00048090506,0.00048579136,0.00007501854,0.0022476674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995996,0.0014373525,0.0002829319,0.00026916186,0.0016974313,0.00031718705],"domain_scores_gemma":[0.99610305,0.0016646065,0.00032554852,0.00027726314,0.0014940909,0.00013546752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004102586,0.00078761415,0.00083654776,0.0013655026,0.0007539123,0.0012161551,0.001454139,0.0008069125,0.00084687636],"category_scores_gemma":[0.0073899454,0.00032972716,0.00034336105,0.001064527,0.0006550817,0.0017273222,0.0005497838,0.0006898758,0.0001963874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041619968,0.0013928583,0.015341865,0.0013034017,0.0004751393,0.0012301244,0.0008298788,0.56155866,0.16218744,0.031673003,0.0049717375,0.21487385],"study_design_scores_gemma":[0.00021959908,0.00273835,0.0022407372,0.000035207027,0.00023657325,0.00055477803,0.00017727661,0.9234044,0.061824992,0.0020885202,0.006414502,0.00006508433],"about_ca_topic_score_codex":0.0036542346,"about_ca_topic_score_gemma":0.002151629,"teacher_disagreement_score":0.004102586,"about_ca_system_score_codex":0.002262089,"about_ca_system_score_gemma":0.0016007815,"threshold_uncertainty_score":0.021696806},"labels":[],"label_agreement":null},{"id":"W2032098367","doi":"10.1109/wd.2011.6098188","title":"Enhanced Topology-controlled interference-aware channel assignment for Multi-Radio Multi-Channel Wireless Mesh Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Interference (communication); Throughput; Computer science; Wireless mesh network; Channel (broadcasting); Computer network; Topology (electrical circuits); Channel allocation schemes; Network topology; Co-channel interference; Wireless network; Adjacent-channel interference; Radio resource management; Enhanced Data Rates for GSM Evolution; Wireless; Mesh networking; Telecommunications; Engineering; Electrical engineering","score_opus":0.05030357029631943,"score_gpt":0.2676185354756512,"score_spread":0.21731496517933174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032098367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03375358,0.00046070447,0.96339047,0.00010587475,0.000085462416,0.00006393171,0.00002911375,0.00033437787,0.0017763984],"genre_scores_gemma":[0.7942504,0.00031897548,0.20431049,0.000075248034,0.00009352533,0.000102484504,0.00006010337,0.00003837214,0.000750391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994265,0.00023673581,0.000024445977,0.00006648553,0.00018385172,0.00006201822],"domain_scores_gemma":[0.99833727,0.00074935716,0.0002507245,0.00024801103,0.00031934754,0.00009528052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008784926,0.00043585154,0.0004379625,0.00045968147,0.00038480767,0.0005258371,0.0012592503,0.0004677182,0.0006973918],"category_scores_gemma":[0.0031689166,0.0001671729,0.00025189045,0.0006064039,0.00045272976,0.0011207536,0.00072900957,0.0007047457,0.00012742521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017139992,0.00013863653,0.00097459485,0.00010588261,0.000049755407,0.00006953911,0.000058929847,0.8923604,0.01478533,0.008669487,0.0010888625,0.08152725],"study_design_scores_gemma":[0.000015240493,0.000055464814,0.00012057701,0.000002281162,0.000009087913,0.000044079185,0.000005293335,0.99607205,0.0016900286,0.0013627679,0.0006176761,0.000005418046],"about_ca_topic_score_codex":0.00090505485,"about_ca_topic_score_gemma":0.0013227277,"teacher_disagreement_score":0.0012592503,"about_ca_system_score_codex":0.00042666623,"about_ca_system_score_gemma":0.00065183424,"threshold_uncertainty_score":0.0046460032},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0670637926794713,"score_gpt":0.3811164180693922,"score_spread":0.31405262538992096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032510935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028452601,0.24374117,0.64657485,0.01042102,0.0033293024,0.0003709107,0.00019100313,0.0006850916,0.06623409],"genre_scores_gemma":[0.31127167,0.324534,0.32022074,0.0032798767,0.00822264,0.00062469026,0.001039264,0.0004496811,0.03035747],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701655,0.00077921554,0.0001876819,0.0005060209,0.0012477576,0.0002628046],"domain_scores_gemma":[0.985899,0.009371846,0.00041911527,0.0013006984,0.002750534,0.00025885602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042091333,0.0012516004,0.0015093344,0.002902861,0.0016897459,0.0039185034,0.0032214215,0.002515246,0.0052413247],"category_scores_gemma":[0.01376283,0.0010094085,0.0008225862,0.005387804,0.0017860144,0.014186336,0.0014593287,0.003957222,0.0016059001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020712135,0.0003370277,0.0011896652,0.0025933774,0.0001474757,0.00017983951,0.0005805509,0.02995694,0.013934594,0.39683655,0.01384121,0.54019564],"study_design_scores_gemma":[0.00013216768,0.0007857521,0.0011052721,0.0016266324,0.00039492728,0.0015560638,0.0009037829,0.23710959,0.036288906,0.44840267,0.2715588,0.00013548904],"about_ca_topic_score_codex":0.0012078622,"about_ca_topic_score_gemma":0.00091697613,"teacher_disagreement_score":0.0052413247,"about_ca_system_score_codex":0.0024994202,"about_ca_system_score_gemma":0.001803102,"threshold_uncertainty_score":0.022260249},"labels":[],"label_agreement":null},{"id":"W2033226012","doi":"10.1109/wcl.2013.070913.130310","title":"An Energy-Efficient Transmission Range Assignment for 1-D Wireless Ad Hoc Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless ad hoc network; Computer science; Range (aeronautics); Transmission (telecommunications); Computer network; Node (physics); Energy consumption; Wireless network; Bounded function; Wireless; Topology (electrical circuits); Telecommunications; Mathematics; Engineering","score_opus":0.01744871819082773,"score_gpt":0.24696025626022897,"score_spread":0.22951153806940122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033226012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0088590635,0.00048025965,0.9887742,0.00009574363,0.00006535522,0.000038035258,0.00001726477,0.0001673387,0.0015027794],"genre_scores_gemma":[0.4248539,0.0012317676,0.56928724,0.00018899138,0.00021307963,0.00022965869,0.000099534205,0.00006262726,0.003833216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993969,0.00022875983,0.000031304084,0.00010110481,0.00019759675,0.000044231383],"domain_scores_gemma":[0.99948895,0.00020258332,0.00009653079,0.000089438305,0.00009126574,0.000031250827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045114203,0.00049565925,0.00046264482,0.00055876403,0.0004726122,0.0005290373,0.0013904553,0.0003825316,0.0011328765],"category_scores_gemma":[0.0018150546,0.00023793364,0.00029412506,0.00073604094,0.00035459315,0.0013396116,0.001092549,0.00051469036,0.00037600112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020597414,0.00026382357,0.0007731574,0.0004663663,0.00007472855,0.00027572928,0.00028648923,0.2456476,0.07430374,0.06794026,0.0052250777,0.60453707],"study_design_scores_gemma":[0.000041790223,0.0004381606,0.00037973942,0.00002441541,0.0000374801,0.0007494493,0.000045298875,0.961681,0.010595365,0.013691776,0.012264886,0.00005052289],"about_ca_topic_score_codex":0.0002330954,"about_ca_topic_score_gemma":0.00037682106,"teacher_disagreement_score":0.0013904553,"about_ca_system_score_codex":0.00022727424,"about_ca_system_score_gemma":0.00028511017,"threshold_uncertainty_score":0.0037898421},"labels":[],"label_agreement":null},{"id":"W2033383294","doi":"10.1002/dac.644","title":"Split agent‐based routing in interconnected networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Computer network; Static routing; Distributed computing; Hierarchical routing; Routing (electronic design automation); Routing table; Policy-based routing; Source routing; Quality of service; Dynamic Source Routing; Routing protocol","score_opus":0.02140463948165193,"score_gpt":0.2799678843567213,"score_spread":0.2585632448750694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033383294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09645929,0.0006456394,0.8970398,0.0002829421,0.00006713751,0.000118028605,0.000042712247,0.00034851496,0.004996083],"genre_scores_gemma":[0.8676008,0.00047629105,0.12768468,0.00006677625,0.000029169492,0.00016403718,0.00009564618,0.000037961086,0.0038446602],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965835,0.00015381063,0.000018269724,0.000058528494,0.0000772778,0.000033829918],"domain_scores_gemma":[0.9994437,0.00025818413,0.000097176206,0.00006113835,0.00008921277,0.000050541345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007035777,0.00034586052,0.00054465875,0.0005556645,0.00043327367,0.0009310237,0.00075024465,0.00059991167,0.0011755096],"category_scores_gemma":[0.0015539727,0.0002869851,0.00024138004,0.00045198956,0.00075169664,0.00085676886,0.0010426437,0.00042104156,0.00018260202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096119074,0.000027636157,0.00055022555,0.00005002811,0.000042230466,0.00012644437,0.00015354599,0.92501116,0.0047785733,0.039573044,0.0008341136,0.028756874],"study_design_scores_gemma":[0.000007553725,0.000023683448,0.00007714556,0.0000038081062,0.0000051211327,0.00001690547,0.000018323468,0.98825336,0.00036498532,0.010341447,0.0008846107,0.000003015242],"about_ca_topic_score_codex":0.0014333035,"about_ca_topic_score_gemma":0.001351276,"teacher_disagreement_score":0.0014333035,"about_ca_system_score_codex":0.0006212001,"about_ca_system_score_gemma":0.0004022261,"threshold_uncertainty_score":0.0045071244},"labels":[],"label_agreement":null},{"id":"W2033513442","doi":"10.1239/aap/1261669589","title":"On the expected maximum degree of Gabriel and Yao graphs","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Degree (music); Discrete mathematics; Unit square; Graph; Random regular graph; Line graph; 1-planar graph","score_opus":0.015536163493355543,"score_gpt":0.23897226591980186,"score_spread":0.22343610242644632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033513442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4187053,0.0040694047,0.54924107,0.0074032852,0.00021784152,0.00012485814,0.0007750538,0.0005205612,0.018942581],"genre_scores_gemma":[0.9665944,0.003128009,0.02518685,0.00051038415,0.00039265517,0.00022832518,0.00037582597,0.00020632379,0.0033772124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971107,0.0013337043,0.00007249534,0.0004652487,0.0005885846,0.0004291827],"domain_scores_gemma":[0.9199652,0.068489976,0.0033387442,0.0029199203,0.002684604,0.002601556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055140466,0.0012010639,0.001866774,0.0030871914,0.0016539696,0.0025290956,0.002906608,0.0021015692,0.003252907],"category_scores_gemma":[0.0735412,0.0011598632,0.00089912344,0.0025518457,0.00522692,0.010818301,0.0030661367,0.0027933829,0.0005420457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039510662,0.0000701709,0.0041441424,0.00030095817,0.0000784131,0.0003290824,0.0005999881,0.18379064,0.0033941767,0.7905631,0.0041770935,0.012157131],"study_design_scores_gemma":[0.00007620493,0.000083503706,0.0014789077,0.00008756432,0.000042491476,0.00045908653,0.0001706985,0.38581622,0.0013580885,0.6078961,0.002470507,0.000060693437],"about_ca_topic_score_codex":0.0018563044,"about_ca_topic_score_gemma":0.0018551641,"teacher_disagreement_score":0.0055140466,"about_ca_system_score_codex":0.0032322556,"about_ca_system_score_gemma":0.0011130504,"threshold_uncertainty_score":0.029161394},"labels":[],"label_agreement":null},{"id":"W2033599408","doi":"10.1109/ainaw.2007.100","title":"Assessment of a Mobile Agent Based Routing Protocol for Mobile Ad-hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Distributed computing; Zone Routing Protocol; Routing protocol; Ad hoc On-Demand Distance Vector Routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Ad hoc wireless distribution service; Enhanced Interior Gateway Routing Protocol; Network packet","score_opus":0.022580827576902045,"score_gpt":0.3380051888777954,"score_spread":0.31542436130089335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033599408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05593835,0.0067261,0.8267188,0.002111391,0.0013960567,0.0034126742,0.00040925678,0.0031320418,0.10015535],"genre_scores_gemma":[0.44992277,0.0037506907,0.52102774,0.00040692574,0.00021658666,0.0015777556,0.0008277143,0.0002413769,0.022028493],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461466,0.0016389986,0.0002329601,0.00023875288,0.0031342783,0.00014026072],"domain_scores_gemma":[0.9946682,0.0011372967,0.000337713,0.00033684695,0.0033605555,0.00015940699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004097796,0.0010152478,0.0005521133,0.0014030007,0.00085498445,0.0022993784,0.0017639499,0.0015071256,0.003132338],"category_scores_gemma":[0.012188603,0.00023659173,0.00044409157,0.0009895981,0.0004244919,0.003188554,0.00094168563,0.0009573988,0.001490791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005885001,0.00075149315,0.006903261,0.0014452774,0.00016857371,0.0010604768,0.00035045666,0.12428451,0.037279077,0.14478104,0.017793458,0.6645938],"study_design_scores_gemma":[0.00013713154,0.003342595,0.0037367565,0.0005369301,0.0003396998,0.0022776676,0.00049893936,0.74021816,0.033262372,0.034213386,0.18128955,0.00014688094],"about_ca_topic_score_codex":0.0013800911,"about_ca_topic_score_gemma":0.0015748191,"teacher_disagreement_score":0.004097796,"about_ca_system_score_codex":0.0013348293,"about_ca_system_score_gemma":0.0016366926,"threshold_uncertainty_score":0.021671414},"labels":[],"label_agreement":null},{"id":"W2033635847","doi":"10.1007/s12209-010-0018-1","title":"Detection of selfish behavior in wireless ad hoc networks based on CUSUM algorithm","year":2010,"lang":"en","type":"article","venue":"Transactions of Tianjin University","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"CUSUM; Exponential backoff; Computer science; Wireless ad hoc network; False alarm; Algorithm; Wireless network; Node (physics); Mobile ad hoc network; Computer network; Real-time computing; Wireless sensor network; Wireless; Network packet; Mathematics; Statistics; Throughput; Engineering","score_opus":0.005325860941298035,"score_gpt":0.18889083885541133,"score_spread":0.1835649779141133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033635847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25672287,0.0016125141,0.7386591,0.00037303037,0.00024698774,0.00014168024,0.000056518937,0.00064661715,0.0015406689],"genre_scores_gemma":[0.92340314,0.00023649984,0.075504,0.000072728406,0.000072164774,0.000075904776,0.000059264847,0.00002720748,0.0005490535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988424,0.0005083484,0.00007471015,0.0001570448,0.00029427515,0.00012337713],"domain_scores_gemma":[0.99378854,0.0040592724,0.0005049242,0.00026725538,0.0011169239,0.00026302264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017687895,0.00079981226,0.0016310007,0.0019153868,0.0012318181,0.0009319001,0.0013351281,0.00078136387,0.0004409504],"category_scores_gemma":[0.007206843,0.00029804368,0.00033350824,0.001334734,0.00090547634,0.0012622031,0.000979473,0.00058455236,0.000097962366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036463067,0.0006175414,0.054289706,0.0005037559,0.00047713367,0.001298942,0.0011406662,0.32145122,0.043602668,0.06296813,0.010191537,0.49981236],"study_design_scores_gemma":[0.000015592857,0.0001088845,0.0011662206,0.000009956025,0.000021985657,0.0001305493,0.000047179037,0.99300027,0.002563752,0.0026067554,0.0003120172,0.000016822076],"about_ca_topic_score_codex":0.003113417,"about_ca_topic_score_gemma":0.002921324,"teacher_disagreement_score":0.003113417,"about_ca_system_score_codex":0.0008614903,"about_ca_system_score_gemma":0.00085137616,"threshold_uncertainty_score":0.009354353},"labels":[],"label_agreement":null},{"id":"W2033649629","doi":"10.1007/s11227-013-1009-5","title":"Secure and robust multipath routings for advanced metering infrastructure","year":2013,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Multipath routing; Robustness (evolution); Smart grid; Routing protocol; Wireless; Default gateway; Multipath propagation; Wireless network; Distributed computing; Link-state routing protocol; Routing (electronic design automation); Telecommunications","score_opus":0.009435914658442499,"score_gpt":0.21218127396769954,"score_spread":0.20274535930925702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033649629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064704865,0.00082963204,0.9256902,0.0009892896,0.00029234675,0.00017514853,0.00017428542,0.0020037692,0.0051406357],"genre_scores_gemma":[0.90558934,0.00033593512,0.08986392,0.0000973129,0.000128535,0.00007340408,0.00014236323,0.00009982717,0.0036694151],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831957,0.00039053216,0.00013748115,0.00024044001,0.0006615049,0.00025047938],"domain_scores_gemma":[0.9946991,0.0016347916,0.0009504378,0.0019969402,0.00057784567,0.00014091593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019044137,0.00081406755,0.0008309199,0.0011157863,0.0010134485,0.0017276519,0.001246312,0.001310723,0.0020701056],"category_scores_gemma":[0.0072094635,0.0005988169,0.00052841316,0.00071152527,0.0014048631,0.0026321248,0.0034035312,0.0016413914,0.00077681727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011658544,0.00012437048,0.0013817861,0.00016288245,0.00015620961,0.00039980406,0.00023403,0.61616147,0.04028445,0.13894787,0.0070016836,0.19397949],"study_design_scores_gemma":[0.000057451358,0.00025461314,0.00037152527,0.000023308317,0.000051090206,0.00022628988,0.00009135459,0.91492194,0.010547606,0.06840004,0.005006308,0.000048438724],"about_ca_topic_score_codex":0.0008590914,"about_ca_topic_score_gemma":0.0016391386,"teacher_disagreement_score":0.0020701056,"about_ca_system_score_codex":0.0013705519,"about_ca_system_score_gemma":0.0010978449,"threshold_uncertainty_score":0.010071635},"labels":[],"label_agreement":null},{"id":"W2034127391","doi":"10.1109/mobiqw.2006.361788","title":"Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Link-state routing protocol; Static routing; Algorithm; Dynamic Source Routing; Equal-cost multi-path routing; Multipath routing; Path vector protocol; Distributed computing; Routing (electronic design automation); Computer network; Routing protocol","score_opus":0.010185214636045874,"score_gpt":0.23797184764037463,"score_spread":0.22778663300432875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034127391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043553165,0.00039357215,0.99282056,0.00014578602,0.0000939323,0.000049070706,0.00004702874,0.0008459661,0.0012487627],"genre_scores_gemma":[0.15674908,0.00081030047,0.8387099,0.00018014363,0.00008212061,0.00030150605,0.00033646947,0.00013842182,0.0026920598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988424,0.00040964442,0.000071813185,0.00017058518,0.00043692172,0.00006868],"domain_scores_gemma":[0.99838674,0.00064908375,0.00018435501,0.00040915192,0.00032627524,0.000044486373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010862227,0.000865026,0.00080054114,0.0008873534,0.00086237607,0.0012932657,0.001579467,0.00089689484,0.0024947939],"category_scores_gemma":[0.004116248,0.00043596188,0.00065807276,0.0011715904,0.0006432253,0.001760675,0.001320772,0.00097399927,0.0009595942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023259046,0.00007308105,0.0009426106,0.0001451267,0.00008359724,0.00008609165,0.0001161523,0.6078496,0.0065289023,0.058477703,0.0060954336,0.31936917],"study_design_scores_gemma":[0.000052940468,0.000083398954,0.00018698741,0.000015145899,0.000025230613,0.00011867644,0.000026368429,0.96803933,0.0030449957,0.020124607,0.0082514165,0.000030928],"about_ca_topic_score_codex":0.0032804532,"about_ca_topic_score_gemma":0.004725962,"teacher_disagreement_score":0.0032804532,"about_ca_system_score_codex":0.00091420073,"about_ca_system_score_gemma":0.0011672755,"threshold_uncertainty_score":0.008345902},"labels":[],"label_agreement":null},{"id":"W2034534596","doi":"10.4028/www.scientific.net/amr.734-737.3203","title":"Studies on the Secure Routing Protocols of Mobile AD Hoc Networks","year":2013,"lang":"en","type":"article","venue":"Advanced materials research","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Echo Foundation","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Wireless ad hoc network; Wireless Routing Protocol; Link-state routing protocol; Geocast; Ad hoc wireless distribution service; Distributed computing; Destination-Sequenced Distance Vector routing; Routing protocol; Computer security; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.07892095584324531,"score_gpt":0.40180157130953237,"score_spread":0.32288061546628705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034534596","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02754646,0.32135275,0.49122033,0.0104508465,0.0037786386,0.00030965084,0.000111109184,0.00021587178,0.1450144],"genre_scores_gemma":[0.3537816,0.47775507,0.1301456,0.0025204027,0.006379992,0.0005624369,0.00032166528,0.00020204499,0.02833121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99710697,0.00075642526,0.0002253184,0.0003028748,0.0014516308,0.00015682892],"domain_scores_gemma":[0.99451584,0.0034726162,0.0004036887,0.00046684348,0.0010574536,0.00008364468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025363571,0.0010382506,0.00061065925,0.0022688976,0.001257443,0.0027592108,0.0011262884,0.0017621248,0.0022506178],"category_scores_gemma":[0.008277283,0.00079557224,0.0007213482,0.0038505008,0.0029098215,0.008476354,0.0010762843,0.0034517255,0.0010972385],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025393092,0.000056322904,0.00043541467,0.00062569196,0.000037063863,0.00037288337,0.0007219786,0.01328774,0.0019397243,0.89586896,0.0042235795,0.08240523],"study_design_scores_gemma":[0.000021036938,0.00018735933,0.00043781046,0.0008428641,0.00005827188,0.0016752814,0.000458034,0.0364297,0.0029131065,0.68064207,0.27627605,0.000058476577],"about_ca_topic_score_codex":0.00073785416,"about_ca_topic_score_gemma":0.00036703944,"teacher_disagreement_score":0.0027592108,"about_ca_system_score_codex":0.0014641687,"about_ca_system_score_gemma":0.0011749733,"threshold_uncertainty_score":0.013413668},"labels":[],"label_agreement":null},{"id":"W2034657792","doi":"10.1109/jsyst.2013.2294881","title":"On the Overheads of Ad Hoc Routing Schemes","year":2014,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Wireless Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Distributed computing; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Static routing; Routing protocol; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Ad hoc wireless distribution service; Policy-based routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.01598621794365901,"score_gpt":0.2335851013778419,"score_spread":0.2175988834341829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034657792","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46302703,0.06302238,0.3074614,0.0072756293,0.002389435,0.0008000522,0.0007780494,0.0012146616,0.15403126],"genre_scores_gemma":[0.95329845,0.010080452,0.02834791,0.00030267946,0.0005666101,0.00015720559,0.00014117348,0.00023102744,0.0068745404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909464,0.0025788401,0.0003817102,0.00038305603,0.004652722,0.0010573511],"domain_scores_gemma":[0.9515222,0.035303533,0.0028316695,0.0064739976,0.0034840447,0.00038459137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049530924,0.0013507715,0.0009297521,0.003052675,0.0014885397,0.00260108,0.0019040311,0.0012427717,0.0033044822],"category_scores_gemma":[0.03245774,0.0005578708,0.0005819738,0.0035396013,0.0019911153,0.0077094673,0.0018684746,0.0017352535,0.0006164984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014860803,0.0003670683,0.003928773,0.0008650153,0.00012555202,0.00070592004,0.00071881036,0.34298018,0.018000513,0.4751967,0.0060971896,0.14952824],"study_design_scores_gemma":[0.00025136746,0.0012109771,0.009694453,0.0008418395,0.0005259738,0.0029890276,0.0011506932,0.6050082,0.038313787,0.26097065,0.07881169,0.00023130946],"about_ca_topic_score_codex":0.0015130434,"about_ca_topic_score_gemma":0.0010092816,"teacher_disagreement_score":0.0049530924,"about_ca_system_score_codex":0.0033121489,"about_ca_system_score_gemma":0.0014786518,"threshold_uncertainty_score":0.026194751},"labels":[],"label_agreement":null},{"id":"W2034864191","doi":"10.1109/icc.2012.6364143","title":"Adaptive video streaming with inter-vehicle relay for highway VANET scenario","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Relay; Vehicular ad hoc network; Video quality; Scalable Video Coding; Real-time computing; Download; Quality of experience; Latency (audio); Video streaming; Scalability; Overlay; Wireless; Wireless ad hoc network; Quality of service; Telecommunications","score_opus":0.016729159880849446,"score_gpt":0.22838650171822752,"score_spread":0.21165734183737808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034864191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49133977,0.000941921,0.5018827,0.0003649503,0.00007851845,0.00021479133,0.00013094282,0.00097161415,0.0040747453],"genre_scores_gemma":[0.984036,0.000176242,0.015207855,0.000017882108,0.000017795448,0.00001941603,0.000041916832,0.0000069070657,0.0004759392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997764,0.00007795798,0.000013834705,0.00004206508,0.000052210587,0.00003752745],"domain_scores_gemma":[0.9995747,0.0001868062,0.000049940303,0.000038711332,0.00011716966,0.00003265727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043235812,0.0003896635,0.0003583695,0.00038976804,0.00033521777,0.0002394185,0.0006481082,0.0004132381,0.00048457764],"category_scores_gemma":[0.000778879,0.00011651122,0.00021965033,0.0002565858,0.00023161597,0.00051374245,0.00033265757,0.00030129924,0.000093619856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013785815,0.00028901416,0.005442169,0.00037961185,0.00021963357,0.0040719304,0.00052289007,0.5977995,0.19437757,0.011607054,0.0031924497,0.18071963],"study_design_scores_gemma":[0.000022749855,0.00024713902,0.0006351297,0.0000038600747,0.000031717376,0.0004029662,0.00007695884,0.9885388,0.008273957,0.0011265654,0.0006235363,0.000016494258],"about_ca_topic_score_codex":0.0029071812,"about_ca_topic_score_gemma":0.002517411,"teacher_disagreement_score":0.0029071812,"about_ca_system_score_codex":0.00038979165,"about_ca_system_score_gemma":0.00023612971,"threshold_uncertainty_score":0.0057804585},"labels":[],"label_agreement":null},{"id":"W2035004475","doi":"10.3166/isi.14.1.39-64","title":"Protocole de découverte de services interopérable en réseau<i>ad hoc</i>","year":2009,"lang":"fr","type":"article","venue":"Ingénierie des systèmes d information","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Political science","score_opus":0.009863251707024396,"score_gpt":0.23991392588853425,"score_spread":0.23005067418150985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035004475","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019025901,0.0011930561,0.91069573,0.0022954098,0.0013466302,0.0028169178,0.000928055,0.006097776,0.055600416],"genre_scores_gemma":[0.3657271,0.0035400284,0.45985416,0.0028470086,0.00069404085,0.0067857695,0.005016291,0.0018342478,0.15370135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9932105,0.0019393433,0.0009958545,0.00075410405,0.0025408668,0.0005593395],"domain_scores_gemma":[0.99213374,0.0019185884,0.00052070164,0.001976663,0.002868126,0.00058217795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008188611,0.0009691429,0.0010586885,0.0018111436,0.0027741785,0.0067452425,0.0022794239,0.0028750612,0.008624532],"category_scores_gemma":[0.010169345,0.0009184302,0.0009893238,0.0014742399,0.0029238807,0.0049912273,0.005144849,0.004255908,0.0045405026],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018787605,0.0005887376,0.0027707268,0.001978173,0.00031314619,0.0025889103,0.0070685907,0.016195705,0.083259314,0.6035145,0.06347742,0.21636598],"study_design_scores_gemma":[0.0005365997,0.00067306927,0.0014450728,0.000545724,0.00014756055,0.0011953819,0.0014299967,0.1013756,0.11960237,0.0626413,0.7100252,0.00038213897],"about_ca_topic_score_codex":0.007112237,"about_ca_topic_score_gemma":0.0042573614,"teacher_disagreement_score":0.008624532,"about_ca_system_score_codex":0.0025177835,"about_ca_system_score_gemma":0.005358531,"threshold_uncertainty_score":0.043305993},"labels":[],"label_agreement":null},{"id":"W2035386114","doi":"10.1109/wcnc.2012.6214288","title":"Impact of mobility on trust decay rate","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Exponential decay; Exponential growth; Computation; Computer science; Random walk; Statistical physics; Exponential function; Range (aeronautics); Transmission rate; Value (mathematics); Mobility model; Social trust; Transmission (telecommunications); Topology (electrical circuits); Physics; Computer network; Mathematics; Algorithm; Statistics; Telecommunications; Mathematical analysis; Materials science; Law; Quantum mechanics","score_opus":0.019055893375771293,"score_gpt":0.2859590609592878,"score_spread":0.2669031675835165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035386114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45080942,0.00406899,0.5320781,0.0023284913,0.00016639168,0.00012518145,0.00030546877,0.00054949516,0.00956848],"genre_scores_gemma":[0.99149865,0.0007276237,0.006693803,0.000054501194,0.000029523133,0.00004127776,0.000051887793,0.00006010978,0.00084260566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961521,0.0016241012,0.00023523987,0.00050895475,0.00082352944,0.00065607356],"domain_scores_gemma":[0.9313559,0.052633412,0.005527438,0.0052879974,0.004343792,0.0008514372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005756228,0.0007869007,0.0009892733,0.0010430455,0.00087255787,0.0019514766,0.0010406525,0.0012564918,0.0011766047],"category_scores_gemma":[0.07860317,0.0004516166,0.0008242292,0.00087124115,0.0016440981,0.004849679,0.0017895245,0.0020244045,0.00029384313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007949584,0.000113837785,0.022516564,0.00043570474,0.00021310964,0.0011737391,0.0018803893,0.7699964,0.011905039,0.12482741,0.0020867737,0.06405609],"study_design_scores_gemma":[0.000028840439,0.00028851704,0.0032483796,0.00010086002,0.00010259293,0.0010070032,0.00043845744,0.9506403,0.0068297423,0.035116017,0.0020976986,0.00010165844],"about_ca_topic_score_codex":0.0038051845,"about_ca_topic_score_gemma":0.0011564972,"teacher_disagreement_score":0.005756228,"about_ca_system_score_codex":0.0020190398,"about_ca_system_score_gemma":0.0009853045,"threshold_uncertainty_score":0.030442238},"labels":[],"label_agreement":null},{"id":"W2035767270","doi":"10.1109/broadnets.2008.4769148","title":"A distributed admission control scheme for Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Admission control; Computer science; Quality of service; Computer network; Wireless mesh network; Scalability; Call Admission Control; Distributed computing; Wireless network; Wireless; Telecommunications","score_opus":0.01439415133523369,"score_gpt":0.2349428893616967,"score_spread":0.220548738026463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035767270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010292387,0.00031145217,0.9856678,0.000254899,0.00014561959,0.00012231541,0.000034308865,0.00091218017,0.0022590642],"genre_scores_gemma":[0.8345699,0.00036303984,0.16032933,0.00022326065,0.00022168025,0.00030966845,0.0001349215,0.00006222802,0.0037860605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867415,0.00034870845,0.00007488844,0.00021481357,0.0005602072,0.00012720197],"domain_scores_gemma":[0.9988738,0.00040333997,0.00012223757,0.00023867107,0.00026426162,0.000097725075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014879147,0.0005887098,0.00061502267,0.00070138625,0.0012171958,0.0010726204,0.002104386,0.0009384419,0.0014931102],"category_scores_gemma":[0.0041044117,0.00018914341,0.0005391265,0.0008828376,0.0010235397,0.0013746329,0.0017776925,0.0015685756,0.00028388528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045892774,0.00024219809,0.00105396,0.00013221145,0.00012287282,0.00022992078,0.00039954914,0.4533809,0.03022977,0.19797283,0.007371949,0.30840486],"study_design_scores_gemma":[0.000046345867,0.000058657944,0.00012017307,0.000006674699,0.000018741055,0.0000623204,0.000015732036,0.9735041,0.0023445406,0.019089365,0.0047113886,0.000022031161],"about_ca_topic_score_codex":0.0039987527,"about_ca_topic_score_gemma":0.0036101937,"teacher_disagreement_score":0.0039987527,"about_ca_system_score_codex":0.0018597019,"about_ca_system_score_gemma":0.0015291629,"threshold_uncertainty_score":0.013493121},"labels":[],"label_agreement":null},{"id":"W2035850907","doi":"10.1145/1454503.1454571","title":"A self-adaptive placement protocol for mobile directories in MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Directory; Service discovery; Mobile ad hoc network; Computer network; Protocol (science); Heuristic; Distributed computing; Scheme (mathematics); Operating system; Artificial intelligence; World Wide Web; Web service","score_opus":0.02611049305109123,"score_gpt":0.28138865714483624,"score_spread":0.255278164093745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035850907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021357346,0.00051912485,0.9727658,0.00033743086,0.0001470479,0.0002419984,0.000091980924,0.0021484953,0.002390746],"genre_scores_gemma":[0.5182108,0.0005921023,0.47395054,0.0002579067,0.00020365846,0.0004973044,0.00034414875,0.00015254128,0.005790889],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992569,0.00027188944,0.000057092744,0.00010606279,0.00023745035,0.00007066841],"domain_scores_gemma":[0.9984634,0.000546933,0.00018963592,0.00038248225,0.00026611163,0.00015150501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013797856,0.00035791472,0.0005830881,0.0007813598,0.0012917251,0.0009342925,0.001203153,0.00072470424,0.0015067245],"category_scores_gemma":[0.0034122681,0.00028951507,0.00025679017,0.00080910075,0.0008189237,0.0014194092,0.0016423013,0.00076390355,0.00058860483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063244055,0.00039504337,0.002980852,0.0003540028,0.00012195464,0.0005475128,0.0007631148,0.17868556,0.042152856,0.12963906,0.0197192,0.6240084],"study_design_scores_gemma":[0.0001010886,0.00047769296,0.0005892567,0.00002928114,0.000043290074,0.0006214625,0.00014343382,0.9280607,0.013617579,0.020909641,0.035324253,0.00008231152],"about_ca_topic_score_codex":0.0012974204,"about_ca_topic_score_gemma":0.0022220532,"teacher_disagreement_score":0.0015067245,"about_ca_system_score_codex":0.0005483588,"about_ca_system_score_gemma":0.0008706959,"threshold_uncertainty_score":0.0072970986},"labels":[],"label_agreement":null},{"id":"W2036075757","doi":"10.1504/ijsn.2008.017225","title":"A novel localised authentication scheme in IEEE 802.11 based Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Security and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Roaming; Computer science; Computer network; Wireless mesh network; Handover; Authentication (law); Wireless network; Overhead (engineering); Scheme (mathematics); Switched mesh; Shared mesh; Wireless; Computer security; Telecommunications","score_opus":0.014766761159167568,"score_gpt":0.24284835012980832,"score_spread":0.22808158897064076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036075757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02177423,0.0009084335,0.974668,0.00016637724,0.00021604367,0.00011850394,0.000023028577,0.0006294843,0.0014959744],"genre_scores_gemma":[0.7719107,0.00064076355,0.22238894,0.00017275645,0.00017655261,0.00018053927,0.0001108439,0.000031694013,0.0043872176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989868,0.00036303748,0.000080764104,0.0001415814,0.00030963885,0.000118198936],"domain_scores_gemma":[0.99886876,0.00029621783,0.00017207,0.00031165165,0.00028766767,0.00006361826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011536238,0.0005748895,0.0006384769,0.00077406137,0.0007628233,0.00075396005,0.0015247195,0.0010109623,0.0014036308],"category_scores_gemma":[0.0023055924,0.0002479588,0.00048522124,0.0007182402,0.00076280837,0.0027427946,0.0016479141,0.0011665723,0.00074443716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094469095,0.0002213409,0.0018928852,0.0006925577,0.00012488372,0.0007060512,0.0006247689,0.063506864,0.20302555,0.1435946,0.004325995,0.58033985],"study_design_scores_gemma":[0.00014263748,0.0011888283,0.0010263692,0.000073569914,0.0001427974,0.0017235016,0.00015986574,0.8910251,0.055807862,0.024974262,0.023533724,0.0002014819],"about_ca_topic_score_codex":0.00044117408,"about_ca_topic_score_gemma":0.00040328328,"teacher_disagreement_score":0.0015247195,"about_ca_system_score_codex":0.00054681674,"about_ca_system_score_gemma":0.00051492767,"threshold_uncertainty_score":0.006101012},"labels":[],"label_agreement":null},{"id":"W2036150506","doi":"10.1007/s11036-010-0248-4","title":"Throughput Gateways-Congestion Trade-Off in Designing Multi-Radio Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Switched mesh; Shared mesh; Throughput; Mesh networking; Order One Network Protocol; Network congestion; Distributed computing; Heuristic; Wireless network; Network packet; Wireless; Telecommunications","score_opus":0.01006048821327231,"score_gpt":0.23911367788595522,"score_spread":0.2290531896726829,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036150506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338737,0.0014395618,0.9082439,0.00045619017,0.0000848576,0.00016738984,0.000031831067,0.00048890844,0.0056999284],"genre_scores_gemma":[0.909645,0.0005122233,0.08802332,0.00010985331,0.00010031853,0.00009653098,0.000017464363,0.00011751824,0.0013777136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984958,0.0007758946,0.00006337401,0.0001577685,0.0003167879,0.00019050634],"domain_scores_gemma":[0.99597025,0.0031575388,0.00025790345,0.00018613558,0.0002829896,0.0001452443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036866318,0.00096212217,0.0009784475,0.0010725167,0.0007673011,0.0016964556,0.0014743614,0.0010766371,0.0015724741],"category_scores_gemma":[0.009634785,0.0011120108,0.0004069081,0.00079304335,0.0009444067,0.0026694085,0.0014505603,0.00096679246,0.00022202014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022467645,0.000107024774,0.0012951598,0.00019970277,0.00007179139,0.00017946675,0.00015981296,0.8945737,0.011267578,0.035980463,0.0007591054,0.055181555],"study_design_scores_gemma":[0.000028127122,0.00019081042,0.0003262117,0.00002281654,0.00007573291,0.00011168001,0.00004189414,0.978683,0.004997925,0.0148972515,0.0006122003,0.00001235767],"about_ca_topic_score_codex":0.0006338503,"about_ca_topic_score_gemma":0.0017665572,"teacher_disagreement_score":0.0036866318,"about_ca_system_score_codex":0.0014992381,"about_ca_system_score_gemma":0.0006752441,"threshold_uncertainty_score":0.019497037},"labels":[],"label_agreement":null},{"id":"W2036396920","doi":"10.1109/medhocnet.2010.5546872","title":"DTSG: Dynamic time-stable geocast routing in vehicular ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Geocast; Computer science; Computer network; Vehicular ad hoc network; Wireless ad hoc network; Broadcasting (networking); Protocol (science); Mobile ad hoc network; Routing protocol; Optimized Link State Routing Protocol; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.004537226540741039,"score_gpt":0.20828606254597257,"score_spread":0.20374883600523153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036396920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01723098,0.0024441665,0.96799254,0.0005298622,0.000699305,0.0003165135,0.00037315144,0.0024088032,0.008004649],"genre_scores_gemma":[0.7431331,0.005044158,0.23627001,0.00049001287,0.00039477076,0.00052193494,0.0020222114,0.00030868585,0.011815011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994783,0.0001051979,0.000041743908,0.00007974433,0.00022987984,0.000065229084],"domain_scores_gemma":[0.9995943,0.000096477735,0.000065158936,0.00006495284,0.00013559105,0.000043488744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006728291,0.0005639048,0.0004985209,0.0008556894,0.00059703423,0.0008444955,0.0013278484,0.00066377356,0.0012401904],"category_scores_gemma":[0.0013951854,0.00018534623,0.0005074701,0.0013198917,0.00069406966,0.0012420896,0.0011328058,0.0007721481,0.0004973317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006323842,0.00014776364,0.001787242,0.00080688484,0.00014095618,0.00067823246,0.00043920285,0.36850736,0.04245848,0.16396776,0.029345332,0.39108843],"study_design_scores_gemma":[0.00016032816,0.0005415376,0.0006845853,0.00009559344,0.00009875572,0.0008395605,0.00018980591,0.85317755,0.019227158,0.04302046,0.08187754,0.0000870487],"about_ca_topic_score_codex":0.0046252417,"about_ca_topic_score_gemma":0.003198779,"teacher_disagreement_score":0.0046252417,"about_ca_system_score_codex":0.0007481927,"about_ca_system_score_gemma":0.0013697473,"threshold_uncertainty_score":0.009196639},"labels":[],"label_agreement":null},{"id":"W2036935881","doi":"10.1002/wcm.162","title":"Power and cost aware localized routing with guaranteed delivery in unit graph based ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Computer network; Routing table; Static routing; Geographic routing; Equal-cost multi-path routing; Link-state routing protocol; Dynamic Source Routing; Policy-based routing; Multipath routing; Distributed computing; Routing (electronic design automation); Routing protocol","score_opus":0.013449739949515005,"score_gpt":0.24498119680471195,"score_spread":0.23153145685519694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036935881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04923089,0.00064248365,0.94821054,0.00018245292,0.0000318748,0.000046466273,0.000023140872,0.0005909677,0.0010412013],"genre_scores_gemma":[0.7431312,0.00053484726,0.2537695,0.00009580735,0.000048224054,0.00013764181,0.000097889395,0.000104044826,0.0020808193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992125,0.00040868582,0.00002967478,0.00008771468,0.00020005878,0.000061323546],"domain_scores_gemma":[0.998401,0.00089815713,0.00020986267,0.00022779463,0.00019647037,0.00006671995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096118724,0.00073648116,0.00089597964,0.00073606154,0.0005922435,0.00083772035,0.0014982861,0.0006412611,0.0008578365],"category_scores_gemma":[0.0030118634,0.0003488112,0.00034480356,0.00083427824,0.00072794285,0.001590364,0.0010445028,0.0004926383,0.00031340573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003011489,0.00010061045,0.0005009787,0.00017634427,0.00006579481,0.00017348566,0.00017557251,0.8011152,0.009966839,0.03096455,0.002695133,0.15376438],"study_design_scores_gemma":[0.000027680146,0.00015201911,0.00012884826,0.000008897535,0.000018953713,0.00006161083,0.00003019629,0.98022413,0.0024271535,0.015937865,0.0009724442,0.000010238315],"about_ca_topic_score_codex":0.0010163322,"about_ca_topic_score_gemma":0.0011464146,"teacher_disagreement_score":0.0014982861,"about_ca_system_score_codex":0.00074906193,"about_ca_system_score_gemma":0.00046574525,"threshold_uncertainty_score":0.0054348707},"labels":[],"label_agreement":null},{"id":"W2037380211","doi":"10.1007/s11276-008-0149-7","title":"Impact of traffic localization on communication rates in ad-hoc networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Constant (computer programming); Upper and lower bounds; Domain (mathematical analysis); Vehicular ad hoc network; Telecommunications; Wireless; Mathematics","score_opus":0.015403779114658612,"score_gpt":0.25959970086556006,"score_spread":0.24419592175090143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037380211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033269,0.0030815913,0.082607485,0.0013854656,0.00026075833,0.00006408228,0.00029438094,0.00129093,0.0076884143],"genre_scores_gemma":[0.9952844,0.0005536082,0.0030475946,0.00004524241,0.00005783172,0.000019211619,0.00008590685,0.000121799836,0.0007845374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955895,0.0023601023,0.00015662027,0.00034172199,0.00083131663,0.00072082086],"domain_scores_gemma":[0.8524284,0.12873717,0.005496491,0.0051582316,0.0070745084,0.00110518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076519074,0.00086852006,0.001049519,0.0016744885,0.0011793358,0.0017405536,0.0010628343,0.0014459471,0.0021173158],"category_scores_gemma":[0.065912485,0.0008237204,0.00043926243,0.0014886091,0.0012594591,0.0039312057,0.0015666105,0.0012366405,0.00072944246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002739159,0.00050587,0.014935709,0.0002559386,0.0000825547,0.00045058833,0.000321896,0.8394174,0.02475862,0.00946652,0.0026720637,0.104393624],"study_design_scores_gemma":[0.0001463528,0.0013775465,0.008310633,0.00009567445,0.00023697592,0.000843095,0.0005457785,0.9307872,0.049395867,0.0067136674,0.0014131605,0.00013411912],"about_ca_topic_score_codex":0.0020921025,"about_ca_topic_score_gemma":0.001839834,"teacher_disagreement_score":0.0076519074,"about_ca_system_score_codex":0.0015267229,"about_ca_system_score_gemma":0.00080567086,"threshold_uncertainty_score":0.04046768},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.05349021118341814,"score_gpt":0.28166104183623725,"score_spread":0.22817083065281912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037785008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1495735,0.008675968,0.7863113,0.019051911,0.000804313,0.00037427584,0.001434557,0.0009107232,0.032863453],"genre_scores_gemma":[0.8115556,0.0083485395,0.16689996,0.001240572,0.0013054016,0.000723624,0.0013110344,0.0005225873,0.008092748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956215,0.002026392,0.00020504984,0.0005139191,0.0010294083,0.0006036816],"domain_scores_gemma":[0.96044797,0.035737667,0.0012755169,0.0012243432,0.00078750064,0.0005271409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043505332,0.0016015993,0.0022634098,0.0012706709,0.0018491371,0.0039807023,0.0022779081,0.00235288,0.004914305],"category_scores_gemma":[0.029018546,0.0010837942,0.0012489216,0.0028177584,0.0030816172,0.008793145,0.0027998644,0.0037622456,0.00059710484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034281056,0.00010309201,0.0012503057,0.00034681216,0.00009633877,0.00017252103,0.00021657214,0.82149184,0.0010277989,0.13779746,0.0072987573,0.029855693],"study_design_scores_gemma":[0.00004114783,0.000020762494,0.00022654714,0.000024098012,0.000016456297,0.000043580214,0.000057509595,0.8160857,0.00021333505,0.1817888,0.0014695866,0.000012421142],"about_ca_topic_score_codex":0.005820688,"about_ca_topic_score_gemma":0.0041053277,"teacher_disagreement_score":0.005820688,"about_ca_system_score_codex":0.0044646696,"about_ca_system_score_gemma":0.0027059629,"threshold_uncertainty_score":0.032393634},"labels":[],"label_agreement":null},{"id":"W2038027715","doi":"10.1109/mass.2010.5663906","title":"A modular security architecture for managing security associations in MANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed System Security Architecture; Distributed computing; Mobile ad hoc network; Authentication (law); Security association; Modular design; Routing protocol; Network Access Control; Routing (electronic design automation); Computer security; Cloud computing security; Cloud computing","score_opus":0.006354889571993027,"score_gpt":0.23564946058202152,"score_spread":0.22929457101002848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038027715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.099291794,0.00014910266,0.8950792,0.00024941322,0.000041217925,0.00017737293,0.000040301416,0.0028027217,0.0021688985],"genre_scores_gemma":[0.8100055,0.00014491667,0.18739177,0.00007975994,0.000034114255,0.00018581211,0.00008800427,0.00007404634,0.0019960545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952495,0.00011485735,0.000050762737,0.00011590422,0.00011750712,0.00007605912],"domain_scores_gemma":[0.998806,0.00026839832,0.0001963378,0.00041381942,0.0002009984,0.00011446647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011200642,0.00040939415,0.0003234439,0.00046494906,0.00069085805,0.0013152525,0.0009862535,0.0007773238,0.0009962526],"category_scores_gemma":[0.0019132476,0.00042489433,0.00053635763,0.00028270818,0.0012875096,0.0025530327,0.0013419004,0.0010174782,0.0004107487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038064786,0.00030517142,0.0063577504,0.0002087668,0.00013504268,0.0004733435,0.0007499606,0.66831607,0.07282709,0.13133301,0.0018360453,0.117077135],"study_design_scores_gemma":[0.000041644802,0.00031968404,0.0010940295,0.000024201849,0.0000806763,0.00020455524,0.00005334768,0.95375574,0.01448982,0.025032446,0.0048423074,0.000061478044],"about_ca_topic_score_codex":0.0011735617,"about_ca_topic_score_gemma":0.0011573205,"teacher_disagreement_score":0.0013152525,"about_ca_system_score_codex":0.0005438998,"about_ca_system_score_gemma":0.0009961881,"threshold_uncertainty_score":0.0059235096},"labels":[],"label_agreement":null},{"id":"W2038419530","doi":"10.1109/pacrim.2013.6625489","title":"Analyzing non-equilibrium statistical behaviors within the OLSR MANET routing protocol","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Optimized Link State Routing Protocol; Computer science; Routing protocol; Link-state routing protocol; Mobile ad hoc network; Ad hoc wireless distribution service; Computer network; Routing (electronic design automation); Network packet; Distributed computing","score_opus":0.011684062713275342,"score_gpt":0.27007762181230893,"score_spread":0.2583935590990336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038419530","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9244034,0.00009030842,0.07412584,0.000114908435,0.00000807747,0.00003832365,0.000058074525,0.00014890406,0.001012156],"genre_scores_gemma":[0.9955623,0.000043397387,0.004134597,0.000010685392,0.0000044975613,0.000024518353,0.000050853963,0.000011341849,0.0001577184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872977,0.00045020628,0.00005720658,0.00020313472,0.00039705864,0.00016271851],"domain_scores_gemma":[0.98636764,0.009635192,0.0016672412,0.001143392,0.00097164913,0.00021492285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199303,0.000342229,0.0003862344,0.00076684577,0.00037085227,0.00053034746,0.0005937379,0.00047226116,0.00026813493],"category_scores_gemma":[0.014348935,0.00025211196,0.00028237686,0.0005254183,0.0008670334,0.0010188062,0.00056851195,0.00082008686,0.000068579844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019295485,0.00027744402,0.047006566,0.000080503385,0.00012561919,0.00036644272,0.0004018898,0.8942345,0.01680661,0.025076708,0.0004645582,0.014966269],"study_design_scores_gemma":[0.0000031155673,0.000057684276,0.005294659,0.0000024941253,0.000006645719,0.000046339745,0.000056356726,0.9898956,0.0017339224,0.002780414,0.000111895046,0.000010963555],"about_ca_topic_score_codex":0.002824914,"about_ca_topic_score_gemma":0.0019785056,"teacher_disagreement_score":0.002824914,"about_ca_system_score_codex":0.0007113571,"about_ca_system_score_gemma":0.0006885881,"threshold_uncertainty_score":0.011631191},"labels":[],"label_agreement":null},{"id":"W2038934822","doi":"10.1007/s11036-008-0055-3","title":"Advances in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Mesh networking; Wireless network; Wireless; Telecommunications","score_opus":0.007061749207172455,"score_gpt":0.22961966412605905,"score_spread":0.2225579149188866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038934822","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010862534,0.4607222,0.28355992,0.020491783,0.021280559,0.0001405645,0.00043520753,0.0009684034,0.20153883],"genre_scores_gemma":[0.18670252,0.54785234,0.12815292,0.0035738884,0.0228634,0.00021156372,0.00094263686,0.00028941,0.10941134],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99957985,0.00008747746,0.000028136687,0.000074311996,0.00018672932,0.000043561336],"domain_scores_gemma":[0.9989447,0.0005007603,0.000057516514,0.0001652806,0.0002679345,0.00006377557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094038364,0.0005522923,0.0006093784,0.0010879231,0.0004415738,0.0014146395,0.0011510015,0.0012609161,0.012830294],"category_scores_gemma":[0.0029181354,0.00028112184,0.00028244604,0.0017088109,0.00082085025,0.0041336617,0.0013539632,0.001831071,0.0042770994],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091692076,0.00008982106,0.0005180971,0.001035519,0.000030717834,0.00011462154,0.00009336137,0.006164428,0.0043771327,0.27049696,0.052536238,0.66445136],"study_design_scores_gemma":[0.00002148666,0.0000804204,0.0005072354,0.00033594284,0.00003691298,0.00038238033,0.000084316365,0.023557648,0.0022452383,0.14619532,0.8265283,0.000024762878],"about_ca_topic_score_codex":0.00047312677,"about_ca_topic_score_gemma":0.00052670646,"teacher_disagreement_score":0.012830294,"about_ca_system_score_codex":0.0006437273,"about_ca_system_score_gemma":0.0006475365,"threshold_uncertainty_score":0.042921603},"labels":[],"label_agreement":null},{"id":"W2039244387","doi":"10.1007/s10586-013-0247-x","title":"Enabling richer statistical MANET simulations through cluster computing","year":2013,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Mobile ad hoc network; Quality of service; Computer network; Throughput; Ergodicity; Distributed computing; Cluster analysis; Vehicular ad hoc network; Wireless ad hoc network; Wireless; Network packet; Machine learning; Telecommunications","score_opus":0.020639056912619146,"score_gpt":0.2736194149382785,"score_spread":0.2529803580256594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039244387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15092018,0.0002012762,0.8296947,0.00083836063,0.00019695371,0.00011219462,0.0002951066,0.003212026,0.01452917],"genre_scores_gemma":[0.852835,0.0002708048,0.14366549,0.00019728806,0.00008553908,0.00013926349,0.00024584806,0.000539753,0.0020210305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999374,0.00028913896,0.000018584486,0.00006540853,0.00017894006,0.00007393459],"domain_scores_gemma":[0.99775875,0.001329708,0.000085878724,0.00048131603,0.00019983175,0.00014454334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009788101,0.00059991283,0.0011612074,0.00056870736,0.0009491479,0.001629972,0.002019973,0.0010740975,0.0043650484],"category_scores_gemma":[0.0061885393,0.0006842656,0.00055709603,0.00091256935,0.0009771343,0.0026666196,0.0023626462,0.0019405715,0.0006502504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008212828,0.00008275278,0.0008241656,0.000055321463,0.000042394517,0.0000810811,0.000107253174,0.9432801,0.0031413815,0.04506957,0.0010848842,0.0061488696],"study_design_scores_gemma":[0.000007987906,0.0000064909827,0.000044409073,0.0000020380457,0.0000025726854,0.000006334068,0.000009614529,0.9893261,0.00037158767,0.009749317,0.0004693625,0.000004262086],"about_ca_topic_score_codex":0.006228711,"about_ca_topic_score_gemma":0.006053828,"teacher_disagreement_score":0.006228711,"about_ca_system_score_codex":0.00081571104,"about_ca_system_score_gemma":0.0012419707,"threshold_uncertainty_score":0.014602542},"labels":[],"label_agreement":null},{"id":"W2039309022","doi":"10.1109/tnet.2014.2362356","title":"A Hybrid Iterated Local Search Algorithm for the Global Planning Problem of Survivable 4G Wireless Networks","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Iterated local search; Computer science; Mathematical optimization; Integer programming; Heuristic; Algorithm; Local search (optimization); Hybrid algorithm (constraint satisfaction); Wireless network; Iterated function; Wireless; Mathematics; Local consistency; Constraint satisfaction","score_opus":0.022120663308773648,"score_gpt":0.2632879101337656,"score_spread":0.24116724682499197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039309022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009759556,0.00024444342,0.9860372,0.00015066215,0.000026249409,0.00006814139,0.0000458828,0.00043561397,0.0032323094],"genre_scores_gemma":[0.31203386,0.00030524353,0.6829234,0.00027648738,0.0000438446,0.00042857585,0.00029063885,0.00016861618,0.0035293133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995827,0.00015815292,0.000016671993,0.000075369455,0.000105975814,0.000061164006],"domain_scores_gemma":[0.9995709,0.0002832329,0.000046951674,0.000025054364,0.00005069676,0.00002324006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008210462,0.0008293774,0.00081641873,0.0006279492,0.00038446192,0.00066511414,0.0013904587,0.00094352616,0.0030159699],"category_scores_gemma":[0.0012956582,0.0003742895,0.00065670913,0.0006872811,0.00060480996,0.00088752335,0.00087859144,0.00090536935,0.00044767992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005861485,0.000050062503,0.00027021804,0.00006557788,0.00003289795,0.00006934977,0.000062665145,0.9312439,0.0009664458,0.0074418196,0.0016451449,0.05809335],"study_design_scores_gemma":[0.000023249035,0.00002803941,0.00003438686,0.0000054704265,0.000006656972,0.00001654794,0.000012679616,0.99635774,0.0002995135,0.002334574,0.00087709446,0.000004049195],"about_ca_topic_score_codex":0.005199199,"about_ca_topic_score_gemma":0.005654541,"teacher_disagreement_score":0.005199199,"about_ca_system_score_codex":0.0008020068,"about_ca_system_score_gemma":0.0012432762,"threshold_uncertainty_score":0.010337889},"labels":[],"label_agreement":null},{"id":"W2039469367","doi":"10.1016/j.comcom.2007.10.024","title":"A game-theoretic intrusion detection model for mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Overhead (engineering); Node (physics); Network packet; Computer network; Wireless ad hoc network; Resource allocation; Distributed computing; Resource (disambiguation); Service (business); Computer security; Wireless; Operating system","score_opus":0.021884445407752043,"score_gpt":0.2752206278828226,"score_spread":0.25333618247507056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039469367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023374205,0.00042957198,0.9648201,0.0013438157,0.0001264336,0.00023438406,0.0002285124,0.00019565543,0.009247236],"genre_scores_gemma":[0.880258,0.0008376221,0.1050292,0.00043373348,0.00018471462,0.00045258048,0.00020881504,0.000049634164,0.01254572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99662447,0.0016674398,0.00012919224,0.0005104164,0.00068162853,0.00038697824],"domain_scores_gemma":[0.99532396,0.0032477856,0.0003660448,0.00022914758,0.00051179377,0.00032134837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031899225,0.0015335104,0.0021033569,0.0011914695,0.0009354713,0.0035636043,0.0046049994,0.0030497655,0.002932112],"category_scores_gemma":[0.008090634,0.0009182679,0.001219011,0.0014979757,0.0026448686,0.004386266,0.0022831496,0.0025716713,0.0006305228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016376389,0.00015376699,0.0006824797,0.00013086152,0.00010330498,0.00025332966,0.00021717609,0.5961924,0.0015278505,0.3835328,0.0025021466,0.014540086],"study_design_scores_gemma":[0.000036889054,0.000054675842,0.00006017974,0.000008330159,0.000021269008,0.00005824105,0.000019687806,0.92325664,0.00011371181,0.07539206,0.0009625528,0.000015814816],"about_ca_topic_score_codex":0.005340953,"about_ca_topic_score_gemma":0.0037406979,"teacher_disagreement_score":0.005340953,"about_ca_system_score_codex":0.002745442,"about_ca_system_score_gemma":0.0020245267,"threshold_uncertainty_score":0.019919634},"labels":[],"label_agreement":null},{"id":"W2039972671","doi":"10.1109/infcom.2012.6195555","title":"A geometrical probability approach to location-critical network performance metrics","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Node (physics); Probabilistic logic; Network topology; Monte Carlo method; Topology (electrical circuits); Overhead (engineering); Probability distribution; Routing (electronic design automation); k-nearest neighbors algorithm; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.03454621646219086,"score_gpt":0.2593281444791131,"score_spread":0.22478192801692226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039972671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016283597,0.00060336216,0.99268806,0.00033433523,0.00007586765,0.00003229878,0.000074370655,0.00009116107,0.004472328],"genre_scores_gemma":[0.56829154,0.008549684,0.40504152,0.00072179147,0.0015028528,0.0008564998,0.00057677546,0.0004704681,0.0139888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732095,0.0009523996,0.00015125316,0.00044843284,0.00097539765,0.00015166278],"domain_scores_gemma":[0.9932944,0.0041247164,0.0007232867,0.0007298109,0.0009932303,0.00013458713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002470587,0.0019787853,0.0011378516,0.0038907714,0.0008236431,0.0026378226,0.0026428453,0.001513829,0.003811172],"category_scores_gemma":[0.01421353,0.0007990896,0.0010376761,0.0031311128,0.0032534003,0.0066702804,0.0021597915,0.0025752382,0.0013509002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019773383,0.000022985501,0.00045358232,0.00010890991,0.000026489803,0.00013486184,0.00009889294,0.39030105,0.0012422011,0.59081423,0.0017466216,0.015030399],"study_design_scores_gemma":[0.0000067863584,0.000071524155,0.00035479513,0.00003894706,0.000017781185,0.00027603924,0.000049701255,0.6715608,0.00067189353,0.32042524,0.0064826063,0.000043796663],"about_ca_topic_score_codex":0.0018092514,"about_ca_topic_score_gemma":0.0009991123,"teacher_disagreement_score":0.0038907714,"about_ca_system_score_codex":0.0025496995,"about_ca_system_score_gemma":0.0009800624,"threshold_uncertainty_score":0.018499374},"labels":[],"label_agreement":null},{"id":"W204015482","doi":"10.22215/etd/2006-06164","title":"Securing routing protocols through information corroboration","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Political science","score_opus":0.012012066341117261,"score_gpt":0.27519887145360633,"score_spread":0.26318680511248904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204015482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08111441,0.002731924,0.8725062,0.0060151205,0.00055668503,0.00060557976,0.000430097,0.005261526,0.030778408],"genre_scores_gemma":[0.82148004,0.0024788135,0.16011012,0.00046197735,0.00050386094,0.00040980402,0.0006460934,0.00028689572,0.013622361],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9892096,0.0038135056,0.0012165853,0.0008679987,0.004289509,0.0006027521],"domain_scores_gemma":[0.9071828,0.054581862,0.00898849,0.020779252,0.007752004,0.0007156432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011162573,0.00065778784,0.0010389145,0.0029409595,0.0015073294,0.004563176,0.0017853768,0.0018127537,0.003159986],"category_scores_gemma":[0.05891261,0.00090656616,0.00069050957,0.0016862714,0.003028395,0.009683431,0.006380604,0.0027735308,0.0014374008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017056863,0.0004914925,0.010355411,0.0007447321,0.00023268374,0.0009213648,0.0025590297,0.065725744,0.026520915,0.20039527,0.010854826,0.67949283],"study_design_scores_gemma":[0.00027014888,0.00069259753,0.0029893962,0.0006250567,0.00034063339,0.0012422653,0.00090182066,0.6428875,0.103661,0.17467451,0.071457565,0.00025747862],"about_ca_topic_score_codex":0.0009623244,"about_ca_topic_score_gemma":0.00078385696,"teacher_disagreement_score":0.011162573,"about_ca_system_score_codex":0.0013743497,"about_ca_system_score_gemma":0.002729597,"threshold_uncertainty_score":0.05903405},"labels":[],"label_agreement":null},{"id":"W2040187817","doi":"10.1145/1582379.1582423","title":"Performance analysis of BitTorrent enabled ad hoc network routing","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Unicast; Dynamic Source Routing; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Routing protocol; Wireless ad hoc network; Zone Routing Protocol; Throughput; Network packet; Multicast; Destination-Sequenced Distance Vector routing; Wireless; Telecommunications","score_opus":0.010017577761745042,"score_gpt":0.22505721129263367,"score_spread":0.21503963353088862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040187817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84425056,0.0031188808,0.13663203,0.00040582224,0.00011252845,0.00009701114,0.00019621248,0.00081661384,0.014370329],"genre_scores_gemma":[0.9950594,0.00047191215,0.0038012604,0.00001610069,0.000011840891,0.000012727746,0.000068274916,0.0000144831,0.00054406025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986436,0.000490712,0.00004615089,0.00010194339,0.00052982825,0.00018767542],"domain_scores_gemma":[0.99763787,0.00123293,0.00021025173,0.00019836723,0.0006672286,0.00005338187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014019455,0.0006058851,0.0005500058,0.0009393414,0.0003531609,0.0007258319,0.0005366768,0.0005103567,0.00054394285],"category_scores_gemma":[0.00437871,0.00014883139,0.00026537423,0.00072997273,0.00037795253,0.0009863991,0.0003192995,0.00031740408,0.00015213627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041690466,0.000091295246,0.005485366,0.0001690211,0.00008484217,0.00027480343,0.000088786815,0.9241496,0.019392468,0.009478233,0.0009736256,0.03939514],"study_design_scores_gemma":[0.0000030124677,0.00020161954,0.0012457417,0.0000069815032,0.000019338675,0.00017474395,0.000028773651,0.9916556,0.005354319,0.0007871487,0.00051135186,0.0000114394],"about_ca_topic_score_codex":0.0021120603,"about_ca_topic_score_gemma":0.0014695107,"teacher_disagreement_score":0.0021120603,"about_ca_system_score_codex":0.0011360543,"about_ca_system_score_gemma":0.00046551204,"threshold_uncertainty_score":0.008242667},"labels":[],"label_agreement":null},{"id":"W204058386","doi":"10.1007/0-387-32015-6_14","title":"A Fuzzy Petri Nets QoS Model for Wireless AD Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Quality of service; Mobile ad hoc network; Petri net; Node (physics); Fuzzy logic; Distributed computing; Stochastic Petri net; Optimized Link State Routing Protocol; Wireless; Network packet; Routing protocol; Engineering; Artificial intelligence","score_opus":0.019708325500018123,"score_gpt":0.2248300148688375,"score_spread":0.20512168936881936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W204058386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030082976,0.001119952,0.9796169,0.00035384615,0.00030091414,0.000067193556,0.00020369317,0.0005541727,0.014775136],"genre_scores_gemma":[0.22126916,0.004265804,0.70835674,0.0005221149,0.000438107,0.0003942457,0.00088620145,0.00031824122,0.063549295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997162,0.0000484929,0.00002177881,0.000050213683,0.00013933434,0.000023880732],"domain_scores_gemma":[0.99978536,0.00009229912,0.000014992837,0.000023682342,0.00006588374,0.000017781525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042802544,0.00075765816,0.00046607925,0.0004975299,0.00046034824,0.0011726336,0.0012525539,0.0009687864,0.0038866578],"category_scores_gemma":[0.0007858445,0.00034484826,0.00076210685,0.0006303516,0.00050917856,0.0015141302,0.00048609087,0.0015793977,0.001044689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010680902,0.000092670016,0.0002611241,0.0003269765,0.000042536492,0.00033780883,0.00026127257,0.29660174,0.010506825,0.5320116,0.009884746,0.14956588],"study_design_scores_gemma":[0.00002222847,0.000055762746,0.00013053599,0.00010194551,0.00003718197,0.00018182301,0.000048756156,0.74491614,0.002933295,0.19883503,0.052709777,0.000027458393],"about_ca_topic_score_codex":0.0060294513,"about_ca_topic_score_gemma":0.0052353786,"teacher_disagreement_score":0.0060294513,"about_ca_system_score_codex":0.0011618553,"about_ca_system_score_gemma":0.0010831966,"threshold_uncertainty_score":0.013002217},"labels":[],"label_agreement":null},{"id":"W2041360203","doi":"10.1109/ahici.2011.6113952","title":"Provisioning secure on-demand routing protocol in mobile ad hoc network","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Routing protocol; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Zone Routing Protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.01922040274574787,"score_gpt":0.2587279443318545,"score_spread":0.2395075415861066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041360203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085274965,0.0022675963,0.89654917,0.0012247888,0.00046815473,0.00054718327,0.000105698746,0.0017601209,0.011802331],"genre_scores_gemma":[0.8277267,0.0019390547,0.16388796,0.00029525874,0.00016221809,0.00035441844,0.0003261122,0.000102308884,0.005205941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982008,0.00059539295,0.00013447714,0.00014106126,0.0007840591,0.00014422575],"domain_scores_gemma":[0.99858344,0.00033447662,0.0002199037,0.00044703402,0.0003427944,0.000072410876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012526625,0.00042737022,0.00059057784,0.0006764061,0.001050647,0.0012257829,0.0010137637,0.0009548577,0.000956642],"category_scores_gemma":[0.002665382,0.0003121762,0.0004397815,0.0006578505,0.0007746794,0.002694346,0.0017805768,0.0010638138,0.00051520724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007720795,0.00045488434,0.0034565344,0.0012791507,0.00021282055,0.0031646772,0.0013737787,0.13192521,0.1737954,0.3743821,0.014862833,0.29432052],"study_design_scores_gemma":[0.00016921425,0.00059960235,0.00091633043,0.00012767957,0.00014949223,0.0034400364,0.0004479806,0.7531703,0.065344736,0.10782478,0.067638524,0.00017133843],"about_ca_topic_score_codex":0.00047585202,"about_ca_topic_score_gemma":0.00048225222,"teacher_disagreement_score":0.0012526625,"about_ca_system_score_codex":0.00063586055,"about_ca_system_score_gemma":0.0009976693,"threshold_uncertainty_score":0.006624818},"labels":[],"label_agreement":null},{"id":"W2041411748","doi":"10.1109/tvt.2012.2204077","title":"Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Network topology; Computer science; Algorithm; Node (physics); Wireless network; Broadcasting (networking); Wireless; Topology (electrical circuits); Theoretical computer science; Mathematics; Computer network; Combinatorics; Engineering; Telecommunications","score_opus":0.01950273459485332,"score_gpt":0.22725985023435613,"score_spread":0.2077571156395028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041411748","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03755414,0.0005941288,0.9553959,0.00037708713,0.000035901423,0.000063500964,0.00006638756,0.00032800424,0.0055849096],"genre_scores_gemma":[0.6300629,0.0010803627,0.3588968,0.00016790477,0.00008745903,0.0002135086,0.00025985367,0.00011685177,0.009114397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993887,0.0002375453,0.000020778403,0.00010608467,0.00015787497,0.00008903465],"domain_scores_gemma":[0.9987311,0.0009811554,0.000095800926,0.00007596104,0.00008218361,0.00003376168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061331637,0.00053897005,0.0007238653,0.0004818993,0.0005038694,0.00095355813,0.0011875582,0.00088603655,0.0025962465],"category_scores_gemma":[0.0029820194,0.00043899656,0.0004025232,0.0009153412,0.0007067689,0.001723562,0.0008884032,0.0006505877,0.00054160546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013727738,0.00007408258,0.0004783311,0.00028231792,0.00003251113,0.00010237767,0.00022674025,0.8892599,0.0062707947,0.03919373,0.0019596112,0.061982345],"study_design_scores_gemma":[0.000017140641,0.00003580739,0.00009826793,0.0000062782674,0.0000074297477,0.000045709858,0.00004650635,0.98776543,0.0009824979,0.010150367,0.0008379602,0.000006686961],"about_ca_topic_score_codex":0.0023144367,"about_ca_topic_score_gemma":0.0027874638,"teacher_disagreement_score":0.0025962465,"about_ca_system_score_codex":0.0009282769,"about_ca_system_score_gemma":0.0006385777,"threshold_uncertainty_score":0.00868535},"labels":[],"label_agreement":null},{"id":"W2041633416","doi":"10.1109/wd.2013.6686442","title":"QoS and security in Link State Routing protocols for MANETs","year":2013,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Link-state routing protocol; Routing protocol; Routing Information Protocol; Optimized Link State Routing Protocol; Quality of service; Routing (electronic design automation); Dynamic Source Routing; Node (physics); Static routing; Construct (python library); Distributed computing; Engineering","score_opus":0.025005395527006355,"score_gpt":0.2933583280909951,"score_spread":0.26835293256398873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041633416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054400112,0.030006267,0.8782975,0.010645779,0.001655049,0.00024696437,0.00015530104,0.00054931233,0.024043761],"genre_scores_gemma":[0.75701326,0.027699899,0.20232542,0.0012156258,0.002746733,0.0005429426,0.00020034504,0.0002778432,0.007977829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963212,0.0015077852,0.00026200042,0.00035973717,0.0012970394,0.0002521946],"domain_scores_gemma":[0.98798984,0.00914979,0.0009770573,0.0009249393,0.0006967693,0.00026159512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004418886,0.0013915913,0.0010249555,0.0019582263,0.0019251077,0.0043805707,0.0012429411,0.0021471004,0.0021575945],"category_scores_gemma":[0.0200693,0.0008976998,0.0007344938,0.0024921137,0.004891645,0.008635969,0.0018910643,0.0036341029,0.00048763977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015354033,0.00010513105,0.0011687045,0.00048583926,0.00005565966,0.0003684892,0.0005590616,0.13097714,0.0038357107,0.7970675,0.003770671,0.06145262],"study_design_scores_gemma":[0.000031635664,0.00015317403,0.00032498268,0.00016862083,0.00004650186,0.000383509,0.00018744236,0.32152128,0.0024564916,0.65895176,0.015724335,0.000050310377],"about_ca_topic_score_codex":0.0011016164,"about_ca_topic_score_gemma":0.00062572164,"teacher_disagreement_score":0.004418886,"about_ca_system_score_codex":0.0023556354,"about_ca_system_score_gemma":0.0010866651,"threshold_uncertainty_score":0.02336955},"labels":[],"label_agreement":null},{"id":"W2042685720","doi":"10.1007/s00453-010-9422-0","title":"Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Computer science; Node (physics); Broadcasting (networking); Computer network; Schedule; Theory of computation; Set (abstract data type); Binary logarithm; Radio networks; Discrete mathematics; Mathematics; Algorithm; Telecommunications; Wireless network; Wireless","score_opus":0.011458445599158578,"score_gpt":0.209008588747466,"score_spread":0.19755014314830743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042685720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019432671,0.0007506126,0.97381884,0.00075459527,0.00015772997,0.000052496915,0.00007009284,0.0003876726,0.0045751873],"genre_scores_gemma":[0.7767713,0.0011505685,0.21045789,0.00035798835,0.00044818842,0.00020224028,0.00019153146,0.0004147956,0.010005511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991327,0.00030662192,0.000035904235,0.00014781044,0.00022337383,0.0001537403],"domain_scores_gemma":[0.99680835,0.00216856,0.00027204,0.00040805025,0.00021466205,0.00012841474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015538698,0.0008178537,0.0013056694,0.00077699975,0.0009345654,0.0015372487,0.0023768614,0.001431753,0.0032291505],"category_scores_gemma":[0.008549838,0.00066674204,0.0006365336,0.0009441431,0.0016597188,0.002176774,0.0020880685,0.0014833742,0.0006928094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082726,0.00015137909,0.000759563,0.0004001979,0.000100073805,0.00021444164,0.000379944,0.66693103,0.010008377,0.17436686,0.014577867,0.13128287],"study_design_scores_gemma":[0.00004926685,0.00007237153,0.000111495145,0.000015226453,0.000023194088,0.00008048443,0.00005517073,0.9010367,0.0010112709,0.09585888,0.0016690708,0.000016840313],"about_ca_topic_score_codex":0.0009465799,"about_ca_topic_score_gemma":0.001684111,"teacher_disagreement_score":0.0032291505,"about_ca_system_score_codex":0.0006051594,"about_ca_system_score_gemma":0.0009791291,"threshold_uncertainty_score":0.010802567},"labels":[],"label_agreement":null},{"id":"W2042964081","doi":"10.5539/mas.v4n4p91","title":"Simulation And Realization Of Wireless Emergency Communication System Of Digital Mine","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless; Key (lock); Emergency rescue; Jitter; Base station; Channel (broadcasting); Communications system; Realization (probability); Computer network; Telecommunications; Computer security; Emergency management; Medical emergency","score_opus":0.012809113469224882,"score_gpt":0.24848710418856348,"score_spread":0.2356779907193386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042964081","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7588066,0.00046908366,0.19338576,0.00057009293,0.00020308359,0.00020938294,0.0007369728,0.0014599975,0.044159077],"genre_scores_gemma":[0.99070096,0.00012606493,0.0057193865,0.000017774028,0.000006531894,0.0000788473,0.00014667604,0.000019150522,0.003184569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99985766,0.000043602042,0.00000809451,0.000015395657,0.00003801587,0.00003715798],"domain_scores_gemma":[0.99978,0.00008456134,0.000018152487,0.000018280974,0.000072380826,0.000026710713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020683819,0.0004081357,0.00034644213,0.00026651166,0.0004865301,0.00042791833,0.0005865825,0.00068174786,0.0038845504],"category_scores_gemma":[0.00048243825,0.00020454904,0.0004018055,0.00017079411,0.00034742465,0.0005585697,0.00042953616,0.000465198,0.00020957272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011390166,0.000052123665,0.002326495,0.00009339845,0.000020814927,0.00032231488,0.00015475445,0.98454463,0.003871624,0.0033509915,0.0007343969,0.004414512],"study_design_scores_gemma":[0.00002806948,0.00005266246,0.00047316056,0.000006182604,0.000010443732,0.00003097854,0.00004336554,0.9964232,0.0016027092,0.00056387443,0.0007602791,0.0000050438475],"about_ca_topic_score_codex":0.008047046,"about_ca_topic_score_gemma":0.003694536,"teacher_disagreement_score":0.008047046,"about_ca_system_score_codex":0.00034436502,"about_ca_system_score_gemma":0.00045362377,"threshold_uncertainty_score":0.01600039},"labels":[],"label_agreement":null},{"id":"W2043561532","doi":"10.1016/j.jnca.2012.12.013","title":"A multipath routing strategy to prevent flooding disruption attacks in link state routing protocols for MANETs","year":2013,"lang":"en","type":"article","venue":"Journal of Network and Computer Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Flooding (psychology); Link-state routing protocol; Multipath routing; Distributed computing; Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Dynamic Source Routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.02341678997847839,"score_gpt":0.3029996305728351,"score_spread":0.2795828405943567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043561532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08419483,0.0016302069,0.90591776,0.0007061503,0.00046660268,0.00026893054,0.00014385443,0.002718944,0.003952823],"genre_scores_gemma":[0.8097554,0.0010476818,0.18398248,0.00016589322,0.00018190984,0.0001721498,0.00022094778,0.00015897446,0.0043146703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953246,0.000106795305,0.00004692216,0.00006902908,0.00016695507,0.000077892066],"domain_scores_gemma":[0.9986333,0.00045320956,0.00017587705,0.00026244568,0.00039317855,0.00008199207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010752918,0.0007540718,0.00085987255,0.0013750121,0.0012454707,0.00092253345,0.0011876164,0.00076875504,0.0012518085],"category_scores_gemma":[0.0030794863,0.00037470774,0.00051679515,0.00089244,0.00053635717,0.001606566,0.0011694117,0.000756757,0.0003577892],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000861822,0.0002882011,0.002408218,0.00029547513,0.00027294946,0.0004762155,0.0002978343,0.3930389,0.05918026,0.044371475,0.010630174,0.48787847],"study_design_scores_gemma":[0.00008269598,0.0007331567,0.000834301,0.00003160656,0.00023300979,0.0005259688,0.00015075323,0.9531285,0.018784529,0.01681859,0.00860218,0.000074776515],"about_ca_topic_score_codex":0.0016290109,"about_ca_topic_score_gemma":0.0024378528,"teacher_disagreement_score":0.0016290109,"about_ca_system_score_codex":0.00068918907,"about_ca_system_score_gemma":0.0010267484,"threshold_uncertainty_score":0.00568676},"labels":[],"label_agreement":null},{"id":"W2043743108","doi":"10.1007/s11042-013-1752-x","title":"Adaptive multi-channel allocation for vehicular infrastructure mesh systems","year":2013,"lang":"en","type":"article","venue":"Multimedia Tools and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Router; Network packet; Latency (audio); Wireless; Channel (broadcasting); Throughput; Wireless network; Mesh networking; Distributed computing; Telecommunications","score_opus":0.020467305900219744,"score_gpt":0.23723488919273705,"score_spread":0.2167675832925173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043743108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09962148,0.0010542495,0.8904721,0.00038286357,0.00017955565,0.000072114744,0.00011467432,0.0003392844,0.007763687],"genre_scores_gemma":[0.9755888,0.00019914575,0.022078194,0.00004088737,0.000061977895,0.000038035007,0.00004115747,0.000017418031,0.0019344336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994667,0.00015614358,0.000017241282,0.00006487411,0.000101218764,0.00019371709],"domain_scores_gemma":[0.99903214,0.00059010263,0.00007121548,0.000084968866,0.00017496441,0.00004662121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023085,0.00041290026,0.0005618548,0.00054655614,0.00056962523,0.0007233243,0.00088854885,0.0004794631,0.0018629584],"category_scores_gemma":[0.0021093907,0.00024660758,0.0002047508,0.00068838923,0.00044017073,0.00062009745,0.0008858568,0.00049097434,0.00026635823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026145115,0.00006463327,0.00078127504,0.0000644523,0.000041421623,0.00009503402,0.000081530845,0.88296056,0.009045256,0.013107281,0.0020827304,0.09141441],"study_design_scores_gemma":[0.000009128535,0.000033191824,0.00017244056,0.0000029166508,0.000009697325,0.000030288931,0.000024315128,0.9948376,0.0007374157,0.0036005378,0.0005358159,0.000006531359],"about_ca_topic_score_codex":0.003064148,"about_ca_topic_score_gemma":0.0050710533,"teacher_disagreement_score":0.003064148,"about_ca_system_score_codex":0.0008311322,"about_ca_system_score_gemma":0.0006813149,"threshold_uncertainty_score":0.0062322617},"labels":[],"label_agreement":null},{"id":"W2043762646","doi":"10.1016/j.adhoc.2008.07.003","title":"Game theoretic approach in routing protocol for wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Routing protocol; Wireless ad hoc network; Flooding (psychology); Wireless Routing Protocol; Ad hoc wireless distribution service; Network packet; Dynamic Source Routing; Distributed computing; Wireless; Telecommunications","score_opus":0.022313076669368586,"score_gpt":0.26061552696124407,"score_spread":0.2383024502918755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043762646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035878315,0.0018122996,0.97368795,0.0012251482,0.00044854396,0.00012932673,0.00007662004,0.00008246976,0.018949859],"genre_scores_gemma":[0.47092617,0.007837112,0.49086168,0.0011956261,0.0010761677,0.0008042333,0.00022946083,0.00012770579,0.02694189],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791676,0.0010668233,0.000083284554,0.00018379542,0.00060044654,0.00014891873],"domain_scores_gemma":[0.99883264,0.0007852714,0.00006029555,0.00008156463,0.00017162653,0.00006870514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015969428,0.0012339549,0.0013155438,0.0011965215,0.0010771474,0.0029353956,0.0026439817,0.0020645228,0.0029318335],"category_scores_gemma":[0.0035176186,0.00048067528,0.0008816398,0.0017446363,0.002454237,0.0040769046,0.0014658894,0.0035737352,0.0006824287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023258159,0.000043700893,0.00008028661,0.00013547599,0.00003247742,0.00008743117,0.0001430284,0.06251238,0.0008905091,0.92039776,0.0025857093,0.0130679775],"study_design_scores_gemma":[0.000019616475,0.00005080204,0.000054613247,0.000039803854,0.000029016994,0.00009855118,0.00006886519,0.2828729,0.00034762328,0.70680064,0.009597218,0.00002042543],"about_ca_topic_score_codex":0.0022396734,"about_ca_topic_score_gemma":0.0016809761,"teacher_disagreement_score":0.0029353956,"about_ca_system_score_codex":0.001801431,"about_ca_system_score_gemma":0.001533044,"threshold_uncertainty_score":0.013070345},"labels":[],"label_agreement":null},{"id":"W2044751445","doi":"10.1007/s11036-010-0249-3","title":"On Delay Performance and Burst Assembly for Wireless Mesh and Optical Burst Switching Converged Metro Area Network","year":2010,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computer network; Optical burst switching; Wireless mesh network; Quality of service; Last mile (transportation); Wireless network; Wireless; Telecommunications; Wavelength-division multiplexing","score_opus":0.007583309949982144,"score_gpt":0.22970215511946626,"score_spread":0.22211884516948413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044751445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7211734,0.0028705846,0.26577902,0.00064933766,0.00020382473,0.00010810606,0.0001883491,0.0005321312,0.008495222],"genre_scores_gemma":[0.9814565,0.0004471021,0.015380676,0.00004386331,0.00008725042,0.000022344382,0.00011775915,0.00010970499,0.0023347586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873966,0.00039330107,0.00004677347,0.000113501024,0.00043173245,0.00027503175],"domain_scores_gemma":[0.98761564,0.009290304,0.0005219446,0.000607025,0.0017242243,0.0002409357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030652755,0.00088679255,0.0007174172,0.0013285949,0.00096373225,0.0012593037,0.0011511473,0.0005052456,0.0020439199],"category_scores_gemma":[0.010779374,0.00040618223,0.00028689622,0.0011468825,0.00093432766,0.0019574594,0.0010682717,0.0009031791,0.00027354635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039342246,0.00040876502,0.007969342,0.0001872608,0.0000846863,0.00023320616,0.0005976571,0.80927086,0.060677566,0.033803474,0.0025179684,0.080315],"study_design_scores_gemma":[0.000013575847,0.00021300273,0.0006213944,0.0000062378454,0.000024064693,0.00003288953,0.00008829606,0.9860985,0.009922245,0.0026014247,0.00036738906,0.000010954653],"about_ca_topic_score_codex":0.0049373643,"about_ca_topic_score_gemma":0.0045331996,"teacher_disagreement_score":0.0049373643,"about_ca_system_score_codex":0.0023525367,"about_ca_system_score_gemma":0.00096891297,"threshold_uncertainty_score":0.017068923},"labels":[],"label_agreement":null},{"id":"W2044972695","doi":"10.1109/icet.2010.5638463","title":"Congestion aware nodes (CAN) based scheme for mobile ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer network; Retransmission; Computer science; Network congestion; Mobile ad hoc network; Wireless ad hoc network; Packet loss; DSRFLOW; Queuing delay; Throughput; Overhead (engineering); Network packet; Queueing theory; Vehicular ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Wireless; Telecommunications","score_opus":0.01070112371316765,"score_gpt":0.24330700252541138,"score_spread":0.23260587881224373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044972695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10157093,0.008044469,0.8567983,0.0014769475,0.002873606,0.0029054934,0.00036701985,0.004612322,0.021351],"genre_scores_gemma":[0.83060235,0.0015697638,0.15892212,0.00051559124,0.00033705172,0.0007848007,0.00029527803,0.000074080584,0.0068989587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903286,0.00026938433,0.00007887353,0.00016954781,0.00031761668,0.00013181535],"domain_scores_gemma":[0.9985631,0.00034632089,0.00018801876,0.00024596564,0.00051795697,0.00013873499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013068464,0.0008226768,0.000636911,0.0011387141,0.001724176,0.000748229,0.002167694,0.0008662406,0.0012158493],"category_scores_gemma":[0.0028382002,0.00024572393,0.0003833422,0.00082777743,0.0007680664,0.0015129707,0.0017469781,0.00090598804,0.0003418936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013787772,0.00044577438,0.0044817426,0.0018079526,0.0005060041,0.0014368382,0.0017025359,0.0989994,0.13931574,0.10260777,0.029834436,0.6174831],"study_design_scores_gemma":[0.00069554715,0.0033435815,0.0049805967,0.00023454278,0.0010919321,0.0034658401,0.0006131741,0.70326287,0.0698451,0.045649003,0.16626607,0.00055175804],"about_ca_topic_score_codex":0.0023992152,"about_ca_topic_score_gemma":0.0045575607,"teacher_disagreement_score":0.0023992152,"about_ca_system_score_codex":0.0010421849,"about_ca_system_score_gemma":0.0010756749,"threshold_uncertainty_score":0.007561624},"labels":[],"label_agreement":null},{"id":"W2045008360","doi":"10.1007/s00446-007-0021-5","title":"Activating anonymous ad hoc radio networks","year":2007,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Node (physics); Asynchronous communication; Mobile ad hoc network; Distributed computing; Network topology; Task (project management); Dissemination; Theoretical computer science; Network packet; Wireless; Engineering; Telecommunications","score_opus":0.00994954787033086,"score_gpt":0.2380018821562034,"score_spread":0.22805233428587254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045008360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17139949,0.0006843101,0.7465377,0.0012063395,0.0012078832,0.00037452643,0.00015479464,0.004987185,0.073447846],"genre_scores_gemma":[0.9065124,0.00043452374,0.066186845,0.00027584605,0.0002324288,0.00013744342,0.00013770163,0.00018460178,0.025898255],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878603,0.0004001889,0.000042887325,0.0001291995,0.0004411315,0.00020053852],"domain_scores_gemma":[0.995884,0.001997779,0.00025131128,0.0008823803,0.00073860085,0.0002459468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013352139,0.0005109254,0.0005086632,0.0007308898,0.0010262869,0.0017764922,0.001189315,0.00084655883,0.006972992],"category_scores_gemma":[0.0054138745,0.00029333675,0.0003288544,0.0006032012,0.0005754571,0.0018993855,0.0022494413,0.00076395774,0.0017049555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001918912,0.0008531328,0.0070770574,0.00085417327,0.00014890781,0.0021219172,0.0016637759,0.09667126,0.19974318,0.2509351,0.021774314,0.41623828],"study_design_scores_gemma":[0.0001490576,0.0005563943,0.0011828741,0.000060724964,0.00020269645,0.000975698,0.0009504419,0.6434188,0.1407546,0.12775783,0.08391872,0.000072116534],"about_ca_topic_score_codex":0.00026493333,"about_ca_topic_score_gemma":0.0006666296,"teacher_disagreement_score":0.006972992,"about_ca_system_score_codex":0.00036154044,"about_ca_system_score_gemma":0.00055002543,"threshold_uncertainty_score":0.023326993},"labels":[],"label_agreement":null},{"id":"W2045233808","doi":"10.1109/iwcmc.2014.6906439","title":"Opportunistic vehicle-to-vehicle relay with adaptive modulation for drive-thru internet access","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Relay; Computer network; The Internet; Computer science; Link adaptation; Network packet; Transmission (telecommunications); Internet access; Modulation (music); Wireless; Transmission delay; Exploit; Internet Protocol; Telecommunications; Computer security; Channel (broadcasting)","score_opus":0.030859356524366038,"score_gpt":0.263871444196775,"score_spread":0.23301208767240897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045233808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21770042,0.001362448,0.77440333,0.00023290026,0.000047637302,0.000103639235,0.00003690754,0.0002320414,0.0058805407],"genre_scores_gemma":[0.9879341,0.00025774218,0.011393927,0.000016195332,0.000008764941,0.00002128284,0.000007039102,0.000004725712,0.0003562059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965894,0.0001588608,0.000012695086,0.000042024618,0.00008237371,0.000045067605],"domain_scores_gemma":[0.9992391,0.00049982796,0.00009503964,0.0000580361,0.000087945606,0.000020079668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004782494,0.00040667425,0.00039281973,0.00050821534,0.00035773905,0.00045794912,0.0007325075,0.0004302875,0.0004615709],"category_scores_gemma":[0.0020317624,0.00013564619,0.0002889192,0.00052012946,0.00044799113,0.00077861745,0.000498073,0.00028908727,0.000086845954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027913268,0.00012501648,0.003440625,0.00019148062,0.0001048546,0.0013175918,0.00034515656,0.8159726,0.042236287,0.058676697,0.0011359667,0.07617449],"study_design_scores_gemma":[0.000012415678,0.00016653934,0.00027486144,0.000005256853,0.000021112328,0.00030871987,0.0000403412,0.9925608,0.0018613095,0.004044346,0.0006913602,0.000012993811],"about_ca_topic_score_codex":0.0019893423,"about_ca_topic_score_gemma":0.0022299646,"teacher_disagreement_score":0.0019893423,"about_ca_system_score_codex":0.00052084384,"about_ca_system_score_gemma":0.00042490324,"threshold_uncertainty_score":0.003955543},"labels":[],"label_agreement":null},{"id":"W2045303065","doi":"10.1109/wcnc.2010.5506193","title":"Secure and Efficient Multi-Hop Mobile IP Registration Scheme for MANET-Internet Integrated Architecture","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Mobile IP; Reachability; The Internet; Scheme (mathematics); Mobile computing; Architecture; Distributed computing; Network packet; World Wide Web","score_opus":0.009165524313877035,"score_gpt":0.2410648884530036,"score_spread":0.23189936413912657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045303065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13769536,0.00077265187,0.8541242,0.00030927718,0.00018369617,0.00057010446,0.000061197235,0.0009095402,0.00537406],"genre_scores_gemma":[0.8278485,0.0003413943,0.16714224,0.000077607045,0.000085107706,0.00019582438,0.00021079433,0.000032442884,0.0040660957],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985775,0.0003991518,0.00013719861,0.00016542857,0.0005915316,0.00012916698],"domain_scores_gemma":[0.9985776,0.00019653622,0.00029091942,0.00057245424,0.00026267368,0.00009974457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012422156,0.00041624502,0.00073952257,0.0009056458,0.001071642,0.0008254341,0.0012902607,0.00082734245,0.0013522138],"category_scores_gemma":[0.001690668,0.00029022805,0.0006167617,0.00066334166,0.0007924768,0.0017655309,0.0017968563,0.0011681948,0.0007226414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023216777,0.0009284757,0.0034327733,0.000561951,0.00040598676,0.0016913275,0.00096729054,0.056121923,0.38177124,0.199664,0.006565793,0.3455676],"study_design_scores_gemma":[0.0005504387,0.0036776422,0.003208325,0.00010947235,0.0004897244,0.0046822056,0.00026438182,0.74487114,0.17672504,0.028219156,0.036899876,0.0003026645],"about_ca_topic_score_codex":0.000245914,"about_ca_topic_score_gemma":0.00032381166,"teacher_disagreement_score":0.0013522138,"about_ca_system_score_codex":0.0006354098,"about_ca_system_score_gemma":0.0009145439,"threshold_uncertainty_score":0.0065695643},"labels":[],"label_agreement":null},{"id":"W2045503145","doi":"10.1002/wcm.930","title":"Cross‐layer optimization for CDMA/TDD wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Cross-layer optimization; Hazy Sighted Link State Routing Protocol; Scheduling (production processes); Signal-to-interference-plus-noise ratio; Network packet; Wireless network; Wireless; Routing protocol; Dynamic Source Routing; Telecommunications; Mathematical optimization","score_opus":0.018797647057688147,"score_gpt":0.2881143279822159,"score_spread":0.26931668092452776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045503145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014479426,0.00050358707,0.9820639,0.00022799545,0.000050964736,0.000030514238,0.00002921608,0.00011042797,0.0025039364],"genre_scores_gemma":[0.5907532,0.00069274777,0.40075466,0.00029192265,0.0000856326,0.00029134788,0.00017607489,0.00015665696,0.006797763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995295,0.0002269147,0.00001701748,0.00006372923,0.00011294202,0.000049922182],"domain_scores_gemma":[0.99923897,0.0004976229,0.00008039698,0.000030309444,0.00012918453,0.000023420162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018870215,0.00085905736,0.00059478544,0.0004692752,0.0003177677,0.00079076557,0.00070000865,0.00071029086,0.002092407],"category_scores_gemma":[0.0020820284,0.00047780332,0.00042299126,0.0005104255,0.00053263985,0.00071232754,0.0010726287,0.00073268876,0.00030775688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023273546,0.000015269541,0.00016881504,0.000023002094,0.000020705647,0.0000133667345,0.000011291539,0.9837482,0.00067220593,0.0043116147,0.00042859116,0.010563582],"study_design_scores_gemma":[0.0000031650352,0.000006058532,0.000021541766,0.0000011647278,0.000001982316,0.0000023816754,0.0000015128862,0.99908674,0.000108555985,0.0006261084,0.00013974456,0.0000010266333],"about_ca_topic_score_codex":0.003107073,"about_ca_topic_score_gemma":0.0015610281,"teacher_disagreement_score":0.003107073,"about_ca_system_score_codex":0.0011444374,"about_ca_system_score_gemma":0.0008751692,"threshold_uncertainty_score":0.009979665},"labels":[],"label_agreement":null},{"id":"W2045637260","doi":"10.1007/s002240010006","title":"Efficient Communication Strategies for Ad Hoc Wireless Networks","year":2000,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Mobile ad hoc network; Wireless; Ad hoc wireless distribution service; Vehicular ad hoc network; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.013253143771549783,"score_gpt":0.24216040358342936,"score_spread":0.22890725981187957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045637260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016121648,0.0036274125,0.96452636,0.00069233944,0.00020056627,0.00014841204,0.00007276461,0.00019652778,0.014413996],"genre_scores_gemma":[0.7266725,0.007969845,0.2378691,0.00037131997,0.0004489002,0.0007095652,0.00025795234,0.00016497295,0.025535928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991622,0.00034486593,0.000043828437,0.0000716582,0.0002670741,0.00011036114],"domain_scores_gemma":[0.99811316,0.0013275272,0.00010288737,0.00015318672,0.00023436885,0.00006883568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009256741,0.0011758126,0.0008484461,0.0010833503,0.0007169928,0.0017914737,0.001448687,0.0010901105,0.003937468],"category_scores_gemma":[0.0045987875,0.0004686746,0.00032219835,0.0012474991,0.0008318508,0.0027826778,0.0011449526,0.00097385404,0.0007764702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014300672,0.00011513861,0.00025791215,0.0004219515,0.000065517466,0.00012687322,0.00023579238,0.28028876,0.0058183516,0.5147197,0.010744004,0.18706292],"study_design_scores_gemma":[0.000045557183,0.00010749097,0.00012072056,0.000050996765,0.000038235743,0.00013442498,0.00011935009,0.5889863,0.0016103077,0.39769578,0.011071583,0.0000193061],"about_ca_topic_score_codex":0.0006805048,"about_ca_topic_score_gemma":0.000776522,"teacher_disagreement_score":0.003937468,"about_ca_system_score_codex":0.00074012816,"about_ca_system_score_gemma":0.0007680857,"threshold_uncertainty_score":0.01317209},"labels":[],"label_agreement":null},{"id":"W2046444057","doi":"10.1002/wcm.445","title":"Distributed medium access control for wireless mesh networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Wireless ad hoc network; Wireless broadband; Quality of service; Wireless network; Service set; IEEE 802.11s; Wireless; Mesh networking; Distributed computing; Telecommunications; Wi-Fi array","score_opus":0.016274982710103268,"score_gpt":0.27382124226706267,"score_spread":0.2575462595569594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046444057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021996044,0.0051120585,0.9818969,0.0005857648,0.00059775513,0.00017567583,0.0000792702,0.00071985944,0.00863313],"genre_scores_gemma":[0.5171017,0.010393663,0.44351643,0.00092772726,0.0019123639,0.0028197514,0.0007579826,0.00017450981,0.022395803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980495,0.0007522787,0.0001604797,0.0002729651,0.00065272494,0.000112005],"domain_scores_gemma":[0.9975333,0.0012051392,0.00031151943,0.00027673366,0.0005957721,0.000077513745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022440646,0.0007255255,0.0008925356,0.00078561687,0.0006512806,0.0016081685,0.0016654023,0.0012607415,0.0037922468],"category_scores_gemma":[0.00620347,0.0002325172,0.0003331444,0.001056156,0.0009801082,0.0013626874,0.0011876842,0.0017587317,0.0011858349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029937425,0.00012027171,0.0005732898,0.0009716581,0.00010417607,0.00043451096,0.0002810708,0.11709437,0.01193629,0.45412138,0.02002382,0.39403984],"study_design_scores_gemma":[0.00017013251,0.0002117396,0.00032584282,0.00016872918,0.00005441762,0.00026459855,0.00004946929,0.7152749,0.0040366743,0.17686957,0.10251915,0.00005476226],"about_ca_topic_score_codex":0.000891489,"about_ca_topic_score_gemma":0.00060482754,"teacher_disagreement_score":0.0037922468,"about_ca_system_score_codex":0.00079760014,"about_ca_system_score_gemma":0.0006963853,"threshold_uncertainty_score":0.012686372},"labels":[],"label_agreement":null},{"id":"W2046925041","doi":"10.1109/tnet.2011.2158237","title":"Throughput and Energy Efficiency in Wireless Ad Hoc Networks With Gaussian Channels","year":2011,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Bottleneck; Computer science; Wireless ad hoc network; Computer network; Node (physics); Gaussian; Algorithm; Wireless; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Physics; Embedded system","score_opus":0.0222817164076196,"score_gpt":0.21827676254539705,"score_spread":0.19599504613777743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046925041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19143066,0.0033953637,0.79342425,0.0014479563,0.00011513291,0.000074685566,0.00028292122,0.0005592867,0.009269767],"genre_scores_gemma":[0.9813027,0.0016509928,0.014725077,0.00016552793,0.00012987494,0.00007288166,0.00009060206,0.00007505761,0.0017872943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972819,0.0011029069,0.000071615905,0.0002727453,0.00060642266,0.0006644552],"domain_scores_gemma":[0.98386383,0.013220596,0.0009873816,0.0007104216,0.0009515235,0.00026624222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047152285,0.00096471806,0.001203138,0.0017037027,0.0007458761,0.0019489708,0.0015557914,0.0009894124,0.0009883549],"category_scores_gemma":[0.018762242,0.0006978302,0.000523916,0.001698023,0.0024205707,0.00390517,0.0014224836,0.0009347283,0.00030376532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025098407,0.0000966429,0.0015705201,0.0001241523,0.000076750344,0.00014741595,0.00012868595,0.91636604,0.0016762113,0.065776795,0.001525259,0.012260483],"study_design_scores_gemma":[0.000011662581,0.00003556718,0.00029237644,0.000010789693,0.000015246833,0.000033683456,0.00003028605,0.9732059,0.00043295827,0.025632152,0.00029239125,0.000006987328],"about_ca_topic_score_codex":0.0036008388,"about_ca_topic_score_gemma":0.0021247983,"teacher_disagreement_score":0.0047152285,"about_ca_system_score_codex":0.0026283904,"about_ca_system_score_gemma":0.0015462884,"threshold_uncertainty_score":0.024936855},"labels":[],"label_agreement":null},{"id":"W2046970892","doi":"10.1145/2489253.2489254","title":"Improved multicriteria spanners for Ad-Hoc networks under energy and distance metrics","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Industry, Trade and Labor","keywords":"Spanner; Computer science; Wireless ad hoc network; Probabilistic logic; Mobile ad hoc network; Node (physics); Wireless network; Wireless sensor network; Shortest path problem; Geometric networks; Wireless; Graph; Computer network; Distributed computing; Theoretical computer science; Complex network; Telecommunications","score_opus":0.014611171764628077,"score_gpt":0.23373666560937814,"score_spread":0.21912549384475005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046970892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06809225,0.00060208,0.92653674,0.0001853986,0.000048044065,0.000074169315,0.000044915956,0.00022584612,0.0041905344],"genre_scores_gemma":[0.73433405,0.0010734147,0.25856507,0.00013462512,0.00015513325,0.00022259503,0.000213796,0.000190008,0.0051113386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998195,0.0007050359,0.00010272559,0.00028796043,0.0005459986,0.00016336449],"domain_scores_gemma":[0.9948015,0.0029456078,0.0007119556,0.000805423,0.0003850881,0.0003504343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026416716,0.0012026763,0.0011414787,0.0012848477,0.0007158308,0.001163741,0.0016507336,0.0008749774,0.0026991821],"category_scores_gemma":[0.008337339,0.000495116,0.00079823233,0.001464149,0.001247005,0.003997636,0.0025615604,0.0013864414,0.0005370176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002586949,0.00016834898,0.0010535629,0.00025218824,0.00006409056,0.00014461637,0.00028941967,0.6580846,0.010919237,0.23541372,0.0013398433,0.092011765],"study_design_scores_gemma":[0.000019407868,0.00033555288,0.00021967103,0.000030358302,0.000022243677,0.00013085833,0.000054257504,0.88870674,0.003921264,0.10447857,0.002059746,0.000021357455],"about_ca_topic_score_codex":0.00028186283,"about_ca_topic_score_gemma":0.0004227202,"teacher_disagreement_score":0.0026991821,"about_ca_system_score_codex":0.0009421832,"about_ca_system_score_gemma":0.0005038495,"threshold_uncertainty_score":0.013970673},"labels":[],"label_agreement":null},{"id":"W2047008061","doi":"10.1007/s11235-009-9229-y","title":"Sensitivity of SWAN QoS model in MANETs with proactive and reactive routing: a simulation study","year":2009,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Sensitivity (control systems); Computer network; Quality of service; Routing (electronic design automation)","score_opus":0.027580221553595293,"score_gpt":0.280097441937171,"score_spread":0.2525172203835757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047008061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9632155,0.00042408565,0.026853133,0.00063427567,0.00008345534,0.00008714348,0.00025062892,0.00012848058,0.008323223],"genre_scores_gemma":[0.9975733,0.000106848864,0.0014490295,0.000047973943,0.000008391004,0.000017114904,0.000052886004,0.000012826787,0.00073144794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991659,0.00039670468,0.00002850328,0.00008711388,0.00012743815,0.000194368],"domain_scores_gemma":[0.99144346,0.007100556,0.0004892445,0.00024965254,0.0005085306,0.00020844612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002282577,0.00065434136,0.0006612224,0.00099717,0.0005529723,0.0008814411,0.0010310928,0.0015860052,0.0011801707],"category_scores_gemma":[0.00881405,0.0004647687,0.000704497,0.00068878464,0.00095418835,0.001191201,0.00080043054,0.0012126651,0.000113941445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006612968,0.0000597751,0.001181743,0.000017896584,0.000016563617,0.00006002439,0.000031624022,0.9958325,0.0006183479,0.0011700166,0.0001576908,0.0007876999],"study_design_scores_gemma":[0.0000055667597,0.000043416174,0.00031092137,0.0000032638334,0.000009048747,0.000017271936,0.000026699532,0.9988223,0.0002845732,0.0004148571,0.000057205278,0.0000048529514],"about_ca_topic_score_codex":0.013350361,"about_ca_topic_score_gemma":0.00566872,"teacher_disagreement_score":0.013350361,"about_ca_system_score_codex":0.001859284,"about_ca_system_score_gemma":0.00072112563,"threshold_uncertainty_score":0.026545346},"labels":[],"label_agreement":null},{"id":"W2047185577","doi":"10.1109/icc.2010.5502440","title":"Reliability and Overhead Analysis of Multicast BitTorrent Enabled Ad Hoc Network Routing","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Protocol Independent Multicast; Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Wireless Routing Protocol; Vehicular ad hoc network; Optimized Link State Routing Protocol; Zone Routing Protocol; Reliable multicast; Xcast; Routing protocol; Wireless ad hoc network; Network packet; Telecommunications; Wireless","score_opus":0.008837278989035423,"score_gpt":0.24093710966895993,"score_spread":0.2320998306799245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047185577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13614108,0.003220124,0.8502122,0.00063591794,0.00012454463,0.00006902991,0.00011253644,0.00034983212,0.009134785],"genre_scores_gemma":[0.968778,0.001506838,0.027976032,0.00004337165,0.00012518803,0.00005500638,0.00006384066,0.00006068443,0.0013910353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867624,0.00041410438,0.00004617767,0.00008337823,0.00064840383,0.00013165952],"domain_scores_gemma":[0.9949142,0.0032691925,0.0005893864,0.00038987168,0.00077628915,0.0000611007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015872326,0.0006348783,0.0005221402,0.0014545087,0.00031174024,0.0006761157,0.000867004,0.0004967871,0.0007166182],"category_scores_gemma":[0.010137232,0.00024509054,0.00041962133,0.0006741256,0.00061131496,0.0013676918,0.00047580895,0.0006942691,0.00018452875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011160127,0.000045914338,0.0013387492,0.00017354747,0.00004124725,0.00032686614,0.00017099119,0.83983105,0.012808781,0.117049664,0.001181224,0.026920363],"study_design_scores_gemma":[0.0000012132243,0.000022152502,0.0002357963,0.0000061185174,0.000007638722,0.00008887965,0.000013309302,0.9935528,0.00091736723,0.004866113,0.00028331767,0.0000053141766],"about_ca_topic_score_codex":0.0012507836,"about_ca_topic_score_gemma":0.00056010665,"teacher_disagreement_score":0.0015872326,"about_ca_system_score_codex":0.0011250231,"about_ca_system_score_gemma":0.0004479559,"threshold_uncertainty_score":0.008394182},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0076211847514263634,"score_gpt":0.21022346257602725,"score_spread":0.20260227782460088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047377413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013318241,0.0065856017,0.96738183,0.0009342236,0.0007064558,0.0002477931,0.00005417212,0.0016270626,0.009144589],"genre_scores_gemma":[0.5646131,0.013842673,0.40285182,0.0006983096,0.0021771092,0.00089916313,0.0003991369,0.00039227528,0.014126425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868387,0.000522464,0.00008102348,0.00014317631,0.0004916022,0.000077875986],"domain_scores_gemma":[0.9990939,0.00042358285,0.000118184784,0.0001503601,0.0001736581,0.000040364182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015102876,0.0010713555,0.0009064923,0.0009825719,0.00090360263,0.0015256178,0.0014011654,0.0013509394,0.001270216],"category_scores_gemma":[0.003974646,0.00047229292,0.00034580036,0.0018905201,0.00089195336,0.003317535,0.0012396412,0.0007345183,0.0008604377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023199587,0.00016632046,0.0009138476,0.00061439385,0.00011198481,0.00033067612,0.00023383243,0.46558982,0.011055188,0.062386923,0.011178082,0.44718695],"study_design_scores_gemma":[0.00009618237,0.0002282355,0.0003904956,0.00007799618,0.000075216434,0.00040595053,0.00010656931,0.86140734,0.0039797723,0.08931038,0.0438694,0.000052515992],"about_ca_topic_score_codex":0.00073874457,"about_ca_topic_score_gemma":0.00072572596,"teacher_disagreement_score":0.0015256178,"about_ca_system_score_codex":0.0005952096,"about_ca_system_score_gemma":0.00054223766,"threshold_uncertainty_score":0.007987261},"labels":[],"label_agreement":null},{"id":"W2047586099","doi":"10.1109/ccece.2012.6335016","title":"Secure smart meter infrastructure in Multi-dwelling environment","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Smart grid; Smart meter; Default gateway; Routing protocol; Wireless; Reliability (semiconductor); Routing (electronic design automation); Telecommunications; Engineering; Electrical engineering","score_opus":0.014684390273040217,"score_gpt":0.22387181494805142,"score_spread":0.2091874246750112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047586099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4420801,0.0015002533,0.5408188,0.0017044481,0.00028093252,0.00014502888,0.00014434008,0.0020257449,0.011300275],"genre_scores_gemma":[0.9869479,0.00023533263,0.011588594,0.000044109027,0.000024587203,0.000022883702,0.000042599277,0.000011967349,0.0010820455],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995233,0.00013784936,0.00003203002,0.00008405574,0.0001126859,0.00010999914],"domain_scores_gemma":[0.9992086,0.00023207821,0.00016208131,0.00022717111,0.00008891111,0.00008119146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038428165,0.0002955798,0.0003015323,0.00026848388,0.0007294446,0.0007637911,0.0005117201,0.00087705324,0.0009685931],"category_scores_gemma":[0.0010794634,0.0001868832,0.00019708672,0.00027042322,0.0006299462,0.0024409217,0.0018235536,0.0004982739,0.0003463698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009868157,0.00030101635,0.017002512,0.00069301407,0.00013405018,0.006596661,0.0012894055,0.25909877,0.14135954,0.20938464,0.016611254,0.34654227],"study_design_scores_gemma":[0.00006525994,0.00049021095,0.0054519544,0.00007127615,0.00008945148,0.0029077423,0.001025963,0.84090275,0.045170672,0.07762099,0.026120929,0.00008277803],"about_ca_topic_score_codex":0.00048015488,"about_ca_topic_score_gemma":0.00057361333,"teacher_disagreement_score":0.0009685931,"about_ca_system_score_codex":0.00039759194,"about_ca_system_score_gemma":0.00034225656,"threshold_uncertainty_score":0.0032402873},"labels":[],"label_agreement":null},{"id":"W2047873690","doi":"10.1504/ijahuc.2008.017004","title":"Hybrid routing protocol with Quality of Service support for Ad Hoc Wireless Networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Zone Routing Protocol; Routing protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Distributed computing; Node (physics); Adaptive quality of service multi-hop routing; Routing (electronic design automation); Network packet","score_opus":0.026235939075310168,"score_gpt":0.3031509205056559,"score_spread":0.2769149814303457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047873690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028876584,0.005433053,0.9542975,0.0006683007,0.0007280736,0.0005347248,0.00018570754,0.0024028078,0.0068732477],"genre_scores_gemma":[0.51150936,0.0026682643,0.47530183,0.0006317775,0.0004703088,0.0011890538,0.00085979444,0.00027038562,0.0070991684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981164,0.0006436334,0.00017285468,0.00014986313,0.0007985116,0.00011878882],"domain_scores_gemma":[0.9978738,0.0008347085,0.000248345,0.00037060882,0.0005593431,0.0001131644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001816402,0.0007575687,0.00097555073,0.0011128475,0.00070086267,0.0014588619,0.0025843421,0.001288793,0.001492025],"category_scores_gemma":[0.0034065684,0.00028239706,0.00047822433,0.0015078692,0.0007537829,0.002842453,0.0017409913,0.0011674522,0.0007650783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015041154,0.00043568807,0.0019383286,0.0016596654,0.000599186,0.0013677193,0.00077969773,0.12962465,0.10010264,0.15629445,0.017564284,0.58812964],"study_design_scores_gemma":[0.0005212895,0.0020771038,0.0012816342,0.0001445145,0.0004884149,0.0030767452,0.00021630856,0.7735992,0.028635673,0.0818971,0.10779636,0.00026559737],"about_ca_topic_score_codex":0.00048348878,"about_ca_topic_score_gemma":0.00052244763,"teacher_disagreement_score":0.0025843421,"about_ca_system_score_codex":0.0004755666,"about_ca_system_score_gemma":0.0005939971,"threshold_uncertainty_score":0.009606183},"labels":[],"label_agreement":null},{"id":"W2047903689","doi":"10.3138/infor.51.4.192","title":"Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach","year":2013,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China; National Science Foundation","keywords":"Wireless network; Computer science; Wireless; Hop (telecommunications); Mathematics; Computer network; Telecommunications","score_opus":0.03248226262466788,"score_gpt":0.28597723035020384,"score_spread":0.253494967725536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047903689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042109102,0.0015612749,0.94891083,0.0007217847,0.00013068256,0.00003847476,0.0000615637,0.00016634853,0.006299933],"genre_scores_gemma":[0.90959907,0.0025734834,0.07902471,0.00032232798,0.0002935888,0.00010232612,0.00007835073,0.0001829064,0.007823171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898356,0.00040953938,0.00003896957,0.00014244502,0.00024605676,0.00017942181],"domain_scores_gemma":[0.9940469,0.0036792606,0.0006259475,0.00072228763,0.0006765467,0.00024908647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020651822,0.0009224996,0.0010896672,0.0014222249,0.0006413336,0.0015004391,0.0028658859,0.0020159292,0.0024684984],"category_scores_gemma":[0.011000817,0.0004764895,0.001263543,0.0011630374,0.0024862434,0.0060083037,0.0025203056,0.0028986547,0.0005574288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011935288,0.000095690586,0.0015323919,0.0002329291,0.000070037386,0.0006598912,0.0004313366,0.37299725,0.00396579,0.5957043,0.0025188643,0.021672232],"study_design_scores_gemma":[0.000004573702,0.000020238958,0.00020485978,0.000014569264,0.000011033827,0.00014264401,0.000054127304,0.9180388,0.00037975042,0.080122486,0.0009882041,0.000018675113],"about_ca_topic_score_codex":0.0023229106,"about_ca_topic_score_gemma":0.0013760751,"teacher_disagreement_score":0.0028658859,"about_ca_system_score_codex":0.0014375184,"about_ca_system_score_gemma":0.0006346412,"threshold_uncertainty_score":0.010921836},"labels":[],"label_agreement":null},{"id":"W2048113218","doi":"10.1109/wimob.2011.6085400","title":"A cooperative game-theory model for bandwidth allocation in multi-hop wireless networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Game theory; Computer network; Wireless network; Stochastic game; Wireless; Bandwidth (computing); Denial-of-service attack; Cooperative game theory; Bandwidth allocation; Distributed computing; Mathematical optimization; Mathematical economics; Telecommunications; The Internet; Mathematics","score_opus":0.04272222006074675,"score_gpt":0.26149550590231074,"score_spread":0.218773285841564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048113218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014669768,0.0008330172,0.9521889,0.0013407712,0.00012736517,0.00019631385,0.00015487877,0.00008763061,0.030401465],"genre_scores_gemma":[0.8566476,0.0014554267,0.117777355,0.00065907167,0.00024831094,0.00091187254,0.00017726514,0.00004414962,0.02207885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983381,0.0008529173,0.000057654524,0.00017413164,0.0003877971,0.00018953111],"domain_scores_gemma":[0.9986846,0.0008347572,0.00010691221,0.00008501289,0.0001658449,0.00012288561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018365775,0.0010521665,0.0010124954,0.00078111107,0.0011954448,0.0024568627,0.002915337,0.0028442943,0.0042032637],"category_scores_gemma":[0.0032130692,0.00046482476,0.00094089046,0.0012643901,0.0026013104,0.003495952,0.0013057919,0.0019487585,0.00074313435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031419913,0.00004843733,0.0001508973,0.000055366356,0.000020677058,0.00024788288,0.00026458284,0.2188618,0.0006303847,0.774341,0.0014753876,0.0038721275],"study_design_scores_gemma":[0.000041373154,0.000059749345,0.00007538618,0.000016880309,0.000013057236,0.000109816865,0.00007722634,0.72946846,0.00010476091,0.26518965,0.0048238924,0.000019713958],"about_ca_topic_score_codex":0.0066051725,"about_ca_topic_score_gemma":0.0047520506,"teacher_disagreement_score":0.0066051725,"about_ca_system_score_codex":0.0024167094,"about_ca_system_score_gemma":0.0016859464,"threshold_uncertainty_score":0.017534554},"labels":[],"label_agreement":null},{"id":"W2048123736","doi":"10.1109/vtcfall.2012.6399335","title":"A Trust Distribution Service for MANETs","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Trust management (information system); Gossip; Computer science; Computer network; Reputation; Computational trust; Node (physics); Mobile ad hoc network; Gossip protocol; Computer security; Wireless ad hoc network; Service (business); Trust anchor; Routing (electronic design automation); Distributed computing; Wireless; Telecommunications; Business; Network packet","score_opus":0.017362162420695697,"score_gpt":0.24555227676781352,"score_spread":0.22819011434711783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048123736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041896906,0.0011365219,0.9677996,0.0012545678,0.0006041373,0.00042315968,0.0005740339,0.012275299,0.011742934],"genre_scores_gemma":[0.3050492,0.0041707195,0.6341704,0.0010703854,0.001078454,0.0013408718,0.005117634,0.0024065708,0.04559582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793327,0.00047044395,0.00021751634,0.00019291861,0.0010454734,0.0001404632],"domain_scores_gemma":[0.9979621,0.0003858559,0.00017113665,0.00063030387,0.0005666249,0.00028391735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019753098,0.0006918955,0.0007005409,0.0009054633,0.0012467443,0.0024355138,0.0014497773,0.001512316,0.008379193],"category_scores_gemma":[0.007002297,0.00042624323,0.0007598642,0.00146661,0.0007159215,0.0027816445,0.0020949645,0.0024899347,0.007277669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040324355,0.00027696136,0.0017261059,0.00060206954,0.00012731884,0.001029972,0.0005445203,0.04235406,0.014112705,0.25522867,0.121589914,0.56200445],"study_design_scores_gemma":[0.00019094108,0.0002433872,0.0005765707,0.00013261428,0.00006354529,0.0012683534,0.00012663187,0.4341423,0.009035325,0.0909877,0.46310413,0.00012854888],"about_ca_topic_score_codex":0.003611702,"about_ca_topic_score_gemma":0.0021586758,"teacher_disagreement_score":0.008379193,"about_ca_system_score_codex":0.0012845969,"about_ca_system_score_gemma":0.00233772,"threshold_uncertainty_score":0.02803117},"labels":[],"label_agreement":null},{"id":"W2048524670","doi":"10.1155/2010/239370","title":"A Simulation Study: The Impact of Random and Realistic Mobility Models on the Performance of Bypass-AODV in Ad Hoc 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":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"King Fahd University of Petroleum and Minerals","keywords":"Mobility model; Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Waypoint; Mobile ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Vehicular ad hoc network; Routing (electronic design automation); Dynamic Source Routing; Wireless; Real-time computing; Network packet; Telecommunications","score_opus":0.043226897597337624,"score_gpt":0.3087485440521294,"score_spread":0.2655216464547918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048524670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9615598,0.0010115578,0.031118928,0.00043722385,0.00010716113,0.00020403601,0.0006216003,0.0002817542,0.0046579777],"genre_scores_gemma":[0.9911843,0.00053759955,0.0072488855,0.000051171333,0.0000142848085,0.00007492811,0.00037491307,0.000015015992,0.0004988245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878496,0.0005948693,0.00009073248,0.00009596557,0.00027244716,0.00016109386],"domain_scores_gemma":[0.99210656,0.00599668,0.00045587347,0.00046719942,0.00081166025,0.00016196333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017277736,0.0009688728,0.0007343244,0.0007076147,0.00056568126,0.0007045255,0.0008321441,0.0008958294,0.00055280735],"category_scores_gemma":[0.005574107,0.0002961914,0.0006039131,0.0009786871,0.00046921105,0.0014167615,0.00063230825,0.0007868621,0.00010110814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022800904,0.00033045924,0.0080189295,0.00013702094,0.000083527004,0.00026325625,0.00012295427,0.9783327,0.0030846815,0.002437315,0.0008902965,0.0060709333],"study_design_scores_gemma":[0.000039693427,0.00047608724,0.0017241825,0.000015168819,0.000034635785,0.00013883214,0.00009701237,0.9939446,0.0022632752,0.00072091585,0.0005219394,0.000023741708],"about_ca_topic_score_codex":0.0084116645,"about_ca_topic_score_gemma":0.0068715285,"teacher_disagreement_score":0.0084116645,"about_ca_system_score_codex":0.0009540138,"about_ca_system_score_gemma":0.0005554693,"threshold_uncertainty_score":0.016725421},"labels":[],"label_agreement":null},{"id":"W2049045921","doi":"10.1109/worldcis.2013.6751013","title":"Responding to intrusions in mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Mobile ad hoc network; Computer science; Optimized Link State Routing Protocol; Intrusion detection system; Computer network; Wireless ad hoc network; Routing protocol; Ad hoc wireless distribution service; Context (archaeology); Vehicular ad hoc network; Protocol (science); Intrusion; Mobile computing; Routing (electronic design automation); Distributed computing; Computer security; Geography; Telecommunications; Wireless; Medicine; Network packet","score_opus":0.00956457245048659,"score_gpt":0.24332036331794474,"score_spread":0.23375579086745815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049045921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33537465,0.008593902,0.6359662,0.0037321823,0.00077643653,0.00037939267,0.00007422706,0.0030682283,0.012034869],"genre_scores_gemma":[0.9458214,0.0027540287,0.047605723,0.00037951593,0.00033115453,0.000083839084,0.00006905641,0.000045888268,0.0029094142],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986406,0.00038941167,0.00012599125,0.0001527259,0.00055838603,0.00013302507],"domain_scores_gemma":[0.998293,0.0007792613,0.00025391823,0.00024761248,0.00034739028,0.00007885014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012440473,0.00041885657,0.00056796,0.00080553535,0.0006627625,0.0012213716,0.00080118526,0.0011312212,0.0004778591],"category_scores_gemma":[0.005159565,0.0002695421,0.00021295881,0.0005914228,0.00081032666,0.0023887702,0.0012837107,0.00074955926,0.00030801605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005139205,0.0003255871,0.018809265,0.0007400195,0.00019635865,0.0023065028,0.001809278,0.21806456,0.087948576,0.044903014,0.008008351,0.6163746],"study_design_scores_gemma":[0.000052715302,0.0007101508,0.004843157,0.00012466894,0.00012954618,0.0025718547,0.0013596356,0.8653918,0.041292384,0.046671096,0.03678164,0.00007132148],"about_ca_topic_score_codex":0.00041622363,"about_ca_topic_score_gemma":0.00039665154,"teacher_disagreement_score":0.0012440473,"about_ca_system_score_codex":0.0002962236,"about_ca_system_score_gemma":0.00033430377,"threshold_uncertainty_score":0.00657928},"labels":[],"label_agreement":null},{"id":"W2049238020","doi":"10.1007/s00453-007-9081-y","title":"On the Stability of Dynamic Diffusion Load Balancing","year":2007,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Bounded function; Load balancing (electrical power); Multiplicative function; Theory of computation; Upper and lower bounds; Constant (computer programming); Node (physics); Simple (philosophy); Graph; Discrete mathematics; Mathematics; Topology (electrical circuits); Distributed computing; Theoretical computer science; Combinatorics; Algorithm","score_opus":0.0077173919710029175,"score_gpt":0.2280957933888661,"score_spread":0.2203784014178632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049238020","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11494478,0.0029967984,0.85365236,0.004005353,0.00042994323,0.00014277591,0.00024292048,0.0004044634,0.023180576],"genre_scores_gemma":[0.9470937,0.0017722637,0.041039526,0.00035325607,0.0005461539,0.00018688518,0.000231948,0.00023728076,0.008539021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981896,0.0007249856,0.00007797102,0.00032074022,0.00045109147,0.00023554372],"domain_scores_gemma":[0.96489435,0.028904682,0.0017447341,0.0013916763,0.0022575029,0.0008071551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004187492,0.0011109816,0.0013947543,0.0023336967,0.0018903518,0.0029532195,0.0024149339,0.0018127976,0.0073463274],"category_scores_gemma":[0.045046497,0.00071183825,0.0007021098,0.0018286192,0.0037126953,0.0052853683,0.0035294676,0.0030146614,0.0008292138],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091327407,0.000109629465,0.002844873,0.00027808602,0.00011421839,0.00017357543,0.00063533837,0.4451169,0.006056913,0.46879524,0.008722234,0.0662398],"study_design_scores_gemma":[0.000035487268,0.000050671846,0.0002634959,0.000024099867,0.00002069731,0.00004978141,0.00007216138,0.8211773,0.00069566566,0.17633483,0.0012557225,0.000020059468],"about_ca_topic_score_codex":0.0023187646,"about_ca_topic_score_gemma":0.0012959125,"teacher_disagreement_score":0.0073463274,"about_ca_system_score_codex":0.0017638644,"about_ca_system_score_gemma":0.0012567103,"threshold_uncertainty_score":0.024575949},"labels":[],"label_agreement":null},{"id":"W2049298232","doi":"10.1109/mnet.2008.4435902","title":"Joint Power-Frequency-Time Resource Allocation in Clustered Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Network","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Wireless; Wireless network; Wireless broadband; Network packet; Resource allocation; Scheduling (production processes); Wi-Fi array; Distributed computing; Telecommunications; Engineering","score_opus":0.01459381109658928,"score_gpt":0.21443415628271878,"score_spread":0.1998403451861295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049298232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110870056,0.00044029343,0.886219,0.00013705515,0.00003120673,0.000036833513,0.00002377581,0.00022723559,0.0020144489],"genre_scores_gemma":[0.9447293,0.00010752023,0.054399926,0.000029092558,0.000016999034,0.000031505224,0.000019146059,0.000018831008,0.00064770936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.00018077479,0.00001586401,0.000056965007,0.00009278788,0.00006739044],"domain_scores_gemma":[0.9993838,0.0003608142,0.00006692124,0.00006166614,0.00009233132,0.000034382592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086687924,0.00033737838,0.00045220336,0.00046371814,0.0004093647,0.00041245137,0.00073829835,0.0004011352,0.00048484097],"category_scores_gemma":[0.0021473998,0.00021735347,0.00017591826,0.000505982,0.00040501723,0.000685379,0.00049433624,0.00022605275,0.00009196854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458763,0.000025548306,0.00046083782,0.000028016491,0.000024139705,0.000027798702,0.000034489574,0.95046693,0.0023605272,0.007629805,0.00047408446,0.03838317],"study_design_scores_gemma":[0.0000069792604,0.00002879298,0.00012013722,0.000001358971,0.0000057577336,0.000012397048,0.000011741128,0.9949399,0.00066383835,0.0040270877,0.00017873681,0.0000032372832],"about_ca_topic_score_codex":0.0025092403,"about_ca_topic_score_gemma":0.0028532664,"teacher_disagreement_score":0.0025092403,"about_ca_system_score_codex":0.00058434403,"about_ca_system_score_gemma":0.00046002516,"threshold_uncertainty_score":0.0049892664},"labels":[],"label_agreement":null},{"id":"W2049349240","doi":"10.1109/bwcca.2012.29","title":"Jamming Strategies in DYMO MANETs: Assessing Detectability and Operational Impacts","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Jamming; Computer science; Software deployment; Mobile ad hoc network; Overhead (engineering); Network packet; Computer security; Computer network; Routing (electronic design automation)","score_opus":0.017379870469868323,"score_gpt":0.278954347417879,"score_spread":0.26157447694801067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049349240","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98992985,0.00016234079,0.008304594,0.000031716634,0.00001042837,0.00006983255,0.00006849239,0.000052580333,0.0013702024],"genre_scores_gemma":[0.996488,0.00012541909,0.002905106,0.000014046974,0.0000045402367,0.000037937938,0.00009149921,0.00000519983,0.00032835384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939954,0.00027576965,0.000032544227,0.00006882941,0.00014842942,0.00007485954],"domain_scores_gemma":[0.99616003,0.0024123213,0.0005210945,0.00018531372,0.0005072221,0.00021399975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012721175,0.0006315022,0.0003825608,0.0019255393,0.00037294065,0.0005825887,0.00038425747,0.00051487883,0.0003861639],"category_scores_gemma":[0.004095119,0.00022388934,0.00019111123,0.0006944064,0.0004255504,0.0008109992,0.0007717806,0.00028860095,0.0001445726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032480373,0.0011634681,0.2619564,0.0006361113,0.00056935096,0.00092684734,0.00101247,0.55707,0.062286682,0.0040397486,0.0007296225,0.106361195],"study_design_scores_gemma":[0.00005873216,0.005457172,0.105601914,0.000042261814,0.00020576631,0.00094322197,0.0014617625,0.8649197,0.018720135,0.0014252969,0.0010862275,0.000077811914],"about_ca_topic_score_codex":0.0018289752,"about_ca_topic_score_gemma":0.0022693272,"teacher_disagreement_score":0.0019255393,"about_ca_system_score_codex":0.00042141578,"about_ca_system_score_gemma":0.00022512575,"threshold_uncertainty_score":0.006727636},"labels":[],"label_agreement":null},{"id":"W2049497032","doi":"10.1109/ainaw.2007.50","title":"A Routing Metric for Load-Balancing in Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Load balancing (electrical power); Wireless mesh network; Computer network; Distributed computing; Dynamic Source Routing; Metrics; Multipath routing; Static routing; Routing (electronic design automation); Wireless; Wireless network; Routing protocol; Mathematics; Telecommunications","score_opus":0.011999000151877968,"score_gpt":0.2504477595426557,"score_spread":0.23844875939077773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049497032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006873904,0.001448283,0.98730195,0.00028280777,0.0003488741,0.000086082786,0.00009260329,0.00045405052,0.003111516],"genre_scores_gemma":[0.39694577,0.0020777606,0.59543556,0.00023012666,0.000511739,0.00033869973,0.00053774106,0.00023361736,0.003688942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871325,0.00034992874,0.00012110363,0.00015324914,0.0006156652,0.000046819678],"domain_scores_gemma":[0.99893147,0.00030679,0.0002074905,0.00011073856,0.0003981096,0.00004540958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013045272,0.00086731673,0.00062358915,0.0013500585,0.0007094452,0.0010438657,0.0011988339,0.0006832295,0.0012544511],"category_scores_gemma":[0.0049674986,0.00016338025,0.00034258628,0.0017272483,0.0004621586,0.002393512,0.0007869345,0.0007247784,0.0003908421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023430359,0.00010351026,0.0019023522,0.00067930674,0.00013734802,0.00015167228,0.00016487502,0.25090662,0.05121384,0.16460821,0.011223671,0.51867425],"study_design_scores_gemma":[0.000030184234,0.00037547786,0.0010266692,0.000066090084,0.00008304866,0.00040853195,0.00007621293,0.89316267,0.021639768,0.037214488,0.045827363,0.000089438814],"about_ca_topic_score_codex":0.0005985752,"about_ca_topic_score_gemma":0.0008573364,"teacher_disagreement_score":0.0013500585,"about_ca_system_score_codex":0.00092621497,"about_ca_system_score_gemma":0.0005226237,"threshold_uncertainty_score":0.006899059},"labels":[],"label_agreement":null},{"id":"W2050019981","doi":"10.1504/ijsnet.2007.012992","title":"A new approach to service discovery in wireless mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Service discovery; Multicast; Mobile ad hoc network; Reliable multicast; Wireless ad hoc network; Network packet; Distributed computing; Geocast; Protocol Independent Multicast; Optimized Link State Routing Protocol; Routing protocol; Wireless; Web service; World Wide Web; Telecommunications","score_opus":0.012138007621563904,"score_gpt":0.25818349757446685,"score_spread":0.24604548995290293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050019981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030184428,0.0053911367,0.97954756,0.0020134067,0.0011390359,0.00020269361,0.000055611345,0.00036910962,0.00826299],"genre_scores_gemma":[0.14768983,0.014753282,0.8175674,0.0018995253,0.0028635827,0.0007017639,0.00025696188,0.00012518451,0.014142398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623305,0.00090766576,0.0002303881,0.00046979045,0.00197634,0.00018284423],"domain_scores_gemma":[0.9979873,0.001038219,0.0001515304,0.00037383297,0.00033454804,0.00011459538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024244539,0.0010105434,0.0012999102,0.002001758,0.0014447324,0.0033674652,0.003050364,0.002050286,0.0022630803],"category_scores_gemma":[0.0054541794,0.00058417703,0.00113704,0.0029701695,0.0032128447,0.0069035375,0.003139715,0.004253456,0.0010315812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016039664,0.00016048155,0.00040549535,0.0007484079,0.00013094676,0.00027245542,0.00041605625,0.03710875,0.0067519466,0.5910593,0.012565247,0.3502204],"study_design_scores_gemma":[0.0001535655,0.00047814284,0.000260023,0.00017703405,0.00014640312,0.001500129,0.00022157181,0.42387605,0.0052563497,0.39323828,0.17459029,0.000102137594],"about_ca_topic_score_codex":0.0012379675,"about_ca_topic_score_gemma":0.0014060785,"teacher_disagreement_score":0.0033674652,"about_ca_system_score_codex":0.0015498158,"about_ca_system_score_gemma":0.0016599281,"threshold_uncertainty_score":0.012821853},"labels":[],"label_agreement":null},{"id":"W2050433894","doi":"10.1109/milcom.2006.302162","title":"Detecting Wormhole Attacks in Mobile Ad Hoc Networks through Protocol Breaking and Packet Timing Analysis","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa; Defence Research and Development Canada","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wormhole; Routing protocol; Network packet; Wireless ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Wireless; Telecommunications","score_opus":0.014335462655626236,"score_gpt":0.28077229450694474,"score_spread":0.2664368318513185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050433894","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8799263,0.0001383893,0.11801407,0.000055443503,0.000024526464,0.000108472486,0.000053920907,0.0010769899,0.0006018803],"genre_scores_gemma":[0.96423405,0.00009057758,0.035271626,0.000012939146,0.000006900956,0.00003666771,0.00006537082,0.000030001096,0.0002517597],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993437,0.00016019617,0.00006667693,0.000069142865,0.00029228488,0.00006803053],"domain_scores_gemma":[0.9973326,0.0013340609,0.00052528764,0.00032483164,0.0003870243,0.000096244934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007234907,0.0004631796,0.00028221429,0.0012572741,0.00019055099,0.0005206897,0.00054729276,0.00037197507,0.00030907296],"category_scores_gemma":[0.004708216,0.000240304,0.00021664567,0.0004794846,0.00047837,0.0013654812,0.00042089086,0.0004707369,0.000054675656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095054915,0.0006867278,0.06394302,0.00036155037,0.00025952785,0.0010454855,0.00058920553,0.18725668,0.5408317,0.006712911,0.00043255137,0.1969301],"study_design_scores_gemma":[0.00006727535,0.0012744182,0.015347259,0.000025387239,0.00011396275,0.0009330011,0.00013945629,0.79225093,0.1859173,0.0026315541,0.0012366924,0.00006276335],"about_ca_topic_score_codex":0.0005104652,"about_ca_topic_score_gemma":0.0005068009,"teacher_disagreement_score":0.0012572741,"about_ca_system_score_codex":0.00019930412,"about_ca_system_score_gemma":0.00019722263,"threshold_uncertainty_score":0.0038262606},"labels":[],"label_agreement":null},{"id":"W2050660285","doi":"10.1109/wons.2010.5437122","title":"On average and maximum load of greedy routing in wireless ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Node (physics); Destination-Sequenced Distance Vector routing; Greedy algorithm; Dynamic Source Routing; Static routing; Routing (electronic design automation); Computer network; Routing protocol; Distributed computing; Algorithm; Wireless; Engineering","score_opus":0.006818957482990537,"score_gpt":0.21272470886613984,"score_spread":0.20590575138314932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050660285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2954573,0.004023403,0.67794234,0.0014683539,0.00023628345,0.00006203019,0.00037034653,0.00067728147,0.019762699],"genre_scores_gemma":[0.9763533,0.0018949612,0.019252377,0.00014585098,0.00025099356,0.000087670596,0.00018694944,0.00017487085,0.0016530548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998648,0.0005024551,0.00004120821,0.00017407427,0.0004747238,0.000159543],"domain_scores_gemma":[0.991206,0.0070544146,0.0004247163,0.0005880392,0.0005522874,0.0001745768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021373252,0.0008447933,0.0009972212,0.0013462155,0.0008268885,0.0012753359,0.0013963804,0.000957444,0.0011893027],"category_scores_gemma":[0.017365508,0.0006058603,0.0005269249,0.0014077694,0.0018838734,0.004730872,0.001277433,0.00082785316,0.0002978886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011420503,0.00005134063,0.0014089984,0.000089709916,0.00003120644,0.0000676038,0.00008709099,0.9332495,0.0016805892,0.047533818,0.0011384363,0.014547449],"study_design_scores_gemma":[0.0000067966257,0.000035291603,0.0004987088,0.000012884992,0.000009147203,0.000053483775,0.00003776791,0.9509978,0.0004891695,0.04738433,0.00046126192,0.000013457358],"about_ca_topic_score_codex":0.0029097812,"about_ca_topic_score_gemma":0.0018212828,"teacher_disagreement_score":0.0029097812,"about_ca_system_score_codex":0.0015958596,"about_ca_system_score_gemma":0.00071310316,"threshold_uncertainty_score":0.011578798},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.04687829276456813,"score_gpt":0.27230542686262693,"score_spread":0.2254271340980588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051011315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013581117,0.13638763,0.7667839,0.047070403,0.0022731298,0.00023955494,0.00011061098,0.00046079216,0.03309289],"genre_scores_gemma":[0.3414327,0.19049725,0.43674108,0.0032443784,0.010249022,0.00086008996,0.00024034116,0.00031443042,0.016420813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968821,0.0012626856,0.0002541753,0.00025785514,0.0011696401,0.00017356109],"domain_scores_gemma":[0.98995095,0.006871211,0.0005168513,0.0007122488,0.0017344817,0.00021418468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008841403,0.0010304305,0.0016307683,0.0010493586,0.0012830659,0.0064179874,0.0038476451,0.0039420803,0.0026622177],"category_scores_gemma":[0.013481118,0.0012350861,0.00047222225,0.0018332467,0.003077922,0.016599132,0.0019121361,0.0040426482,0.0012412138],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001386031,0.00019488005,0.00072982727,0.0018470996,0.00007361619,0.0002627838,0.00044410088,0.049331173,0.005383712,0.66018724,0.014033917,0.2673731],"study_design_scores_gemma":[0.000061933824,0.0003077587,0.00040677335,0.0006428198,0.00010451955,0.0010926591,0.00085773,0.23688316,0.0039584097,0.65860355,0.096962765,0.00011793371],"about_ca_topic_score_codex":0.00077789876,"about_ca_topic_score_gemma":0.001292133,"teacher_disagreement_score":0.008841403,"about_ca_system_score_codex":0.0014537658,"about_ca_system_score_gemma":0.001475806,"threshold_uncertainty_score":0.046758413},"labels":[],"label_agreement":null},{"id":"W2051625963","doi":"10.1016/j.tcs.2004.11.009","title":"Formal description and analysis of a distributed location service for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Neurosurgery Research and Education Foundation","keywords":"Computer science; Computer network; Distributed computing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Routing protocol; Mobile ad hoc network; Wireless ad hoc network; Network packet; Wireless","score_opus":0.008857737886663775,"score_gpt":0.23490069795498855,"score_spread":0.22604296006832478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051625963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005983459,0.00021138764,0.98879457,0.00054734695,0.00006854621,0.00015122141,0.0001522963,0.00030681986,0.0037842512],"genre_scores_gemma":[0.40772587,0.0007547946,0.58040476,0.00040816615,0.00028403278,0.0006736363,0.0007373133,0.00028362297,0.008727813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99652183,0.0009625547,0.00030457956,0.00038187904,0.0014497957,0.00037943083],"domain_scores_gemma":[0.9958722,0.0021374694,0.00033062437,0.00070599007,0.000806576,0.00014717654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003283309,0.0006828151,0.00065739296,0.0011589123,0.0013598824,0.0047353376,0.0029158234,0.0017375387,0.0035965983],"category_scores_gemma":[0.0073973816,0.0008396611,0.0015803522,0.0012353837,0.003951357,0.0036357294,0.0021992791,0.0024885777,0.0008772697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054544013,0.00010223668,0.0004780944,0.00017202718,0.000030369782,0.0003652615,0.00056240393,0.061454993,0.003815906,0.9122792,0.0018933126,0.01879161],"study_design_scores_gemma":[0.00010002803,0.00007151518,0.0002660831,0.000090033165,0.00006664155,0.00029116104,0.00021638407,0.4089854,0.004205718,0.5557257,0.029935004,0.00004631559],"about_ca_topic_score_codex":0.008409772,"about_ca_topic_score_gemma":0.006183761,"teacher_disagreement_score":0.008409772,"about_ca_system_score_codex":0.0025138299,"about_ca_system_score_gemma":0.0036784057,"threshold_uncertainty_score":0.01823914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.008946229700157711,"score_gpt":0.23318935829744994,"score_spread":0.22424312859729223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051628581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14423795,0.0021931431,0.8353878,0.002091766,0.00018106775,0.00016134245,0.00041746246,0.0007651385,0.014564189],"genre_scores_gemma":[0.91483283,0.0014539378,0.07567897,0.00023746022,0.0002114153,0.00019246737,0.00032604512,0.0002117432,0.006855068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978022,0.0008663112,0.00009974043,0.00036979938,0.00043855226,0.0004233187],"domain_scores_gemma":[0.97687703,0.019610658,0.0011538882,0.0010182139,0.00077461597,0.0005655903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028395026,0.00089897,0.002509745,0.0013211136,0.0012688629,0.0023577095,0.002756943,0.001837487,0.0028162703],"category_scores_gemma":[0.021428615,0.0015744705,0.00062206184,0.0021045182,0.0026241827,0.0035791595,0.0022304018,0.0013757186,0.00036506742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050589617,0.000071711926,0.0004094454,0.00022635693,0.00004327124,0.000053840424,0.00016789782,0.91989905,0.0014760812,0.055408742,0.002703675,0.019034063],"study_design_scores_gemma":[0.00009989125,0.000054129672,0.00014553676,0.000013610605,0.000026842425,0.000028025359,0.000043582524,0.9472029,0.000429946,0.051366236,0.0005757125,0.0000135155615],"about_ca_topic_score_codex":0.005285484,"about_ca_topic_score_gemma":0.0072544487,"teacher_disagreement_score":0.005285484,"about_ca_system_score_codex":0.0037589585,"about_ca_system_score_gemma":0.0024044297,"threshold_uncertainty_score":0.027273238},"labels":[],"label_agreement":null},{"id":"W2051974480","doi":"10.1007/s11227-011-0662-9","title":"Revisiting relative neighborhood graph-based broadcasting algorithms for multimedia ad hoc wireless networks","year":2011,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Broadcast radiation; Broadcasting (networking); Wireless ad hoc network; Wireless; Wireless network; Latency (audio); Multimedia Broadcast Multicast Service; Atomic broadcast; Node (physics); Algorithm; Distributed computing; Telecommunications; Multicast","score_opus":0.03750323977494538,"score_gpt":0.2517758194162315,"score_spread":0.21427257964128613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051974480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018806113,0.0013030734,0.9744675,0.00038079274,0.00019806408,0.0001310869,0.000089751076,0.00068589445,0.0039376756],"genre_scores_gemma":[0.29064628,0.0020681398,0.6998283,0.0003422337,0.00036861355,0.0001572913,0.00052708224,0.00037486316,0.0056871166],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802005,0.00069250417,0.00008967359,0.0002901177,0.00078142225,0.0001261643],"domain_scores_gemma":[0.9946714,0.003205533,0.0001954335,0.0007955188,0.001005142,0.00012695059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002284197,0.0009024514,0.0015388328,0.0018320978,0.0011340394,0.0015037403,0.0039096503,0.0011751256,0.0033033784],"category_scores_gemma":[0.010914464,0.0005384301,0.0008432234,0.002728982,0.00097010494,0.0043438687,0.0017252817,0.0014966832,0.0009437986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042477285,0.00034628404,0.0011886726,0.00041566312,0.00018152736,0.00008198266,0.00040088999,0.36831373,0.009689448,0.073679365,0.0091704745,0.53610724],"study_design_scores_gemma":[0.000048365902,0.00013469932,0.00021039988,0.000027122482,0.00005301545,0.000073891264,0.00009118803,0.9683248,0.0022527773,0.02396294,0.0048020924,0.000018826582],"about_ca_topic_score_codex":0.0073544057,"about_ca_topic_score_gemma":0.01042848,"teacher_disagreement_score":0.0073544057,"about_ca_system_score_codex":0.0014203773,"about_ca_system_score_gemma":0.0015245634,"threshold_uncertainty_score":0.014623225},"labels":[],"label_agreement":null},{"id":"W2052006594","doi":"10.1016/j.comnet.2014.02.014","title":"Self-tuned distributed monitoring of multi-channel wireless networks using Gibbs sampler","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Hong Kong Polytechnic University; National Science Foundation","keywords":"Computer science; Gibbs sampling; Channel (broadcasting); Wireless sensor network; Wireless; Complement (music); Wireless network; Convergence (economics); Algorithm; Distributed algorithm; Schedule; Base station; Distributed computing; Computer network; Artificial intelligence; Telecommunications","score_opus":0.025520582900214087,"score_gpt":0.24702779681014408,"score_spread":0.22150721390993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052006594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046693657,0.00011784281,0.9521822,0.00013395188,0.000029217394,0.000029500881,0.000026044814,0.00025043747,0.00053710956],"genre_scores_gemma":[0.93980247,0.00008483671,0.05860423,0.0000622025,0.000056461184,0.00007923987,0.00007902073,0.000060867485,0.0011707137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903595,0.0004173292,0.000038289047,0.00023677018,0.00016253947,0.00010906348],"domain_scores_gemma":[0.99173707,0.0067488323,0.00038028255,0.0004910383,0.0004236694,0.00021899208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026975127,0.00054052344,0.0013333998,0.00060505845,0.0004930433,0.00093632477,0.0018712557,0.0010413686,0.0011687881],"category_scores_gemma":[0.011919863,0.00070114527,0.00054204185,0.0005425996,0.0015181184,0.0018986687,0.0017029187,0.0012162982,0.00016230917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020981365,0.00005643429,0.0021567002,0.000036050395,0.0000698446,0.00005537945,0.000080415106,0.9595927,0.0020833686,0.016176457,0.0003641016,0.019118678],"study_design_scores_gemma":[0.000005135748,0.000004333068,0.000065517015,9.245893e-7,0.0000022161348,0.000003888114,0.0000018337046,0.9978556,0.00011262584,0.0019246361,0.000021429052,0.0000018002913],"about_ca_topic_score_codex":0.0044953804,"about_ca_topic_score_gemma":0.0047410377,"teacher_disagreement_score":0.0044953804,"about_ca_system_score_codex":0.0009808915,"about_ca_system_score_gemma":0.000825842,"threshold_uncertainty_score":0.0142659545},"labels":[],"label_agreement":null},{"id":"W2052070823","doi":"10.1007/s11036-005-1555-z","title":"A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Service discovery; Computer science; Computer network; Mobile ad hoc network; Scalability; Distributed computing; Service (business); Vehicular ad hoc network; Routing protocol; Wireless ad hoc network; Service provider; Service layer; Routing (electronic design automation); Quality of service; World Wide Web; Web service; Wireless; Telecommunications; Database; Network packet","score_opus":0.011207642907402175,"score_gpt":0.2471150923083546,"score_spread":0.23590744940095243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052070823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020667847,0.0015828644,0.9505397,0.0011580626,0.00045296963,0.00047051327,0.00029094,0.010645198,0.01419185],"genre_scores_gemma":[0.20985234,0.0016657994,0.75090677,0.0005537533,0.0003343747,0.00033788913,0.0018838898,0.0004500604,0.034015033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993081,0.00007590945,0.00004628451,0.00007866551,0.00039794308,0.000093137474],"domain_scores_gemma":[0.9994393,0.0000715752,0.000022355609,0.00014678997,0.00022487316,0.000095155105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010509933,0.00048844505,0.000736451,0.0010920839,0.0011943682,0.0015646145,0.0013631528,0.0010519105,0.0040631],"category_scores_gemma":[0.0013647452,0.00039797378,0.00039098162,0.0010929503,0.00035987506,0.0025348521,0.0019595285,0.0011377778,0.0022220365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003449027,0.000383406,0.0005828785,0.0002931238,0.000105905856,0.00023871491,0.00030260728,0.019832315,0.038565498,0.08110373,0.054620165,0.8036268],"study_design_scores_gemma":[0.00021861924,0.000576556,0.0008558449,0.00008560486,0.00022981716,0.0012023646,0.00026027224,0.6433933,0.031099757,0.07572935,0.2462424,0.000106074964],"about_ca_topic_score_codex":0.002057584,"about_ca_topic_score_gemma":0.0040737344,"teacher_disagreement_score":0.0040631,"about_ca_system_score_codex":0.00074758474,"about_ca_system_score_gemma":0.002354617,"threshold_uncertainty_score":0.013592422},"labels":[],"label_agreement":null},{"id":"W2053342738","doi":"10.1109/comsnets.2013.6465573","title":"Delay throughput tradeoffs in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Wireless mesh network; Computer network; Distributed computing; Mathematical optimization; Wireless; Wireless network; Mathematics; Telecommunications","score_opus":0.011459742672084204,"score_gpt":0.22138026890741125,"score_spread":0.20992052623532703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053342738","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54267836,0.0072921687,0.42765927,0.001891542,0.00020209886,0.00007541587,0.00021883589,0.00045587617,0.019526439],"genre_scores_gemma":[0.9835504,0.0008885869,0.0144647965,0.000050683175,0.000045832643,0.000034700013,0.000031447966,0.000045741166,0.0008878275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.00033172403,0.000028160368,0.00007771932,0.00016913166,0.00013537877],"domain_scores_gemma":[0.995852,0.003432694,0.00028383356,0.0001489057,0.00019037449,0.000092144284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022897916,0.00066858286,0.00045174445,0.00075238966,0.00058873533,0.0013678565,0.00060092716,0.0008207142,0.0011038834],"category_scores_gemma":[0.0080816075,0.00041447967,0.00018404095,0.0009379686,0.00071126054,0.001678436,0.00071264734,0.00053302175,0.00013480085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024948965,0.00004119114,0.0011055743,0.000093132825,0.000030314135,0.0000970439,0.00010294982,0.9363451,0.010496431,0.030224144,0.00082019524,0.02039442],"study_design_scores_gemma":[0.00002018509,0.00014055728,0.0006046525,0.0000184183,0.000026356967,0.000070019574,0.00008541222,0.96897787,0.0034758998,0.025703583,0.0008611393,0.000015975778],"about_ca_topic_score_codex":0.001105938,"about_ca_topic_score_gemma":0.0011845744,"teacher_disagreement_score":0.0022897916,"about_ca_system_score_codex":0.0018296805,"about_ca_system_score_gemma":0.00046129353,"threshold_uncertainty_score":0.013275325},"labels":[],"label_agreement":null},{"id":"W2053767983","doi":"10.1109/icc.2009.5198949","title":"DSC: Cooperation Incentive Mechanism for Multi-Hop Cellular Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network packet; Packet forwarding; Wireless ad hoc network; Overhead (engineering); Distributed computing; Computer security; Wireless; Telecommunications","score_opus":0.019349890088373917,"score_gpt":0.2487379787736965,"score_spread":0.22938808868532257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053767983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07967822,0.0009808526,0.89660245,0.0010217893,0.00050369755,0.0007027442,0.0002897703,0.0017021346,0.018518372],"genre_scores_gemma":[0.9320613,0.00027686704,0.060371373,0.00014526738,0.00010446825,0.00030298883,0.00011734563,0.000023539691,0.006596791],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989767,0.0003263874,0.000056961344,0.000107258384,0.00038803738,0.0001447478],"domain_scores_gemma":[0.99813,0.0006368362,0.00020426068,0.0003506702,0.00051646103,0.00016163004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015680775,0.0004959544,0.00055963517,0.00095172325,0.0007718149,0.0008267648,0.0016585917,0.0009369641,0.0024491933],"category_scores_gemma":[0.00394048,0.0001567529,0.00034002715,0.0010048504,0.0007814908,0.0011984732,0.0011310488,0.0007717972,0.0003338894],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094686425,0.00047228043,0.002564169,0.00056316867,0.00011932956,0.00058420404,0.00036024186,0.25838706,0.025607368,0.4095677,0.018965367,0.28186226],"study_design_scores_gemma":[0.00023647609,0.0005601412,0.0006838742,0.00004037115,0.00006665758,0.00074854924,0.00006623934,0.88731426,0.012398209,0.06396665,0.033850685,0.0000678658],"about_ca_topic_score_codex":0.0011231776,"about_ca_topic_score_gemma":0.000795103,"teacher_disagreement_score":0.0024491933,"about_ca_system_score_codex":0.0011010928,"about_ca_system_score_gemma":0.0013991072,"threshold_uncertainty_score":0.008292913},"labels":[],"label_agreement":null},{"id":"W2054239259","doi":"10.1109/cjece.2004.1425806","title":"TCP performance over mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":73,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"A-T Children's Project","keywords":"Computer network; Computer science; TCP global synchronization; TCP tuning; Zeta-TCP; TCP Friendly Rate Control; Mobile ad hoc network; TCP acceleration; Wireless ad hoc network; TCP Westwood plus; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; H-TCP; Distributed computing; Network packet; Transmission Control Protocol; Routing protocol; Wireless; Telecommunications","score_opus":0.0031919739365984644,"score_gpt":0.15965981538156654,"score_spread":0.1564678414449681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054239259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28785184,0.18001921,0.38857868,0.0068690097,0.005140082,0.000904594,0.0019015984,0.017143512,0.11159139],"genre_scores_gemma":[0.9532974,0.018605888,0.020409707,0.00016785126,0.0007637626,0.00014540926,0.0007986337,0.00031177653,0.005499592],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655294,0.0007492537,0.0002548879,0.00031229612,0.001760722,0.00036979775],"domain_scores_gemma":[0.9939809,0.0021500676,0.00039262115,0.0005759309,0.0026198705,0.00028073366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036853973,0.0008771059,0.0010100083,0.0019625681,0.0010402595,0.003047945,0.0012358292,0.0011311759,0.0018436786],"category_scores_gemma":[0.013622028,0.0002605685,0.00023688063,0.0035823188,0.00050671515,0.0028849354,0.0010836181,0.00079880835,0.00092879764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001965557,0.0002960582,0.017780649,0.0020625829,0.00032275458,0.0014733153,0.0011594299,0.29228112,0.030997725,0.051898986,0.061992243,0.5377695],"study_design_scores_gemma":[0.00014505353,0.00079062296,0.0074534058,0.00037924357,0.00028884338,0.0014808044,0.0005348757,0.8344363,0.023759786,0.0294124,0.10112456,0.00019410622],"about_ca_topic_score_codex":0.0038973247,"about_ca_topic_score_gemma":0.0013884379,"teacher_disagreement_score":0.0038973247,"about_ca_system_score_codex":0.0013467182,"about_ca_system_score_gemma":0.0012345992,"threshold_uncertainty_score":0.01949048},"labels":[],"label_agreement":null},{"id":"W2054854206","doi":"10.1109/wcnc.2010.5506556","title":"An Algorithm for Incremental Joint Routing and Scheduling in Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Time division multiple access; Wireless mesh network; Scheduling (production processes); Flow routing; Mathematical optimization; Distributed computing; Job shop scheduling; Schedule; Algorithm; Computer network; Routing (electronic design automation); Wireless network; Wireless; Mathematics; Engineering","score_opus":0.01303734534619833,"score_gpt":0.2482503534890868,"score_spread":0.23521300814288848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054854206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00423186,0.000098100696,0.99344313,0.00008020662,0.00003975441,0.0000746204,0.000030574396,0.0006828895,0.001318912],"genre_scores_gemma":[0.095071055,0.00013498946,0.90291125,0.000056984998,0.000039084174,0.0002625954,0.00019694288,0.00012201296,0.001205022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991948,0.00023256974,0.000050095197,0.00016143685,0.00023900498,0.0001219851],"domain_scores_gemma":[0.9991098,0.00048693063,0.00007096745,0.00016706043,0.00013042295,0.000034813485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011312993,0.00074822723,0.0007437245,0.0008487368,0.00084453536,0.00073581684,0.0020674672,0.00084145885,0.0029413104],"category_scores_gemma":[0.003425838,0.0004448313,0.00074062456,0.0010217602,0.0005722896,0.0019087229,0.0015842068,0.0009153094,0.0006489633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026071622,0.00014924472,0.0006382412,0.00018162881,0.000060186336,0.00011283142,0.00019851436,0.47015947,0.004630645,0.06649456,0.0066217002,0.45049226],"study_design_scores_gemma":[0.0000631142,0.00006806159,0.00008339255,0.0000099072895,0.000017817687,0.00006369614,0.00003219107,0.96820503,0.0014207396,0.025479268,0.0045446414,0.000012134556],"about_ca_topic_score_codex":0.0025734517,"about_ca_topic_score_gemma":0.0027604708,"teacher_disagreement_score":0.0029413104,"about_ca_system_score_codex":0.00084403896,"about_ca_system_score_gemma":0.0017307723,"threshold_uncertainty_score":0.009839654},"labels":[],"label_agreement":null},{"id":"W2054979767","doi":"10.1109/ccece.2014.6901012","title":"Effect of HELLO interval duration on stable routing for mobile ad hoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Mobile ad hoc network; Computer science; Backup; Wireless ad hoc network; Interval (graph theory); Ad hoc On-Demand Distance Vector Routing; Throughput; Optimized Link State Routing Protocol; Routing protocol; Overhead (engineering); Wireless; Ad hoc wireless distribution service; Mobile radio; Routing (electronic design automation); Distributed computing; Network packet; Telecommunications; Mathematics","score_opus":0.006849786571753509,"score_gpt":0.2431157640471735,"score_spread":0.23626597747542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054979767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9314891,0.006232757,0.05261158,0.0010438849,0.0005633628,0.00025278874,0.00038894537,0.0007877451,0.006629887],"genre_scores_gemma":[0.990229,0.0008453994,0.008089254,0.000099608784,0.00009535833,0.00006262532,0.00009839969,0.00008799805,0.0003923186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934696,0.0027488666,0.00051137694,0.00068289496,0.0017465779,0.000840577],"domain_scores_gemma":[0.8205798,0.15822573,0.0077702925,0.0069943876,0.0044284076,0.0020013263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008330372,0.0011760931,0.00097638805,0.0015195387,0.0014447641,0.0014550637,0.0016013896,0.00104788,0.0016594983],"category_scores_gemma":[0.05032204,0.0005088591,0.0005662094,0.0014997127,0.0018033424,0.0034257926,0.001001742,0.0013943193,0.00019548691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012990216,0.0020401035,0.032154664,0.001512502,0.00051026745,0.0017491935,0.001634388,0.6560938,0.121527314,0.0117085725,0.002838849,0.15524009],"study_design_scores_gemma":[0.0010092219,0.014190527,0.03597486,0.00034378166,0.0018508832,0.0032096107,0.0018939278,0.79094833,0.1301558,0.013953379,0.006034434,0.00043536143],"about_ca_topic_score_codex":0.0014769618,"about_ca_topic_score_gemma":0.001585377,"teacher_disagreement_score":0.008330372,"about_ca_system_score_codex":0.0016958888,"about_ca_system_score_gemma":0.0015085255,"threshold_uncertainty_score":0.04405576},"labels":[],"label_agreement":null},{"id":"W2055601244","doi":"10.3844/jcssp.2008.1071.1075","title":"Virtual Mobility to Improve Cooperation in Mobile Ad hoc Networks","year":2008,"lang":"en","type":"article","venue":"Journal of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Telecommunications; Wireless; Network packet","score_opus":0.009943451600926924,"score_gpt":0.2411849716657474,"score_spread":0.2312415200648205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055601244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40889436,0.0035149003,0.5732935,0.0013280461,0.00044343056,0.00016791254,0.00004873865,0.0006290824,0.011680098],"genre_scores_gemma":[0.9826911,0.00030772196,0.016147282,0.000059581278,0.000045955218,0.00003598531,0.000017628929,0.0000141737555,0.0006804691],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988311,0.00065690826,0.00005390663,0.00008634372,0.00023084864,0.000140795],"domain_scores_gemma":[0.9959667,0.0024311787,0.00044647488,0.0003709078,0.000570691,0.00021405883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473648,0.00067830295,0.00046889024,0.00072728796,0.00069755665,0.00087841396,0.0008677817,0.00057759165,0.0012631135],"category_scores_gemma":[0.007242241,0.00020636363,0.00028866396,0.00059640413,0.000982539,0.0020054546,0.0018653194,0.00046918998,0.00021478775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063145015,0.00036292907,0.0062188245,0.00035156187,0.00022484,0.0005538155,0.0008052805,0.737091,0.029638486,0.08440421,0.003331457,0.13638616],"study_design_scores_gemma":[0.0000876811,0.0007212138,0.0011794412,0.000050113464,0.00011772415,0.00043835328,0.00021954453,0.9555549,0.0074363765,0.029080695,0.0050819237,0.00003196272],"about_ca_topic_score_codex":0.0005077055,"about_ca_topic_score_gemma":0.00040372182,"teacher_disagreement_score":0.0017473648,"about_ca_system_score_codex":0.0005683646,"about_ca_system_score_gemma":0.000376867,"threshold_uncertainty_score":0.009241104},"labels":[],"label_agreement":null},{"id":"W2055617028","doi":"10.1109/icc.2013.6655119","title":"An ant-swarm inspired energy-efficient ad hoc on-demand routing protocol for mobile ad hoc networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Wireless Routing Protocol; Computer network; Routing protocol; Optimized Link State Routing Protocol; Mobile ad hoc network; Wireless ad hoc network; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation); Energy (signal processing); Protocol (science); Wireless; Telecommunications; Artificial intelligence","score_opus":0.015709595911723214,"score_gpt":0.27146758778433344,"score_spread":0.2557579918726102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055617028","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045402195,0.0032276711,0.92404,0.00081458356,0.00081139704,0.00047616762,0.00026827402,0.0011077411,0.023852017],"genre_scores_gemma":[0.6381822,0.0034709969,0.33657452,0.00049879524,0.0001318702,0.0005656388,0.00068557996,0.00012303569,0.019767364],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998148,0.000048242033,0.000013274673,0.000023009248,0.00008652971,0.000014219957],"domain_scores_gemma":[0.99980205,0.00006657398,0.000028922184,0.000024640998,0.00006250571,0.00001530009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022349798,0.00036318184,0.00039055917,0.00036458953,0.00034511188,0.00047833056,0.0007793037,0.00040496356,0.00077053765],"category_scores_gemma":[0.00079703593,0.00010774954,0.00028674226,0.00063374237,0.00017234693,0.0005411165,0.0004536162,0.00046463314,0.00026813263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023997054,0.00029730587,0.0016216615,0.00067452533,0.0002041684,0.00070271763,0.00021354479,0.32121673,0.06576499,0.036907684,0.018828867,0.5533279],"study_design_scores_gemma":[0.00005291966,0.0002680328,0.000669867,0.000021552294,0.000056589142,0.00060764205,0.0000667807,0.9476241,0.0071631577,0.0068904134,0.036545206,0.000033822067],"about_ca_topic_score_codex":0.0010474524,"about_ca_topic_score_gemma":0.0029128029,"teacher_disagreement_score":0.0010474524,"about_ca_system_score_codex":0.00020797609,"about_ca_system_score_gemma":0.00043159368,"threshold_uncertainty_score":0.002577722},"labels":[],"label_agreement":null},{"id":"W2055928849","doi":"10.1007/s11276-014-0698-x","title":"Path diversified multi-QoS optimization in multi-channel wireless mesh networks","year":2014,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Distributed computing; Quality of service; Throughput; Path (computing); Channel (broadcasting); Node (physics); Bandwidth (computing); Wireless network; Wireless; Telecommunications","score_opus":0.018196145939821835,"score_gpt":0.22713272892009756,"score_spread":0.20893658298027573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055928849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07804414,0.0014430281,0.9162073,0.0004273054,0.000116734045,0.00004072793,0.00006735809,0.00017804655,0.0034753901],"genre_scores_gemma":[0.9409475,0.00048339996,0.05602441,0.000077823366,0.000089743524,0.000050790175,0.00005430817,0.00004940809,0.002222622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995783,0.00017282974,0.000014037518,0.000058824735,0.00008433755,0.00009158335],"domain_scores_gemma":[0.99894816,0.0007047139,0.00010179114,0.00005805302,0.00013503422,0.000052274605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011456694,0.00062148937,0.0007120123,0.00063233543,0.00048611683,0.0006915847,0.0010439666,0.00065440993,0.0016263307],"category_scores_gemma":[0.0023215008,0.00037438975,0.00031897906,0.0008203643,0.00048737304,0.0010522156,0.0010881289,0.00070916605,0.0001415302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086228734,0.000038193146,0.0003617488,0.00005033982,0.00003358376,0.000044162705,0.000035937323,0.9592816,0.0023721973,0.006260541,0.00076028943,0.030675042],"study_design_scores_gemma":[0.0000042818533,0.000025124984,0.00006592349,0.0000027872036,0.000005694285,0.000012582318,0.000009283124,0.9969989,0.00021068775,0.0025000481,0.0001620664,0.0000026872076],"about_ca_topic_score_codex":0.0015969161,"about_ca_topic_score_gemma":0.002282676,"teacher_disagreement_score":0.0016263307,"about_ca_system_score_codex":0.00083336217,"about_ca_system_score_gemma":0.00056044763,"threshold_uncertainty_score":0.006058991},"labels":[],"label_agreement":null},{"id":"W2056567443","doi":"10.1109/icos.2012.6417643","title":"An encrypted trust-based routing protocol","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Enhanced Interior Gateway Routing Protocol; Zone Routing Protocol; Routing protocol; Interior gateway protocol; Wireless Routing Protocol; Encryption; Link-state routing protocol; Dynamic Source Routing","score_opus":0.018034677063311282,"score_gpt":0.2877077635087601,"score_spread":0.2696730864454488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056567443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02632033,0.0009775417,0.95369446,0.0010007292,0.0006234179,0.00052197144,0.00033230518,0.0008911919,0.015637983],"genre_scores_gemma":[0.6315101,0.0021933923,0.3374868,0.0005258321,0.0002305337,0.00073188526,0.00071384106,0.00012156849,0.026486112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988085,0.000251143,0.00016608596,0.00012508714,0.0005498981,0.00009936711],"domain_scores_gemma":[0.99867177,0.00031554644,0.00020639348,0.00036798776,0.00036542257,0.000072965915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009940261,0.00032609393,0.00039982417,0.00045500326,0.0006798403,0.0012278435,0.0009863221,0.0008032569,0.0014899671],"category_scores_gemma":[0.0023460088,0.00020021705,0.00033422155,0.0006225013,0.0007329104,0.0028209155,0.001614919,0.0009857528,0.00070211885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064424035,0.00031166247,0.0013913468,0.00071225,0.0001460338,0.0030304561,0.0011905769,0.059966598,0.06850832,0.6206307,0.018450791,0.225017],"study_design_scores_gemma":[0.00025547386,0.00067763956,0.00082964706,0.0001764449,0.00022784463,0.0052822884,0.00032861013,0.47781664,0.07314258,0.17921837,0.26186922,0.00017527377],"about_ca_topic_score_codex":0.0004975257,"about_ca_topic_score_gemma":0.00040962294,"teacher_disagreement_score":0.0014899671,"about_ca_system_score_codex":0.00055817264,"about_ca_system_score_gemma":0.0010981708,"threshold_uncertainty_score":0.005256951},"labels":[],"label_agreement":null},{"id":"W2056962666","doi":"10.1109/lcn.2010.5735824","title":"Context-aware and location-based service discovery protocol for Vehicular Networks: Proof of correctness","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Service discovery; Computer science; Computer network; Correctness; Vehicular ad hoc network; Routing protocol; Network packet; Service (business); Protocol (science); Distributed computing; Wireless ad hoc network; Service provider; Wireless; Web service; World Wide Web; Telecommunications","score_opus":0.0124694994506168,"score_gpt":0.2617884701552163,"score_spread":0.2493189707045995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056962666","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006789889,0.0006274808,0.9806779,0.0018061548,0.00034823094,0.00047894634,0.00016504592,0.00096076453,0.008145525],"genre_scores_gemma":[0.46652958,0.0030673891,0.5156067,0.0015774741,0.00067788106,0.003350106,0.0007495642,0.00051658426,0.0079246815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99028355,0.0020659235,0.0006906343,0.0009003533,0.0049357763,0.0011237563],"domain_scores_gemma":[0.9780707,0.01364239,0.0009794375,0.0022875243,0.004548613,0.00047137335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074896067,0.0012053519,0.0018040636,0.0017595842,0.003139924,0.005182869,0.0030340669,0.0032238888,0.0033087332],"category_scores_gemma":[0.031752273,0.0013644757,0.0024132633,0.002087254,0.0070484006,0.0069118496,0.006741569,0.006011973,0.0015961971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001706922,0.00015788316,0.0008908534,0.000552903,0.0001162082,0.00096428726,0.00093999517,0.05170764,0.0073936414,0.88580996,0.008048501,0.043247465],"study_design_scores_gemma":[0.00046907514,0.00035194244,0.0005750458,0.00041979892,0.00025590064,0.0012129821,0.00033238847,0.36817062,0.02064853,0.54703987,0.060284432,0.0002393536],"about_ca_topic_score_codex":0.0054641366,"about_ca_topic_score_gemma":0.0027154798,"teacher_disagreement_score":0.0074896067,"about_ca_system_score_codex":0.0029476872,"about_ca_system_score_gemma":0.00767334,"threshold_uncertainty_score":0.039609313},"labels":[],"label_agreement":null},{"id":"W2057250653","doi":"10.1155/wcn/2006/51610","title":"Improving TCP Performance over Wireless Ad Hoc Networks with Busy Tone Assisted Scheme","year":2006,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria; Blackberry (Canada)","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Broadcast radiation; Hidden node problem; Multiple Access with Collision Avoidance for Wireless; Throughput; Handshake; IEEE 802.11; Wireless network; Wireless; Network packet; Optimized Link State Routing Protocol; Telecommunications; Routing protocol; Asynchronous communication; Wi-Fi array","score_opus":0.017303185507594097,"score_gpt":0.24860113429290925,"score_spread":0.23129794878531515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057250653","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7355942,0.0036134098,0.2532201,0.00032788535,0.00023412917,0.00013528897,0.000050520637,0.0020975207,0.0047268947],"genre_scores_gemma":[0.98790085,0.00045849712,0.011129406,0.000029538907,0.000060591,0.00002909493,0.000019888057,0.000020190404,0.00035191962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895334,0.00038836818,0.00007063334,0.00008531219,0.0002808072,0.00022153446],"domain_scores_gemma":[0.9962799,0.0020246066,0.0003002711,0.0004092334,0.0008174406,0.00016852199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020519393,0.0007209524,0.00078293274,0.0010884404,0.00092944165,0.0013421336,0.0007656738,0.00057735114,0.0004754311],"category_scores_gemma":[0.0072807223,0.00027665807,0.0002256759,0.0008826463,0.0007571053,0.0015490125,0.0010391194,0.00062412996,0.0001677151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022134269,0.00061767915,0.0117302025,0.0005374687,0.00029286754,0.0015296492,0.0010576595,0.45875832,0.20959553,0.016125347,0.0036496616,0.2938922],"study_design_scores_gemma":[0.000097329634,0.0006853153,0.0015060373,0.000032431777,0.00017510664,0.00035011893,0.00010999208,0.9616435,0.029574044,0.0034983975,0.002260278,0.00006735259],"about_ca_topic_score_codex":0.0011303729,"about_ca_topic_score_gemma":0.0009427089,"teacher_disagreement_score":0.0020519393,"about_ca_system_score_codex":0.00067986624,"about_ca_system_score_gemma":0.00066014664,"threshold_uncertainty_score":0.0108518},"labels":[],"label_agreement":null},{"id":"W2057847169","doi":"10.1007/s11277-013-1057-4","title":"Packet Delay in UAV Wireless Networks Under Non-saturated Traffic and Channel Fading Conditions","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Computer science; Fading; Computer network; Channel (broadcasting); Network packet; Wireless; Wireless network; Real-time computing; Telecommunications","score_opus":0.02179871210987819,"score_gpt":0.25712047352079054,"score_spread":0.23532176141091235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057847169","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9340306,0.0016294899,0.059033353,0.0003873764,0.000089158275,0.000028060089,0.0002045081,0.00012639529,0.0044710445],"genre_scores_gemma":[0.9980665,0.00030081274,0.00089580746,0.000011308035,0.000013001896,0.000005019897,0.000035299166,0.000009150594,0.0006631451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996728,0.00007620405,0.000011524934,0.00005442439,0.00006696913,0.00011812635],"domain_scores_gemma":[0.9947541,0.0040944647,0.0003148309,0.000087414446,0.00059825164,0.00015088286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009137308,0.00031430522,0.0004893174,0.0007340166,0.0005971222,0.0009653451,0.00062411686,0.00051233184,0.0010313482],"category_scores_gemma":[0.007080551,0.00033716267,0.00013615131,0.0008239983,0.0008024253,0.0012828154,0.00047896474,0.00036947653,0.00009764964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005437559,0.00006181339,0.006834036,0.00015092285,0.000033006338,0.0006188698,0.00021359601,0.9525152,0.00857385,0.018435204,0.0011022303,0.010917468],"study_design_scores_gemma":[0.000008870752,0.00005502444,0.0014855751,0.000007992716,0.000015606234,0.00011608164,0.000130836,0.9943764,0.0013066536,0.0023285432,0.00016051794,0.000007914966],"about_ca_topic_score_codex":0.0077573317,"about_ca_topic_score_gemma":0.0062913294,"teacher_disagreement_score":0.0077573317,"about_ca_system_score_codex":0.0024351557,"about_ca_system_score_gemma":0.0006814698,"threshold_uncertainty_score":0.017668426},"labels":[],"label_agreement":null},{"id":"W2057925838","doi":"10.1109/wimob.2010.5644866","title":"A new algorithm for backbone formation in ad hoc wireless networks of nodes with different transmission ranges","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Ad hoc wireless distribution service; Mobile ad hoc network; Optimized Link State Routing Protocol; Transmission (telecommunications); Vehicular ad hoc network; Wireless; Distributed computing; Telecommunications; Network packet","score_opus":0.00770794741649661,"score_gpt":0.2169920274630271,"score_spread":0.20928408004653049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057925838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026363211,0.0001563871,0.9954489,0.000081160964,0.000071727445,0.00011365887,0.000026908081,0.00038774585,0.0010772126],"genre_scores_gemma":[0.034478493,0.00019182322,0.9626438,0.00009365394,0.00006106274,0.00038190206,0.00019414692,0.0000964487,0.0018586923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891555,0.00023480166,0.000079235695,0.00022762836,0.00044146905,0.000101427446],"domain_scores_gemma":[0.99872017,0.00049998617,0.00010587184,0.00025757414,0.0003189431,0.000097523116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013077778,0.001086277,0.0012488075,0.0013758275,0.0014182153,0.001294968,0.003270126,0.001400787,0.0023815685],"category_scores_gemma":[0.0041605486,0.00055403035,0.0007237735,0.0017298572,0.0009701941,0.0039032712,0.0027241977,0.0014976356,0.0010229469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022280343,0.00023823872,0.0007387534,0.00027804307,0.0001248812,0.00017552405,0.0003702787,0.27995324,0.010385926,0.06460948,0.0100929495,0.63280994],"study_design_scores_gemma":[0.00016877461,0.00020975753,0.00015251586,0.000029630117,0.000040162104,0.00028039527,0.00007788961,0.93973434,0.0037556314,0.033143643,0.022373881,0.000033370507],"about_ca_topic_score_codex":0.0018984582,"about_ca_topic_score_gemma":0.0020686206,"teacher_disagreement_score":0.003270126,"about_ca_system_score_codex":0.0009101948,"about_ca_system_score_gemma":0.0014311601,"threshold_uncertainty_score":0.007967114},"labels":[],"label_agreement":null},{"id":"W2058194282","doi":"10.1109/eit.2006.252218","title":"Security Routing in MANETs - A Comparative Study","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Quality of service; Adaptive quality of service multi-hop routing; Popularity; Variety (cybernetics); Vehicular ad hoc network; Key (lock); Routing protocol; Computer security; Optimized Link State Routing Protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.017819790372320034,"score_gpt":0.26980293348782886,"score_spread":0.25198314311550885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058194282","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3934348,0.2991156,0.07809331,0.0030973866,0.001440817,0.00022778452,0.00039125312,0.0003510269,0.22384806],"genre_scores_gemma":[0.84487855,0.12820418,0.013221209,0.00026008903,0.0008671205,0.00003683106,0.00035371058,0.000058918828,0.012119546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991704,0.0003212707,0.00005219691,0.00006966916,0.0003037761,0.0000827094],"domain_scores_gemma":[0.99730337,0.0017791071,0.00016987411,0.00016470464,0.00048868184,0.000094247596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015619186,0.0003308901,0.0004239302,0.0027818403,0.00040074208,0.0016093786,0.00040067165,0.0005664539,0.0023514312],"category_scores_gemma":[0.002712451,0.00011242958,0.00031114547,0.0031826529,0.00043333296,0.0024790212,0.0005460274,0.00036457268,0.00045777627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007410693,0.00035820683,0.016460255,0.001934329,0.000249781,0.0008419018,0.0007026358,0.14256114,0.0059707128,0.13776024,0.009236431,0.68318325],"study_design_scores_gemma":[0.00013001975,0.0063786586,0.041213304,0.0017798569,0.00075741,0.009068037,0.0052351328,0.42218485,0.01604923,0.09154635,0.4054616,0.00019552089],"about_ca_topic_score_codex":0.00061705156,"about_ca_topic_score_gemma":0.0005642935,"teacher_disagreement_score":0.0027818403,"about_ca_system_score_codex":0.00071946956,"about_ca_system_score_gemma":0.0002866627,"threshold_uncertainty_score":0.008260369},"labels":[],"label_agreement":null},{"id":"W2058404798","doi":"10.1007/s00453-012-9675-x","title":"Emergency Connectivity in Ad-hoc Networks with Selfish Nodes","year":2012,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Nash equilibrium; Node (physics); Wireless ad hoc network; Computer network; Protocol (science); Theory of computation; Distributed computing; Wireless; Mathematical economics; Mathematics; Algorithm; Telecommunications","score_opus":0.009540126623217722,"score_gpt":0.22669043386852836,"score_spread":0.21715030724531065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058404798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21507809,0.0020482405,0.7676528,0.001683449,0.0002271213,0.00016008306,0.00012618728,0.00024116557,0.012782918],"genre_scores_gemma":[0.952965,0.0010580979,0.039480355,0.00012370327,0.00013515328,0.00012649826,0.000117532116,0.000040334602,0.0059531974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941397,0.00023693703,0.000031474952,0.00010467794,0.000120013974,0.00009296276],"domain_scores_gemma":[0.9955642,0.0034136283,0.0003783789,0.00020365867,0.000251459,0.0001887138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011278866,0.00035655926,0.0006082156,0.00079280045,0.0011928901,0.0016783001,0.0012366557,0.0010458471,0.0025032228],"category_scores_gemma":[0.0072757816,0.00043595626,0.00028525645,0.00097352004,0.0013571752,0.0026964045,0.0014840305,0.0008745977,0.00026689284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005186582,0.00020036829,0.0055937464,0.00043204287,0.00008452452,0.0010617976,0.0010914003,0.611557,0.0058365297,0.27478647,0.00684199,0.09199547],"study_design_scores_gemma":[0.000047017627,0.00012788373,0.0006976128,0.000028492675,0.000039651455,0.00038559892,0.00038887814,0.8481152,0.00090233394,0.14592436,0.0033243306,0.00001857824],"about_ca_topic_score_codex":0.0007069262,"about_ca_topic_score_gemma":0.0009851796,"teacher_disagreement_score":0.0025032228,"about_ca_system_score_codex":0.0004931051,"about_ca_system_score_gemma":0.00046025083,"threshold_uncertainty_score":0.008374095},"labels":[],"label_agreement":null},{"id":"W2058439768","doi":"10.4018/ijbdcn.2013100102","title":"Cross-Layered Secure and QoS Aware Design of VOIP over Wireless Ad-Hoc Networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Business Data Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Voice over IP; Computer network; Quality of service; Protocol stack; Wireless ad hoc network; Mobile communications over IP; Denial-of-service attack; Jamming; Ad hoc wireless distribution service; Wireless; Optimized Link State Routing Protocol; Telecommunications; Mobile radio; Mobile telephony; Wireless sensor network","score_opus":0.055594482186297534,"score_gpt":0.3088967152171799,"score_spread":0.25330223303088234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058439768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019444052,0.00049483235,0.9766427,0.00013904778,0.00010683075,0.00013302152,0.000014508315,0.00057126046,0.0024536173],"genre_scores_gemma":[0.6044491,0.00086649647,0.3909107,0.00018912382,0.000077172524,0.00030835086,0.0000805191,0.00017119563,0.002947319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865675,0.00033940806,0.00013481393,0.00013728988,0.00057096255,0.00016086565],"domain_scores_gemma":[0.9991454,0.00014375319,0.00012244457,0.0001306745,0.00036558489,0.00009224416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017256448,0.00055206125,0.000369781,0.00046764847,0.00049479917,0.0014899636,0.0015040196,0.00061498286,0.0006688744],"category_scores_gemma":[0.0020208133,0.0005839727,0.0005869807,0.00023044209,0.000609605,0.0011207162,0.0012694194,0.001339803,0.00028969703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034527876,0.00021695025,0.0024282348,0.00052295753,0.000477248,0.0011626434,0.00092133525,0.40404505,0.2801056,0.117401876,0.0024295805,0.18994331],"study_design_scores_gemma":[0.000029804522,0.00027208263,0.00056317245,0.00005224694,0.00016437667,0.00040477994,0.00008804165,0.92836267,0.044596653,0.010748027,0.014661375,0.000056797795],"about_ca_topic_score_codex":0.000938352,"about_ca_topic_score_gemma":0.0011480806,"teacher_disagreement_score":0.0017256448,"about_ca_system_score_codex":0.00061374524,"about_ca_system_score_gemma":0.00094568933,"threshold_uncertainty_score":0.009126186},"labels":[],"label_agreement":null},{"id":"W2058530950","doi":"10.1109/icsnc.2010.42","title":"Investigation of Channel Formation in a MANET","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Mobile ad hoc network; Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Routing protocol; Node (physics); Benchmark (surveying); Channel (broadcasting); Wireless ad hoc network; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless; Engineering; Telecommunications; Geography","score_opus":0.01526742308903529,"score_gpt":0.2134899014631434,"score_spread":0.1982224783741081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058530950","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84015054,0.0009048003,0.14782164,0.0002516679,0.00008153032,0.00012649408,0.000107103784,0.00036729084,0.010188974],"genre_scores_gemma":[0.98873025,0.0002387194,0.009868197,0.000025817271,0.000014684994,0.0000208644,0.00006186819,0.000019942852,0.0010195598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933547,0.0002408406,0.000016419259,0.000083604835,0.0002183717,0.00010524909],"domain_scores_gemma":[0.9960448,0.0025257648,0.0003926882,0.00028418814,0.0005783182,0.0001741922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067465584,0.00026371362,0.0003377657,0.0006423411,0.000501384,0.0006420433,0.00041713958,0.0004069368,0.0009545216],"category_scores_gemma":[0.003607483,0.00022901967,0.00023731239,0.0006033849,0.00076311955,0.0010822616,0.00048596025,0.0003557164,0.00017636098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003030423,0.00020029607,0.014512603,0.00015033505,0.00006210269,0.0006016459,0.00031071628,0.90641826,0.0407374,0.014159976,0.00064356334,0.02190008],"study_design_scores_gemma":[0.000021775417,0.00046094935,0.003363442,0.0000120816,0.000027746888,0.00043224552,0.00019054404,0.9789175,0.012199158,0.0029557513,0.0013934952,0.00002522324],"about_ca_topic_score_codex":0.0012449026,"about_ca_topic_score_gemma":0.0008154216,"teacher_disagreement_score":0.0012449026,"about_ca_system_score_codex":0.00039836686,"about_ca_system_score_gemma":0.00049219903,"threshold_uncertainty_score":0.003567934},"labels":[],"label_agreement":null},{"id":"W2058624236","doi":"10.1109/wcnc.2010.5506547","title":"Novel Resource Management Approach for End-To-End QoS Support in Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Computer network; End-to-end principle; Wireless mesh network; Wireless; Resource management (computing); Resource allocation; Reuse; Distributed computing; Radio resource management; Wireless network; Telecommunications; Engineering","score_opus":0.014189068902836497,"score_gpt":0.2332084576185591,"score_spread":0.2190193887157226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058624236","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006797225,0.00040910632,0.99025667,0.00015765583,0.00007376647,0.000040454743,0.0000119412125,0.00015078814,0.0021023965],"genre_scores_gemma":[0.4558474,0.0007354913,0.5381578,0.0002769143,0.00027806536,0.0002512866,0.00006866685,0.000042325406,0.004342075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996538,0.00009291114,0.00002598822,0.00006105913,0.00013010019,0.00003608434],"domain_scores_gemma":[0.99984133,0.000058769274,0.00001640964,0.000029289416,0.00004240762,0.000011757409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004958135,0.00032449802,0.00030639875,0.00031578023,0.0004720762,0.00053799845,0.001213311,0.00047404674,0.0009602482],"category_scores_gemma":[0.00059413497,0.00012561462,0.00020162435,0.00024657632,0.00033595125,0.0011603732,0.0006749768,0.00061592343,0.00023351805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020323372,0.00032938263,0.00087046175,0.00030266345,0.000104796694,0.0004346114,0.00026156096,0.13928016,0.13634504,0.225147,0.006671271,0.49004987],"study_design_scores_gemma":[0.000031395997,0.0001103872,0.00034167885,0.000018053723,0.000039378916,0.00029413463,0.000045422734,0.94423157,0.016641572,0.023861676,0.014351269,0.00003345738],"about_ca_topic_score_codex":0.0004023084,"about_ca_topic_score_gemma":0.0008462972,"teacher_disagreement_score":0.001213311,"about_ca_system_score_codex":0.00041101346,"about_ca_system_score_gemma":0.00041491215,"threshold_uncertainty_score":0.0032123923},"labels":[],"label_agreement":null},{"id":"W2058968692","doi":"10.1016/j.adhoc.2010.02.004","title":"Energy-efficient proactive routing in MANET: Energy metrics accuracy","year":2010,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Optimized Link State Routing Protocol; Computer science; Routing protocol; Computer network; Link-state routing protocol; Wireless Routing Protocol; Zone Routing Protocol; Dynamic Source Routing; Mobile ad hoc network; Network packet; Distributed computing","score_opus":0.009895786335319678,"score_gpt":0.22909054498256246,"score_spread":0.21919475864724278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058968692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08134965,0.006180093,0.90456456,0.0011515919,0.0003031184,0.00005376147,0.0002567415,0.0006929913,0.005447384],"genre_scores_gemma":[0.8994279,0.002107021,0.094879106,0.00010775515,0.00018105183,0.000036869656,0.0002885512,0.00009009558,0.0028815963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988937,0.00031355518,0.00007610684,0.0001461716,0.00050967984,0.000060820294],"domain_scores_gemma":[0.99573827,0.0020102304,0.00041679962,0.000694416,0.0010745185,0.00006586952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025074554,0.0006085827,0.000929434,0.0015087547,0.00044558014,0.0014476363,0.0012802015,0.0008754377,0.00077612174],"category_scores_gemma":[0.012781863,0.0003467906,0.00027460308,0.0020250634,0.0004703494,0.003117857,0.0012331348,0.0007792272,0.00032225918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029614795,0.00009176448,0.008959164,0.00015740558,0.00010714163,0.00008295751,0.00009338003,0.72864836,0.0051591005,0.028662818,0.002836607,0.2249051],"study_design_scores_gemma":[0.000005891579,0.000056062334,0.0013377833,0.0000190462,0.000025075567,0.0000915922,0.000030999116,0.98476124,0.0032684596,0.009103058,0.0012897553,0.000011122505],"about_ca_topic_score_codex":0.0016106992,"about_ca_topic_score_gemma":0.0021477665,"teacher_disagreement_score":0.0025074554,"about_ca_system_score_codex":0.0010077731,"about_ca_system_score_gemma":0.00065598293,"threshold_uncertainty_score":0.013260841},"labels":[],"label_agreement":null},{"id":"W2058985310","doi":"10.1109/inss.2007.4297436","title":"Fuzzy Inferno and Nostalgic Cow: Two Practical Applications for Ad-Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Communications Research Centre Canada","funders":"","keywords":"Wireless ad hoc network; Computer science; Fuzzy logic; Mobile ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Protocol (science); Routing protocol; Computer network; Wireless; Vehicular ad hoc network; Routing (electronic design automation); Post hoc; Artificial intelligence; Network packet; Telecommunications","score_opus":0.017877329637342284,"score_gpt":0.30919843569026084,"score_spread":0.29132110605291855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058985310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03832987,0.002514083,0.9139092,0.004532191,0.00022456497,0.00010899749,0.00010015326,0.00016654086,0.040114444],"genre_scores_gemma":[0.52124953,0.002967814,0.46144906,0.0007435395,0.00039908203,0.00013208447,0.00008044632,0.000030148074,0.012948281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991053,0.00033009148,0.000045208584,0.00010847541,0.00033297468,0.00007782492],"domain_scores_gemma":[0.9974304,0.0018842844,0.0001223628,0.00019096777,0.00027047185,0.000101506586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016355055,0.00039269956,0.00031192185,0.0008781809,0.0011297904,0.0015141064,0.00081108644,0.0019228562,0.0028298292],"category_scores_gemma":[0.0067021362,0.00022542279,0.00044812824,0.0010122032,0.002528148,0.0019202424,0.0015783748,0.0013914978,0.00024451216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014609142,0.0000833322,0.0014137315,0.00024049036,0.000027921069,0.0008007635,0.001148914,0.03473177,0.0023124213,0.8372757,0.0044076634,0.117411256],"study_design_scores_gemma":[0.0000282549,0.000107561704,0.0008824661,0.00006751754,0.000022143478,0.0009059189,0.0007242894,0.19263385,0.0035083136,0.7702823,0.030787826,0.000049570644],"about_ca_topic_score_codex":0.0023874308,"about_ca_topic_score_gemma":0.0032493009,"teacher_disagreement_score":0.0028298292,"about_ca_system_score_codex":0.0009336896,"about_ca_system_score_gemma":0.000570714,"threshold_uncertainty_score":0.009466708},"labels":[],"label_agreement":null},{"id":"W2059627763","doi":"10.1002/wcm.718","title":"Optimal fault‐tolerant broadcasting in wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Wireless mesh network; Schedule; Fault tolerance; Network topology; Scheduling (production processes); Distributed computing; Wireless; Node (physics); Wireless network; Topology (electrical circuits); Telecommunications; Mathematical optimization; Mathematics","score_opus":0.01715625996090244,"score_gpt":0.2672746520109881,"score_spread":0.2501183920500857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059627763","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29686657,0.0010919038,0.695886,0.0006849253,0.00008148185,0.000080199,0.00020835394,0.0003640209,0.004736482],"genre_scores_gemma":[0.9473701,0.00039104454,0.0510382,0.00004075691,0.000037938276,0.0000641324,0.00013434033,0.00003506386,0.0008883724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.00016267251,0.000024137687,0.00006278664,0.00008937289,0.000088385175],"domain_scores_gemma":[0.99838483,0.0009790196,0.0002559936,0.00014480988,0.0001609974,0.000074265496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000774355,0.00029724036,0.000507585,0.00040431783,0.00047403979,0.00044650113,0.0007896804,0.00039803053,0.0007484323],"category_scores_gemma":[0.0039034311,0.00029467102,0.00021620982,0.00050980825,0.00048926077,0.0008073693,0.0005161591,0.00029931113,0.000111923735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027376576,0.000037603022,0.0006152603,0.0001523075,0.000027267622,0.00007255918,0.000104091174,0.9353304,0.008287713,0.024600856,0.0017210174,0.028777165],"study_design_scores_gemma":[0.000041017025,0.00006027181,0.00023390276,0.000006521845,0.000009527286,0.000028339276,0.000039724557,0.97869086,0.001764717,0.018427927,0.00069156825,0.0000056234153],"about_ca_topic_score_codex":0.0021977925,"about_ca_topic_score_gemma":0.0015031985,"teacher_disagreement_score":0.0021977925,"about_ca_system_score_codex":0.00089728803,"about_ca_system_score_gemma":0.000696233,"threshold_uncertainty_score":0.0065103173},"labels":[],"label_agreement":null},{"id":"W2059695363","doi":"10.1007/s11277-013-1278-6","title":"SDR: A Stable Direction-Based Routing for Vehicular Ad Hoc Networks","year":2013,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Optimized Link State Routing Protocol; Distributed computing; Routing protocol; Wireless Routing Protocol; Network packet","score_opus":0.023473064941676176,"score_gpt":0.2558307683675451,"score_spread":0.23235770342586892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059695363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008760562,0.000597479,0.9625955,0.00017939488,0.00045827348,0.00031578605,0.0007541715,0.022008575,0.0043302975],"genre_scores_gemma":[0.24514017,0.0015063006,0.7266494,0.00028377754,0.0002180712,0.00050266774,0.005328861,0.0017295171,0.01864117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999305,0.00015010458,0.00004707596,0.000088483444,0.00033168241,0.00007765164],"domain_scores_gemma":[0.9994593,0.00011100797,0.000046121728,0.0001427818,0.0001706749,0.00007013114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009815276,0.0007636623,0.0007355294,0.0011292847,0.0005386388,0.0009064275,0.0016348127,0.000562917,0.0035658216],"category_scores_gemma":[0.0014953428,0.00035587346,0.0005115982,0.0010057503,0.00037785218,0.0010278842,0.0012176856,0.000781499,0.0020731231],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088872644,0.00026461258,0.001420865,0.0005641683,0.00014094029,0.0002969858,0.00022666196,0.101944745,0.045723572,0.04017014,0.05687399,0.7514846],"study_design_scores_gemma":[0.00045448405,0.00067157496,0.0007233782,0.000049367543,0.00010778194,0.00044252336,0.000083919695,0.8459662,0.02790847,0.016088648,0.10737583,0.00012769991],"about_ca_topic_score_codex":0.0023840293,"about_ca_topic_score_gemma":0.004007325,"teacher_disagreement_score":0.0035658216,"about_ca_system_score_codex":0.00045757863,"about_ca_system_score_gemma":0.0011570856,"threshold_uncertainty_score":0.011928856},"labels":[],"label_agreement":null},{"id":"W2059986173","doi":"10.1016/j.tcs.2012.07.021","title":"Optimal gathering in radio grids with interference","year":2012,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Upper and lower bounds; Combinatorics; Node (physics); Computer science; Constant (computer programming); Discrete mathematics; Matching (statistics); Graph; Mathematics; Communication source; Grid; Hexagonal tiling; Set (abstract data type); Computer network; Physics","score_opus":0.009171511087821072,"score_gpt":0.22917257095054375,"score_spread":0.22000105986272267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059986173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14565866,0.0009564068,0.83703554,0.0011781368,0.00012986196,0.00010585529,0.00014333671,0.00029967926,0.014492608],"genre_scores_gemma":[0.93339974,0.00067374605,0.05896792,0.00012283144,0.0001130806,0.00011095308,0.00011256027,0.00010442061,0.0063948208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990221,0.00044299444,0.00003803014,0.00014567755,0.00014723079,0.00020399939],"domain_scores_gemma":[0.9940989,0.004434183,0.0005612821,0.0002566401,0.00031958573,0.00032948595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001476116,0.000884062,0.0015992724,0.0010948292,0.001159909,0.001597326,0.0015593442,0.0010958272,0.0024326653],"category_scores_gemma":[0.008472255,0.0009809621,0.0005855438,0.0013713796,0.0019179874,0.0021142743,0.002277049,0.0010064619,0.00026814287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025688103,0.00006384403,0.0006988823,0.00012810416,0.000038615275,0.00012039128,0.0001428161,0.910564,0.0013596616,0.07233967,0.0017504089,0.01253685],"study_design_scores_gemma":[0.000037728136,0.000039130126,0.00013886826,0.000008302145,0.000010916253,0.000041537973,0.00005662686,0.9364246,0.00031103397,0.062465247,0.00045732225,0.00000862411],"about_ca_topic_score_codex":0.0031920082,"about_ca_topic_score_gemma":0.0024926944,"teacher_disagreement_score":0.0031920082,"about_ca_system_score_codex":0.001340909,"about_ca_system_score_gemma":0.0009222053,"threshold_uncertainty_score":0.009729028},"labels":[],"label_agreement":null},{"id":"W2060581776","doi":"10.1007/s11277-010-9978-7","title":"Resilient Security Mechanism for Wireless Ad hoc Network","year":2010,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Wireless network; Mobile ad hoc network; Robustness (evolution); Vehicular ad hoc network; Distributed computing; Wireless; Computer security; Telecommunications","score_opus":0.020883936162565096,"score_gpt":0.2738863199502887,"score_spread":0.2530023837877236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060581776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090185866,0.0020497488,0.88917786,0.001247385,0.00090945483,0.0003425363,0.00016865037,0.0048902794,0.011028158],"genre_scores_gemma":[0.8905294,0.00061828125,0.10015587,0.0003745419,0.00024772025,0.0002291154,0.00020192133,0.00008340678,0.007559777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987889,0.0002492367,0.00010811413,0.00020972769,0.0004187649,0.00022532599],"domain_scores_gemma":[0.9978103,0.0004434557,0.0002637596,0.00093707204,0.0004113383,0.00013420652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015432943,0.0007297769,0.00054888014,0.0015626469,0.0014065559,0.0011556239,0.0020017494,0.001062323,0.0028622795],"category_scores_gemma":[0.0027205972,0.0003420129,0.00057566096,0.00057849137,0.0009901234,0.0030140022,0.0022987723,0.0017756028,0.0006820211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014323631,0.0003786243,0.0018028322,0.0005586491,0.00027906825,0.001088177,0.0008254979,0.065938845,0.14047056,0.51861376,0.021656932,0.24695471],"study_design_scores_gemma":[0.00036088965,0.001331818,0.0016990796,0.00018952043,0.00041208763,0.0023564638,0.00034639923,0.595,0.12278014,0.21776506,0.05746849,0.00028998408],"about_ca_topic_score_codex":0.00036695917,"about_ca_topic_score_gemma":0.00028984345,"teacher_disagreement_score":0.0028622795,"about_ca_system_score_codex":0.00079363264,"about_ca_system_score_gemma":0.0007390442,"threshold_uncertainty_score":0.009575248},"labels":[],"label_agreement":null},{"id":"W2060910226","doi":"10.5539/cis.v7n2p99","title":"Traffic Priority Based Adaptive and Responsive Congestion and Rate Control for Wireless Mesh Networks","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Network congestion; Network traffic control; Jitter; Flow control (data); Throughput; Wireless mesh network; Buffer overflow; Network packet; Wireless network; Real-time computing; Wireless; Telecommunications","score_opus":0.008798941149864185,"score_gpt":0.22274250175323718,"score_spread":0.213943560603373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060910226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031074315,0.00069841905,0.9655434,0.000172788,0.00016558156,0.00007716327,0.000028874369,0.00075578166,0.0014836119],"genre_scores_gemma":[0.9283015,0.00035757528,0.0700151,0.00007744968,0.00012212944,0.000088755354,0.000047159778,0.00004896042,0.0009413449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993765,0.00017413798,0.000049679227,0.000110171,0.00020916894,0.00008033323],"domain_scores_gemma":[0.99881136,0.0005254623,0.00017733828,0.00010137954,0.00031955555,0.00006489193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014008511,0.00047862701,0.00048214418,0.00071246503,0.00048012537,0.00068961154,0.0013850841,0.00040114476,0.0005706479],"category_scores_gemma":[0.0040453584,0.00020061548,0.00029626145,0.00046151655,0.0003827439,0.0008610885,0.00059328246,0.0006419971,0.00011689403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040897215,0.0002603221,0.0021101057,0.0001915131,0.000091425005,0.00020413856,0.00024415943,0.64005506,0.05291292,0.027182678,0.003348383,0.27299032],"study_design_scores_gemma":[0.00001715393,0.00006287257,0.00019384996,0.000004225605,0.000013541939,0.000032713026,0.000011648659,0.99380106,0.0023054967,0.002866766,0.00068039243,0.000010388076],"about_ca_topic_score_codex":0.002192974,"about_ca_topic_score_gemma":0.0020636045,"teacher_disagreement_score":0.002192974,"about_ca_system_score_codex":0.00072090805,"about_ca_system_score_gemma":0.00063674833,"threshold_uncertainty_score":0.0074085593},"labels":[],"label_agreement":null},{"id":"W2061166666","doi":"10.1109/wcnc.2014.6952444","title":"Significantly reducing the number of frequency channels required for wireless mesh networks using beamforming","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Switched mesh; Computer science; Shared mesh; Directional antenna; Beamforming; Node (physics); Computer network; Channel (broadcasting); Mesh networking; Interference (communication); Antenna (radio); Order One Network Protocol; Wireless; Electronic engineering; Wireless network; Telecommunications; Engineering; Acoustics; Physics","score_opus":0.024750334417397088,"score_gpt":0.2680324137395864,"score_spread":0.24328207932218932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061166666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031780414,0.00040984177,0.9635354,0.00015142282,0.000053249896,0.0000262636,0.00003409069,0.0005836423,0.0034256137],"genre_scores_gemma":[0.53736186,0.0006587103,0.4588914,0.00012677046,0.000076030396,0.000116109775,0.00014566886,0.00007855638,0.002544892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999493,0.0001810122,0.000024173429,0.000062756146,0.0001588796,0.00008023755],"domain_scores_gemma":[0.99882597,0.00068119226,0.00012272815,0.00015236318,0.0001780416,0.000039684193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033968792,0.00079579774,0.00037964465,0.00042319312,0.00042228037,0.00033104152,0.00052011036,0.00041478005,0.0023730577],"category_scores_gemma":[0.001738046,0.0002098639,0.00029165603,0.00063203176,0.0003065916,0.0011223899,0.0006582732,0.00046035636,0.0007119126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026180758,0.00017119409,0.001638378,0.0002739207,0.000058061174,0.00015572252,0.00013745013,0.2980759,0.22754401,0.02043009,0.0034527995,0.44780073],"study_design_scores_gemma":[0.000030398793,0.0002804155,0.0010148943,0.00002776598,0.000036245314,0.00031709552,0.00010816498,0.93575984,0.048758257,0.0074551497,0.0061795814,0.000032138345],"about_ca_topic_score_codex":0.0010951322,"about_ca_topic_score_gemma":0.002207394,"teacher_disagreement_score":0.0023730577,"about_ca_system_score_codex":0.0004166261,"about_ca_system_score_gemma":0.0006049607,"threshold_uncertainty_score":0.007938683},"labels":[],"label_agreement":null},{"id":"W2061257005","doi":"10.1007/s00453-014-9908-2","title":"Routing Regardless of Network Stability","year":2014,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Network packet; Computer science; Computer network; Routing protocol; Routing table; Theory of computation; Routing (electronic design automation); Equal-cost multi-path routing; Source routing; Combinatorics; Mathematics; Algorithm","score_opus":0.011345311787612337,"score_gpt":0.21588224654259291,"score_spread":0.20453693475498058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061257005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3262554,0.0025454958,0.5613184,0.016768347,0.001603666,0.00026942056,0.0007424468,0.0011513093,0.08934556],"genre_scores_gemma":[0.9572437,0.00067562493,0.02347279,0.00081331364,0.0006133821,0.00013248288,0.00023265865,0.00027627157,0.01653982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791557,0.0005764049,0.000082358834,0.0006461406,0.0004437244,0.00033586886],"domain_scores_gemma":[0.9811998,0.009515369,0.0017988455,0.0036409777,0.0024394137,0.001405653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029722885,0.0006729198,0.0011868271,0.0015705363,0.0029278884,0.0045036846,0.002147932,0.0021132445,0.0089396825],"category_scores_gemma":[0.03222627,0.00063257565,0.0006477303,0.0011562384,0.0027945812,0.012168061,0.004543508,0.0033839683,0.0015775289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009344676,0.00016734247,0.004081849,0.0002553007,0.00015785133,0.00039456045,0.00051042484,0.058032386,0.0071111703,0.8441613,0.015570388,0.06862295],"study_design_scores_gemma":[0.00007921834,0.00016534314,0.0010290836,0.00004844516,0.00009410462,0.00054882263,0.00031974234,0.22327548,0.003612725,0.7638915,0.0068939617,0.00004148918],"about_ca_topic_score_codex":0.00048141126,"about_ca_topic_score_gemma":0.0006567373,"teacher_disagreement_score":0.0089396825,"about_ca_system_score_codex":0.001361035,"about_ca_system_score_gemma":0.0014208258,"threshold_uncertainty_score":0.029906213},"labels":[],"label_agreement":null},{"id":"W2061503051","doi":"10.1145/1454503.1454569","title":"Centralized feedback-driven rate allocation mechanism for CSMA/CA-based wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless mesh network; Firmware; Computer science; Computer network; Overhead (engineering); Wireless; Wireless network; Mesh networking; Carrier sense multiple access with collision avoidance; Distributed computing; Throughput; Telecommunications; Operating system","score_opus":0.017601711191887345,"score_gpt":0.23092230901003727,"score_spread":0.21332059781814994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061503051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059832178,0.0006273363,0.9336875,0.00026951105,0.00030644282,0.00016774921,0.000052040232,0.0025986861,0.0024585489],"genre_scores_gemma":[0.96330506,0.00012455015,0.03501998,0.00008813494,0.000112564834,0.00010176545,0.000030588242,0.00002554072,0.0011918057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.00020727143,0.00008058893,0.0002646611,0.00038565826,0.00013102911],"domain_scores_gemma":[0.9976961,0.00075042294,0.00036025335,0.0005045088,0.0005518295,0.00013684256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023919493,0.00044348658,0.0006623827,0.00053255784,0.0007762822,0.0010242903,0.0027388912,0.0006472348,0.0015401527],"category_scores_gemma":[0.0054405136,0.00028271464,0.00023752837,0.00037434392,0.0007234183,0.0010835305,0.00081756857,0.0009976251,0.00036609173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018039107,0.0008482886,0.0029234923,0.0003688435,0.00022507871,0.00038524668,0.00086201786,0.2771749,0.22600491,0.09474788,0.009322926,0.38533252],"study_design_scores_gemma":[0.00018564568,0.00022481795,0.00053601677,0.000013886336,0.000044474895,0.00013239565,0.000032157634,0.96134806,0.024057249,0.010571682,0.0028001308,0.000053524724],"about_ca_topic_score_codex":0.001517744,"about_ca_topic_score_gemma":0.0016431451,"teacher_disagreement_score":0.0027388912,"about_ca_system_score_codex":0.00087318546,"about_ca_system_score_gemma":0.0012809364,"threshold_uncertainty_score":0.012650013},"labels":[],"label_agreement":null},{"id":"W2061572891","doi":"10.1016/j.jda.2006.07.001","title":"Broadcasting in geometric radio networks","year":2006,"lang":"en","type":"article","venue":"Journal of Discrete Algorithms","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Node (physics); Computer science; Transmitter; RADIUS; Computer network; Range (aeronautics); Topology (electrical circuits); Telecommunications; Mathematics; Physics; Combinatorics; Engineering","score_opus":0.008412946655087569,"score_gpt":0.22873498992787675,"score_spread":0.22032204327278918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061572891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16372268,0.005384529,0.77469116,0.004771627,0.0006369691,0.00014895992,0.00026819741,0.00064998644,0.049725868],"genre_scores_gemma":[0.88601685,0.0050740223,0.08111967,0.0005247205,0.0008289749,0.00018240421,0.00046665827,0.00020183586,0.025584748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.00044192764,0.000037002217,0.0001490207,0.00027412028,0.00016167006],"domain_scores_gemma":[0.9935138,0.0047466466,0.0005900177,0.0003576088,0.00045611296,0.00033579057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011467296,0.00058185065,0.0014284315,0.001805694,0.0014482484,0.0023754858,0.0018879746,0.001612678,0.0053692544],"category_scores_gemma":[0.01041677,0.000798787,0.00055480504,0.0025147398,0.002577358,0.0032633627,0.00207565,0.0019142702,0.0007385018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024049862,0.000067798625,0.0008267633,0.00021165592,0.00004668035,0.00013151318,0.00037078196,0.2337213,0.0025859785,0.71311134,0.008951301,0.039734352],"study_design_scores_gemma":[0.00008368217,0.00007816008,0.00033916047,0.00003111271,0.000040095238,0.00018356633,0.00016326664,0.48518693,0.0008079222,0.5054834,0.007576507,0.00002625],"about_ca_topic_score_codex":0.0021825836,"about_ca_topic_score_gemma":0.0021733895,"teacher_disagreement_score":0.0053692544,"about_ca_system_score_codex":0.0017814866,"about_ca_system_score_gemma":0.0009119827,"threshold_uncertainty_score":0.01796192},"labels":[],"label_agreement":null},{"id":"W2061889788","doi":"10.1145/2508222.2508224","title":"On the number of candidates in opportunistic routing for multi-hop wireless networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"BitCan (Canada); University of Ottawa","funders":"","keywords":"Computer science; Computer network; Hop (telecommunications); Routing protocol; Node (physics); Wireless network; Geographic routing; Wireless; Network performance; Routing (electronic design automation); Dynamic Source Routing; Distributed computing; Telecommunications","score_opus":0.030011088398008662,"score_gpt":0.2708515817780103,"score_spread":0.2408404933800016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061889788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063490905,0.0036655609,0.92780143,0.00060186663,0.00014180157,0.00023239391,0.00009132715,0.00031379628,0.003660832],"genre_scores_gemma":[0.7124022,0.0021785484,0.28308612,0.00018803783,0.00013333713,0.0002500844,0.00012010022,0.000080307014,0.0015612227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961325,0.0019567125,0.00020581235,0.0004260015,0.00099341,0.0002855106],"domain_scores_gemma":[0.9742367,0.02165379,0.0013589386,0.001318169,0.0010943784,0.0003379862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044310866,0.00093017647,0.0014435655,0.0016004216,0.0016724572,0.001583746,0.0018671695,0.001074561,0.0007405247],"category_scores_gemma":[0.026079938,0.0004907804,0.0005727379,0.0018190147,0.0014325891,0.00424283,0.0015129952,0.0006555023,0.00018814333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011843021,0.0002699753,0.00789658,0.0005190921,0.00013738034,0.0005506162,0.00058342586,0.61283237,0.008965049,0.09359975,0.0029327658,0.27052873],"study_design_scores_gemma":[0.000053146956,0.0003535831,0.0009995231,0.00006796666,0.00006408033,0.00040236878,0.00015290953,0.9690535,0.0049873292,0.020478053,0.0033275506,0.000059886002],"about_ca_topic_score_codex":0.0020384998,"about_ca_topic_score_gemma":0.002771585,"teacher_disagreement_score":0.0044310866,"about_ca_system_score_codex":0.00078980695,"about_ca_system_score_gemma":0.0014767606,"threshold_uncertainty_score":0.023434103},"labels":[],"label_agreement":null},{"id":"W2061891825","doi":"10.1007/s11036-011-0339-x","title":"Energy Savings in Wireless Mesh Networks in a Time-Variable Context","year":2011,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Energy consumption; Computer network; Wireless network; Software deployment; Wireless; Backhaul (telecommunications); Order One Network Protocol; Distributed computing; Context (archaeology); Mesh networking; Telecommunications","score_opus":0.007822510666583928,"score_gpt":0.20027628110084195,"score_spread":0.19245377043425801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061891825","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75249517,0.0037363388,0.22222021,0.0015830017,0.00039774858,0.00003675337,0.00017969693,0.00016228645,0.019188862],"genre_scores_gemma":[0.9944173,0.0002960147,0.003804449,0.000020396381,0.000034972534,0.000004614867,0.000019082594,0.000015907593,0.0013873103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980384,0.000060700055,0.0000067277283,0.000028670762,0.0000458837,0.000054300766],"domain_scores_gemma":[0.99965215,0.00022263246,0.00002846349,0.000035074085,0.000044077846,0.000017521288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003064291,0.00027418608,0.0002911801,0.00026121174,0.00032498006,0.0005540031,0.00060986937,0.00032888702,0.002936406],"category_scores_gemma":[0.0013652439,0.000086864005,0.00016931871,0.0006305565,0.0002764893,0.0013545507,0.0005766527,0.00024912134,0.00013955914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012742458,0.00022868726,0.0036533754,0.0001573759,0.0000841405,0.00045466883,0.0001568425,0.6979453,0.024146436,0.08222281,0.0026821462,0.18699397],"study_design_scores_gemma":[0.000024544732,0.00031405242,0.002431732,0.00001842236,0.0000750312,0.0002147087,0.0003483257,0.9444379,0.0059594377,0.04268471,0.0034714893,0.000019667063],"about_ca_topic_score_codex":0.000779095,"about_ca_topic_score_gemma":0.0018260796,"teacher_disagreement_score":0.002936406,"about_ca_system_score_codex":0.00036771537,"about_ca_system_score_gemma":0.00021297831,"threshold_uncertainty_score":0.009823203},"labels":[],"label_agreement":null},{"id":"W2062272040","doi":"10.1109/glocom.2010.5684217","title":"Credit-Based Mechanism Protecting Multi-Hop Wireless Networks from Rational and Irrational Packet Drop","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Irrational number; Computer science; Network packet; Payment; Reputation; Packet forwarding; Computer security; Law","score_opus":0.013429159209163639,"score_gpt":0.22931101016577543,"score_spread":0.2158818509566118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062272040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14809912,0.0017780977,0.8365367,0.0012587439,0.000794335,0.000642707,0.00016687778,0.0027837881,0.007939582],"genre_scores_gemma":[0.9672154,0.000341872,0.028453777,0.0002808028,0.00020845616,0.0001850947,0.00006784032,0.000030509233,0.0032163686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748814,0.00056924246,0.0003043636,0.0004059941,0.0009082305,0.00032403017],"domain_scores_gemma":[0.9867243,0.0036346943,0.0030108585,0.0035334872,0.0023292499,0.00076734944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034726586,0.0008484268,0.0010290429,0.0014787018,0.0017507469,0.0020188247,0.002804292,0.0018828856,0.0017676784],"category_scores_gemma":[0.012026032,0.00029152705,0.00054319727,0.0008472274,0.0013343545,0.0035713846,0.0027158633,0.0016756401,0.0004153116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030515848,0.0013536639,0.015604927,0.0012032929,0.0006680945,0.0029043737,0.0018082146,0.12782037,0.15305173,0.20156139,0.020964887,0.47000748],"study_design_scores_gemma":[0.00073771493,0.0017426892,0.0052091414,0.0001867212,0.00047770824,0.0034858556,0.0003347613,0.80195606,0.062188543,0.09063783,0.032667242,0.00037572795],"about_ca_topic_score_codex":0.0007428147,"about_ca_topic_score_gemma":0.00041174036,"teacher_disagreement_score":0.0034726586,"about_ca_system_score_codex":0.00091563124,"about_ca_system_score_gemma":0.0013202544,"threshold_uncertainty_score":0.018365383},"labels":[],"label_agreement":null},{"id":"W2062371900","doi":"10.1002/dac.640","title":"QoS routing through alternate paths in wireless<i>ad hoc</i>networks","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.020080440558387855,"score_gpt":0.28359445233368485,"score_spread":0.263514011775297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062371900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27370656,0.0056355214,0.7107013,0.0009869268,0.00020867761,0.00010380221,0.000107015985,0.0007184573,0.007831705],"genre_scores_gemma":[0.8906305,0.0019945644,0.10521347,0.00010353427,0.000067053625,0.00005713847,0.000096065916,0.000030363266,0.0018072749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964976,0.00013201982,0.000029973933,0.000042203235,0.00010606686,0.000039958326],"domain_scores_gemma":[0.99904937,0.0004943608,0.00017220898,0.00006911808,0.00015990481,0.000054928187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073964626,0.00034874005,0.00029818836,0.00072603073,0.00047192394,0.0008835151,0.000544981,0.0004472547,0.000658229],"category_scores_gemma":[0.0017378003,0.00020880144,0.00016922847,0.0005438513,0.0005610315,0.00096259394,0.00056788157,0.00031236585,0.0001624798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066026737,0.00016602295,0.005393344,0.0005600478,0.00009197146,0.000989761,0.00074224325,0.4322291,0.10285987,0.11469738,0.0052998075,0.3363103],"study_design_scores_gemma":[0.00005678834,0.00034260162,0.0006905448,0.00004618603,0.000056998208,0.00092233514,0.00016118742,0.9215101,0.017015181,0.04446451,0.014700206,0.00003333791],"about_ca_topic_score_codex":0.0006621062,"about_ca_topic_score_gemma":0.00065948954,"teacher_disagreement_score":0.0008835151,"about_ca_system_score_codex":0.00037118688,"about_ca_system_score_gemma":0.00033347585,"threshold_uncertainty_score":0.003911674},"labels":[],"label_agreement":null},{"id":"W2062674546","doi":"10.1007/s11276-010-0287-6","title":"Novel algorithms for the network lifetime problem in wireless settings","year":2010,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Wireless network; Wireless ad hoc network; Algorithm; Wireless; Transmission (telecommunications); Wireless sensor network; Energy (signal processing); Computer network; Telecommunications; Mathematics","score_opus":0.010037146703040626,"score_gpt":0.23348208840782542,"score_spread":0.2234449417047848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062674546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030283586,0.0007590594,0.99277085,0.0005056124,0.00018241083,0.00012201485,0.00008914921,0.00034424916,0.0021983034],"genre_scores_gemma":[0.105980724,0.0018160287,0.88211894,0.0005370168,0.00088113296,0.00084876514,0.00057926786,0.00042902672,0.0068090265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969902,0.0010563651,0.00017509604,0.00066994294,0.0008073498,0.00030106577],"domain_scores_gemma":[0.9844059,0.011301696,0.0010322117,0.0014606455,0.0012799772,0.0005196185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059587494,0.0024454123,0.0026464474,0.0028662616,0.0017597543,0.0034449366,0.0070293206,0.0038678825,0.007576786],"category_scores_gemma":[0.027418852,0.0013453703,0.0015125767,0.0037555548,0.0020521132,0.011419928,0.005528308,0.0054952833,0.001591798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035739725,0.0004884949,0.0010484613,0.0005319281,0.00012948671,0.00014116509,0.00039548124,0.3844007,0.0020170324,0.28164226,0.027316738,0.30153078],"study_design_scores_gemma":[0.00009305319,0.000049229617,0.00010355935,0.00004211274,0.0000297417,0.00012123561,0.000060072893,0.88234615,0.00037885222,0.11296695,0.0037847343,0.000024274445],"about_ca_topic_score_codex":0.0020874368,"about_ca_topic_score_gemma":0.0034181287,"teacher_disagreement_score":0.007576786,"about_ca_system_score_codex":0.003150867,"about_ca_system_score_gemma":0.002553786,"threshold_uncertainty_score":0.031513274},"labels":[],"label_agreement":null},{"id":"W2062786149","doi":"10.1109/milcom.2011.6127452","title":"Enhancement of frequency-based wormhole attack detection","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Wormhole; Testbed; Computer network; Mobile ad hoc network; Frequency domain; Node (physics); Global Positioning System; Fast Fourier transform; SIGNAL (programming language); Real-time computing; Embedded system; Algorithm; Telecommunications; Engineering","score_opus":0.03206129295276651,"score_gpt":0.2384484611568343,"score_spread":0.20638716820406777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062786149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05128739,0.0004545373,0.94253546,0.0001199125,0.00013753335,0.00011752726,0.000043509233,0.002157559,0.0031466226],"genre_scores_gemma":[0.59235305,0.0004750323,0.4045692,0.00009831242,0.00012438763,0.00007932805,0.00010477625,0.00009707784,0.0020987291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880075,0.00024133074,0.00006361308,0.00014593905,0.00066900154,0.00007938671],"domain_scores_gemma":[0.9960311,0.0016213167,0.00042735456,0.0005640968,0.001277554,0.000078578065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007293928,0.0006874878,0.0006402004,0.002133517,0.00023513514,0.00052253803,0.0009071672,0.00081443804,0.001167926],"category_scores_gemma":[0.00489754,0.00028149114,0.00037403285,0.0007353745,0.000314224,0.0014103444,0.0007534573,0.000568674,0.0005875735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040011917,0.00031561757,0.004105154,0.00025968972,0.000084145206,0.00037559803,0.00013544192,0.036435854,0.23342724,0.006014459,0.0016625905,0.7167841],"study_design_scores_gemma":[0.000048331327,0.00064392254,0.0033279264,0.00004003584,0.000088846784,0.0021893794,0.00004242709,0.822856,0.1588477,0.002683826,0.009159586,0.000072040675],"about_ca_topic_score_codex":0.00033858136,"about_ca_topic_score_gemma":0.00034863068,"teacher_disagreement_score":0.002133517,"about_ca_system_score_codex":0.0002229276,"about_ca_system_score_gemma":0.0002771325,"threshold_uncertainty_score":0.0039070845},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007771689284809232,"score_gpt":0.2370758330244207,"score_spread":0.22930414373961147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062802747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043253515,0.0012242504,0.9518071,0.00058427645,0.00011807307,0.00010936962,0.000038431983,0.00026542513,0.0025996347],"genre_scores_gemma":[0.9044329,0.00068724394,0.09367264,0.00012277794,0.000098409306,0.00007308773,0.0000686093,0.000014755561,0.00082950346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777126,0.00072114944,0.00023115239,0.0002767036,0.00079259934,0.00020713254],"domain_scores_gemma":[0.9967391,0.0013015942,0.00055577443,0.0006668304,0.0005834336,0.00015330254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002446272,0.00071396545,0.0007372055,0.000636901,0.00096491625,0.0012084898,0.0012501904,0.000906314,0.0007048404],"category_scores_gemma":[0.007260269,0.00028455973,0.0009075315,0.0006428209,0.0010292458,0.0039311275,0.0024642716,0.0013729883,0.00020297323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088851573,0.0002785142,0.0047304383,0.0005226731,0.00031251932,0.001316739,0.0015711596,0.4388237,0.037317093,0.15968008,0.0040059052,0.35055283],"study_design_scores_gemma":[0.000037519934,0.00017018513,0.0003815514,0.000024089344,0.0000920202,0.0002553013,0.00011323828,0.9610264,0.004770723,0.0304775,0.0026169769,0.000034558394],"about_ca_topic_score_codex":0.0014337417,"about_ca_topic_score_gemma":0.001252471,"teacher_disagreement_score":0.002446272,"about_ca_system_score_codex":0.00092340674,"about_ca_system_score_gemma":0.00092438556,"threshold_uncertainty_score":0.012937307},"labels":[],"label_agreement":null},{"id":"W206305018","doi":"","title":"Performance evaluation of hierarchical ad hoc networks.","year":2005,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless ad hoc network; Post hoc; Telecommunications; Medicine","score_opus":0.023409950640923802,"score_gpt":0.23330500561091794,"score_spread":0.20989505496999414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W206305018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42390275,0.016271917,0.47310156,0.0017816384,0.0015067466,0.0012932777,0.0034593043,0.0039294832,0.074753426],"genre_scores_gemma":[0.94700843,0.0015247499,0.046811882,0.00011076105,0.00012103032,0.00018976587,0.0013577103,0.000097563556,0.002777997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573743,0.0017093675,0.00022129224,0.00033152173,0.0017557027,0.00024474107],"domain_scores_gemma":[0.990897,0.0042466023,0.0009862023,0.0010196483,0.0023797087,0.00047075632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005494249,0.0010123309,0.0005478943,0.0018804165,0.0005258484,0.0012677105,0.00079809356,0.0006088327,0.002313849],"category_scores_gemma":[0.011642778,0.00014868642,0.00034461066,0.001408751,0.00039283995,0.0015836578,0.00078020757,0.00036818665,0.00061806093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084557,0.0004380664,0.026686246,0.0010947473,0.00039126436,0.0003213889,0.00028835807,0.5262004,0.013249747,0.02246494,0.0130791515,0.39494002],"study_design_scores_gemma":[0.00005572633,0.0016964221,0.010652204,0.00013721814,0.00015149245,0.00033419637,0.00033848343,0.9501871,0.010309742,0.011150987,0.014932274,0.000054210384],"about_ca_topic_score_codex":0.0023274613,"about_ca_topic_score_gemma":0.0016399674,"teacher_disagreement_score":0.005494249,"about_ca_system_score_codex":0.0012885297,"about_ca_system_score_gemma":0.00087020773,"threshold_uncertainty_score":0.029056728},"labels":[],"label_agreement":null},{"id":"W2063103220","doi":"10.1109/wmnc.2014.6878879","title":"An enhanced Gauss-Markov mobility model for simulations of unmanned aerial ad hoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mobility model; Computer science; Waypoint; Markov chain; Routing protocol; Node (physics); Routing (electronic design automation); Markov process; Markov model; Limit (mathematics); Wireless ad hoc network; Computer network; Simulation; Distributed computing; Real-time computing; Mathematics; Wireless; Engineering; Telecommunications; Machine learning","score_opus":0.014616857586924875,"score_gpt":0.269299064874166,"score_spread":0.2546822072872411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063103220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08364249,0.0003035814,0.90906096,0.00048727408,0.00010676984,0.00016647567,0.000460103,0.0006398894,0.0051324163],"genre_scores_gemma":[0.82365495,0.00060590095,0.1693141,0.0001517119,0.00006320844,0.00049697,0.00064053346,0.00008585459,0.004986773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961805,0.00016654968,0.000021904665,0.00003726603,0.00011582518,0.00004035591],"domain_scores_gemma":[0.99935144,0.00033604208,0.00008645975,0.000073562,0.000115596675,0.00003688105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000580309,0.00042091092,0.0005995062,0.0003323583,0.00037192437,0.000523334,0.0012435397,0.00068916904,0.0010671385],"category_scores_gemma":[0.002026925,0.00033072577,0.0006034807,0.00041592016,0.00042962338,0.00079510565,0.0005452125,0.0009539902,0.0002848276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018950608,0.00001715292,0.0005173234,0.000019471461,0.0000145922295,0.000050100196,0.0000351272,0.9853755,0.0009609349,0.010278918,0.0002902832,0.0024217218],"study_design_scores_gemma":[0.00000436763,0.000010174295,0.000060841423,0.000002284766,0.0000032411167,0.0000066814637,0.00000434401,0.99735,0.00016413342,0.001800351,0.0005908876,0.0000027334745],"about_ca_topic_score_codex":0.008395338,"about_ca_topic_score_gemma":0.006570126,"teacher_disagreement_score":0.008395338,"about_ca_system_score_codex":0.0006626715,"about_ca_system_score_gemma":0.00070308713,"threshold_uncertainty_score":0.016692936},"labels":[],"label_agreement":null},{"id":"W2063511460","doi":"10.1145/1400863.1400879","title":"Modelling gateway placement in wireless networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Unit disk graph; Vertex (graph theory); Combinatorics; Graph; Plane (geometry); Wireless network; Wireless; Mathematics; Approximation algorithm; Computer science; Discrete mathematics; Telecommunications; Geometry","score_opus":0.02355306264522456,"score_gpt":0.21940709794698926,"score_spread":0.1958540353017647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063511460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049111463,0.0011587265,0.93548924,0.0010006572,0.00019996325,0.00018604954,0.00049556606,0.0005074448,0.011850878],"genre_scores_gemma":[0.7489788,0.002821616,0.23462525,0.00020236024,0.0002537607,0.0005026211,0.00092349335,0.00023460771,0.011457537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982627,0.00069556665,0.000089108464,0.00042991748,0.0002719427,0.00025075],"domain_scores_gemma":[0.9979602,0.0011975104,0.0002803253,0.000247178,0.00015604819,0.00015876687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013520883,0.001718909,0.001657815,0.0011779043,0.0010697356,0.0031498112,0.0039551216,0.004231027,0.0041656233],"category_scores_gemma":[0.0075448733,0.0012067627,0.0012404574,0.0032937636,0.0026086844,0.005547681,0.0030849942,0.002034357,0.0011370914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005288405,0.000020456357,0.00027089406,0.000058724178,0.000011751871,0.0001265995,0.00007607507,0.94864607,0.0004371364,0.045365624,0.0007540304,0.0041797203],"study_design_scores_gemma":[0.000016405013,0.000022243343,0.00006336847,0.000009169563,0.0000066072084,0.000041310697,0.000036316786,0.95560354,0.00018698495,0.04238148,0.0016245303,0.000008001374],"about_ca_topic_score_codex":0.007696419,"about_ca_topic_score_gemma":0.0066082245,"teacher_disagreement_score":0.007696419,"about_ca_system_score_codex":0.0024387306,"about_ca_system_score_gemma":0.0011290895,"threshold_uncertainty_score":0.017694235},"labels":[],"label_agreement":null},{"id":"W2063626088","doi":"10.1109/mwc.2004.1295736","title":"Real-time traffic support in relayed wireless access networks using IEEE 802.11","year":2004,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Inter-Access Point Protocol; Wireless network; Wireless; IEEE 802.11; Wireless lan; Wi-Fi array; Telecommunications","score_opus":0.04003546509600218,"score_gpt":0.30397237043422015,"score_spread":0.26393690533821795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063626088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43896246,0.0040116003,0.54058987,0.0010576177,0.0005148441,0.0001174146,0.00013252263,0.0029876507,0.011626071],"genre_scores_gemma":[0.9865854,0.00039211195,0.010878255,0.00006279843,0.00014173116,0.000027669346,0.000059640126,0.000032549582,0.001819853],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934584,0.00020307634,0.00005472485,0.00007820254,0.00019030937,0.00012799341],"domain_scores_gemma":[0.9966523,0.0015640083,0.0002831032,0.00044044567,0.0009430774,0.00011701531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015945679,0.00060699834,0.00042433394,0.0005402172,0.0004773094,0.0013808584,0.0012491904,0.0006150051,0.0022886186],"category_scores_gemma":[0.004997611,0.000328903,0.00017627559,0.0003281898,0.00060865574,0.0019756877,0.000703202,0.0009009247,0.00052231393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038603356,0.00062620867,0.0063421596,0.00056538713,0.00017625939,0.0015435136,0.0013715168,0.15164559,0.2201469,0.04300379,0.009088203,0.5616301],"study_design_scores_gemma":[0.0001761232,0.0012747748,0.0024588862,0.00008194817,0.00016686367,0.0011672243,0.0003541463,0.90635574,0.05768189,0.01757451,0.012601124,0.00010681108],"about_ca_topic_score_codex":0.0007395398,"about_ca_topic_score_gemma":0.0009818719,"teacher_disagreement_score":0.0022886186,"about_ca_system_score_codex":0.00037887564,"about_ca_system_score_gemma":0.00033384608,"threshold_uncertainty_score":0.008432984},"labels":[],"label_agreement":null},{"id":"W2064283193","doi":"10.1109/icc.2010.5502687","title":"Handoff-Aware Channel Assignment for Multi-Radio Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer network; Computer science; Handover; Wireless mesh network; Quality of service; Channel (broadcasting); Latency (audio); Wireless; Throughput; Wireless network; Telecommunications","score_opus":0.022136868317766047,"score_gpt":0.2539695015566483,"score_spread":0.23183263323888229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064283193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048778318,0.0013763387,0.9472966,0.00014610743,0.00016468995,0.000088298235,0.000045402132,0.0005512922,0.0015528623],"genre_scores_gemma":[0.9117804,0.00051471416,0.086414516,0.000061768835,0.00007397071,0.00008382364,0.00007595068,0.00002504277,0.00096978096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996661,0.00011701732,0.0000152062985,0.00004966122,0.00007896621,0.00007297297],"domain_scores_gemma":[0.99957603,0.0001804968,0.00007144109,0.00006270117,0.000072941846,0.000036301495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048140163,0.00031896995,0.000280524,0.00044822352,0.0005208503,0.00039040655,0.00070273975,0.00031026007,0.00074917503],"category_scores_gemma":[0.0009894907,0.00013146657,0.00024016474,0.00034491732,0.0003117961,0.00060012523,0.00066614663,0.00046794364,0.00013761579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032938638,0.00015937719,0.0027167217,0.00027854467,0.00007437161,0.00031640386,0.00015693996,0.5130274,0.059134018,0.011448823,0.0028011356,0.40955693],"study_design_scores_gemma":[0.000016936634,0.00008448901,0.0005873739,0.000011411022,0.000018890289,0.000112696864,0.000047340644,0.98874474,0.00521699,0.003230384,0.0019090867,0.000019699242],"about_ca_topic_score_codex":0.0013970735,"about_ca_topic_score_gemma":0.001945353,"teacher_disagreement_score":0.0013970735,"about_ca_system_score_codex":0.00040817657,"about_ca_system_score_gemma":0.0003869337,"threshold_uncertainty_score":0.0029615164},"labels":[],"label_agreement":null},{"id":"W2064875978","doi":"10.1145/1089761.1089780","title":"Enhancements for clustering stability in mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cluster analysis; Mobile ad hoc network; Computer network; Computer science; Node (physics); Cluster (spacecraft); Stability (learning theory); Wireless ad hoc network; Routing protocol; Distributed computing; Routing (electronic design automation); Engineering; Telecommunications; Wireless; Artificial intelligence","score_opus":0.018658449820817626,"score_gpt":0.2642104707556915,"score_spread":0.24555202093487385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064875978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04519577,0.0048950394,0.9287781,0.0015757717,0.0010454837,0.00041259674,0.00014657505,0.0024336604,0.015516863],"genre_scores_gemma":[0.68705523,0.002782848,0.29759485,0.0005653747,0.0013103852,0.00036621402,0.00031219382,0.00041629,0.0095965965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997943,0.0005400598,0.00013391138,0.00036865988,0.00085300754,0.00016136769],"domain_scores_gemma":[0.9948192,0.0014884082,0.00044866162,0.0012331919,0.0018204204,0.0001902097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027676234,0.0008528669,0.0006934825,0.0011133045,0.0013854773,0.0012697604,0.0019742139,0.0012099786,0.0028485267],"category_scores_gemma":[0.0108934,0.00040182524,0.00066122937,0.0013283937,0.0009043473,0.0033278198,0.002452496,0.0018533213,0.0012950061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082343945,0.0003293957,0.0031964697,0.000831732,0.00015123436,0.0005184925,0.0010342073,0.20982698,0.08322639,0.13321917,0.010665766,0.5561767],"study_design_scores_gemma":[0.00010648858,0.0012098039,0.0032168513,0.00016833047,0.00021485386,0.0012824893,0.00037789933,0.7975186,0.052886147,0.060668208,0.08220102,0.00014928964],"about_ca_topic_score_codex":0.0012489002,"about_ca_topic_score_gemma":0.0009833749,"teacher_disagreement_score":0.0028485267,"about_ca_system_score_codex":0.001012945,"about_ca_system_score_gemma":0.0010095446,"threshold_uncertainty_score":0.014636755},"labels":[],"label_agreement":null},{"id":"W2065043888","doi":"10.1145/2641798.2641821","title":"Exact analysis on network capacity of airborne MANETS with digital beamforming antennas","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"Ministère de la Défense Nationale","keywords":"Beamwidth; Mobile ad hoc network; Wireless ad hoc network; Computer science; Directional antenna; Computer network; Smart antenna; Beamforming; Antenna (radio); Telecommunications; Wireless","score_opus":0.008966209981610995,"score_gpt":0.19967316247930403,"score_spread":0.19070695249769304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065043888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1596056,0.003640561,0.80114436,0.0011525557,0.00009667312,0.00006141619,0.00048508766,0.00026389002,0.033549827],"genre_scores_gemma":[0.9757877,0.0016435846,0.018884655,0.00013056696,0.000078552526,0.00009926069,0.0001599665,0.00007545337,0.0031402032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927884,0.0002405756,0.000016906382,0.00009143437,0.00018979041,0.00018244675],"domain_scores_gemma":[0.9958792,0.0031681627,0.0002981561,0.0002318661,0.00032543187,0.000097284654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141544,0.00083582185,0.0006330811,0.0012155876,0.0005410742,0.0009165286,0.0011092467,0.00077194546,0.0038936443],"category_scores_gemma":[0.0066685933,0.00044746423,0.0005150825,0.0011357388,0.0016513295,0.0030708031,0.0012132013,0.00092680944,0.00032427043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025522597,0.000014147166,0.00035343054,0.00007983524,0.000014394491,0.00008188772,0.000049136168,0.9404498,0.0015413858,0.051925443,0.0006993645,0.0047656805],"study_design_scores_gemma":[0.0000018829003,0.000008603934,0.00013771349,0.000010642107,0.0000033677622,0.000029946399,0.000025119993,0.9843754,0.0002707472,0.014876413,0.00025466725,0.000005412675],"about_ca_topic_score_codex":0.0036964652,"about_ca_topic_score_gemma":0.003360842,"teacher_disagreement_score":0.0038936443,"about_ca_system_score_codex":0.0019136601,"about_ca_system_score_gemma":0.0007712829,"threshold_uncertainty_score":0.013884664},"labels":[],"label_agreement":null},{"id":"W2065784804","doi":"10.1002/cpe.1155","title":"Mobility management in hybrid<i>ad‐hoc</i>networks and the Internet environment","year":2007,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Handover; Mobility management; Computer science; Mobile IP; Mobile ad hoc network; Mobility model; Wireless ad hoc network; Packet loss; Network packet; Vehicular ad hoc network; The Internet; Distributed computing; Wireless; Telecommunications","score_opus":0.012117737677220743,"score_gpt":0.274452473220774,"score_spread":0.26233473554355324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065784804","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5032444,0.0039261635,0.47865888,0.0009322908,0.00019514993,0.00006767528,0.00006319066,0.00085788255,0.012054443],"genre_scores_gemma":[0.9848889,0.00041282634,0.013789531,0.000045415945,0.000024939247,0.000017158613,0.000027303688,0.000017352515,0.0007766586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99972385,0.0001477052,0.000012153983,0.000031973876,0.000049183796,0.000035037687],"domain_scores_gemma":[0.999521,0.00025427446,0.0000825022,0.000049614206,0.000054987988,0.00003770014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070524256,0.00024292669,0.00019807386,0.0004118371,0.00032931182,0.0009841007,0.00048990216,0.00034063047,0.00046385694],"category_scores_gemma":[0.0011320927,0.00018087299,0.00016769383,0.0003259152,0.000677476,0.0011945713,0.0005566794,0.00024947478,0.0000884004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004857914,0.00013515243,0.013266123,0.0002109585,0.00018205056,0.0010302286,0.00070061017,0.6686086,0.041653927,0.12646216,0.0044348175,0.1428296],"study_design_scores_gemma":[0.00004827846,0.00022631987,0.002176614,0.0000287768,0.00006899339,0.00040277795,0.00026952894,0.9380176,0.0071230466,0.043614835,0.0079918485,0.00003132319],"about_ca_topic_score_codex":0.0013682696,"about_ca_topic_score_gemma":0.0009205898,"teacher_disagreement_score":0.0013682696,"about_ca_system_score_codex":0.0005064404,"about_ca_system_score_gemma":0.00022826737,"threshold_uncertainty_score":0.003729701},"labels":[],"label_agreement":null},{"id":"W2065909865","doi":"10.1002/wcm.85","title":"IEEE 802.11 FHSS receiver design for cluster‐based multihop video communications","year":2002,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Computer network; Frequency-hopping spread spectrum; Multipath propagation; Time diversity; Network packet; Transmission (telecommunications); Spread spectrum; Diversity scheme; Real-time computing; Fading; Channel (broadcasting); Telecommunications","score_opus":0.06557800294530554,"score_gpt":0.29201340158866185,"score_spread":0.22643539864335632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065909865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030279297,0.00057238975,0.9635159,0.00026904128,0.00013571445,0.00015328005,0.00002443497,0.00087914994,0.0041708336],"genre_scores_gemma":[0.71250033,0.00049929426,0.27478826,0.00032702228,0.0002800908,0.00030044044,0.00015964126,0.00009047359,0.011054395],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992306,0.00028608466,0.000032258802,0.000101242156,0.00027330144,0.000076520766],"domain_scores_gemma":[0.9990096,0.00020000958,0.000071559305,0.000072700896,0.0006174416,0.000028632856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015971937,0.00058703445,0.00034580627,0.000540909,0.00046819128,0.0007214614,0.0009699738,0.0010111536,0.0017689544],"category_scores_gemma":[0.0016182762,0.00029472326,0.00024252449,0.00019539634,0.00031228873,0.00052243244,0.00030406896,0.0007137906,0.0011423776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011652352,0.00028409803,0.0041654487,0.00041556536,0.00032662522,0.000484083,0.00060292584,0.27426255,0.2865651,0.04180881,0.009448064,0.38047156],"study_design_scores_gemma":[0.00017016032,0.0008320659,0.0013518623,0.000043589152,0.00016467844,0.0003566351,0.000060149756,0.8753008,0.09733355,0.003023542,0.021302734,0.000060241833],"about_ca_topic_score_codex":0.0020920637,"about_ca_topic_score_gemma":0.002042823,"teacher_disagreement_score":0.0020920637,"about_ca_system_score_codex":0.0009016804,"about_ca_system_score_gemma":0.0006382196,"threshold_uncertainty_score":0.008446872},"labels":[],"label_agreement":null},{"id":"W2066397489","doi":"10.1007/s11036-009-0178-1","title":"Maximizing the Network Stability in Mobile WiMAX Mesh Networks","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Concordia University","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Distributed computing; Wireless mesh network; Schedule; Mathematical optimization; Robustness (evolution); Wireless network; Wireless; Mathematics; Telecommunications","score_opus":0.00990098485326145,"score_gpt":0.23344763841309665,"score_spread":0.22354665355983522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066397489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32925928,0.0014781264,0.66079724,0.00071174215,0.000069400885,0.00006770102,0.0001081062,0.00024846304,0.007260008],"genre_scores_gemma":[0.9889993,0.0002604694,0.009679741,0.000019614265,0.000040703104,0.000024123196,0.000019743571,0.00002669861,0.00092965167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958426,0.00020237592,0.000013569738,0.000051887815,0.00009026201,0.00005767658],"domain_scores_gemma":[0.9979108,0.0015010952,0.0001812936,0.00008958787,0.0002432955,0.00007397928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000983992,0.00048783456,0.0005856772,0.00053766905,0.0006289854,0.000789096,0.00065980706,0.0005670689,0.0010290174],"category_scores_gemma":[0.006030017,0.00032451536,0.00015326704,0.0006782874,0.00058491604,0.0013023602,0.00081304344,0.0003914743,0.0002008375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051767845,0.00007016313,0.0021348463,0.00013612313,0.000054408578,0.0001529503,0.00019500857,0.86143273,0.039211117,0.036622982,0.0016471536,0.05782481],"study_design_scores_gemma":[0.000010447194,0.0000771581,0.00033162304,0.000005510511,0.000012889396,0.000042486176,0.000034129524,0.9847333,0.0035689783,0.010859268,0.0003181778,0.0000059674835],"about_ca_topic_score_codex":0.00080335146,"about_ca_topic_score_gemma":0.001001471,"teacher_disagreement_score":0.0010290174,"about_ca_system_score_codex":0.00074048096,"about_ca_system_score_gemma":0.0004346715,"threshold_uncertainty_score":0.005372584},"labels":[],"label_agreement":null},{"id":"W2066495719","doi":"10.1145/2653481.2653485","title":"Mobility-based opportunistic routing for mobile ad-hoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Dynamic Source Routing; Optimized Link State Routing Protocol; Link-state routing protocol; Distributed computing; Mobility model; Network packet; Wireless; Telecommunications","score_opus":0.019129272069973474,"score_gpt":0.2522684196996947,"score_spread":0.23313914762972124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066495719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037647316,0.015993066,0.96035314,0.0012845385,0.0012153628,0.00059617875,0.0003294901,0.0017655123,0.014697892],"genre_scores_gemma":[0.30296543,0.039498284,0.62929046,0.00095512974,0.0016205498,0.002621977,0.0018730867,0.0003492585,0.020825805],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990073,0.00036211326,0.00006725989,0.000082956874,0.0004210237,0.00005945443],"domain_scores_gemma":[0.9990576,0.00040427461,0.0001091135,0.00014884918,0.00023129505,0.00004886433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092156575,0.0008654543,0.00078666606,0.0008506431,0.0007833373,0.0011063811,0.001787268,0.0009275268,0.002004987],"category_scores_gemma":[0.0027518847,0.00031847923,0.0005463757,0.0017713719,0.00064051384,0.0015925446,0.0012534066,0.0011655893,0.0011002094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016323187,0.000117965166,0.0011646014,0.0016025539,0.00021410946,0.0011843393,0.00032270697,0.119295634,0.015348331,0.22241007,0.03910061,0.5990758],"study_design_scores_gemma":[0.000106017724,0.0002607552,0.001175369,0.00046161684,0.00015423709,0.0017796941,0.00021477447,0.56522846,0.0040062196,0.14785846,0.2785892,0.00016512872],"about_ca_topic_score_codex":0.0016905562,"about_ca_topic_score_gemma":0.0020326937,"teacher_disagreement_score":0.002004987,"about_ca_system_score_codex":0.0008904524,"about_ca_system_score_gemma":0.0010248076,"threshold_uncertainty_score":0.0067073107},"labels":[],"label_agreement":null},{"id":"W2066901227","doi":"10.1109/ccece.2012.6334955","title":"A secure multiparty micropayment protocol for internet access over WLAN wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Computer security; The Internet; Hash function; Wireless mesh network; Scheme (mathematics); Protocol (science); Wireless; Wireless network; Telecommunications; World Wide Web","score_opus":0.031042154161944734,"score_gpt":0.32132218943036017,"score_spread":0.29028003526841545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066901227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02996206,0.0008333957,0.9645542,0.00043765412,0.00018625912,0.00027269553,0.00005908392,0.00065236865,0.003042295],"genre_scores_gemma":[0.7398174,0.0011095623,0.25111148,0.0002323171,0.0001756993,0.00065312465,0.00024174049,0.000082364386,0.0065762755],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994361,0.00015568305,0.000076251934,0.000057430552,0.00021239532,0.00006207923],"domain_scores_gemma":[0.99952614,0.00010455051,0.00009723475,0.00014480158,0.00009060812,0.00003675511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006084371,0.00027004705,0.00036533864,0.00037840765,0.0006876768,0.0006665501,0.000806585,0.000485,0.0014290825],"category_scores_gemma":[0.0011172737,0.00017265206,0.00039067015,0.0004127198,0.0005173538,0.0014041048,0.001175027,0.0009171749,0.0003887987],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007506453,0.00020757639,0.00182257,0.00073165,0.00021525963,0.0014574833,0.00070028915,0.035388265,0.21354966,0.33552092,0.012016222,0.39763936],"study_design_scores_gemma":[0.00032986372,0.0017589502,0.0026456644,0.0001067165,0.00031940435,0.00427057,0.000270375,0.6547908,0.11880191,0.059508227,0.1569175,0.00028005824],"about_ca_topic_score_codex":0.00030616194,"about_ca_topic_score_gemma":0.00035094444,"teacher_disagreement_score":0.0014290825,"about_ca_system_score_codex":0.00043624354,"about_ca_system_score_gemma":0.00038261258,"threshold_uncertainty_score":0.0047807693},"labels":[],"label_agreement":null},{"id":"W2067895951","doi":"10.1109/secon.2012.6275838","title":"Delta-graphs for wireless ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Topology control; Computer science; Network topology; Topology (electrical circuits); Wireless ad hoc network; Extension topology; Logical topology; Computer network; Mobile ad hoc network; Comparison of topologies; Distributed computing; Wireless network; Wireless; Algorithm; Mathematics; Network packet; Key distribution in wireless sensor networks; General topology; Telecommunications","score_opus":0.016277770499953624,"score_gpt":0.24369570195681592,"score_spread":0.2274179314568623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067895951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057074376,0.017895374,0.9306699,0.0033360603,0.0015089047,0.0002847466,0.0015358584,0.0021605038,0.036901314],"genre_scores_gemma":[0.30283028,0.049228374,0.5996794,0.0031091527,0.0028193546,0.0016891696,0.004550301,0.0011000944,0.034993887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993905,0.00022992105,0.000034891113,0.00010011436,0.00021071934,0.000033757115],"domain_scores_gemma":[0.9983273,0.0009645489,0.0001493644,0.00026102833,0.0002266329,0.00007113972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067349314,0.0013480984,0.0008695306,0.001777783,0.0007029839,0.001843642,0.0015423879,0.001395495,0.010237299],"category_scores_gemma":[0.0041190735,0.00040624957,0.00062494003,0.003302559,0.0010163394,0.0022794192,0.0013098683,0.0025323697,0.004196792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048978793,0.00006004534,0.00050332624,0.00063915463,0.000050725237,0.00033692436,0.00015446625,0.08553694,0.0016459719,0.717174,0.037496448,0.15635298],"study_design_scores_gemma":[0.000020532336,0.00003499473,0.00021651185,0.00013056718,0.000014922229,0.00032041004,0.000067549314,0.1276328,0.0003177653,0.7595514,0.1116697,0.000022854287],"about_ca_topic_score_codex":0.0017085416,"about_ca_topic_score_gemma":0.0019846172,"teacher_disagreement_score":0.010237299,"about_ca_system_score_codex":0.0011697742,"about_ca_system_score_gemma":0.0009786903,"threshold_uncertainty_score":0.03424722},"labels":[],"label_agreement":null},{"id":"W2067933402","doi":"10.1109/glocom.2011.6133636","title":"PSR: Proactive Source Routing in Mobile Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Wireless Routing Protocol; Link-state routing protocol; Distributed computing; Wireless ad hoc network; Routing protocol; DSRFLOW; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.018939810846031493,"score_gpt":0.2222891015726681,"score_spread":0.2033492907266366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067933402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008454148,0.0029495452,0.97197634,0.0008379198,0.0005211887,0.00022827645,0.0001545219,0.0053168475,0.009561139],"genre_scores_gemma":[0.3488742,0.006558239,0.6242371,0.0007709088,0.0008008848,0.00067183847,0.0010350519,0.00061679503,0.016434915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992175,0.00021055916,0.00004254882,0.00006737535,0.0004220082,0.00003993609],"domain_scores_gemma":[0.99956423,0.00015760992,0.000059978272,0.000097410164,0.000087577515,0.00003325339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010363621,0.0005779171,0.00045255953,0.00070767204,0.00044104998,0.0010546749,0.0010822533,0.0008069894,0.001891196],"category_scores_gemma":[0.001462408,0.0003006998,0.00029214504,0.00080565317,0.0006505105,0.0016319419,0.00093118334,0.0007331878,0.0015527946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025804443,0.00014090669,0.0009679731,0.0009503445,0.000106318854,0.0008158216,0.00034025763,0.07946367,0.051302545,0.14108711,0.033059467,0.6915075],"study_design_scores_gemma":[0.00026104317,0.0008398704,0.00088743964,0.00016192115,0.00013476377,0.0025167428,0.00018781322,0.6322972,0.04534688,0.100871325,0.21635504,0.00013993836],"about_ca_topic_score_codex":0.00048947113,"about_ca_topic_score_gemma":0.00049540657,"teacher_disagreement_score":0.001891196,"about_ca_system_score_codex":0.00027866097,"about_ca_system_score_gemma":0.0005904177,"threshold_uncertainty_score":0.0063266754},"labels":[],"label_agreement":null},{"id":"W2068118042","doi":"10.1109/icc.2008.882","title":"A Collision-Free MAC Scheme for Multimedia Wireless Mesh Backbone","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheme (mathematics); Collision; Wireless; Computer network; Multimedia; Telecommunications; Computer security","score_opus":0.02024119412350662,"score_gpt":0.2407476988391632,"score_spread":0.22050650471565658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068118042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011261629,0.0016054717,0.98383385,0.00023302014,0.00033500063,0.00019688133,0.00004973109,0.000550267,0.0019342504],"genre_scores_gemma":[0.5686867,0.0014464209,0.42358533,0.0005404138,0.00037974954,0.00056506094,0.00025465104,0.000068288486,0.004473359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999226,0.00013986911,0.00006753031,0.00012173404,0.0003531691,0.00009173251],"domain_scores_gemma":[0.9990079,0.00023886867,0.00015074614,0.00016851352,0.00037502305,0.00005901598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013468971,0.0005126472,0.0005225599,0.0010762562,0.0010726409,0.0006893747,0.002153576,0.0007683281,0.0012078345],"category_scores_gemma":[0.0022864137,0.00025922916,0.00042838216,0.000718803,0.0005455644,0.001640608,0.0011032772,0.0010550417,0.00033570375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045224733,0.00031527845,0.0016328229,0.0008137844,0.0002122268,0.00053482497,0.0005428987,0.058243047,0.18166785,0.14547181,0.011297193,0.59881604],"study_design_scores_gemma":[0.00016895756,0.0008363675,0.0014393654,0.000087302134,0.00022699716,0.0016154463,0.00011642654,0.8319743,0.06555943,0.026093239,0.07169851,0.00018363725],"about_ca_topic_score_codex":0.0006727621,"about_ca_topic_score_gemma":0.0007162941,"teacher_disagreement_score":0.002153576,"about_ca_system_score_codex":0.00096243346,"about_ca_system_score_gemma":0.00092912506,"threshold_uncertainty_score":0.0071231723},"labels":[],"label_agreement":null},{"id":"W2068320931","doi":"10.1016/j.adhoc.2004.03.013","title":"Topology and mobility considerations in mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mobile ad hoc network; Computer network; Wireless ad hoc network; Computer science; Optimized Link State Routing Protocol; Node (physics); Vehicular ad hoc network; Network topology; Distributed computing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Topology (electrical circuits); Mobility model; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications; Engineering; Network packet","score_opus":0.01147546152055013,"score_gpt":0.24586382031380927,"score_spread":0.23438835879325914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068320931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08289739,0.07909123,0.70728976,0.01845503,0.0051990924,0.00017834587,0.00033489347,0.00032241901,0.10623181],"genre_scores_gemma":[0.86322385,0.060550455,0.044404548,0.00079494703,0.006800482,0.00018186576,0.00021111207,0.00017666633,0.02365603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991755,0.00035626575,0.00004103807,0.000075045245,0.00027691733,0.00007510603],"domain_scores_gemma":[0.9970118,0.001953786,0.00026227804,0.0001739194,0.00042466298,0.00017353351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009937751,0.0005464179,0.0007314487,0.0013132404,0.0011497671,0.0023697286,0.0011878648,0.0018140664,0.0025230558],"category_scores_gemma":[0.008140517,0.00062368484,0.00036322803,0.0017916928,0.0017889726,0.007068677,0.0012207441,0.0014508995,0.00074399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007735431,0.000041189505,0.0010279578,0.00031039256,0.00002442176,0.0011120854,0.00043914616,0.10031247,0.0028178256,0.84692097,0.005761657,0.041154526],"study_design_scores_gemma":[0.00003363238,0.00015053508,0.0010106327,0.00017767298,0.00006889462,0.0020098833,0.00055089314,0.20872615,0.0011393303,0.7234487,0.06262789,0.00005576128],"about_ca_topic_score_codex":0.0010901941,"about_ca_topic_score_gemma":0.0010783996,"teacher_disagreement_score":0.0025230558,"about_ca_system_score_codex":0.0007083748,"about_ca_system_score_gemma":0.0002924867,"threshold_uncertainty_score":0.008440495},"labels":[],"label_agreement":null},{"id":"W2068920470","doi":"10.1109/mascot.2009.5366701","title":"Capacity bounds for cellular wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Hop (telecommunications); Radio resource management; Wireless network; Switched mesh; Wireless; Transmitter; Mesh networking; Channel (broadcasting); Channel capacity; Shared mesh; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering","score_opus":0.015667513302925724,"score_gpt":0.22404491889816164,"score_spread":0.2083774055952359,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068920470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030729078,0.020276753,0.88242096,0.0026234319,0.0003249692,0.0000756214,0.00070075097,0.00064859854,0.062199816],"genre_scores_gemma":[0.9376212,0.012069048,0.042045493,0.0003912082,0.0005847191,0.00034642505,0.0004738954,0.0001909865,0.0062770313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826235,0.0005316376,0.00005287693,0.00013147964,0.00074039405,0.00028123904],"domain_scores_gemma":[0.99217284,0.005799865,0.0003662802,0.0003681956,0.001143715,0.0001490523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019021138,0.0009641139,0.0006019372,0.0018420903,0.0008613462,0.0021679436,0.0011779465,0.00079167297,0.0043118293],"category_scores_gemma":[0.0140821785,0.00030544383,0.00044804302,0.0020066595,0.0014830629,0.003148479,0.0013720648,0.0018632776,0.00068228634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038287613,0.000019168681,0.00038265713,0.00020090434,0.00003265286,0.00009569928,0.00019113507,0.32619038,0.0021167775,0.6402621,0.0057070474,0.02476315],"study_design_scores_gemma":[0.0000053682365,0.000014463516,0.00021818442,0.00010881217,0.000012773763,0.00008016164,0.00009095631,0.58757526,0.00081896834,0.402007,0.009049614,0.000018420866],"about_ca_topic_score_codex":0.004431465,"about_ca_topic_score_gemma":0.0018400223,"teacher_disagreement_score":0.004431465,"about_ca_system_score_codex":0.0030969915,"about_ca_system_score_gemma":0.00080572,"threshold_uncertainty_score":0.022470415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018240203983219558,"score_gpt":0.22659130100555924,"score_spread":0.20835109702233967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069239201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037029177,0.0043401457,0.94929826,0.0011811326,0.00023705636,0.00007719439,0.00014804053,0.0006353972,0.007053666],"genre_scores_gemma":[0.8920283,0.0049806335,0.090971686,0.00031323123,0.00049482594,0.00028047705,0.00030430514,0.00020200481,0.010424505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719256,0.0010259509,0.00015251551,0.00040153085,0.0008734586,0.00035392217],"domain_scores_gemma":[0.980602,0.015347681,0.0010770457,0.0014976055,0.0010487986,0.00042679574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025693364,0.000594406,0.0017809939,0.0010619112,0.0015910335,0.002210427,0.0021255205,0.0017115794,0.0018709726],"category_scores_gemma":[0.019688586,0.0012452755,0.0005152824,0.001982166,0.002649199,0.0032940423,0.0016947897,0.0015983667,0.0004500304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036375693,0.00007463469,0.0013949948,0.0005847492,0.000070853814,0.00015910486,0.00038396948,0.5423565,0.0029528153,0.38470277,0.0055642393,0.061391704],"study_design_scores_gemma":[0.00008359343,0.00006195765,0.0003334538,0.000031179054,0.000054836608,0.00011847837,0.000063984175,0.72626215,0.0010939322,0.2663286,0.005541548,0.000026305925],"about_ca_topic_score_codex":0.003648922,"about_ca_topic_score_gemma":0.0034266082,"teacher_disagreement_score":0.003648922,"about_ca_system_score_codex":0.0024908136,"about_ca_system_score_gemma":0.0017971284,"threshold_uncertainty_score":0.018072248},"labels":[],"label_agreement":null},{"id":"W2069381764","doi":"10.1016/j.comnet.2012.02.002","title":"Optimization model for handoff-aware channel assignment problem for multi-radio wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Handover; Computer network; Wireless mesh network; Throughput; Tabu search; Load balancing (electrical power); Wireless; Optimization problem; Channel (broadcasting); Distributed computing; Wireless network; Algorithm; Grid; Telecommunications","score_opus":0.03579389945703969,"score_gpt":0.2541880922878915,"score_spread":0.21839419283085182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069381764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020709457,0.00073630066,0.96697456,0.0009137288,0.00013577091,0.00013304435,0.0003274934,0.00015369097,0.009915897],"genre_scores_gemma":[0.86531943,0.0014875089,0.11518859,0.0003201689,0.00021263913,0.00048088856,0.0005265098,0.00013312112,0.0163313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909544,0.00031362777,0.000029665362,0.00016902339,0.00020239525,0.00018992521],"domain_scores_gemma":[0.9991793,0.0004902243,0.0000931197,0.000034476445,0.00014902272,0.000053766336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012400434,0.0011666085,0.0015255467,0.00082860485,0.00058254733,0.0018040222,0.0020112942,0.0021714661,0.004788925],"category_scores_gemma":[0.0023370963,0.00064938003,0.00081823725,0.0013770852,0.00070360355,0.0016153889,0.0012459743,0.0015822245,0.00044937024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026944079,0.000028894761,0.00013050727,0.000048979444,0.000015293515,0.00004322697,0.000015247743,0.9865545,0.00036405463,0.007285452,0.0009644378,0.0045223734],"study_design_scores_gemma":[0.000005410055,0.000010492758,0.000046754652,0.0000033985564,0.0000053596773,0.000008033247,0.0000073572187,0.99766576,0.000046817786,0.0020276501,0.00017025167,0.0000026909368],"about_ca_topic_score_codex":0.008488754,"about_ca_topic_score_gemma":0.0061819446,"teacher_disagreement_score":0.008488754,"about_ca_system_score_codex":0.0018131341,"about_ca_system_score_gemma":0.0015985713,"threshold_uncertainty_score":0.016878664},"labels":[],"label_agreement":null},{"id":"W2069471802","doi":"10.1142/s0219265909002455","title":"BALANCING TRAFFIC LOAD USING ONE-TURN RECTILINEAR ROUTING","year":2009,"lang":"en","type":"article","venue":"Journal of Interconnection Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; University of Manitoba","funders":"","keywords":"Computer science; Routing (electronic design automation); Equal-cost multi-path routing; Static routing; Path (computing); Load balancing (electrical power); Path vector protocol; Reduction (mathematics); Mathematical optimization; Topology (electrical circuits); Computer network; Mathematics; Routing protocol; Combinatorics; Geometry; Grid","score_opus":0.01874577577433612,"score_gpt":0.2567553213121447,"score_spread":0.23800954553780856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069471802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25102136,0.000572602,0.7299737,0.00090285746,0.0001133239,0.00026105158,0.00025152965,0.0010447133,0.0158589],"genre_scores_gemma":[0.86059046,0.00036116515,0.1331011,0.00016254112,0.000026225352,0.00011977512,0.00019306489,0.00012925375,0.005316434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00029149165,0.000026813099,0.00015413667,0.000100998746,0.00023024959],"domain_scores_gemma":[0.9987733,0.0005525389,0.000251379,0.00019310806,0.000102137165,0.00012757981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008850376,0.0011182016,0.0010039184,0.0005188756,0.0008107086,0.0012133047,0.0012302856,0.000893309,0.0028831805],"category_scores_gemma":[0.0025208378,0.0004347198,0.00056928926,0.0008518785,0.0011656904,0.00177128,0.0012363619,0.00067275536,0.00060728507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023335853,0.00004821342,0.00039431168,0.00003593141,0.000017193583,0.000063718355,0.000048474,0.9706463,0.0039596427,0.010566129,0.0008360067,0.01315079],"study_design_scores_gemma":[0.000022035098,0.000065737375,0.00007234546,0.0000036119127,0.0000060832244,0.00002445536,0.000027548262,0.99304515,0.0009985059,0.005050477,0.0006753797,0.0000086707105],"about_ca_topic_score_codex":0.0062641264,"about_ca_topic_score_gemma":0.006484917,"teacher_disagreement_score":0.0062641264,"about_ca_system_score_codex":0.0016535823,"about_ca_system_score_gemma":0.0012467727,"threshold_uncertainty_score":0.012455344},"labels":[],"label_agreement":null},{"id":"W2069517129","doi":"10.1109/wimob.2012.6379076","title":"Minimum 2-connected distance-k p-dominating set in wireless sensor networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless sensor network; Dominating set; Computer science; Connected dominating set; Computer network; Set (abstract data type); Wireless; Key distribution in wireless sensor networks; Wireless network; Telecommunications; Theoretical computer science; Graph","score_opus":0.014151409508400593,"score_gpt":0.24169693006213477,"score_spread":0.22754552055373417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069517129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028538307,0.0009342537,0.9675597,0.00041550116,0.00006655173,0.0001683665,0.00020380721,0.00034885085,0.0017647694],"genre_scores_gemma":[0.38471547,0.0016135124,0.60930973,0.00028706432,0.000102018064,0.00051064545,0.00083828904,0.00009763836,0.0025256642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987791,0.0003918116,0.000080034326,0.00038559717,0.00027506094,0.00008842381],"domain_scores_gemma":[0.9984829,0.00085694017,0.00020100774,0.00016486627,0.00017412502,0.0001201698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010200221,0.001130885,0.0014296855,0.0009680064,0.00082087575,0.0012205783,0.002211924,0.0011294871,0.0010577862],"category_scores_gemma":[0.0045314874,0.00052441814,0.0009727148,0.0021652952,0.000764747,0.0026453766,0.0017972626,0.0008213984,0.00036537397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027658552,0.00014203321,0.0009674788,0.0005640542,0.000089733825,0.00019853617,0.00029860227,0.85174084,0.0059060673,0.03228354,0.0041001355,0.10343233],"study_design_scores_gemma":[0.00003369303,0.00014825034,0.00028099885,0.000028622026,0.000024713174,0.00017467143,0.0000679518,0.96053964,0.0022307392,0.034412898,0.002034039,0.00002375136],"about_ca_topic_score_codex":0.0012436776,"about_ca_topic_score_gemma":0.0013106313,"teacher_disagreement_score":0.002211924,"about_ca_system_score_codex":0.0012308124,"about_ca_system_score_gemma":0.0009875816,"threshold_uncertainty_score":0.008930147},"labels":[],"label_agreement":null},{"id":"W2070488564","doi":"10.1007/s11276-006-6547-9","title":"Energy-aware on-demand routing protocols for wireless ad hoc networks","year":2006,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Overhead (engineering); Distributed computing; Wireless Routing Protocol; Routing (electronic design automation); Wireless ad hoc network; Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.012573994560372382,"score_gpt":0.24523919266797836,"score_spread":0.23266519810760597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070488564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04770923,0.0060072127,0.9200639,0.0017565629,0.0011062729,0.00022776399,0.0002526379,0.0017567631,0.021119718],"genre_scores_gemma":[0.8340581,0.005207663,0.13618949,0.0004972569,0.0004558188,0.00020028284,0.00067843916,0.00039713152,0.022315782],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993548,0.00016019779,0.000036126152,0.0000572982,0.00030915413,0.00008248202],"domain_scores_gemma":[0.99891365,0.00042874017,0.00008193801,0.00026151986,0.00026633043,0.00004776048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008053934,0.00088566606,0.00081722037,0.0006593126,0.0007335047,0.0012969873,0.002008769,0.0008781876,0.002078619],"category_scores_gemma":[0.0019072244,0.00048235478,0.00031716147,0.0010110876,0.00047300183,0.0023573753,0.0012954392,0.0010873998,0.0004996422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079693465,0.00046420083,0.0011140831,0.0008742133,0.00020574896,0.0003962414,0.00036794366,0.3385275,0.05136773,0.103758454,0.031188745,0.4709383],"study_design_scores_gemma":[0.0000592131,0.00021576231,0.00065072667,0.000058310157,0.000094303,0.00045675316,0.00023424643,0.8712044,0.018611023,0.0770417,0.031310286,0.00006335625],"about_ca_topic_score_codex":0.0008145502,"about_ca_topic_score_gemma":0.0024631289,"teacher_disagreement_score":0.002078619,"about_ca_system_score_codex":0.0005888644,"about_ca_system_score_gemma":0.0005062155,"threshold_uncertainty_score":0.0069536567},"labels":[],"label_agreement":null},{"id":"W2071916869","doi":"10.1109/mownet.2013.6613793","title":"Botnets in 4G cellular networks: Platforms to launch DDoS attacks against the air interface","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Botnet; Denial-of-service attack; Computer network; Computer science; Computer security; Interface (matter); Quality of service; Operating system; The Internet","score_opus":0.009251033675300549,"score_gpt":0.22500423591145474,"score_spread":0.21575320223615418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071916869","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89653623,0.0006173387,0.09307086,0.0006650851,0.00014014964,0.00010722418,0.000112443944,0.0008879064,0.007862868],"genre_scores_gemma":[0.9927073,0.00011679949,0.006279232,0.00009830927,0.000007871505,0.000020498039,0.000028619588,0.000012478458,0.00072883314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996761,0.000114677256,0.000011937241,0.00002913732,0.00009448644,0.00007373095],"domain_scores_gemma":[0.9990101,0.0005065964,0.00014981448,0.00014752698,0.00012542143,0.00006054368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047149044,0.00036573643,0.00026132783,0.00054204185,0.0004962781,0.00042892603,0.00030728133,0.00080103416,0.0007387048],"category_scores_gemma":[0.0014014029,0.00014119901,0.0002993314,0.00022754507,0.0005852337,0.0008037894,0.00043844583,0.00043326043,0.00019206206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076833484,0.00043455162,0.03951969,0.00034525053,0.0002926146,0.0025501025,0.001243155,0.5608282,0.25972098,0.038654942,0.006456828,0.08918536],"study_design_scores_gemma":[0.000060239818,0.0006084993,0.006418268,0.00004150295,0.00006150961,0.0009043754,0.00030721442,0.92954814,0.04622502,0.0072217197,0.008558641,0.000044954457],"about_ca_topic_score_codex":0.0019278242,"about_ca_topic_score_gemma":0.0015650189,"teacher_disagreement_score":0.0019278242,"about_ca_system_score_codex":0.00053174555,"about_ca_system_score_gemma":0.00026006342,"threshold_uncertainty_score":0.003858149},"labels":[],"label_agreement":null},{"id":"W2072433332","doi":"10.1109/jsac.2004.829334","title":"Efficient On-Demand Routing for Mobile Ad Hoc Wireless Access Networks","year":2004,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Optimized Link State Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Link-state routing protocol; Zone Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.031042464260493473,"score_gpt":0.31459880225380865,"score_spread":0.2835563379933152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072433332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020006958,0.0039207754,0.9626477,0.0007444636,0.00033064844,0.00023688228,0.00012943057,0.00052904227,0.011454061],"genre_scores_gemma":[0.6699868,0.00835125,0.30162853,0.0003693628,0.0004185672,0.0003503135,0.0009530103,0.00021180965,0.017730372],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993563,0.00022751521,0.000025427174,0.000044554552,0.0002883488,0.00005792076],"domain_scores_gemma":[0.99953127,0.00020089246,0.000058093552,0.00008014953,0.000105341314,0.000024220462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005186418,0.00058625895,0.0005443318,0.00041959388,0.00053118984,0.0009391064,0.0013064974,0.00067104376,0.0014031456],"category_scores_gemma":[0.001369255,0.00024076816,0.00026773795,0.00068300945,0.00036334633,0.0015233982,0.0008628803,0.00048665327,0.00051738514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020460089,0.00025226077,0.0013219207,0.0010622964,0.00012318525,0.000649071,0.00021373472,0.35263285,0.029721122,0.14618003,0.017741824,0.44989717],"study_design_scores_gemma":[0.000034992685,0.00018697229,0.00049961254,0.000040143004,0.00004157918,0.00051889813,0.00012020199,0.89553446,0.0064017735,0.049220853,0.047370996,0.000029519619],"about_ca_topic_score_codex":0.00085014105,"about_ca_topic_score_gemma":0.0017052857,"teacher_disagreement_score":0.0014031456,"about_ca_system_score_codex":0.00047975226,"about_ca_system_score_gemma":0.00040880858,"threshold_uncertainty_score":0.004693985},"labels":[],"label_agreement":null},{"id":"W2072584202","doi":"10.1109/ccece.2008.4564885","title":"Priority scheduling in mobile ad hoc networks with improved bandwidth utilization","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Network packet; Scheduling (production processes); Ad hoc wireless distribution service; Bandwidth allocation; Time division multiple access; Wireless network; Optimized Link State Routing Protocol; Wireless; Bandwidth (computing); Telecommunications; Routing protocol; Engineering","score_opus":0.015417424063178807,"score_gpt":0.19762883781427326,"score_spread":0.18221141375109445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072584202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050978933,0.009427085,0.92252016,0.0010503662,0.0011680394,0.00017659648,0.000065303015,0.0008825565,0.0137309125],"genre_scores_gemma":[0.7605785,0.0044659553,0.22615321,0.00039250273,0.0010644293,0.00016502233,0.00008767471,0.00013149464,0.0069611925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919635,0.00028709267,0.000046164547,0.000115305156,0.0002480567,0.000106972504],"domain_scores_gemma":[0.9987116,0.000632999,0.00012704184,0.00019205025,0.00024329413,0.00009301666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017910141,0.00045969314,0.0006506466,0.00074204244,0.00072836585,0.0011189039,0.0011016552,0.0005692673,0.0015283055],"category_scores_gemma":[0.004640447,0.00032820262,0.00021549957,0.0010069074,0.00060737104,0.0016182793,0.0006863922,0.0008723821,0.00047518642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066108536,0.00025044027,0.0015057689,0.00036380958,0.000064876695,0.00048805427,0.00046268664,0.35014942,0.021026786,0.26245922,0.009685499,0.35288233],"study_design_scores_gemma":[0.00014824311,0.00032269946,0.00047557612,0.000047149475,0.000054863354,0.0002810704,0.0000836027,0.892497,0.0038231637,0.07922178,0.023007592,0.000037195718],"about_ca_topic_score_codex":0.0023729661,"about_ca_topic_score_gemma":0.0022670568,"teacher_disagreement_score":0.0023729661,"about_ca_system_score_codex":0.0009155767,"about_ca_system_score_gemma":0.0010854598,"threshold_uncertainty_score":0.009471893},"labels":[],"label_agreement":null},{"id":"W2072592698","doi":"10.1007/s00446-012-0179-3","title":"Bounding the locality of distributed routing algorithms","year":2012,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Carleton University","funders":"","keywords":"Locality; Computer science; Bounding overwatch; Dilation (metric space); Equal-cost multi-path routing; Static routing; Node (physics); Neighbourhood (mathematics); Shortest path problem; Routing (electronic design automation); Mathematics; Algorithm; Computer network; Graph; Combinatorics; Routing protocol; Theoretical computer science","score_opus":0.01993346998580042,"score_gpt":0.2626555313645435,"score_spread":0.24272206137874308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072592698","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1317197,0.0030899358,0.84860843,0.003873344,0.00021586248,0.00010190187,0.00019002006,0.0012188685,0.010981943],"genre_scores_gemma":[0.9084959,0.00081303983,0.087002926,0.00031583643,0.00031756493,0.00018674432,0.00018700826,0.00030197276,0.0023790288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98995554,0.0048970487,0.00032757394,0.0013960749,0.0025834457,0.0008403225],"domain_scores_gemma":[0.89323896,0.08628561,0.0044104727,0.010193877,0.0042406875,0.0016303863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008003347,0.00080205564,0.0022701283,0.0022142911,0.0022304177,0.0031236827,0.0037077,0.0028410708,0.0020885766],"category_scores_gemma":[0.06333081,0.0010175132,0.0007505124,0.0025665346,0.0042826775,0.008459055,0.006230128,0.0032641788,0.00047076473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008203935,0.00024318283,0.0060192007,0.00041120904,0.00015851615,0.00019300588,0.0006716617,0.60060877,0.008165318,0.3267012,0.005622089,0.05038544],"study_design_scores_gemma":[0.000037150716,0.000069849244,0.00037273523,0.000020798861,0.000029267918,0.000065293134,0.000073829986,0.8657991,0.0017533802,0.1303283,0.0014341973,0.00001618682],"about_ca_topic_score_codex":0.0021767884,"about_ca_topic_score_gemma":0.0020833593,"teacher_disagreement_score":0.008003347,"about_ca_system_score_codex":0.0029484946,"about_ca_system_score_gemma":0.002204258,"threshold_uncertainty_score":0.042326212},"labels":[],"label_agreement":null},{"id":"W2072872070","doi":"10.1109/ainaw.2007.261","title":"Multi-channel Busy-tone Multiple Access for Scalable Wireless Mesh Network","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Network packet; Channel (broadcasting); Throughput; Multiple Access with Collision Avoidance for Wireless; Access control; Hidden node problem; Scalability; Media access control; Control channel; Wireless; Mesh networking; Wireless network; Routing protocol; Wi-Fi array; Base station; Telecommunications","score_opus":0.033333155025760924,"score_gpt":0.3007513197653568,"score_spread":0.2674181647395959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072872070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02581398,0.0024233267,0.96665055,0.0003751012,0.00018416562,0.000081077356,0.000028447424,0.00062203396,0.0038213811],"genre_scores_gemma":[0.7224913,0.0014565183,0.2717509,0.00020215168,0.0002648561,0.00029213843,0.00011421015,0.000063716034,0.0033642568],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996859,0.0001220575,0.000017396702,0.000035566587,0.000110358764,0.00002870757],"domain_scores_gemma":[0.9996024,0.0001746494,0.000041239764,0.00006543309,0.00007949772,0.000036808993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007136906,0.00024510527,0.00030669218,0.0003547311,0.0004823299,0.00046517316,0.0007644686,0.0003571233,0.0015632273],"category_scores_gemma":[0.0012299798,0.00013005637,0.00026589696,0.0002506141,0.00041440345,0.0008892738,0.000805793,0.00046282675,0.00022118745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039226186,0.000113802416,0.0024073427,0.0008041302,0.00017300679,0.0011526903,0.0006511076,0.13838623,0.13254851,0.24939707,0.010933412,0.46304038],"study_design_scores_gemma":[0.00009294266,0.0002704818,0.00065160193,0.000049134247,0.0000677035,0.00046383313,0.000088219516,0.9170441,0.00986414,0.037653968,0.033707574,0.00004621995],"about_ca_topic_score_codex":0.00044666245,"about_ca_topic_score_gemma":0.00075732684,"teacher_disagreement_score":0.0015632273,"about_ca_system_score_codex":0.00037041344,"about_ca_system_score_gemma":0.0004071782,"threshold_uncertainty_score":0.005229473},"labels":[],"label_agreement":null},{"id":"W2073112403","doi":"10.1108/17427370780000141","title":"Clustering concept and QoS constraints in dense mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Pervasive Computing and Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Quality of service; Cluster analysis; Multicast; Wireless ad hoc network; Distributed computing; Overhead (engineering); Routing protocol; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless; Artificial intelligence; Network packet","score_opus":0.013856558727639412,"score_gpt":0.2812451747245528,"score_spread":0.2673886159969134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073112403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09212595,0.0055552907,0.88716984,0.0013279457,0.0003154289,0.00017323963,0.00018213107,0.0004364625,0.012713702],"genre_scores_gemma":[0.7866982,0.0034542414,0.20312491,0.00034417099,0.00035917023,0.00020872845,0.00027444377,0.000085043524,0.0054510497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991505,0.00025459772,0.000055390163,0.00014612777,0.00032767313,0.00006569106],"domain_scores_gemma":[0.9984211,0.0008040963,0.0002453548,0.00010594578,0.0003232432,0.00010030218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007912261,0.00045859805,0.00042615624,0.00097283634,0.00070788414,0.0010178772,0.0009433442,0.00087077887,0.0011484573],"category_scores_gemma":[0.003647439,0.00027489068,0.00020466237,0.0016995976,0.0007487165,0.0018340452,0.0007743775,0.0007054926,0.000282946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022482328,0.00011294963,0.003819982,0.0007177606,0.000069189875,0.0010706357,0.0008615447,0.40948364,0.017681064,0.3890324,0.006543142,0.17038293],"study_design_scores_gemma":[0.00004320642,0.00022291669,0.0019579802,0.000078703226,0.000034217766,0.0009814986,0.00055462186,0.8072408,0.0049054655,0.15423353,0.02969087,0.000056253317],"about_ca_topic_score_codex":0.002862334,"about_ca_topic_score_gemma":0.0021326432,"teacher_disagreement_score":0.002862334,"about_ca_system_score_codex":0.0008291127,"about_ca_system_score_gemma":0.0006187453,"threshold_uncertainty_score":0.0060156584},"labels":[],"label_agreement":null},{"id":"W2073326448","doi":"10.1109/icices.2014.7033915","title":"A robust trust aware secure intrusion detection in MANET","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Router; Intrusion detection system; Computer security; Wireless ad hoc network; Mobile device; Collusion; Vulnerability (computing); Network packet; Wireless; Telecommunications; Business; World Wide Web","score_opus":0.010295819322060171,"score_gpt":0.2020687863679975,"score_spread":0.19177296704593733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073326448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06619082,0.0006909587,0.9282925,0.00022790357,0.00017489909,0.00017998883,0.000054876793,0.0019130508,0.002275065],"genre_scores_gemma":[0.9092643,0.0002458823,0.088410646,0.00010221143,0.000055934855,0.0000686145,0.00008587674,0.000032563723,0.0017339764],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988368,0.00027245426,0.00009229521,0.00021825379,0.00044742,0.00013277082],"domain_scores_gemma":[0.99876165,0.0003528451,0.00019110905,0.0002848019,0.0003282489,0.0000814042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091548945,0.00046465377,0.00092659675,0.00064926705,0.0004579714,0.0009290769,0.0010080208,0.000609863,0.00070972246],"category_scores_gemma":[0.002498341,0.00024420788,0.00039168555,0.0004773963,0.0006075858,0.0013643055,0.0012716885,0.0006438451,0.00035101385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013860042,0.00041699235,0.0052457517,0.00029503694,0.00027932003,0.0012549172,0.00033295818,0.39764884,0.09780232,0.03127845,0.0063801226,0.45767924],"study_design_scores_gemma":[0.000020008893,0.00020026315,0.00038221126,0.00000726975,0.000027589398,0.00025164132,0.000025708741,0.9843992,0.011109424,0.0020981196,0.0014607213,0.000017897682],"about_ca_topic_score_codex":0.00069244957,"about_ca_topic_score_gemma":0.0005843293,"teacher_disagreement_score":0.0010080208,"about_ca_system_score_codex":0.00047123592,"about_ca_system_score_gemma":0.00066953554,"threshold_uncertainty_score":0.004841566},"labels":[],"label_agreement":null},{"id":"W2073373149","doi":"10.1109/wcsp.2011.6096749","title":"A game based routing algorithm for congestion control of multimedia transmission in VANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Network congestion; Wireless ad hoc network; Quality of service; Node (physics); Transmission (telecommunications); Routing (electronic design automation); Distributed computing; Multimedia; Telecommunications","score_opus":0.019032577391154156,"score_gpt":0.23120276154318736,"score_spread":0.2121701841520332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073373149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012757939,0.0002451437,0.98236406,0.00022918452,0.000082554834,0.00018537075,0.000034740162,0.00029353765,0.0038074714],"genre_scores_gemma":[0.6383116,0.00043840625,0.3547337,0.00023535403,0.00005485681,0.00051526254,0.000121595054,0.00007857717,0.0055105295],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948263,0.00024548548,0.000026616173,0.00007063478,0.00011455648,0.000060148363],"domain_scores_gemma":[0.9995376,0.000257398,0.000040571565,0.000019036232,0.00010613549,0.000039290928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010232511,0.00083075406,0.00093719177,0.00086737756,0.00075241656,0.0009395602,0.0015876483,0.0009577821,0.0016856054],"category_scores_gemma":[0.0019196266,0.0003169514,0.00052402314,0.0006352545,0.0007320306,0.001103837,0.0009775576,0.0007697582,0.00022425831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008544774,0.00008069017,0.00035587372,0.000063214844,0.00004959826,0.00011110686,0.000116591335,0.90346235,0.002176176,0.03892341,0.0023404043,0.05223515],"study_design_scores_gemma":[0.000016701153,0.000034985875,0.00003201648,0.0000035586627,0.0000065592044,0.000022726024,0.000010549522,0.9953832,0.00015400027,0.003679093,0.0006503461,0.0000062688423],"about_ca_topic_score_codex":0.008113004,"about_ca_topic_score_gemma":0.0076578953,"teacher_disagreement_score":0.008113004,"about_ca_system_score_codex":0.0011935937,"about_ca_system_score_gemma":0.0014336304,"threshold_uncertainty_score":0.01613152},"labels":[],"label_agreement":null},{"id":"W2073895554","doi":"10.1002/dac.797","title":"Improving broadcast performance by traffic isolation in wireless<i>ad hoc</i>networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Computer network; Broadcasting (networking); Broadcast radiation; Flooding (psychology); Node (physics); Overhead (engineering); Default gateway; Wireless ad hoc network; Cluster analysis; Mobile ad hoc network; Network packet; Wireless; Distributed computing; Telecommunications","score_opus":0.007231837939788494,"score_gpt":0.22662799347500628,"score_spread":0.2193961555352178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073895554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45213425,0.001695893,0.5333183,0.00034589932,0.00016719659,0.00006725988,0.00004247768,0.0022099838,0.010018813],"genre_scores_gemma":[0.951599,0.0004325548,0.04610603,0.000055848323,0.00010794654,0.000029342531,0.00009580878,0.00008510316,0.0014883011],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996137,0.000103269296,0.000016849795,0.00004770806,0.00014062569,0.00007788354],"domain_scores_gemma":[0.99852777,0.0007747024,0.00017590057,0.000121439516,0.00030482005,0.00009531997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062785554,0.00045430986,0.00051202334,0.00065708195,0.00059381453,0.0007301491,0.00081702607,0.00036711083,0.0009020925],"category_scores_gemma":[0.002345462,0.00022097497,0.00017407713,0.0004347749,0.00040251343,0.0009730412,0.0005918914,0.00045901374,0.00042851816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016458256,0.00061226456,0.0069241244,0.0004349874,0.00014328022,0.00042970362,0.0006307855,0.2848708,0.22938322,0.010738048,0.004929765,0.4592572],"study_design_scores_gemma":[0.000116145915,0.00080049294,0.0018885885,0.00002776608,0.00013300241,0.0003993476,0.00016575021,0.91200346,0.0754624,0.004227387,0.0047428813,0.000032680888],"about_ca_topic_score_codex":0.0008863056,"about_ca_topic_score_gemma":0.00074623054,"teacher_disagreement_score":0.0009020925,"about_ca_system_score_codex":0.00048190737,"about_ca_system_score_gemma":0.00040313782,"threshold_uncertainty_score":0.003496468},"labels":[],"label_agreement":null},{"id":"W2074266386","doi":"10.1109/ccece.2008.4564610","title":"&amp;#x03B5; -Optimal approximation scheme for on-demand multipath routing in Ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Wireless ad hoc network; Distance-vector routing protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Limiting; Network packet; Distributed computing; Telecommunications; Wireless; Engineering","score_opus":0.022667158731218724,"score_gpt":0.2094686368479869,"score_spread":0.18680147811676817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074266386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07291604,0.00047129855,0.9207919,0.00032774045,0.00011677121,0.00008411262,0.00006739194,0.00036307276,0.0048616766],"genre_scores_gemma":[0.81117886,0.00041172118,0.18584277,0.00006887917,0.00004310698,0.00008343048,0.0001217194,0.000039234794,0.0022103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904317,0.0002524995,0.0000418767,0.00007290455,0.00047529768,0.00011412748],"domain_scores_gemma":[0.99871325,0.0004987549,0.00014948114,0.0002561259,0.00032981727,0.000052507057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264865,0.0003742549,0.00054316985,0.0005379456,0.00058301445,0.00084417494,0.0012732599,0.0006706828,0.0011405847],"category_scores_gemma":[0.005276446,0.00016216142,0.00034970453,0.00055272045,0.0006373118,0.0010934168,0.00081955054,0.0006697783,0.00022435005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004928541,0.00010412032,0.0014642801,0.00013158427,0.000056763194,0.00017628823,0.00016854057,0.77470917,0.015675092,0.07889579,0.0028224604,0.12530312],"study_design_scores_gemma":[0.000015947253,0.00007865294,0.00011556836,0.00000819423,0.000010226254,0.00009470659,0.000024030198,0.98941606,0.0022572766,0.006670817,0.0012987326,0.000009767606],"about_ca_topic_score_codex":0.003686336,"about_ca_topic_score_gemma":0.002416829,"teacher_disagreement_score":0.003686336,"about_ca_system_score_codex":0.0013694469,"about_ca_system_score_gemma":0.0011508814,"threshold_uncertainty_score":0.009936094},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00874489416949657,"score_gpt":0.22284190717669888,"score_spread":0.21409701300720232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074320386","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013078876,0.0016800972,0.13909821,0.0050939037,0.0037881762,0.0006427631,0.0035470808,0.010044433,0.8230264],"genre_scores_gemma":[0.12421722,0.002676319,0.09437491,0.0028443579,0.0015805417,0.00063129276,0.011536097,0.0016891999,0.76045007],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998075,0.00041113186,0.00014275085,0.0002436604,0.0009777123,0.00014978135],"domain_scores_gemma":[0.99661523,0.0003789581,0.00017982304,0.0008279827,0.0017186463,0.00027937302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016944814,0.0006109224,0.0003976007,0.0014245387,0.0011940746,0.0021235328,0.0012967638,0.0010972505,0.1420345],"category_scores_gemma":[0.0030039917,0.00023523539,0.00048696576,0.0009162984,0.0004380884,0.0019210505,0.0018518753,0.00095702993,0.07374258],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000377126,0.0002104435,0.0018422526,0.0003985192,0.00004033704,0.0005971298,0.00023218786,0.0022409884,0.019788045,0.10607428,0.35311282,0.51508594],"study_design_scores_gemma":[0.000044319557,0.00012120367,0.00086006627,0.0000689036,0.00002013349,0.00072168186,0.00011170343,0.0062488443,0.006235397,0.010227825,0.9753082,0.000031760934],"about_ca_topic_score_codex":0.0016082588,"about_ca_topic_score_gemma":0.0020401739,"teacher_disagreement_score":0.1420345,"about_ca_system_score_codex":0.0010186188,"about_ca_system_score_gemma":0.0015688348,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2074578978","doi":"10.1109/mcit.2010.5444868","title":"Performance improvement of ad hoc networks using directional antennas and power control","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Wireless ad hoc network; Directional antenna; Computer science; Power control; Computer network; Network packet; Mobile ad hoc network; Transmission (telecommunications); Ad hoc wireless distribution service; Vehicular ad hoc network; Power (physics); Wireless; Optimized Link State Routing Protocol; Telecommunications; Antenna (radio)","score_opus":0.005978337577671705,"score_gpt":0.20916415315438108,"score_spread":0.20318581557670937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074578978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41283515,0.0075740553,0.5481584,0.0006683041,0.00026885196,0.00007861311,0.0000666154,0.0020446274,0.02830552],"genre_scores_gemma":[0.9719097,0.00167943,0.024590962,0.00007269345,0.00009036275,0.000020077918,0.000050415365,0.0000429116,0.0015435012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993278,0.00023834864,0.000036136647,0.00008289948,0.00022284737,0.0000920341],"domain_scores_gemma":[0.9988181,0.0005592968,0.00013161155,0.00018679978,0.00025667512,0.000047525293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006899642,0.00074090477,0.00036242369,0.00046962852,0.00026800152,0.0007057751,0.0005156976,0.0004351821,0.0007273777],"category_scores_gemma":[0.002551864,0.00018122738,0.00016530439,0.0005273409,0.00039318163,0.0010492037,0.0005519891,0.00043984837,0.00032316925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008356351,0.0003723577,0.005186514,0.00035425328,0.00013122306,0.0004469609,0.0002200114,0.38495058,0.21604696,0.021672543,0.002684268,0.36709878],"study_design_scores_gemma":[0.00010593781,0.0017420423,0.0036751372,0.00004362523,0.0001621995,0.00094462675,0.0001545901,0.8783937,0.09157904,0.010042764,0.013090354,0.00006596322],"about_ca_topic_score_codex":0.00026399962,"about_ca_topic_score_gemma":0.00021115749,"teacher_disagreement_score":0.00074090477,"about_ca_system_score_codex":0.00026713748,"about_ca_system_score_gemma":0.00021484288,"threshold_uncertainty_score":0.0036489367},"labels":[],"label_agreement":null},{"id":"W2074815468","doi":"10.1109/qbsc.2012.6221378","title":"Comparison of traditional and opportunistic multihop routing in wireless networking scalability","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Scalability; Routing protocol; Distributed computing; Multipath routing; Routing (electronic design automation); Link-state routing protocol; Dynamic Source Routing; Wireless network; Static routing; Geographic routing; Hierarchical routing; Wireless Routing Protocol; Wireless; Telecommunications","score_opus":0.08730446526821985,"score_gpt":0.30577615949593423,"score_spread":0.2184716942277144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074815468","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8858282,0.0068464577,0.08828628,0.0007616739,0.00014476593,0.00015598061,0.00012267228,0.00042174855,0.017432246],"genre_scores_gemma":[0.99354666,0.0007606899,0.0051198974,0.000032136133,0.00004057142,0.000028955243,0.000029588233,0.000018310391,0.00042303794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811953,0.00075711973,0.000085262844,0.0001017361,0.0007739431,0.00016228973],"domain_scores_gemma":[0.9861859,0.011434447,0.00050581654,0.000689164,0.00091468194,0.00026993194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003545243,0.0004504622,0.00043271933,0.000740831,0.00035707734,0.0005433666,0.0006690236,0.0004549651,0.00071429077],"category_scores_gemma":[0.0110879075,0.00018031165,0.00027418893,0.0007095625,0.00064504496,0.0017235415,0.00078628794,0.0002747521,0.00006589549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014416889,0.00039263986,0.016336406,0.0005724471,0.00026968427,0.0008965658,0.00046169345,0.7438405,0.049390838,0.025843274,0.0016911413,0.15886301],"study_design_scores_gemma":[0.000121146404,0.0020179027,0.012572882,0.00007777461,0.0001779216,0.0009846574,0.00051652594,0.9558225,0.016754588,0.008060834,0.0028353252,0.000057909343],"about_ca_topic_score_codex":0.0009168491,"about_ca_topic_score_gemma":0.0014358589,"teacher_disagreement_score":0.003545243,"about_ca_system_score_codex":0.00063241407,"about_ca_system_score_gemma":0.0004994036,"threshold_uncertainty_score":0.018749237},"labels":[],"label_agreement":null},{"id":"W2075811253","doi":"10.1007/s00446-010-0093-5","title":"Broadcasting in UDG radio networks with missing and inaccurate information","year":2010,"lang":"en","type":"article","venue":"Distributed Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Broadcasting (networking); Computer science; Radio broadcasting; Position (finance); Unit disk; Granularity; Computer network; Topology (electrical circuits); Constant (computer programming); Euclidean distance; Algorithm; Network topology; Node (physics); Mathematics; Discrete mathematics; Telecommunications; Combinatorics; Physics","score_opus":0.005497823584374866,"score_gpt":0.20698768423502492,"score_spread":0.20148986065065005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075811253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22507223,0.0028756221,0.7610226,0.0020917444,0.00034021903,0.00016903419,0.0003989306,0.0011286058,0.0069010556],"genre_scores_gemma":[0.95226616,0.0010950239,0.04202182,0.00018011268,0.00022549949,0.00006883593,0.00023165997,0.00012727108,0.0037837492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970847,0.0009071984,0.00016710273,0.00041804538,0.0008166261,0.0006064222],"domain_scores_gemma":[0.98126537,0.013839799,0.0013454447,0.0015397145,0.0016085367,0.00040115553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043699644,0.0006500612,0.0023468928,0.0019941793,0.0020558634,0.003237106,0.002075409,0.0020150554,0.0013291169],"category_scores_gemma":[0.026835639,0.0015463966,0.00042991398,0.004002226,0.0022907658,0.0037554565,0.0022181473,0.0013982927,0.00035025974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012178377,0.00012456832,0.0062942277,0.00039574632,0.00012405393,0.0014220148,0.0011628226,0.82685757,0.006220646,0.066882566,0.0045567397,0.08474124],"study_design_scores_gemma":[0.000025314395,0.0000431089,0.0004695115,0.00001722345,0.000053196203,0.00023105681,0.0001830025,0.97508496,0.0015455672,0.021367714,0.00096004806,0.000019323119],"about_ca_topic_score_codex":0.010645292,"about_ca_topic_score_gemma":0.010180228,"teacher_disagreement_score":0.010645292,"about_ca_system_score_codex":0.0026681165,"about_ca_system_score_gemma":0.001479742,"threshold_uncertainty_score":0.023110807},"labels":[],"label_agreement":null},{"id":"W2076647216","doi":"10.1002/wcm.948","title":"Security mechanism for voice over multipath mobile<i>ad hoc</i>networks","year":2010,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Instituto de Telecomunicações","keywords":"Computer science; Computer network; Mobile ad hoc network; Voice over IP; Wireless network; Multipath propagation; Wireless ad hoc network; Wireless; Correctness; Computer security; Telecommunications; Network packet; The Internet","score_opus":0.012558085500390682,"score_gpt":0.27036576038737065,"score_spread":0.25780767488698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076647216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25957456,0.001290296,0.7279957,0.0010901339,0.00027727245,0.00032903563,0.00008670096,0.0015406823,0.007815546],"genre_scores_gemma":[0.9750968,0.00020670219,0.023206906,0.000089032495,0.000054329936,0.000054438904,0.000025990812,0.000011314636,0.0012544512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992933,0.0001843868,0.000062460975,0.000103494174,0.00021909259,0.00013728964],"domain_scores_gemma":[0.9980404,0.00053528236,0.00049657543,0.00039535022,0.0004219438,0.0001104912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100395,0.00034049267,0.00041189973,0.000779788,0.0009506783,0.00092553,0.00074531836,0.0006938342,0.0009775404],"category_scores_gemma":[0.0020408265,0.00019348621,0.0004292948,0.00033432446,0.0009964672,0.0013330145,0.0012920826,0.0006268502,0.00018851162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016923172,0.00025025368,0.0073219147,0.0006665118,0.00036566323,0.002826567,0.0017637326,0.080449104,0.26634377,0.4194646,0.008164951,0.21069054],"study_design_scores_gemma":[0.0003458291,0.0017163233,0.002917734,0.00020594936,0.00045764277,0.003985245,0.00066777563,0.6480356,0.19530259,0.102690704,0.04342996,0.0002447132],"about_ca_topic_score_codex":0.00045317685,"about_ca_topic_score_gemma":0.00021467802,"teacher_disagreement_score":0.001100395,"about_ca_system_score_codex":0.00075427414,"about_ca_system_score_gemma":0.0006126495,"threshold_uncertainty_score":0.0058194995},"labels":[],"label_agreement":null},{"id":"W2076663834","doi":"10.1109/icwmc.2007.68","title":"POSANT: A Position Based Ant Colony Routing Algorithm for Mobile Ad-hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Ant colony optimization algorithms; Optimized Link State Routing Protocol; Link-state routing protocol; Dynamic Source Routing; Distributed computing; Wireless ad hoc network; Wireless Routing Protocol; Algorithm; Routing (electronic design automation); Routing protocol; Telecommunications; Wireless","score_opus":0.008560779002223932,"score_gpt":0.2492589295957286,"score_spread":0.24069815059350466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076663834","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011117472,0.00061553274,0.9805108,0.00017173625,0.0002001959,0.00017479192,0.000068016896,0.0018363196,0.005305169],"genre_scores_gemma":[0.2252206,0.00066757965,0.76060444,0.00023444867,0.00006447191,0.00039994754,0.00031059879,0.00022146218,0.012276444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996942,0.000081524355,0.00001892726,0.000039673036,0.0001489348,0.000016647939],"domain_scores_gemma":[0.9997074,0.00010208373,0.00004720418,0.00003304125,0.00008309263,0.00002724696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035572913,0.0006574747,0.00072550547,0.00044200922,0.00045851563,0.0005560409,0.0012388133,0.00083288626,0.001544883],"category_scores_gemma":[0.0011054619,0.00027421222,0.0003276374,0.0005203352,0.00037547885,0.0008057514,0.0006242385,0.0006660561,0.00074663426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003691889,0.000222855,0.0012192549,0.00047761007,0.00015051331,0.0006801927,0.00021377581,0.3843796,0.049114518,0.024118917,0.014149878,0.5249037],"study_design_scores_gemma":[0.0000985704,0.000302515,0.00036473956,0.00001984745,0.00004345674,0.00055748364,0.000029605315,0.94989806,0.009207626,0.008289701,0.0311504,0.000037920094],"about_ca_topic_score_codex":0.00081862794,"about_ca_topic_score_gemma":0.0015095717,"teacher_disagreement_score":0.001544883,"about_ca_system_score_codex":0.00020064322,"about_ca_system_score_gemma":0.0004199873,"threshold_uncertainty_score":0.0051681995},"labels":[],"label_agreement":null},{"id":"W2076994310","doi":"10.1142/s0129054103001741","title":"A ZONAL ALGORITHM FOR CLUSTERING AN HOC NETWORKS","year":2003,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected dominating set; Dominating set; Mobile ad hoc network; Wireless ad hoc network; Computer science; Cluster analysis; Vertex (graph theory); Graph; Algorithm; Mathematics; Theoretical computer science; Computer network; Wireless; Artificial intelligence","score_opus":0.01905439722890007,"score_gpt":0.3031961872650348,"score_spread":0.2841417900361347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076994310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030149717,0.0005630007,0.99333006,0.0001472515,0.00009383309,0.00014383892,0.00007132791,0.0006544783,0.0019812228],"genre_scores_gemma":[0.057720713,0.00079580885,0.9350984,0.00016153781,0.000079983874,0.00037835885,0.00042387517,0.0001832769,0.005157963],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987834,0.00033623163,0.0000772215,0.00025287957,0.00045690162,0.000093329116],"domain_scores_gemma":[0.998749,0.00036321982,0.000113992726,0.0002722428,0.00044067224,0.000060954666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011599377,0.0009471163,0.00089944556,0.0021246923,0.0015144921,0.001536125,0.0020069613,0.0011561381,0.003899787],"category_scores_gemma":[0.0048192497,0.0004840548,0.00063235266,0.0031961815,0.0010079377,0.002558502,0.001972164,0.0010588049,0.0016514307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002592399,0.000087146516,0.0010535402,0.00031855507,0.00012234888,0.00009451486,0.00031436823,0.41053167,0.0076025007,0.07206834,0.014868272,0.49267948],"study_design_scores_gemma":[0.00007720827,0.00010681233,0.00033562828,0.000034367644,0.000035792735,0.00017450584,0.000093510345,0.90316176,0.0032273717,0.047675308,0.045025904,0.00005186668],"about_ca_topic_score_codex":0.00652884,"about_ca_topic_score_gemma":0.009337933,"teacher_disagreement_score":0.00652884,"about_ca_system_score_codex":0.0011615641,"about_ca_system_score_gemma":0.0016433861,"threshold_uncertainty_score":0.013046086},"labels":[],"label_agreement":null},{"id":"W2077045913","doi":"10.1109/wmnc.2014.6878853","title":"Routing in unmanned aerial ad hoc networks: Introducing a route reliability criterion","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Reliability (semiconductor); Computer network; Wireless ad hoc network; Ad hoc On-Demand Distance Vector Routing; Routing (electronic design automation); Routing protocol; Selection (genetic algorithm); Optimized Link State Routing Protocol; Distributed computing; Telecommunications; Wireless; Artificial intelligence","score_opus":0.006942670830134583,"score_gpt":0.22498166317854257,"score_spread":0.21803899234840798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077045913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022696573,0.0014467961,0.971548,0.0004175872,0.00016698608,0.000061800936,0.000041823703,0.00023845035,0.003381952],"genre_scores_gemma":[0.5318299,0.0022588023,0.46187985,0.00021281136,0.00051535777,0.00015845556,0.00009097975,0.00013153628,0.0029223608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991775,0.00025777146,0.0000535364,0.00009507504,0.0003768501,0.0000393048],"domain_scores_gemma":[0.9985196,0.00062615314,0.00028414614,0.00013341305,0.00037623887,0.000060447164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013441605,0.00056529266,0.00042151805,0.0008376685,0.00028802123,0.0006415182,0.0008285961,0.0006844632,0.0004751699],"category_scores_gemma":[0.0034144775,0.00018359296,0.0002551959,0.00049956766,0.00079461455,0.0018394269,0.0007259958,0.00070861884,0.00022251839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008125003,0.00009561604,0.0021730545,0.00046052836,0.00007999037,0.0005082599,0.00034648273,0.5834556,0.05766211,0.16838406,0.0035513982,0.18320167],"study_design_scores_gemma":[0.000012231051,0.00023449,0.0007528423,0.000036633766,0.000028653792,0.0002644331,0.00005554566,0.9574102,0.008307068,0.023201786,0.00965871,0.000037485992],"about_ca_topic_score_codex":0.0009501944,"about_ca_topic_score_gemma":0.0009790638,"teacher_disagreement_score":0.0013441605,"about_ca_system_score_codex":0.00051001407,"about_ca_system_score_gemma":0.00047382247,"threshold_uncertainty_score":0.0071086884},"labels":[],"label_agreement":null},{"id":"W2077049284","doi":"10.1109/bsc.2010.5472958","title":"Achieving fair cooperation for multi-hop ad hoc networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Selfishness; Computer science; Wireless ad hoc network; Computer network; Hop (telecommunications); Vehicular ad hoc network; Mobile ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Computer security; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.020100897320998568,"score_gpt":0.2653099521824745,"score_spread":0.24520905486147593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077049284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012466369,0.0009064933,0.982474,0.00031802928,0.00009794858,0.000111672016,0.000014760744,0.00011590102,0.0034948864],"genre_scores_gemma":[0.7263683,0.0012587046,0.2676661,0.00018601,0.00022085653,0.00033952852,0.000048394304,0.000056714696,0.0038553586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966228,0.0012348212,0.00013244545,0.0003699401,0.0012165897,0.00042336126],"domain_scores_gemma":[0.9959998,0.0025352286,0.00029429104,0.00049729174,0.00043471748,0.00023867463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005634364,0.0011871425,0.0009004926,0.0007630403,0.001983641,0.0018661844,0.002155373,0.001461382,0.0010678713],"category_scores_gemma":[0.009957347,0.00039466025,0.00051241566,0.0010181944,0.0029957828,0.0032616016,0.0030988615,0.0014402337,0.0002832699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017829558,0.00013801642,0.0005490738,0.00025096931,0.000065420354,0.00028126762,0.0006418173,0.37134948,0.00812314,0.5339287,0.0023280834,0.08216579],"study_design_scores_gemma":[0.000056545046,0.00011283461,0.00014032936,0.000032876567,0.000030083302,0.00010708773,0.00007974464,0.5619037,0.0039155474,0.4268267,0.0067678466,0.000026698935],"about_ca_topic_score_codex":0.0015659991,"about_ca_topic_score_gemma":0.0014466709,"teacher_disagreement_score":0.005634364,"about_ca_system_score_codex":0.001750032,"about_ca_system_score_gemma":0.0024886522,"threshold_uncertainty_score":0.029797733},"labels":[],"label_agreement":null},{"id":"W2077174285","doi":"10.1145/1089761.1089779","title":"FuzzyCCG","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Wireless ad hoc network; Scalability; Throughput; Network congestion; Network packet; Fuzzy logic; Wireless network; Node (physics); Vehicular ad hoc network; Mobility model; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.009302265710926863,"score_gpt":0.22426935032871242,"score_spread":0.21496708461778558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077174285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02726563,0.0012952129,0.83422756,0.0014330909,0.00045979136,0.00018606968,0.0006597177,0.0013705121,0.13310231],"genre_scores_gemma":[0.5500728,0.0015077735,0.39497954,0.0012729273,0.00032052287,0.00029426272,0.001104388,0.00020395117,0.05024388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991904,0.00013623801,0.0000765834,0.00024655496,0.00027854295,0.00007178991],"domain_scores_gemma":[0.99911326,0.00034620333,0.00011104555,0.00012609224,0.00026070944,0.000042699576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089812034,0.00039985907,0.0004152392,0.0012240281,0.0010835087,0.0017992355,0.0007712429,0.0008504202,0.014582358],"category_scores_gemma":[0.002548223,0.00016858232,0.00080742355,0.0008235415,0.0013071421,0.001941111,0.00097537873,0.0008108222,0.0027247027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019584535,0.000052180843,0.0009260423,0.0002821961,0.000034899844,0.00044494646,0.00038084137,0.01962971,0.0061656255,0.7405341,0.0069311117,0.22442243],"study_design_scores_gemma":[0.00007289811,0.00018955943,0.0009289432,0.00018159494,0.000058589914,0.00085655414,0.00022328764,0.12043907,0.008551813,0.6958483,0.17257865,0.00007081313],"about_ca_topic_score_codex":0.0022941434,"about_ca_topic_score_gemma":0.0017619644,"teacher_disagreement_score":0.014582358,"about_ca_system_score_codex":0.0012106218,"about_ca_system_score_gemma":0.00079873635,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2077363378","doi":"10.1109/iscc.2010.5546617","title":"Optimal path selection for file downloading in P2P overlay networks on MANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Server; Computer network; Upload; Download; Overlay network; File sharing; Mobile ad hoc network; Wireless network; The Internet; File server; Overlay; Wireless; Distributed computing; Operating system","score_opus":0.006906042323954078,"score_gpt":0.22625198861682252,"score_spread":0.21934594629286844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077363378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13281126,0.0018183568,0.8552973,0.00087939046,0.000091359114,0.00026225083,0.00033421218,0.00038253353,0.008123348],"genre_scores_gemma":[0.87519175,0.0016731049,0.11685235,0.00008301428,0.00010616939,0.00025324605,0.00024166635,0.0001294839,0.005469155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993339,0.00033502022,0.000023175751,0.00009696373,0.000098828285,0.00011195187],"domain_scores_gemma":[0.99720025,0.002366906,0.00013412716,0.000067491696,0.0001259853,0.00010522392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011211295,0.0010738637,0.0015896056,0.0009585749,0.0008741528,0.0011126943,0.00096670736,0.0010088888,0.0031900802],"category_scores_gemma":[0.0046445876,0.0007291002,0.000400638,0.0016027038,0.0010998312,0.0016356239,0.0010237221,0.0006746163,0.0003701314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009424705,0.000042845553,0.0002910032,0.00007058219,0.000018815717,0.000076952354,0.00005248751,0.9780491,0.0007940111,0.007895541,0.0013845067,0.011229761],"study_design_scores_gemma":[0.000017699183,0.000024410972,0.000086003194,0.0000042353654,0.0000063167454,0.000019160683,0.000025033392,0.9928416,0.00017554474,0.0065267617,0.00026752398,0.000005748934],"about_ca_topic_score_codex":0.0057478207,"about_ca_topic_score_gemma":0.006628476,"teacher_disagreement_score":0.0057478207,"about_ca_system_score_codex":0.0015419106,"about_ca_system_score_gemma":0.0013266557,"threshold_uncertainty_score":0.011428714},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016323774929533245,"score_gpt":0.26279528677072655,"score_spread":0.2464715118411933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077715947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037535604,0.00042700145,0.9889193,0.00042083568,0.00010340908,0.00010490229,0.000024401832,0.00004750156,0.0061990535],"genre_scores_gemma":[0.6461173,0.002219637,0.3401911,0.0008008277,0.00043772062,0.00066513673,0.00007588874,0.00005602861,0.00943634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998019,0.0010448972,0.00007413973,0.00021279798,0.0005154186,0.00013384125],"domain_scores_gemma":[0.99852186,0.0009574839,0.00012390391,0.0001324744,0.00018868223,0.00007558018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020550878,0.0010537589,0.0010186707,0.0010399647,0.00089946954,0.0014542865,0.0020553079,0.0016377798,0.0023112283],"category_scores_gemma":[0.0042293943,0.00039143997,0.0013186089,0.0010739731,0.002181268,0.0032818208,0.0015792518,0.0025371208,0.0004045839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054973953,0.00007620522,0.00021120206,0.00015717388,0.000059760172,0.00012206595,0.00014779504,0.20078419,0.0033257804,0.76191944,0.0021123965,0.031029021],"study_design_scores_gemma":[0.0000320549,0.00014797038,0.000114981034,0.000038047154,0.00003313251,0.0001500674,0.000042164513,0.6346969,0.0008741804,0.35726407,0.0065668756,0.00003957516],"about_ca_topic_score_codex":0.0012476352,"about_ca_topic_score_gemma":0.0012142123,"teacher_disagreement_score":0.0023112283,"about_ca_system_score_codex":0.0019358674,"about_ca_system_score_gemma":0.0016732933,"threshold_uncertainty_score":0.014045775},"labels":[],"label_agreement":null},{"id":"W2077734953","doi":"10.1016/j.tcs.2013.08.011","title":"Randomised broadcasting: Memory vs. randomness","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Node (physics); Randomness; Broadcasting (networking); Computer science; Degree (music); Upper and lower bounds; Binary logarithm; Channel (broadcasting); Mathematics; Combinatorics; Discrete mathematics; Algorithm; Computer network; Theoretical computer science; Statistics","score_opus":0.007172847384616654,"score_gpt":0.22012452561771562,"score_spread":0.21295167823309896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077734953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18320818,0.0056158127,0.72622687,0.01417212,0.0013234675,0.00028699797,0.001047282,0.0012387799,0.06688047],"genre_scores_gemma":[0.94474703,0.0019467361,0.034730762,0.0014237289,0.0010942571,0.00029852684,0.00037154142,0.0003101007,0.015077336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929531,0.003566013,0.00032458466,0.0009286757,0.0011351319,0.00109243],"domain_scores_gemma":[0.90673065,0.07228342,0.003517461,0.012946769,0.0029544441,0.0015671456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006907916,0.0007418137,0.0020793462,0.0014700685,0.002253217,0.004225474,0.0032556048,0.003501731,0.009603726],"category_scores_gemma":[0.0601124,0.0008825681,0.0011291938,0.0019810118,0.006058808,0.0115717,0.004248761,0.00398849,0.0011956305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083018315,0.00005913117,0.00071447366,0.00022217212,0.000049875754,0.000112190595,0.0002621775,0.034830566,0.0014945064,0.93588793,0.0058208043,0.019715887],"study_design_scores_gemma":[0.00020019404,0.00013425903,0.00018521387,0.000076090815,0.000049960432,0.00018573602,0.00008356606,0.08582408,0.0014020031,0.9081434,0.0036557447,0.000059799993],"about_ca_topic_score_codex":0.0016544423,"about_ca_topic_score_gemma":0.0015387088,"teacher_disagreement_score":0.009603726,"about_ca_system_score_codex":0.0029281517,"about_ca_system_score_gemma":0.0032737073,"threshold_uncertainty_score":0.03653294},"labels":[],"label_agreement":null},{"id":"W2078839847","doi":"10.1007/s11235-011-9452-1","title":"EOBDBR: an Efficient Optimum Branching-Based Distributed Broadcast Routing protocol for wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Distributed computing; Wireless ad hoc network; Routing protocol; Link-state routing protocol; Dynamic Source Routing; Zone Routing Protocol; Ad hoc wireless distribution service; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.05016412436585522,"score_gpt":0.29562037130960084,"score_spread":0.24545624694374563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078839847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018772349,0.001011699,0.97274345,0.00035134467,0.00016613172,0.00013993989,0.00020647033,0.002300159,0.004308418],"genre_scores_gemma":[0.40253922,0.0009887621,0.5886024,0.00028338924,0.000105318686,0.00027637545,0.0007403664,0.0002964844,0.0061675995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923086,0.00020805506,0.0000344119,0.00008795662,0.00032950108,0.000109238004],"domain_scores_gemma":[0.9990809,0.00042713774,0.00007796149,0.00014305084,0.00017526437,0.00009557873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906674,0.00052671647,0.0010333807,0.0007700128,0.00074409525,0.0007823928,0.0016428432,0.00065544643,0.0023417182],"category_scores_gemma":[0.0025018037,0.0002898205,0.00028703245,0.0010243884,0.0005216795,0.0011046454,0.0017793865,0.001644055,0.0006021096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001710132,0.00033672247,0.0009245997,0.00043541603,0.00008090477,0.0001786097,0.00028213076,0.22259562,0.05468786,0.06606405,0.019382346,0.63332164],"study_design_scores_gemma":[0.00023419516,0.00019675148,0.00029614446,0.000033111253,0.000037333077,0.00015256995,0.000050741084,0.95051223,0.009499878,0.029610084,0.009342759,0.000034159453],"about_ca_topic_score_codex":0.0015564376,"about_ca_topic_score_gemma":0.003204737,"teacher_disagreement_score":0.0023417182,"about_ca_system_score_codex":0.0007566895,"about_ca_system_score_gemma":0.0012188855,"threshold_uncertainty_score":0.007833838},"labels":[],"label_agreement":null},{"id":"W2080342283","doi":"10.1109/icc.2012.6364493","title":"Highway multihop broadcast protocols for vehicular networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Broadcast radiation; Computer network; Computer science; Vehicular ad hoc network; Atomic broadcast; Multimedia Broadcast Multicast Service; Broadcast communication network; Wireless; Broadcast domain; Node (physics); IEEE 802.11p; Intelligent transportation system; Wireless ad hoc network; Broadcasting (networking); Telecommunications; Multicast; Network packet; Engineering","score_opus":0.02611990534645402,"score_gpt":0.2835022360055933,"score_spread":0.2573823306591393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080342283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006520217,0.021551663,0.93413436,0.0009616379,0.001334591,0.000597061,0.00089826284,0.0022834088,0.031718828],"genre_scores_gemma":[0.35982123,0.045053594,0.5190605,0.0011171686,0.001439963,0.0032468096,0.008926893,0.00048090168,0.0608529],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995009,0.0001379524,0.000046734007,0.00005005476,0.00021324023,0.000051119994],"domain_scores_gemma":[0.99960226,0.00010691537,0.00004242191,0.000066686036,0.0001632566,0.00001846956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047606844,0.00040195513,0.00052346976,0.0008156562,0.0005649417,0.00075749645,0.0011001922,0.0006045696,0.0042007617],"category_scores_gemma":[0.0009426092,0.00025256161,0.00030001393,0.0012742359,0.0003397783,0.00095029984,0.0008646927,0.0009884194,0.0018522234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001568357,0.0000960971,0.00071648625,0.0012441068,0.00010122927,0.00042554943,0.00035443855,0.05448742,0.01520363,0.23581743,0.06900918,0.6223876],"study_design_scores_gemma":[0.00013707891,0.00023409104,0.0009948778,0.00027558868,0.00011041312,0.00075489987,0.00024357732,0.18597923,0.010331788,0.124828786,0.6760114,0.00009822295],"about_ca_topic_score_codex":0.0021038675,"about_ca_topic_score_gemma":0.0023662455,"teacher_disagreement_score":0.0042007617,"about_ca_system_score_codex":0.0006873669,"about_ca_system_score_gemma":0.0008078511,"threshold_uncertainty_score":0.0140529275},"labels":[],"label_agreement":null},{"id":"W2080364483","doi":"10.1109/icos.2012.6417633","title":"On probability of link availability in original and modified AODV, FSR and OLSR using 802.11 and 802.11p","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Dalhousie University","funders":"","keywords":"Link-state routing protocol; Routing protocol; Optimized Link State Routing Protocol; Distance-vector routing protocol; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Overhead (engineering); Dynamic Source Routing; Network packet; Ad hoc On-Demand Distance Vector Routing","score_opus":0.03657583011199077,"score_gpt":0.2660539165057074,"score_spread":0.22947808639371664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080364483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3636576,0.00879276,0.6135463,0.0009796183,0.00043360368,0.00019611714,0.0006166714,0.0007995907,0.01097774],"genre_scores_gemma":[0.96630245,0.0018199526,0.030064108,0.000056723693,0.00012087536,0.00007086629,0.00024951,0.00006162973,0.0012538921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973369,0.000639006,0.00018172164,0.0005137121,0.0010738729,0.0002547879],"domain_scores_gemma":[0.9847874,0.011052892,0.0013250579,0.00089555397,0.0017096617,0.00022945057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003725887,0.0007025874,0.0006806442,0.0022994876,0.00062377605,0.0012718962,0.001444511,0.0007360851,0.00076070573],"category_scores_gemma":[0.014784393,0.00041144958,0.000700432,0.0017311226,0.001033495,0.0026699672,0.0009346104,0.0007059291,0.00015436955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047364022,0.00015005737,0.015933527,0.00032753797,0.00017792685,0.00037159256,0.0002003332,0.8732885,0.0036113043,0.029118562,0.0018210432,0.0745259],"study_design_scores_gemma":[0.000018625755,0.00018164582,0.0037300747,0.000027244028,0.00006985222,0.00027767027,0.000083888306,0.98570204,0.0018306666,0.006569516,0.0014706865,0.00003817116],"about_ca_topic_score_codex":0.00546678,"about_ca_topic_score_gemma":0.003676215,"teacher_disagreement_score":0.00546678,"about_ca_system_score_codex":0.0016885101,"about_ca_system_score_gemma":0.0011040731,"threshold_uncertainty_score":0.01970458},"labels":[],"label_agreement":null},{"id":"W2080472473","doi":"10.1109/wimob.2011.6085373","title":"Reinforcement learning-based best path to best gateway scheme for wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computer network; Metrics; Equal-cost multi-path routing; Static routing; Dynamic Source Routing; Link-state routing protocol; Wireless mesh network; Distributed computing; Interior gateway protocol; Routing protocol; Multipath routing; Policy-based routing; Routing (electronic design automation); Wireless; Wireless network; Telecommunications","score_opus":0.02713874965667124,"score_gpt":0.2425945545901767,"score_spread":0.21545580493350547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080472473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026765943,0.00039656562,0.970423,0.00023972336,0.00006008014,0.00007841729,0.000022810375,0.00041741645,0.0015961612],"genre_scores_gemma":[0.90460926,0.00018633044,0.09353131,0.00014926847,0.000042693802,0.00013151481,0.000057996433,0.00003525709,0.0012563512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992704,0.0003143241,0.000038990795,0.00012159023,0.00016762753,0.00008717103],"domain_scores_gemma":[0.998386,0.00094939955,0.00026127504,0.0001298252,0.00017650874,0.00009703773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016346703,0.00071905967,0.0010561841,0.0005174389,0.00051865017,0.00042995438,0.0017991902,0.0009078312,0.0009771897],"category_scores_gemma":[0.0035641107,0.0002331921,0.00039160348,0.00041141096,0.0009458348,0.0010406472,0.0008717045,0.0011387162,0.00018854794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013968316,0.00013781837,0.00079769205,0.000056185614,0.00006372411,0.00009423023,0.0000729634,0.9192968,0.002602495,0.010677838,0.0012400686,0.06482054],"study_design_scores_gemma":[0.000015152371,0.000048340673,0.000067491914,0.0000025619665,0.00000609786,0.000017658243,0.0000039824613,0.99611807,0.00026784785,0.00324765,0.0002001173,0.0000049886135],"about_ca_topic_score_codex":0.0029413244,"about_ca_topic_score_gemma":0.0028939876,"teacher_disagreement_score":0.0029413244,"about_ca_system_score_codex":0.0010820564,"about_ca_system_score_gemma":0.000852027,"threshold_uncertainty_score":0.008645058},"labels":[],"label_agreement":null},{"id":"W2081177521","doi":"10.1109/icc.2012.6364129","title":"Local cooperative relay for opportunistic data forwarding in mobile ad-hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Forwarder; Computer science; Relay; Node (physics); Packet forwarding; Wireless ad hoc network; Mobile ad hoc network; Network packet; Wireless; Telecommunications; Engineering","score_opus":0.05124980299801529,"score_gpt":0.29991972350629825,"score_spread":0.24866992050828296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081177521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014858754,0.0014852873,0.9803595,0.00016977711,0.00007403183,0.00012304743,0.00002918797,0.00041699156,0.0024833516],"genre_scores_gemma":[0.82780856,0.0018181226,0.16527697,0.00016298688,0.00013969834,0.00034995883,0.0001083697,0.000048243564,0.004287043],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.00032626366,0.000041154934,0.00012410055,0.00017705726,0.00006865756],"domain_scores_gemma":[0.9991615,0.0004482587,0.000059303224,0.0001595547,0.00013016044,0.00004124796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001421575,0.0005534869,0.00071093865,0.0007432537,0.0009780285,0.0006839888,0.0013578843,0.00074432115,0.0009742113],"category_scores_gemma":[0.0024352157,0.00022478256,0.0005193249,0.0007112266,0.00091013627,0.0014100967,0.0012541005,0.000491163,0.00039177967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000652025,0.00021504954,0.002475576,0.0010701441,0.00018686485,0.0027599495,0.0027973263,0.3169762,0.060436435,0.27095324,0.010262022,0.33121517],"study_design_scores_gemma":[0.000087879445,0.0006547319,0.00038024815,0.00006067121,0.0001633111,0.001024486,0.00028286196,0.92548746,0.009784971,0.040664766,0.021328963,0.00007969119],"about_ca_topic_score_codex":0.0015383492,"about_ca_topic_score_gemma":0.0021168059,"teacher_disagreement_score":0.0015383492,"about_ca_system_score_codex":0.00052723614,"about_ca_system_score_gemma":0.0007837853,"threshold_uncertainty_score":0.007518053},"labels":[],"label_agreement":null},{"id":"W2081295183","doi":"10.1109/icc.2014.6883381","title":"Video streaming over vehicular networks by a multiple path solution with error correction","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Path (computing); Multipath propagation; Network packet; Redundancy (engineering); Network topology; Unicast; Computer network; Algorithm; Topology (electrical circuits); Mathematics; Combinatorics; Channel (broadcasting)","score_opus":0.0057847280791846895,"score_gpt":0.19885738287929747,"score_spread":0.19307265480011276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081295183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27995118,0.0013048885,0.7083284,0.00064836134,0.00033898998,0.00026440076,0.00014275122,0.0033940847,0.005626811],"genre_scores_gemma":[0.8335159,0.00053270295,0.16145745,0.00010984899,0.00006583749,0.00007329862,0.00016142074,0.000069262984,0.0040143346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991503,0.00019156649,0.000039846174,0.00011909516,0.00037679955,0.0001222959],"domain_scores_gemma":[0.9987625,0.00043549572,0.00011007822,0.0001272518,0.000506383,0.000058230624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009862323,0.0010020016,0.00079764833,0.0006937922,0.00061097305,0.0007502199,0.0011350309,0.0009905084,0.0014415166],"category_scores_gemma":[0.0024366642,0.00021925343,0.0004499841,0.0007277119,0.00032546252,0.001116062,0.00076139363,0.0008407363,0.00030081705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000904371,0.0002522604,0.0018040646,0.00020845808,0.0001628564,0.00040698907,0.00018327944,0.6956982,0.034284357,0.0039131767,0.0019109342,0.260271],"study_design_scores_gemma":[0.000037198548,0.00036793848,0.00020125615,0.000010657826,0.000028244755,0.00008358116,0.00003829965,0.9859744,0.011113658,0.0008123938,0.0013140945,0.000018368279],"about_ca_topic_score_codex":0.00641036,"about_ca_topic_score_gemma":0.006201818,"teacher_disagreement_score":0.00641036,"about_ca_system_score_codex":0.00068497675,"about_ca_system_score_gemma":0.0011063642,"threshold_uncertainty_score":0.012746096},"labels":[],"label_agreement":null},{"id":"W2081432537","doi":"10.1109/iscc.2007.4381562","title":"Modeling and Analysis of Power-Aware Ad hoc Networks with Directional Antennas","year":2007,"lang":"en","type":"article","venue":"Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Interference (communication); Computer science; Wireless ad hoc network; Throughput; Collision; Energy consumption; Directional antenna; Antenna (radio); Power (physics); Energy (signal processing); Transmission (telecommunications); Collision avoidance; Computer network; Electronic engineering; Telecommunications; Wireless; Electrical engineering; Engineering","score_opus":0.017175652576431187,"score_gpt":0.25015607840309373,"score_spread":0.23298042582666253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081432537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045873217,0.0009423033,0.9464387,0.00026724627,0.000042884818,0.000038587517,0.0000764875,0.00013003655,0.006190574],"genre_scores_gemma":[0.91968817,0.0025095844,0.071804255,0.000114630806,0.00009453413,0.00012900992,0.00010786885,0.000077481396,0.0054745562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00011782837,0.000011725539,0.000039872968,0.00011476392,0.00003776685],"domain_scores_gemma":[0.99956506,0.00024025673,0.00007368249,0.000038872775,0.00006728011,0.00001478815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331787,0.00067935814,0.00048105436,0.00041357207,0.00029846653,0.00080434297,0.0009917723,0.00062413915,0.0006638384],"category_scores_gemma":[0.0015584476,0.00039174853,0.00043436975,0.00059818086,0.00053460366,0.001395588,0.00043327906,0.00053285493,0.00025583734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000062552003,0.000008604364,0.00016948023,0.000014758938,0.0000077076365,0.000031338765,0.000017599195,0.98515517,0.0009908197,0.011110207,0.000109519046,0.0023784887],"study_design_scores_gemma":[0.000001424876,0.0000066430534,0.00006169693,0.0000018715037,0.0000033495658,0.000013643366,0.000006589974,0.9951786,0.00014872356,0.0042945975,0.0002809077,0.0000020112648],"about_ca_topic_score_codex":0.0025206653,"about_ca_topic_score_gemma":0.0017512377,"teacher_disagreement_score":0.0025206653,"about_ca_system_score_codex":0.00065686286,"about_ca_system_score_gemma":0.0003918206,"threshold_uncertainty_score":0.0050120354},"labels":[],"label_agreement":null},{"id":"W2081912802","doi":"10.4018/jamc.2012040102","title":"A Survey of Ant Colony Optimization Algorithms for Telecommunication Networks","year":2012,"lang":"en","type":"article","venue":"International Journal of Applied Metaheuristic Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Ant colony optimization algorithms; Computer science; Quality of service; Computer network; Distributed computing; Routing (electronic design automation); Network congestion; Algorithm","score_opus":0.03237711879606497,"score_gpt":0.3008920122124292,"score_spread":0.26851489341636425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081912802","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006120348,0.20012002,0.7480922,0.0019612333,0.0012336946,0.000176477,0.00024340335,0.00066600705,0.04138668],"genre_scores_gemma":[0.12125258,0.2789648,0.5715368,0.0014538765,0.0015392848,0.00044908837,0.0007970849,0.00043644442,0.023569977],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994759,0.00012935065,0.00004878787,0.000074865406,0.00024369915,0.000027543283],"domain_scores_gemma":[0.99954766,0.00023090809,0.000031929238,0.000036404297,0.00013431974,0.00001875184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055118103,0.0010978339,0.0010779338,0.000890074,0.00046667454,0.0014046081,0.0010168939,0.0011425267,0.002083299],"category_scores_gemma":[0.0016066555,0.00043780054,0.00053247006,0.0029363686,0.00039975863,0.0011049922,0.0006317057,0.0011546,0.0013904388],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052103544,0.000118536394,0.00090063387,0.0013363711,0.000102611215,0.00011859179,0.00011423324,0.13781902,0.0018398608,0.0472111,0.021223277,0.7891636],"study_design_scores_gemma":[0.00004222675,0.00014593781,0.00086843834,0.0006010269,0.000067419365,0.000542503,0.00010760872,0.5140102,0.0017461533,0.069951385,0.41186982,0.000047274316],"about_ca_topic_score_codex":0.0020180226,"about_ca_topic_score_gemma":0.0022902503,"teacher_disagreement_score":0.002083299,"about_ca_system_score_codex":0.00046767338,"about_ca_system_score_gemma":0.00078654906,"threshold_uncertainty_score":0.0069693327},"labels":[],"label_agreement":null},{"id":"W2082223484","doi":"10.1109/vtcfall.2014.6966094","title":"Optimal and Fair Rate Adaptation in Wireless Mesh Networks Based on Mathematical Programming and Game Theory","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematical optimization; Heuristic; Computer science; Game theory; Network topology; Network packet; Adaptation (eye); Wireless network; Wireless; Mathematics; Computer network; Mathematical economics","score_opus":0.009620822799375543,"score_gpt":0.21966229610615307,"score_spread":0.21004147330677753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082223484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007299514,0.00036737268,0.9883923,0.000245182,0.00003405812,0.000049161376,0.0000134300535,0.000034242916,0.0035647159],"genre_scores_gemma":[0.630569,0.0012631876,0.36179766,0.00016840558,0.00012779527,0.00031492623,0.00004270163,0.00007065593,0.005645778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850285,0.0008624274,0.000051232415,0.00011586346,0.00032515323,0.00014253489],"domain_scores_gemma":[0.9980439,0.0015709728,0.00011252856,0.000068431,0.0001580354,0.00004608919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027041463,0.00078314025,0.0009948887,0.00064555946,0.0005868199,0.0017764025,0.0011940212,0.0010422246,0.0011237914],"category_scores_gemma":[0.0051959106,0.0005541806,0.000971989,0.0008749365,0.001652815,0.0021548325,0.0011832849,0.0015560796,0.00012575461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034370798,0.00003636559,0.00015248104,0.00005485167,0.000025983216,0.000036777168,0.00008483935,0.8410427,0.00065227586,0.14477983,0.0005264187,0.012573108],"study_design_scores_gemma":[0.000005907803,0.000016452766,0.000029860634,0.0000081245935,0.000004690415,0.000010819467,0.0000114655695,0.9662869,0.00020808572,0.03292746,0.0004841255,0.0000061641763],"about_ca_topic_score_codex":0.0038316806,"about_ca_topic_score_gemma":0.0027157227,"teacher_disagreement_score":0.0038316806,"about_ca_system_score_codex":0.0018280718,"about_ca_system_score_gemma":0.0018381235,"threshold_uncertainty_score":0.014301062},"labels":[],"label_agreement":null},{"id":"W2082569868","doi":"10.1109/icc.2011.5963403","title":"Trust-Based and Energy-Aware Incentive Routing Protocol for Multi-Hop Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Network packet; Routing protocol; Relay; Hop (telecommunications); Payment; Zone Routing Protocol; Node (physics); Wireless; Wireless Routing Protocol; Incentive; Routing (electronic design automation); Wireless network; Protocol (science); Telecommunications; Engineering","score_opus":0.04374004643399006,"score_gpt":0.27823687571062083,"score_spread":0.2344968292766308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082569868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020188874,0.0028420605,0.96873796,0.0009636524,0.00044228436,0.00028964944,0.00010302645,0.00048317167,0.0059493165],"genre_scores_gemma":[0.7578071,0.002377038,0.22992127,0.00028408534,0.00019252795,0.0005453837,0.0002764113,0.000050043906,0.008546172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915314,0.0002896101,0.00008822852,0.0000837788,0.00032474875,0.000060514136],"domain_scores_gemma":[0.9991854,0.00024156024,0.0001562338,0.000118792945,0.0002229861,0.00007496222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009806743,0.0003757406,0.0006087721,0.00041076945,0.0008895738,0.000746784,0.0011774466,0.000825451,0.00078288163],"category_scores_gemma":[0.0026145233,0.00018622736,0.0003846993,0.0006697796,0.0005681574,0.0016798219,0.0011429448,0.00083705684,0.0002574172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000601059,0.00030446594,0.003145887,0.0012118143,0.00024771845,0.0022068233,0.001022055,0.16722636,0.048952337,0.3309283,0.019495826,0.42465734],"study_design_scores_gemma":[0.00016310257,0.00062782416,0.0012304275,0.000123851,0.00018128636,0.0019955037,0.00022643471,0.7668715,0.014933044,0.12559092,0.08790679,0.00014928573],"about_ca_topic_score_codex":0.0007575492,"about_ca_topic_score_gemma":0.0010900757,"teacher_disagreement_score":0.0011774466,"about_ca_system_score_codex":0.0005552499,"about_ca_system_score_gemma":0.0010299339,"threshold_uncertainty_score":0.005186379},"labels":[],"label_agreement":null},{"id":"W2082898666","doi":"10.1016/j.ipl.2011.09.013","title":"Low-interference networks in metric spaces of bounded doubling dimension","year":2011,"lang":"en","type":"article","venue":"Information Processing Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Carleton University","funders":"","keywords":"Bounded function; Dimension (graph theory); Metric (unit); Interference (communication); Mathematics; Metric space; Discrete mathematics; Computer science; Topology (electrical circuits); Combinatorics; Algorithm; Theoretical computer science; Telecommunications; Mathematical analysis; Engineering","score_opus":0.01753522022955412,"score_gpt":0.2214610976034818,"score_spread":0.20392587737392767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082898666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38262063,0.0040818686,0.5716706,0.0028480943,0.0002448286,0.00010659533,0.00076491514,0.00045454918,0.037207887],"genre_scores_gemma":[0.9620085,0.0013915927,0.028476493,0.00036077911,0.00018956845,0.00012917514,0.00034236116,0.00006527002,0.0070363274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837446,0.00067858153,0.00006930603,0.00019566392,0.000422102,0.00025981545],"domain_scores_gemma":[0.9905595,0.0063472507,0.0010238307,0.00042125818,0.00080137845,0.0008467194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011755868,0.0011182678,0.0015779389,0.0023929328,0.001527933,0.0037589814,0.0021046465,0.0013359942,0.003132091],"category_scores_gemma":[0.008481088,0.0006974107,0.0005411658,0.0016329451,0.0023681994,0.004334561,0.0039985613,0.0020133913,0.0004546233],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032040596,0.000042222615,0.0007837925,0.00013698718,0.00005060436,0.0002894015,0.0002626002,0.071457185,0.0029466765,0.91408545,0.0021802506,0.0074443812],"study_design_scores_gemma":[0.000055240478,0.00007450381,0.0005570847,0.000026000105,0.00002262011,0.00035616613,0.00020205336,0.31316555,0.0012168515,0.6813748,0.002904056,0.0000451369],"about_ca_topic_score_codex":0.0018667111,"about_ca_topic_score_gemma":0.0012394488,"teacher_disagreement_score":0.0037589814,"about_ca_system_score_codex":0.0021132836,"about_ca_system_score_gemma":0.0005329857,"threshold_uncertainty_score":0.015332997},"labels":[],"label_agreement":null},{"id":"W2083266561","doi":"10.1007/s11227-010-0519-7","title":"Load-balanced AP association in multi-hop wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Wireless; Wireless network; Latency (audio); Mesh networking; Service set; Internet access; Bandwidth (computing); Software deployment; The Internet; Distributed computing; Wi-Fi; Telecommunications; Operating system","score_opus":0.01283095564413703,"score_gpt":0.2444973781197483,"score_spread":0.23166642247561128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083266561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21978949,0.0018027573,0.77087253,0.0010710468,0.0003025967,0.00016105724,0.00019673993,0.0007022653,0.005101583],"genre_scores_gemma":[0.95013154,0.00044576864,0.045816604,0.000103136364,0.00020651337,0.000067856476,0.00013234487,0.00007028086,0.003025951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828136,0.00062678003,0.000104494524,0.00024365105,0.00044702584,0.00029675686],"domain_scores_gemma":[0.9938632,0.0036794879,0.0005345058,0.0007404957,0.0008651045,0.00031723856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029543708,0.0007295628,0.0015842151,0.0011934834,0.0018002095,0.0018108668,0.0029457046,0.0010322266,0.0018469434],"category_scores_gemma":[0.010759091,0.0009684229,0.0002644135,0.0018489126,0.00093455735,0.0030573444,0.0025602365,0.0009409636,0.0006664085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015438738,0.00049534097,0.005926384,0.00024674868,0.00012636874,0.0003275948,0.0005075623,0.7203133,0.014839065,0.020664282,0.0048247874,0.23018482],"study_design_scores_gemma":[0.000039275354,0.00011600194,0.0004762686,0.000008040888,0.00002831405,0.00012441988,0.00010711026,0.98795146,0.0015211581,0.008791329,0.00082433724,0.000012261241],"about_ca_topic_score_codex":0.001583397,"about_ca_topic_score_gemma":0.003598065,"teacher_disagreement_score":0.0029543708,"about_ca_system_score_codex":0.00095156056,"about_ca_system_score_gemma":0.0011645716,"threshold_uncertainty_score":0.015624344},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.050509421160152564,"score_gpt":0.2641481605096089,"score_spread":0.21363873934945632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083719968","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046757413,0.8433426,0.13432944,0.0023723508,0.001839754,0.00022699413,0.00022028948,0.00049572863,0.01249715],"genre_scores_gemma":[0.026842955,0.89116096,0.07355061,0.00083138666,0.0028040044,0.0002201395,0.00061180134,0.0001166231,0.003861452],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99741083,0.00047155857,0.00043556673,0.00038082618,0.0011590614,0.00014216463],"domain_scores_gemma":[0.99486107,0.0033396238,0.00025678053,0.0004371345,0.00096204504,0.00014333185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032666326,0.0015869287,0.0027296282,0.0032828082,0.0009933345,0.0050241477,0.0031680232,0.0024806065,0.0034974758],"category_scores_gemma":[0.007101894,0.0011398097,0.00083715696,0.009672769,0.001261127,0.010113766,0.0018083896,0.0027666392,0.0021722885],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012875747,0.0003054447,0.0012930636,0.006705636,0.00011443257,0.00014229091,0.00021700251,0.011237562,0.0019019669,0.044077247,0.022126496,0.91175],"study_design_scores_gemma":[0.000120680714,0.0006719133,0.002038442,0.003552488,0.00043176027,0.00299489,0.0008205302,0.06815908,0.005130195,0.13395669,0.78195083,0.00017261774],"about_ca_topic_score_codex":0.001260368,"about_ca_topic_score_gemma":0.0009036926,"teacher_disagreement_score":0.0050241477,"about_ca_system_score_codex":0.0010589694,"about_ca_system_score_gemma":0.0018563468,"threshold_uncertainty_score":0.01727581},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01737055995851462,"score_gpt":0.24332785745205746,"score_spread":0.22595729749354285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083944171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024350591,0.00033690355,0.97398055,0.000111918795,0.000030164561,0.0000650393,0.000058598514,0.00022954852,0.00083659147],"genre_scores_gemma":[0.42923924,0.0006201775,0.5674892,0.000086315486,0.00008016231,0.00033732993,0.00042930123,0.000092706294,0.0016255347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.00033703883,0.00005715413,0.00016618666,0.00038154153,0.00005563541],"domain_scores_gemma":[0.9967624,0.0019528718,0.00032825637,0.00041737474,0.00042652665,0.00011244175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017127539,0.0009482634,0.0012582156,0.0013460771,0.0006826171,0.0008430335,0.001734582,0.00078710396,0.0008039009],"category_scores_gemma":[0.009254752,0.00045749077,0.00066765957,0.0017728632,0.00080661115,0.0016085629,0.0011200865,0.00081954774,0.00030820287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009400208,0.000047133075,0.00069046905,0.00010021329,0.00003483312,0.00003473052,0.000073514064,0.93671167,0.002708502,0.009095468,0.0008321712,0.049577266],"study_design_scores_gemma":[0.000010091193,0.00004061352,0.000112285095,0.0000050048584,0.0000069233956,0.000022088496,0.000014560366,0.9896736,0.001080528,0.00861026,0.00041997948,0.000004124752],"about_ca_topic_score_codex":0.0014750713,"about_ca_topic_score_gemma":0.0018937764,"teacher_disagreement_score":0.001734582,"about_ca_system_score_codex":0.0012058653,"about_ca_system_score_gemma":0.00072618644,"threshold_uncertainty_score":0.009057999},"labels":[],"label_agreement":null},{"id":"W2084046929","doi":"10.1109/glocom.2010.5685226","title":"Secure Cooperation Incentive Scheme with Limited Use of Public Key Cryptography for Multi-Hop Wireless Network","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Computer network; Public-key cryptography; Key (lock); Scheme (mathematics); Computer security; Wireless; Incentive; Wireless network; Pre-shared key; ID-based cryptography; Key distribution; Telecommunications; Encryption; Mathematics","score_opus":0.03535435409233986,"score_gpt":0.2477175599416241,"score_spread":0.21236320584928423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084046929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09885445,0.0007349396,0.8939994,0.0004828662,0.00021562575,0.00031528942,0.000057737332,0.0005121412,0.0048274994],"genre_scores_gemma":[0.92389816,0.00026289027,0.07298986,0.0000817677,0.00008625566,0.00020140622,0.000067733454,0.000019354173,0.0023925921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976816,0.0007943267,0.00018115847,0.0002118632,0.00086593104,0.00026507888],"domain_scores_gemma":[0.99674726,0.0010413016,0.0004978695,0.00089804694,0.0005620265,0.0002534436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027719408,0.00048705674,0.0008204917,0.0007801455,0.0010578049,0.0008111545,0.0015479376,0.00093798514,0.0015508486],"category_scores_gemma":[0.00467513,0.0002672557,0.0005225106,0.00093513186,0.0009079125,0.004140221,0.002231647,0.0012228517,0.00032940228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020750214,0.0009773482,0.0037788176,0.00062166376,0.0002451128,0.0009285417,0.00075098214,0.14194067,0.091381766,0.42354754,0.0065825735,0.32717007],"study_design_scores_gemma":[0.000693617,0.0015204324,0.0013612999,0.00006311345,0.00015048607,0.0013938766,0.00010494885,0.8577154,0.03183999,0.087424755,0.01756894,0.0001630905],"about_ca_topic_score_codex":0.00040409897,"about_ca_topic_score_gemma":0.0002661148,"teacher_disagreement_score":0.0027719408,"about_ca_system_score_codex":0.0008457284,"about_ca_system_score_gemma":0.0016732464,"threshold_uncertainty_score":0.014659643},"labels":[],"label_agreement":null},{"id":"W2085754189","doi":"10.1109/music.2012.10","title":"Connectivity Analysis of Mobile Ad Hoc Networks Using Destination Guided Mobility Models","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Mobility model; Computer science; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Distributed computing; Computer network; Optimized Link State Routing Protocol; Routing protocol; Waypoint; Vehicular ad hoc network; Routing (electronic design automation); Wireless; Real-time computing; Network packet; Telecommunications","score_opus":0.04878421932025018,"score_gpt":0.2971331145358056,"score_spread":0.24834889521555542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085754189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16188683,0.0008543402,0.8278577,0.00031131113,0.000036861486,0.000111731184,0.00018151145,0.00044460705,0.008315123],"genre_scores_gemma":[0.9410544,0.00090012903,0.05628664,0.00003531256,0.000026090696,0.00008245963,0.00021526139,0.000040987514,0.0013586422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976856,0.000098861085,0.000010008096,0.00002299272,0.00008333858,0.000016253558],"domain_scores_gemma":[0.9995746,0.00025695874,0.000050505994,0.00003722974,0.00006902291,0.000011670988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003111707,0.0004070722,0.0002339417,0.00067048083,0.0002624752,0.0004361086,0.00044724956,0.0004308669,0.000569266],"category_scores_gemma":[0.0018346126,0.00020246604,0.0004023335,0.0005317359,0.0003003568,0.00092303194,0.00039730154,0.0002932993,0.00008626636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012494482,0.000013436325,0.0010434415,0.000025148198,0.000014534979,0.000077962686,0.000041742318,0.97471964,0.0027775476,0.013209301,0.00029569562,0.007769],"study_design_scores_gemma":[0.0000026148714,0.000013676208,0.00023735291,0.000003136287,0.0000048606994,0.000023162003,0.000011019199,0.99574536,0.00036707812,0.0030061118,0.0005825132,0.0000031969369],"about_ca_topic_score_codex":0.0037328284,"about_ca_topic_score_gemma":0.0024609917,"teacher_disagreement_score":0.0037328284,"about_ca_system_score_codex":0.00049042405,"about_ca_system_score_gemma":0.0002760397,"threshold_uncertainty_score":0.007422209},"labels":[],"label_agreement":null},{"id":"W2085995636","doi":"10.1109/broadnets.2008.4769149","title":"Wireless mesh network planning: A multi-objective optimization approach","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Integer programming; Mathematical optimization; Linear programming; Wireless network; Network planning and design; Heuristic; Set (abstract data type); Throughput; Order One Network Protocol; Planner; Software deployment; Population; Distributed computing; Wireless; Computer network; Algorithm; Artificial intelligence; Mathematics","score_opus":0.02855324620466065,"score_gpt":0.24220615239921667,"score_spread":0.213652906194556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085995636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00795058,0.0006583582,0.98595804,0.00048150792,0.000040812192,0.000099195524,0.00007679526,0.00009196371,0.0046427897],"genre_scores_gemma":[0.42192233,0.0017333643,0.5694568,0.00023388716,0.00010527408,0.00077185535,0.00018197465,0.00012023686,0.0054742373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993893,0.00034537783,0.000018917339,0.00006959383,0.00011784512,0.000058903875],"domain_scores_gemma":[0.99912685,0.0006542417,0.000085896485,0.000024746727,0.00007519361,0.000033144162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014908109,0.0011494921,0.0010635245,0.00094411423,0.00043722062,0.0010141805,0.0013290909,0.0013918563,0.0024880995],"category_scores_gemma":[0.0021159924,0.000639203,0.0008153551,0.0012189146,0.0006995988,0.0011550214,0.0008632306,0.0010818997,0.00021162328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008536935,0.000011856792,0.000062188934,0.000040210936,0.000022187049,0.000021941303,0.000012504151,0.9876673,0.00013913389,0.005172201,0.00027684466,0.006565217],"study_design_scores_gemma":[0.000007295839,0.000019623523,0.000033509594,0.000008375194,0.000007940432,0.000010016303,0.000010280975,0.9938059,0.00010352686,0.005409653,0.00057975,0.000004188893],"about_ca_topic_score_codex":0.0034374683,"about_ca_topic_score_gemma":0.0027919554,"teacher_disagreement_score":0.0034374683,"about_ca_system_score_codex":0.0012462402,"about_ca_system_score_gemma":0.0012689552,"threshold_uncertainty_score":0.009042144},"labels":[],"label_agreement":null},{"id":"W2086143121","doi":"10.1109/milcom.2007.4454951","title":"Multicast Forwarding Using Multiple Gateways and Hash for Duplicate Packet Detection in a Tactical MANET","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Multicast; Computer science; Protocol Independent Multicast; Source-specific multicast; Xcast; Pragmatic General Multicast; Distance Vector Multicast Routing Protocol; IP multicast; Distributed computing; Network packet; Reliable multicast","score_opus":0.03104476783198274,"score_gpt":0.2841315841736473,"score_spread":0.2530868163416646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086143121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30650473,0.0006090213,0.6893924,0.00030988338,0.00010811563,0.00021285484,0.0000706991,0.001438091,0.0013542051],"genre_scores_gemma":[0.8622661,0.00013513492,0.13677536,0.000062630876,0.000040646122,0.000056894714,0.000065537075,0.000014741927,0.00058292306],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999303,0.00022345771,0.000054978296,0.00007550949,0.00026239586,0.00008056869],"domain_scores_gemma":[0.9982103,0.00070200744,0.00018838372,0.0005144825,0.00027968435,0.00010515024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002032418,0.0003794142,0.00089280185,0.0014079631,0.00073741097,0.0006060936,0.0011309766,0.000859823,0.00043841466],"category_scores_gemma":[0.0030234666,0.00037538278,0.00032814848,0.0006913432,0.00085913105,0.0014758601,0.0013676065,0.0004030919,0.00011598313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035320043,0.00052085245,0.014439589,0.00042933773,0.00033719695,0.0024541873,0.0011983115,0.25846508,0.22023888,0.062361166,0.004320937,0.4317025],"study_design_scores_gemma":[0.00016643252,0.0007105345,0.0019708308,0.000020952732,0.000120420314,0.0010922169,0.000106612344,0.927286,0.05585595,0.009922979,0.0026841748,0.00006284953],"about_ca_topic_score_codex":0.0012078016,"about_ca_topic_score_gemma":0.0010131269,"teacher_disagreement_score":0.002032418,"about_ca_system_score_codex":0.000724214,"about_ca_system_score_gemma":0.00061761047,"threshold_uncertainty_score":0.010748565},"labels":[],"label_agreement":null},{"id":"W2088072318","doi":"10.1109/glocomw.2007.4437821","title":"Location-Based Message Aggregation in Vehicular Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Overhead (engineering); Scalability; Node (physics); Wireless ad hoc network; Vehicular ad hoc network; Cluster analysis; Routing protocol; Distributed computing; Locality; Protocol (science); Routing (electronic design automation); Wireless; Telecommunications; Engineering","score_opus":0.008141125627559379,"score_gpt":0.22928273467511245,"score_spread":0.2211416090475531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088072318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015169093,0.0027433685,0.97751576,0.00028345542,0.00016294312,0.00009945107,0.000031068208,0.0011031599,0.0028917512],"genre_scores_gemma":[0.6832075,0.003043145,0.30718708,0.00017936286,0.00033397542,0.00026938602,0.00022309278,0.000097927485,0.005458593],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987919,0.00044624342,0.00010646926,0.00013362402,0.00044708728,0.00007473309],"domain_scores_gemma":[0.9990515,0.0004290908,0.0001268848,0.00017554576,0.00017943521,0.000037542362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013742592,0.00039260523,0.0007904217,0.00093993935,0.0008730661,0.0011435966,0.0010486811,0.0008222265,0.00045265164],"category_scores_gemma":[0.002381043,0.00032874782,0.00035267827,0.0014160211,0.00070338,0.0016622585,0.0010577393,0.00052754726,0.00030457205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003387249,0.00014006796,0.002168809,0.00048296177,0.00013316219,0.0009895547,0.0011513268,0.35582566,0.037142914,0.22355866,0.00858084,0.3694873],"study_design_scores_gemma":[0.00004467255,0.00018519208,0.0005847014,0.000038914848,0.00007270535,0.00040400127,0.00012443136,0.9094813,0.012496604,0.04981071,0.026709491,0.00004729408],"about_ca_topic_score_codex":0.001894173,"about_ca_topic_score_gemma":0.0013070643,"teacher_disagreement_score":0.001894173,"about_ca_system_score_codex":0.000634049,"about_ca_system_score_gemma":0.0004912796,"threshold_uncertainty_score":0.0072678924},"labels":[],"label_agreement":null},{"id":"W2088334991","doi":"10.1016/j.tcs.2009.02.002","title":"Energy efficient randomised communication in unknown AdHoc networks","year":2009,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"D-Wave Systems (Canada); Simon Fraser University","funders":"","keywords":"Broadcasting (networking); Gossip; Binary logarithm; Upper and lower bounds; Computer science; Node (physics); Computer network; Randomized algorithm; Log-log plot; Mathematics; Algorithm; Discrete mathematics; Theoretical computer science","score_opus":0.005181335881111793,"score_gpt":0.22327924849091482,"score_spread":0.21809791260980302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088334991","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09793161,0.0011594974,0.8867594,0.0024247793,0.00040199634,0.00019603231,0.00023435049,0.0005632412,0.010329158],"genre_scores_gemma":[0.9413222,0.00037925874,0.050893217,0.0003274365,0.0001451663,0.00022473164,0.00013875308,0.000087040535,0.006482158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515414,0.0024815202,0.00021268635,0.00055316417,0.00097471353,0.00062377524],"domain_scores_gemma":[0.96145207,0.032635167,0.0013758136,0.002572332,0.00131036,0.00065425254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003950869,0.0007016774,0.0017190474,0.00089163333,0.0015037475,0.0018648437,0.002516239,0.0024733888,0.0033146748],"category_scores_gemma":[0.030983875,0.0007150985,0.0005771134,0.0011819375,0.0036074677,0.0037353723,0.005166528,0.0020366034,0.0005896425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011323947,0.00010035354,0.0006280327,0.00029668232,0.000052981297,0.00018562647,0.00027516036,0.7224241,0.0047912635,0.24105835,0.0028750116,0.026180068],"study_design_scores_gemma":[0.000105039195,0.000106106214,0.00014247575,0.000026688213,0.000015717902,0.00006853568,0.00005586112,0.8510449,0.0010349876,0.14637436,0.0009955715,0.000029816301],"about_ca_topic_score_codex":0.0014090054,"about_ca_topic_score_gemma":0.0015365375,"teacher_disagreement_score":0.003950869,"about_ca_system_score_codex":0.0018615774,"about_ca_system_score_gemma":0.0016625411,"threshold_uncertainty_score":0.020894408},"labels":[],"label_agreement":null},{"id":"W2088513598","doi":"10.1145/1143549.1143776","title":"Delivery analysis of multicasting in BitTorrent enabled ad hoc network (MBEAN) routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Distributed computing; BitTorrent; Vehicular ad hoc network; Mobile ad hoc network; Wireless ad hoc network; Ad hoc wireless distribution service; Wireless Routing Protocol; Routing protocol; Routing (electronic design automation); Network packet; Peer-to-peer; Telecommunications; Wireless","score_opus":0.010548373739283159,"score_gpt":0.22201276041032852,"score_spread":0.21146438667104536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088513598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.838749,0.002008336,0.14982219,0.00035824516,0.000057169724,0.00010310619,0.00016677968,0.00021423309,0.008520872],"genre_scores_gemma":[0.9910211,0.00038722923,0.007682836,0.000022013373,0.000009816133,0.000020988748,0.000046155455,0.00001358194,0.0007962743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995383,0.0001591273,0.00001676195,0.00004080305,0.0001835319,0.00006143745],"domain_scores_gemma":[0.99758244,0.0014907962,0.00021159094,0.000099834935,0.00056820444,0.00004711575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089811435,0.00038647253,0.00037090707,0.0007080707,0.00035028777,0.00039615785,0.00054288073,0.00054342614,0.00059173175],"category_scores_gemma":[0.0041232477,0.00015442815,0.0003387189,0.00037933898,0.00038423785,0.0007372487,0.00027660295,0.0003376458,0.00009683447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022803506,0.00006241145,0.004724359,0.0001403551,0.000051332925,0.00022089716,0.00012837631,0.9505628,0.016103098,0.013693305,0.0005386398,0.013546363],"study_design_scores_gemma":[0.0000024911565,0.00006554113,0.00060009025,0.0000043989326,0.000009464336,0.00005010837,0.000020786232,0.99649847,0.002017328,0.0005737465,0.00015363518,0.0000039616552],"about_ca_topic_score_codex":0.004048958,"about_ca_topic_score_gemma":0.0013511499,"teacher_disagreement_score":0.004048958,"about_ca_system_score_codex":0.0012913254,"about_ca_system_score_gemma":0.0003127768,"threshold_uncertainty_score":0.0093691945},"labels":[],"label_agreement":null},{"id":"W2088688744","doi":"10.1007/s12652-014-0232-0","title":"A3ACKs: adaptive three acknowledgments intrusion detection system for MANETs","year":2014,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"King Fahd University of Petroleum and Minerals; Acadia University","keywords":"Computer network; Computer science; Mobile ad hoc network; Node (physics); Network packet; Wireless network; Wireless ad hoc network; Wireless; Computer security; Distributed computing; Telecommunications; Engineering","score_opus":0.027607770435039532,"score_gpt":0.2551998880926075,"score_spread":0.22759211765756798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088688744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21912049,0.0017009379,0.6230386,0.000698571,0.001067473,0.0008048881,0.0014312553,0.14569901,0.0064388285],"genre_scores_gemma":[0.8578765,0.00030260783,0.13412046,0.0004864675,0.00012927642,0.00026440987,0.0013690527,0.00045565222,0.00499548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993955,0.000119805576,0.00006607389,0.00012226224,0.00022354363,0.00007277672],"domain_scores_gemma":[0.9990368,0.00029162137,0.00011052865,0.00018164379,0.00024517643,0.00013419655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091335573,0.0010781008,0.0011959751,0.0013686377,0.00064227555,0.000772044,0.0020018104,0.00076840277,0.00250285],"category_scores_gemma":[0.0015893347,0.00029576643,0.0003918034,0.00050735456,0.00034155638,0.0013581689,0.0016864626,0.00079551083,0.00083937723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0077452445,0.0013779156,0.027576042,0.0005690307,0.0008547243,0.0011587515,0.00053194957,0.06202167,0.10876371,0.0046548177,0.06864525,0.71610093],"study_design_scores_gemma":[0.00035490308,0.0011807638,0.0063717454,0.000028441578,0.00024835844,0.000733617,0.00012250416,0.9276797,0.04420908,0.0039766007,0.014985203,0.00010903603],"about_ca_topic_score_codex":0.0018270749,"about_ca_topic_score_gemma":0.0024258152,"teacher_disagreement_score":0.00250285,"about_ca_system_score_codex":0.00041916635,"about_ca_system_score_gemma":0.00051935215,"threshold_uncertainty_score":0.008372903},"labels":[],"label_agreement":null},{"id":"W2089338151","doi":"10.1109/vetecf.2010.5594549","title":"On the Capacity of Multi-Hop Wireless Networks with Heterogeneous Antennas","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless network; Heterogeneous network; Computer network; Wireless; Beamforming; Directional antenna; Hop (telecommunications); Distributed computing; Wireless ad hoc network; Topology (electrical circuits); Telecommunications; Engineering; Electrical engineering; Antenna (radio)","score_opus":0.016230290145816395,"score_gpt":0.21544558998025742,"score_spread":0.19921529983444103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089338151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18029112,0.020884924,0.73089665,0.006702787,0.0006428725,0.00009777137,0.00087466935,0.0005226733,0.059086584],"genre_scores_gemma":[0.97212243,0.008287061,0.015262995,0.00036717928,0.00051274383,0.00013523198,0.00022594674,0.00012796526,0.0029583038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981895,0.00073276577,0.000042422238,0.00019273862,0.00041050845,0.00043200026],"domain_scores_gemma":[0.98252803,0.01485295,0.00069605344,0.00068181375,0.0008832737,0.00035786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026163382,0.0014230392,0.0014721369,0.0017914923,0.00076240173,0.0021871128,0.0018233756,0.0014416223,0.0035251882],"category_scores_gemma":[0.016805112,0.0006805758,0.0006046261,0.0023865087,0.0034467082,0.005176119,0.0022266377,0.0023004506,0.00072695815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014590997,0.000055548913,0.000492862,0.00023292612,0.000049247737,0.00017126398,0.000116991105,0.86817384,0.0025172627,0.11133447,0.0029352773,0.013774455],"study_design_scores_gemma":[0.000008385964,0.000026282789,0.0002560767,0.00006739131,0.00001662736,0.000057805184,0.00005407788,0.9169232,0.00077388115,0.080876365,0.00091540144,0.00002438583],"about_ca_topic_score_codex":0.0026374424,"about_ca_topic_score_gemma":0.0014170922,"teacher_disagreement_score":0.0035251882,"about_ca_system_score_codex":0.0023730542,"about_ca_system_score_gemma":0.00086745806,"threshold_uncertainty_score":0.017217815},"labels":[],"label_agreement":null},{"id":"W2089643487","doi":"10.1109/milcom.2009.5380113","title":"Efficient mobile networking for tactical radios","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Ultra high frequency; Computer network; Computer science; Mobile radio; Node (physics); Mobile telephony; Telecommunications; Hop (telecommunications); Tactical communications; Engineering","score_opus":0.012457035570610217,"score_gpt":0.25883425777709096,"score_spread":0.24637722220648073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089643487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037802584,0.012009352,0.92452437,0.00061640615,0.00023408415,0.00006463489,0.000070627015,0.0004034874,0.024274435],"genre_scores_gemma":[0.7697261,0.009352644,0.20089343,0.00015932978,0.00035835765,0.00015645934,0.00023718725,0.0000785517,0.019038055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998534,0.000049927214,0.0000038123956,0.000016104526,0.00005872477,0.000018010553],"domain_scores_gemma":[0.99985385,0.0000702486,0.000015430951,0.000026957341,0.000027983095,0.000005579842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024104727,0.00026467026,0.00024213539,0.00036410778,0.00025307987,0.0005205907,0.00038864271,0.00029942958,0.0014719779],"category_scores_gemma":[0.00066760834,0.00011493612,0.0001232544,0.0003371882,0.0001923962,0.00063848123,0.00038550864,0.00027062054,0.00034513883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011197159,0.000060840463,0.00066149764,0.00026154047,0.00004576835,0.0002864975,0.000118904645,0.32850602,0.03352591,0.2510223,0.010267174,0.3751316],"study_design_scores_gemma":[0.000008613266,0.00006686996,0.00038988295,0.000025341209,0.000011669007,0.00023029215,0.000026287136,0.928286,0.0032154443,0.040726114,0.027004085,0.000009255194],"about_ca_topic_score_codex":0.00035975807,"about_ca_topic_score_gemma":0.0008866252,"teacher_disagreement_score":0.0014719779,"about_ca_system_score_codex":0.00030214956,"about_ca_system_score_gemma":0.00015594845,"threshold_uncertainty_score":0.0049242377},"labels":[],"label_agreement":null},{"id":"W2089800424","doi":"10.1007/s10586-005-6181-9","title":"Average Waiting Time of Clusterhead Controlled Token for Virtual Base Station On-Demand in MANETs","year":2005,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polling; Computer science; Computer network; Mobile ad hoc network; Security token; Base station; Wireless ad hoc network; Network packet; Wireless; Telecommunications","score_opus":0.011011729859760656,"score_gpt":0.2436293415535245,"score_spread":0.23261761169376385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089800424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87894756,0.0013467403,0.114073515,0.0003221131,0.00028678295,0.000078274345,0.00033340562,0.00091322314,0.003698386],"genre_scores_gemma":[0.9968105,0.00007464055,0.0022578533,0.000021327156,0.000016654496,0.000009368467,0.00007741903,0.000034530385,0.00069778966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855465,0.00021567727,0.00007389976,0.0002647611,0.00039529765,0.0004956746],"domain_scores_gemma":[0.99404293,0.0035204035,0.00043738488,0.0004308281,0.0010538488,0.00051469513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022267015,0.00058412825,0.00088943733,0.0008621805,0.001119076,0.0012173529,0.0016258314,0.00065711327,0.0025332358],"category_scores_gemma":[0.0072970423,0.0004124213,0.00031947638,0.0010774964,0.00065877713,0.0013141744,0.000672597,0.0006125394,0.0001957837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057489444,0.00036569862,0.013957431,0.0003981435,0.00018119473,0.0005123619,0.00050107203,0.8653735,0.026823279,0.018985864,0.005893041,0.061259527],"study_design_scores_gemma":[0.00003701546,0.00028816907,0.0019121799,0.000007880151,0.00007111426,0.00011868477,0.00016900712,0.99042845,0.0043061194,0.0022191196,0.00041348246,0.000028797002],"about_ca_topic_score_codex":0.0074615683,"about_ca_topic_score_gemma":0.0077320477,"teacher_disagreement_score":0.0074615683,"about_ca_system_score_codex":0.0020796906,"about_ca_system_score_gemma":0.002276333,"threshold_uncertainty_score":0.015089333},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014241543305282609,"score_gpt":0.22912452433391248,"score_spread":0.21488298102862988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091072140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22709467,0.003130933,0.7661594,0.00048417537,0.000042672924,0.0001062634,0.000093626644,0.0008555096,0.0020327887],"genre_scores_gemma":[0.94050217,0.0017758567,0.056674518,0.00007032368,0.00004353611,0.00007908251,0.000095589414,0.000047950733,0.0007108919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992409,0.00031989336,0.000035047422,0.00006145584,0.0002873832,0.000055317672],"domain_scores_gemma":[0.9978027,0.0013203623,0.00042098004,0.00024161252,0.00017693784,0.000037389447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015698471,0.00049308885,0.0005015867,0.001010103,0.0005554807,0.0008584506,0.00089545693,0.00067983737,0.0003608731],"category_scores_gemma":[0.0057471613,0.00039889297,0.00022472041,0.0011295575,0.0011572889,0.0022345048,0.0010971365,0.00033811995,0.0001316343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004884099,0.000016747019,0.0010554761,0.00010961423,0.00003062974,0.00012599533,0.00012438725,0.96198267,0.0061933463,0.008682359,0.00037751076,0.021252427],"study_design_scores_gemma":[0.000016683958,0.000115456314,0.0008738891,0.000011298302,0.000021571632,0.00020194014,0.000117930016,0.97491384,0.0028425488,0.019216435,0.0016488415,0.000019596178],"about_ca_topic_score_codex":0.0009547813,"about_ca_topic_score_gemma":0.0012743585,"teacher_disagreement_score":0.0015698471,"about_ca_system_score_codex":0.00056636723,"about_ca_system_score_gemma":0.00039266623,"threshold_uncertainty_score":0.008302271},"labels":[],"label_agreement":null},{"id":"W2091819060","doi":"10.1109/mwc.2013.6704481","title":"Neighbor discovery algorithms in directional antenna based synchronous and asynchronous wireless ad hoc networks","year":2013,"lang":"en","type":"article","venue":"IEEE Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Neighbor Discovery Protocol; Asynchronous communication; Wireless ad hoc network; Algorithm; Node (physics); Computer network; Directional antenna; Distributed computing; Wireless; Antenna (radio); Telecommunications; The Internet","score_opus":0.013427490729179549,"score_gpt":0.23908047664967355,"score_spread":0.22565298592049401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091819060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018452337,0.00060857274,0.9789586,0.00010247358,0.000057787085,0.00004048167,0.000014614306,0.000247885,0.0015173196],"genre_scores_gemma":[0.5136889,0.0009322599,0.48166394,0.0001416822,0.00013625067,0.0001743351,0.00008705103,0.0000737657,0.0031017817],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988456,0.0004040489,0.00008379768,0.00018132452,0.0004084033,0.00007678275],"domain_scores_gemma":[0.9976447,0.0012814,0.0002945649,0.0003614775,0.0003457258,0.00007202724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023298163,0.0003617461,0.00045409403,0.0007357492,0.00068454933,0.00092015933,0.0011643303,0.00057771744,0.00055953546],"category_scores_gemma":[0.006050449,0.00034204603,0.00022930196,0.0008702526,0.0006723278,0.0018679651,0.0007378426,0.00061486446,0.00023131761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003498631,0.000140846,0.0024385385,0.00023938714,0.000065136985,0.00015617773,0.00046315882,0.4604159,0.02053379,0.16140436,0.0028318015,0.350961],"study_design_scores_gemma":[0.0000510781,0.00014215856,0.00034931203,0.000009538008,0.000022575228,0.00014926675,0.00007822334,0.96082044,0.0045216624,0.028823433,0.005010211,0.000022227183],"about_ca_topic_score_codex":0.00090003456,"about_ca_topic_score_gemma":0.001026061,"teacher_disagreement_score":0.0023298163,"about_ca_system_score_codex":0.00059361284,"about_ca_system_score_gemma":0.00054677424,"threshold_uncertainty_score":0.012321353},"labels":[],"label_agreement":null},{"id":"W2092883533","doi":"10.1109/icroit.2014.6798321","title":"Re-organizable wireless mesh network using ARS","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Wireless mesh network; Computer science; Computer network; Control reconfiguration; Wireless network; Channel (broadcasting); Wireless; Mesh networking; Distributed computing; Wireless WAN; Switched mesh; Wi-Fi array; Embedded system; Telecommunications","score_opus":0.013414006157398843,"score_gpt":0.2250601419578306,"score_spread":0.21164613580043176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092883533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19236717,0.001239933,0.7773709,0.00041510194,0.00035832758,0.00021765403,0.00027390893,0.0077625546,0.019994373],"genre_scores_gemma":[0.9035754,0.00039206853,0.08981388,0.00008182155,0.000037497954,0.00010502528,0.00029851485,0.00009693134,0.005598868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977595,0.00006987658,0.000013059688,0.000045613924,0.00006139219,0.00003408528],"domain_scores_gemma":[0.9997178,0.00008311838,0.00004009006,0.00007543587,0.000066064444,0.00001758322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032798588,0.00027938455,0.00028026896,0.00030237838,0.00022638687,0.00034099113,0.0007048955,0.00027167267,0.0020110416],"category_scores_gemma":[0.00059660536,0.00009100906,0.00033218914,0.00025358275,0.00020372785,0.0005757205,0.00050302455,0.00027679687,0.00034687374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081010506,0.00018009984,0.0023521113,0.00040287973,0.00011754826,0.0005414901,0.00033081628,0.48180246,0.108792014,0.015900128,0.0076805125,0.38108975],"study_design_scores_gemma":[0.00005447954,0.00055535225,0.000906972,0.000021288219,0.00004657803,0.00037398757,0.00009083921,0.95992756,0.018444411,0.0035426843,0.016008597,0.000027259326],"about_ca_topic_score_codex":0.0012671986,"about_ca_topic_score_gemma":0.0012210348,"teacher_disagreement_score":0.0020110416,"about_ca_system_score_codex":0.00024063322,"about_ca_system_score_gemma":0.00020528036,"threshold_uncertainty_score":0.0067275763},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007225679416192487,"score_gpt":0.23289500770145535,"score_spread":0.22566932828526287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092910894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3544423,0.007324516,0.6013944,0.00178365,0.00036905587,0.00006505358,0.0003919,0.0008790328,0.033350095],"genre_scores_gemma":[0.9830777,0.0011683195,0.008236516,0.000063076346,0.000080402824,0.000024582117,0.000117674674,0.000102464284,0.0071292827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994986,0.00013781323,0.000018218927,0.000060008202,0.00020513989,0.0000801645],"domain_scores_gemma":[0.9986154,0.001034012,0.00006485952,0.00010826869,0.00014496878,0.000032463355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207947,0.00040126123,0.00046750225,0.0005424452,0.00032602772,0.0009298898,0.0006237803,0.0004706422,0.0030575146],"category_scores_gemma":[0.0036036423,0.0003561513,0.00015037687,0.0010702218,0.00041213716,0.0013491708,0.0003870357,0.00038661197,0.00041224464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030042115,0.00010993284,0.0038247595,0.0001854387,0.00005057761,0.00021543397,0.00015370798,0.80079514,0.011439772,0.058081225,0.0031908303,0.12165279],"study_design_scores_gemma":[0.000012567203,0.000070553026,0.0024717506,0.000014947683,0.000027930582,0.00018832253,0.00008850092,0.9461772,0.0041278256,0.043027215,0.003780666,0.000012547025],"about_ca_topic_score_codex":0.0010478911,"about_ca_topic_score_gemma":0.00077288167,"teacher_disagreement_score":0.0030575146,"about_ca_system_score_codex":0.000711805,"about_ca_system_score_gemma":0.0002546063,"threshold_uncertainty_score":0.010228395},"labels":[],"label_agreement":null},{"id":"W2093889114","doi":"10.4018/jbdcn.2007010101","title":"Cooperative Data Caching and Prefetching in Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"International Journal of Business Data Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Instruction prefetch; Computer science; Cache; Computer network; Mobile ad hoc network; Overhead (engineering); Wireless ad hoc network; Consistency (knowledge bases); Scheme (mathematics); CPU cache; Cluster analysis; Distributed computing; Wireless; Operating system","score_opus":0.07537138326914294,"score_gpt":0.33292903101853877,"score_spread":0.2575576477493958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093889114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22332342,0.009718262,0.76148295,0.0005148867,0.00018448115,0.00012267548,0.00004603078,0.00097584847,0.003631543],"genre_scores_gemma":[0.951147,0.0011597148,0.045376018,0.000056487024,0.00008766906,0.000058665275,0.00004151763,0.000021122742,0.0020518396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999353,0.00023020223,0.00003888425,0.00008500247,0.00021586164,0.000077137876],"domain_scores_gemma":[0.9985191,0.000711985,0.0001409528,0.0002471973,0.00030958364,0.00007118231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008935414,0.0004044069,0.0006881551,0.00072090473,0.00075403764,0.0006263028,0.0011034308,0.0007248641,0.00031449823],"category_scores_gemma":[0.00241623,0.00042933552,0.00026895193,0.0013005176,0.000535501,0.0016203715,0.0006498772,0.0003635263,0.00012025796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006876906,0.00027982215,0.009392439,0.00047691417,0.00023972207,0.00121641,0.0007523401,0.5639803,0.04181521,0.03595228,0.0043536914,0.3408531],"study_design_scores_gemma":[0.000042789175,0.00020683078,0.0008839549,0.00001622651,0.000067529516,0.00031090312,0.00009615727,0.98081136,0.0055534183,0.008299595,0.003687924,0.000023261007],"about_ca_topic_score_codex":0.003610978,"about_ca_topic_score_gemma":0.0042389054,"teacher_disagreement_score":0.003610978,"about_ca_system_score_codex":0.0005280094,"about_ca_system_score_gemma":0.00057637325,"threshold_uncertainty_score":0.007179916},"labels":[],"label_agreement":null},{"id":"W2093931957","doi":"10.1109/mobhoc.2006.278608","title":"Multirate-aware Multicast Routing in MANETs","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer network; Computer science; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Xcast; Source-specific multicast; Pragmatic General Multicast; Mobile ad hoc network; Distributed computing; Throughput; Network packet; IP multicast; Wireless; Telecommunications","score_opus":0.009507494888910955,"score_gpt":0.22427549536964492,"score_spread":0.21476800048073397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093931957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02239224,0.0032881454,0.96935856,0.00036123596,0.00023455286,0.00007235262,0.000028776918,0.000808441,0.0034556715],"genre_scores_gemma":[0.6134624,0.00446871,0.3776817,0.00026695075,0.0005825868,0.0001705546,0.000121762096,0.00010851104,0.0031369335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993592,0.00024388204,0.00003268855,0.000051220683,0.0002439525,0.000069045294],"domain_scores_gemma":[0.9994435,0.00019290583,0.000096547665,0.00009629893,0.00013378596,0.00003701977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001089581,0.0005232912,0.0005877219,0.0009081146,0.0004912246,0.000722236,0.0012703466,0.00080830423,0.0005326505],"category_scores_gemma":[0.0017347282,0.00029754968,0.00045686105,0.00050237763,0.00035720502,0.001621716,0.0008995526,0.0005854345,0.00029998933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029762182,0.00016424267,0.0021389388,0.0006099592,0.00018293079,0.0009883776,0.00050480594,0.40673247,0.06286221,0.10970087,0.0055748033,0.41024277],"study_design_scores_gemma":[0.000039928582,0.00030241933,0.0004773576,0.000058074027,0.00010023618,0.0006244499,0.00009558485,0.93375015,0.015642762,0.028077306,0.020778239,0.000053513166],"about_ca_topic_score_codex":0.0005130718,"about_ca_topic_score_gemma":0.00057112187,"teacher_disagreement_score":0.0012703466,"about_ca_system_score_codex":0.00030114874,"about_ca_system_score_gemma":0.0002643994,"threshold_uncertainty_score":0.0057623386},"labels":[],"label_agreement":null},{"id":"W2094609215","doi":"10.1109/wcnc.2014.6952677","title":"Routing in unmanned aerial ad hoc networks: A recovery strategy for Greedy geographic forwarding failure","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Geographic routing; Packet forwarding; Mobile ad hoc network; Network packet; Routing protocol; Node (physics); Optimized Link State Routing Protocol; Wireless Routing Protocol; Wireless; Engineering; Telecommunications","score_opus":0.012616556416850824,"score_gpt":0.22994517445875567,"score_spread":0.21732861804190484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094609215","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055807967,0.0011739084,0.9361041,0.0010968923,0.00017081562,0.00014132929,0.00003575198,0.00060670555,0.0048625562],"genre_scores_gemma":[0.8214286,0.00076785684,0.17352135,0.00030493352,0.00010778511,0.00012051655,0.00006220807,0.000053858366,0.003632941],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996741,0.00009787,0.000019396426,0.00004250928,0.00010219897,0.00006383194],"domain_scores_gemma":[0.9995339,0.00013352375,0.00010909214,0.00009085049,0.00008357464,0.000049120546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066554494,0.0005541196,0.00046012818,0.0005673365,0.000615349,0.00053480524,0.0012918985,0.0008541588,0.00070953346],"category_scores_gemma":[0.0013095003,0.00013422687,0.0003331787,0.00042786755,0.00058094406,0.0010659833,0.001059084,0.00042899512,0.00020874968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003314759,0.0001660406,0.0019027782,0.00026122335,0.00012147164,0.001123714,0.0005540009,0.4983647,0.04749019,0.0737679,0.008710612,0.36720577],"study_design_scores_gemma":[0.000044007636,0.00025151396,0.00042121028,0.000020929048,0.000037948095,0.0005699165,0.00016201004,0.97221756,0.0052812286,0.014336153,0.006627924,0.000029545834],"about_ca_topic_score_codex":0.0011226743,"about_ca_topic_score_gemma":0.0012549021,"teacher_disagreement_score":0.0012918985,"about_ca_system_score_codex":0.00042546034,"about_ca_system_score_gemma":0.00050534215,"threshold_uncertainty_score":0.0035197735},"labels":[],"label_agreement":null},{"id":"W2094785769","doi":"10.1016/j.comnet.2010.11.013","title":"On the design of reliable wireless mesh network infrastructure with QoS constraints","year":2010,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Order One Network Protocol; Computer network; Mesh networking; Reliability (semiconductor); Distributed computing; Heuristics; Network topology; Network planning and design; Switched mesh; Node (physics); Wireless network; Optical mesh network; Wireless","score_opus":0.007384186214868718,"score_gpt":0.1943633807917454,"score_spread":0.18697919457687667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094785769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021357404,0.0017278866,0.97042626,0.00054902874,0.00009989378,0.00006814224,0.0000625797,0.00012066395,0.0055881804],"genre_scores_gemma":[0.710823,0.005770105,0.278024,0.00020866717,0.00038242355,0.00027930012,0.00019970458,0.00023368701,0.0040790914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940264,0.00025321456,0.0000326992,0.00006363648,0.00018034644,0.000067486755],"domain_scores_gemma":[0.9978713,0.001518652,0.00018888217,0.00010045788,0.00026331955,0.000057375644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012630774,0.0008490264,0.0007193767,0.0006566585,0.00049034203,0.0011501975,0.0014883789,0.00085297535,0.0018302039],"category_scores_gemma":[0.005820677,0.0006662386,0.00034943793,0.0008038465,0.0007296187,0.0017955456,0.0011319935,0.00066858064,0.00030482683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001664151,0.000030208763,0.00050407037,0.0004025155,0.00005181106,0.00018778375,0.00015205567,0.8440879,0.007858011,0.08237058,0.0032813468,0.060907394],"study_design_scores_gemma":[0.000021442727,0.000071656286,0.000116572155,0.000032088723,0.000021239024,0.000051025872,0.000035428213,0.964883,0.001350533,0.03027021,0.003134965,0.000011832362],"about_ca_topic_score_codex":0.0013422641,"about_ca_topic_score_gemma":0.001213099,"teacher_disagreement_score":0.0018302039,"about_ca_system_score_codex":0.0008436659,"about_ca_system_score_gemma":0.0006839031,"threshold_uncertainty_score":0.0066798925},"labels":[],"label_agreement":null},{"id":"W2095045345","doi":"10.1109/ccece.2012.6335025","title":"A study of different types of attacks in mobile ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Jitter; Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Packet drop attack; Network packet; Throughput; Vehicular ad hoc network; Computer security; Routing protocol; Wireless; Telecommunications","score_opus":0.017936735663350592,"score_gpt":0.2667816389309829,"score_spread":0.2488449032676323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095045345","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.809881,0.0051481347,0.16931921,0.00070360815,0.00014664487,0.0005443506,0.00013495806,0.0002862514,0.0138358325],"genre_scores_gemma":[0.97969395,0.0019304483,0.017235737,0.00007342901,0.000054764354,0.00009307773,0.0000494666,0.000026530945,0.0008426819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965329,0.0016680453,0.0001720262,0.00024766198,0.0011117279,0.0002676047],"domain_scores_gemma":[0.9768246,0.019154076,0.0017313256,0.0010468024,0.000886409,0.00035684285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020684435,0.0010287405,0.0008669966,0.0017585979,0.0007641995,0.00151813,0.00089016143,0.0015616503,0.00051628996],"category_scores_gemma":[0.015653279,0.0005104401,0.0011243535,0.0014386778,0.0014060256,0.0027737578,0.000773456,0.00090245914,0.00010564353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018091123,0.0002598011,0.010973156,0.00030853908,0.00038944156,0.00044551847,0.00029479578,0.9290931,0.010233302,0.022535997,0.0003752735,0.024910212],"study_design_scores_gemma":[0.000035182933,0.00062131986,0.0038419852,0.000052846473,0.00013279027,0.00063503097,0.00018177112,0.98316157,0.0042676274,0.0054564993,0.0015759517,0.00003734437],"about_ca_topic_score_codex":0.001380663,"about_ca_topic_score_gemma":0.0009517015,"teacher_disagreement_score":0.0020684435,"about_ca_system_score_codex":0.0009448239,"about_ca_system_score_gemma":0.0004489175,"threshold_uncertainty_score":0.010939121},"labels":[],"label_agreement":null},{"id":"W2095376975","doi":"10.1109/glocom.2006.978","title":"WSN15-3: Optimal Resource Allocation for Homogeneous Wireless Multicast","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Distributed computing; Source-specific multicast; Xcast; Pragmatic General Multicast; Protocol Independent Multicast; Wireless network; Wireless ad hoc network; Asynchronous communication; Resource allocation; Wireless","score_opus":0.008572975009139411,"score_gpt":0.2243540668526798,"score_spread":0.21578109184354038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095376975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02557483,0.00025646595,0.9696233,0.0000903035,0.000028215758,0.00006969029,0.000048355814,0.00027521967,0.0040335963],"genre_scores_gemma":[0.49870482,0.00030007242,0.49777064,0.00007168388,0.00004028805,0.0002177343,0.00019070326,0.00018246105,0.0025216152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995629,0.00018004178,0.00001973445,0.00005227591,0.00012469584,0.000060293445],"domain_scores_gemma":[0.9996939,0.0001658658,0.000034406414,0.000037420432,0.000049216145,0.000019238796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014861234,0.0006088954,0.0006437574,0.00053037173,0.00042599565,0.00058542413,0.00086389424,0.000488086,0.001593124],"category_scores_gemma":[0.0021545147,0.00024346789,0.0003820941,0.000528285,0.00048605615,0.0005610946,0.0007319019,0.00034924678,0.0002947238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002295309,0.00011057191,0.0007281657,0.0001308665,0.00006222614,0.00008566194,0.00013373756,0.8131423,0.010489567,0.048726037,0.004116817,0.12204446],"study_design_scores_gemma":[0.000024826346,0.00003517431,0.00010350765,0.000005472766,0.0000052793152,0.000025624435,0.000010186059,0.98999316,0.0019064788,0.006445252,0.0014403948,0.0000047009635],"about_ca_topic_score_codex":0.0017391564,"about_ca_topic_score_gemma":0.001874461,"teacher_disagreement_score":0.0017391564,"about_ca_system_score_codex":0.00079454825,"about_ca_system_score_gemma":0.0009623221,"threshold_uncertainty_score":0.007859468},"labels":[],"label_agreement":null},{"id":"W2095379324","doi":"10.1145/2641798.2641813","title":"Transmission power control-based opportunistic routing for wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Canada Research Chairs","keywords":"Computer network; Computer science; Wireless sensor network; Routing protocol; Reliability (semiconductor); Network packet; Transmission (telecommunications); Forwarder; Wireless; Energy consumption; Power control; Geographic routing; Wireless Routing Protocol; Power (physics); Telecommunications; Engineering; Electrical engineering","score_opus":0.012303506098754913,"score_gpt":0.22946924802128932,"score_spread":0.2171657419225344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095379324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008811599,0.0025598928,0.9844024,0.0002889467,0.0001775351,0.000077519704,0.00004301462,0.00030748712,0.0033315541],"genre_scores_gemma":[0.7908711,0.005111855,0.19686162,0.00024367603,0.00033866317,0.00036363513,0.00014302874,0.00013390281,0.0059326296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948645,0.00015375426,0.000032180393,0.00006181332,0.0002303496,0.00003552458],"domain_scores_gemma":[0.9991328,0.00051012816,0.0001314182,0.00007746548,0.00012129671,0.000027043076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007600518,0.0005885044,0.00049664883,0.0004695524,0.00042896467,0.00064295816,0.0009844721,0.0005180155,0.00053779595],"category_scores_gemma":[0.0022011907,0.00023815903,0.0003259948,0.00084134255,0.00061334705,0.000895039,0.0005500396,0.00062171894,0.000144581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010594048,0.00008959852,0.00065886456,0.0004651978,0.000095110176,0.00037866595,0.00013797598,0.7047226,0.014634065,0.09236601,0.004298587,0.18204738],"study_design_scores_gemma":[0.000012348388,0.000067042936,0.00019605087,0.000018439163,0.000022274355,0.0001446736,0.000016183085,0.9618922,0.0015278399,0.031588748,0.004495927,0.000018291237],"about_ca_topic_score_codex":0.0014032425,"about_ca_topic_score_gemma":0.0017472145,"teacher_disagreement_score":0.0014032425,"about_ca_system_score_codex":0.0005424318,"about_ca_system_score_gemma":0.000613845,"threshold_uncertainty_score":0.0040195584},"labels":[],"label_agreement":null},{"id":"W2095507388","doi":"10.1007/978-3-642-17697-5_1","title":"SEAODV: A Security Enhanced AODV Routing Protocol for Wireless Mesh Networks","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; York University","funders":"","keywords":"Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Dynamic Source Routing; Wireless mesh network; Zone Routing Protocol; Routing protocol; Wireless network; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.013870629479442582,"score_gpt":0.2701755145176838,"score_spread":0.2563048850382412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095507388","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032194015,0.00634174,0.90550715,0.0009352702,0.0017905057,0.00035897372,0.0013919547,0.008662455,0.042817976],"genre_scores_gemma":[0.32984936,0.008773535,0.53712064,0.00070040167,0.00043069912,0.00042752348,0.006051014,0.0013170032,0.11532984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998443,0.000021126758,0.0000119995875,0.000017891749,0.000089142115,0.00001546814],"domain_scores_gemma":[0.9998337,0.00003807352,0.000010992931,0.000030235187,0.00007420473,0.000012738347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001946735,0.0003337379,0.00031350076,0.00044333423,0.00033337157,0.0005008285,0.00075686764,0.0003702466,0.0027515497],"category_scores_gemma":[0.00051796297,0.00018884228,0.00023955276,0.00053567917,0.00016188025,0.0008688966,0.00055889715,0.00060357765,0.0010507846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023387911,0.00010214713,0.00076205423,0.0006697385,0.00008049898,0.00020334791,0.00014969347,0.02611933,0.055439092,0.03309867,0.07025499,0.81288666],"study_design_scores_gemma":[0.000110442445,0.00031647042,0.0013992818,0.00011846055,0.00013965694,0.0009311541,0.00013855215,0.20908003,0.0612788,0.032263856,0.6941288,0.000094506795],"about_ca_topic_score_codex":0.00081473653,"about_ca_topic_score_gemma":0.0017447344,"teacher_disagreement_score":0.0027515497,"about_ca_system_score_codex":0.00029532716,"about_ca_system_score_gemma":0.0005204478,"threshold_uncertainty_score":0.0092048645},"labels":[],"label_agreement":null},{"id":"W2095877237","doi":"10.1007/978-0-387-34738-7_7","title":"AN AODV-Based Clustering and Routing Scheme for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"IFIP International Federation for Information Processing/IFIP","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Wireless Routing Protocol; Computer science; Computer network; Dynamic Source Routing; Cluster analysis; Zone Routing Protocol; Destination-Sequenced Distance Vector routing; Ad hoc On-Demand Distance Vector Routing; Routing protocol; Optimized Link State Routing Protocol; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Routing (electronic design automation); Wireless; Artificial intelligence; Network packet; Telecommunications","score_opus":0.013572245425664011,"score_gpt":0.259568975704029,"score_spread":0.24599673027836497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095877237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010345553,0.0075206887,0.92919767,0.00080621673,0.0016830319,0.00047962606,0.00073901407,0.0059411046,0.043286994],"genre_scores_gemma":[0.12833089,0.009537704,0.7264864,0.0005559591,0.0004046221,0.0004430587,0.0030280987,0.00070221705,0.13051109],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997825,0.000025738806,0.000013572585,0.000025666004,0.00013544325,0.000017146182],"domain_scores_gemma":[0.99982184,0.000025123421,0.000007898488,0.000040185958,0.00009120807,0.000013814016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024617347,0.0004413585,0.00048395927,0.0007109871,0.0006993315,0.0006679651,0.0013854958,0.0005909281,0.0029367327],"category_scores_gemma":[0.00044198672,0.0002850868,0.0002777475,0.0013537529,0.0002678258,0.0009268483,0.0005162863,0.0007537607,0.0019872454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012190193,0.00009299636,0.00023187764,0.00038578204,0.00005477536,0.00009550542,0.00015326629,0.028940884,0.028942365,0.045627885,0.06739559,0.8279571],"study_design_scores_gemma":[0.00010128076,0.00041434125,0.0015396172,0.00015040516,0.00012348675,0.0008999708,0.00017512166,0.27567357,0.04476434,0.05427647,0.62173283,0.00014856135],"about_ca_topic_score_codex":0.0026935965,"about_ca_topic_score_gemma":0.005676447,"teacher_disagreement_score":0.0029367327,"about_ca_system_score_codex":0.00071284396,"about_ca_system_score_gemma":0.00083115435,"threshold_uncertainty_score":0.009824336},"labels":[],"label_agreement":null},{"id":"W2095980845","doi":"10.1186/1687-1499-2013-229","title":"On the number of channels required for interference-free wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Throughput; Interference (communication); Wireless network; Channel (broadcasting); Mesh networking; Power control; Heuristic; Routing (electronic design automation); Topology (electrical circuits); Wireless; Distributed computing; Power (physics); Telecommunications; Mathematics","score_opus":0.04376837732260573,"score_gpt":0.2819111572581748,"score_spread":0.23814277993556904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095980845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11059038,0.001852434,0.87544835,0.0008333036,0.00012333982,0.00007134428,0.00013002532,0.00020492698,0.010745915],"genre_scores_gemma":[0.87977815,0.0021430496,0.115247235,0.00018516195,0.00024009589,0.00019133133,0.0000899473,0.00014289252,0.0019821527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886996,0.00053335045,0.000042759508,0.00015013828,0.0002504299,0.00015330988],"domain_scores_gemma":[0.988948,0.009711383,0.0006109281,0.00020137915,0.00036186178,0.00016652826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015973609,0.00078265823,0.0008199626,0.0008095237,0.00068619597,0.0009817423,0.0010650834,0.00071544,0.0020220003],"category_scores_gemma":[0.012536612,0.0003462909,0.0003327118,0.0010252359,0.0012339348,0.0026589101,0.0006254849,0.00073317514,0.00023901866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001890453,0.00006545698,0.0007976118,0.00023617144,0.000035463836,0.0001306384,0.00008369593,0.90470487,0.007267708,0.056368634,0.0012924528,0.028828239],"study_design_scores_gemma":[0.000029202964,0.00016092081,0.00042169762,0.000027855382,0.000019985564,0.0001009125,0.000050871848,0.95367366,0.0032102042,0.041009508,0.0012805121,0.000014617344],"about_ca_topic_score_codex":0.0009216228,"about_ca_topic_score_gemma":0.0009339658,"teacher_disagreement_score":0.0020220003,"about_ca_system_score_codex":0.0008423015,"about_ca_system_score_gemma":0.0006627757,"threshold_uncertainty_score":0.008447766},"labels":[],"label_agreement":null},{"id":"W2095999484","doi":"10.1109/lcn.2009.5355033","title":"Location-aided gateway advertisement and discovery protocol for VANets: Proof of correctness","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; H.248; Service discovery; Correctness; Gateway address; Border Gateway Protocol; Gateway (web page); Interior gateway protocol; Routing protocol; Internetworking; Network packet; The Internet; Wireless ad hoc network; Default gateway; Web service; World Wide Web; Telecommunications; Wireless; Dynamic Source Routing","score_opus":0.014194502628177313,"score_gpt":0.28086078160591677,"score_spread":0.2666662789777394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095999484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023248247,0.00035396323,0.99001163,0.000720996,0.00020184832,0.00040789222,0.00010240928,0.00085376104,0.005022575],"genre_scores_gemma":[0.24576627,0.0018971306,0.73685706,0.0010638107,0.00047074072,0.0028197507,0.0007549251,0.0006112541,0.009758986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931646,0.0016853479,0.0004336816,0.000808594,0.0032246665,0.0006830552],"domain_scores_gemma":[0.9837901,0.010768613,0.00065452565,0.0014498591,0.0030509613,0.00028592497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053646313,0.0015606225,0.0019238117,0.0022979458,0.0025735446,0.0046784,0.0039853766,0.0031682237,0.0066266675],"category_scores_gemma":[0.02675603,0.0014947213,0.0022578354,0.0022062443,0.0054699876,0.0076733073,0.0069334293,0.0061380104,0.0030791352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031844838,0.00036032122,0.0013643509,0.0008114685,0.00018137903,0.0010732157,0.0009842875,0.15160541,0.0119417645,0.66989213,0.0156032,0.1458641],"study_design_scores_gemma":[0.00051569863,0.00041115115,0.0004700673,0.00032298057,0.00019547371,0.0012366896,0.00026563072,0.6540361,0.015899127,0.28363466,0.042781644,0.00023071168],"about_ca_topic_score_codex":0.0037821287,"about_ca_topic_score_gemma":0.0021283168,"teacher_disagreement_score":0.0066266675,"about_ca_system_score_codex":0.0023533897,"about_ca_system_score_gemma":0.005481798,"threshold_uncertainty_score":0.028371215},"labels":[],"label_agreement":null},{"id":"W2096077520","doi":"10.1109/pccc.2004.1395026","title":"Position-based routing with a power-aware weighted forwarding function in MANETs","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Routing protocol; Energy consumption; Wireless Routing Protocol; Link-state routing protocol; Virtual routing and forwarding; Destination-Sequenced Distance Vector routing; Hop (telecommunications); Routing (electronic design automation); Static routing; Geographic routing; Distributed computing; Engineering; Electrical engineering","score_opus":0.022209442071266235,"score_gpt":0.27239738665179997,"score_spread":0.2501879445805337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096077520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018504115,0.00039249493,0.9800807,0.00008539435,0.00005319233,0.00002831329,0.000011583759,0.00015890581,0.0006852523],"genre_scores_gemma":[0.62734604,0.0012466599,0.3668466,0.00012855299,0.00012686774,0.00014962952,0.00010936455,0.000061016064,0.003985344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995426,0.0001440765,0.00003352351,0.00006424528,0.00017805978,0.000037644942],"domain_scores_gemma":[0.9995448,0.00018703075,0.000070981485,0.000073072195,0.000103796425,0.000020257656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011184121,0.00056292745,0.0006984077,0.0008250822,0.0004758289,0.00073449133,0.0011261625,0.0008020507,0.00037485152],"category_scores_gemma":[0.0019912045,0.00032790488,0.0004025113,0.000876036,0.0006230283,0.001818633,0.0007627546,0.00054806273,0.00021569095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001723566,0.000081284445,0.0009444492,0.00015421415,0.00008551013,0.00035329844,0.00018421814,0.70314854,0.02671978,0.08201967,0.0013240551,0.1848126],"study_design_scores_gemma":[0.000011636432,0.00010988806,0.00017960327,0.000008812133,0.00003197309,0.00013540033,0.000016927712,0.975069,0.0046694586,0.017484829,0.0022620473,0.000020462872],"about_ca_topic_score_codex":0.0011375411,"about_ca_topic_score_gemma":0.0012420287,"teacher_disagreement_score":0.0011375411,"about_ca_system_score_codex":0.00039968258,"about_ca_system_score_gemma":0.0004305692,"threshold_uncertainty_score":0.0059147477},"labels":[],"label_agreement":null},{"id":"W2096460754","doi":"10.1155/2006/514842","title":"Replica Dissemination and Update Strategies in Cluster‐Based Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Replica; Mobile ad hoc network; Cluster (spacecraft); Computer network; Wireless ad hoc network; Distributed computing; Telecommunications; Wireless","score_opus":0.003984082018705293,"score_gpt":0.22493229625138933,"score_spread":0.22094821423268404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096460754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10865935,0.004647196,0.87965167,0.00047260904,0.0002068454,0.00030586685,0.00006750403,0.001327258,0.0046616956],"genre_scores_gemma":[0.8888089,0.0011284525,0.10683312,0.000095772564,0.000098972014,0.0001895599,0.00007903947,0.000067736015,0.002698328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992613,0.0002700417,0.000051997893,0.000099495155,0.0002450976,0.00007191466],"domain_scores_gemma":[0.99682534,0.0015578923,0.00030472898,0.00056718604,0.00059516076,0.00014980338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019864049,0.00050805695,0.0008553483,0.0011190046,0.0009285543,0.0009842536,0.0021469072,0.0008523275,0.000782492],"category_scores_gemma":[0.0071316618,0.00036960692,0.00030721512,0.0011574196,0.0007005786,0.0020031903,0.0008676412,0.00047003088,0.0002711306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006985294,0.00024586113,0.0036406647,0.0003607972,0.00017837071,0.00067560025,0.0014012426,0.5551026,0.02129786,0.06133671,0.0056482414,0.3494136],"study_design_scores_gemma":[0.00014032239,0.00029296306,0.00047654292,0.000019210669,0.00006383794,0.00028247642,0.00016600075,0.96863884,0.004641898,0.01989418,0.0053495322,0.00003426351],"about_ca_topic_score_codex":0.002834761,"about_ca_topic_score_gemma":0.0020870157,"teacher_disagreement_score":0.002834761,"about_ca_system_score_codex":0.0006676332,"about_ca_system_score_gemma":0.00060752995,"threshold_uncertainty_score":0.010505199},"labels":[],"label_agreement":null},{"id":"W2096724520","doi":"10.1109/mcom.2006.1668391","title":"Differentiated services for wireless mesh backbone","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Telecommunications; Wireless; Wireless network","score_opus":0.020122380014852066,"score_gpt":0.26125344120668775,"score_spread":0.2411310611918357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096724520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014942816,0.077258214,0.65673107,0.024204096,0.009754423,0.00047023667,0.0013154324,0.0018074757,0.21351624],"genre_scores_gemma":[0.34654054,0.091024265,0.41348514,0.008108501,0.0037771019,0.0009404784,0.0030102558,0.0003849034,0.13272873],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953675,0.00009572554,0.00003020454,0.000038426646,0.00025267748,0.000046190846],"domain_scores_gemma":[0.9996086,0.00007797069,0.000027269769,0.00008844071,0.00016615086,0.000031608815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007743775,0.00034118965,0.0002552402,0.00059331045,0.00044037215,0.0009810966,0.00084811996,0.001191697,0.005227428],"category_scores_gemma":[0.0019372551,0.00017475233,0.00019879929,0.000739511,0.00043314978,0.0010632505,0.0011482834,0.0014635567,0.0027696455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059988768,0.00003907529,0.00024671532,0.00033124982,0.000019931456,0.00039339834,0.0001744216,0.006549218,0.011341309,0.6836875,0.06678154,0.23037566],"study_design_scores_gemma":[0.000033427965,0.000109960165,0.0004752404,0.0002633534,0.000021497672,0.0006104766,0.00008662652,0.045802157,0.004431002,0.24295153,0.7051748,0.000039934923],"about_ca_topic_score_codex":0.0014494522,"about_ca_topic_score_gemma":0.0012905219,"teacher_disagreement_score":0.005227428,"about_ca_system_score_codex":0.0012234213,"about_ca_system_score_gemma":0.00081029464,"threshold_uncertainty_score":0.017487466},"labels":[],"label_agreement":null},{"id":"W2096882815","doi":"10.1109/tpds.2006.125","title":"Localized Communication and Topology Protocols for Ad Hoc Networks-Part II: A Preface to the Special Section","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Topology control; Distributed computing; Network topology; Wireless sensor network; Mobile ad hoc network; Node (physics); Overhead (engineering); Quality of service; Unicast; Neighbor Discovery Protocol; Routing (electronic design automation); Routing protocol; Key (lock); Wireless network; Key distribution in wireless sensor networks; Wireless; Telecommunications; Network packet; The Internet; Computer security","score_opus":0.01792305543460985,"score_gpt":0.2573540522969308,"score_spread":0.23943099686232097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096882815","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016821615,0.23614171,0.18972631,0.02399016,0.44689795,0.0008683462,0.0008176915,0.001330823,0.098544896],"genre_scores_gemma":[0.015975231,0.26416108,0.068390176,0.0140908295,0.43508452,0.001620045,0.00344521,0.0018566744,0.19537623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848574,0.00040071656,0.00014186821,0.0002904134,0.0005888911,0.00009247719],"domain_scores_gemma":[0.99504846,0.0022583504,0.00022274881,0.00044966876,0.0016137594,0.00040689597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024112184,0.002325833,0.0014396618,0.0030389747,0.0010753133,0.0033388757,0.0017725588,0.0025442338,0.015636213],"category_scores_gemma":[0.0064766426,0.0008838148,0.001169669,0.003253283,0.0018993482,0.004606961,0.001619669,0.008220875,0.01730838],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005770628,0.00017036004,0.00028250538,0.00093221397,0.000031126285,0.00020250137,0.0002222062,0.002346472,0.0012123402,0.03776225,0.73573726,0.22104302],"study_design_scores_gemma":[0.000010817838,0.00017467866,0.0006943193,0.00057415315,0.0000142590525,0.00047199824,0.00007231862,0.0018531911,0.00020850985,0.02269228,0.9732019,0.00003163491],"about_ca_topic_score_codex":0.001035955,"about_ca_topic_score_gemma":0.00071460055,"teacher_disagreement_score":0.015636213,"about_ca_system_score_codex":0.0015991757,"about_ca_system_score_gemma":0.0014159806,"threshold_uncertainty_score":0.05230832},"labels":[],"label_agreement":null},{"id":"W2096927040","doi":"10.1155/2010/258935","title":"COSR: A Reputation-Based Secure Route Protocol in MANET","year":2010,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Program for New Century Excellent Talents in University","keywords":"Computer science; Computer network; Mobile ad hoc network; Reputation; Node (physics); Protocol (science); Computer security; Wireless ad hoc network; Routing protocol; Distributed computing; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.021607681749559796,"score_gpt":0.2947577962754468,"score_spread":0.273150114525887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096927040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036195844,0.0017123005,0.9462019,0.0008578318,0.00044063377,0.00034994294,0.00022199689,0.004430041,0.009589493],"genre_scores_gemma":[0.783245,0.001621579,0.20603415,0.00031282564,0.00020347896,0.00038185943,0.00054254645,0.00019403899,0.0074644866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990701,0.00028594187,0.00007193711,0.00012960924,0.00036694313,0.00007552048],"domain_scores_gemma":[0.99904925,0.00019217198,0.00018290545,0.0002449437,0.0002583755,0.000072389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011280064,0.0005038043,0.00058092165,0.0007879253,0.00071057794,0.00090767076,0.001193858,0.00081993244,0.0010551362],"category_scores_gemma":[0.002246948,0.00020635064,0.00042171133,0.0007143438,0.000789255,0.0017519247,0.001200608,0.00077224744,0.00066262006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013563285,0.00033003103,0.003066687,0.0009209651,0.0002698916,0.0018431848,0.0007509455,0.26297387,0.06694377,0.1937482,0.03276736,0.43502885],"study_design_scores_gemma":[0.0002596193,0.0009779054,0.00082878827,0.00006526408,0.0001561822,0.001655774,0.00015628962,0.87460196,0.028464306,0.03209845,0.060560845,0.00017460677],"about_ca_topic_score_codex":0.0016561253,"about_ca_topic_score_gemma":0.0014563578,"teacher_disagreement_score":0.0016561253,"about_ca_system_score_codex":0.00047773248,"about_ca_system_score_gemma":0.0008474709,"threshold_uncertainty_score":0.005965531},"labels":[],"label_agreement":null},{"id":"W2096950527","doi":"10.1109/milcom.2008.4753081","title":"Scalable Team Oriented Reliable Multicast routing protocol for tactical mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada); University of Calgary","funders":"","keywords":"Computer network; Protocol Independent Multicast; Computer science; Multicast; Xcast; Pragmatic General Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Reliable multicast; IP multicast; Mobile ad hoc network; Geocast; Routing protocol; Wireless Routing Protocol; Routing (electronic design automation)","score_opus":0.022224505742201157,"score_gpt":0.2885039974757532,"score_spread":0.2662794917335521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096950527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016094595,0.0050904304,0.9627127,0.0007736184,0.00063346146,0.00035345895,0.00026903965,0.0029421619,0.011130506],"genre_scores_gemma":[0.45086426,0.0052931844,0.528126,0.0005960172,0.00066967116,0.0012595395,0.0019447353,0.00030570567,0.010940842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994024,0.00017840567,0.000032805172,0.000041136074,0.0002960493,0.000049274255],"domain_scores_gemma":[0.99950397,0.00011734094,0.00007467918,0.00008477195,0.00018226766,0.00003689375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071223726,0.00046965852,0.0005269249,0.0006708116,0.000692354,0.000598464,0.0011361894,0.0005158119,0.0013955508],"category_scores_gemma":[0.0013769778,0.00019615647,0.00033223032,0.00069635804,0.00031710797,0.0009470288,0.001001201,0.0007099406,0.0006229485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004271773,0.0001174136,0.00097339816,0.0011892635,0.00028551908,0.0016800849,0.00063514465,0.108561024,0.063870974,0.12401484,0.06066498,0.63758016],"study_design_scores_gemma":[0.00023806802,0.000780967,0.00094535534,0.00019294916,0.00027706963,0.001835541,0.00028542345,0.6971456,0.026208747,0.077239715,0.19472569,0.0001249699],"about_ca_topic_score_codex":0.0007005152,"about_ca_topic_score_gemma":0.00087245146,"teacher_disagreement_score":0.0013955508,"about_ca_system_score_codex":0.00039919824,"about_ca_system_score_gemma":0.0005415311,"threshold_uncertainty_score":0.0046685934},"labels":[],"label_agreement":null},{"id":"W2097156126","doi":"10.1109/vtcf.2006.543","title":"Connectivity and Bit Error Rate Analysis of Mobile Ad Hoc Wireless Networks","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Rician fading; Node (physics); Mobility model; Wireless network; Bit error rate; Fading; Wireless; Telecommunications; Network packet; Channel (broadcasting); Engineering","score_opus":0.008967757391422646,"score_gpt":0.22656222803919726,"score_spread":0.21759447064777462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097156126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061954178,0.019235604,0.90204644,0.0009669938,0.00019296505,0.00007479318,0.00021799614,0.00043230265,0.014878778],"genre_scores_gemma":[0.92820436,0.015518507,0.050560407,0.00021396503,0.0005824399,0.00020964895,0.00035611916,0.00014743615,0.004206994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983419,0.0006339637,0.00006297964,0.00014455018,0.00068392995,0.00013262406],"domain_scores_gemma":[0.9953751,0.0032091697,0.00043102118,0.00022416216,0.0007087911,0.000051832878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010097619,0.0010049437,0.00061859575,0.002135767,0.0003346427,0.0010877879,0.0009113107,0.0009228996,0.001316564],"category_scores_gemma":[0.010024128,0.00031603925,0.00040013454,0.0019288549,0.0008399948,0.0019041316,0.00053121743,0.00087882916,0.0004631483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102638754,0.000047194266,0.0018168896,0.00030224194,0.0000805186,0.0004917364,0.00022484825,0.8383638,0.006403755,0.10744247,0.0021463,0.042577613],"study_design_scores_gemma":[0.0000037221764,0.000053741707,0.0009096376,0.000036187404,0.00001711029,0.00026677817,0.00002844825,0.97196907,0.0009217669,0.024073243,0.001705721,0.000014507611],"about_ca_topic_score_codex":0.0016765242,"about_ca_topic_score_gemma":0.0005717965,"teacher_disagreement_score":0.002135767,"about_ca_system_score_codex":0.00071638805,"about_ca_system_score_gemma":0.00028558544,"threshold_uncertainty_score":0.0053402185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006723387109422721,"score_gpt":0.23250991739240545,"score_spread":0.22578653028298273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097324407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16597441,0.001326654,0.80172163,0.00032859278,0.00028012306,0.00048521292,0.00014862008,0.026373636,0.0033611339],"genre_scores_gemma":[0.69867146,0.0005358383,0.29537526,0.0003901974,0.00013090571,0.0002453869,0.0003965376,0.00013881865,0.004115603],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99913245,0.00020893426,0.00010155227,0.00015301941,0.00032910626,0.00007489266],"domain_scores_gemma":[0.9982343,0.0005882531,0.00019286659,0.0002599852,0.0006178265,0.00010669516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010704823,0.0005724238,0.00083080906,0.001281062,0.00042765326,0.0006538773,0.0010160698,0.0007163419,0.0009226759],"category_scores_gemma":[0.002526095,0.00026230433,0.00029155513,0.0004404391,0.00036396913,0.0017037408,0.00089487265,0.0007102212,0.0004043263],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017690556,0.00090715685,0.015481349,0.00043897287,0.00028726124,0.0015053716,0.0006633117,0.020378489,0.23268828,0.005880381,0.009400425,0.7105999],"study_design_scores_gemma":[0.0003059311,0.001976755,0.008059023,0.000063527346,0.00040200082,0.003696879,0.00010615327,0.7563382,0.20179805,0.0030512123,0.02407152,0.00013074146],"about_ca_topic_score_codex":0.00051403,"about_ca_topic_score_gemma":0.0005639709,"teacher_disagreement_score":0.001281062,"about_ca_system_score_codex":0.00031983995,"about_ca_system_score_gemma":0.00044360504,"threshold_uncertainty_score":0.0056613088},"labels":[],"label_agreement":null},{"id":"W2097420616","doi":"10.1109/wimob.2007.4390841","title":"Managing Wireless Mesh Networks - Analysis and Proposals","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Key (lock); Reliability (semiconductor); Mesh networking; Wireless network; Wireless; Network management; Decomposition; Distributed computing; Telecommunications; Computer security","score_opus":0.007396971850375309,"score_gpt":0.23483544842986326,"score_spread":0.22743847657948796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097420616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017719746,0.29145852,0.5975834,0.011980281,0.0024499747,0.00038695027,0.00017020805,0.00080148794,0.07744948],"genre_scores_gemma":[0.34460253,0.29463595,0.3131594,0.0013591864,0.0047946703,0.0006515533,0.0006022958,0.00017982081,0.04001461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992524,0.00017037791,0.000053399675,0.00012753368,0.00031561428,0.00008064972],"domain_scores_gemma":[0.9994166,0.00021826928,0.000064997424,0.00007163196,0.0001792707,0.000049211645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018009834,0.00056447776,0.00046998187,0.001326424,0.00056271744,0.0025145533,0.0020484945,0.0017607094,0.0021263426],"category_scores_gemma":[0.002217359,0.0004465958,0.00056604313,0.0017404095,0.0010533154,0.005003303,0.0012527418,0.001059904,0.00074978324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087167406,0.00013534784,0.00095063733,0.0012184791,0.000051010593,0.00024059246,0.0003468841,0.03308366,0.0033238414,0.55973345,0.012286392,0.38854247],"study_design_scores_gemma":[0.00003701957,0.0004364699,0.00090936746,0.0008886769,0.000089655616,0.000928488,0.0006582167,0.20176773,0.007065835,0.32986048,0.45725635,0.00010180009],"about_ca_topic_score_codex":0.0004908796,"about_ca_topic_score_gemma":0.00042877233,"teacher_disagreement_score":0.0025145533,"about_ca_system_score_codex":0.0010655071,"about_ca_system_score_gemma":0.0007847142,"threshold_uncertainty_score":0.009524643},"labels":[],"label_agreement":null},{"id":"W2097440542","doi":"10.1109/nca.2010.8","title":"Six-Shot Multicast: A Location-Aware Strategy for Efficient Message Routing in MANETs","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Multicast; Computer science; Xcast; Computer network; Source-specific multicast; Protocol Independent Multicast; Pragmatic General Multicast; Geocast; Distributed computing; Distance Vector Multicast Routing Protocol; Overhead (engineering); Routing (electronic design automation); Mobile ad hoc network; Scheme (mathematics); Secure multicast; Reliability (semiconductor); Optimized Link State Routing Protocol; Routing protocol","score_opus":0.024557624201401833,"score_gpt":0.28375969761631276,"score_spread":0.2592020734149109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097440542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013766425,0.001044001,0.9812924,0.00027724018,0.00015053074,0.00011604835,0.000039377832,0.0006059511,0.0027079093],"genre_scores_gemma":[0.45197496,0.0015582524,0.5397906,0.00045646552,0.000279296,0.00023085043,0.0003175152,0.0001359773,0.005256174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994137,0.00020909416,0.000029709387,0.00006517339,0.00021421647,0.00006813913],"domain_scores_gemma":[0.99953294,0.00014409643,0.000048943,0.00010365157,0.00010229608,0.00006804264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000958232,0.000513354,0.00091835496,0.0010461002,0.00090331986,0.00066585746,0.0019319584,0.0010334216,0.001376338],"category_scores_gemma":[0.0014471138,0.0002588762,0.00039538875,0.00065457524,0.0005462278,0.0019344764,0.0022756518,0.00067115185,0.0004920376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006483101,0.00023424815,0.001250776,0.00057365274,0.00020614326,0.00086252036,0.0008936267,0.09455478,0.06996862,0.14089033,0.015964592,0.67395246],"study_design_scores_gemma":[0.00009351111,0.0007792344,0.0005420484,0.00009887532,0.00012628581,0.0011892539,0.00036591984,0.8480525,0.023804527,0.07666801,0.048185967,0.00009391023],"about_ca_topic_score_codex":0.00050889957,"about_ca_topic_score_gemma":0.0008698634,"teacher_disagreement_score":0.0019319584,"about_ca_system_score_codex":0.00038699602,"about_ca_system_score_gemma":0.00035090547,"threshold_uncertainty_score":0.005067706},"labels":[],"label_agreement":null},{"id":"W2097508527","doi":"10.1109/glocom.2010.5683149","title":"QoS Support in Delay Tolerant Vehicular Ad Hoc Networks","year":2010,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cistel Technology (Canada); University of Ottawa; University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Optimized Link State Routing Protocol; Quality of service; Wireless ad hoc network; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.011402854349754812,"score_gpt":0.2370489281291746,"score_spread":0.2256460737794198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097508527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07211809,0.0037181526,0.9133429,0.0010569796,0.0003852002,0.00008938927,0.00016087352,0.0008689852,0.008259411],"genre_scores_gemma":[0.9155529,0.0021909487,0.0786581,0.00020648006,0.0002569137,0.00008929684,0.00020616603,0.000083087645,0.00275609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992255,0.00020362357,0.000054472093,0.00008527531,0.00034110615,0.00008996841],"domain_scores_gemma":[0.9985268,0.0007211262,0.00019319709,0.00015062341,0.00031746822,0.00009070505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092499785,0.0005963379,0.00047833743,0.0005806523,0.0006510355,0.0014608881,0.0015137065,0.0007710081,0.0010248418],"category_scores_gemma":[0.0031558916,0.00025440878,0.00020304309,0.00093428046,0.00054894865,0.0016303555,0.0009871616,0.0007034038,0.00033265626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039924635,0.00012417004,0.0019349287,0.000620464,0.000085938,0.0011128976,0.00055951334,0.5538906,0.062196568,0.14996558,0.005264198,0.22384581],"study_design_scores_gemma":[0.000053124484,0.00016007911,0.00039846444,0.000046131107,0.00003677149,0.00031088365,0.00024302397,0.8858065,0.009408955,0.0754327,0.028057743,0.00004568489],"about_ca_topic_score_codex":0.0011271004,"about_ca_topic_score_gemma":0.0009998712,"teacher_disagreement_score":0.0015137065,"about_ca_system_score_codex":0.0005037277,"about_ca_system_score_gemma":0.00055582845,"threshold_uncertainty_score":0.004891932},"labels":[],"label_agreement":null},{"id":"W2097529502","doi":"10.1109/glocom.2011.6134251","title":"Indoor Wireless Planning Using Smart Antennas","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Omnidirectional antenna; Computer science; Directional antenna; Smart antenna; Reconfigurable antenna; Wireless; Wireless network; Computer network; Antenna (radio); Electronic engineering; Telecommunications; Engineering; Antenna efficiency","score_opus":0.0626173369241455,"score_gpt":0.2599304807896353,"score_spread":0.19731314386548982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097529502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024578208,0.00058410503,0.95990676,0.0002079884,0.00005290673,0.000092677794,0.00018381188,0.00031598093,0.014077684],"genre_scores_gemma":[0.54033846,0.0015953784,0.44749475,0.000107951324,0.00006197125,0.0002486946,0.0004163365,0.00013147145,0.009604916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996474,0.00013174294,0.000012073125,0.0000702071,0.00007844794,0.00006017532],"domain_scores_gemma":[0.99960977,0.00022292894,0.00005941816,0.000045968773,0.000025151076,0.00003675556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064638,0.00089487474,0.0008206532,0.0004948822,0.0004811461,0.00087984727,0.00070263364,0.00072519435,0.0030822705],"category_scores_gemma":[0.0010015917,0.0006091319,0.0007508093,0.0011262504,0.0007813609,0.0011235174,0.00087351043,0.0005932214,0.0006103535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045248813,0.000026066107,0.00026013874,0.00006663264,0.000020475178,0.00007527137,0.000040516737,0.9544268,0.0010698071,0.016174648,0.0012262809,0.026568124],"study_design_scores_gemma":[0.000021835618,0.00008351096,0.00020318969,0.000017997068,0.000020550024,0.00008979974,0.00009197663,0.9699618,0.001270542,0.022921829,0.005302583,0.000014380995],"about_ca_topic_score_codex":0.0031617277,"about_ca_topic_score_gemma":0.0039793774,"teacher_disagreement_score":0.0031617277,"about_ca_system_score_codex":0.0007938853,"about_ca_system_score_gemma":0.0006233702,"threshold_uncertainty_score":0.010311246},"labels":[],"label_agreement":null},{"id":"W2097670946","doi":"10.1109/imcsit.2008.4747342","title":"Supporting wireless application development via virtual execution","year":2008,"lang":"en","type":"article","venue":"Proceedings of the International Multiconference on Computer Science and Information Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Alberta","funders":"","keywords":"Emulation; Computer science; Virtualization; Wireless sensor network; Wireless ad hoc network; Wireless network; Wireless; Component (thermodynamics); Field (mathematics); Computer network; Operating system","score_opus":0.008717102521610558,"score_gpt":0.2284222999415154,"score_spread":0.21970519741990482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097670946","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008845669,0.00012363479,0.96737057,0.00019993386,0.00008089067,0.00016450095,0.000076277705,0.0157109,0.0074277613],"genre_scores_gemma":[0.29128993,0.00090792583,0.6850578,0.0006125224,0.00014818103,0.0008446593,0.0010252281,0.006072109,0.014041556],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831676,0.0006027301,0.0001413187,0.00027933938,0.00038488038,0.00027504851],"domain_scores_gemma":[0.99706763,0.0010736408,0.00015687478,0.0011588638,0.00028541367,0.00025763296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026624582,0.0010890134,0.0004467208,0.00048521505,0.0005836828,0.0029729696,0.0027707918,0.0008225933,0.0063109454],"category_scores_gemma":[0.0077847415,0.00062897435,0.000571469,0.00035816254,0.0012478615,0.0039811903,0.004723206,0.001708779,0.0026251925],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095282175,0.00060162006,0.0059002284,0.0007450592,0.000105912695,0.0011185858,0.002128882,0.062079407,0.06359086,0.29767206,0.02782303,0.5372814],"study_design_scores_gemma":[0.00020282158,0.0004413993,0.001163892,0.00027361637,0.00007399329,0.00096725347,0.00023407488,0.4822405,0.07519925,0.094584584,0.34446463,0.00015402374],"about_ca_topic_score_codex":0.00090056506,"about_ca_topic_score_gemma":0.0007407096,"teacher_disagreement_score":0.0063109454,"about_ca_system_score_codex":0.0004643086,"about_ca_system_score_gemma":0.0015369919,"threshold_uncertainty_score":0.021112204},"labels":[],"label_agreement":null},{"id":"W2097934947","doi":"10.1109/euc.2010.135","title":"Detection and Prevention of Routing Intrusions in Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Industry Canada","keywords":"Optimized Link State Routing Protocol; Computer science; Computer network; Mobile ad hoc network; Link-state routing protocol; Distributed computing; Routing protocol; Wireless Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Wireless ad hoc network; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.006960049238058091,"score_gpt":0.23432671040202158,"score_spread":0.22736666116396348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097934947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5314789,0.008661264,0.43760765,0.0019784137,0.0006803882,0.0007012741,0.00016428942,0.0061534583,0.012574441],"genre_scores_gemma":[0.9323516,0.0016540672,0.06365208,0.0002258996,0.00017045454,0.00007995774,0.00013886088,0.000050914223,0.0016760414],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970072,0.00062040327,0.00027886496,0.0003066172,0.001618042,0.00016887742],"domain_scores_gemma":[0.9942531,0.0017499945,0.0015314369,0.0010257283,0.0012256859,0.00021409341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017152375,0.00053522136,0.0009348116,0.0016180206,0.00051757996,0.0010416404,0.0010151989,0.0013924675,0.00032925408],"category_scores_gemma":[0.007823454,0.0004242726,0.00032067014,0.00068482175,0.0007927192,0.0018995482,0.0012582971,0.0008838582,0.00035936027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090005534,0.00077014335,0.05083706,0.0007393302,0.0002937577,0.0019181733,0.0006940439,0.045306295,0.13327402,0.010141221,0.0051115667,0.7500144],"study_design_scores_gemma":[0.0002221608,0.0030291548,0.044246323,0.00035520448,0.0005049966,0.012396921,0.0008796268,0.671332,0.21624087,0.02042446,0.030194188,0.00017418305],"about_ca_topic_score_codex":0.00029333145,"about_ca_topic_score_gemma":0.00029956465,"teacher_disagreement_score":0.0017152375,"about_ca_system_score_codex":0.0002648813,"about_ca_system_score_gemma":0.00048369524,"threshold_uncertainty_score":0.009071171},"labels":[],"label_agreement":null},{"id":"W2098014612","doi":"10.1109/mcom.2012.6178836","title":"Cooperative data dissemination via roadside WLANs","year":2012,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Dissemination; Computer science; Computer network; The Internet; Network packet; Information Dissemination; Quality of service; Local area network; Transmission (telecommunications); Telecommunications; World Wide Web","score_opus":0.05068734773040833,"score_gpt":0.3279388051350266,"score_spread":0.27725145740461826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098014612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36311084,0.0014488214,0.59582895,0.000571524,0.000056008288,0.00022497734,0.00012475591,0.0018955611,0.036738597],"genre_scores_gemma":[0.96908265,0.00044600756,0.024873706,0.000057452275,0.000027122749,0.00006921705,0.00007955901,0.000020473892,0.005343907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992908,0.00026907204,0.000029149876,0.00011372254,0.00016699848,0.00013018027],"domain_scores_gemma":[0.99821705,0.0007145915,0.0002443828,0.00030354876,0.00044423385,0.00007620165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008088898,0.00038854306,0.00036579432,0.0008469396,0.0004705837,0.0009427161,0.00080784917,0.0005502572,0.0015650146],"category_scores_gemma":[0.0022604933,0.0001780479,0.00027867506,0.00084665243,0.00035668947,0.001049567,0.0016118952,0.00038957506,0.00061687804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010776926,0.00039219967,0.011212567,0.00043802755,0.00022690398,0.0025479784,0.0022181494,0.23454276,0.2089603,0.046300985,0.005722794,0.4863596],"study_design_scores_gemma":[0.00009750221,0.0008710278,0.0027371626,0.000037274804,0.00014544032,0.0015435141,0.0009810984,0.87453794,0.07750119,0.010367023,0.031104304,0.000076525765],"about_ca_topic_score_codex":0.0013309283,"about_ca_topic_score_gemma":0.0011449187,"teacher_disagreement_score":0.0015650146,"about_ca_system_score_codex":0.00041962272,"about_ca_system_score_gemma":0.00042518644,"threshold_uncertainty_score":0.005235493},"labels":[],"label_agreement":null},{"id":"W2098135353","doi":"10.1109/tvt.2011.2160883","title":"Cross-Layer Throughput Optimization With Power Control in Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Throughput; Computer science; Topology control; Power control; Wireless sensor network; Network topology; Heuristics; Maximum throughput scheduling; Node (physics); Transmission (telecommunications); Computer network; Wireless network; Distributed computing; Topology (electrical circuits); Wireless; Power (physics); Key distribution in wireless sensor networks; Engineering; Quality of service","score_opus":0.010904810384976255,"score_gpt":0.22259755617077243,"score_spread":0.21169274578579617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098135353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026496645,0.0007923699,0.97069687,0.0001254207,0.000045934747,0.000033559914,0.000018421139,0.00037866744,0.0014120988],"genre_scores_gemma":[0.8858209,0.0006776894,0.11176187,0.00010741169,0.000070826674,0.000098324184,0.00004938523,0.00014488297,0.0012686589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982881,0.0007581826,0.00008599888,0.00024342764,0.00040557058,0.00021869129],"domain_scores_gemma":[0.9970421,0.002066389,0.0002995355,0.00020839198,0.00032400948,0.000059513044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037985942,0.0015604501,0.0011393293,0.0009526699,0.0006189936,0.0014412373,0.0012376963,0.00073089334,0.0011813664],"category_scores_gemma":[0.0063101775,0.00064984564,0.0006351522,0.0014421749,0.0012181719,0.0022690843,0.0014989703,0.00092067453,0.00022396298],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006299833,0.000030814674,0.00022034849,0.00004183412,0.000028366345,0.000028721584,0.000038352006,0.97391176,0.0017340456,0.005970243,0.00023808841,0.017694475],"study_design_scores_gemma":[0.000004737588,0.000022436212,0.000037718695,0.0000022944857,0.0000057043253,0.000009149802,0.0000047762665,0.9964631,0.00086676434,0.0024871125,0.00009341319,0.0000028123188],"about_ca_topic_score_codex":0.0015167883,"about_ca_topic_score_gemma":0.0012735284,"teacher_disagreement_score":0.0037985942,"about_ca_system_score_codex":0.0012919478,"about_ca_system_score_gemma":0.0009648734,"threshold_uncertainty_score":0.02008909},"labels":[],"label_agreement":null},{"id":"W2098415706","doi":"10.1109/iscc.2009.5202372","title":"Robust Key Management scheme for certification in mobile ad-hoc networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec; Université du Québec en Outaouais","funders":"","keywords":"Key management; Computer science; Computer network; Computer security; Certification; Robustness (evolution); Mobile ad hoc network; Wireless ad hoc network; Cryptography; Key (lock); Adversary; Public-key cryptography; Scheme (mathematics); Wireless; Telecommunications; Encryption","score_opus":0.026033629369189088,"score_gpt":0.24621019436303643,"score_spread":0.22017656499384733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098415706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026613468,0.0018825424,0.9643965,0.00065189064,0.00033334128,0.00021664883,0.00007460056,0.0007476862,0.0050834003],"genre_scores_gemma":[0.83554363,0.0011666323,0.15876226,0.00022788558,0.00021488643,0.00020315337,0.00020372921,0.000058221573,0.003619605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974201,0.00072734524,0.0002326052,0.0003211204,0.0010543774,0.00024445305],"domain_scores_gemma":[0.99819994,0.00037307842,0.00034600944,0.00057466433,0.00036312643,0.00014308836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020952388,0.00039020603,0.0007248061,0.0009111015,0.00087332155,0.0013712771,0.0018176223,0.0012761841,0.0013048695],"category_scores_gemma":[0.0037579727,0.00020832916,0.0005615716,0.00090715545,0.0011384902,0.0042245327,0.0021819659,0.0013778192,0.00061206496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005611147,0.00020264882,0.0012525232,0.0007738643,0.00014904416,0.0010358224,0.0007203131,0.07303671,0.080595866,0.6066383,0.0076500215,0.22738388],"study_design_scores_gemma":[0.00031217773,0.0009076381,0.0007861549,0.00020048812,0.00018606686,0.002291149,0.0001999634,0.7150548,0.05270672,0.16110761,0.06601476,0.00023252904],"about_ca_topic_score_codex":0.00033303897,"about_ca_topic_score_gemma":0.00020785755,"teacher_disagreement_score":0.0020952388,"about_ca_system_score_codex":0.001079134,"about_ca_system_score_gemma":0.0011986295,"threshold_uncertainty_score":0.0110808015},"labels":[],"label_agreement":null},{"id":"W2098697782","doi":"10.1109/lcn.2008.4664164","title":"A new approach for the construction of multiple multicast trees using multiple description video for wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Wireless ad hoc network; Multiple description coding; Multicast; Coding (social sciences); Computer network; Linear network coding; Mobile ad hoc network; Wireless network; Wireless; Vehicular ad hoc network; Scheme (mathematics); Theoretical computer science; Distributed computing; Network packet; Mathematics; Telecommunications","score_opus":0.05546047077431785,"score_gpt":0.24939019215474922,"score_spread":0.19392972138043138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098697782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026879383,0.00018890089,0.9962281,0.00008042733,0.00003234636,0.0000485644,0.00002297352,0.00011988472,0.00059102644],"genre_scores_gemma":[0.06912647,0.00040962998,0.9287591,0.00010541836,0.000068950685,0.00014098089,0.0001554296,0.00004412869,0.0011898929],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992955,0.00016224913,0.00004415255,0.00009058756,0.0003583306,0.00004910424],"domain_scores_gemma":[0.9992416,0.00025185788,0.00009228209,0.00014605066,0.00020210561,0.000066079585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763836,0.00039289688,0.0004309626,0.0010444805,0.00068528816,0.00066832296,0.0013670563,0.0006413336,0.0009418542],"category_scores_gemma":[0.0016883316,0.00032178639,0.000735739,0.00096920744,0.0004620302,0.0015893469,0.0013074353,0.0010796181,0.0003545293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016138177,0.00021093265,0.0011339957,0.0006062989,0.00014197697,0.0005195231,0.0006582288,0.07386469,0.09509377,0.16080032,0.0067025493,0.66010636],"study_design_scores_gemma":[0.00008624827,0.00040534913,0.000552431,0.00006702713,0.00010839458,0.0012489073,0.00015900348,0.86823994,0.03524642,0.04339832,0.050365068,0.00012290449],"about_ca_topic_score_codex":0.0010543981,"about_ca_topic_score_gemma":0.0013190755,"teacher_disagreement_score":0.0013670563,"about_ca_system_score_codex":0.0005819591,"about_ca_system_score_gemma":0.0007208384,"threshold_uncertainty_score":0.0042224526},"labels":[],"label_agreement":null},{"id":"W2098721851","doi":"10.1109/iscc.2009.5202375","title":"Self-optimizing cooperative caching in autonomic Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Bottleneck; Computer network; Computer science; The Internet; Wireless network; Wireless broadband; Wireless; Network packet; Distributed computing; Default gateway; Telecommunications; Operating system; Embedded system","score_opus":0.008520740151949709,"score_gpt":0.2278319617592512,"score_spread":0.2193112216073015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098721851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47584134,0.0010686589,0.51882917,0.00027571825,0.00004833759,0.00004400206,0.000033782042,0.00045122305,0.0034077878],"genre_scores_gemma":[0.9870546,0.00007767749,0.012483965,0.00002031497,0.00001205697,0.000016189635,0.0000104102655,0.000009610189,0.00031520592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997383,0.00011537748,0.000013257994,0.000036174566,0.000053957698,0.00004290955],"domain_scores_gemma":[0.9993299,0.00030945204,0.00012095985,0.000100254656,0.00010076921,0.000038645718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075784157,0.00024357841,0.0004051744,0.00028354983,0.00036601143,0.00045175955,0.00072426576,0.00038836422,0.00021473842],"category_scores_gemma":[0.0016522352,0.00020517626,0.00017182415,0.00040130044,0.00039417803,0.0007701251,0.0004014263,0.00019803329,0.00004600913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011256636,0.000079849146,0.0027752633,0.00004834097,0.00005286975,0.00014845461,0.000104008024,0.93847287,0.013504731,0.009751395,0.00075732206,0.03419241],"study_design_scores_gemma":[0.0000082405095,0.000030051033,0.00025482813,0.0000013420639,0.000009384573,0.000024482393,0.000016785585,0.99578357,0.0009349271,0.002712183,0.0002206452,0.000003590933],"about_ca_topic_score_codex":0.0014764364,"about_ca_topic_score_gemma":0.0015265871,"teacher_disagreement_score":0.0014764364,"about_ca_system_score_codex":0.00046014335,"about_ca_system_score_gemma":0.0003002546,"threshold_uncertainty_score":0.0040079355},"labels":[],"label_agreement":null},{"id":"W2098833650","doi":"10.1109/icc.2006.255032","title":"Snapshot Capacity of Multi Hop Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Snapshot (computer storage); Computer science; Wireless ad hoc network; Hop (telecommunications); Computer network; Distributed computing; Algorithm; Wireless; Telecommunications","score_opus":0.09865646480188171,"score_gpt":0.31940572436053377,"score_spread":0.22074925955865204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098833650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16684762,0.0028949366,0.80979645,0.00034800384,0.00008143935,0.00006313235,0.00021810936,0.00039055396,0.01935971],"genre_scores_gemma":[0.9834146,0.0013697399,0.012684677,0.000055900044,0.000045638124,0.00005269232,0.00009879933,0.00002962256,0.0022483484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956363,0.00011831864,0.000015469652,0.000061528364,0.00014990006,0.00009115183],"domain_scores_gemma":[0.99760455,0.0016050776,0.00014182129,0.00014001498,0.0003758792,0.00013261409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000637935,0.00040793014,0.0004462456,0.00074929715,0.00036126445,0.0011301591,0.00089459564,0.00037286902,0.002387248],"category_scores_gemma":[0.0041048736,0.00020068034,0.00021666611,0.0006341194,0.0011991679,0.002375765,0.0009807425,0.0006180218,0.00023410613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015083104,0.000035999354,0.0010942337,0.00025645114,0.000050272618,0.00036444466,0.00029528717,0.4964838,0.01139253,0.44992036,0.0018415259,0.03811425],"study_design_scores_gemma":[0.000008743894,0.00007891826,0.00040185376,0.000032227803,0.00001163231,0.00019084684,0.000120108394,0.8546025,0.003558467,0.1388647,0.0021028991,0.000027146089],"about_ca_topic_score_codex":0.00088640396,"about_ca_topic_score_gemma":0.0003243947,"teacher_disagreement_score":0.002387248,"about_ca_system_score_codex":0.0006239295,"about_ca_system_score_gemma":0.0005121419,"threshold_uncertainty_score":0.007986188},"labels":[],"label_agreement":null},{"id":"W2098989254","doi":"10.1109/wimob.2007.4390877","title":"Load-Balanced Routing in Wireless Networks: State Information Accuracy Using OLSR","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Link-state routing protocol; Routing protocol; Wireless Routing Protocol; Metrics; Zone Routing Protocol; Dynamic Source Routing; Distributed computing; Static routing; Routing Information Protocol; Routing (electronic design automation)","score_opus":0.01245213558453435,"score_gpt":0.256454570348728,"score_spread":0.24400243476419364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098989254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40390623,0.0015887505,0.5878973,0.0009143282,0.00009327116,0.00014620199,0.00014819606,0.0019741806,0.0033315334],"genre_scores_gemma":[0.92316324,0.0005004198,0.07564769,0.000059930604,0.00004235607,0.00004103878,0.00010550064,0.000050668397,0.00038910116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608874,0.0012360051,0.0002457095,0.00029582164,0.0018855475,0.00024820093],"domain_scores_gemma":[0.9918407,0.00328302,0.0013056442,0.0022995723,0.0011743241,0.00009663242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041290633,0.0007454079,0.00083930435,0.0013665837,0.0005804243,0.0016407422,0.0010805865,0.0007362496,0.00032206354],"category_scores_gemma":[0.015665567,0.00035657745,0.00033297896,0.0014672986,0.000796347,0.0040098955,0.0014272212,0.0007565085,0.00015241027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083327433,0.00029489698,0.018723428,0.00021761445,0.00021385902,0.0002194662,0.00067681243,0.56763744,0.05093495,0.010244123,0.0011146832,0.34888938],"study_design_scores_gemma":[0.000029667575,0.00025399085,0.0054951073,0.000033975335,0.00006634169,0.00017618248,0.00012938137,0.95730966,0.029096011,0.0060995375,0.0012357996,0.00007426786],"about_ca_topic_score_codex":0.0025671732,"about_ca_topic_score_gemma":0.0018960518,"teacher_disagreement_score":0.0041290633,"about_ca_system_score_codex":0.00087013684,"about_ca_system_score_gemma":0.0007590522,"threshold_uncertainty_score":0.021836877},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; 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","score_opus":0.06212585223188858,"score_gpt":0.3066082981316978,"score_spread":0.24448244589980925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099028485","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003633444,0.92035675,0.04802339,0.002392431,0.001279184,0.0001004372,0.000086059124,0.00015710143,0.023971226],"genre_scores_gemma":[0.02278769,0.94942117,0.01958252,0.00074900273,0.0023495506,0.00006788092,0.00016242996,0.000042712294,0.0048370347],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99767786,0.00054613646,0.00029293582,0.0002664023,0.0010728326,0.00014375246],"domain_scores_gemma":[0.9969831,0.0018008922,0.00019442578,0.00024875454,0.0006835337,0.00008933404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566657,0.0011866326,0.0012503564,0.0040178923,0.0011481576,0.0026459717,0.0011668913,0.0017553021,0.0030964466],"category_scores_gemma":[0.0038696483,0.00077812007,0.00069149304,0.009996525,0.001150003,0.005790106,0.0014608204,0.0025748096,0.002937515],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008311839,0.00015495835,0.0019501395,0.0053714425,0.000055968478,0.00026572047,0.00028655876,0.0042103375,0.0025295028,0.07995237,0.025137324,0.8800026],"study_design_scores_gemma":[0.000023974537,0.00033166856,0.0026031237,0.003418216,0.00009905283,0.0038274522,0.00037691512,0.012704363,0.0036157414,0.07029472,0.90259725,0.00010743494],"about_ca_topic_score_codex":0.0005008078,"about_ca_topic_score_gemma":0.00046898858,"teacher_disagreement_score":0.0040178923,"about_ca_system_score_codex":0.00096617604,"about_ca_system_score_gemma":0.001049863,"threshold_uncertainty_score":0.010358691},"labels":[],"label_agreement":null},{"id":"W2099734317","doi":"10.1109/icccn.2003.1284210","title":"A variable degree based clustering algorithm for networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cluster analysis; Computer science; Degree (music); Partition (number theory); Hierarchical clustering; Cluster (spacecraft); Algorithm; Routing algorithm; Hierarchical routing; Routing table; Variable (mathematics); Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Hierarchical network model; Correlation clustering; Static routing; Routing protocol; Link-state routing protocol; Mathematics; Artificial intelligence; Computer network","score_opus":0.02104199973559782,"score_gpt":0.23407615195705736,"score_spread":0.21303415222145955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099734317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014734601,0.0006537218,0.9942781,0.00017450335,0.00011482944,0.00015083484,0.00013679068,0.00085708353,0.0021607555],"genre_scores_gemma":[0.029725842,0.00077182124,0.9630141,0.00014254946,0.000074440504,0.0003714738,0.0005541691,0.00017436183,0.0051711835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986218,0.00027751026,0.000074325995,0.00034135746,0.00060098193,0.0000840538],"domain_scores_gemma":[0.9990989,0.00024740477,0.00010792803,0.00019147412,0.00031223128,0.00004204034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011145215,0.001191306,0.001088919,0.0022983414,0.0018441167,0.0015893875,0.0024881705,0.0015755788,0.0034666508],"category_scores_gemma":[0.003479148,0.0005197136,0.00089900475,0.004047564,0.0008841383,0.0022463342,0.0015415641,0.0018217474,0.0023917628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010674837,0.00007390838,0.00071686023,0.0003136967,0.00019945671,0.00009337719,0.00023925245,0.2779334,0.005948795,0.08926374,0.02685291,0.5982579],"study_design_scores_gemma":[0.00007204274,0.00010832062,0.0006294341,0.0000773996,0.000058628233,0.00037358198,0.000101551224,0.81917614,0.0063641164,0.08220366,0.09073816,0.00009692876],"about_ca_topic_score_codex":0.007220229,"about_ca_topic_score_gemma":0.0097800335,"teacher_disagreement_score":0.007220229,"about_ca_system_score_codex":0.0018394619,"about_ca_system_score_gemma":0.0019034576,"threshold_uncertainty_score":0.014356434},"labels":[],"label_agreement":null},{"id":"W2099881946","doi":"10.1109/glocom.2004.1379140","title":"Multicast lifetime maximization for energy-constrained wireless ad-hoc networks with directional antennas","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Wireless ad hoc network; Computer science; Computer network; Maximization; Wireless; Directional antenna; Telecommunications; Mathematical optimization; Antenna (radio); Mathematics","score_opus":0.00718009023729102,"score_gpt":0.2086277583212984,"score_spread":0.20144766808400738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099881946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114067696,0.0015213201,0.880518,0.0003874016,0.000029245997,0.000045545465,0.00010594648,0.00021729727,0.003107614],"genre_scores_gemma":[0.8506045,0.0015727321,0.14566936,0.00007883153,0.00008209293,0.00013124483,0.00016872109,0.00007557398,0.0016169382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968874,0.00015659077,0.000013595172,0.00003518811,0.00006132247,0.0000444945],"domain_scores_gemma":[0.99926764,0.0004934334,0.00009203225,0.0000452788,0.00006963216,0.00003184404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085419544,0.0007042284,0.0005753617,0.00044648472,0.00042070774,0.00038368898,0.000597232,0.00067567965,0.000588424],"category_scores_gemma":[0.0021688703,0.00024009238,0.00026868845,0.00067732943,0.00029773157,0.0009545775,0.000543666,0.0003221139,0.00012585225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025463832,0.000074874886,0.0009915117,0.00021454315,0.000056149547,0.00012773527,0.00016044392,0.878851,0.017690793,0.0197152,0.002077702,0.079785414],"study_design_scores_gemma":[0.000024044291,0.00009570231,0.00022858997,0.000011484293,0.000021629186,0.000093376395,0.000039116574,0.98028576,0.0036312882,0.014393484,0.001167706,0.000007936872],"about_ca_topic_score_codex":0.00040415753,"about_ca_topic_score_gemma":0.0004911586,"teacher_disagreement_score":0.00085419544,"about_ca_system_score_codex":0.00047087512,"about_ca_system_score_gemma":0.00026726178,"threshold_uncertainty_score":0.004517436},"labels":[],"label_agreement":null},{"id":"W2100197371","doi":"10.1109/infocom.2006.50","title":"Optimal Traffic-Oblivious Energy-Aware Routing for Multihop Wireless Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Routing (electronic design automation); Wireless; Distributed computing; Telecommunications","score_opus":0.008226016381941079,"score_gpt":0.21508315139843928,"score_spread":0.20685713501649822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100197371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041270524,0.0002811642,0.9556594,0.00038397816,0.000023687226,0.00002864731,0.0000383154,0.00022371941,0.002090601],"genre_scores_gemma":[0.8958707,0.000472947,0.10088639,0.00013480018,0.000061679304,0.00009871205,0.00010627307,0.00010189506,0.0022665642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990669,0.00046949735,0.00003227788,0.00009760425,0.00018626134,0.00014747307],"domain_scores_gemma":[0.9977977,0.0015366885,0.00022006515,0.0002096007,0.00016959678,0.000066380984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014242484,0.00057245546,0.00074449315,0.00046551248,0.0004308219,0.0009081902,0.0009928326,0.0007033311,0.0014191408],"category_scores_gemma":[0.00438201,0.00041306086,0.00047351726,0.00061498577,0.0009867803,0.002074022,0.0011066641,0.0010409402,0.0002171921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006476318,0.0000513278,0.00022660043,0.000060039758,0.000017253333,0.000032077078,0.00004512932,0.95392036,0.002659392,0.028444936,0.00079899095,0.013679126],"study_design_scores_gemma":[0.0000050612684,0.000021318756,0.000028333705,0.0000030103438,0.0000026791845,0.000008489863,0.0000094710995,0.98319227,0.00048430538,0.016040506,0.00020177639,0.0000028762922],"about_ca_topic_score_codex":0.0010853021,"about_ca_topic_score_gemma":0.0008132344,"teacher_disagreement_score":0.0014242484,"about_ca_system_score_codex":0.0012773619,"about_ca_system_score_gemma":0.00072031305,"threshold_uncertainty_score":0.009267926},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02484175342221162,"score_gpt":0.2738050662479757,"score_spread":0.24896331282576406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100252439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41636455,0.008480623,0.5576702,0.000664627,0.00051406905,0.000284671,0.00023786514,0.0020517395,0.013731694],"genre_scores_gemma":[0.9371978,0.0011978489,0.059435576,0.000040500723,0.00008789744,0.00008083433,0.00013337856,0.00008205234,0.0017441178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846894,0.00056652294,0.0000428935,0.00012598785,0.000648594,0.00014711195],"domain_scores_gemma":[0.9933601,0.0041871937,0.00033825825,0.00043282978,0.0015254057,0.00015625359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021569366,0.0008658659,0.0007635946,0.0011722953,0.0006054738,0.0006475349,0.000708608,0.00060597056,0.0014013601],"category_scores_gemma":[0.007949718,0.00018990328,0.0003160248,0.0012899295,0.00039248844,0.00093652506,0.0004780354,0.0004186067,0.00024015854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013185964,0.0002013969,0.0051182173,0.0003820734,0.0002225401,0.00021802216,0.00016619802,0.7151253,0.028615583,0.010758921,0.0036075283,0.23426561],"study_design_scores_gemma":[0.00002056334,0.0004962616,0.000939268,0.00001076781,0.000043552107,0.0001916081,0.000037193906,0.9916089,0.0043682684,0.00095333526,0.0013091182,0.000021198635],"about_ca_topic_score_codex":0.0022645183,"about_ca_topic_score_gemma":0.0013625952,"teacher_disagreement_score":0.0022645183,"about_ca_system_score_codex":0.0010400747,"about_ca_system_score_gemma":0.0006764347,"threshold_uncertainty_score":0.011407137},"labels":[],"label_agreement":null},{"id":"W2100356252","doi":"10.1109/twc.2008.080726","title":"Pareto optimal resource management for wireless mesh networks with QoS assurance: Joint node clustering and subcarrier allocation","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Resource allocation; Wireless mesh network; Throughput; Subcarrier; Distributed computing; Provisioning; Cluster analysis; Node (physics); Wireless network; Wireless; Orthogonal frequency-division multiplexing","score_opus":0.019702947381906307,"score_gpt":0.24743809798241853,"score_spread":0.22773515060051222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100356252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04532335,0.00021748822,0.95106876,0.00020912786,0.00001878274,0.000038937047,0.000021916943,0.000072453884,0.0030292422],"genre_scores_gemma":[0.8551333,0.0002450321,0.14231683,0.00006635059,0.000036645215,0.00009432731,0.000036631867,0.00003145883,0.0020394481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943703,0.00022649007,0.000017306962,0.00006898551,0.00016660673,0.00008364555],"domain_scores_gemma":[0.9992374,0.00037112786,0.00011424398,0.00011236247,0.000119039454,0.000045873712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012079553,0.0005172298,0.0005840793,0.00062614796,0.00074046326,0.0007467093,0.00088931876,0.00055580615,0.00077781355],"category_scores_gemma":[0.0024479053,0.0002071749,0.00023946528,0.0006956284,0.0008977032,0.0010788075,0.0009632843,0.00044270456,0.00019347717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007322054,0.000071822404,0.0005085561,0.00004695491,0.00003116182,0.000058396556,0.000072234216,0.8917942,0.0054716393,0.046382368,0.0009759426,0.054513447],"study_design_scores_gemma":[0.000010482123,0.000024426508,0.000120722565,0.0000032461292,0.00000423965,0.000021130674,0.000022600007,0.97850686,0.0011068811,0.019676473,0.00049768196,0.00000526725],"about_ca_topic_score_codex":0.0012914219,"about_ca_topic_score_gemma":0.0017666657,"teacher_disagreement_score":0.0012914219,"about_ca_system_score_codex":0.001031255,"about_ca_system_score_gemma":0.0011650487,"threshold_uncertainty_score":0.0074822903},"labels":[],"label_agreement":null},{"id":"W2100706156","doi":"10.1109/icc.2007.577","title":"An Efficient Leader Election Protocol for Wireless Quasi-Static Mesh Networks: Proof of Correctness","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless mesh network; Correctness; Protocol (science); Network topology; Computer network; Algorithm; Mesh networking; Node (physics); Topology (electrical circuits); Wireless network; Wireless; Mathematics; Combinatorics; Operating system; Engineering; Medicine","score_opus":0.020373472089430453,"score_gpt":0.31026281028582176,"score_spread":0.2898893381963913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100706156","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003985772,0.00023419429,0.98948824,0.00075086957,0.00018089314,0.00021450515,0.00009726194,0.00061141286,0.004436833],"genre_scores_gemma":[0.4171876,0.0013120202,0.5698619,0.00096018385,0.00034177557,0.0019200004,0.0005261486,0.000377556,0.007512884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964011,0.00087213126,0.00023065912,0.00042908813,0.0016420316,0.0004250625],"domain_scores_gemma":[0.9925398,0.00434589,0.0005216784,0.0009306222,0.0014973866,0.00016469971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033617332,0.0007475537,0.00085786555,0.0008112353,0.0014568147,0.002077753,0.0017627496,0.0013726961,0.0045144493],"category_scores_gemma":[0.014251985,0.00072347355,0.0011722283,0.00092196796,0.0022062326,0.00488829,0.003497547,0.0025270646,0.0015865632],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002621742,0.00020331114,0.0012758422,0.000899595,0.00019655518,0.0010109239,0.0009770301,0.13603577,0.016703522,0.71871513,0.022350088,0.10137007],"study_design_scores_gemma":[0.0004515144,0.0003351526,0.00049983617,0.00019573008,0.0001355462,0.0007050426,0.00022899538,0.6284865,0.015384444,0.31342518,0.040013716,0.00013845314],"about_ca_topic_score_codex":0.0013232984,"about_ca_topic_score_gemma":0.000959092,"teacher_disagreement_score":0.0045144493,"about_ca_system_score_codex":0.0011223509,"about_ca_system_score_gemma":0.0025101725,"threshold_uncertainty_score":0.017778754},"labels":[],"label_agreement":null},{"id":"W2100803703","doi":"10.1109/lcn.2001.990787","title":"On minimum-energy broadcasting in all-wireless networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Wireless; Broadcast radiation; Wireless network; Heuristic; Bandwidth (computing); Broadcast domain; Broadcast communication network; Tree (set theory); Atomic broadcast; Node (physics); Efficient energy use; Mobile telephony; Distributed computing; Mobile radio; Telecommunications; Engineering; Electrical engineering; Mathematics; Network packet","score_opus":0.026002456426202754,"score_gpt":0.23068327707179823,"score_spread":0.20468082064559548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100803703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014341909,0.004613623,0.9663638,0.0011507157,0.00016300428,0.00010239455,0.00013462105,0.00019646701,0.012933398],"genre_scores_gemma":[0.46655008,0.024843793,0.49323624,0.0008917952,0.0011030289,0.0007301905,0.0006589421,0.00045731553,0.011528546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916255,0.00041445895,0.000027749045,0.00010510109,0.00018976328,0.00010038041],"domain_scores_gemma":[0.9974394,0.002077074,0.00015935932,0.00009876856,0.00016297078,0.0000624578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012064317,0.0019133794,0.0013991126,0.00078703754,0.0011660585,0.0013581669,0.001897806,0.0015039329,0.003279075],"category_scores_gemma":[0.0050750626,0.0006286519,0.0005867067,0.0026448523,0.0022183415,0.0044155666,0.0015270567,0.0024098482,0.0009859186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015853402,0.00009297452,0.00039965523,0.00081696303,0.000059688748,0.00016674018,0.0002913591,0.5997749,0.0028738566,0.31984535,0.007907045,0.06761308],"study_design_scores_gemma":[0.00004914643,0.0001417655,0.00019382258,0.00007776632,0.00003324361,0.00016368885,0.00011271036,0.64500326,0.0017155107,0.34140587,0.011085042,0.000018184754],"about_ca_topic_score_codex":0.0013470954,"about_ca_topic_score_gemma":0.0013357028,"teacher_disagreement_score":0.003279075,"about_ca_system_score_codex":0.0014737998,"about_ca_system_score_gemma":0.0008383148,"threshold_uncertainty_score":0.01096952},"labels":[],"label_agreement":null},{"id":"W2100818996","doi":"10.1109/twc.2013.121906","title":"FADE: Forwarding Assessment Based Detection of Collaborative Grey Hole Attacks in WMNs","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Leibniz-Gemeinschaft","keywords":"Computer science; Denial-of-service attack; Computer network; Acknowledgement; Channel (broadcasting); Focus (optics); Fading; Fade; Computer security; Adaptability; Quality of service; The Internet","score_opus":0.0206743036905141,"score_gpt":0.28570712871430276,"score_spread":0.26503282502378867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100818996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13879226,0.00041990285,0.8589625,0.00016369781,0.00005777953,0.00011870592,0.000030941548,0.0004967366,0.00095748034],"genre_scores_gemma":[0.9519151,0.00011212983,0.04753929,0.000038859835,0.000014721887,0.000029057472,0.000021457758,0.000009487785,0.0003198479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918,0.0002350803,0.00004735563,0.00013830495,0.0002971529,0.00010198902],"domain_scores_gemma":[0.9970394,0.0017414436,0.00043333205,0.00025372254,0.00042520603,0.00010693976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020478247,0.00065522187,0.00071184704,0.0012005217,0.0003941972,0.0006653189,0.000749349,0.0006940878,0.00030828986],"category_scores_gemma":[0.008800633,0.0002472614,0.00033435543,0.00030061434,0.0007896824,0.0012391036,0.001111979,0.0004344261,0.00007169954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005323533,0.00020086992,0.013704522,0.00021537315,0.00016212426,0.00073103886,0.0004999185,0.66357106,0.048759993,0.015647996,0.0013273179,0.2546473],"study_design_scores_gemma":[0.000010654342,0.00015775203,0.0012077771,0.0000109043085,0.000017629327,0.00022350399,0.00003889722,0.98989385,0.005889049,0.002186762,0.00034293154,0.000020225505],"about_ca_topic_score_codex":0.0014672043,"about_ca_topic_score_gemma":0.0011602372,"teacher_disagreement_score":0.0020478247,"about_ca_system_score_codex":0.0005872636,"about_ca_system_score_gemma":0.00057810225,"threshold_uncertainty_score":0.010830045},"labels":[],"label_agreement":null},{"id":"W2101126543","doi":"10.1109/tc.2010.107","title":"On Delivery Guarantees and Worst-Case Forwarding Bounds of Elementary Face Routing Components in Ad Hoc and Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Computer network; Equal-cost multi-path routing; Greedy algorithm; Face (sociological concept); Routing protocol; Distributed computing; Algorithm","score_opus":0.013136676412290257,"score_gpt":0.22415759046995826,"score_spread":0.21102091405766799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101126543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04876773,0.0079938155,0.9243033,0.0015313957,0.00021747209,0.0001796361,0.00043360045,0.0010649794,0.015508],"genre_scores_gemma":[0.78124034,0.010134934,0.19977684,0.0009790825,0.0008638305,0.0007459012,0.0009929059,0.0009014725,0.0043647634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99069595,0.0022890635,0.00047714438,0.001528218,0.0033211822,0.0016884726],"domain_scores_gemma":[0.92430013,0.061592735,0.0035095806,0.0055901706,0.0038817239,0.0011256435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011197396,0.003798349,0.0022134327,0.0034106793,0.0021888858,0.0055771293,0.00485313,0.0022945995,0.004846539],"category_scores_gemma":[0.066268325,0.0012478033,0.0014960249,0.0034634122,0.0037229657,0.013885804,0.0043079313,0.0043394966,0.0013113774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012426454,0.00029755206,0.0026243255,0.000973725,0.00023624641,0.00033284203,0.0005946449,0.6659629,0.012305391,0.19953413,0.0066220467,0.10927361],"study_design_scores_gemma":[0.00003750856,0.00040822136,0.0007400927,0.00016402811,0.00016781483,0.00042777596,0.00018738191,0.8514506,0.008041208,0.13435821,0.003952442,0.000064624626],"about_ca_topic_score_codex":0.002318951,"about_ca_topic_score_gemma":0.0013907586,"teacher_disagreement_score":0.011197396,"about_ca_system_score_codex":0.004897568,"about_ca_system_score_gemma":0.002276671,"threshold_uncertainty_score":0.059218228},"labels":[],"label_agreement":null},{"id":"W2101343488","doi":"10.1109/glocomw.2004.1417561","title":"A novel framework for cross-layer design in wireless ad hoc and sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Distributed computing; Network packet; Wireless network; Wireless sensor network; Network layer; OSI model; Physical layer; PHY; Link layer; Wireless; Transport layer; Layer (electronics); Telecommunications","score_opus":0.031918433417422905,"score_gpt":0.2897565501055168,"score_spread":0.2578381166880939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101343488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038986,0.00037185306,0.9978485,0.00012865325,0.00006045841,0.00006294581,0.000008451327,0.00011007465,0.0010192486],"genre_scores_gemma":[0.042758547,0.00087559037,0.9533554,0.0002445454,0.00018194104,0.00062574516,0.000058394377,0.00008495277,0.0018148199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959883,0.0017779834,0.0002968445,0.00045477384,0.0012434836,0.00023861772],"domain_scores_gemma":[0.998021,0.0008248786,0.00023046153,0.00035557355,0.00042577978,0.00014233138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008181082,0.0017882796,0.00084472133,0.0010590572,0.0011083077,0.0026218537,0.0037825382,0.0016530133,0.002201555],"category_scores_gemma":[0.005232665,0.000843577,0.001373599,0.0011684402,0.0021965506,0.003177668,0.0030182349,0.0034369228,0.000756767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066403736,0.00010235632,0.00035956723,0.0004350249,0.000094315576,0.0002960536,0.0004245794,0.17678136,0.006528347,0.6672038,0.004466004,0.14324224],"study_design_scores_gemma":[0.00007370127,0.000258169,0.00013893677,0.00016596566,0.00009543202,0.00038355635,0.00008665385,0.6915188,0.0040698117,0.2346757,0.06847395,0.000059440677],"about_ca_topic_score_codex":0.0012546459,"about_ca_topic_score_gemma":0.0018292633,"teacher_disagreement_score":0.008181082,"about_ca_system_score_codex":0.0013342483,"about_ca_system_score_gemma":0.0023589164,"threshold_uncertainty_score":0.043266177},"labels":[],"label_agreement":null},{"id":"W2101924208","doi":"10.1109/aps.2006.1710589","title":"Wireless mesh access point routing for efficient communication in underground mine","year":2006,"lang":"en","type":"article","venue":"2006 IEEE Antennas and Propagation Society International Symposium","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer network; Survivability; Wireless; Flooding (psychology); Computer science; Wireless network; Wireless mesh network; Reliability (semiconductor); Distributed computing; Power (physics); Telecommunications","score_opus":0.01405116382619775,"score_gpt":0.2644402378822748,"score_spread":0.250389074056077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101924208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100076325,0.0014360553,0.88962984,0.0005105048,0.00010873817,0.000054858487,0.00010653729,0.0003576288,0.0077195014],"genre_scores_gemma":[0.87915033,0.0010691168,0.11364041,0.00007048658,0.00007050816,0.00009598414,0.00015607664,0.000042833362,0.0057043196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998621,0.00006162955,0.0000050716726,0.0000138130035,0.00003857282,0.000018660781],"domain_scores_gemma":[0.9998031,0.00011411119,0.00002171769,0.000018030853,0.0000342187,0.000008852201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028183975,0.00018871845,0.00022678396,0.0002844146,0.00024257445,0.00033964615,0.00037141802,0.00033042574,0.0020928183],"category_scores_gemma":[0.0007623814,0.000102123246,0.0001732221,0.00044020408,0.00020052637,0.0005574649,0.0003508469,0.00024313084,0.00021511529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025273993,0.0000532245,0.0013328962,0.00013949255,0.000049471364,0.0002415586,0.00012339959,0.7986373,0.022335635,0.04194998,0.005342999,0.12954134],"study_design_scores_gemma":[0.000015170175,0.000060807113,0.0002855575,0.0000069979774,0.000008373614,0.00005719047,0.000028211964,0.98339945,0.0015817023,0.011345734,0.003205621,0.0000052357477],"about_ca_topic_score_codex":0.000882157,"about_ca_topic_score_gemma":0.001305565,"teacher_disagreement_score":0.0020928183,"about_ca_system_score_codex":0.00029970464,"about_ca_system_score_gemma":0.0002511401,"threshold_uncertainty_score":0.0070011616},"labels":[],"label_agreement":null},{"id":"W2102000944","doi":"10.1504/ijhpcn.2006.010202","title":"A protocol independent energy saving technique for mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Routing protocol; Node (physics); Protocol (science); Distributed computing; Optimized Link State Routing Protocol; Wireless ad hoc network; Energy (signal processing); Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.008696791933068668,"score_gpt":0.2612928837494678,"score_spread":0.25259609181639914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102000944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021346686,0.008394222,0.9290433,0.00062402186,0.0013782273,0.00035254212,0.00011819531,0.0022384997,0.036504313],"genre_scores_gemma":[0.5114439,0.007930468,0.42465207,0.0013510677,0.00084137154,0.0005203644,0.0004605203,0.0004182234,0.05238201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996025,0.00006186084,0.000020337535,0.000066389905,0.00021109213,0.00003791599],"domain_scores_gemma":[0.99961424,0.00011700187,0.000039940216,0.00014294073,0.000067716195,0.000018137987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036498773,0.00071227696,0.00042393708,0.00073380955,0.000633209,0.00061783654,0.0016942611,0.00048242533,0.003480575],"category_scores_gemma":[0.0010430019,0.00024003998,0.0006088402,0.0007141907,0.0005033771,0.0020535374,0.0013774289,0.0011625251,0.0014834667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027559567,0.0002653453,0.00072704366,0.00087163405,0.00016741791,0.00044389785,0.00028506975,0.023932751,0.121179655,0.066437975,0.010109521,0.7753041],"study_design_scores_gemma":[0.00016185675,0.002248092,0.0023087682,0.000356305,0.00046572305,0.005529797,0.00043083786,0.2586287,0.212877,0.06308198,0.45373926,0.00017163895],"about_ca_topic_score_codex":0.0001548924,"about_ca_topic_score_gemma":0.0003341674,"teacher_disagreement_score":0.003480575,"about_ca_system_score_codex":0.00021936675,"about_ca_system_score_gemma":0.0003213664,"threshold_uncertainty_score":0.011643708},"labels":[],"label_agreement":null},{"id":"W2102044567","doi":"10.1109/glocom.2010.5684193","title":"Throughput Improvement in Multi-Radio Multi-Channel 802.11a-Based Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Computer network; Throughput; Mesh networking; Computer science; Switched mesh; Order One Network Protocol; Shared mesh; Channel (broadcasting); Network topology; Interference (communication); Wireless network; Wireless; Telecommunications","score_opus":0.019107691211814364,"score_gpt":0.2522546378987625,"score_spread":0.23314694668694816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102044567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2600941,0.00480446,0.721538,0.000582093,0.0002926822,0.00006570329,0.00013242806,0.0029048142,0.009585718],"genre_scores_gemma":[0.9508636,0.00067868264,0.047078226,0.00005269065,0.00009196768,0.000038230053,0.000078727164,0.000059171107,0.0010586673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990404,0.00034260802,0.000042773085,0.000121049074,0.00028296892,0.00017017471],"domain_scores_gemma":[0.99792516,0.0012925408,0.00019132596,0.00022088306,0.0003011137,0.00006904966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012585686,0.00053558196,0.0005131412,0.0008764313,0.0006245947,0.0007967193,0.0008072082,0.00046751805,0.0009354955],"category_scores_gemma":[0.004352855,0.00020811851,0.00021943117,0.0009115044,0.00047743067,0.0011432791,0.00067396887,0.00052049,0.00025058782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008751688,0.000264018,0.005237644,0.00024505105,0.00009515957,0.00027121473,0.00022403218,0.57933825,0.053796,0.020115243,0.0048047304,0.33473355],"study_design_scores_gemma":[0.000022223041,0.00021449984,0.0010932989,0.000008470657,0.00003412708,0.00011098991,0.000027317968,0.9771288,0.013864871,0.0053491932,0.0021342717,0.00001188976],"about_ca_topic_score_codex":0.00085778587,"about_ca_topic_score_gemma":0.0011013326,"teacher_disagreement_score":0.0012585686,"about_ca_system_score_codex":0.0007141587,"about_ca_system_score_gemma":0.00042202522,"threshold_uncertainty_score":0.006655991},"labels":[],"label_agreement":null},{"id":"W2102100536","doi":"10.1109/iwqos.2010.5542757","title":"Path diversified retransmission for TCP over wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Retransmission; Network packet; Wireless mesh network; TCP global synchronization; TCP acceleration; Zeta-TCP; Throughput; TCP Friendly Rate Control; Distributed computing; Transmission Control Protocol; Wireless network; Wireless; Telecommunications","score_opus":0.010247155954430872,"score_gpt":0.2281034443687682,"score_spread":0.21785628841433732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102100536","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16698398,0.004717445,0.8231491,0.00060652633,0.0002668397,0.00014915326,0.000048823986,0.0011953634,0.0028827314],"genre_scores_gemma":[0.9431516,0.0008578573,0.055032745,0.00006930323,0.00010312628,0.00008930447,0.000037846465,0.00005165481,0.00060651905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992889,0.0003627915,0.000044376375,0.000053035597,0.00019947263,0.00005141886],"domain_scores_gemma":[0.9979843,0.0011551073,0.000230678,0.00031895313,0.0002738118,0.000037136422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002289601,0.0004366631,0.00034366036,0.0006727531,0.00057783007,0.00064372516,0.0006786198,0.0004036993,0.00060513546],"category_scores_gemma":[0.00522125,0.00018866699,0.0003490517,0.00033736601,0.00048098376,0.00093148515,0.00052591384,0.0006038619,0.00010568906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060698565,0.00011936639,0.005230927,0.00042277068,0.00018253959,0.0005974328,0.00032931176,0.6379537,0.05913708,0.032352462,0.002449945,0.26061746],"study_design_scores_gemma":[0.000028730754,0.0002093262,0.0005573037,0.000018660296,0.00005230999,0.00021526849,0.000027721288,0.9836594,0.0070387875,0.006252229,0.0019170796,0.000023204893],"about_ca_topic_score_codex":0.0008737751,"about_ca_topic_score_gemma":0.0012789426,"teacher_disagreement_score":0.002289601,"about_ca_system_score_codex":0.0007276127,"about_ca_system_score_gemma":0.0006906593,"threshold_uncertainty_score":0.012108743},"labels":[],"label_agreement":null},{"id":"W2102124375","doi":"10.1109/vetecf.2000.883229","title":"Distributed antenna system for mass transit communications","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Transit (satellite); Telecommunications; Antenna (radio); Engineering; Public transport; Transport engineering","score_opus":0.03332032735582058,"score_gpt":0.23712459991742743,"score_spread":0.20380427256160685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102124375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016292028,0.009892785,0.8742934,0.0014565358,0.0019326045,0.00044598858,0.0006211939,0.0122592915,0.08280621],"genre_scores_gemma":[0.48505628,0.007299258,0.28328928,0.0013539508,0.0014357199,0.0009034641,0.003104444,0.0005189927,0.21703865],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99962413,0.00009773499,0.000019243014,0.00007019897,0.00015016597,0.000038534377],"domain_scores_gemma":[0.9995258,0.000053838714,0.000027443186,0.00012311409,0.00022103066,0.000048822094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038701284,0.0004722945,0.0004373071,0.0005936001,0.0004898737,0.0008844703,0.0006843503,0.0009270903,0.015262619],"category_scores_gemma":[0.00067800045,0.00010871638,0.00017401457,0.00080768636,0.00024012718,0.0007141853,0.0006862362,0.0008598832,0.010340672],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005803568,0.00016163457,0.0016508853,0.00048468573,0.00007742283,0.00038602846,0.00029989445,0.0094400775,0.079103194,0.047803007,0.13192499,0.7280879],"study_design_scores_gemma":[0.00017443196,0.0009208645,0.0026021297,0.00008780103,0.000102972095,0.0013604746,0.0001172349,0.058978796,0.020580303,0.00901117,0.9060008,0.000063056665],"about_ca_topic_score_codex":0.0007223881,"about_ca_topic_score_gemma":0.0010544222,"teacher_disagreement_score":0.015262619,"about_ca_system_score_codex":0.0006131039,"about_ca_system_score_gemma":0.00043860968,"threshold_uncertainty_score":0.05105859},"labels":[],"label_agreement":null},{"id":"W2102291898","doi":"10.1109/icc.2009.5199059","title":"Hybrid Resource Allocation in Wireless Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Packet loss; Network packet; Network congestion; Overhead (engineering); Distributed computing; Real-time computing","score_opus":0.008432846467176505,"score_gpt":0.21952304769532624,"score_spread":0.21109020122814973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102291898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04729732,0.0018563954,0.9459833,0.00018157966,0.00008789088,0.00007369186,0.000021439644,0.00034182114,0.004156499],"genre_scores_gemma":[0.8705606,0.00079510617,0.12554942,0.00009325101,0.000055041237,0.00015826234,0.000036105805,0.00003606795,0.002716145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931765,0.00036613873,0.000029098217,0.000070055146,0.00015421845,0.000062819854],"domain_scores_gemma":[0.99938035,0.00041321182,0.0000498751,0.00006124793,0.000071275914,0.000024006542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001358828,0.0004295785,0.0004936142,0.00045611756,0.00037059517,0.001000107,0.00080078305,0.0005283847,0.0006425453],"category_scores_gemma":[0.0016775844,0.00032948487,0.00020500318,0.00056515983,0.0007487961,0.0012061899,0.00071773457,0.00037820105,0.0001468967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009734323,0.00004969502,0.00060500985,0.0000637728,0.000054960707,0.000105399384,0.000066346875,0.899672,0.0035697303,0.032096922,0.0007725415,0.06284625],"study_design_scores_gemma":[0.000013075813,0.000038418504,0.00008001424,0.000004407705,0.000009686789,0.00004113167,0.000017413537,0.98739517,0.0007294122,0.010721373,0.00094341335,0.000006589331],"about_ca_topic_score_codex":0.0013744627,"about_ca_topic_score_gemma":0.0012827824,"teacher_disagreement_score":0.0013744627,"about_ca_system_score_codex":0.000548748,"about_ca_system_score_gemma":0.00049586076,"threshold_uncertainty_score":0.007186234},"labels":[],"label_agreement":null},{"id":"W2102493054","doi":"10.1109/icumt.2009.5345568","title":"Bandwidth efficient multicast routing in multi-channel multi-radio wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Multicast; Distributed computing; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Steiner tree problem; Source-specific multicast; Xcast; Wireless network; Wireless; Mathematics; Telecommunications; Mathematical optimization","score_opus":0.021625554219118905,"score_gpt":0.2546204330527073,"score_spread":0.2329948788335884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102493054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056521352,0.0020758603,0.93685657,0.00031747684,0.000086236,0.00006471455,0.00007610663,0.0006449912,0.0033566745],"genre_scores_gemma":[0.69716734,0.0012362854,0.29873618,0.000102885286,0.0001204559,0.00014205591,0.00020839307,0.00007849832,0.0022079665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994978,0.00021425226,0.000021044163,0.00004187726,0.0001565304,0.00006848939],"domain_scores_gemma":[0.9995815,0.00021912923,0.00005671323,0.000053041313,0.00007324435,0.000016371727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006529929,0.00028292876,0.0003941803,0.00080556294,0.0006690756,0.00047527702,0.00074101315,0.00066341466,0.00085096736],"category_scores_gemma":[0.0013257951,0.0002160796,0.00026340253,0.0006570588,0.0002610905,0.0010836449,0.0006425768,0.00032038012,0.00019903903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037256538,0.00013342581,0.0013904563,0.0004171647,0.00009180583,0.00038596205,0.00023583646,0.5541812,0.040436752,0.041494813,0.0062128054,0.35464728],"study_design_scores_gemma":[0.000028694627,0.000112200636,0.00044053007,0.000028865124,0.000026272348,0.00020557008,0.000060370374,0.9642618,0.0074004456,0.021320567,0.0060979165,0.000016725271],"about_ca_topic_score_codex":0.00075190293,"about_ca_topic_score_gemma":0.0009378216,"teacher_disagreement_score":0.00085096736,"about_ca_system_score_codex":0.00046525762,"about_ca_system_score_gemma":0.0002530806,"threshold_uncertainty_score":0.0034534335},"labels":[],"label_agreement":null},{"id":"W2102798756","doi":"10.1109/glocom.2010.5683541","title":"Probabilistic Analysis of Resequencing Queue Length in Multipath Packet Data Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Computer science; Network packet; Queue; Multipath propagation; Algorithm; Computer network; Real-time computing; Channel (broadcasting)","score_opus":0.034201012273016494,"score_gpt":0.28597929146462936,"score_spread":0.2517782791916129,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102798756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18614957,0.0011614105,0.80925846,0.00036266987,0.00004464003,0.000058377085,0.00014915771,0.00034844375,0.0024673312],"genre_scores_gemma":[0.9796198,0.0006753892,0.018113395,0.00005174313,0.00005090057,0.00006449216,0.00011129738,0.000045028628,0.0012679494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864954,0.000341364,0.00005418291,0.00024174587,0.0004660267,0.000247173],"domain_scores_gemma":[0.98939484,0.0073434333,0.0013245556,0.00039590563,0.0013192513,0.00022206843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032443933,0.00063155306,0.00069281866,0.0017877342,0.0006168119,0.0010257697,0.0017299165,0.0008713673,0.0010062439],"category_scores_gemma":[0.016407466,0.00060027174,0.00059894414,0.0013229072,0.0012478866,0.0025232704,0.0008846392,0.0010078441,0.00018316598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009308806,0.000033751836,0.0034176463,0.000069920825,0.000033523243,0.00018046539,0.00016279606,0.9313781,0.003932674,0.05097235,0.0004204566,0.009305244],"study_design_scores_gemma":[0.0000030491994,0.00002103396,0.000639561,0.000005197439,0.000008142869,0.00004426984,0.00002242314,0.9913919,0.0004162038,0.0072877966,0.00014602313,0.000014464329],"about_ca_topic_score_codex":0.005228747,"about_ca_topic_score_gemma":0.0030671603,"teacher_disagreement_score":0.005228747,"about_ca_system_score_codex":0.0026961558,"about_ca_system_score_gemma":0.0012226414,"threshold_uncertainty_score":0.019562066},"labels":[],"label_agreement":null},{"id":"W2102850521","doi":"10.1002/wcm.794","title":"Link layer solutions for supporting real‐time traffic over CDMA wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Quality of service; Wireless mesh network; Node (physics); Access control; Queueing theory; Wireless; Wireless network; Queue; Distributed computing; Telecommunications","score_opus":0.023206067501355784,"score_gpt":0.28617352639100074,"score_spread":0.26296745888964496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102850521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14187124,0.0037432865,0.8418409,0.00095579453,0.00042568962,0.00019685517,0.00010924712,0.0018013552,0.0090555195],"genre_scores_gemma":[0.87815213,0.00081157906,0.11710507,0.00024340664,0.00015872187,0.00013843176,0.0001536866,0.000041085525,0.0031958784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996458,0.00009762709,0.000029761779,0.00003659892,0.00010789291,0.00008227442],"domain_scores_gemma":[0.99914896,0.0002993925,0.000106747415,0.00012415269,0.00027926418,0.000041473973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009557337,0.00032782299,0.00024714874,0.0006495756,0.000583442,0.0010236825,0.0011457147,0.0005918113,0.002994117],"category_scores_gemma":[0.0022725717,0.00013881484,0.00021861235,0.00041628352,0.00024237744,0.00085780385,0.0007677762,0.0004934556,0.00048182992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094489584,0.00039032192,0.0036644265,0.00088048785,0.00022668699,0.00052841334,0.0004331341,0.16846131,0.11799193,0.07289409,0.011127613,0.62245667],"study_design_scores_gemma":[0.0001432014,0.00025516574,0.0007358476,0.000049346087,0.000098899596,0.00023506413,0.00015058054,0.9389363,0.023271998,0.018619956,0.017466176,0.00003746577],"about_ca_topic_score_codex":0.0013103219,"about_ca_topic_score_gemma":0.0016973233,"teacher_disagreement_score":0.002994117,"about_ca_system_score_codex":0.00066596695,"about_ca_system_score_gemma":0.0005186771,"threshold_uncertainty_score":0.010016322},"labels":[],"label_agreement":null},{"id":"W2103133146","doi":"10.1109/lcn.2003.1243206","title":"New metrics for dominating set based energy efficient activity scheduling in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología; National Science Foundation","keywords":"Computer network; Computer science; Flooding (psychology); Wireless ad hoc network; Geographic routing; Scheduling (production processes); Distributed computing; Routing protocol; Mobile ad hoc network; Connected dominating set; Routing (electronic design automation); Dynamic Source Routing; Wireless; Theoretical computer science; Graph; Mathematics; Telecommunications; Network packet","score_opus":0.017669442329313983,"score_gpt":0.2546412475176116,"score_spread":0.2369718051882976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103133146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025909048,0.0060739564,0.96383446,0.00033110642,0.0003557571,0.00025862065,0.00031376537,0.00027456429,0.0026486975],"genre_scores_gemma":[0.46004856,0.003645026,0.53265274,0.00015907834,0.0004893882,0.0007006152,0.00084358937,0.00018759361,0.0012734316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99505424,0.0020907552,0.00064775493,0.0004242955,0.001608985,0.00017396885],"domain_scores_gemma":[0.9889149,0.0062101237,0.0017499594,0.00061801577,0.0019342162,0.0005729038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050356337,0.0024065548,0.0016718673,0.0047578774,0.00084064703,0.002163102,0.0019152163,0.0011952963,0.0005086314],"category_scores_gemma":[0.022780197,0.00045484825,0.000660202,0.0038767701,0.0013872272,0.005599571,0.0021845752,0.0014191484,0.00021965745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037168202,0.00019388158,0.008186942,0.0012129619,0.00032638645,0.00019207453,0.00083753176,0.4744914,0.015944187,0.22680743,0.004520418,0.26691505],"study_design_scores_gemma":[0.000043708573,0.0007022642,0.0032217726,0.00018506854,0.000118725,0.00042713535,0.00027727737,0.8603698,0.005628348,0.114756875,0.01412869,0.00014032931],"about_ca_topic_score_codex":0.00049063005,"about_ca_topic_score_gemma":0.0007341918,"teacher_disagreement_score":0.0050356337,"about_ca_system_score_codex":0.0019224462,"about_ca_system_score_gemma":0.00074918545,"threshold_uncertainty_score":0.026631296},"labels":[],"label_agreement":null},{"id":"W2103220413","doi":"10.1007/978-3-540-85209-4_4","title":"Adaptive MANET Routing: A Case Study","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mobile ad hoc network; Routing (electronic design automation); Computer network","score_opus":0.026035516037074928,"score_gpt":0.25007033558363057,"score_spread":0.22403481954655563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103220413","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8822823,0.0019072776,0.05661765,0.0026388883,0.00027933842,0.00055669225,0.0008855744,0.00043567285,0.0543965],"genre_scores_gemma":[0.95701504,0.0016353969,0.027556252,0.00023020712,0.00009402819,0.00011002669,0.00027374976,0.000073524665,0.013011734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00044881186,0.000041573618,0.00009803003,0.00018850139,0.00015015676],"domain_scores_gemma":[0.9965288,0.0025760808,0.00018845186,0.00026510356,0.00023372206,0.00020792727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001063788,0.00054983416,0.00032997967,0.00075654744,0.001029287,0.0013342726,0.0016710423,0.0030592692,0.0028378572],"category_scores_gemma":[0.0037862773,0.00024470224,0.00046022318,0.0014724887,0.0008141858,0.0009825059,0.00068651576,0.0006832464,0.00055528356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025949785,0.0063457796,0.05387539,0.0026148886,0.00040435675,0.1980141,0.00638618,0.2870844,0.01827007,0.06538729,0.039143212,0.3198793],"study_design_scores_gemma":[0.000952123,0.0047771176,0.02842764,0.00049450406,0.0004922615,0.15105917,0.021345703,0.6022564,0.027368769,0.040195417,0.122371815,0.0002591442],"about_ca_topic_score_codex":0.003370485,"about_ca_topic_score_gemma":0.0060515734,"teacher_disagreement_score":0.003370485,"about_ca_system_score_codex":0.00055603083,"about_ca_system_score_gemma":0.0003485091,"threshold_uncertainty_score":0.009493589},"labels":[],"label_agreement":null},{"id":"W2103318294","doi":"10.1109/glocom.2010.5683096","title":"Symmetrical Power Control for Multi-Channel Multi-Hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Channel (broadcasting); Power control; Computer science; Network packet; Hop (telecommunications); Transmission (telecommunications); Control channel; Power (physics); Wireless; Transmitter power output; Wireless network; Telecommunications; Base station; Transmitter","score_opus":0.019762299759032032,"score_gpt":0.2623003664949943,"score_spread":0.24253806673596223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103318294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067097247,0.0008146801,0.9903092,0.00008833083,0.00008152447,0.000033332097,0.0000068901863,0.00013024182,0.0018261584],"genre_scores_gemma":[0.8068268,0.0017801706,0.18678917,0.00020503152,0.0002709647,0.00016033686,0.00004335046,0.000052251555,0.0038719038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.00031164504,0.000041563966,0.00009340484,0.00031647124,0.000046223668],"domain_scores_gemma":[0.9990569,0.000481436,0.00010111688,0.00015168964,0.00017223803,0.00003665138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016583,0.00044037093,0.00033704838,0.0003156165,0.00039141256,0.00063334935,0.0009951219,0.00044196798,0.0010816215],"category_scores_gemma":[0.0023324946,0.0001836826,0.00024572064,0.00038550256,0.00087689364,0.0010126815,0.0005801213,0.0006438221,0.00026095635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002850412,0.000116897245,0.0006245356,0.00046248882,0.000067747525,0.00037801097,0.00024015903,0.40338483,0.030937303,0.19804098,0.0025083767,0.36295354],"study_design_scores_gemma":[0.000047815975,0.00022721404,0.0002328562,0.000028996436,0.000029892752,0.00023926691,0.00003363074,0.9162209,0.0059989686,0.07151314,0.005399126,0.00002820408],"about_ca_topic_score_codex":0.00049657386,"about_ca_topic_score_gemma":0.000616829,"teacher_disagreement_score":0.0010816215,"about_ca_system_score_codex":0.00042552644,"about_ca_system_score_gemma":0.0004924867,"threshold_uncertainty_score":0.0053762794},"labels":[],"label_agreement":null},{"id":"W2103461896","doi":"10.1109/pimrc.2012.6362561","title":"Performance enhancement of multipath TCP with cooperative relays in a collaborative community","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Multipath TCP; Goodput; Computer network; Computer science; Multipath propagation; Throughput; Node (physics); Transmission (telecommunications); Network packet; Channel (broadcasting); Wireless; Telecommunications; Engineering","score_opus":0.01509428658629917,"score_gpt":0.24377248439728808,"score_spread":0.22867819781098891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103461896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87703174,0.0013471082,0.116132505,0.00025623955,0.000089191395,0.00009033799,0.000044903714,0.0011357048,0.0038723764],"genre_scores_gemma":[0.99535584,0.0000691543,0.004336845,0.000009881802,0.000011125973,0.000012573952,0.000010662554,0.000007571771,0.00018634144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819523,0.0006656328,0.00007527811,0.00025047327,0.00043910654,0.00037430457],"domain_scores_gemma":[0.98892736,0.0063809855,0.0008195676,0.00096286944,0.0022287061,0.00068056665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033625353,0.0009002687,0.0011250837,0.0009868287,0.0011175111,0.0010837313,0.0010969683,0.0013566905,0.00062428345],"category_scores_gemma":[0.010408412,0.00035405828,0.00044255308,0.00073278195,0.0008250201,0.0013917469,0.0023457855,0.00083973753,0.00015403666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036583007,0.00063271617,0.011391042,0.0002837452,0.0003248142,0.0012905587,0.00071329833,0.8187531,0.06655297,0.0066995304,0.0016347847,0.08806513],"study_design_scores_gemma":[0.000050764666,0.0006986049,0.00092515565,0.000009810098,0.00007430323,0.00026100414,0.00007384448,0.98788655,0.008743424,0.000901765,0.00034081412,0.000033828008],"about_ca_topic_score_codex":0.0034767913,"about_ca_topic_score_gemma":0.0020285954,"teacher_disagreement_score":0.0034767913,"about_ca_system_score_codex":0.0010001651,"about_ca_system_score_gemma":0.0009867159,"threshold_uncertainty_score":0.017782986},"labels":[],"label_agreement":null},{"id":"W2103701370","doi":"10.1109/ccece.2006.277765","title":"Determining Density in Ad hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Atlantic Canada Opportunities Agency","keywords":"Wireless ad hoc network; Computer science; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Metric (unit); Computer network; Vehicular ad hoc network; Geocast; Post hoc; Routing (electronic design automation); Routing protocol; Telecommunications; Engineering; Medicine","score_opus":0.008337587830524512,"score_gpt":0.2115890886168326,"score_spread":0.20325150078630808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103701370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029879203,0.0061147916,0.95199245,0.0004464914,0.0002598169,0.000252239,0.00011138847,0.00060969853,0.010333818],"genre_scores_gemma":[0.64751476,0.00934465,0.33922496,0.00019504844,0.00036871881,0.00034906736,0.0003255888,0.000099365374,0.002577799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977209,0.00079580967,0.00010330383,0.00021931683,0.0010514029,0.0001092447],"domain_scores_gemma":[0.9950918,0.0032040277,0.00034882544,0.00031812274,0.0009167847,0.000120410914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011790089,0.00074612926,0.0006383373,0.002891006,0.0010746041,0.0014018373,0.0011066124,0.00095134426,0.00068921736],"category_scores_gemma":[0.012952293,0.0005098457,0.00037148123,0.0020724859,0.0010798789,0.0028830431,0.0014233706,0.0007792049,0.0006423756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007858771,0.000087605826,0.012554354,0.0005195497,0.00007930976,0.00045454872,0.00062545715,0.4440279,0.008849869,0.1347055,0.0058888285,0.39212856],"study_design_scores_gemma":[0.000030097604,0.00013849403,0.0035435725,0.0002067266,0.00004290807,0.0012158098,0.00058457546,0.81016403,0.010655845,0.1396699,0.03362372,0.00012425812],"about_ca_topic_score_codex":0.0033461365,"about_ca_topic_score_gemma":0.0016573818,"teacher_disagreement_score":0.0033461365,"about_ca_system_score_codex":0.00097172015,"about_ca_system_score_gemma":0.0005892689,"threshold_uncertainty_score":0.0070503354},"labels":[],"label_agreement":null},{"id":"W2103865254","doi":"10.1109/ccece.2006.277468","title":"Cross-Layer Cooperation to Handle MAC Misbehavior in Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Optimized Link State Routing Protocol; Node (physics); Ad hoc wireless distribution service; Layer (electronics); Routing (electronic design automation); Vehicular ad hoc network; Routing protocol; Adaptive quality of service multi-hop routing; Network layer; Access control; Distributed computing; Wireless; Telecommunications; Engineering; Network packet","score_opus":0.01286771369205329,"score_gpt":0.26659854706530034,"score_spread":0.25373083337324703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103865254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06397519,0.0011161466,0.9305199,0.00030583979,0.000072708885,0.00012772458,0.000013580342,0.0011851896,0.002683761],"genre_scores_gemma":[0.8372254,0.00051065715,0.15981728,0.00015470997,0.00007965063,0.00009513188,0.000046072448,0.000057990794,0.0020131238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850214,0.00068012124,0.00011797811,0.00011628314,0.00043238432,0.00015104258],"domain_scores_gemma":[0.9948507,0.0019152331,0.00057289994,0.0012997162,0.0011896591,0.00017183379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032573799,0.0006207908,0.00052834215,0.0007984172,0.000648474,0.0007527163,0.0011933299,0.00068052683,0.0005630479],"category_scores_gemma":[0.0060451776,0.00032349784,0.00038219188,0.00046972925,0.00068012124,0.0016235001,0.0014153159,0.0008571388,0.00026386752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073837035,0.00034900152,0.0069156806,0.0004648094,0.0003383663,0.0016740479,0.001998529,0.36701444,0.112011135,0.062341858,0.005841436,0.44031245],"study_design_scores_gemma":[0.000041495216,0.00040693424,0.00086154306,0.000031874766,0.00015006166,0.00069609314,0.00012553782,0.9488954,0.030147087,0.011859183,0.0067442507,0.00004051172],"about_ca_topic_score_codex":0.00094088604,"about_ca_topic_score_gemma":0.0010028057,"teacher_disagreement_score":0.0032573799,"about_ca_system_score_codex":0.00042768425,"about_ca_system_score_gemma":0.0006343304,"threshold_uncertainty_score":0.017226875},"labels":[],"label_agreement":null},{"id":"W2104149595","doi":"10.1109/icc.2007.790","title":"Efficient Data Access Algorithms for ITS-based Networks with Multi-Hop Wireless Links","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Bottleneck; Wireless network; Cache; Algorithm; Wireless; Callback; Data access; Distributed computing; Embedded system; Telecommunications","score_opus":0.065503795953637,"score_gpt":0.331720772309866,"score_spread":0.266216976356229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104149595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08069854,0.0012213904,0.9147545,0.00024436103,0.000058422243,0.00008387199,0.00006455538,0.0003931622,0.0024812373],"genre_scores_gemma":[0.85582346,0.0009441843,0.14102124,0.00005920233,0.00006638477,0.00011429878,0.00013092454,0.000048263628,0.0017919864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995511,0.00016426209,0.000035819314,0.00006623459,0.000102652004,0.0000799107],"domain_scores_gemma":[0.99780875,0.001315323,0.00025268368,0.00020871735,0.00032911907,0.00008543178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010301768,0.0004928572,0.00091922603,0.00064232055,0.00064147235,0.0014081569,0.0012693547,0.00060653256,0.0013463437],"category_scores_gemma":[0.0033640969,0.00024292507,0.0003163977,0.0009709067,0.00067312125,0.0020101212,0.0006478933,0.0005988354,0.00022873469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024013998,0.00008926167,0.0027253565,0.00036838974,0.00007714801,0.000083298684,0.00028591318,0.8003061,0.00760006,0.0409392,0.0016730734,0.14561214],"study_design_scores_gemma":[0.000018616678,0.00006439021,0.00017764558,0.000008854031,0.00001601531,0.000049967657,0.000055514665,0.99046344,0.0020952476,0.0060643353,0.0009785031,0.000007387428],"about_ca_topic_score_codex":0.0019177364,"about_ca_topic_score_gemma":0.0018022336,"teacher_disagreement_score":0.0019177364,"about_ca_system_score_codex":0.00088872074,"about_ca_system_score_gemma":0.0006956062,"threshold_uncertainty_score":0.0064481497},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Time division multiple access; Computer network; Scheduling (production processes); Router; Transmission delay; Wireless network; Distributed computing; Wireless; Mathematical optimization; Network packet; Mathematics","score_opus":0.054886598819135046,"score_gpt":0.27810405897408164,"score_spread":0.2232174601549466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104354412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010023803,0.0019447992,0.9834104,0.00018549812,0.00016027548,0.00011339467,0.000097106735,0.0004261321,0.003638634],"genre_scores_gemma":[0.29529405,0.0028078759,0.6968279,0.000100534475,0.0001722287,0.0002866166,0.00034474971,0.0001602376,0.004005766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996124,0.00012432427,0.000025501355,0.000054093358,0.0001530185,0.000030702184],"domain_scores_gemma":[0.9993418,0.0003925544,0.00006629863,0.000078124096,0.00009356144,0.000027688113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007439148,0.00048589284,0.0003558865,0.0005642314,0.000593354,0.0007368518,0.00086121244,0.0003597812,0.002017966],"category_scores_gemma":[0.002531227,0.0002911812,0.0003055487,0.0009226428,0.00035208295,0.0007647499,0.0004402154,0.00069787446,0.00040205382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017806282,0.00009572225,0.0006967951,0.00038949543,0.000049790742,0.00008977998,0.00012920157,0.573741,0.012670649,0.06343639,0.004293219,0.34422988],"study_design_scores_gemma":[0.000037648635,0.00009290433,0.00020516825,0.000024517318,0.000018540119,0.000056551475,0.000029171038,0.95467186,0.0041915555,0.02975512,0.010903374,0.000013501684],"about_ca_topic_score_codex":0.0025720838,"about_ca_topic_score_gemma":0.0036999984,"teacher_disagreement_score":0.0025720838,"about_ca_system_score_codex":0.001188742,"about_ca_system_score_gemma":0.0015706111,"threshold_uncertainty_score":0.008624971},"labels":[],"label_agreement":null},{"id":"W2104791563","doi":"10.1109/ccece.2011.6030633","title":"Performance evaluation for multicast transmissions in VANET","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. John’s Health Sciences Centre; Memorial University of Newfoundland","funders":"","keywords":"Computer network; Computer science; Multicast; Unicast; Geocast; Vehicular ad hoc network; Protocol Independent Multicast; Xcast; Distance Vector Multicast Routing Protocol; Source-specific multicast; Wireless ad hoc network; Pragmatic General Multicast; Mobile ad hoc network; Distributed computing; Routing protocol; Optimized Link State Routing Protocol; Network packet; Wireless; Telecommunications","score_opus":0.07029333411785237,"score_gpt":0.28436171468643423,"score_spread":0.21406838056858185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104791563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8801167,0.0050754184,0.09348509,0.0005828302,0.00035338066,0.0002268486,0.00055032055,0.0011860018,0.01842352],"genre_scores_gemma":[0.9901968,0.00048286296,0.007965443,0.000022722952,0.000025933257,0.000038123308,0.00030232212,0.000028906425,0.000936829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973571,0.001021196,0.00015743836,0.00016005819,0.0009734349,0.00033081244],"domain_scores_gemma":[0.9923414,0.0041441866,0.00043463058,0.00042447896,0.0024854282,0.00016992805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027441762,0.0006579295,0.0007488856,0.001561964,0.0006390084,0.000804071,0.00074054935,0.0006347455,0.00091686123],"category_scores_gemma":[0.008639827,0.00012084953,0.0002916085,0.0013417886,0.00023733411,0.0009491846,0.0005354913,0.000343435,0.00021043635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028936234,0.000515748,0.014105979,0.0008370079,0.00033371118,0.000661401,0.00032163714,0.75110495,0.041241832,0.00647764,0.00377591,0.17773062],"study_design_scores_gemma":[0.000042257958,0.0027200212,0.004789347,0.0000419269,0.00013240524,0.0006115573,0.0003678539,0.9536285,0.03393734,0.0012283865,0.0024519386,0.00004843582],"about_ca_topic_score_codex":0.0018994568,"about_ca_topic_score_gemma":0.0011134344,"teacher_disagreement_score":0.0027441762,"about_ca_system_score_codex":0.0009468866,"about_ca_system_score_gemma":0.00040463053,"threshold_uncertainty_score":0.014512777},"labels":[],"label_agreement":null},{"id":"W2104816749","doi":"10.1109/lcn.2001.990834","title":"Energy-efficient infrastructure formation in MANETs","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Base station; Protocol (science); Node (physics); Mobile ad hoc network; Wireless network; Wireless Application Protocol; Wireless ad hoc network; Mobile computing; Wireless; Distributed computing; Telecommunications; Engineering","score_opus":0.007715539092459519,"score_gpt":0.1902579310029893,"score_spread":0.1825423919105298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104816749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04258378,0.00258628,0.94437337,0.0004296197,0.0001695256,0.00010929656,0.00005835674,0.00045643936,0.009233352],"genre_scores_gemma":[0.81365126,0.0040251464,0.17518133,0.00012518023,0.00015795286,0.00027172136,0.00017392224,0.00007900404,0.0063345036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997414,0.000092451155,0.00001181709,0.00003269032,0.0000838418,0.000037849033],"domain_scores_gemma":[0.99971503,0.00013366083,0.000042244123,0.000049429662,0.00003624524,0.000023479683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051367,0.00041192287,0.00041538032,0.00049655203,0.0004940065,0.00065627805,0.0008918611,0.0005129466,0.000834225],"category_scores_gemma":[0.0015582459,0.00031422518,0.00023232504,0.00064006983,0.0006680427,0.0016176569,0.0011600113,0.00046927456,0.00028319916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010191982,0.000057837813,0.0006286609,0.00023447047,0.000038596878,0.00037948607,0.0001986031,0.7151042,0.012412748,0.18230392,0.0027030453,0.08583652],"study_design_scores_gemma":[0.000043606753,0.00014260995,0.00030809268,0.000025662752,0.000025628362,0.00024556898,0.00011589297,0.8986239,0.005762968,0.07625385,0.018428225,0.000024069881],"about_ca_topic_score_codex":0.0006790833,"about_ca_topic_score_gemma":0.0009030199,"teacher_disagreement_score":0.0008918611,"about_ca_system_score_codex":0.00032837258,"about_ca_system_score_gemma":0.00035865762,"threshold_uncertainty_score":0.002790749},"labels":[],"label_agreement":null},{"id":"W2104950935","doi":"10.1109/apscc.2008.198","title":"Non-deterministic Geographic Forwarding in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Geographic routing; Link-state routing protocol; Computer network; Optimized Link State Routing Protocol; Dilation (metric space); Dynamic Source Routing; Distributed computing; Wireless Routing Protocol; Wireless ad hoc network; Static routing; Equal-cost multi-path routing; Algorithm; Routing (electronic design automation); Routing protocol; Mathematics; Combinatorics; Wireless","score_opus":0.011145461619624004,"score_gpt":0.22824813454802342,"score_spread":0.2171026729283994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104950935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043220367,0.003979547,0.9481936,0.00074580975,0.00017487211,0.00008611756,0.00007089082,0.00039888162,0.0031299547],"genre_scores_gemma":[0.8070652,0.0043947925,0.18495278,0.0002182272,0.00017767584,0.00017520723,0.00017120325,0.000045878383,0.0027990348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991391,0.00038227066,0.000039594397,0.00012908565,0.00024416245,0.000065815155],"domain_scores_gemma":[0.9985423,0.0008521339,0.00020808229,0.00021988897,0.00014329424,0.000034290726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001190152,0.00044822268,0.0006394924,0.0005706648,0.00083855056,0.0008229445,0.00093319645,0.00093410694,0.00061655097],"category_scores_gemma":[0.0035301398,0.00033399032,0.00035951583,0.0011384983,0.00096915115,0.0017723208,0.0009245283,0.0003880195,0.00019920478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001051482,0.000030601477,0.0014104462,0.00029376367,0.00007384193,0.00036451992,0.00019183723,0.7924699,0.0057314336,0.09618241,0.0024508398,0.100695275],"study_design_scores_gemma":[0.000030113093,0.00010235303,0.00053010014,0.000020698853,0.000038522943,0.00024001763,0.00010584252,0.92653733,0.0018025914,0.060715932,0.00985237,0.000023980332],"about_ca_topic_score_codex":0.0026882424,"about_ca_topic_score_gemma":0.00233366,"teacher_disagreement_score":0.0026882424,"about_ca_system_score_codex":0.00075286016,"about_ca_system_score_gemma":0.0007761395,"threshold_uncertainty_score":0.006294191},"labels":[],"label_agreement":null},{"id":"W2105215219","doi":"10.1007/978-3-642-14785-2_9","title":"Towards Modeling Realistic Mobility for Performance Evaluations in MANET","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Mobile ad hoc network; TRACE (psycholinguistics); Mobility model; Credibility; Field (mathematics); Software; Distributed computing; Modeling and simulation; Vehicular ad hoc network; Interpretation (philosophy); Wireless ad hoc network; Isolation (microbiology); Simulation; Computer network; Telecommunications; Wireless","score_opus":0.03356952027849705,"score_gpt":0.2913661998675793,"score_spread":0.25779667958908226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105215219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03175756,0.0010336412,0.959144,0.00046781037,0.00015227462,0.00015872064,0.00041163267,0.0008746569,0.0059997537],"genre_scores_gemma":[0.7113886,0.0023952874,0.27808917,0.00026914582,0.00021405239,0.00044173875,0.0009935435,0.00046951056,0.005738996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989851,0.0005114088,0.000054040753,0.00008278938,0.00028753496,0.000079120626],"domain_scores_gemma":[0.99729127,0.001730238,0.00017084327,0.00025583734,0.00047569975,0.00007615668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017542179,0.0011109593,0.0011821525,0.000750491,0.00051744824,0.0015425112,0.0024208226,0.0014563646,0.0017502267],"category_scores_gemma":[0.0077291094,0.0007005258,0.00061583304,0.0010596965,0.00046872802,0.0022132231,0.00091226946,0.0013012295,0.0007143275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020937434,0.000030509227,0.00016240976,0.000037171307,0.00001163457,0.000020417085,0.000020557056,0.98816746,0.00066360505,0.004066198,0.0004700119,0.0063290945],"study_design_scores_gemma":[0.0000019955492,0.000009384863,0.000024098195,0.0000042641077,0.0000033082654,0.000007920547,0.000004526997,0.99785346,0.00017835287,0.0016173959,0.00029328789,0.0000019895408],"about_ca_topic_score_codex":0.0063618184,"about_ca_topic_score_gemma":0.004205026,"teacher_disagreement_score":0.0063618184,"about_ca_system_score_codex":0.0010843679,"about_ca_system_score_gemma":0.0008423569,"threshold_uncertainty_score":0.012649536},"labels":[],"label_agreement":null},{"id":"W2105314779","doi":"10.1155/2010/820453","title":"An Enhanced MPR-Based Solution for Flooding of Broadcast Messages in OLSR Wireless ad hoc Networks","year":2010,"lang":"en","type":"article","venue":"Mobile Information Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Science Council","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Flooding (psychology); Wireless ad hoc network; Mobile ad hoc network; Packet loss; Node (physics); Network packet; Wireless network; Distributed computing; Wireless; Routing protocol; Telecommunications","score_opus":0.008302885826203574,"score_gpt":0.24306614247841327,"score_spread":0.2347632566522097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105314779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024633462,0.0004995145,0.97210807,0.00019605363,0.00006626949,0.00014237371,0.00002988738,0.0005710105,0.0017533973],"genre_scores_gemma":[0.44497946,0.0004737495,0.54993427,0.00015391062,0.00012487714,0.00018925391,0.000096782824,0.00006185128,0.0039858096],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993581,0.0002018381,0.000047136236,0.00008158668,0.000257031,0.000054237957],"domain_scores_gemma":[0.9994561,0.00014987307,0.000094295254,0.00009261121,0.00018466655,0.000022517019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007428263,0.0005137603,0.00071100774,0.00070941076,0.00043543437,0.00049011165,0.0014356442,0.00089295115,0.0007111622],"category_scores_gemma":[0.0019382603,0.00022416616,0.00039609254,0.00042518746,0.00030920294,0.0009824496,0.0008549738,0.00056972,0.00032927727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005015099,0.00025940765,0.00094860233,0.00055899634,0.0001850507,0.000930299,0.0005005438,0.33402333,0.14232609,0.040640738,0.004092139,0.47503322],"study_design_scores_gemma":[0.0000497542,0.00037493042,0.00031995666,0.000018673256,0.000067697845,0.00053713785,0.000054675365,0.97068846,0.017059531,0.0040618884,0.006730979,0.000036295984],"about_ca_topic_score_codex":0.0006200865,"about_ca_topic_score_gemma":0.0009356211,"teacher_disagreement_score":0.0014356442,"about_ca_system_score_codex":0.00030058943,"about_ca_system_score_gemma":0.0004973865,"threshold_uncertainty_score":0.0039284825},"labels":[],"label_agreement":null},{"id":"W2105348468","doi":"10.1109/wimob.2005.1512865","title":"Multipath load balancing in multi-hop wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multipath routing; Computer network; Multipath propagation; Radio resource management; Wireless; Wireless network; Distributed computing; Load balancing (electrical power); Heuristic; Disjoint sets; Hop (telecommunications); Channel (broadcasting); Dynamic Source Routing; Routing protocol; Routing (electronic design automation); Telecommunications","score_opus":0.011118001812146932,"score_gpt":0.22912664236934868,"score_spread":0.21800864055720176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105348468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06390662,0.0030014066,0.92747355,0.00038050202,0.00012350419,0.00009928383,0.000037574155,0.00070947414,0.0042679785],"genre_scores_gemma":[0.8506825,0.002441063,0.1444654,0.00010049474,0.00022930492,0.000121050085,0.00006831878,0.00007441623,0.0018174466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949944,0.00017559635,0.000021151158,0.00005962161,0.00018059835,0.00006344733],"domain_scores_gemma":[0.99889874,0.0006781758,0.00015347726,0.00010823745,0.00010598363,0.00005537853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007340235,0.0004976274,0.0005069473,0.00079072977,0.00078658323,0.00082422845,0.00068380794,0.00062726246,0.000744419],"category_scores_gemma":[0.0031228513,0.00031702965,0.00021635996,0.0010813572,0.0008268621,0.0014344136,0.00075610925,0.0005094893,0.00019999515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010365168,0.000045486056,0.0011077932,0.000113988586,0.000037958365,0.000097580254,0.000073701216,0.8725261,0.00792405,0.020205231,0.0009680943,0.09679639],"study_design_scores_gemma":[0.000017907554,0.00009200423,0.00036904495,0.00001334448,0.00001471554,0.00009111134,0.000040237588,0.967218,0.0027798843,0.026887648,0.0024614683,0.0000147137425],"about_ca_topic_score_codex":0.0008645744,"about_ca_topic_score_gemma":0.0009595526,"teacher_disagreement_score":0.0008645744,"about_ca_system_score_codex":0.00064144575,"about_ca_system_score_gemma":0.00048080913,"threshold_uncertainty_score":0.00465405},"labels":[],"label_agreement":null},{"id":"W2105380755","doi":"10.1109/icon.2008.4772564","title":"Ants-in-Mesh routing protocol for Wireless Mesh Network","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Dynamic Source Routing; Routing protocol; Distributed computing; Order One Network Protocol; Network packet; Hazy Sighted Link State Routing Protocol; Wireless Routing Protocol; Zone Routing Protocol; Wireless network; Wireless; Telecommunications","score_opus":0.03089769801536364,"score_gpt":0.2859834508282055,"score_spread":0.25508575281284185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105380755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075331423,0.0087797465,0.9191713,0.002895318,0.002355879,0.0009963867,0.0018050151,0.0054181935,0.051045053],"genre_scores_gemma":[0.25154755,0.011667048,0.6524042,0.0019729694,0.00069976086,0.0035167567,0.008682125,0.000777465,0.06873214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994143,0.00017193312,0.00006332115,0.000075887256,0.00022583657,0.00004866665],"domain_scores_gemma":[0.9995776,0.00010419585,0.00006625966,0.00006848832,0.00015634656,0.000027101598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004119995,0.00047701373,0.00049886794,0.00062603876,0.00088698306,0.00077192596,0.0012450841,0.0008577115,0.0056388383],"category_scores_gemma":[0.001384542,0.00020201402,0.00040668008,0.0011256873,0.00038303592,0.0010659564,0.0012363207,0.0012636357,0.0031278965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045235874,0.0001449714,0.0011124549,0.0018765428,0.00019436449,0.0008466905,0.00043030526,0.046258543,0.033815403,0.1937224,0.21026725,0.5108787],"study_design_scores_gemma":[0.00013330372,0.00021265987,0.0006917894,0.00013855593,0.00010115654,0.0011605511,0.00014864752,0.13952973,0.013892765,0.08006873,0.7638131,0.00010893409],"about_ca_topic_score_codex":0.0011193638,"about_ca_topic_score_gemma":0.0017114581,"teacher_disagreement_score":0.0056388383,"about_ca_system_score_codex":0.000489022,"about_ca_system_score_gemma":0.0010831357,"threshold_uncertainty_score":0.018863797},"labels":[],"label_agreement":null},{"id":"W2106491844","doi":"10.1109/vetecf.2003.1286160","title":"A-cell: a novel multi-hop architecture for 4G and 4G+ wireless networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Cellular network; Base station; Wireless network; Radio resource management; Wireless ad hoc network; Wireless; Distributed computing; Telecommunications","score_opus":0.014436105767289402,"score_gpt":0.2302091422803503,"score_spread":0.2157730365130609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106491844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05458286,0.001947308,0.9217098,0.0005759062,0.0003555916,0.00012019227,0.0001373114,0.0010827264,0.019488329],"genre_scores_gemma":[0.73320377,0.0016813196,0.24900998,0.00042206762,0.00016017022,0.00017723649,0.00018191963,0.00006899822,0.015094504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99988234,0.000030178178,0.0000053965505,0.00001923844,0.000038048147,0.000024879117],"domain_scores_gemma":[0.99981123,0.000040455077,0.000021109243,0.00004022755,0.000050549854,0.000036498728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017911915,0.0002775823,0.00020591139,0.0002653383,0.0005678012,0.00083033816,0.00081441045,0.0007696119,0.0020820512],"category_scores_gemma":[0.0003056355,0.00013908141,0.0002107552,0.00033130232,0.0003550688,0.00077454466,0.0005888038,0.0005658347,0.00072066253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030138518,0.0002036561,0.0017127857,0.00024342061,0.00008632673,0.000677924,0.00025521565,0.21145737,0.09935183,0.4058462,0.01569319,0.26417083],"study_design_scores_gemma":[0.00002893006,0.00027962044,0.00047034115,0.000032329324,0.000042308708,0.0005836004,0.00008730509,0.8671868,0.011867061,0.052979935,0.06639008,0.000051666157],"about_ca_topic_score_codex":0.002012646,"about_ca_topic_score_gemma":0.003405628,"teacher_disagreement_score":0.0020820512,"about_ca_system_score_codex":0.0004315869,"about_ca_system_score_gemma":0.0005180261,"threshold_uncertainty_score":0.0069651604},"labels":[],"label_agreement":null},{"id":"W2106527934","doi":"10.1109/wcnc.2011.5779286","title":"Algorithms for bandwidth efficient multicast routing in multi-channel multi-radio wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Multicast; Protocol Independent Multicast; Distributed computing; Wireless mesh network; Distance Vector Multicast Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Source-specific multicast; Xcast; Steiner tree problem; Static routing; Routing (electronic design automation); Routing protocol; Wireless network; Wireless; Mathematics; Telecommunications; Mathematical optimization","score_opus":0.055608357159932974,"score_gpt":0.269557273132837,"score_spread":0.21394891597290402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106527934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044350126,0.0008750218,0.9928536,0.00012891337,0.000056697303,0.000090041365,0.00004292625,0.00042203048,0.0010956591],"genre_scores_gemma":[0.11195174,0.0013155167,0.88434374,0.00008624452,0.00010829645,0.000428253,0.0002730998,0.00010374165,0.0013893093],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920064,0.00026351347,0.000057551882,0.00007826107,0.00031780943,0.000082271035],"domain_scores_gemma":[0.99878377,0.0006941443,0.00013630574,0.00015474184,0.00020200627,0.000028967026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013845547,0.0007768354,0.0008241962,0.0014624407,0.0010517782,0.0011146872,0.002011632,0.0014751008,0.0021048856],"category_scores_gemma":[0.004024859,0.0004729313,0.00065010827,0.0015203578,0.0005488738,0.0021740661,0.0012829944,0.0010343938,0.0006797758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021359345,0.00012631589,0.0006059371,0.0004751532,0.00011042187,0.00013484525,0.0002318661,0.4447935,0.006802846,0.07429591,0.0071739876,0.46503565],"study_design_scores_gemma":[0.00006987528,0.00009525848,0.0002156306,0.00005993547,0.000036957514,0.00018418007,0.00006221287,0.93217754,0.0031819958,0.054808363,0.009080665,0.000027336946],"about_ca_topic_score_codex":0.00087323954,"about_ca_topic_score_gemma":0.0011292234,"teacher_disagreement_score":0.0021048856,"about_ca_system_score_codex":0.0008188082,"about_ca_system_score_gemma":0.0006053033,"threshold_uncertainty_score":0.0073223114},"labels":[],"label_agreement":null},{"id":"W2106544745","doi":"10.1109/tnet.2009.2038998","title":"A Distributed Algorithm for Min-Max Tree and Max-Min Cut Problems in Communication Networks","year":2010,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Tree (set theory); Algorithm; Node (physics); Theoretical computer science; Combinatorics; Mathematics; Computer network","score_opus":0.016209824052714223,"score_gpt":0.24367288810799226,"score_spread":0.22746306405527802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106544745","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024978477,0.00034755215,0.99421847,0.00031488892,0.00007626513,0.000079040736,0.000047184825,0.00032046475,0.0020983217],"genre_scores_gemma":[0.106229946,0.00054074044,0.8874887,0.00029962437,0.0001611577,0.00049022783,0.0002676553,0.00018631613,0.004335631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985833,0.0004856508,0.00006656681,0.00037546904,0.00033333723,0.00015567176],"domain_scores_gemma":[0.9980882,0.0012875921,0.00012267915,0.00022011831,0.00017761343,0.00010372417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023191376,0.0014285906,0.001665962,0.000989322,0.0011236169,0.001895054,0.0031704744,0.0021321469,0.005532913],"category_scores_gemma":[0.00599315,0.0007132949,0.0010780904,0.0019253313,0.0011736065,0.0035701816,0.002773634,0.0022460588,0.0010187096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031768187,0.00023373724,0.0005228438,0.00035741428,0.00011093803,0.00013126485,0.000268092,0.5679957,0.0023811953,0.15179586,0.014358139,0.26152703],"study_design_scores_gemma":[0.000095034455,0.00008008553,0.00006964078,0.000019667621,0.000020220039,0.00007472484,0.000047896196,0.89294857,0.0007487929,0.10058579,0.0052956706,0.000013987617],"about_ca_topic_score_codex":0.0020094498,"about_ca_topic_score_gemma":0.0025884532,"teacher_disagreement_score":0.005532913,"about_ca_system_score_codex":0.0016074711,"about_ca_system_score_gemma":0.0020483823,"threshold_uncertainty_score":0.018509448},"labels":[],"label_agreement":null},{"id":"W2106586465","doi":"10.1145/1993806.1993855","title":"Conflict on a communication channel","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Channel (broadcasting); Alice (programming language); Alice and Bob; Computer science; Block (permutation group theory); Order (exchange); Telecommunications; Computer network; Transmission (telecommunications); Blocking (statistics); Computer security; Business; Mathematics","score_opus":0.06042069640562346,"score_gpt":0.24824092633297312,"score_spread":0.18782022992734965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106586465","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10535254,0.0016118836,0.2849187,0.030729437,0.0011932531,0.00044195144,0.00047744167,0.00032958685,0.57494515],"genre_scores_gemma":[0.9301988,0.0008192609,0.028168228,0.0024842664,0.00048591476,0.00034616125,0.00023975212,0.00009408081,0.037163604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385566,0.0029526588,0.00024089651,0.00063913484,0.001240433,0.0010712543],"domain_scores_gemma":[0.9826764,0.010779338,0.0012466309,0.0019859306,0.0016086975,0.0017029629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003882062,0.0007881007,0.00064744294,0.000908885,0.0037954599,0.005859586,0.0013257723,0.003440183,0.033342723],"category_scores_gemma":[0.019724926,0.0005870966,0.0006195974,0.0010786164,0.003616288,0.009721697,0.004725648,0.003831018,0.0030038615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033729643,0.0000880645,0.0015539447,0.00013602598,0.000051530318,0.000985766,0.0013346134,0.004620476,0.0016708575,0.9618442,0.01087408,0.016503248],"study_design_scores_gemma":[0.00013978689,0.0001687305,0.0007823127,0.00013337705,0.00005629005,0.0014706182,0.002283052,0.036483645,0.001794391,0.8765613,0.080044374,0.00008210597],"about_ca_topic_score_codex":0.0015611923,"about_ca_topic_score_gemma":0.00079286017,"teacher_disagreement_score":0.033342723,"about_ca_system_score_codex":0.0016758123,"about_ca_system_score_gemma":0.0013651457,"threshold_uncertainty_score":0.11154252},"labels":[],"label_agreement":null},{"id":"W2107151610","doi":"10.1109/wimob.2008.124","title":"Adaptive Data-Gathering Protocols with Mobile Collectors for Vehicular Ad Hoc and Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Protocol (science); Mobile ad hoc network; Quality of service; Wireless ad hoc network; Data collection; Real-time computing; Mobile computing; Wireless; Distributed computing; Network packet; Telecommunications","score_opus":0.039557568612536675,"score_gpt":0.263312270351623,"score_spread":0.22375470173908635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107151610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0256894,0.004037407,0.9663939,0.0003349421,0.00021284529,0.0003680612,0.00002892655,0.00042186037,0.0025127507],"genre_scores_gemma":[0.5845001,0.0048314445,0.40390942,0.00024639658,0.00026977676,0.00090194034,0.00020064863,0.00007059189,0.0050697825],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925524,0.0003009692,0.0000714277,0.000081752354,0.00024086444,0.00004967315],"domain_scores_gemma":[0.99882454,0.00057108875,0.00015817273,0.00017143131,0.0002142311,0.000060602444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015875824,0.00055395457,0.00055392,0.00088813616,0.0010538674,0.00092541665,0.0012539482,0.0007243918,0.00079400255],"category_scores_gemma":[0.003053057,0.00036464966,0.0006171745,0.0011787686,0.0009047717,0.0016224463,0.0012891215,0.0010057723,0.0002458575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078309665,0.00022411202,0.004090433,0.0012838057,0.00035900366,0.0012331959,0.0018497109,0.2971541,0.080201894,0.21232496,0.0063569783,0.39413866],"study_design_scores_gemma":[0.00019270617,0.0010149891,0.0012278112,0.00017049813,0.00036550357,0.001225155,0.00040664567,0.83313966,0.033789083,0.050519157,0.07778795,0.0001609328],"about_ca_topic_score_codex":0.0010741799,"about_ca_topic_score_gemma":0.0015176487,"teacher_disagreement_score":0.0015875824,"about_ca_system_score_codex":0.00069191435,"about_ca_system_score_gemma":0.0008793515,"threshold_uncertainty_score":0.0083960295},"labels":[],"label_agreement":null},{"id":"W2107318399","doi":"10.1109/mcom.2005.1404604","title":"Performance evaluation of multihop ad hoc WLANs","year":2005,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University","keywords":"Computer science; Computer network; Wireless ad hoc network; IEEE 802.11; Mobile ad hoc network; Network packet; Vehicular ad hoc network; Wireless; Distributed computing; Ad hoc wireless distribution service; Wireless network; Optimized Link State Routing Protocol; Routing protocol; Telecommunications","score_opus":0.0520252587074194,"score_gpt":0.312079657355434,"score_spread":0.2600543986480146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107318399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9057,0.0019289957,0.07988727,0.00024614803,0.0001343533,0.000093839255,0.00020143791,0.0006603749,0.01114759],"genre_scores_gemma":[0.9955988,0.00028760397,0.0032560534,0.00001556937,0.000023675024,0.00001668315,0.00008186868,0.000016941802,0.0007028231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985648,0.00048617212,0.00008033538,0.00012668119,0.00057423377,0.00016781282],"domain_scores_gemma":[0.99584806,0.0025465528,0.00032182373,0.00030500186,0.00079182413,0.00018664954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019256686,0.0005827375,0.000462347,0.0012511791,0.0002955604,0.00085128366,0.0006179276,0.0005512964,0.0010228452],"category_scores_gemma":[0.007093862,0.00012952939,0.00019361632,0.0008039767,0.00028526,0.0007805571,0.0005087752,0.00029573205,0.0002521771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016246019,0.0004906523,0.021329114,0.00036355312,0.00018522296,0.0004468987,0.0002039107,0.81183684,0.030682907,0.0055198707,0.0013099718,0.12600638],"study_design_scores_gemma":[0.000052447078,0.0024980938,0.0063666776,0.000026517968,0.00007499325,0.0003757006,0.00017784088,0.96735805,0.020355325,0.0013896953,0.0012932173,0.00003141875],"about_ca_topic_score_codex":0.00081861083,"about_ca_topic_score_gemma":0.00047991352,"teacher_disagreement_score":0.0019256686,"about_ca_system_score_codex":0.00067201554,"about_ca_system_score_gemma":0.00024835864,"threshold_uncertainty_score":0.01018399},"labels":[],"label_agreement":null},{"id":"W2107365122","doi":"10.1007/978-3-642-29280-4_36","title":"Performance Analysis of AODV and DSR Routing Protocols for Ad-Hoc Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Dynamic Source Routing; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Routing protocol; Distance-vector routing protocol; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Network packet","score_opus":0.019711026975257197,"score_gpt":0.26430836267073027,"score_spread":0.24459733569547307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107365122","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79621536,0.021666354,0.14788206,0.00082977896,0.00044567703,0.0003027384,0.00083760155,0.0014211991,0.030399272],"genre_scores_gemma":[0.98258865,0.002378377,0.0104379915,0.000036832207,0.000088865265,0.00005399299,0.00051673775,0.00007922034,0.0038193078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978277,0.0004591427,0.00010239091,0.00019512458,0.0011728819,0.00024271652],"domain_scores_gemma":[0.99497026,0.0030717053,0.00023539724,0.00030979054,0.0013037819,0.00010902002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020325475,0.00090398453,0.0008861945,0.0018607359,0.00062475837,0.0011494593,0.001113576,0.0005820398,0.0017757473],"category_scores_gemma":[0.0044586947,0.00029509945,0.0004906845,0.0013929291,0.000585377,0.0015290428,0.0005098046,0.0004852823,0.00040183045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024339836,0.00065120106,0.008302266,0.0009261754,0.00033368974,0.00033344224,0.00033448532,0.66600496,0.061249442,0.026532829,0.0069475416,0.22594996],"study_design_scores_gemma":[0.000036456404,0.0009466502,0.003884261,0.00002779576,0.00012644177,0.00028025458,0.0001670133,0.9719234,0.016227348,0.0040845727,0.0022541112,0.00004155031],"about_ca_topic_score_codex":0.0029824674,"about_ca_topic_score_gemma":0.0024440645,"teacher_disagreement_score":0.0029824674,"about_ca_system_score_codex":0.0024816887,"about_ca_system_score_gemma":0.0008306848,"threshold_uncertainty_score":0.018005967},"labels":[],"label_agreement":null},{"id":"W2107386394","doi":"10.1109/pccc.2003.1203708","title":"Minimum-energy broadcast routing in wireless multi-hop networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Energy consumption; Integer programming; Linear programming; Relay; Geographic routing; Distributed computing; Hop (telecommunications); Wireless; Heuristic; Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Mathematical optimization; Power (physics); Telecommunications; Engineering; Mathematics; Algorithm; Electrical engineering","score_opus":0.01519304849479437,"score_gpt":0.23194536463568297,"score_spread":0.2167523161408886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107386394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009732325,0.0014477222,0.98426116,0.0004532659,0.00006244791,0.00004927186,0.000062485444,0.0001935283,0.0037376739],"genre_scores_gemma":[0.46268815,0.005629865,0.52377623,0.00022148213,0.00023404587,0.00044175706,0.00032872346,0.0001787535,0.0065010544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993273,0.00032546953,0.000030457037,0.000059294853,0.00020076222,0.000056691995],"domain_scores_gemma":[0.99947137,0.00034601067,0.00006759407,0.000038815047,0.00005486227,0.000021438731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085150107,0.00055955944,0.0007950561,0.00043962395,0.0004563011,0.0013237358,0.0010327746,0.00101886,0.0011300348],"category_scores_gemma":[0.0019126148,0.0005069746,0.00034188887,0.0012331494,0.00065747445,0.0018066304,0.0007433107,0.0008629448,0.00027790427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010181655,0.00006669299,0.0002742995,0.00036832615,0.000043354234,0.00015725922,0.00010784629,0.76595134,0.006060967,0.13137922,0.004938029,0.090550855],"study_design_scores_gemma":[0.000030757317,0.000044344,0.00009654515,0.000037618654,0.000015311947,0.00007521805,0.000042751693,0.94367176,0.0018409585,0.04719696,0.0069341585,0.000013539165],"about_ca_topic_score_codex":0.0015649825,"about_ca_topic_score_gemma":0.0018926555,"teacher_disagreement_score":0.0015649825,"about_ca_system_score_codex":0.0007823868,"about_ca_system_score_gemma":0.00088564376,"threshold_uncertainty_score":0.005676627},"labels":[],"label_agreement":null},{"id":"W2107762051","doi":"10.1109/icc.2009.5198726","title":"An Efficient MAC Layer Handoff Scheme for WiFi-Based Multichannel Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Roaming; Handover; Network packet; Shared mesh; Switched mesh; Throughput; Wireless; Wireless network; Telecommunications","score_opus":0.016193892049774092,"score_gpt":0.26070926357797974,"score_spread":0.24451537152820566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107762051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14071935,0.001250563,0.85177577,0.00030639835,0.0005161078,0.00027448963,0.00011318974,0.0014753697,0.0035687047],"genre_scores_gemma":[0.84797794,0.00030145908,0.14859784,0.00010742173,0.00011122543,0.00012184531,0.00016457426,0.000023917444,0.002593769],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997056,0.000039444334,0.000028574705,0.000052624786,0.0001179554,0.00005574742],"domain_scores_gemma":[0.999716,0.00004342184,0.000036895737,0.00007281679,0.000102546626,0.000028343113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041651155,0.00033266802,0.00035030567,0.0004998649,0.00066315994,0.00032446094,0.00080053014,0.00039367127,0.00080537493],"category_scores_gemma":[0.000867943,0.00014128559,0.00026667435,0.00026384112,0.00020422066,0.00056921627,0.00057058566,0.00045252632,0.00017641345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007159859,0.00026078356,0.0022568174,0.00018425315,0.00012288264,0.0003690641,0.00020772424,0.034176446,0.25559774,0.012031494,0.0048575248,0.6892193],"study_design_scores_gemma":[0.00017092006,0.00083835865,0.0052835476,0.00002268158,0.00016939387,0.0010468365,0.000095075746,0.8832387,0.08826895,0.0035576269,0.017183159,0.00012481224],"about_ca_topic_score_codex":0.0016222625,"about_ca_topic_score_gemma":0.0030340538,"teacher_disagreement_score":0.0016222625,"about_ca_system_score_codex":0.00043040668,"about_ca_system_score_gemma":0.00036965485,"threshold_uncertainty_score":0.0032256246},"labels":[],"label_agreement":null},{"id":"W2108034674","doi":"10.1109/ccece.2003.1226256","title":"Performance analysis of two dynamic link selection algorithms in ad hoc CDMA networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Node (physics); Algorithm; Power (physics); Vehicular ad hoc network; Battery (electricity); Distributed computing; Wireless; Telecommunications; Network packet; Engineering","score_opus":0.006623548007714397,"score_gpt":0.24090428478887158,"score_spread":0.23428073678115718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108034674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46360612,0.004131236,0.5175949,0.0007954396,0.00022509733,0.00026657578,0.00010035856,0.0005662955,0.012714009],"genre_scores_gemma":[0.963296,0.0005086318,0.034797385,0.00007292088,0.000051037354,0.00008210671,0.00005500421,0.000028814251,0.0011081463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959572,0.0013477951,0.0001541583,0.00038508806,0.0014916485,0.000664154],"domain_scores_gemma":[0.9783659,0.016960995,0.0011171652,0.00071190076,0.0023927754,0.0004512234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058031403,0.0010730493,0.0010023892,0.0020495777,0.0011532453,0.0018048452,0.001334821,0.0011431708,0.0011518119],"category_scores_gemma":[0.021450365,0.00035500887,0.00033271624,0.0016584401,0.0010048433,0.0018955899,0.0010869018,0.00080181536,0.0001928241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096425135,0.00026996934,0.0047263354,0.00013389878,0.000118164695,0.00008960744,0.00015281355,0.87794137,0.0041049253,0.016564481,0.0008385043,0.09409562],"study_design_scores_gemma":[0.00003548303,0.00018872225,0.000588232,0.000006476018,0.000025634386,0.000058282832,0.000030549625,0.9957255,0.0014488526,0.0016590493,0.00022068348,0.000012473285],"about_ca_topic_score_codex":0.0043884786,"about_ca_topic_score_gemma":0.0036191961,"teacher_disagreement_score":0.0058031403,"about_ca_system_score_codex":0.0032309685,"about_ca_system_score_gemma":0.0019767983,"threshold_uncertainty_score":0.030690312},"labels":[],"label_agreement":null},{"id":"W2108073615","doi":"10.1109/ipdpsw.2013.88","title":"An Efficient Scheduling Model for Broadcasting in Wireless Sensor Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Broadcasting (networking); Wireless sensor network; Relay; Computer network; Scheduling (production processes); Energy consumption; Heuristic; Efficient energy use; Distributed computing; Wireless; Wireless network; Mathematical optimization; Telecommunications; Engineering","score_opus":0.019583763154354398,"score_gpt":0.2512645640803114,"score_spread":0.231680800925957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108073615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006660793,0.00034140144,0.9888276,0.00026123287,0.00010727305,0.000092826376,0.00010927622,0.00015648977,0.0034431869],"genre_scores_gemma":[0.5704163,0.0021219752,0.411746,0.00033524822,0.00040125597,0.0007862181,0.0005975243,0.0002080606,0.013387463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987779,0.0004764593,0.00007017956,0.00017486369,0.00037486272,0.0001257795],"domain_scores_gemma":[0.99904245,0.0005077631,0.000091072856,0.00011413327,0.00017982331,0.0000647283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018029081,0.00093274575,0.00094876724,0.00074437505,0.00077732344,0.001231237,0.0024579498,0.0010918919,0.002468529],"category_scores_gemma":[0.003041734,0.00049851474,0.00077483297,0.0016778271,0.0008487206,0.0020004143,0.0008216579,0.0012039124,0.0006477821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006904208,0.000048169037,0.000119437675,0.000114466886,0.000023083981,0.00008843519,0.00009065411,0.8758422,0.0023409263,0.101924956,0.0019878182,0.01735093],"study_design_scores_gemma":[0.000014451072,0.000030925454,0.000026802521,0.0000044122403,0.0000075109447,0.00002030916,0.000010489144,0.9832628,0.00022312834,0.01474799,0.0016452642,0.0000059589875],"about_ca_topic_score_codex":0.0051086782,"about_ca_topic_score_gemma":0.0054672337,"teacher_disagreement_score":0.0051086782,"about_ca_system_score_codex":0.0020451332,"about_ca_system_score_gemma":0.0020382758,"threshold_uncertainty_score":0.014838576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; 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","score_opus":0.0072387274077220015,"score_gpt":0.21177934032033569,"score_spread":0.2045406129126137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108267575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1516576,0.0012318973,0.843814,0.00021464353,0.000033093926,0.00008443064,0.000084531675,0.0009732009,0.0019066357],"genre_scores_gemma":[0.9371552,0.00034712572,0.061478157,0.000045999644,0.00003867837,0.00007385166,0.00012854963,0.00007966573,0.00065283885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987669,0.00045118408,0.000051357954,0.00016213965,0.00033700358,0.00023148966],"domain_scores_gemma":[0.9974026,0.001389498,0.00033637526,0.0004282084,0.00025374212,0.00018955876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000912379,0.00077298115,0.0010767201,0.0008686429,0.00090772647,0.0010036754,0.001366343,0.00080900127,0.0005656921],"category_scores_gemma":[0.0063639893,0.0004227913,0.00031854177,0.0011133527,0.0011920905,0.0018663717,0.0017469749,0.00053861673,0.00031789287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057087623,0.000056948935,0.0015163892,0.00011209094,0.000053026182,0.00022736471,0.00052295474,0.88200384,0.013107577,0.014517437,0.0016826692,0.08562877],"study_design_scores_gemma":[0.00003352935,0.00011295681,0.0003537191,0.000010737053,0.000017893646,0.00016764147,0.000090906535,0.9813897,0.0028094524,0.013651362,0.001350494,0.000011560743],"about_ca_topic_score_codex":0.0025006023,"about_ca_topic_score_gemma":0.0019745945,"teacher_disagreement_score":0.0025006023,"about_ca_system_score_codex":0.00075368065,"about_ca_system_score_gemma":0.0005663529,"threshold_uncertainty_score":0.005468428},"labels":[],"label_agreement":null},{"id":"W2108382861","doi":"10.1109/glocom.2004.1378860","title":"FIDC: a fair MAC protocol for ad hoc wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Countdown; Computer science; Multiple Access with Collision Avoidance for Wireless; Wireless ad hoc network; Ad hoc wireless distribution service; Hop (telecommunications); Throughput; Mobile ad hoc network; Protocol (science); Wireless network; Carrier sense multiple access with collision avoidance; Optimized Link State Routing Protocol; Wireless; Telecommunications; Engineering","score_opus":0.017888339725825868,"score_gpt":0.28388895489341476,"score_spread":0.2660006151675889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108382861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031932148,0.0015033085,0.98668647,0.0003598352,0.00066496135,0.0006401192,0.00015102355,0.0024568073,0.004344201],"genre_scores_gemma":[0.22320133,0.002021757,0.7599858,0.001080634,0.0009308591,0.0029192886,0.0006106566,0.00040711992,0.008842542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691844,0.00077409064,0.00016573958,0.00029640173,0.0014597169,0.00038552846],"domain_scores_gemma":[0.9970084,0.0009886693,0.0002262666,0.000712176,0.00081792683,0.00024656102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004446746,0.001090228,0.0012354072,0.0020532853,0.003231136,0.001848872,0.0033332743,0.0017159906,0.003161083],"category_scores_gemma":[0.007905305,0.00043501248,0.00074388005,0.0013766924,0.0021157719,0.0023684686,0.002443668,0.0021182962,0.0011088384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064526685,0.00034428493,0.0008053798,0.0008122134,0.00016705295,0.00068915816,0.0006935793,0.058463182,0.032321062,0.33731332,0.05996922,0.5077763],"study_design_scores_gemma":[0.00039694904,0.00066181266,0.00058105844,0.00020805378,0.00023784426,0.001699884,0.00012993116,0.48665264,0.0302279,0.1544195,0.3244397,0.00034467853],"about_ca_topic_score_codex":0.002989085,"about_ca_topic_score_gemma":0.0032735579,"teacher_disagreement_score":0.004446746,"about_ca_system_score_codex":0.001616386,"about_ca_system_score_gemma":0.0030723435,"threshold_uncertainty_score":0.023516893},"labels":[],"label_agreement":null},{"id":"W2108490126","doi":"10.1145/1506270.1506387","title":"Topology designs with controlled interference for multi-radio wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Order One Network Protocol; Mesh networking; Wireless network; Wireless; Network topology; Shared mesh; Switched mesh; Radio resource management; Service set; Channel (broadcasting); Interference (communication); Hazy Sighted Link State Routing Protocol; Routing protocol; Wi-Fi array; Distributed computing; Routing (electronic design automation); Telecommunications; Dynamic Source Routing","score_opus":0.044386615115789486,"score_gpt":0.2639370629935356,"score_spread":0.2195504478777461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108490126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0111928135,0.0008922145,0.9848119,0.00010702536,0.00008477342,0.00010056941,0.000023179256,0.0002718377,0.0025156732],"genre_scores_gemma":[0.35963914,0.0015626205,0.6360835,0.00012106803,0.00014898427,0.00045626063,0.000109522494,0.00014170764,0.0017372894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874026,0.0006802503,0.00005085919,0.00011092916,0.00035763154,0.00006014847],"domain_scores_gemma":[0.9978549,0.0010342076,0.00039017026,0.0003709662,0.00028923352,0.00006062855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001466716,0.000522832,0.00039007768,0.000684443,0.00035611814,0.0005592265,0.00092610816,0.00042542449,0.0015954784],"category_scores_gemma":[0.0054553174,0.00028568401,0.0003300237,0.0005938358,0.0005845516,0.0012060599,0.0005823652,0.0006012156,0.00043260778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035438922,0.0002358518,0.0013575478,0.0006983727,0.000089096284,0.0003550609,0.00027725304,0.43446717,0.11169095,0.13692226,0.002888846,0.31066316],"study_design_scores_gemma":[0.00009172756,0.0009760601,0.0006657498,0.0000828488,0.00007087319,0.00042982434,0.00007161731,0.8881898,0.030741042,0.060114942,0.018514844,0.000050664115],"about_ca_topic_score_codex":0.00009439094,"about_ca_topic_score_gemma":0.00016236535,"teacher_disagreement_score":0.0015954784,"about_ca_system_score_codex":0.00042322662,"about_ca_system_score_gemma":0.00020374688,"threshold_uncertainty_score":0.0077568293},"labels":[],"label_agreement":null},{"id":"W2108619294","doi":"10.1145/1454630.1454635","title":"Performance evaluation of a hybrid adaptive service discovery protocol for next generation Heterogeneous Vehicular Networks (HVNs)","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Service discovery; Computer science; Overhead (engineering); Vehicular ad hoc network; Computer network; Distributed computing; Service (business); Next-generation network; Protocol (science); Heterogeneous network; Neighbor Discovery Protocol; Wireless network; Wireless; Wireless ad hoc network; Web service; Telecommunications; Internet protocol suite; The Internet","score_opus":0.09249894302348467,"score_gpt":0.2900578870471883,"score_spread":0.19755894402370366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108619294","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9003709,0.0030402255,0.08453418,0.0008232523,0.0003791812,0.00053844205,0.00028391724,0.001233762,0.008796101],"genre_scores_gemma":[0.9895174,0.00028257165,0.009234849,0.000049639362,0.000019225394,0.00009576909,0.00020468049,0.000025039106,0.00057088863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965946,0.0011615031,0.00024631488,0.0002554739,0.0012645734,0.00047756397],"domain_scores_gemma":[0.9889109,0.006564024,0.000771541,0.00056059385,0.0027411554,0.00045175335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059281886,0.0009913062,0.0012255914,0.0017488153,0.0010076732,0.0010957828,0.0013968606,0.001042737,0.00090234383],"category_scores_gemma":[0.012294189,0.00023271347,0.0003676605,0.0011582125,0.00086603547,0.0016992667,0.0010915986,0.00077686727,0.00016337434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005389371,0.0012257954,0.015003967,0.0007271045,0.00066251174,0.0007060483,0.00044237956,0.8023075,0.03873301,0.010841112,0.0042382395,0.11972295],"study_design_scores_gemma":[0.00011462032,0.001340576,0.0012260005,0.000012273364,0.00008481924,0.00018124098,0.00009931716,0.98818153,0.0073543405,0.0007629799,0.00060881017,0.000033569846],"about_ca_topic_score_codex":0.007008058,"about_ca_topic_score_gemma":0.0035139637,"teacher_disagreement_score":0.007008058,"about_ca_system_score_codex":0.0024649035,"about_ca_system_score_gemma":0.0016159443,"threshold_uncertainty_score":0.031351626},"labels":[],"label_agreement":null},{"id":"W2108663846","doi":"10.1109/ntms.2011.5720599","title":"M","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Node (physics); Wireless ad hoc network; Computer network; Ad hoc On-Demand Distance Vector Routing; Transmission (telecommunications); Routing (electronic design automation); Terminal (telecommunication); Network topology; Routing protocol; Optimized Link State Routing Protocol; Engineering; Wireless; Telecommunications","score_opus":0.029581108991334128,"score_gpt":0.21224921878681607,"score_spread":0.18266810979548195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108663846","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015565723,0.001995403,0.4015692,0.005365627,0.003779488,0.00047034712,0.007119876,0.0044669355,0.5596674],"genre_scores_gemma":[0.27482545,0.003652101,0.20750597,0.0055631753,0.0018521684,0.0011035017,0.015259755,0.0018000604,0.4884377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99889106,0.00020004669,0.00007863515,0.00038192145,0.00026874826,0.00017959984],"domain_scores_gemma":[0.99904805,0.00012398505,0.00007879699,0.00036618518,0.00030040642,0.00008254436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005679211,0.0009177462,0.00053385616,0.00091464247,0.0012814136,0.0028166345,0.0016195163,0.0017323128,0.10726371],"category_scores_gemma":[0.0024066635,0.00030302684,0.0009103353,0.00086749153,0.000738354,0.003635501,0.002438908,0.0012343646,0.057675146],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025345592,0.00014174132,0.0026700764,0.00039448624,0.000070136266,0.0004712592,0.0003577415,0.009967833,0.0067536286,0.62254626,0.16715768,0.18921563],"study_design_scores_gemma":[0.00003521898,0.000097793665,0.0012535149,0.00010270761,0.000026390882,0.0008076084,0.00020891977,0.022933971,0.0033961073,0.17191255,0.7991788,0.00004641437],"about_ca_topic_score_codex":0.0031091606,"about_ca_topic_score_gemma":0.0020362341,"teacher_disagreement_score":0.8927363,"about_ca_system_score_codex":0.0010284332,"about_ca_system_score_gemma":0.001018467,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2108775423","doi":"10.1145/1089803.1089991","title":"Virtual backbone based on MCDS for topology control in wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Connected dominating set; Computer science; Wireless ad hoc network; Flooding (psychology); Computer network; Backbone network; Topology control; Relay; Distributed computing; Vehicular ad hoc network; Cluster analysis; Bandwidth (computing); Wireless network; Wireless; Topology (electrical circuits); Graph; Theoretical computer science; Key distribution in wireless sensor networks; Engineering","score_opus":0.008369097214072021,"score_gpt":0.23450769841405694,"score_spread":0.2261386011999849,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108775423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0092052305,0.0005214193,0.9879324,0.00016977705,0.00006647341,0.000052137577,0.000028565493,0.00021038574,0.0018136341],"genre_scores_gemma":[0.59726703,0.000970104,0.39879477,0.00011869182,0.00008151627,0.00016833557,0.00015401418,0.000045220317,0.0024002646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.00024150776,0.00003407295,0.0000749503,0.00018656705,0.00003717843],"domain_scores_gemma":[0.9992694,0.00034612126,0.00007503749,0.000074204305,0.00019309108,0.000042108033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853336,0.00044440135,0.0006551098,0.0010458261,0.0006574109,0.0007977746,0.0010246437,0.0005127393,0.0012841284],"category_scores_gemma":[0.002368437,0.0002338556,0.0003956157,0.0010120961,0.00060861657,0.0012638272,0.0009540452,0.0005335201,0.00017951566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016060898,0.000074723815,0.00091625453,0.00024358204,0.000072164876,0.000104339866,0.00019571993,0.67150605,0.0060953847,0.062203195,0.0026282286,0.2557997],"study_design_scores_gemma":[0.000022732844,0.000103478735,0.00013359905,0.000015512614,0.000018879973,0.00004955664,0.000037161084,0.97690797,0.0014989369,0.01683152,0.004368558,0.000012074808],"about_ca_topic_score_codex":0.002202085,"about_ca_topic_score_gemma":0.0027542387,"teacher_disagreement_score":0.002202085,"about_ca_system_score_codex":0.00067146437,"about_ca_system_score_gemma":0.0005989276,"threshold_uncertainty_score":0.0057399273},"labels":[],"label_agreement":null},{"id":"W2108912546","doi":"10.1109/wimob.2006.1696400","title":"Multiple Description and Multi-Path Routing for Robust Voice Transmission over Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer network; Multiple description coding; Wireless ad hoc network; Mobile ad hoc network; Network packet; Linear network coding; Routing protocol; Encoder; Node (physics); Wireless; Distributed computing; Telecommunications","score_opus":0.021340844423208022,"score_gpt":0.22556269186462252,"score_spread":0.2042218474414145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108912546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030738546,0.0029559033,0.9635145,0.0004956579,0.0001249089,0.00011351511,0.000053080512,0.00048512948,0.0015187293],"genre_scores_gemma":[0.6634482,0.0018256729,0.33159122,0.00019180818,0.00014377185,0.00029920024,0.00021557962,0.00009690459,0.0021875964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990188,0.0005182768,0.000052443236,0.000059199938,0.00030048218,0.000050847277],"domain_scores_gemma":[0.9982261,0.0012245412,0.00015094008,0.00015867109,0.00019304221,0.000046757716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001833785,0.0005704177,0.00058590947,0.0007997623,0.00041759314,0.00070525537,0.0009413177,0.00070892717,0.0012186151],"category_scores_gemma":[0.0036556462,0.0002745175,0.0003683267,0.00055857364,0.00058794295,0.0013004105,0.0006008478,0.00058519625,0.00021522136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034947196,0.000084030704,0.00067049806,0.00037542442,0.00012715877,0.00040728427,0.000195438,0.7462132,0.025183318,0.051953714,0.003237035,0.17120343],"study_design_scores_gemma":[0.000027660775,0.00009430669,0.00008692158,0.000009692545,0.000015582693,0.00007475542,0.000015978168,0.9893471,0.0022313932,0.006593615,0.0014867629,0.000016202974],"about_ca_topic_score_codex":0.0012612885,"about_ca_topic_score_gemma":0.0013554055,"teacher_disagreement_score":0.001833785,"about_ca_system_score_codex":0.0007063386,"about_ca_system_score_gemma":0.00063416024,"threshold_uncertainty_score":0.009698093},"labels":[],"label_agreement":null},{"id":"W2108945668","doi":"10.1109/icc.2008.523","title":"An Opportunistic Directional MAC Protocol for Multihop Wireless Networks with Switched Beam Directional Antennas","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Acknowledgement; Directional antenna; Throughput; Overhead (engineering); Reuse; Channel (broadcasting); Wireless; Node (physics); Transmission (telecommunications); Wireless network; Hidden node problem; Wi-Fi array; Telecommunications; Engineering; Antenna (radio)","score_opus":0.03442635492830907,"score_gpt":0.2841849547904771,"score_spread":0.24975859986216806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108945668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035939354,0.002798177,0.9521427,0.00044495537,0.0005081933,0.0004790455,0.00015513481,0.0009819571,0.0065503675],"genre_scores_gemma":[0.6931685,0.002017038,0.29615936,0.0006022883,0.00024401341,0.0009897966,0.00031074157,0.0000775321,0.006430758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999509,0.00014042642,0.000043724645,0.00003823914,0.00020932358,0.00005927453],"domain_scores_gemma":[0.99891484,0.00041733056,0.00016015003,0.00015676918,0.00027033399,0.00008055491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00103718,0.00041343315,0.0003387651,0.00069489464,0.00069875893,0.00069901766,0.0008229512,0.00039557237,0.0006161753],"category_scores_gemma":[0.0020678353,0.00017818548,0.0002636442,0.00053708005,0.00045835698,0.00058957393,0.0007148052,0.0006016409,0.00014653786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079564267,0.00032996247,0.0036094391,0.00097331003,0.0002536752,0.0011268375,0.00072394364,0.07537912,0.15324333,0.14367004,0.013662431,0.6062322],"study_design_scores_gemma":[0.00034708402,0.0014611264,0.0028716666,0.00012100156,0.0004292814,0.0033826516,0.00027863117,0.73640835,0.046292268,0.035422307,0.17276302,0.00022261112],"about_ca_topic_score_codex":0.0010900716,"about_ca_topic_score_gemma":0.0024536278,"teacher_disagreement_score":0.0010900716,"about_ca_system_score_codex":0.0004214025,"about_ca_system_score_gemma":0.00089273805,"threshold_uncertainty_score":0.005485177},"labels":[],"label_agreement":null},{"id":"W2109121943","doi":"10.1002/sec.561","title":"SDRP: a secure distributed revocation protocol for vehicular environments","year":2012,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Revocation; Computer science; Denial-of-service attack; Computer network; Computer security; Protocol (science); Routing protocol; Vehicular ad hoc network; Cryptographic protocol; Wireless ad hoc network; Cryptography; Routing (electronic design automation); The Internet; Wireless; Telecommunications; Overhead (engineering)","score_opus":0.01611736481959449,"score_gpt":0.2688111127443309,"score_spread":0.2526937479247364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109121943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02097666,0.0007334702,0.96782494,0.00022806689,0.00022776605,0.00036375897,0.000118964126,0.005218658,0.0043077487],"genre_scores_gemma":[0.6814458,0.001106211,0.3053154,0.00027518024,0.00014265791,0.0008041282,0.0009832991,0.00045226817,0.009475076],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988813,0.0003506946,0.0001463461,0.000118887336,0.00039902425,0.00010371061],"domain_scores_gemma":[0.99892753,0.00023853395,0.00016514935,0.00031998707,0.0002550247,0.000093674586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014469622,0.00047070187,0.000609433,0.00084878894,0.00047179233,0.0010050965,0.0015553478,0.0008728486,0.0017209117],"category_scores_gemma":[0.0022878,0.00032854854,0.00046649753,0.0004937445,0.0009829262,0.0016827639,0.002359544,0.0012060938,0.0009534482],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015611032,0.0003641635,0.002065127,0.0012847678,0.00031015405,0.0021375571,0.0012498088,0.13919786,0.13354196,0.2012367,0.023893917,0.49315685],"study_design_scores_gemma":[0.00062924233,0.0011351318,0.0008763559,0.00016013629,0.00019527868,0.0024406868,0.00024285958,0.6901632,0.05838634,0.045796353,0.19971246,0.00026200182],"about_ca_topic_score_codex":0.00052111474,"about_ca_topic_score_gemma":0.00040999305,"teacher_disagreement_score":0.0017209117,"about_ca_system_score_codex":0.00030444723,"about_ca_system_score_gemma":0.00068037305,"threshold_uncertainty_score":0.0076523423},"labels":[],"label_agreement":null},{"id":"W2109191120","doi":"10.1109/glocom.2008.ecp.366","title":"An Efficient Trust-Based Reputation Protocol for Wireless and Mobile Ad Hoc Networks: Proof and Correctness","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Correctness; Reputation; Computer science; Trust management (information system); Computer security; Wireless ad hoc network; Trustworthiness; Protocol (science); Wireless network; Computational trust; Computer network; Wireless; Mobile ad hoc network; Reputation system; Telecommunications; Algorithm","score_opus":0.015506449703204406,"score_gpt":0.2772789554327203,"score_spread":0.2617725057295159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109191120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046942914,0.00028720498,0.9903538,0.00069603475,0.00009732735,0.00021237053,0.000046015415,0.00041890566,0.003194015],"genre_scores_gemma":[0.3589393,0.001057205,0.6332563,0.00037375305,0.00024808865,0.00092841755,0.00017786144,0.00018730294,0.004831777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99405944,0.0017810862,0.00038582864,0.0005880326,0.002855241,0.00033037807],"domain_scores_gemma":[0.9870455,0.00704715,0.0009610083,0.002225318,0.0023994674,0.0003215612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065500694,0.00081954576,0.0011485629,0.0007882764,0.0016408907,0.0034066364,0.00275668,0.0025051176,0.0020596646],"category_scores_gemma":[0.024703898,0.0008770741,0.0012560597,0.00107549,0.0049084444,0.005590209,0.004373489,0.0031860117,0.0010885923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014914275,0.00017749998,0.00058380445,0.0006585048,0.00010460911,0.0010259561,0.00086136046,0.08063308,0.013388905,0.8150075,0.008114639,0.079295084],"study_design_scores_gemma":[0.00036430897,0.00037958662,0.00036665646,0.00019542055,0.00015257341,0.001325644,0.00017297473,0.6000272,0.014019349,0.3454516,0.03739022,0.00015438204],"about_ca_topic_score_codex":0.0014192564,"about_ca_topic_score_gemma":0.0010064465,"teacher_disagreement_score":0.0065500694,"about_ca_system_score_codex":0.0014758685,"about_ca_system_score_gemma":0.002964084,"threshold_uncertainty_score":0.03464049},"labels":[],"label_agreement":null},{"id":"W2109386646","doi":"10.1109/ainaw.2007.54","title":"A Secure MANET Routing Protocol with Resilience against Byzantine Behaviours of Malicious or Selfish Nodes","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Routing protocol; Computer security; Wireless ad hoc network; Network packet; Wireless; Telecommunications","score_opus":0.009754204005365379,"score_gpt":0.26551754720995424,"score_spread":0.2557633432045889,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109386646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041976515,0.0009306899,0.943513,0.0010010893,0.0004110532,0.00096424343,0.00021367318,0.003551276,0.00743845],"genre_scores_gemma":[0.51249,0.0015934473,0.47050726,0.00047278765,0.0002233998,0.0009064962,0.0006184488,0.00033747003,0.012850749],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991798,0.00019176884,0.000106620275,0.00009822826,0.0003589143,0.000064753876],"domain_scores_gemma":[0.99881124,0.00026077358,0.00028524062,0.0003428667,0.00022255637,0.00007729823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010178589,0.0006234251,0.0006458231,0.00089861976,0.0006977618,0.00079574547,0.001215832,0.00089692307,0.001420564],"category_scores_gemma":[0.0021861047,0.00035412968,0.0007621457,0.00060351007,0.0008402254,0.0015453612,0.0014958605,0.0010414569,0.0007698723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094727403,0.00040184095,0.0017661765,0.0013371386,0.00042797497,0.00387846,0.000980747,0.14380284,0.24955274,0.236418,0.013774491,0.34671235],"study_design_scores_gemma":[0.00035124805,0.0019852568,0.0010377498,0.00013244798,0.00034870062,0.0065011857,0.00021618373,0.70733315,0.112028815,0.049414195,0.120409615,0.00024147394],"about_ca_topic_score_codex":0.0004545949,"about_ca_topic_score_gemma":0.00057957607,"teacher_disagreement_score":0.001420564,"about_ca_system_score_codex":0.00032976642,"about_ca_system_score_gemma":0.0007878603,"threshold_uncertainty_score":0.0053830147},"labels":[],"label_agreement":null},{"id":"W2109409817","doi":"10.1109/ntms.2008.ecp.21","title":"An Overlay Network for a SIP Servlet-Based Service Execution Environment in Stand Alone MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Computer network; Overlay network; Mobile ad hoc network; Distributed computing; Scalability; Overlay; Flexibility (engineering); Wireless ad hoc network; Service discovery; Node (physics); Provisioning; Wireless; Web service; Operating system; The Internet; World Wide Web; Engineering","score_opus":0.01637081348847122,"score_gpt":0.2223189062852521,"score_spread":0.2059480927967809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109409817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045687784,0.00020529906,0.94208604,0.00033763237,0.000085835985,0.00030789393,0.00013984447,0.0026167892,0.008532927],"genre_scores_gemma":[0.47604638,0.0004907861,0.5149749,0.000100946374,0.00003642532,0.00035823532,0.00032595583,0.00021469379,0.00745169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999428,0.0001677997,0.00006287702,0.000090375375,0.00019708325,0.000053889587],"domain_scores_gemma":[0.99943584,0.0002603552,0.000051146362,0.00010334421,0.00009440527,0.00005490753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010089148,0.00028238707,0.00030973047,0.00040352772,0.00081344607,0.0013306653,0.0004900507,0.0005739341,0.0020756826],"category_scores_gemma":[0.0019974806,0.00027260647,0.00034646213,0.00030908122,0.0009559281,0.0015829282,0.0009102096,0.00087758614,0.00035562605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064247916,0.00023319472,0.001900966,0.00063171674,0.000060081544,0.0025312735,0.0014582116,0.2107461,0.07705278,0.580592,0.005344176,0.11880708],"study_design_scores_gemma":[0.00007612685,0.00021971327,0.0007864101,0.000101399484,0.0000878602,0.0008346368,0.00024308955,0.8355784,0.032455783,0.06327908,0.06626342,0.00007409974],"about_ca_topic_score_codex":0.002315481,"about_ca_topic_score_gemma":0.0028626104,"teacher_disagreement_score":0.002315481,"about_ca_system_score_codex":0.00074362673,"about_ca_system_score_gemma":0.0012119919,"threshold_uncertainty_score":0.006943822},"labels":[],"label_agreement":null},{"id":"W2109661751","doi":"10.1145/1143549.1143734","title":"MAC-assisted broadcast speedup in ad-hoc wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Latency (audio); Atomic broadcast; Broadcast radiation; Wireless; Broadcast communication network; Wireless network; Vehicular ad hoc network; Broadcasting (networking); IEEE 802.11; Telecommunications; Network packet","score_opus":0.009586552602935068,"score_gpt":0.2195316482890586,"score_spread":0.20994509568612355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109661751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3881731,0.007347769,0.56090224,0.0014463229,0.00058187055,0.0002095979,0.00015941307,0.0050411704,0.0361385],"genre_scores_gemma":[0.9430826,0.0012503086,0.050054546,0.000071936454,0.0002805933,0.00006640585,0.00007830889,0.00008284598,0.0050324164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00009828512,0.000014373967,0.000029245923,0.00012478672,0.00005510273],"domain_scores_gemma":[0.99879116,0.0005976648,0.00006438963,0.00022075512,0.00026306257,0.00006307441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009759431,0.00040710907,0.0004043228,0.0005116421,0.00039452128,0.00048067438,0.00048298738,0.00021383412,0.0017303211],"category_scores_gemma":[0.003017575,0.00019606108,0.0001189741,0.00057666475,0.00044783784,0.0010505299,0.000551112,0.00049666234,0.0003528612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012635371,0.00032147588,0.0038636015,0.00046713214,0.000058910384,0.0003245635,0.000492631,0.38751397,0.105286695,0.09130141,0.0122511415,0.3968549],"study_design_scores_gemma":[0.000078421384,0.0002012201,0.0008724812,0.000014626927,0.00002635145,0.000089065674,0.000051700914,0.9678146,0.012174462,0.011913271,0.0067545846,0.000009132456],"about_ca_topic_score_codex":0.001598442,"about_ca_topic_score_gemma":0.0019270143,"teacher_disagreement_score":0.0017303211,"about_ca_system_score_codex":0.0005489949,"about_ca_system_score_gemma":0.0005295981,"threshold_uncertainty_score":0.005788505},"labels":[],"label_agreement":null},{"id":"W2109746328","doi":"10.5539/cis.v3n2p3","title":"Impact of Route Selection Metrics on the Performance of On-Demand Mesh-based Multicast Ad hoc Routing","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Computer network; Polygon mesh; Protocol Independent Multicast; Routing (electronic design automation); Distance Vector Multicast Routing Protocol; Routing protocol; Distributed computing; Algorithm; Xcast","score_opus":0.012530663001513882,"score_gpt":0.2570362380784719,"score_spread":0.24450557507695805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109746328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974589,0.001204618,0.021068396,0.00024087375,0.000069496054,0.000047947724,0.00007482758,0.0004026034,0.0023022627],"genre_scores_gemma":[0.99603075,0.0001544244,0.0034208754,0.000018258364,0.000012619429,0.000011290482,0.00008657411,0.000042635198,0.00022249566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763453,0.0010026051,0.00014005967,0.00017222557,0.00084000384,0.00021057091],"domain_scores_gemma":[0.98276985,0.01270428,0.0014678185,0.0011067113,0.0016775121,0.00027375465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023465313,0.0009119123,0.0006047287,0.000920907,0.000484461,0.00072847935,0.00081095356,0.00074684096,0.0005402013],"category_scores_gemma":[0.018651985,0.00021062083,0.00018142987,0.00061604555,0.0004235507,0.0011317737,0.0005477439,0.0003400294,0.000134135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029329143,0.00065257965,0.027057398,0.00039756927,0.00025300993,0.00040078035,0.0003029412,0.67079663,0.08828749,0.002189843,0.0015668486,0.20516187],"study_design_scores_gemma":[0.000083227555,0.002695528,0.01418515,0.000027617698,0.00012269412,0.00063042255,0.00023057446,0.9168411,0.063126154,0.0012347696,0.00076043763,0.00006249069],"about_ca_topic_score_codex":0.0013954411,"about_ca_topic_score_gemma":0.0015355663,"teacher_disagreement_score":0.0023465313,"about_ca_system_score_codex":0.0006961792,"about_ca_system_score_gemma":0.00033772513,"threshold_uncertainty_score":0.012409806},"labels":[],"label_agreement":null},{"id":"W2110097654","doi":"10.1109/wocn.2005.1436037","title":"A quality of service approach based on neural networks for mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Quality of service; Artificial neural network; Adaptive quality of service multi-hop routing; Computer network; Plan (archaeology); Kernel (algebra); Wireless ad hoc network; Mobile ad hoc network; Intelligent Network; Service (business); Throughput; Mobile QoS; Artificial intelligence; Vehicular ad hoc network; Machine learning; Distributed computing; Optimized Link State Routing Protocol; Wireless; Telecommunications; Service provider","score_opus":0.02831313557792616,"score_gpt":0.27662345417230194,"score_spread":0.24831031859437577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110097654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006295477,0.0007561391,0.9901391,0.00043000793,0.00009072847,0.000027342014,0.00001616937,0.00020696636,0.00203811],"genre_scores_gemma":[0.7089881,0.0019983617,0.28282106,0.00035403873,0.00030439656,0.0001968425,0.00009476934,0.000059699807,0.00518273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995604,0.00012234588,0.000024283661,0.00007151441,0.00017973408,0.000041749012],"domain_scores_gemma":[0.99965847,0.00013251558,0.000044464774,0.000028949626,0.000115688774,0.000019889461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007166481,0.0005932768,0.00045957702,0.0005196879,0.000280635,0.0007882163,0.0012808547,0.0009371472,0.0008734667],"category_scores_gemma":[0.001485919,0.00017721494,0.00037162963,0.0005935206,0.0005516806,0.0015260195,0.00053928373,0.0011679494,0.00022085427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066947374,0.00007714072,0.00078739907,0.00009822042,0.000078236415,0.00009470264,0.000060393144,0.8069968,0.0031503323,0.06640264,0.0011983296,0.12098876],"study_design_scores_gemma":[0.0000030488106,0.000017698427,0.00006179291,0.0000038858266,0.000007476582,0.000010833616,0.0000041532408,0.9902338,0.00028568393,0.008725025,0.00064300065,0.0000036942965],"about_ca_topic_score_codex":0.004000293,"about_ca_topic_score_gemma":0.0031343948,"teacher_disagreement_score":0.004000293,"about_ca_system_score_codex":0.0009324356,"about_ca_system_score_gemma":0.0005525855,"threshold_uncertainty_score":0.007954061},"labels":[],"label_agreement":null},{"id":"W2110159784","doi":"10.1080/15501320500259159","title":"Progress and Location Based Localized Power Aware Routing for Ad Hoc and Sensor Wireless Networks","year":2006,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Network packet; Routing (electronic design automation); Shortest path problem; Power (physics); Node (physics); Wireless ad hoc network; Path (computing); Algorithm; Mathematical optimization; Wireless; Competitive analysis; Geographic routing; Computer network; Routing protocol; Link-state routing protocol; Theoretical computer science; Telecommunications; Mathematics","score_opus":0.007318975406969059,"score_gpt":0.24271822509952334,"score_spread":0.2353992496925543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110159784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006661739,0.0014144594,0.9875896,0.00028779343,0.00014242623,0.000081671584,0.000035217614,0.00063862704,0.0031484547],"genre_scores_gemma":[0.36398137,0.0057562026,0.6098752,0.00029478417,0.00057839777,0.00039667997,0.00033546248,0.00025852566,0.018523443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987801,0.00030117683,0.00006173901,0.000223501,0.00057098025,0.00006248512],"domain_scores_gemma":[0.99783117,0.0009511541,0.0002474578,0.00040394047,0.00048439583,0.00008200063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015233089,0.0013343063,0.0006527092,0.0011419061,0.0006933391,0.0014226544,0.0018603358,0.00081467174,0.0022756942],"category_scores_gemma":[0.0046947277,0.0003948763,0.0005206979,0.0014159124,0.0013434375,0.0054714354,0.0014053421,0.0015489336,0.0009466517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026461636,0.000110627516,0.001035027,0.00040571703,0.000061106606,0.00015251899,0.00030421914,0.32797432,0.009663619,0.19234902,0.006137551,0.46154168],"study_design_scores_gemma":[0.000058898637,0.0004016835,0.0004110935,0.000049209968,0.0000625404,0.00026664836,0.00012287384,0.88047785,0.008921798,0.079335555,0.029836033,0.000055836488],"about_ca_topic_score_codex":0.0011222712,"about_ca_topic_score_gemma":0.0012940012,"teacher_disagreement_score":0.0022756942,"about_ca_system_score_codex":0.0008507659,"about_ca_system_score_gemma":0.00086984184,"threshold_uncertainty_score":0.008056164},"labels":[],"label_agreement":null},{"id":"W2110203913","doi":"10.1109/ccnc.2006.1593060","title":"OSPF-MCDS-MC: a routing protocol for multi-channel wireless ad-hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Office of Naval Research","keywords":"Computer network; Computer science; Wireless Routing Protocol; Routing protocol; Zone Routing Protocol; Distributed computing; Dynamic Source Routing; Goodput; Optimized Link State Routing Protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Wireless ad hoc network; Open Shortest Path First; Interior gateway protocol; Hazy Sighted Link State Routing Protocol; Routing (electronic design automation); Wireless; Throughput; Telecommunications","score_opus":0.03099141578946789,"score_gpt":0.28992524272284614,"score_spread":0.25893382693337824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110203913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036241807,0.0028287952,0.9487002,0.00066618534,0.0005594376,0.0003226315,0.00034160836,0.0025094287,0.007829844],"genre_scores_gemma":[0.4807878,0.0021871608,0.50931305,0.00035290502,0.00032861755,0.00036434014,0.00083252514,0.000099188626,0.0057343603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955803,0.00011501297,0.000038691494,0.000034368783,0.00020813629,0.000045680677],"domain_scores_gemma":[0.9994574,0.00010973363,0.00008244826,0.00012790861,0.00016951961,0.000052900563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007319326,0.00034686085,0.00040865585,0.00073512015,0.0006341865,0.0007904985,0.00081675284,0.0005316759,0.0010021772],"category_scores_gemma":[0.0011148985,0.00016429022,0.00027667577,0.0007531145,0.0005369781,0.0013384172,0.00069620943,0.00060264923,0.0002817468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029171578,0.00025728976,0.0019917062,0.00081274705,0.00014016271,0.0008441969,0.00030849015,0.113412194,0.049345225,0.16257028,0.034856997,0.63516897],"study_design_scores_gemma":[0.00018842937,0.0007749139,0.0015218944,0.00010412024,0.00013628414,0.0017641651,0.0001348083,0.6443941,0.047372114,0.067366876,0.23606361,0.00017861754],"about_ca_topic_score_codex":0.0008383776,"about_ca_topic_score_gemma":0.001306047,"teacher_disagreement_score":0.0010021772,"about_ca_system_score_codex":0.00051750895,"about_ca_system_score_gemma":0.0009684275,"threshold_uncertainty_score":0.0038708448},"labels":[],"label_agreement":null},{"id":"W2110508548","doi":"10.1186/1687-1499-2012-155","title":"Improving throughput and fairness by improved channel assignment using topology control based on power control for multi-radio multi-channel wireless mesh networks","year":2012,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Throughput; Network topology; Channel (broadcasting); Interference (communication); Topology control; Power control; Channel allocation schemes; Default gateway; Wireless network; Topology (electrical circuits); Network performance; Distributed computing; Wireless; Power (physics); Telecommunications; Key distribution in wireless sensor networks","score_opus":0.0388050032192451,"score_gpt":0.28451194654917245,"score_spread":0.24570694332992735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110508548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12714317,0.00041871524,0.8691913,0.00012259943,0.000088766414,0.00004971463,0.000022936754,0.0007007234,0.0022620123],"genre_scores_gemma":[0.9151735,0.00013339511,0.084016226,0.000041185154,0.00002350606,0.000038566683,0.000026492695,0.000032982673,0.0005142742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994727,0.00019894369,0.000025349962,0.00008421163,0.00014656967,0.0000722238],"domain_scores_gemma":[0.99901116,0.000516322,0.00010356357,0.00014943577,0.0001738341,0.000045562865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009121443,0.00047907134,0.00035193565,0.00047611087,0.00044071444,0.00052279833,0.0007961892,0.00032849814,0.00056429836],"category_scores_gemma":[0.0025757772,0.00013902043,0.00028054995,0.0004728533,0.00039348853,0.0011039091,0.0005850415,0.00046402324,0.000091456226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016735986,0.00015103488,0.002059115,0.000054022283,0.000040200317,0.00007173298,0.00007388542,0.83790106,0.024289189,0.0075301672,0.0007283795,0.12693383],"study_design_scores_gemma":[0.00001190574,0.000045608605,0.00022369796,0.0000016696287,0.0000082671095,0.000020791007,0.0000059566437,0.9946155,0.003358465,0.0013319207,0.00037079124,0.0000054724137],"about_ca_topic_score_codex":0.0017481953,"about_ca_topic_score_gemma":0.0022487757,"teacher_disagreement_score":0.0017481953,"about_ca_system_score_codex":0.0005044045,"about_ca_system_score_gemma":0.00064449746,"threshold_uncertainty_score":0.004823923},"labels":[],"label_agreement":null},{"id":"W2110539303","doi":"10.1109/ccnc.2007.54","title":"Cross-Layer Design for Optimizing the Performance of Clusters-Based Application Layer Schemes in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Layer (electronics); Vehicular ad hoc network; Distributed computing; Network layer; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Routing (electronic design automation); Network architecture; Architecture; Cluster (spacecraft); Session (web analytics); Wireless; Routing protocol; Telecommunications; Network packet","score_opus":0.024372049329597658,"score_gpt":0.2880458895658235,"score_spread":0.26367384023622586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110539303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16893028,0.0010762538,0.8245196,0.0002701016,0.00008089466,0.00025619622,0.000031999876,0.0010799912,0.0037546754],"genre_scores_gemma":[0.7965587,0.0003420515,0.20148532,0.000126256,0.00004267535,0.00013230694,0.00006028529,0.000108703374,0.0011437329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988431,0.00046129635,0.0000872292,0.00009901931,0.0003814223,0.00012787292],"domain_scores_gemma":[0.99825066,0.0004369328,0.00021211892,0.00030402804,0.0007130341,0.000083138126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002757482,0.0006156379,0.00032064778,0.00054165424,0.0005169811,0.0010761141,0.0010340628,0.00046103416,0.0006782186],"category_scores_gemma":[0.003199363,0.00037755852,0.00024835108,0.00042147728,0.00041014788,0.0011822393,0.00079033844,0.0007324688,0.0002594559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007917139,0.00042699277,0.0058342097,0.0003435207,0.00029009045,0.00024166539,0.0004973767,0.4227842,0.31643608,0.03721561,0.0031008518,0.21203765],"study_design_scores_gemma":[0.000079915735,0.00076985924,0.0015779037,0.000022338289,0.00014068194,0.00023775299,0.00008158034,0.8959696,0.08970581,0.0054597887,0.005911369,0.000043345055],"about_ca_topic_score_codex":0.00061653985,"about_ca_topic_score_gemma":0.000888476,"teacher_disagreement_score":0.002757482,"about_ca_system_score_codex":0.0007412173,"about_ca_system_score_gemma":0.00069830584,"threshold_uncertainty_score":0.014583111},"labels":[],"label_agreement":null},{"id":"W2110616735","doi":"10.1155/2015/105245","title":"Modeling Routing Overhead of Reactive Protocols at Link Layer and Network Layer in Wireless Multihop Networks","year":2015,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Dalhousie University","funders":"","keywords":"Computer network; Computer science; Routing protocol; Distance-vector routing protocol; Dynamic Source Routing; Flooding (psychology); Link-state routing protocol; Link layer; Ad hoc On-Demand Distance Vector Routing; Network packet; Network layer; Zone Routing Protocol; Distributed computing; Layer (electronics)","score_opus":0.037764749594988226,"score_gpt":0.26534628245159453,"score_spread":0.22758153285660632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110616735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32377854,0.0021334721,0.657721,0.0008458623,0.00020612185,0.00016867837,0.00020028262,0.00042424118,0.014521867],"genre_scores_gemma":[0.9752813,0.0006690819,0.02159468,0.000056621993,0.000043727472,0.000117990334,0.00006304363,0.000052507603,0.002121058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992717,0.00025443805,0.00003272967,0.00008629207,0.00026150158,0.00009339638],"domain_scores_gemma":[0.9975642,0.0017213314,0.0003149702,0.00016479017,0.00019535827,0.000039322553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011854464,0.00076039013,0.0003128099,0.00075328717,0.00036900907,0.00078530586,0.0013503142,0.0008535843,0.0008653129],"category_scores_gemma":[0.004699931,0.00030484863,0.00033584714,0.0005924634,0.0005042434,0.0015989578,0.00046866323,0.00055766955,0.00015938141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046393223,0.000044194567,0.00081212487,0.0000407461,0.000013920927,0.000053686515,0.000044100547,0.9780993,0.0020650274,0.012264006,0.00018185381,0.006334635],"study_design_scores_gemma":[0.0000034562024,0.000024861434,0.00021018178,0.0000043447917,0.000008719381,0.00001745659,0.000009854672,0.9969759,0.00041135898,0.0021209468,0.00020894449,0.000003968318],"about_ca_topic_score_codex":0.002837544,"about_ca_topic_score_gemma":0.0020222361,"teacher_disagreement_score":0.002837544,"about_ca_system_score_codex":0.0013119945,"about_ca_system_score_gemma":0.0005883028,"threshold_uncertainty_score":0.00951916},"labels":[],"label_agreement":null},{"id":"W2110625554","doi":"10.1109/mesh.2009.25","title":"MARE: An Efficient Reservation-Based MAC Protocol for IEEE 802.11s Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; IEEE 802.11s; Reservation; Computer science; Overhead (engineering); Protocol (science); Inter-Access Point Protocol; Multiple Access with Collision Avoidance for Wireless; IEEE 802.11; Throughput; Wireless mesh network; Wireless; Wireless network; Telecommunications; Routing protocol; Wi-Fi; Operating system; Optimized Link State Routing Protocol","score_opus":0.030578615087040704,"score_gpt":0.30827421232420144,"score_spread":0.27769559723716075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110625554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019293465,0.0027099606,0.96272457,0.0008667685,0.00067692075,0.00043704812,0.00030609206,0.00545728,0.0075279474],"genre_scores_gemma":[0.4734917,0.001822982,0.511132,0.00072443957,0.00049452356,0.0008220205,0.0008518752,0.00040132424,0.0102591505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899083,0.00031389415,0.00007557941,0.000080381695,0.0004392789,0.00010000144],"domain_scores_gemma":[0.99874425,0.00050539343,0.00019187803,0.0002750671,0.00023017284,0.00005318777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021922218,0.0005310352,0.0006785952,0.00090830016,0.00065919355,0.00093999587,0.0019560459,0.00079779926,0.0027748672],"category_scores_gemma":[0.004856196,0.00030837365,0.00038830942,0.0005498525,0.0005758629,0.002038433,0.0013288511,0.0013040875,0.0010544308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013910807,0.00043343598,0.0014875045,0.0011125343,0.0002933765,0.00084670173,0.00063516287,0.05320428,0.12283988,0.1075125,0.038833987,0.67140955],"study_design_scores_gemma":[0.00037805503,0.0012600104,0.0014029806,0.00013079931,0.0001865583,0.0024469655,0.00020909228,0.6872569,0.06453905,0.03770228,0.20420639,0.00028098468],"about_ca_topic_score_codex":0.00035714186,"about_ca_topic_score_gemma":0.00059168297,"teacher_disagreement_score":0.0027748672,"about_ca_system_score_codex":0.00027026108,"about_ca_system_score_gemma":0.0004391412,"threshold_uncertainty_score":0.011593759},"labels":[],"label_agreement":null},{"id":"W2110699188","doi":"10.1109/icc.2009.5198907","title":"Destination-Driven On-Demand Multicast Routing Protocol for Wireless Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Protocol Independent Multicast; Multicast; Computer network; Distance Vector Multicast Routing Protocol; Computer science; Xcast; Distributed computing; Source-specific multicast; Pragmatic General Multicast; IP multicast","score_opus":0.024563590930767494,"score_gpt":0.30112512282472315,"score_spread":0.27656153189395566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110699188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119695915,0.0016734157,0.97696793,0.0005395377,0.00043249092,0.00026141945,0.00013618603,0.0008203261,0.007199052],"genre_scores_gemma":[0.3994555,0.0043108915,0.57748723,0.0012095406,0.00038781468,0.0008527226,0.0014944255,0.00022778542,0.014574083],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994535,0.00015018244,0.00003295363,0.000035508572,0.00029349021,0.000034410674],"domain_scores_gemma":[0.999645,0.00008589376,0.00003860139,0.000064832915,0.00013973947,0.000025934241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000572944,0.00042765267,0.00040585786,0.0004730014,0.00060886523,0.0005861528,0.00142987,0.00065353926,0.0010480059],"category_scores_gemma":[0.0009266431,0.00017652282,0.00038044032,0.00046458605,0.00030422932,0.0008974787,0.0008977499,0.00061355025,0.0005233308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035346436,0.0002606908,0.001746766,0.0015913028,0.00025941196,0.0012443262,0.0005604319,0.07566021,0.13372958,0.19749758,0.030148165,0.556948],"study_design_scores_gemma":[0.00013446987,0.0007630867,0.0010340753,0.00014189472,0.0002500045,0.0024657361,0.00024855678,0.5854968,0.064848594,0.078706235,0.2657734,0.00013717973],"about_ca_topic_score_codex":0.000373979,"about_ca_topic_score_gemma":0.0007288018,"teacher_disagreement_score":0.00142987,"about_ca_system_score_codex":0.00038777138,"about_ca_system_score_gemma":0.00054861646,"threshold_uncertainty_score":0.0035058856},"labels":[],"label_agreement":null},{"id":"W2111095459","doi":"10.1109/twc.2011.081611.101328","title":"A Conflict Analysis Framework for QoS-Aware Routing in Contention-Based Wireless Mesh Networks with Beamforming Antennas","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Wireless network; Bandwidth (computing); Beamforming; Distributed computing; Quality of service; Wireless; Channel allocation schemes; Telecommunications","score_opus":0.04779945193524303,"score_gpt":0.2779288701692966,"score_spread":0.23012941823405358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111095459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009288728,0.00007438632,0.9985359,0.000048879443,0.000010436493,0.000018948724,0.000011219833,0.00005273679,0.00031866986],"genre_scores_gemma":[0.21558651,0.00048549823,0.7819526,0.00015237143,0.00011739235,0.00031041456,0.00011649926,0.00010500227,0.001173665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978478,0.0010219143,0.00013170773,0.00017997454,0.00066037726,0.00015821515],"domain_scores_gemma":[0.9964965,0.002492536,0.0003043793,0.0002574569,0.00036682884,0.00008231375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003679731,0.0011448828,0.0009795658,0.0017006886,0.0008537739,0.0016542737,0.0026527555,0.00105401,0.0014785778],"category_scores_gemma":[0.0069908244,0.00061465794,0.0014042805,0.001790097,0.0012369208,0.002974054,0.001621471,0.0021672824,0.00031312468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049442748,0.00006991809,0.00062581623,0.00009377271,0.000084481966,0.00017290788,0.00016587193,0.68336695,0.0037932668,0.25244135,0.0015213717,0.057614863],"study_design_scores_gemma":[0.0000053614654,0.000016527412,0.000041633797,0.00000700493,0.000010246154,0.00004115271,0.000014936471,0.9643588,0.0005195262,0.033952933,0.0010228717,0.000009023557],"about_ca_topic_score_codex":0.0018986778,"about_ca_topic_score_gemma":0.0015284271,"teacher_disagreement_score":0.003679731,"about_ca_system_score_codex":0.001317062,"about_ca_system_score_gemma":0.0013633481,"threshold_uncertainty_score":0.019460559},"labels":[],"label_agreement":null},{"id":"W2111278228","doi":"10.1109/ccece.2006.277710","title":"Integrated Routing System for Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Wireless ad hoc network; Open Shortest Path First; Backbone network; Distributed computing; Mobile ad hoc network; Shared mesh; Optimized Link State Routing Protocol; Mesh networking; Throughput; Switched mesh; Order One Network Protocol; Routing protocol; Wireless network; Routing (electronic design automation); Link-state routing protocol; Wireless; Wireless Routing Protocol; Telecommunications","score_opus":0.01006399681788617,"score_gpt":0.2147500986311148,"score_spread":0.20468610181322863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111278228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062825372,0.0022561962,0.94438165,0.000539077,0.0014410203,0.0005572247,0.00059993606,0.016557302,0.027384954],"genre_scores_gemma":[0.17113355,0.0027770277,0.7511016,0.0008138567,0.0007860317,0.0015129811,0.0056174034,0.00093119295,0.06532633],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912184,0.00021091259,0.00009270331,0.00015076304,0.00034896124,0.000074875294],"domain_scores_gemma":[0.9994287,0.00006573267,0.000039418446,0.00016070114,0.00026713795,0.00003825022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009763253,0.0004936848,0.00074949424,0.001021367,0.0005983333,0.0015153035,0.0013152669,0.00094887166,0.012424932],"category_scores_gemma":[0.001611751,0.00030144607,0.0004684379,0.00080697634,0.00033490124,0.0013979891,0.0013787125,0.0010260541,0.006308569],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000529287,0.0002073282,0.001087625,0.0006548896,0.00017554984,0.00047636483,0.0003476222,0.019175489,0.044435862,0.17135341,0.09068543,0.6708712],"study_design_scores_gemma":[0.00026764628,0.0009388739,0.0012717928,0.00018415037,0.00030508533,0.0010347652,0.000099021396,0.22953823,0.02735664,0.062119637,0.67672694,0.00015722774],"about_ca_topic_score_codex":0.0007590924,"about_ca_topic_score_gemma":0.00082033064,"teacher_disagreement_score":0.012424932,"about_ca_system_score_codex":0.0005811188,"about_ca_system_score_gemma":0.00074827106,"threshold_uncertainty_score":0.041565597},"labels":[],"label_agreement":null},{"id":"W2111322283","doi":"10.1109/icc.2006.255061","title":"Joint Optimal Channel Assignment and Congestion Control for Multi-channel Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Goodput; Computer science; Computer network; Wireless mesh network; Channel (broadcasting); Channel allocation schemes; Network congestion; Order One Network Protocol; Control channel; Wireless network; Distributed computing; Wireless; Throughput; Telecommunications; Telecommunications link","score_opus":0.0858334613397398,"score_gpt":0.31090177018964926,"score_spread":0.22506830884990947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111322283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050133593,0.0006694493,0.9472978,0.000293569,0.00007668773,0.000053172997,0.000023469407,0.00025774149,0.0011945263],"genre_scores_gemma":[0.9574901,0.00019848243,0.04140949,0.000040432165,0.000069620684,0.00007118461,0.000027459531,0.00003214621,0.0006611587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874616,0.00060003676,0.00004847297,0.00015709181,0.00024007044,0.00020823118],"domain_scores_gemma":[0.9979498,0.0012504242,0.0002838995,0.00014607303,0.00023794758,0.00013193932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024237784,0.00061664823,0.0008635523,0.00068007654,0.00067174406,0.00096644904,0.0009707836,0.00055215386,0.000717434],"category_scores_gemma":[0.0054109273,0.0004877288,0.00034561395,0.0006997368,0.0012275799,0.0014601091,0.0011957074,0.0006888936,0.00007108608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008501805,0.00003877191,0.0003503968,0.00002897331,0.000022385424,0.000022417,0.00003822756,0.9737781,0.0008581861,0.007749802,0.00046139548,0.016566165],"study_design_scores_gemma":[0.000009043864,0.000011657524,0.000047237292,0.0000010872666,0.0000036500983,0.0000035021167,0.000004635039,0.9968411,0.00014158982,0.0028538352,0.00008026863,0.0000025278794],"about_ca_topic_score_codex":0.004563806,"about_ca_topic_score_gemma":0.0036651501,"teacher_disagreement_score":0.004563806,"about_ca_system_score_codex":0.0012977064,"about_ca_system_score_gemma":0.0014119854,"threshold_uncertainty_score":0.0128183365},"labels":[],"label_agreement":null},{"id":"W2111489298","doi":"10.1109/iccitechn.2008.4803127","title":"Capacity based channel assignment in multi-interface wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless mesh network; Computer science; Channel (broadcasting); Computer network; Interference (communication); Channel allocation schemes; Switched mesh; Order One Network Protocol; Mesh networking; Shared mesh; Wireless; Wireless network; Distributed computing; Telecommunications","score_opus":0.03921446910926473,"score_gpt":0.24468489036766564,"score_spread":0.2054704212584009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111489298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023405261,0.0012208198,0.97082,0.00023147663,0.00008859593,0.000037816582,0.000039762992,0.00062156795,0.0035347156],"genre_scores_gemma":[0.8395971,0.00075670384,0.15735166,0.00010839153,0.00013570781,0.00014151704,0.00010020601,0.00009901345,0.001709624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986438,0.0006395212,0.000041079966,0.00013688112,0.00034279845,0.00019582537],"domain_scores_gemma":[0.99704176,0.0018597697,0.0002200436,0.0002892479,0.00045628977,0.00013292031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016238566,0.00047422666,0.0005006849,0.0010000379,0.00081495935,0.0010102508,0.0013816812,0.00060574396,0.0011727923],"category_scores_gemma":[0.0053465795,0.0003481936,0.000237891,0.0009008294,0.0010821909,0.0016734089,0.0011467657,0.0008454094,0.0002630549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017309409,0.00007052889,0.0009930809,0.00013431982,0.000037822207,0.00011680363,0.00015573928,0.82761925,0.0076298723,0.0493628,0.0027148763,0.11099176],"study_design_scores_gemma":[0.0000124727085,0.000029398028,0.000112874106,0.000011043032,0.000009297658,0.000040054587,0.000024840852,0.980616,0.0028358665,0.014757052,0.0015361671,0.0000148839645],"about_ca_topic_score_codex":0.002375209,"about_ca_topic_score_gemma":0.0021306581,"teacher_disagreement_score":0.002375209,"about_ca_system_score_codex":0.0011434125,"about_ca_system_score_gemma":0.00089549273,"threshold_uncertainty_score":0.008587837},"labels":[],"label_agreement":null},{"id":"W2111917509","doi":"10.1109/sahcn.2011.5984907","title":"Capacity bounds for energy efficient data streaming in homogeneous wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer network; Unicast; Multicast; Computer science; Wireless ad hoc network; Wireless network; Source-specific multicast; Distributed computing; Wireless; Telecommunications","score_opus":0.0492239064913857,"score_gpt":0.23591109750532935,"score_spread":0.18668719101394365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111917509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06720012,0.005359147,0.8948407,0.0017535699,0.00015403352,0.00017170577,0.0006314838,0.0009999184,0.02888932],"genre_scores_gemma":[0.94167006,0.0043814443,0.048353836,0.00039657165,0.00032576759,0.00057773874,0.00046970745,0.00024964492,0.0035752156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99796283,0.00053224363,0.00007615304,0.00016995192,0.0008199897,0.0004388394],"domain_scores_gemma":[0.9799325,0.016161082,0.0007217011,0.0010172144,0.0016683801,0.00049920764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036553266,0.0011403022,0.0010581742,0.0020715077,0.0011054297,0.0021821088,0.0018564395,0.0009786534,0.0040101903],"category_scores_gemma":[0.020952452,0.00051744084,0.00061641436,0.0020334667,0.00263709,0.0032635042,0.0020759483,0.0019247953,0.00063453236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001917317,0.00009499294,0.00056273246,0.0003381212,0.00004887668,0.0001703244,0.00032308255,0.7554239,0.0073816758,0.20451197,0.0043499195,0.026602687],"study_design_scores_gemma":[0.00001542616,0.00004103623,0.00030474082,0.000054547967,0.000015825177,0.00006239955,0.00007525365,0.9056167,0.0017827197,0.09070032,0.0013115412,0.000019469198],"about_ca_topic_score_codex":0.0034498053,"about_ca_topic_score_gemma":0.0025643725,"teacher_disagreement_score":0.0040101903,"about_ca_system_score_codex":0.0031535008,"about_ca_system_score_gemma":0.0012724422,"threshold_uncertainty_score":0.022880375},"labels":[],"label_agreement":null},{"id":"W2112110532","doi":"10.1109/tpds.2008.251","title":"Priority Random Linear Codes in Distributed Storage Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Node (physics); Server; Distributed computing; Salient; Computer network; Peer-to-peer; Database; Engineering","score_opus":0.019885062722108087,"score_gpt":0.2356521131636972,"score_spread":0.21576705044158911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112110532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05607601,0.0028776112,0.9289284,0.0012025341,0.00020446217,0.00019017591,0.0002199936,0.0012772136,0.009023523],"genre_scores_gemma":[0.8957859,0.0014353377,0.094245285,0.0002414485,0.00020956472,0.00028728528,0.00020620361,0.00010466267,0.007484274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981839,0.0005840651,0.000091941554,0.00017637003,0.0007384151,0.00022521893],"domain_scores_gemma":[0.9902947,0.006110787,0.0008366,0.00089637097,0.0015962345,0.00026530153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019345429,0.0006064938,0.000855824,0.00097155484,0.00080793386,0.0017645176,0.00097084837,0.0011448299,0.002767188],"category_scores_gemma":[0.011244608,0.0004321171,0.00027217536,0.0016280736,0.0016133001,0.0020552403,0.0011081288,0.0012049392,0.00071080646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034438886,0.00010288059,0.00087559497,0.00023490992,0.000027475317,0.00025385895,0.00024457966,0.6429956,0.0054559885,0.29629615,0.0042493427,0.048919298],"study_design_scores_gemma":[0.000056831293,0.00006358954,0.00010792936,0.000019728244,0.000007752239,0.000099232144,0.000032144762,0.90209687,0.0015112552,0.09425104,0.0017280683,0.000025559599],"about_ca_topic_score_codex":0.0036587198,"about_ca_topic_score_gemma":0.0023527325,"teacher_disagreement_score":0.0036587198,"about_ca_system_score_codex":0.0019405289,"about_ca_system_score_gemma":0.0018589125,"threshold_uncertainty_score":0.01407963},"labels":[],"label_agreement":null},{"id":"W2112245829","doi":"10.1109/infocom.2006.301","title":"A Brownian Motion Model for Last Encounter Routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Flooding (psychology); Computer science; Routing protocol; Routing (electronic design automation); Link-state routing protocol; Computer network; Wireless ad hoc network; Dynamic Source Routing; Brownian motion; Distributed computing; Mathematics; Wireless; Telecommunications","score_opus":0.013120861020190958,"score_gpt":0.22395292650903567,"score_spread":0.2108320654888447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112245829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035882406,0.0010662086,0.9527834,0.0014273967,0.00036628594,0.00011353514,0.000097506156,0.0002305675,0.008032751],"genre_scores_gemma":[0.8929131,0.0024290127,0.07898344,0.0010018388,0.0006762585,0.00060880167,0.0003226429,0.00013531378,0.022929601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988908,0.00030646203,0.000053002233,0.00019150323,0.00033107543,0.00022721433],"domain_scores_gemma":[0.99772805,0.0011411315,0.0004278496,0.00015395522,0.00030265766,0.00024639003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017023084,0.0011958828,0.0015523894,0.0011525254,0.00096080545,0.002054245,0.0031287516,0.0032881282,0.0032228548],"category_scores_gemma":[0.0071870373,0.00057278236,0.0013633671,0.0009250023,0.0017764077,0.0029565266,0.0012794136,0.0025034205,0.0010970947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072547824,0.000090975576,0.0007280826,0.00007273154,0.000057998477,0.00047575103,0.00017435414,0.53787875,0.0059853275,0.44556728,0.003070426,0.0058257165],"study_design_scores_gemma":[0.000025651518,0.00005025706,0.00009438003,0.00000764979,0.00001364542,0.00006056669,0.000010112533,0.97024304,0.00022400565,0.028112799,0.0011313546,0.000026632157],"about_ca_topic_score_codex":0.0027344625,"about_ca_topic_score_gemma":0.00092162983,"teacher_disagreement_score":0.0032881282,"about_ca_system_score_codex":0.0012654002,"about_ca_system_score_gemma":0.00081917254,"threshold_uncertainty_score":0.010781527},"labels":[],"label_agreement":null},{"id":"W2112420524","doi":"10.1109/aina.2009.69","title":"Fair Scheduling with Multiple Gateways in Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Round-robin scheduling; Distributed computing; Fair-share scheduling; Scheduling (production processes); Wireless mesh network; Dynamic priority scheduling; Maximum throughput scheduling; Two-level scheduling; Rate-monotonic scheduling; Computer network; Wireless; Wireless network; Mathematical optimization; Quality of service; Telecommunications; Mathematics","score_opus":0.009433420971529586,"score_gpt":0.2153021884876458,"score_spread":0.2058687675161162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112420524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030078901,0.0011921063,0.9658812,0.00029648867,0.00024030771,0.00011001123,0.000023874172,0.0004915779,0.0016855847],"genre_scores_gemma":[0.71624696,0.00090412266,0.2797638,0.00013045149,0.00036667835,0.00017530611,0.000056665514,0.00007765627,0.0022784388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980878,0.0009558983,0.0000955004,0.00023008103,0.00045450768,0.00017611188],"domain_scores_gemma":[0.9971739,0.0018144156,0.00017990496,0.00047645165,0.00021017822,0.0001452427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059833894,0.0005491082,0.0009994484,0.0011219815,0.0014227099,0.0013932522,0.0016269223,0.0009243429,0.00091323175],"category_scores_gemma":[0.008280752,0.00048486638,0.0005472095,0.001334793,0.0016882047,0.0030361575,0.0015277257,0.0008363836,0.00019463841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077463756,0.00016049824,0.001459333,0.00021222449,0.000116386844,0.0003452795,0.00046279308,0.5894831,0.00910858,0.20707554,0.0033955676,0.18740602],"study_design_scores_gemma":[0.00007605158,0.00016287698,0.0002177667,0.00001871151,0.000035763565,0.0000780149,0.000052826603,0.9082814,0.00331597,0.08324227,0.004492938,0.000025446363],"about_ca_topic_score_codex":0.0018938368,"about_ca_topic_score_gemma":0.0017604722,"teacher_disagreement_score":0.0059833894,"about_ca_system_score_codex":0.0012745035,"about_ca_system_score_gemma":0.0014342319,"threshold_uncertainty_score":0.03164351},"labels":[],"label_agreement":null},{"id":"W2112698107","doi":"10.1145/1089803.1089965","title":"Topology control for balanced energy consumption in emergency wireless deployments","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Topology control; Computer science; Wireless ad hoc network; Topology (electrical circuits); Computer network; Mobile ad hoc network; Control reconfiguration; Network topology; Distributed computing; Node (physics); Energy consumption; Wireless network; Optimized Link State Routing Protocol; Wireless; Key distribution in wireless sensor networks; Mathematics; Telecommunications; Network packet; Engineering","score_opus":0.013497717620459336,"score_gpt":0.26249598544693187,"score_spread":0.24899826782647252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112698107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12755676,0.00052304723,0.8656853,0.00030076518,0.000057380148,0.00008824562,0.000087877605,0.00057644135,0.0051241033],"genre_scores_gemma":[0.97006816,0.00018098523,0.02883565,0.000032351345,0.000013011228,0.00005942338,0.00005239646,0.00005716833,0.00070080557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.000112954585,0.000018217292,0.000058615326,0.000087765744,0.00006178838],"domain_scores_gemma":[0.9993716,0.00034912387,0.00009143204,0.00006400407,0.000085725595,0.00003811578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005017168,0.00047022675,0.0005543565,0.0004075391,0.00034121663,0.0005581649,0.0007129306,0.00038601982,0.0009775022],"category_scores_gemma":[0.0022313963,0.00025685286,0.00023284506,0.0003850319,0.00049078086,0.0010860582,0.0007106537,0.00040735267,0.00015285402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001291475,0.000042598404,0.00050482067,0.00007455306,0.000018631212,0.00012636557,0.00009106356,0.95045066,0.014049434,0.010626324,0.0007313273,0.023155235],"study_design_scores_gemma":[0.000018364897,0.00007369395,0.00029698605,0.000005747553,0.0000076072224,0.00005328253,0.000030179714,0.9916843,0.0023757967,0.004561244,0.00088567234,0.000007193457],"about_ca_topic_score_codex":0.00066761,"about_ca_topic_score_gemma":0.0006275501,"teacher_disagreement_score":0.0009775022,"about_ca_system_score_codex":0.0003916811,"about_ca_system_score_gemma":0.000282143,"threshold_uncertainty_score":0.0032700896},"labels":[],"label_agreement":null},{"id":"W2112731217","doi":"10.1007/978-3-642-31770-5_3","title":"Stretch Factor in Wireless Sensor Networks with Directional Antennae","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Omnidirectional antenna; Computer science; Antenna (radio); Wireless sensor network; Orientation (vector space); Directional antenna; Transmission (telecommunications); Wireless; Telecommunications; Computer network; Geometry; Mathematics","score_opus":0.012805181829521799,"score_gpt":0.22119193616409913,"score_spread":0.20838675433457732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112731217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051223032,0.029368024,0.8934032,0.00064675324,0.0004911679,0.000051147294,0.00008408062,0.0004090381,0.024323585],"genre_scores_gemma":[0.8719142,0.022610037,0.08492686,0.000114876406,0.0006567207,0.00012282551,0.00011297177,0.00017899781,0.019362466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969316,0.000086374166,0.000011877961,0.000059152397,0.000120220495,0.00002922888],"domain_scores_gemma":[0.9994357,0.00037811583,0.00004511318,0.00005796681,0.000059999966,0.00002299857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043166117,0.000565443,0.0005207597,0.0005036417,0.0002559003,0.0005059458,0.00065235444,0.00056975585,0.0020477185],"category_scores_gemma":[0.002066519,0.00029648776,0.00023299985,0.0009387558,0.0007985051,0.0015395324,0.0006306917,0.00077989354,0.00036461858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022987908,0.000087582295,0.0010385882,0.0007367363,0.000049211656,0.00023775073,0.00021606653,0.42229113,0.038866054,0.20798576,0.004671707,0.3235895],"study_design_scores_gemma":[0.000023930075,0.00024102989,0.0011323517,0.00008704526,0.000028408615,0.00048365837,0.00014590133,0.7943436,0.006570688,0.18158273,0.015309319,0.000051273753],"about_ca_topic_score_codex":0.00055077096,"about_ca_topic_score_gemma":0.0004253302,"teacher_disagreement_score":0.0020477185,"about_ca_system_score_codex":0.00066262926,"about_ca_system_score_gemma":0.00021533734,"threshold_uncertainty_score":0.006850302},"labels":[],"label_agreement":null},{"id":"W2113041149","doi":"10.1109/ntms.2011.5720618","title":"Mobility Assisted Routing in Mobile Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; DSRFLOW; Packet loss; Network packet; Source routing; Routing protocol; End-to-end delay; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Wireless; Telecommunications","score_opus":0.028028588816414516,"score_gpt":0.24259453110044987,"score_spread":0.21456594228403536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113041149","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00977474,0.030099371,0.9300743,0.0017419452,0.0018567365,0.0003442195,0.00013086373,0.0026746618,0.023303218],"genre_scores_gemma":[0.33988234,0.039615914,0.5878803,0.00079284166,0.0015898589,0.00066285796,0.00078940956,0.00028072365,0.028505784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993901,0.00025052784,0.000036478763,0.00005529655,0.00023519881,0.000032432385],"domain_scores_gemma":[0.9995802,0.00013982438,0.000053075855,0.0000809236,0.00012492987,0.000021112277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005960825,0.000660152,0.000534244,0.0006657233,0.000565646,0.0010187732,0.0011397669,0.0008755324,0.0013981262],"category_scores_gemma":[0.0013413676,0.00031829224,0.0003903794,0.0011247188,0.0004926888,0.0016027794,0.00095877994,0.0008788991,0.0012194873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011338089,0.00007897347,0.0011412591,0.00082674157,0.00015900056,0.00063642574,0.0002748916,0.086761914,0.016354008,0.09210535,0.019983118,0.78156507],"study_design_scores_gemma":[0.00009432193,0.0004809315,0.0013380336,0.0003867267,0.00021366896,0.0025117458,0.00023918267,0.4223588,0.012422993,0.100236446,0.4595517,0.00016550091],"about_ca_topic_score_codex":0.0006518451,"about_ca_topic_score_gemma":0.00071367965,"teacher_disagreement_score":0.0013981262,"about_ca_system_score_codex":0.000352106,"about_ca_system_score_gemma":0.00045081915,"threshold_uncertainty_score":0.0046771765},"labels":[],"label_agreement":null},{"id":"W2113082301","doi":"10.1109/ccece.2002.1012948","title":"ACAN - Ad hoc Context Aware Network","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"University of Ottawa","keywords":"Computer science; Context (archaeology); Wireless ad hoc network; Protocol stack; Computer network; Service discovery; Provisioning; Service (business); Distributed computing; Human–computer interaction; Wireless sensor network; Wireless; World Wide Web; Telecommunications; Web service","score_opus":0.013337024068964387,"score_gpt":0.22560814004035254,"score_spread":0.21227111597138815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113082301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017722348,0.01231327,0.85956186,0.0025774166,0.0021622344,0.001110185,0.0005975262,0.008116023,0.09583911],"genre_scores_gemma":[0.49815977,0.009579568,0.43568596,0.0027818696,0.00085908006,0.0012791377,0.0018289553,0.0002156254,0.04961006],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923825,0.00018609015,0.00005776719,0.00014706419,0.00028888718,0.00008201772],"domain_scores_gemma":[0.99942267,0.00012863213,0.000047843092,0.00008830536,0.00023813496,0.0000744037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071536266,0.0005217059,0.00045759458,0.00075015024,0.0013243216,0.0019618538,0.0014208826,0.0010938758,0.0029298088],"category_scores_gemma":[0.0016571854,0.00025420196,0.0002812055,0.0007743204,0.00045588176,0.0022565639,0.0016320514,0.0010715189,0.0012688937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004061342,0.00019845093,0.0022936782,0.00094284554,0.000111419766,0.0009618335,0.00046615722,0.04883007,0.020978095,0.255414,0.08431766,0.5850796],"study_design_scores_gemma":[0.00006671116,0.00022397701,0.00087878155,0.00025010578,0.0001333303,0.0014458952,0.00028193847,0.33572298,0.013028465,0.08441079,0.5634556,0.000101610094],"about_ca_topic_score_codex":0.0034038026,"about_ca_topic_score_gemma":0.0048704995,"teacher_disagreement_score":0.0034038026,"about_ca_system_score_codex":0.00080280117,"about_ca_system_score_gemma":0.0012754975,"threshold_uncertainty_score":0.009801209},"labels":[],"label_agreement":null},{"id":"W2113324328","doi":"10.1007/978-3-540-28634-9_23","title":"Progress Based Localized Power and Cost Aware Routing Algorithms for Ad Hoc and Sensor Wireless Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Network packet; Routing (electronic design automation); Node (physics); Geographic routing; Mobile ad hoc network; Shortest path problem; Algorithm; Path (computing); Power (physics); Wireless; Routing algorithm; Routing protocol; Dynamic Source Routing; Theoretical computer science; Telecommunications","score_opus":0.013640820818336888,"score_gpt":0.250059138114633,"score_spread":0.2364183172962961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113324328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018129993,0.0019414581,0.9748594,0.00027493955,0.0002247568,0.00010034027,0.00006565419,0.0013347913,0.0030686734],"genre_scores_gemma":[0.46562582,0.0026555008,0.5095337,0.0001329528,0.00038758598,0.0003050506,0.0003409599,0.00036652916,0.020651901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999453,0.00010205454,0.00003382097,0.000090696936,0.0002663792,0.000054025553],"domain_scores_gemma":[0.99800164,0.0009883193,0.0001591655,0.00028380327,0.00048253432,0.000084475345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529216,0.0015302546,0.0013832524,0.0015033954,0.00079683587,0.0011001927,0.0027832892,0.0008508717,0.0028143465],"category_scores_gemma":[0.0041263816,0.00048451967,0.00044824896,0.0013656757,0.00091502466,0.0034798572,0.0017596085,0.0014656507,0.0007776613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056994846,0.00019297432,0.0008795761,0.00026200747,0.000055265038,0.00007413192,0.00023155507,0.5062857,0.00909631,0.057018198,0.007473075,0.41786122],"study_design_scores_gemma":[0.000040446834,0.00016924682,0.0002212417,0.000016823966,0.000030606992,0.00006303705,0.00005038459,0.96890175,0.0038255474,0.023325406,0.0033408748,0.000014556431],"about_ca_topic_score_codex":0.001215164,"about_ca_topic_score_gemma":0.0021796527,"teacher_disagreement_score":0.0028143465,"about_ca_system_score_codex":0.000995505,"about_ca_system_score_gemma":0.00070332503,"threshold_uncertainty_score":0.009414971},"labels":[],"label_agreement":null},{"id":"W2113489641","doi":"10.1109/lcn.2009.5355161","title":"Maximizing the lifetime of wireless sensor networks through domatic partition","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Dominating set; Disjoint sets; Wireless sensor network; Computer science; Partition (number theory); Unit disk; Partition problem; Connected dominating set; Computer network; Graph; Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.012503161229361293,"score_gpt":0.23190588565876824,"score_spread":0.21940272442940695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113489641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14113204,0.0019836114,0.8471041,0.0011362047,0.00007769727,0.00021118815,0.00023100509,0.00065044954,0.007473755],"genre_scores_gemma":[0.7293275,0.0011738507,0.26554352,0.00024707496,0.000085332904,0.00031659708,0.00039290002,0.00015788636,0.0027553458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868864,0.0006700265,0.00006936593,0.00023022192,0.00021182315,0.00012996726],"domain_scores_gemma":[0.9966108,0.0019600422,0.00036515878,0.000533677,0.00031355754,0.00021666326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018229584,0.0008152463,0.0009914984,0.0014136637,0.0011992782,0.0015328008,0.0014084713,0.0009145553,0.0010013512],"category_scores_gemma":[0.0076579275,0.0006142234,0.00041090476,0.0015016376,0.0011573976,0.00507133,0.0029421118,0.0007194353,0.0003288704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716447,0.00018691743,0.0024388689,0.00037221468,0.00008313497,0.0001745239,0.00074334495,0.6947341,0.019493971,0.071444556,0.0068209465,0.20273577],"study_design_scores_gemma":[0.00005097744,0.00018351275,0.0005194049,0.00003568866,0.000029803128,0.0002333698,0.00029727296,0.8711326,0.0070564924,0.11545822,0.004970785,0.000031936786],"about_ca_topic_score_codex":0.00045618502,"about_ca_topic_score_gemma":0.00087556615,"teacher_disagreement_score":0.0018229584,"about_ca_system_score_codex":0.0009182076,"about_ca_system_score_gemma":0.0006569896,"threshold_uncertainty_score":0.0096408725},"labels":[],"label_agreement":null},{"id":"W2113671168","doi":"10.1109/icc.2002.997416","title":"Ad hoc networks with smart antennas using IEEE 802.11-based protocols","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Computer network; Omnidirectional antenna; Smart antenna; Directional antenna; Wireless ad hoc network; Antenna (radio); Wireless; Telecommunications","score_opus":0.028018497794572376,"score_gpt":0.2647172559180929,"score_spread":0.23669875812352054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113671168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020089312,0.003493239,0.9514137,0.0009867914,0.00035591706,0.0003662805,0.00005902212,0.0013699303,0.021865828],"genre_scores_gemma":[0.5692545,0.008688707,0.40326202,0.0006501793,0.00057639764,0.0010715444,0.0002600835,0.00009578875,0.01614076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814785,0.00076442334,0.00011228846,0.00013341263,0.000713628,0.00012839517],"domain_scores_gemma":[0.998164,0.00082725513,0.00028563407,0.00035175565,0.00030536036,0.000066119086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018056836,0.001009761,0.00059972215,0.000755171,0.0008901181,0.0025540483,0.00140306,0.0013582626,0.0022805366],"category_scores_gemma":[0.0052320496,0.00061069534,0.00042096426,0.0015355254,0.0012310839,0.0045638992,0.0017698624,0.0015241811,0.0008071309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023931004,0.0002668864,0.002834635,0.0005341066,0.00024375858,0.0005323451,0.00043502887,0.4240283,0.013937884,0.23704846,0.012414828,0.30748448],"study_design_scores_gemma":[0.00015553554,0.000371811,0.0006394447,0.00014904891,0.00017505519,0.0006829214,0.0001408549,0.7960558,0.008893771,0.10366231,0.08898665,0.00008684425],"about_ca_topic_score_codex":0.0010150917,"about_ca_topic_score_gemma":0.0013491156,"teacher_disagreement_score":0.0025540483,"about_ca_system_score_codex":0.0006130446,"about_ca_system_score_gemma":0.0006931376,"threshold_uncertainty_score":0.009549439},"labels":[],"label_agreement":null},{"id":"W2113689857","doi":"10.1109/iscc.2011.5983906","title":"Towards cellular IP address assignment in wireless heterogeneous sensor networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Blocking (statistics); Computer network; Acknowledgement; Computer science; Base station; Scheme (mathematics); IP address management; Wireless; Call blocking; Wireless sensor network; Base (topology); Distributed computing; Internet Protocol; Telecommunications; Quality of service; The Internet; Mathematics","score_opus":0.027224667756963666,"score_gpt":0.22302306072898237,"score_spread":0.1957983929720187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113689857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033667177,0.000840989,0.96265155,0.00029577725,0.00007773575,0.000026652593,0.00001151415,0.00016047426,0.0022682657],"genre_scores_gemma":[0.8132597,0.001159479,0.1826499,0.00022816802,0.00011166314,0.00008183961,0.00006169901,0.000023823908,0.002423717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999632,0.00015830151,0.00001532219,0.000047325386,0.00009496873,0.000052017032],"domain_scores_gemma":[0.99946684,0.00017605288,0.0000512854,0.00010383041,0.00015123842,0.000050820818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006521766,0.0002624792,0.00029056837,0.0004915351,0.00037098504,0.00081962586,0.0006479757,0.00047160237,0.0005061038],"category_scores_gemma":[0.0017260103,0.00011218306,0.00019082919,0.0007436395,0.00053842965,0.00093405833,0.00097277557,0.00063373183,0.00019672605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020714826,0.000113748974,0.0034953787,0.00017984792,0.000065546315,0.00038414783,0.00049455516,0.40743768,0.037670422,0.22730125,0.0033464455,0.31930375],"study_design_scores_gemma":[0.0000117532945,0.00006557006,0.00046114542,0.000014747686,0.000021623699,0.00009000565,0.00013533617,0.938502,0.006902415,0.04136481,0.01241776,0.000012897369],"about_ca_topic_score_codex":0.001868615,"about_ca_topic_score_gemma":0.0012261441,"teacher_disagreement_score":0.001868615,"about_ca_system_score_codex":0.00042212903,"about_ca_system_score_gemma":0.0003456662,"threshold_uncertainty_score":0.0037154555},"labels":[],"label_agreement":null},{"id":"W2113776659","doi":"10.1145/1089803.1089983","title":"Efficient deafness avoidance in wireless ad hoc and sensor networks with directional antennas","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Throughput; Wireless sensor network; Mobile ad hoc network; Wireless; Scheme (mathematics); Wireless network; Ad hoc wireless distribution service; Directional antenna; Optimized Link State Routing Protocol; Telecommunications; Network packet; Mathematics","score_opus":0.005719719424832318,"score_gpt":0.20231939381723008,"score_spread":0.19659967439239776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113776659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2513595,0.0029589068,0.74134374,0.00022107262,0.00008242364,0.000050108312,0.000033032575,0.00037598802,0.0035753332],"genre_scores_gemma":[0.92402864,0.0014545002,0.07174072,0.000098213844,0.000042906533,0.00003798916,0.000036903883,0.000016176695,0.0025439141],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999652,0.00014549718,0.000019110028,0.000036390047,0.0001076111,0.000039409362],"domain_scores_gemma":[0.999371,0.00028053718,0.000097243676,0.00008997207,0.00013058788,0.000030696116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000596457,0.0004190894,0.00035073105,0.00044869547,0.0004061435,0.00045763038,0.0004611377,0.0003712327,0.00035583868],"category_scores_gemma":[0.0017014213,0.0002577426,0.00016611321,0.0003810577,0.0005264876,0.0008780567,0.00068211433,0.00029283488,0.00014428546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041048002,0.00016573096,0.0048328578,0.00047083714,0.00012161071,0.0004628144,0.00045779554,0.3797372,0.19289911,0.0390291,0.0020575956,0.37935486],"study_design_scores_gemma":[0.00006821799,0.0007462235,0.002971834,0.00004262903,0.00009174974,0.00089841423,0.00027009315,0.9044712,0.051654767,0.029459875,0.009268723,0.00005626528],"about_ca_topic_score_codex":0.0005748848,"about_ca_topic_score_gemma":0.00091443205,"teacher_disagreement_score":0.000596457,"about_ca_system_score_codex":0.00024109184,"about_ca_system_score_gemma":0.00044616414,"threshold_uncertainty_score":0.0031544566},"labels":[],"label_agreement":null},{"id":"W2114429354","doi":"10.1504/ijaacs.2009.024284","title":"Energy-efficient routing in mobile ad hoc networks: a cautionary tale","year":2009,"lang":"en","type":"article","venue":"International Journal of Autonomous and Adaptive Communications Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Optimized Link State Routing Protocol; Wireless Routing Protocol; Link-state routing protocol; Zone Routing Protocol; Dynamic Source Routing; Distributed computing; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Routing (electronic design automation)","score_opus":0.016862807541975854,"score_gpt":0.2606780453091635,"score_spread":0.24381523776718764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114429354","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044062706,0.12940718,0.057721168,0.76298785,0.034352113,0.00007139737,0.00016654316,0.0005435942,0.01034385],"genre_scores_gemma":[0.121598944,0.21165043,0.12954426,0.37842014,0.11913709,0.00041224947,0.00016733579,0.00076212204,0.038307466],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949189,0.0020228755,0.0004259977,0.00055781036,0.0019433814,0.00013096107],"domain_scores_gemma":[0.9729053,0.019655993,0.00068531226,0.0026863217,0.0037373363,0.00032975682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076949657,0.0011361197,0.0015818727,0.0010156657,0.0023194763,0.005442049,0.0044882186,0.0068426244,0.0016861567],"category_scores_gemma":[0.031837154,0.0005194222,0.0008475719,0.0015636985,0.009984965,0.013201294,0.002777913,0.026019495,0.002794604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004104782,0.00017619706,0.0024634767,0.0029052298,0.00043449324,0.0019014172,0.0018617031,0.0096845515,0.0074071772,0.2511953,0.43727243,0.2842876],"study_design_scores_gemma":[0.00007226058,0.00037539468,0.001289365,0.0012938618,0.000114246126,0.0021981872,0.0010597905,0.0076960195,0.0028046365,0.4557319,0.5271332,0.00023114542],"about_ca_topic_score_codex":0.0019048159,"about_ca_topic_score_gemma":0.0028611217,"teacher_disagreement_score":0.0076949657,"about_ca_system_score_codex":0.0011368932,"about_ca_system_score_gemma":0.0007999163,"threshold_uncertainty_score":0.04069531},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; 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","score_opus":0.125124470151401,"score_gpt":0.325821351399581,"score_spread":0.20069688124818003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114470741","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030648382,0.48092002,0.4733367,0.0027463315,0.0031197986,0.0006687851,0.00033365464,0.0012258599,0.034584034],"genre_scores_gemma":[0.0371786,0.6495038,0.2808904,0.0037007679,0.0053790626,0.0021207666,0.001187116,0.00046563518,0.019573823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9968918,0.0007693936,0.00049841043,0.00031292828,0.0013206392,0.00020688504],"domain_scores_gemma":[0.99637514,0.0021116526,0.00022741113,0.00033351136,0.00087934936,0.000072878756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023683277,0.0021195747,0.0018415361,0.0033309022,0.0011699259,0.0031385631,0.0030771932,0.0026320242,0.004975952],"category_scores_gemma":[0.0065801144,0.0013242395,0.0010988871,0.006770171,0.0010192124,0.005604554,0.0016732041,0.0037945712,0.004354182],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010796434,0.0002025745,0.0006591774,0.0051425924,0.000112198686,0.00031683527,0.00039702354,0.01110265,0.0055208458,0.08646852,0.0462282,0.84374154],"study_design_scores_gemma":[0.00003916792,0.00031957545,0.0008157074,0.0027792354,0.00016689944,0.0019929763,0.00023082586,0.035854027,0.0043478203,0.059605822,0.89370984,0.00013815842],"about_ca_topic_score_codex":0.0011445845,"about_ca_topic_score_gemma":0.00075535814,"teacher_disagreement_score":0.004975952,"about_ca_system_score_codex":0.0012611547,"about_ca_system_score_gemma":0.0014381455,"threshold_uncertainty_score":0.016646206},"labels":[],"label_agreement":null},{"id":"W2114518857","doi":"10.1109/sahcn.2006.288564","title":"Mobility Metrics for Adaptive Routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mobility model; Computer science; Computer network; Routing protocol; Link-state routing protocol; Node (physics); Dynamic Source Routing; Optimized Link State Routing Protocol; Static routing; Metrics; Routing (electronic design automation); Distributed computing; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Metric (unit); Engineering","score_opus":0.022758551030399587,"score_gpt":0.2465064868324416,"score_spread":0.22374793580204203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114518857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040682205,0.028235344,0.948508,0.001607977,0.0017897295,0.00026429657,0.00081076304,0.001210846,0.01350473],"genre_scores_gemma":[0.19284126,0.026264338,0.7611101,0.0010376462,0.0030692557,0.0014286916,0.002587506,0.0007228445,0.010938395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808806,0.0007206883,0.00018479477,0.00026897996,0.0006402048,0.00009718165],"domain_scores_gemma":[0.99691087,0.0012062741,0.00058743986,0.0005105911,0.000663865,0.000121049816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015907851,0.0018224386,0.0011131533,0.00302617,0.000611992,0.0015981824,0.0015703224,0.0012715905,0.003171329],"category_scores_gemma":[0.011577472,0.0003392148,0.00064860133,0.003870654,0.0008908848,0.0036851906,0.0016647752,0.0022375316,0.0018844042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008308803,0.000060912043,0.0015071722,0.00067295204,0.00010117063,0.00030034373,0.0002325588,0.06384536,0.0067077964,0.57396257,0.030892579,0.32163352],"study_design_scores_gemma":[0.000038801474,0.0002320793,0.0019182476,0.00044275436,0.00008931077,0.0014949238,0.00016801663,0.22068502,0.0030388895,0.49695623,0.2747885,0.00014729281],"about_ca_topic_score_codex":0.0010590233,"about_ca_topic_score_gemma":0.00070005766,"teacher_disagreement_score":0.003171329,"about_ca_system_score_codex":0.0007067446,"about_ca_system_score_gemma":0.00057529565,"threshold_uncertainty_score":0.01060915},"labels":[],"label_agreement":null},{"id":"W2114604542","doi":"10.1109/iwcmc.2008.108","title":"Minimum Interference Channel Assignment for Multicast in Multi-Radio Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer network; Computer science; Source-specific multicast; Wireless mesh network; Pragmatic General Multicast; Xcast; Protocol Independent Multicast; Channel (broadcasting); Shared mesh; Distributed computing; Wireless network; Switched mesh; Wireless; Telecommunications","score_opus":0.04394995360345632,"score_gpt":0.26327460351188164,"score_spread":0.21932464990842532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114604542","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01844867,0.0006730697,0.9788014,0.00016933214,0.00004474237,0.000041928393,0.000025684756,0.00018147916,0.0016137173],"genre_scores_gemma":[0.57564384,0.00091950723,0.4214544,0.0000967854,0.0001404058,0.00023486496,0.00013336554,0.00007511004,0.0013017907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993143,0.0003531643,0.00002169153,0.000057282767,0.00017278179,0.000080804304],"domain_scores_gemma":[0.9988232,0.0008386828,0.00008259507,0.00008472262,0.0001353524,0.000035288624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090227893,0.00039165313,0.0005241832,0.00060473644,0.0007773934,0.0005174621,0.0007321083,0.00054557115,0.0013695075],"category_scores_gemma":[0.003357255,0.00019564242,0.0002995084,0.0007152444,0.0005032857,0.00095965917,0.0007343135,0.00056125,0.0001838822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024627306,0.000103614104,0.000977608,0.00019674395,0.00004476159,0.000100363424,0.00014156185,0.7892491,0.0060843085,0.043682523,0.0035884841,0.15558459],"study_design_scores_gemma":[0.000021512404,0.000043660297,0.00011986452,0.000010669835,0.000009270733,0.000042166466,0.000022790813,0.98165923,0.0015228953,0.015323408,0.001216942,0.000007541222],"about_ca_topic_score_codex":0.0012978715,"about_ca_topic_score_gemma":0.0013304314,"teacher_disagreement_score":0.0013695075,"about_ca_system_score_codex":0.00067388825,"about_ca_system_score_gemma":0.00063538016,"threshold_uncertainty_score":0.0048894286},"labels":[],"label_agreement":null},{"id":"W2114699420","doi":"10.1109/iscc.2008.4625697","title":"Optimal number and class selection of nodes in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Computer science; Network topology; Wireless network; Node (physics); Order One Network Protocol; Throughput; Reliability (semiconductor); Computer network; Mesh networking; Distributed computing; Mathematical optimization; Topology (electrical circuits); Wireless; Power (physics); Mathematics; Engineering","score_opus":0.010604714710197234,"score_gpt":0.22631226867622367,"score_spread":0.21570755396602645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114699420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25223982,0.00032170807,0.7420373,0.00026345212,0.000026907064,0.00009724841,0.00009588252,0.00010601543,0.0048116418],"genre_scores_gemma":[0.92659926,0.00018084112,0.07211708,0.000022521877,0.000011659628,0.000061967396,0.000042194984,0.000028049999,0.00093641755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941635,0.00025330516,0.000018701588,0.00008805974,0.00009444378,0.00012908096],"domain_scores_gemma":[0.99876946,0.0007980087,0.00020779524,0.00006272423,0.00009864726,0.00006326696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541049,0.00033115264,0.00050414057,0.0006003493,0.0004204373,0.00063152413,0.00076695246,0.00044761697,0.0010657503],"category_scores_gemma":[0.005075306,0.0003469004,0.0002642618,0.00050801,0.00067609857,0.001446945,0.00044216576,0.00035805927,0.00011697387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083162384,0.000035153982,0.0008800003,0.000041766616,0.000010313561,0.00003531544,0.000043010565,0.954548,0.002556729,0.025221866,0.00038595716,0.016158717],"study_design_scores_gemma":[0.00000868579,0.000032252825,0.00023702801,0.000005538374,0.000003826564,0.000013265891,0.000040036182,0.9840289,0.0010269874,0.014355597,0.00024265985,0.0000052439973],"about_ca_topic_score_codex":0.0020454272,"about_ca_topic_score_gemma":0.0026041276,"teacher_disagreement_score":0.0020454272,"about_ca_system_score_codex":0.0010821822,"about_ca_system_score_gemma":0.00072857685,"threshold_uncertainty_score":0.008149922},"labels":[],"label_agreement":null},{"id":"W2114706314","doi":"10.1109/wimob.2006.1696340","title":"An Evaluation Study of a Fair Energy-Efficient Technique for Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Energy consumption; Computer network; Idle; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Energy conservation; Distributed computing; Routing (electronic design automation); Efficient energy use; Energy (signal processing); Complement (music); Routing protocol; Wireless; Engineering; Telecommunications","score_opus":0.012997871699623133,"score_gpt":0.27394601304258714,"score_spread":0.260948141342964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114706314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4165706,0.006334072,0.5555405,0.0005688956,0.00054158375,0.0010421098,0.0001395067,0.0009808405,0.01828195],"genre_scores_gemma":[0.9239317,0.0006214171,0.07351841,0.00006210891,0.00010957518,0.00013786694,0.000070599985,0.000059851118,0.0014883972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99343127,0.0024204613,0.00015054145,0.00040350948,0.0032292076,0.0003650031],"domain_scores_gemma":[0.98277044,0.012435963,0.000680824,0.0015244419,0.0022842868,0.00030411445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072647003,0.0008673064,0.0006779055,0.0015387359,0.0012343492,0.00108822,0.0013190103,0.0008352896,0.0013663898],"category_scores_gemma":[0.024643924,0.0001533669,0.0003709014,0.001398067,0.00084475067,0.0025085125,0.0005951475,0.0006440016,0.00016809229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029164546,0.0015199679,0.008634316,0.00088562566,0.00035154424,0.00035741602,0.0006967274,0.32576698,0.08249115,0.05622194,0.0033120962,0.5168458],"study_design_scores_gemma":[0.00020524171,0.006214054,0.0053299125,0.0000929735,0.00021740432,0.0008064877,0.0003162368,0.92055947,0.044914678,0.011187164,0.010063254,0.00009311654],"about_ca_topic_score_codex":0.0017562013,"about_ca_topic_score_gemma":0.0015822343,"teacher_disagreement_score":0.0072647003,"about_ca_system_score_codex":0.0016203028,"about_ca_system_score_gemma":0.0010081049,"threshold_uncertainty_score":0.038419902},"labels":[],"label_agreement":null},{"id":"W2114776857","doi":"10.1109/glocom.2009.5425228","title":"Adaptive Probabilistic Medium Access in MPR-Capable Ad-Hoc Wireless Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Multiple Access with Collision Avoidance for Wireless; Ad hoc wireless distribution service; Network packet; Aloha; Random access; Probabilistic logic; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Stochastic geometry models of wireless networks; Mobile ad hoc network; Wireless network; Wireless; Transmission (telecommunications); Throughput; Telecommunications; Routing protocol","score_opus":0.01918527115189082,"score_gpt":0.2547745549380247,"score_spread":0.2355892837861339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114776857","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042323034,0.0019110327,0.9505604,0.00022818678,0.000054793974,0.00008639544,0.000021452717,0.00034998733,0.004464852],"genre_scores_gemma":[0.9042218,0.0014314998,0.09237387,0.00007411852,0.0000858361,0.00012726347,0.000027074155,0.000029705157,0.0016289926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99837506,0.00083440257,0.000042477528,0.00009419882,0.00056747114,0.00008635947],"domain_scores_gemma":[0.99700063,0.0022404813,0.00022691418,0.00020233967,0.00029102425,0.00003860509],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019474206,0.00049415504,0.00060631026,0.00052897277,0.0006669616,0.0008261348,0.0012450733,0.000774737,0.00068418996],"category_scores_gemma":[0.0056911665,0.00036206882,0.0002948801,0.0007991353,0.0012530329,0.0015871329,0.00083801453,0.00065299356,0.00021329167],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014518824,0.00006680974,0.0008993077,0.0002405019,0.000041210133,0.00043618595,0.00016005074,0.8756587,0.010570626,0.06589171,0.0008048636,0.045084767],"study_design_scores_gemma":[0.000025336603,0.00014865736,0.00018506672,0.000010543149,0.000019775684,0.00024435145,0.000025193001,0.9824885,0.0013249869,0.014410689,0.0010934771,0.000023356937],"about_ca_topic_score_codex":0.0011756255,"about_ca_topic_score_gemma":0.0011988853,"teacher_disagreement_score":0.0019474206,"about_ca_system_score_codex":0.00048268156,"about_ca_system_score_gemma":0.00048055482,"threshold_uncertainty_score":0.010299027},"labels":[],"label_agreement":null},{"id":"W2114800945","doi":"10.1109/icw.2005.34","title":"Characterizing the Impact of Routing Holes on Geographic Routing","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Link-state routing protocol; Static routing; Dynamic Source Routing; Computer science; Equal-cost multi-path routing; Multipath routing; Computer network; Destination-Sequenced Distance Vector routing; Zone Routing Protocol; Geographic routing; Routing (electronic design automation); Distributed computing; Routing protocol","score_opus":0.014739506605369606,"score_gpt":0.2577439717135741,"score_spread":0.2430044651082045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114800945","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9553719,0.0005274408,0.041669037,0.00018952476,0.00001601463,0.000064987296,0.00010271091,0.0001278214,0.0019305834],"genre_scores_gemma":[0.99760544,0.0001531865,0.0020483076,0.000013722849,0.0000061412834,0.000013616615,0.00004631206,0.00001402005,0.00009923371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835616,0.0007538053,0.00006743255,0.0001707195,0.00042076752,0.00023105222],"domain_scores_gemma":[0.9573322,0.035555217,0.0038206186,0.0014753487,0.0013880916,0.0004284995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017799152,0.00044522373,0.00035369914,0.0008768034,0.00046575104,0.00084138504,0.0005405778,0.0008031926,0.00056860055],"category_scores_gemma":[0.032389466,0.00035148082,0.00024205183,0.0007457983,0.001277298,0.002656428,0.0007740765,0.00047826514,0.00010499816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025058642,0.00009027841,0.045613993,0.00012615017,0.00010281035,0.00031690145,0.00029119893,0.9155278,0.015871137,0.004782011,0.00036077044,0.01666637],"study_design_scores_gemma":[0.000019878604,0.00055731594,0.025292754,0.000029462028,0.00007033449,0.0006580711,0.0005121828,0.94726336,0.017391669,0.0067595015,0.0013962969,0.00004914857],"about_ca_topic_score_codex":0.0016415133,"about_ca_topic_score_gemma":0.0017112235,"teacher_disagreement_score":0.0017799152,"about_ca_system_score_codex":0.0007814327,"about_ca_system_score_gemma":0.00031620622,"threshold_uncertainty_score":0.009413183},"labels":[],"label_agreement":null},{"id":"W2114855093","doi":"10.1109/ccnc.2009.4784861","title":"Incentives for P2P File Sharing in Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; File sharing; Mobile ad hoc network; Network topology; Byte; Wireless ad hoc network; Reputation; Incentive; Overlay network; Distributed computing; BitTorrent; Peer-to-peer; World Wide Web; Operating system; The Internet; Wireless; Network packet","score_opus":0.011798684480685117,"score_gpt":0.24931858758231723,"score_spread":0.23751990310163212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114855093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0849601,0.0014754661,0.89549315,0.0030524735,0.0003226546,0.00033114114,0.000120670105,0.00042689772,0.013817452],"genre_scores_gemma":[0.90038025,0.00056172314,0.09429487,0.00018312447,0.00018116404,0.00022755568,0.00004312151,0.000046074096,0.0040820907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99684465,0.001728857,0.00017017924,0.00026225386,0.0007243637,0.00026971434],"domain_scores_gemma":[0.99063194,0.0063377367,0.0008971903,0.00071587914,0.0007384663,0.0006788469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046619885,0.0005583591,0.00070262764,0.0006572918,0.0019275344,0.0021256763,0.0018479755,0.0021592223,0.0021534448],"category_scores_gemma":[0.01575166,0.0005510345,0.00040244148,0.0008002944,0.0016796131,0.00459423,0.0027560545,0.0013753951,0.0003544617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047348792,0.00020831355,0.0019659398,0.0003312658,0.000059008995,0.0007473385,0.0006492104,0.23161341,0.005348552,0.6688599,0.0076362803,0.08210733],"study_design_scores_gemma":[0.0001518689,0.00018103824,0.0004874193,0.00004583802,0.000027451913,0.0003660265,0.00019460429,0.7131944,0.0021192387,0.26614857,0.01701573,0.00006785193],"about_ca_topic_score_codex":0.0013411338,"about_ca_topic_score_gemma":0.0011922948,"teacher_disagreement_score":0.0046619885,"about_ca_system_score_codex":0.0015490265,"about_ca_system_score_gemma":0.0017394405,"threshold_uncertainty_score":0.024655282},"labels":[],"label_agreement":null},{"id":"W2114897861","doi":"10.1109/glocom.2009.5425407","title":"On the Design of Bi-Connected Wireless Mesh Network Infrastructure with QoS Constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Order One Network Protocol; Reliability (semiconductor); Computer network; Distributed computing; Network topology; Mesh networking; Node (physics); Network planning and design; Wireless network; Quality of service; Wireless WAN; Wireless; Key distribution in wireless sensor networks; Engineering","score_opus":0.009373016430532085,"score_gpt":0.20234062692593277,"score_spread":0.19296761049540068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114897861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01871014,0.00037788402,0.97488356,0.0002210449,0.0000273673,0.000058819092,0.000051120656,0.00006743263,0.005602557],"genre_scores_gemma":[0.55162203,0.0013012177,0.44220388,0.0001659752,0.000057373392,0.00040947835,0.00016893333,0.000109883425,0.0039611696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995702,0.00019403873,0.00001659493,0.000068814916,0.00010014516,0.000050302107],"domain_scores_gemma":[0.9994005,0.00033226312,0.000088711335,0.000030056068,0.00010512913,0.00004338786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009651962,0.00088634354,0.00071697234,0.00076870923,0.00041479725,0.0010510344,0.0010416068,0.0010105863,0.002068353],"category_scores_gemma":[0.002792627,0.00056519784,0.0004510068,0.0009810798,0.00058074086,0.0013004378,0.0010090225,0.0006483581,0.00034393437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000439042,0.000025384008,0.00021391927,0.00009058266,0.000025152,0.00006934049,0.000043079537,0.9587833,0.0019170763,0.023152478,0.00052852597,0.015107241],"study_design_scores_gemma":[0.000008550925,0.00002982,0.000052559804,0.000010322689,0.0000059094436,0.000015932796,0.000011953695,0.99267864,0.00027838416,0.0061121173,0.0007922127,0.0000036787876],"about_ca_topic_score_codex":0.0015235258,"about_ca_topic_score_gemma":0.0013005865,"teacher_disagreement_score":0.002068353,"about_ca_system_score_codex":0.0007116304,"about_ca_system_score_gemma":0.0008655871,"threshold_uncertainty_score":0.006919265},"labels":[],"label_agreement":null},{"id":"W2115199758","doi":"10.1109/aps.2007.4396755","title":"Effects of double mobility over channel statistics and system performances in high dynamic Ad hoc networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobility model; Channel (broadcasting); Throughput; Mobile ad hoc network; Computer network; Vehicular ad hoc network; Bit error rate; Routing (electronic design automation); Fade; Real-time computing; Telecommunications; Wireless","score_opus":0.004144170772358269,"score_gpt":0.21938492943899324,"score_spread":0.21524075866663497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115199758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9538703,0.00028657683,0.04423637,0.00008606969,0.000020441705,0.000016292994,0.00005342517,0.00018957096,0.0012409263],"genre_scores_gemma":[0.9987954,0.00006652065,0.0009880267,0.0000058883998,0.0000035960209,0.0000040302725,0.000014701241,0.000008474607,0.00011336142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924564,0.00035499784,0.000026429158,0.00006354608,0.0001767249,0.00013260165],"domain_scores_gemma":[0.99385285,0.0049754614,0.0004034134,0.00033860005,0.0002760536,0.0001535787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011759418,0.000510977,0.00038422082,0.0005139406,0.00024956567,0.0005787701,0.00022846245,0.00045529116,0.00035873987],"category_scores_gemma":[0.005624155,0.00023340409,0.00032135658,0.00040593796,0.0005892099,0.00089061196,0.00044376278,0.00038929292,0.00006060411],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002831422,0.00006946723,0.008834843,0.000042593845,0.000048438906,0.00025959406,0.000098219694,0.9651141,0.016446633,0.0022688662,0.00012130769,0.006412778],"study_design_scores_gemma":[0.000010902634,0.00029052972,0.005155701,0.000008094797,0.00003559989,0.00025639767,0.000050458337,0.9823674,0.010536905,0.0010511312,0.00021453536,0.000022380462],"about_ca_topic_score_codex":0.001392219,"about_ca_topic_score_gemma":0.00086775405,"teacher_disagreement_score":0.001392219,"about_ca_system_score_codex":0.00054182974,"about_ca_system_score_gemma":0.00031118316,"threshold_uncertainty_score":0.0062190294},"labels":[],"label_agreement":null},{"id":"W2115444091","doi":"10.1109/wcnc.2008.372","title":"The Effect of Inter-Link Dependencies on the Connectivity of Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Link (geometry); Computer science; Wireless mesh network; Topology (electrical circuits); Independence (probability theory); Node (physics); Network topology; Wireless network; Upper and lower bounds; Lattice (music); Wireless; Theoretical computer science; Computer network; Mathematics; Combinatorics","score_opus":0.012165662486876097,"score_gpt":0.22285864261067992,"score_spread":0.21069298012380383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115444091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18700795,0.0015612623,0.80639106,0.00043511236,0.00006622079,0.00004807682,0.00017874295,0.00025078084,0.004060845],"genre_scores_gemma":[0.9486804,0.0010209208,0.049382925,0.00006931498,0.00009696126,0.000052882133,0.00010931004,0.00008583159,0.00050145324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687874,0.001349884,0.00010854564,0.00031146174,0.0012056136,0.00014577605],"domain_scores_gemma":[0.95649046,0.03752168,0.0026896251,0.001829155,0.0013076485,0.0001614149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025987877,0.0005445329,0.0004997058,0.0008780746,0.0007747595,0.00056113314,0.0010531101,0.0006883407,0.0005484667],"category_scores_gemma":[0.035644706,0.0005600263,0.0003230719,0.0009340659,0.0013546454,0.0029870875,0.0011623384,0.0012169094,0.00012624986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011285447,0.000028461869,0.009625548,0.00019551213,0.00007393304,0.00043557122,0.00016124884,0.91607714,0.0068580676,0.018199304,0.0005443893,0.047688022],"study_design_scores_gemma":[0.000004499324,0.0000697318,0.0054689865,0.000032987442,0.00004260965,0.00033507447,0.000029900997,0.97515136,0.005148209,0.01261374,0.0010744206,0.000028524113],"about_ca_topic_score_codex":0.0014914399,"about_ca_topic_score_gemma":0.0019113473,"teacher_disagreement_score":0.0025987877,"about_ca_system_score_codex":0.0008011631,"about_ca_system_score_gemma":0.00045976677,"threshold_uncertainty_score":0.013743877},"labels":[],"label_agreement":null},{"id":"W2115805990","doi":"10.1093/comjnl/46.2.146","title":"On the Structuring of Reliable Multicast Protocols for Distributed Mobile Systems","year":2003,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de la Santé et des Services sociaux","keywords":"Computer science; Multicast; Computer network; Distributed computing; Scalability; Correctness; Latency (audio); Structuring; Telecommunications; Operating system","score_opus":0.023927458676612702,"score_gpt":0.2664893303932322,"score_spread":0.2425618717166195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115805990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007745375,0.011428696,0.9602746,0.0032315175,0.0005614561,0.0003664645,0.00006388357,0.00044506972,0.015882986],"genre_scores_gemma":[0.22158045,0.016186954,0.7467642,0.001286294,0.0028056286,0.002029439,0.000417679,0.0004363609,0.008492983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942883,0.0028574092,0.0005026168,0.0005385538,0.0015358952,0.00027729038],"domain_scores_gemma":[0.9906164,0.0053816563,0.0009045148,0.0017037214,0.0011060839,0.00028767428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066586602,0.0014939765,0.0018683564,0.0017783697,0.0029921134,0.0052109,0.0032650137,0.003984376,0.0025899496],"category_scores_gemma":[0.017485522,0.001472883,0.001397906,0.0025540604,0.0060074124,0.010990249,0.0044795536,0.004338337,0.0014326206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006744756,0.00004032505,0.00015359289,0.0002762485,0.000019443376,0.00019260327,0.0008943932,0.017157927,0.0013415117,0.9388455,0.0023952944,0.038615674],"study_design_scores_gemma":[0.00005389765,0.00013228224,0.00010423231,0.00028771206,0.000039059843,0.00022599992,0.00015674187,0.07866749,0.0015748978,0.85324645,0.06547271,0.000038404873],"about_ca_topic_score_codex":0.00069237145,"about_ca_topic_score_gemma":0.00042689426,"teacher_disagreement_score":0.0066586602,"about_ca_system_score_codex":0.0018458581,"about_ca_system_score_gemma":0.0017641607,"threshold_uncertainty_score":0.03521478},"labels":[],"label_agreement":null},{"id":"W2115951137","doi":"10.1109/tvt.2007.909264","title":"Distributed Correlative Power Control Schemes for Mobile<i>Ad hoc</i>Networks Using Directional Antennas","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Wireless ad hoc network; Power control; Mobile ad hoc network; Computer science; Throughput; Network packet; Computer network; Interference (communication); Transmission (telecommunications); Kalman filter; Network topology; Wireless; Directional antenna; Distributed coordination function; Power (physics); Electronic engineering; Engineering; IEEE 802.11; Antenna (radio); Channel (broadcasting); Telecommunications","score_opus":0.011864842148423423,"score_gpt":0.23409178539750114,"score_spread":0.2222269432490777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115951137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017492106,0.00024846115,0.9807222,0.00006814389,0.00003749285,0.000018665482,0.000008032924,0.00024320485,0.0011616551],"genre_scores_gemma":[0.8916031,0.00033215946,0.1062437,0.000072494826,0.00006433009,0.00006491804,0.000033379387,0.00003195824,0.0015538706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997155,0.00007674409,0.000013868445,0.00005782047,0.000111918074,0.000024178256],"domain_scores_gemma":[0.9992217,0.00034923968,0.00014841546,0.00012577743,0.00013414038,0.000020803442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007791455,0.0005124525,0.00032018137,0.0003347662,0.0003411423,0.00051771046,0.0010102494,0.00034111808,0.0006188782],"category_scores_gemma":[0.0018040016,0.00017734797,0.00029930772,0.00038569112,0.00055020454,0.00080545637,0.00036099934,0.00062314206,0.00016484571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015403438,0.0002466318,0.0014473774,0.00010386301,0.000058584683,0.00011736816,0.00016190288,0.7128387,0.027584597,0.04480188,0.0012576069,0.21122746],"study_design_scores_gemma":[0.000028676834,0.0001589328,0.00025011986,0.0000081516855,0.000018263532,0.00006430922,0.0000141675655,0.98834527,0.0049479906,0.005093594,0.001058684,0.000011893537],"about_ca_topic_score_codex":0.0010392586,"about_ca_topic_score_gemma":0.0014875273,"teacher_disagreement_score":0.0010392586,"about_ca_system_score_codex":0.000527998,"about_ca_system_score_gemma":0.00038498806,"threshold_uncertainty_score":0.0041205883},"labels":[],"label_agreement":null},{"id":"W2116000736","doi":"10.1007/s11276-008-0126-1","title":"On routing with guaranteed delivery in three-dimensional ad hoc wireless networks","year":2008,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of British Columbia; University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Routing (electronic design automation); Combinatorics; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Node (physics); Wireless; Mathematics; Routing protocol; Telecommunications; Physics","score_opus":0.011467449497757633,"score_gpt":0.20282117368624228,"score_spread":0.19135372418848465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116000736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045477375,0.0058205454,0.98186606,0.0013274747,0.00072110875,0.00007718176,0.000060106,0.00032902992,0.005250705],"genre_scores_gemma":[0.4151984,0.03263389,0.53175014,0.0016314662,0.0031001654,0.0006912603,0.0005686057,0.00061571004,0.013810407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962999,0.0017748409,0.00021603004,0.00031915845,0.0010320714,0.00035793136],"domain_scores_gemma":[0.9896456,0.008428013,0.00031811645,0.00078797416,0.00058447133,0.00023588048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004765386,0.0021119567,0.0025745095,0.0023009179,0.0016294128,0.0029234637,0.0046426696,0.002375938,0.004089229],"category_scores_gemma":[0.015101955,0.00090257224,0.0012443033,0.0040027257,0.0034558005,0.006732724,0.004379331,0.0035940106,0.00096245226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052392524,0.00012434434,0.00059733057,0.00069594005,0.00017529994,0.0003346775,0.00054264104,0.44617864,0.002108125,0.3576606,0.020586798,0.17047168],"study_design_scores_gemma":[0.000052271982,0.00013392109,0.00018112973,0.00010473662,0.00005573639,0.0001726097,0.0001055298,0.7552067,0.0008345714,0.23149887,0.01160405,0.00004996764],"about_ca_topic_score_codex":0.0033016405,"about_ca_topic_score_gemma":0.0024020418,"teacher_disagreement_score":0.004765386,"about_ca_system_score_codex":0.0021597492,"about_ca_system_score_gemma":0.0010931597,"threshold_uncertainty_score":0.025202096},"labels":[],"label_agreement":null},{"id":"W2116021531","doi":"10.1109/icc.2005.1495046","title":"Formulation of optimal tree construction for maximum lifetime multicasting in wireless ad-hoc networks with adaptive antennas","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Wireless ad hoc network; Computer science; Integer programming; Maximization; Computer network; Heuristic; Wireless network; Tree (set theory); Wireless; Linear programming; Distributed computing; Steiner tree problem; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.013125169117339498,"score_gpt":0.22951719876557194,"score_spread":0.21639202964823245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116021531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044697165,0.00034745844,0.9898879,0.00031817038,0.000040479576,0.00010066083,0.00013984398,0.00007593975,0.004619913],"genre_scores_gemma":[0.2879849,0.0016015997,0.7021964,0.00024172575,0.00020556351,0.0011143216,0.00044385841,0.00025092403,0.005960832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993358,0.00031144609,0.000025121486,0.000077911354,0.00017489346,0.00007473466],"domain_scores_gemma":[0.9990132,0.0006822634,0.00009069195,0.00003506685,0.00012541848,0.000053345262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017058898,0.0010030718,0.0010669851,0.00068877084,0.0005690066,0.0017697664,0.0012866509,0.0017651074,0.0039298744],"category_scores_gemma":[0.0040689046,0.00074408815,0.00070275285,0.0012350425,0.0007197195,0.0015128857,0.0010926042,0.0010717297,0.00057141046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023165088,0.000024026922,0.000093783005,0.00013370068,0.000013001105,0.00006385743,0.000040106035,0.9527388,0.0007313938,0.033559535,0.0015627744,0.011015889],"study_design_scores_gemma":[0.000010342363,0.000024105399,0.000037437465,0.000016521359,0.000004927968,0.000017404776,0.000021936788,0.9874538,0.0002781473,0.010698793,0.0014309312,0.0000056439653],"about_ca_topic_score_codex":0.003377861,"about_ca_topic_score_gemma":0.0036252716,"teacher_disagreement_score":0.0039298744,"about_ca_system_score_codex":0.0014906767,"about_ca_system_score_gemma":0.0017651821,"threshold_uncertainty_score":0.013146758},"labels":[],"label_agreement":null},{"id":"W2116037019","doi":"10.1109/nca.2011.43","title":"PLAN-B: Proximity-Based Lightweight Adaptive Network Broadcasting","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Retransmission; Computer science; Broadcasting (networking); Block (permutation group theory); Computer network; Distributed computing; Plan (archaeology); Protocol (science); Context (archaeology); Wireless ad hoc network; Wireless; Network packet; Telecommunications","score_opus":0.04277384822619651,"score_gpt":0.21545886249157017,"score_spread":0.17268501426537367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116037019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036222078,0.0009103066,0.9430305,0.00038323147,0.00018248755,0.00027586534,0.0002466411,0.009669665,0.009079211],"genre_scores_gemma":[0.73582757,0.00069044175,0.25118926,0.00034004025,0.00014639538,0.00047865065,0.00081955764,0.0003575429,0.0101504885],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992778,0.00013355869,0.000031387877,0.000110863606,0.0003575136,0.00008899055],"domain_scores_gemma":[0.9988324,0.00039027157,0.00016572223,0.0003167913,0.00018521305,0.000109647124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064792234,0.00049774436,0.0007370871,0.0006943842,0.00074332306,0.0007127778,0.0020505786,0.0007169259,0.0023110118],"category_scores_gemma":[0.0026331786,0.00034481194,0.00029338262,0.00065343647,0.00061609957,0.0014080482,0.0029773263,0.0010905353,0.0009856786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001620218,0.00039643893,0.0031577297,0.00066309876,0.00015868519,0.0005637554,0.0011094594,0.18353584,0.09919636,0.05393916,0.03372319,0.621936],"study_design_scores_gemma":[0.00021106252,0.00071696925,0.0013623342,0.00004805827,0.000070948954,0.0008649058,0.0003137763,0.8999927,0.029781023,0.026712593,0.039834768,0.000090814705],"about_ca_topic_score_codex":0.002718229,"about_ca_topic_score_gemma":0.0025651092,"teacher_disagreement_score":0.002718229,"about_ca_system_score_codex":0.0004746029,"about_ca_system_score_gemma":0.0008224318,"threshold_uncertainty_score":0.0077311397},"labels":[],"label_agreement":null},{"id":"W2116059095","doi":"10.1109/lcn.2010.5735787","title":"Physics-based modeling of skier mobility and avalanche rescue in mountainous terrain","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Terrain; Flocking (texture); Mobility model; Wireless ad hoc network; Wireless; Computer science; Simulation; Event (particle physics); Computer network; Physics; Geography; Telecommunications; Cartography","score_opus":0.012074728835508731,"score_gpt":0.2435868698035879,"score_spread":0.23151214096807918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116059095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471785,0.0005509039,0.43593132,0.00065295136,0.00010508405,0.00012775435,0.00034821447,0.00033080182,0.014774391],"genre_scores_gemma":[0.98283654,0.00042058405,0.013234865,0.000046549594,0.00003598103,0.00007701522,0.00014875994,0.00002366531,0.0031760116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998981,0.00002861397,0.0000064509118,0.00001585456,0.000028278799,0.00002273657],"domain_scores_gemma":[0.99985266,0.000048375947,0.000036200585,0.000014338412,0.000027572276,0.000020783013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017948997,0.0004076314,0.0004039707,0.0005256304,0.00053210906,0.00057432207,0.0008901597,0.0008239795,0.0008243875],"category_scores_gemma":[0.00070416025,0.0003091036,0.000518429,0.00041071893,0.0005067707,0.0007553339,0.000574174,0.00030572352,0.0001679252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010617844,0.0000146570555,0.0012035492,0.000010520024,0.0000097983475,0.00012237421,0.000054574964,0.99174666,0.00090770057,0.004259394,0.00016712508,0.0014929707],"study_design_scores_gemma":[0.0000048662937,0.000010320844,0.00044324342,0.0000017093087,0.0000031236373,0.000026628815,0.000020897907,0.99819285,0.00006417841,0.00092454645,0.00030337067,0.00000426662],"about_ca_topic_score_codex":0.020905117,"about_ca_topic_score_gemma":0.010140166,"teacher_disagreement_score":0.020905117,"about_ca_system_score_codex":0.0006026895,"about_ca_system_score_gemma":0.0006101708,"threshold_uncertainty_score":0.04156685},"labels":[],"label_agreement":null},{"id":"W2116182597","doi":"10.1109/tvt.2010.2064796","title":"Location-Aided Gateway Advertisement and Discovery Protocol for VANets","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Correctness; Computer network; Default gateway; Network packet; Gateway (web page); Scalability; Neighbor Discovery Protocol; Wireless ad hoc network; Vehicular ad hoc network; H.248; The Internet; Internetworking; Wireless; Distributed computing; Telecommunications; Internet Protocol; World Wide Web","score_opus":0.008975217380079132,"score_gpt":0.25852084087439975,"score_spread":0.2495456234943206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116182597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076800785,0.0011413783,0.9834299,0.00046773333,0.00030125192,0.0006232431,0.00019704933,0.0014746657,0.0046846434],"genre_scores_gemma":[0.49062136,0.0021294202,0.49096084,0.0006413092,0.00021769606,0.0024444559,0.0018668218,0.00019269179,0.010925273],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987263,0.00043862264,0.00015219767,0.0001529988,0.00041540593,0.000114566996],"domain_scores_gemma":[0.9989492,0.000451531,0.00012973898,0.00015346527,0.00024590027,0.00007026434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013470756,0.00052063784,0.00069072214,0.0014937773,0.00092906534,0.0011335306,0.001635395,0.00093600416,0.0015336382],"category_scores_gemma":[0.003350747,0.000408793,0.00034396714,0.0015059493,0.0008960591,0.0017422255,0.0024659648,0.0015014346,0.0005140998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064187084,0.00023282297,0.0014467885,0.00065950875,0.00022383172,0.0008686276,0.0009298285,0.22245494,0.04242396,0.27162427,0.02421666,0.43427703],"study_design_scores_gemma":[0.0002521865,0.0005444039,0.00052461127,0.00010042732,0.00014022485,0.0012526354,0.0002629607,0.7917924,0.020815682,0.06439509,0.119749084,0.00017026404],"about_ca_topic_score_codex":0.0016735817,"about_ca_topic_score_gemma":0.0018411076,"teacher_disagreement_score":0.0016735817,"about_ca_system_score_codex":0.0007527192,"about_ca_system_score_gemma":0.0014015877,"threshold_uncertainty_score":0.007124126},"labels":[],"label_agreement":null},{"id":"W2116202290","doi":"10.1109/lcn.2003.1243212","title":"Energy aware routing protocol for mobile and wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Network packet; Wireless Routing Protocol; Wireless ad hoc network; Dynamic Source Routing; Energy consumption; Ad hoc wireless distribution service; Distributed computing; Throughput; Wireless; Telecommunications; Engineering","score_opus":0.013257823656512908,"score_gpt":0.26382778381395827,"score_spread":0.25056996015744537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116202290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004882545,0.04549825,0.85632527,0.0048023136,0.0066986494,0.0018341725,0.0021099655,0.0061672903,0.07168155],"genre_scores_gemma":[0.10245715,0.050925367,0.7541705,0.0039407993,0.0025172215,0.00493995,0.008331338,0.00090144214,0.07181626],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981528,0.00055136206,0.00020466,0.00019232043,0.00080610346,0.00009265792],"domain_scores_gemma":[0.9987723,0.00036171437,0.00017923921,0.00019043521,0.0004050246,0.00009122919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012704923,0.0011629825,0.0012069581,0.0012196271,0.0011594192,0.0020071599,0.0021918975,0.0020173725,0.0059637506],"category_scores_gemma":[0.002741131,0.00042501927,0.0005855486,0.0027800577,0.0010541114,0.0024010637,0.0017923256,0.003214169,0.0061491122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023319545,0.00016992143,0.00071441964,0.0031652257,0.00024769822,0.0012282626,0.00059528695,0.020784978,0.021276835,0.2294398,0.16405445,0.5580899],"study_design_scores_gemma":[0.00009351521,0.00024144781,0.00049778575,0.0005791916,0.00012468117,0.0017517022,0.00020719337,0.028519757,0.0050643673,0.076280735,0.8864963,0.00014335915],"about_ca_topic_score_codex":0.0010722368,"about_ca_topic_score_gemma":0.0012277978,"teacher_disagreement_score":0.0059637506,"about_ca_system_score_codex":0.0008463347,"about_ca_system_score_gemma":0.0015628397,"threshold_uncertainty_score":0.019950688},"labels":[],"label_agreement":null},{"id":"W2116445224","doi":"10.1109/wowmom.2009.5282475","title":"Weighted-NEAT: An efficient weighted node evaluation scheme with assistant trust mechanisms to secure wireless ad hoc networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Node (physics); Correctness; Mobile ad hoc network; Wireless network; Wireless sensor network; Wireless; Scheme (mathematics); Vehicular ad hoc network; Computer security; Distributed computing; Network packet; Telecommunications; Algorithm","score_opus":0.01059405396219358,"score_gpt":0.2434155477120922,"score_spread":0.23282149374989863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116445224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017816093,0.0002460743,0.9776818,0.00020049441,0.00010469455,0.00024244141,0.00004229844,0.00047569917,0.003190404],"genre_scores_gemma":[0.5187491,0.00038320824,0.47212526,0.00018054116,0.00007018292,0.00032661954,0.0001442189,0.00009404446,0.00792695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997934,0.0007747965,0.00017284632,0.00020746901,0.0007596591,0.00015122724],"domain_scores_gemma":[0.9976931,0.00061738346,0.00026091925,0.0007280288,0.0005195059,0.00018100256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035486713,0.0005201984,0.00079188455,0.000710964,0.0009921337,0.0011291864,0.0027267416,0.00084174634,0.0017942376],"category_scores_gemma":[0.0067721335,0.00028393508,0.0006457536,0.00093854114,0.0011964029,0.0038650944,0.0028806056,0.0013015418,0.0005326147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010184444,0.0003657812,0.0013287233,0.0004132348,0.00014809625,0.00048287466,0.0007676259,0.1958493,0.02318805,0.43505567,0.007436407,0.33394566],"study_design_scores_gemma":[0.00010367345,0.0003298719,0.00026447902,0.000037785765,0.00007466065,0.00028626385,0.00007479477,0.87287664,0.006848151,0.10497752,0.014065664,0.000060508995],"about_ca_topic_score_codex":0.0008946207,"about_ca_topic_score_gemma":0.0015009986,"teacher_disagreement_score":0.0035486713,"about_ca_system_score_codex":0.001185006,"about_ca_system_score_gemma":0.0013984991,"threshold_uncertainty_score":0.018767357},"labels":[],"label_agreement":null},{"id":"W2116643655","doi":"10.1007/s00453-010-9461-6","title":"Shortest Paths in Time-Dependent FIFO Networks","year":2010,"lang":"en","type":"article","venue":"Algorithmica","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Shortest path problem; Combinatorics; Disjoint sets; Mathematics; Interval (graph theory); Function (biology); Node (physics); Binary logarithm; Time complexity; Path (computing); Discrete mathematics; Computer science; Graph; Physics","score_opus":0.004630311136895341,"score_gpt":0.2092553920371225,"score_spread":0.20462508090022716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116643655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096698314,0.0025901105,0.8884054,0.0018382333,0.00030434626,0.0002043483,0.00045370773,0.00037406146,0.009131512],"genre_scores_gemma":[0.7386566,0.004052103,0.23572074,0.00038179583,0.00041711068,0.0007076074,0.0009649836,0.00017978673,0.018919306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984669,0.0004652761,0.0001199182,0.0002794472,0.00041409262,0.00025436122],"domain_scores_gemma":[0.9877216,0.009853768,0.00094157807,0.0004960632,0.0005822976,0.00040472907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030542936,0.0008561947,0.0013256953,0.0018966403,0.0018646262,0.003208422,0.0026557231,0.0016190907,0.0043739765],"category_scores_gemma":[0.018798362,0.0009844027,0.00062565133,0.0026590517,0.0018979685,0.0055877254,0.0019742807,0.0017412258,0.00039427087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063712586,0.00016603834,0.0017379523,0.00038657972,0.00008351273,0.00014277095,0.00038224796,0.50999516,0.0015917076,0.4130466,0.0053593307,0.06647095],"study_design_scores_gemma":[0.00012461857,0.00007532707,0.00025105913,0.000044270768,0.000052910134,0.00007759757,0.00010137236,0.66928846,0.0006081539,0.3261453,0.00320619,0.000024727256],"about_ca_topic_score_codex":0.0039697974,"about_ca_topic_score_gemma":0.004145592,"teacher_disagreement_score":0.0043739765,"about_ca_system_score_codex":0.002359508,"about_ca_system_score_gemma":0.0022824893,"threshold_uncertainty_score":0.017119527},"labels":[],"label_agreement":null},{"id":"W2116768928","doi":"10.1109/wimob.2007.4390872","title":"An Efficient and Truthful Leader IDS Election Mechanism for MANET","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Network packet; Reputation; Intrusion detection system; Computer network; Mobile ad hoc network; Computer security; Process (computing); Service (business); Wireless ad hoc network; Selfishness; Distributed computing; Wireless","score_opus":0.011241780790938568,"score_gpt":0.25366602161208457,"score_spread":0.242424240821146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116768928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025268191,0.0007092102,0.97051334,0.0005397095,0.00019953938,0.0001652357,0.000058933296,0.0007484601,0.0017973341],"genre_scores_gemma":[0.8090294,0.0006285857,0.18595761,0.000304258,0.0002231983,0.00019591369,0.0001452656,0.00005212319,0.0034636932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843234,0.00047925202,0.00010153406,0.00034610418,0.0004738095,0.00016689241],"domain_scores_gemma":[0.9971993,0.0010653653,0.00053283374,0.0005672635,0.00050006295,0.00013520439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025879128,0.0005610644,0.0008957693,0.0010383056,0.00081528944,0.0012592485,0.0027975382,0.0013515713,0.0011883123],"category_scores_gemma":[0.0059113996,0.00040395724,0.00052230497,0.00091720955,0.0007771238,0.0028573247,0.001159444,0.0009301858,0.00035332472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073934364,0.00049437775,0.002709239,0.0007531135,0.00030264584,0.0006740029,0.0007156481,0.47059795,0.04088064,0.1895704,0.00970791,0.2828548],"study_design_scores_gemma":[0.00008272206,0.00031279415,0.00026679639,0.000020245674,0.000056687553,0.00028343426,0.00005471334,0.96869934,0.0068250555,0.018109486,0.0052492856,0.000039506267],"about_ca_topic_score_codex":0.0004982055,"about_ca_topic_score_gemma":0.0004943883,"teacher_disagreement_score":0.0027975382,"about_ca_system_score_codex":0.00076024124,"about_ca_system_score_gemma":0.0011744144,"threshold_uncertainty_score":0.013686359},"labels":[],"label_agreement":null},{"id":"W2117375500","doi":"10.1109/ccece.2008.4564760","title":"An AODV-improved routing based on power control in WiFi mesh networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Dynamic Source Routing; Throughput; Wireless ad hoc network; Power control; Transmission (telecommunications); Transmitter power output; Channel (broadcasting); Routing (electronic design automation); Routing protocol; Range (aeronautics); Wireless; Wireless network; Power (physics); Engineering; Telecommunications","score_opus":0.008622466688155427,"score_gpt":0.18400696550190224,"score_spread":0.17538449881374682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117375500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062255222,0.0020477748,0.9195991,0.0007935267,0.0005709302,0.0002538772,0.00025498754,0.0015692475,0.012655368],"genre_scores_gemma":[0.78488827,0.0016688268,0.20164658,0.00019147403,0.000121262245,0.00023891221,0.00042759484,0.000066865265,0.010750286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997861,0.000044467146,0.000017950695,0.00003327667,0.00009348421,0.000024809955],"domain_scores_gemma":[0.9998729,0.000031156487,0.000013018487,0.00001554873,0.000058625028,0.000008738823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022175506,0.00024518426,0.00025532147,0.00044555275,0.00042181692,0.00035372257,0.000833249,0.0002816858,0.00090356346],"category_scores_gemma":[0.0006786841,0.00014257371,0.00029412733,0.00041271115,0.00018309682,0.00060720317,0.0003932774,0.00035312318,0.0001660958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028084635,0.00012446113,0.004231156,0.00040692472,0.00010149284,0.0003653577,0.00023129921,0.23754717,0.046126768,0.045015592,0.011729345,0.6538396],"study_design_scores_gemma":[0.00009137015,0.00024674178,0.0024376588,0.00003127226,0.00006631635,0.00042147897,0.00011152345,0.9352821,0.018698493,0.009710102,0.03284997,0.00005295719],"about_ca_topic_score_codex":0.0042410493,"about_ca_topic_score_gemma":0.004395182,"teacher_disagreement_score":0.0042410493,"about_ca_system_score_codex":0.00044216495,"about_ca_system_score_gemma":0.0005155351,"threshold_uncertainty_score":0.008432746},"labels":[],"label_agreement":null},{"id":"W2117487170","doi":"10.1109/mahss.2005.1542832","title":"A cross-layer approach to service discovery and selection in MANETs","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Service discovery; Server; Wireless ad hoc network; Network topology; Service (business); Node (physics); Mobile QoS; Distributed computing; Adaptive quality of service multi-hop routing; Routing protocol; Throughput; Service layer; Routing (electronic design automation); Optimized Link State Routing Protocol; Quality of service; Service provider; World Wide Web; Web service; Wireless; Engineering; Telecommunications; Network packet","score_opus":0.014732303409862025,"score_gpt":0.2540174354236108,"score_spread":0.2392851320137488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117487170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003498812,0.0026102865,0.9847729,0.0012707092,0.0003061387,0.00015108498,0.000025381762,0.000352696,0.0070120073],"genre_scores_gemma":[0.31942582,0.008206067,0.65574926,0.0018030704,0.0011500192,0.0005433622,0.00013085018,0.00017103701,0.012820532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99700814,0.0010997173,0.00023678271,0.00036393138,0.0010443637,0.00024709222],"domain_scores_gemma":[0.9983317,0.00075950765,0.00017735238,0.00033687265,0.00027302952,0.00012158706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003674469,0.0010385925,0.0009281735,0.0014332756,0.0014227376,0.0040385323,0.002480825,0.0020840494,0.0019717445],"category_scores_gemma":[0.0040421183,0.0009936047,0.0012098171,0.0015507244,0.0021866257,0.004236348,0.0031483923,0.0027016504,0.0009897782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019485081,0.00020435656,0.0015439825,0.0005390989,0.0002439251,0.0009978373,0.00078853266,0.19275175,0.014749721,0.6191033,0.008049878,0.16083272],"study_design_scores_gemma":[0.000039054867,0.00020344647,0.0003802661,0.00013392101,0.00014493619,0.00086968555,0.0001900724,0.7131633,0.006807933,0.22575237,0.05221692,0.00009800113],"about_ca_topic_score_codex":0.002022262,"about_ca_topic_score_gemma":0.0018117393,"teacher_disagreement_score":0.0040385323,"about_ca_system_score_codex":0.0013843074,"about_ca_system_score_gemma":0.0012003342,"threshold_uncertainty_score":0.019432664},"labels":[],"label_agreement":null},{"id":"W2117632372","doi":"10.1007/s11276-009-0182-1","title":"A cluster-based trust-aware routing protocol for mobile ad hoc networks","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Polytechnique Montréal","keywords":"Computer science; Computer network; Wireless Routing Protocol; Routing protocol; Optimized Link State Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Zone Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Network packet; Wireless; Telecommunications","score_opus":0.014849707975981771,"score_gpt":0.2775410418727535,"score_spread":0.26269133389677174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117632372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01768686,0.0011119208,0.97187954,0.0004800498,0.00046433695,0.00045250906,0.00021654881,0.0036655003,0.0040427693],"genre_scores_gemma":[0.49471948,0.0014130098,0.49023268,0.0002916998,0.00026153913,0.00071339397,0.0010571263,0.00045280243,0.010858238],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999008,0.00022234625,0.000098621145,0.00010465379,0.00046787405,0.00009850478],"domain_scores_gemma":[0.998211,0.00043165023,0.00015507314,0.0004047665,0.0006404003,0.0001571041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013945888,0.0006025238,0.0009677841,0.0009046346,0.0017354096,0.001168612,0.0023213285,0.0009810129,0.0016647046],"category_scores_gemma":[0.003326482,0.00041572732,0.0005435966,0.001281048,0.00063659484,0.0022985723,0.0020112416,0.0014134976,0.00080093753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014430641,0.00039872515,0.0017228427,0.0006506577,0.00034165254,0.0007567654,0.00086707127,0.22896262,0.04956912,0.08240318,0.052095946,0.5807884],"study_design_scores_gemma":[0.00021270757,0.0005174997,0.0009785865,0.00006253305,0.00030577386,0.00061865733,0.00021078154,0.89466995,0.024283625,0.028839989,0.049130876,0.00016909497],"about_ca_topic_score_codex":0.0043450217,"about_ca_topic_score_gemma":0.0051062703,"teacher_disagreement_score":0.0043450217,"about_ca_system_score_codex":0.000941873,"about_ca_system_score_gemma":0.0015621003,"threshold_uncertainty_score":0.008639455},"labels":[],"label_agreement":null},{"id":"W2117704299","doi":"10.1109/wcnc.2008.412","title":"Mobility-Aware Multi-Path Forwarding Scheme for Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Handover; Mobility management; Scalability; Overhead (engineering); Wireless mesh network; Packet forwarding; Network packet; Scheme (mathematics); Reliability (semiconductor); Path (computing); Exploit; Routing (electronic design automation); Distributed computing; Wireless; Wireless network; Telecommunications; Computer security","score_opus":0.028729118080951105,"score_gpt":0.25907715945138193,"score_spread":0.23034804137043083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117704299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039764944,0.0015125425,0.9556461,0.000357377,0.00015346424,0.00013617915,0.000051374187,0.00041114658,0.001966929],"genre_scores_gemma":[0.7449012,0.0011196865,0.25135973,0.00015443204,0.000117183125,0.00021453343,0.0001712845,0.000020262794,0.0019416603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974865,0.00007201241,0.000017903829,0.00004454349,0.000090085836,0.00002678308],"domain_scores_gemma":[0.99972004,0.00007029415,0.000052790365,0.00008316932,0.00005762553,0.000016008991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053755654,0.00030957107,0.00035702187,0.000469046,0.00066883076,0.00029943357,0.0009253373,0.00058731844,0.00064943853],"category_scores_gemma":[0.00094678835,0.0001300493,0.00034774275,0.0003820578,0.00029398408,0.0010286612,0.00071002485,0.0005316396,0.00019367502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030567177,0.00015535786,0.0014253136,0.00037078143,0.00012802579,0.0005826623,0.00033542002,0.08421507,0.21957205,0.07524289,0.0059912414,0.6116755],"study_design_scores_gemma":[0.00009932249,0.0007390392,0.001466702,0.00005353225,0.00011617393,0.0012280123,0.00009701725,0.89170635,0.049526244,0.031184038,0.023686597,0.00009701466],"about_ca_topic_score_codex":0.0004600405,"about_ca_topic_score_gemma":0.00076835806,"teacher_disagreement_score":0.0009253373,"about_ca_system_score_codex":0.0004402964,"about_ca_system_score_gemma":0.00038079263,"threshold_uncertainty_score":0.0031946301},"labels":[],"label_agreement":null},{"id":"W2117773528","doi":"10.1007/s11036-009-0156-7","title":"Design and Performance Evaluation of IAR: Interference-Aware Routing Metric for Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Arkansas","keywords":"Computer science; Computer network; Wireless mesh network; Metrics; Metric (unit); Dynamic Source Routing; Routing (electronic design automation); Wireless; Geographic routing; Distributed computing; Wireless network; Routing protocol; Telecommunications","score_opus":0.02503303620759669,"score_gpt":0.2723744562471313,"score_spread":0.2473414200395346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117773528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13841937,0.0023281276,0.85224867,0.00034733888,0.00016254662,0.00043887424,0.00012603117,0.0017521434,0.0041768244],"genre_scores_gemma":[0.7385194,0.00063896755,0.25888914,0.00008501901,0.00007039289,0.00021616137,0.00017602494,0.00015328692,0.0012516469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967114,0.0016851388,0.00019632858,0.0002791978,0.0009546374,0.00017326034],"domain_scores_gemma":[0.9945958,0.0025773724,0.00050841307,0.00038701846,0.0017933933,0.00013794166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004357824,0.0009664274,0.00070768653,0.0011442063,0.00039178677,0.0008581615,0.002047518,0.0005934358,0.0008780357],"category_scores_gemma":[0.008501064,0.0002938658,0.00029544768,0.00074002414,0.0004911454,0.001423986,0.0006063738,0.0005708816,0.00019893127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013523727,0.00056282565,0.0061370735,0.0007764409,0.00020538269,0.00015716198,0.00023551667,0.5919221,0.065905035,0.01478115,0.0027784766,0.3151865],"study_design_scores_gemma":[0.000048335,0.00084627955,0.000505469,0.000010284719,0.000049609993,0.00011180189,0.000028421646,0.9782106,0.018164784,0.00059768354,0.0014089288,0.000017847116],"about_ca_topic_score_codex":0.002167196,"about_ca_topic_score_gemma":0.0025925487,"teacher_disagreement_score":0.004357824,"about_ca_system_score_codex":0.0014947968,"about_ca_system_score_gemma":0.0010029533,"threshold_uncertainty_score":0.023046672},"labels":[],"label_agreement":null},{"id":"W2117937353","doi":"10.1109/glocom.2007.149","title":"Reducing Broadcast Redundancy in Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Latency (audio); Upper and lower bounds; Broadcasting (networking); Redundancy (engineering); Wireless network; Atomic broadcast; Broadcast radiation; Reduction (mathematics); Approximation algorithm; Wireless; Algorithm; Distributed computing; Network packet; Mathematics; Telecommunications","score_opus":0.011321372514312304,"score_gpt":0.24366190015998093,"score_spread":0.23234052764566862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117937353","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1953693,0.010400305,0.7828384,0.00084070547,0.00023284448,0.00021132521,0.0001317168,0.0018048809,0.008170581],"genre_scores_gemma":[0.8219342,0.003923516,0.1706603,0.0001566456,0.00022627375,0.00019502631,0.00020871076,0.00010027153,0.0025950854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877137,0.00047265392,0.00005496698,0.00010110263,0.00048423212,0.000115568815],"domain_scores_gemma":[0.99693847,0.0016885925,0.00036315274,0.00053212984,0.00042065073,0.0000568795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010775488,0.0006709932,0.00083445595,0.0011195963,0.0006904082,0.0005896248,0.0010786728,0.0007662,0.0007022507],"category_scores_gemma":[0.0058221007,0.0004226545,0.0003654224,0.0009199971,0.00054417667,0.0015853551,0.0010206836,0.00050515577,0.00043777423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006066274,0.00023036003,0.0025197247,0.0010744118,0.00019897858,0.00063995674,0.0006596235,0.42538837,0.071167864,0.021210603,0.00703694,0.46926656],"study_design_scores_gemma":[0.00013848435,0.00075747626,0.0017803285,0.00010723082,0.00022637445,0.0011375459,0.0002633021,0.9269416,0.032957587,0.023507454,0.012126773,0.000055815926],"about_ca_topic_score_codex":0.0008684798,"about_ca_topic_score_gemma":0.0010370476,"teacher_disagreement_score":0.0011195963,"about_ca_system_score_codex":0.0004042005,"about_ca_system_score_gemma":0.00047339176,"threshold_uncertainty_score":0.005698681},"labels":[],"label_agreement":null},{"id":"W2118140967","doi":"10.1109/glocom.2008.ecp.1033","title":"Distributed Multi-Interface Multi-Channel Random Access","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Channel (broadcasting); Computer network; Interface (matter); Random access; Wireless ad hoc network; Node (physics); Throughput; Distributed computing; Channel allocation schemes; Wireless; Key (lock); Aggregate (composite); Algorithm; Engineering; Telecommunications","score_opus":0.04931988487950456,"score_gpt":0.29462386792059975,"score_spread":0.24530398304109519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118140967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006226645,0.00020899005,0.9913902,0.000101003374,0.000061822255,0.00007428405,0.00002235239,0.00069665746,0.0012179916],"genre_scores_gemma":[0.6774704,0.0003668931,0.31643683,0.00025201,0.00018224122,0.0004151869,0.00018700451,0.00008713103,0.004602369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766845,0.0011510585,0.00007570558,0.00038238772,0.00050300674,0.00021933939],"domain_scores_gemma":[0.9967914,0.0015012801,0.00029591125,0.00080730196,0.00047023944,0.00013394169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928933,0.0008013181,0.0012569334,0.00055607775,0.0006184955,0.0015143495,0.0023417082,0.0011040921,0.0021334023],"category_scores_gemma":[0.0057189018,0.00031834352,0.0005815166,0.0008347665,0.0009399443,0.0015825944,0.0014036115,0.001498035,0.00093638676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006443747,0.00041244976,0.0013330862,0.00018501458,0.00014762739,0.00028293103,0.00014452178,0.5832697,0.012048957,0.1095748,0.009117997,0.28283852],"study_design_scores_gemma":[0.00006533434,0.00006459134,0.000067365916,0.0000041889825,0.0000131420875,0.00009218531,0.000007743745,0.9882123,0.0012274431,0.008512782,0.0017191977,0.0000137531815],"about_ca_topic_score_codex":0.000820588,"about_ca_topic_score_gemma":0.0011420496,"teacher_disagreement_score":0.0023417082,"about_ca_system_score_codex":0.0007575199,"about_ca_system_score_gemma":0.0008138698,"threshold_uncertainty_score":0.010201335},"labels":[],"label_agreement":null},{"id":"W2118164039","doi":"10.1109/glocom.2008.ecp.101","title":"Proposal and Analysis of Region-Based Location Service Management Protocol for VANETs","year":2008,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalability; Vehicular ad hoc network; Overhead (engineering); Protocol (science); Computer network; Wireless ad hoc network; Locality; Scheme (mathematics); Distributed computing; Service (business); Key (lock); Computer security; Telecommunications; Wireless; Database","score_opus":0.02936618114840622,"score_gpt":0.2927978723226253,"score_spread":0.26343169117421905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118164039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009576169,0.0022932908,0.9746473,0.0009881175,0.00031414293,0.00027927157,0.00009586219,0.0002694857,0.011536318],"genre_scores_gemma":[0.5708952,0.007168025,0.40577424,0.00059461466,0.0006690318,0.0010765478,0.00060281955,0.00014973429,0.013069717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987419,0.00030829638,0.00007971857,0.00020287468,0.00052239327,0.0001447436],"domain_scores_gemma":[0.999151,0.0002895258,0.00011279507,0.0000771885,0.00032563158,0.000043814907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001449649,0.0005931451,0.0007244774,0.0015208328,0.0007690939,0.0019805573,0.0020387715,0.0011952155,0.0016205466],"category_scores_gemma":[0.0034955847,0.0004894816,0.0008227708,0.001783898,0.0010001708,0.002637005,0.0015387381,0.0014380462,0.0005186932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082520615,0.000064249776,0.0009290053,0.0002968965,0.00008170145,0.0006954114,0.00034121156,0.23848994,0.010750018,0.6805275,0.0064737587,0.061267763],"study_design_scores_gemma":[0.000018743784,0.00010841778,0.0002021543,0.00004254432,0.000050077804,0.0005176942,0.00011456542,0.9086767,0.0026088348,0.06374174,0.023873255,0.000045341436],"about_ca_topic_score_codex":0.0020891728,"about_ca_topic_score_gemma":0.0010827674,"teacher_disagreement_score":0.0020891728,"about_ca_system_score_codex":0.0015114135,"about_ca_system_score_gemma":0.0016209433,"threshold_uncertainty_score":0.010966122},"labels":[],"label_agreement":null},{"id":"W2118363972","doi":"10.1109/icc.2011.5963331","title":"Side Channel Monitoring: Packet Drop Attack Detection in Wireless Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Network packet; Packet drop attack; Channel (broadcasting); Node (physics); Mobile ad hoc network; Wireless; Drop (telecommunication); Routing protocol; Telecommunications; Engineering; Link-state routing protocol","score_opus":0.03830404387535401,"score_gpt":0.24735571996725964,"score_spread":0.2090516760919056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118363972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14709319,0.0014183999,0.84703124,0.00031790472,0.00006465701,0.00014409747,0.00005014001,0.00047154608,0.0034086977],"genre_scores_gemma":[0.95335567,0.00057548645,0.045113366,0.00004427608,0.00007939282,0.000046218003,0.000036736903,0.000018534201,0.0007302871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988518,0.00042571296,0.000034469875,0.00010604507,0.00049542676,0.000086629414],"domain_scores_gemma":[0.9958209,0.002766703,0.00052539783,0.00034593238,0.00046073514,0.0000803287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012713325,0.0006486545,0.00050900294,0.0008676655,0.00027846976,0.000537811,0.00062947685,0.0006940329,0.00054743234],"category_scores_gemma":[0.0064570014,0.00024919925,0.00032729743,0.0004718085,0.00077583554,0.0010983616,0.0005684897,0.00046774966,0.00017608055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005186222,0.00022608427,0.02423309,0.00042228217,0.00015377616,0.00069349376,0.00016350506,0.59841657,0.06737255,0.017821465,0.002321159,0.28765747],"study_design_scores_gemma":[0.000009019095,0.00018328892,0.001323643,0.000010257645,0.00001874374,0.00038702184,0.000011338109,0.98719156,0.008069356,0.0023760486,0.0004102456,0.000009381452],"about_ca_topic_score_codex":0.00040305484,"about_ca_topic_score_gemma":0.00031596544,"teacher_disagreement_score":0.0012713325,"about_ca_system_score_codex":0.0003967094,"about_ca_system_score_gemma":0.00034042302,"threshold_uncertainty_score":0.0067235827},"labels":[],"label_agreement":null},{"id":"W2118527774","doi":"10.1145/1089803.1089968","title":"A high performance cluster-based broadcasting algorithm for wireless ad hoc networks based on a novel gateway selection approach","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Broadcasting (networking); Flooding (psychology); Broadcast radiation; Wireless ad hoc network; Default gateway; Mobile ad hoc network; Selection algorithm; Node (physics); Cluster analysis; Overhead (engineering); Selection (genetic algorithm); Distributed computing; Algorithm; Network packet; Wireless; Telecommunications; Engineering","score_opus":0.013639924309648513,"score_gpt":0.21873351052561363,"score_spread":0.20509358621596513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118527774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015172864,0.0004779934,0.97996885,0.00014432354,0.00009314789,0.00012039735,0.000029676752,0.0015671934,0.0024255486],"genre_scores_gemma":[0.20319186,0.0006122983,0.79014206,0.00016029309,0.00014235813,0.00024646847,0.00027169718,0.00016792037,0.0050651035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967587,0.000057015885,0.000015492871,0.00004900932,0.00017240855,0.0000302139],"domain_scores_gemma":[0.99976236,0.00006674018,0.000023435492,0.00002875133,0.00009470533,0.000023916615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004206482,0.0003769148,0.00050122495,0.00072091393,0.000674063,0.0004479068,0.0012160508,0.0004942526,0.0011375432],"category_scores_gemma":[0.0006869471,0.00023965945,0.00026776193,0.0007803236,0.00033147004,0.00072348834,0.0005328153,0.0005946454,0.0005801064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033111774,0.00015434138,0.0015104605,0.00030339076,0.00014945176,0.00022272962,0.00044658754,0.10393005,0.10006443,0.035163667,0.010782259,0.74694157],"study_design_scores_gemma":[0.00019304495,0.00043654712,0.0015249718,0.000025334788,0.000111639565,0.0006073604,0.00008907034,0.9133003,0.03199055,0.009917888,0.041724898,0.00007849919],"about_ca_topic_score_codex":0.0025290777,"about_ca_topic_score_gemma":0.002523722,"teacher_disagreement_score":0.0025290777,"about_ca_system_score_codex":0.00060863397,"about_ca_system_score_gemma":0.0006387219,"threshold_uncertainty_score":0.0050287247},"labels":[],"label_agreement":null},{"id":"W2118688197","doi":"10.1109/ipdps.2008.4536497","title":"A mesh hybrid adaptive service discovery protocol (MesHASeDiP): Protocol design and proof of correctness","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Service discovery; Computer science; Computer network; Scalability; Overhead (engineering); Correctness; Protocol (science); Distributed computing; Routing protocol; Service (business); Neighbor Discovery Protocol; Service provider; Routing (electronic design automation); Internet protocol suite; Web service; World Wide Web; The Internet; Database","score_opus":0.029047908998655527,"score_gpt":0.27625385243801476,"score_spread":0.24720594343935923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118688197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013916944,0.00020228681,0.99531907,0.00035268982,0.00009059621,0.00034497547,0.00006535271,0.00067545753,0.0015577553],"genre_scores_gemma":[0.09247061,0.0009989195,0.9002945,0.0003792633,0.00013986517,0.002066677,0.00034383946,0.00035947503,0.0029469673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996236,0.0011945878,0.00033567884,0.0003981084,0.0016259677,0.00020958701],"domain_scores_gemma":[0.9962237,0.0018017081,0.000298166,0.00064843125,0.0009301464,0.00009782544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00559646,0.00066598976,0.00085768814,0.0010780016,0.0011226834,0.0027593789,0.0022276752,0.0018507934,0.0041469564],"category_scores_gemma":[0.011393714,0.0008827132,0.0010239922,0.0010007289,0.0023645633,0.0037861587,0.0035522543,0.0025120967,0.0017869354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003252919,0.00020162635,0.0010647089,0.0009919655,0.00012032485,0.0011084988,0.00074630615,0.06313033,0.029564776,0.6839396,0.015732625,0.20307395],"study_design_scores_gemma":[0.00033219944,0.0005560461,0.00043645973,0.00034551017,0.00014417795,0.0014808931,0.00017621942,0.62197804,0.04616322,0.19902018,0.12916891,0.00019809256],"about_ca_topic_score_codex":0.0013501215,"about_ca_topic_score_gemma":0.000667491,"teacher_disagreement_score":0.00559646,"about_ca_system_score_codex":0.0011495567,"about_ca_system_score_gemma":0.0031146398,"threshold_uncertainty_score":0.029597282},"labels":[],"label_agreement":null},{"id":"W2119114221","doi":"10.1109/infcom.2007.173","title":"Joint Channel Allocation, Interface Assignment and MAC Design for Multi-Channel Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless mesh network; Computer network; Channel allocation schemes; Router; Wireless network; Channel (broadcasting); Throughput; Distributed computing; Shared mesh; Interface (matter); Order One Network Protocol; Mathematical optimization; Topology (electrical circuits); Wireless; Engineering; Mathematics; Telecommunications","score_opus":0.04844015984411584,"score_gpt":0.2741109105388219,"score_spread":0.22567075069470607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119114221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008290673,0.00028282544,0.9901596,0.000085752465,0.000017098462,0.0000252655,0.000008861982,0.000090823574,0.0010391135],"genre_scores_gemma":[0.7532996,0.000503246,0.24408662,0.00009447591,0.00006205722,0.00022809867,0.000041914675,0.00006339915,0.0016206217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985038,0.0008797498,0.000040849627,0.000118066324,0.0003056409,0.0001518954],"domain_scores_gemma":[0.99891245,0.00057445833,0.00015203698,0.00008413706,0.00022793743,0.00004893422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002052281,0.00071430166,0.0006110071,0.00041792248,0.00034463694,0.0009580545,0.000827445,0.00060903496,0.001124014],"category_scores_gemma":[0.003110491,0.0004449581,0.00032282097,0.00053319836,0.00083995797,0.0010715858,0.0008731085,0.0007526044,0.000268069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008760236,0.00004891963,0.00036589405,0.00008235667,0.000030027684,0.000043987988,0.000071664785,0.93657684,0.004120965,0.016363842,0.000674123,0.041533638],"study_design_scores_gemma":[0.000007985589,0.000032590946,0.000040050898,0.0000031547927,0.000006277574,0.00001061804,0.000009181912,0.9959078,0.00052434945,0.0031220363,0.0003323005,0.0000037885757],"about_ca_topic_score_codex":0.0012567269,"about_ca_topic_score_gemma":0.0014845774,"teacher_disagreement_score":0.002052281,"about_ca_system_score_codex":0.0008236871,"about_ca_system_score_gemma":0.0011056956,"threshold_uncertainty_score":0.010853589},"labels":[],"label_agreement":null},{"id":"W2119160121","doi":"10.4108/icst.broadnets2009.7101","title":"Joint Non-bifurcated Routing and Scheduling in Wireless Grid Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Computer science; Computer network; Distributed computing; Mesh networking; Switched mesh; Provisioning; Wireless network; Order One Network Protocol; Shared mesh; Scheduling (production processes); The Internet; Quality of service; Grid; Wireless; Telecommunications; Engineering; World Wide Web","score_opus":0.011470407952052104,"score_gpt":0.22384451471277853,"score_spread":0.21237410676072643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119160121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24177285,0.0014393945,0.7516758,0.00058294955,0.00014951662,0.00006538211,0.000054464104,0.00024081254,0.0040188245],"genre_scores_gemma":[0.96623594,0.00030400578,0.03205688,0.000052978383,0.000051702744,0.000055665925,0.000041683976,0.000017971897,0.0011831914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936754,0.0003230079,0.00003201263,0.000074923424,0.00011988212,0.000082705046],"domain_scores_gemma":[0.99836355,0.0009145043,0.00023797563,0.00019844451,0.00017063905,0.000114805545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364514,0.00020917745,0.00045669492,0.00034814194,0.00048420066,0.00074344245,0.0007451891,0.00060845364,0.00065230095],"category_scores_gemma":[0.0039662523,0.00028299997,0.00022354806,0.0005649463,0.0009470395,0.0011110033,0.0010571092,0.00044050443,0.000120494886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018848457,0.00004241483,0.0018987241,0.00006648208,0.000050616803,0.00022345112,0.00018348572,0.8634962,0.0034421773,0.092344865,0.0011169862,0.036946047],"study_design_scores_gemma":[0.000017126677,0.000027719921,0.00022773675,0.0000033250979,0.0000053973467,0.00002256179,0.000030561085,0.9651281,0.00041409032,0.033552345,0.00056510954,0.0000059088106],"about_ca_topic_score_codex":0.0013662421,"about_ca_topic_score_gemma":0.0011441441,"teacher_disagreement_score":0.0013662421,"about_ca_system_score_codex":0.00064696005,"about_ca_system_score_gemma":0.0007949576,"threshold_uncertainty_score":0.0072163343},"labels":[],"label_agreement":null},{"id":"W2119190106","doi":"10.1109/iscc.2003.1214122","title":"The degree of participation concept in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Degree (music); Optimized Link State Routing Protocol; Computer network; Ad hoc wireless distribution service; Routing (electronic design automation); Vehicular ad hoc network; Scheme (mathematics); Process (computing); Adaptive quality of service multi-hop routing; Resource (disambiguation); Distributed computing; Routing protocol; Telecommunications; Wireless; Mathematics","score_opus":0.032533336610952264,"score_gpt":0.26333348899902226,"score_spread":0.23080015238807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119190106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02404373,0.00977497,0.8809938,0.004757815,0.0014145103,0.00027107337,0.00015664843,0.00026312974,0.07832433],"genre_scores_gemma":[0.8325961,0.011811212,0.12978202,0.0012966426,0.0028505565,0.000996284,0.00021527751,0.00009309713,0.020358812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954638,0.0018425328,0.00028090566,0.00068837224,0.0013556385,0.00036871148],"domain_scores_gemma":[0.9944366,0.0033452322,0.000540436,0.00062113703,0.00054217834,0.00051435904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025505498,0.0009942931,0.00065958005,0.0015624922,0.0015019673,0.0037440115,0.001858441,0.0018697833,0.0023214014],"category_scores_gemma":[0.009296635,0.00037718692,0.00062645745,0.0023019165,0.0059588794,0.009950492,0.0034689563,0.0028235526,0.0006380399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021377877,0.000015132001,0.00023685583,0.0001350214,0.0000115948515,0.00011765023,0.00046678862,0.005537556,0.00083055266,0.9690908,0.0012629275,0.022273758],"study_design_scores_gemma":[0.000023273451,0.00013091248,0.0002718928,0.00012747369,0.000029945326,0.0006678698,0.00039782762,0.025017852,0.0010729639,0.8825242,0.08969173,0.00004417991],"about_ca_topic_score_codex":0.00064496533,"about_ca_topic_score_gemma":0.00044271557,"teacher_disagreement_score":0.0037440115,"about_ca_system_score_codex":0.0013095795,"about_ca_system_score_gemma":0.00095805805,"threshold_uncertainty_score":0.0134887695},"labels":[],"label_agreement":null},{"id":"W2119328958","doi":"10.1109/eit.2009.5189641","title":"A Joint cross layer routing and resource allocation algorithm for multi-radio wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Resource allocation; Dynamic Source Routing; Network packet; Algorithm; Wireless; Distributed computing; Interference (communication); Radio resource management; Wireless network; Routing protocol; Telecommunications","score_opus":0.027632242554710307,"score_gpt":0.2740539947665018,"score_spread":0.24642175221179147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119328958","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032774452,0.00016051558,0.9955888,0.000052518895,0.00003048374,0.000023494602,0.000007872259,0.00037117497,0.00048781824],"genre_scores_gemma":[0.13554837,0.0001842052,0.86146015,0.00012711728,0.000039838575,0.00015232255,0.00010800873,0.00011739319,0.002262552],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.0002757949,0.00005439987,0.00014208841,0.00032064156,0.00007809428],"domain_scores_gemma":[0.9993327,0.00028828974,0.00007319547,0.00012055182,0.00015378618,0.000031459193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015753043,0.00054589415,0.0005825721,0.0006527873,0.00047291303,0.0009081734,0.0011624187,0.00082554616,0.0018454356],"category_scores_gemma":[0.0024191893,0.00036375667,0.0005085308,0.00057595095,0.0003726478,0.0017884934,0.0012680467,0.00086095894,0.00057567516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023570418,0.00015704564,0.00076112227,0.00012379975,0.00014454717,0.00009324278,0.00011245209,0.3585724,0.016505377,0.020351972,0.0036997194,0.5992426],"study_design_scores_gemma":[0.0000339352,0.000085796106,0.00017758219,0.000008197969,0.000022800557,0.00010171288,0.000012854311,0.98762506,0.0037872188,0.0048359344,0.003294063,0.000014807401],"about_ca_topic_score_codex":0.0007922235,"about_ca_topic_score_gemma":0.0008871699,"teacher_disagreement_score":0.0018454356,"about_ca_system_score_codex":0.0003895368,"about_ca_system_score_gemma":0.00066249096,"threshold_uncertainty_score":0.00833112},"labels":[],"label_agreement":null},{"id":"W2119364164","doi":"10.1109/dnsr.2004.1344712","title":"Performance evaluation of service discovery strategies in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Wireless ad hoc network; Service discovery; Computer network; Vehicular ad hoc network; Mobile ad hoc network; Service (business); Node (physics); Focus (optics); Query language; Distributed computing; Information retrieval; World Wide Web; Web service; Wireless; Telecommunications; Network packet","score_opus":0.020978042684999518,"score_gpt":0.2605717694696541,"score_spread":0.23959372678465457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119364164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91637385,0.0031442961,0.07360697,0.00033035493,0.000077235454,0.00020889861,0.000172586,0.0006981516,0.005387625],"genre_scores_gemma":[0.99010324,0.00032766373,0.009041304,0.000020566826,0.0000134519805,0.000045071236,0.00009823455,0.000019510087,0.00033092755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99476635,0.0022898745,0.0002688326,0.00034893162,0.0018872836,0.00043867077],"domain_scores_gemma":[0.9824493,0.012962141,0.001032363,0.00077730464,0.0022543625,0.00052453525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055373013,0.0013568288,0.0011230374,0.0021598027,0.0007389886,0.0011512768,0.001504213,0.0010539653,0.00064104574],"category_scores_gemma":[0.016405426,0.00024218527,0.00024206567,0.0018274132,0.0007859984,0.0018036419,0.0007922091,0.0004772464,0.00021696628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026305332,0.0007674967,0.01215338,0.00039660814,0.00025114822,0.00020433402,0.00027604133,0.8549504,0.025186539,0.006692207,0.0010964507,0.0953948],"study_design_scores_gemma":[0.00007410147,0.0015535158,0.0017986604,0.000013365317,0.00006711322,0.00017263582,0.00013908955,0.9819755,0.012457751,0.0012627344,0.0004611817,0.000024376532],"about_ca_topic_score_codex":0.0032442173,"about_ca_topic_score_gemma":0.0019017064,"teacher_disagreement_score":0.0055373013,"about_ca_system_score_codex":0.002274456,"about_ca_system_score_gemma":0.0010478566,"threshold_uncertainty_score":0.029284418},"labels":[],"label_agreement":null},{"id":"W2119632647","doi":"10.1109/cit.2006.34","title":"Adaptive Routing for Sensor Networks using Reinforcement Learning","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Static routing; Dynamic Source Routing; Link-state routing protocol; Policy-based routing; Destination-Sequenced Distance Vector routing; Reinforcement learning; Wireless Routing Protocol; Distributed computing; Multipath routing; Computer network; Hierarchical routing; Equal-cost multi-path routing; Routing (electronic design automation); Geographic routing; Routing protocol; Machine learning","score_opus":0.02162605008231312,"score_gpt":0.24232743010965663,"score_spread":0.22070138002734352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119632647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009177067,0.00029195647,0.98886514,0.00017418526,0.00003489624,0.000038062928,0.000007692035,0.00033363752,0.0010774633],"genre_scores_gemma":[0.7926721,0.00046603094,0.20412003,0.00014793055,0.00008674074,0.00028084216,0.00004163764,0.000051734736,0.0021329543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996024,0.00014973941,0.000020702453,0.00006703847,0.00012756839,0.00003250114],"domain_scores_gemma":[0.9988796,0.00073303713,0.000117627635,0.00008351117,0.00014481768,0.00004136063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546621,0.0005437194,0.000628802,0.00029293713,0.00032825803,0.00046554685,0.00088812306,0.0007005839,0.0009222734],"category_scores_gemma":[0.0031767813,0.00026296114,0.0003528629,0.00032024848,0.0010446173,0.0007433989,0.0007606913,0.0011557346,0.00018189478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000334131,0.00004183754,0.0003282061,0.000036500365,0.000027912367,0.00003397607,0.00003331256,0.9439447,0.0014766079,0.010121408,0.00043949732,0.043482583],"study_design_scores_gemma":[0.000007076087,0.000016703882,0.000029903047,0.0000017803324,0.0000020489879,0.000005567209,0.0000014381332,0.99572146,0.00017510369,0.003860317,0.00017660804,0.0000020725179],"about_ca_topic_score_codex":0.0034243064,"about_ca_topic_score_gemma":0.0029407092,"teacher_disagreement_score":0.0034243064,"about_ca_system_score_codex":0.00066508085,"about_ca_system_score_gemma":0.0006830508,"threshold_uncertainty_score":0.006808758},"labels":[],"label_agreement":null},{"id":"W2119663602","doi":"10.1109/msn.2009.49","title":"Congestion-Aware Clique-Based Handoff in Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Handover; Shared mesh; Switched mesh; Load balancing (electrical power); Router; Scalability; Throughput; Distributed computing; Wireless network; Wireless; Telecommunications","score_opus":0.010062853231743088,"score_gpt":0.2361099688488817,"score_spread":0.2260471156171386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119663602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24895655,0.0012363007,0.74334556,0.00071051164,0.00017875517,0.00012291616,0.00009900535,0.00070713536,0.0046432717],"genre_scores_gemma":[0.9533811,0.0002797918,0.04493214,0.000044059318,0.00007693416,0.000051205912,0.000058519046,0.000028449222,0.0011478208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996797,0.00013439015,0.000011163802,0.000058306894,0.000066960776,0.00004944055],"domain_scores_gemma":[0.99905807,0.0005554084,0.00009819644,0.000084786916,0.00009150505,0.00011197104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090715894,0.00021842151,0.00046947523,0.0004669373,0.0008294122,0.00048437883,0.001083357,0.00049548567,0.0006304192],"category_scores_gemma":[0.0018587144,0.00026571727,0.00028234563,0.0004146755,0.0005137099,0.0008700404,0.00071522803,0.00044874634,0.00009811681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000293457,0.00018156217,0.0021461616,0.00011456509,0.00008556089,0.00023379305,0.00020711395,0.86777604,0.020675344,0.02952066,0.0026498628,0.07611591],"study_design_scores_gemma":[0.000012862889,0.000030678504,0.0003413134,0.0000025864622,0.000010249959,0.000028675091,0.000017144346,0.99325234,0.00068611075,0.0050097606,0.00059844187,0.000009902421],"about_ca_topic_score_codex":0.0024871458,"about_ca_topic_score_gemma":0.0027973708,"teacher_disagreement_score":0.0024871458,"about_ca_system_score_codex":0.00049277855,"about_ca_system_score_gemma":0.00047821703,"threshold_uncertainty_score":0.004945278},"labels":[],"label_agreement":null},{"id":"W2119688761","doi":"10.1007/978-1-4757-5402-5_18","title":"An Ant Colony Optimization Based Routing Algorithm in Mobile Ad hoc Networks and its Parallel Implementation","year":2004,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Mobile ad hoc network; Distributed computing; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Computer network; Optimized Link State Routing Protocol; Routing (electronic design automation); Parallel computing; Routing protocol; Link-state routing protocol; Wireless; Algorithm; Operating system","score_opus":0.012252323212937193,"score_gpt":0.2590591456395122,"score_spread":0.246806822426575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119688761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011474686,0.00084515515,0.9713499,0.00016605706,0.0002612295,0.000085905034,0.000051866813,0.002129746,0.01363549],"genre_scores_gemma":[0.12903813,0.0008223145,0.8533169,0.00007753667,0.00010085817,0.00016014771,0.00013745873,0.00027349842,0.01607317],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979454,0.000038785038,0.000009843686,0.000031991753,0.00010935332,0.000015348332],"domain_scores_gemma":[0.999739,0.000085932064,0.00001095336,0.0000495204,0.00010236148,0.000012160381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025503436,0.0003758298,0.0005070906,0.0003312638,0.0004228931,0.0006495016,0.0009250243,0.0005663438,0.0038777129],"category_scores_gemma":[0.00093874184,0.00032180973,0.00027128676,0.0010153378,0.00027841135,0.0007453084,0.00040353983,0.0006771039,0.0012844739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016831906,0.00017361986,0.00040608612,0.00015689735,0.00004720627,0.000114786366,0.0000742152,0.3648553,0.0150334295,0.031790886,0.010349267,0.57683],"study_design_scores_gemma":[0.000022406877,0.000045053916,0.00012305239,0.000005523162,0.000013544266,0.00008755521,0.000009224046,0.9832071,0.00333741,0.0062453095,0.006895781,0.0000080056325],"about_ca_topic_score_codex":0.003157866,"about_ca_topic_score_gemma":0.0036476622,"teacher_disagreement_score":0.0038777129,"about_ca_system_score_codex":0.0002667107,"about_ca_system_score_gemma":0.0005545499,"threshold_uncertainty_score":0.012972176},"labels":[],"label_agreement":null},{"id":"W2119889086","doi":"","title":"Performance Analysis of Routing Protocols for Wireless Ad-Hoc Networks","year":2011,"lang":"en","type":"article","venue":"Summit (Simon Fraser University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Ad hoc wireless distribution service; Link-state routing protocol; Distributed computing; Zone Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.023611832140370565,"score_gpt":0.22377951562134132,"score_spread":0.20016768348097075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119889086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16224763,0.02958186,0.76528525,0.0012985334,0.0008556581,0.0005041901,0.0012028579,0.0031037324,0.03592022],"genre_scores_gemma":[0.8730103,0.010778679,0.10784581,0.00015973827,0.00037139407,0.0004622698,0.0020806785,0.00040132602,0.0048897252],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950067,0.0015565233,0.0002674559,0.0002725074,0.0026545834,0.00024218431],"domain_scores_gemma":[0.99416167,0.0036114196,0.0004040837,0.0005868283,0.0011655075,0.00007049673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031457772,0.0011385822,0.00065651827,0.0015197751,0.0004355498,0.0013658863,0.00086313975,0.00074270635,0.0013325879],"category_scores_gemma":[0.013266507,0.00025920075,0.00049258786,0.0020224275,0.00037189544,0.0018452597,0.00045409187,0.0006721584,0.00062010484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026076738,0.00015780024,0.0042176875,0.0005620795,0.00019799343,0.00022558513,0.00013315972,0.7423708,0.01245225,0.038352843,0.0057521765,0.19531687],"study_design_scores_gemma":[0.00001876964,0.00032313704,0.0017713779,0.00006688237,0.0000760499,0.00025689614,0.00005684202,0.96514577,0.0067338194,0.013716877,0.011802998,0.00003055086],"about_ca_topic_score_codex":0.0011525111,"about_ca_topic_score_gemma":0.00050918566,"teacher_disagreement_score":0.0031457772,"about_ca_system_score_codex":0.0011770563,"about_ca_system_score_gemma":0.00073124166,"threshold_uncertainty_score":0.01663667},"labels":[],"label_agreement":null},{"id":"W2120018600","doi":"10.1109/icmwcn.2007.4668197","title":"Power-aware Depth First Search based georouting in ad hoc and sensor wireless networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Cistel Technology (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society","keywords":"Computer science; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Computer network; Link-state routing protocol; Geographic routing; Wireless Routing Protocol; Routing (electronic design automation); Static routing; Routing protocol; Wireless ad hoc network; Distributed File System; Distributed computing; Routing table; Wireless","score_opus":0.01262166591521331,"score_gpt":0.24537386956371154,"score_spread":0.23275220364849825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120018600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052682098,0.0016111721,0.94349515,0.00015665396,0.0000433361,0.000054236913,0.000036466146,0.00028160625,0.001639242],"genre_scores_gemma":[0.738594,0.0016503504,0.25562066,0.00008623976,0.000045806653,0.000085034335,0.000105966,0.000036939957,0.0037750246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999798,0.00007778722,0.000009966557,0.000026630003,0.00006565726,0.000021919599],"domain_scores_gemma":[0.99969196,0.00017934282,0.000047736925,0.000028999835,0.000038300015,0.0000136261615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041182552,0.0003838174,0.00044837076,0.0005861949,0.00032188368,0.0004468541,0.0006592388,0.0004923116,0.0004511558],"category_scores_gemma":[0.0009526237,0.00027361105,0.00021947386,0.0007009763,0.0004317706,0.0009979388,0.00040507055,0.00025585806,0.00009696457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011868016,0.000052789714,0.0008472489,0.00017089568,0.000039579245,0.000091755115,0.0001249402,0.75597024,0.015625414,0.032079324,0.0015840329,0.19329517],"study_design_scores_gemma":[0.000020644247,0.000121382516,0.00027164354,0.000010057144,0.00001764478,0.00010309119,0.000044566747,0.9758832,0.006366097,0.014365819,0.0027813234,0.000014542243],"about_ca_topic_score_codex":0.0014439973,"about_ca_topic_score_gemma":0.0025728694,"teacher_disagreement_score":0.0014439973,"about_ca_system_score_codex":0.00045597894,"about_ca_system_score_gemma":0.00051434536,"threshold_uncertainty_score":0.0033083558},"labels":[],"label_agreement":null},{"id":"W2120120066","doi":"10.1109/wcnc.2006.1683489","title":"On upper bounds on communication rates in ad-hoc networks with non-uniform traffic pattern","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Upper and lower bounds; Wireless network; Transmission (telecommunications); Wireless; Distributed computing; Telecommunications; Mathematics","score_opus":0.006228413963420141,"score_gpt":0.2176930949694931,"score_spread":0.21146468100607296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120120066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047277987,0.02586596,0.8565649,0.0036918821,0.0007079408,0.00023897892,0.00082812144,0.0010248946,0.06379936],"genre_scores_gemma":[0.81223196,0.042034168,0.12676308,0.0016784129,0.0022662499,0.0015036103,0.0014816462,0.0011754829,0.010865483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9908907,0.0025759938,0.00038224988,0.0008098793,0.0035886718,0.0017524535],"domain_scores_gemma":[0.9001288,0.08459693,0.0024786207,0.005084777,0.0065785833,0.0011323316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010426016,0.0054347524,0.0033342075,0.0048198127,0.0024332486,0.006463499,0.004908973,0.0026854645,0.0057611587],"category_scores_gemma":[0.08432929,0.0018921304,0.0015891341,0.0047999434,0.0048712087,0.012579972,0.006492485,0.008396819,0.0028431178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007526985,0.00027699978,0.0011883434,0.0010155938,0.00018112721,0.0005560732,0.0007622614,0.53529984,0.010239843,0.36702052,0.007981086,0.074725665],"study_design_scores_gemma":[0.000074844844,0.00026914594,0.0007870831,0.0008328944,0.00015075463,0.0005745072,0.000255286,0.68993133,0.009550502,0.2898716,0.0075554717,0.00014655697],"about_ca_topic_score_codex":0.002229205,"about_ca_topic_score_gemma":0.0015938424,"teacher_disagreement_score":0.010426016,"about_ca_system_score_codex":0.0045850566,"about_ca_system_score_gemma":0.0015759554,"threshold_uncertainty_score":0.055138707},"labels":[],"label_agreement":null},{"id":"W2120144333","doi":"10.1109/pacrim.2011.6032974","title":"Assessing the performance of AODV, DYMO, and OLSR routing protocols in the context of larger-scale denser MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Wireless ad hoc network; Routing protocol; Node (physics); Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Engineering; Network packet","score_opus":0.0389376174774031,"score_gpt":0.28699131222429947,"score_spread":0.24805369474689637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120144333","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9925443,0.0003069319,0.0050102896,0.0001514724,0.000029571578,0.00006583029,0.00009371551,0.00007834996,0.0017195742],"genre_scores_gemma":[0.9956827,0.0002407899,0.0036017292,0.000016042077,0.000010301845,0.000019751671,0.00011394195,0.000009438326,0.00030525384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985001,0.0006058747,0.00010796049,0.00021469546,0.00039502024,0.00017635743],"domain_scores_gemma":[0.9897741,0.0077456767,0.0008857367,0.00055564,0.0007821193,0.0002566578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025704855,0.0005328658,0.00058505737,0.0010838495,0.0005226257,0.0008273445,0.0008754272,0.0008157993,0.0005601296],"category_scores_gemma":[0.007705207,0.00021043392,0.0002857464,0.0009872053,0.0007054137,0.0017732726,0.0006392414,0.00047880335,0.00015198853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004599203,0.00066966465,0.02431071,0.0003398317,0.00016127226,0.000482016,0.0004759531,0.9288818,0.014689132,0.002918302,0.0007673095,0.02584415],"study_design_scores_gemma":[0.000040389736,0.0015119639,0.015215542,0.00002201246,0.00006413618,0.00020637884,0.0007249458,0.97142076,0.008943591,0.0010587461,0.00073936715,0.00005225529],"about_ca_topic_score_codex":0.0061904695,"about_ca_topic_score_gemma":0.005823506,"teacher_disagreement_score":0.0061904695,"about_ca_system_score_codex":0.0010043982,"about_ca_system_score_gemma":0.00054309814,"threshold_uncertainty_score":0.013594151},"labels":[],"label_agreement":null},{"id":"W2120217462","doi":"10.1109/glocom.2010.5684001","title":"Performance Evaluation of a Hybrid Cryptosystem with Authentication for Wireless Ad hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Encryption; Public-key cryptography; Mobile ad hoc network; Authentication (law); Cryptography; Overhead (engineering); Key (lock); Wireless network; Node (physics); Vehicular ad hoc network; Computer security; Wireless; Cryptosystem; Hybrid cryptosystem; Telecommunications; Engineering","score_opus":0.01463837076807594,"score_gpt":0.24521793645523654,"score_spread":0.2305795656871606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120217462","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8223492,0.0025061783,0.1615106,0.0003980435,0.00021340691,0.00040925443,0.00016510178,0.001291059,0.011157213],"genre_scores_gemma":[0.9883631,0.00013811258,0.010770748,0.000017800265,0.000017861174,0.00004586292,0.00007645653,0.000016677795,0.0005533588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963335,0.0014444668,0.0002777137,0.0002762137,0.0012646406,0.00040344495],"domain_scores_gemma":[0.9897658,0.0062154373,0.00075468683,0.0009959557,0.0019569898,0.00031116736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004243626,0.0007561968,0.0008634145,0.0014730575,0.0007946948,0.0011492228,0.0008059746,0.000951169,0.0022369768],"category_scores_gemma":[0.009714052,0.00018928286,0.00028269604,0.0012464124,0.00084819796,0.0033312947,0.0010000531,0.0004498486,0.00035904985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009341339,0.0009883278,0.012174942,0.00068980374,0.00043039818,0.000494313,0.00025440275,0.7054513,0.05213952,0.033471297,0.0029580651,0.1816063],"study_design_scores_gemma":[0.00017619434,0.0011643053,0.0009783446,0.000011333627,0.00004591507,0.00026732555,0.00003688989,0.98335916,0.011505258,0.0018588459,0.0005729387,0.000023488614],"about_ca_topic_score_codex":0.0009582608,"about_ca_topic_score_gemma":0.00059060764,"teacher_disagreement_score":0.004243626,"about_ca_system_score_codex":0.0015258429,"about_ca_system_score_gemma":0.0009971628,"threshold_uncertainty_score":0.022442698},"labels":[],"label_agreement":null},{"id":"W2120251759","doi":"10.1007/11422778_68","title":"Peer Collaboration in Wireless Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Network packet; Peer-to-peer; Wireless; Relay; Mobile ad hoc network; Vehicular ad hoc network; Computer security; Cryptography; Scheme (mathematics); Wireless network; Distributed computing; Telecommunications","score_opus":0.009726385614746627,"score_gpt":0.24216987799602663,"score_spread":0.23244349238128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120251759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019130422,0.047466747,0.8138911,0.0011766949,0.0017706981,0.00023785821,0.0000613943,0.0006751194,0.11558989],"genre_scores_gemma":[0.47578272,0.061983343,0.2974259,0.00041589304,0.0032045636,0.00070877786,0.00029326518,0.00028499545,0.1599005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991504,0.00027627047,0.00002819996,0.000105373605,0.00038015822,0.000059547274],"domain_scores_gemma":[0.9988557,0.00084374583,0.00003098627,0.00009475643,0.00013565338,0.000039175255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086901506,0.00067219394,0.0009381916,0.00043349035,0.0007214562,0.0012759981,0.0013499813,0.0012580281,0.0035698998],"category_scores_gemma":[0.0028645084,0.00039259662,0.00027801958,0.0011618233,0.0007517722,0.003209336,0.0011842551,0.0010591813,0.0013959948],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009573577,0.00010692408,0.00034370035,0.0010967178,0.00005836414,0.00041553928,0.00081402645,0.043214504,0.0045305025,0.47380903,0.02083644,0.45467848],"study_design_scores_gemma":[0.00006203374,0.0002464257,0.0003436999,0.0001903938,0.000079083846,0.001106544,0.00037926575,0.14998555,0.003601958,0.64264446,0.20131801,0.000042546333],"about_ca_topic_score_codex":0.00028246464,"about_ca_topic_score_gemma":0.0003615711,"teacher_disagreement_score":0.0035698998,"about_ca_system_score_codex":0.00034262333,"about_ca_system_score_gemma":0.0004423865,"threshold_uncertainty_score":0.011942506},"labels":[],"label_agreement":null},{"id":"W2120542921","doi":"10.1109/glocom.2010.5683207","title":"Solution Space Characterization and a Fast Algorithm for the Channel Assignment Problem in Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Redundancy (engineering); Wireless; Heuristic; Graph; Channel (broadcasting); Theoretical computer science; Mathematical optimization; Mathematics; Computer network","score_opus":0.008610503964106756,"score_gpt":0.21295751403925092,"score_spread":0.20434701007514416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120542921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014769438,0.0001577209,0.98286045,0.00018908629,0.000026849564,0.00010167604,0.000032163174,0.00027210955,0.0015904701],"genre_scores_gemma":[0.14133343,0.00022489448,0.8562939,0.00006712863,0.000055462544,0.00034208433,0.0002605035,0.00016152233,0.0012610499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989034,0.0004209608,0.000048015372,0.00015126332,0.00034175994,0.00013467515],"domain_scores_gemma":[0.9968779,0.002188282,0.00024378792,0.0002620401,0.00034910865,0.000078912024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017057436,0.0011476333,0.0007680038,0.0013242995,0.00091630145,0.0013307356,0.001060602,0.0011709343,0.0032895615],"category_scores_gemma":[0.008757997,0.00055008236,0.00088608306,0.0013968014,0.001306852,0.0025557436,0.0015246172,0.0020241125,0.000546037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002895208,0.00019393326,0.0010228818,0.0002748908,0.000048507318,0.000070824506,0.00042264594,0.6100555,0.0072691836,0.11787933,0.003980763,0.25849196],"study_design_scores_gemma":[0.00005060854,0.000079091915,0.000119954995,0.000018398885,0.000009875187,0.000044665037,0.00006866449,0.95129436,0.0014250918,0.04476934,0.0021086945,0.000011187705],"about_ca_topic_score_codex":0.0020805914,"about_ca_topic_score_gemma":0.0016516494,"teacher_disagreement_score":0.0032895615,"about_ca_system_score_codex":0.0011563776,"about_ca_system_score_gemma":0.0018054903,"threshold_uncertainty_score":0.011004627},"labels":[],"label_agreement":null},{"id":"W2120606322","doi":"10.1109/twc.2012.072512.111738","title":"An Enhanced Reservation Based Medium Access Control for Voice over Wireless Mesh Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"East Midlands Development Agency","keywords":"Computer network; Computer science; Wireless mesh network; Access control; Network packet; Distributed coordination function; Throughput; Wireless; IEEE 802.11s; Service set; Wireless network; IEEE 802.11; Wi-Fi; Telecommunications","score_opus":0.035251211027959924,"score_gpt":0.31048594286157155,"score_spread":0.27523473183361163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120606322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071341954,0.00080637087,0.9253553,0.00014079548,0.00015690344,0.000060564395,0.000029435403,0.00051679445,0.0015918533],"genre_scores_gemma":[0.9000411,0.00020883056,0.09845216,0.00008007229,0.00009247272,0.000056439858,0.000036010377,0.000015405976,0.0010175236],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996562,0.00010874783,0.00003548415,0.000061001658,0.000100076824,0.000038387352],"domain_scores_gemma":[0.99949,0.00021273803,0.00006539898,0.000084514395,0.00012513166,0.000022225875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006212942,0.00022675499,0.0002459344,0.00027512456,0.00024856828,0.00030984182,0.0007173578,0.00025472065,0.00043980626],"category_scores_gemma":[0.0012275032,0.000108673674,0.00023563496,0.00017006218,0.00025876716,0.0004904535,0.0004097606,0.00046068363,0.000099849254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090264593,0.0002520005,0.0021677855,0.00035529627,0.00014300755,0.00048574986,0.00022027791,0.16386375,0.43215138,0.043018866,0.0025094096,0.35392982],"study_design_scores_gemma":[0.000049877766,0.00035183653,0.00065923185,0.000008645438,0.000049532537,0.00024860023,0.00001909784,0.96807957,0.022951208,0.0022890128,0.005264401,0.00002892477],"about_ca_topic_score_codex":0.0006181257,"about_ca_topic_score_gemma":0.0009237217,"teacher_disagreement_score":0.0007173578,"about_ca_system_score_codex":0.00025596714,"about_ca_system_score_gemma":0.00029603188,"threshold_uncertainty_score":0.003285706},"labels":[],"label_agreement":null},{"id":"W2120727878","doi":"10.1109/icccn.2005.1523872","title":"Impact of lossy links on performance of multihop wireless networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Lossy compression; Computer science; Computer network; Throughput; Efficient energy use; Energy consumption; Wireless; Wireless network; Broadcasting (networking); Lossless compression; Interference (communication); Telecommunications; Algorithm; Engineering; Data compression; Electrical engineering; Channel (broadcasting)","score_opus":0.007721227583672252,"score_gpt":0.23610214162887033,"score_spread":0.22838091404519809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120727878","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8967975,0.00722243,0.079790905,0.0012017005,0.00022316654,0.00007288922,0.00028522563,0.0007009117,0.013705331],"genre_scores_gemma":[0.99595547,0.0009458534,0.0020629815,0.000097535885,0.00005641435,0.000016911414,0.00008989026,0.0000848249,0.00069016527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955917,0.0011791261,0.00021795214,0.00033985998,0.001811135,0.0008602115],"domain_scores_gemma":[0.9635824,0.030006433,0.0023438083,0.0014986588,0.0019586782,0.0006100778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030020517,0.000957849,0.000821802,0.0007393027,0.0008957684,0.0016004386,0.00071899116,0.0010830918,0.0014654958],"category_scores_gemma":[0.022674732,0.0004857097,0.00030267806,0.00095689675,0.0010636486,0.0028399604,0.0013975757,0.001154649,0.00046842833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093311584,0.00025921973,0.012214438,0.00025899734,0.00013779035,0.000770327,0.00015598483,0.9142685,0.022091605,0.0034136288,0.0009913982,0.04450499],"study_design_scores_gemma":[0.00009674421,0.002485493,0.01770039,0.00011541944,0.0002334349,0.0015846574,0.00034693728,0.8958308,0.065067366,0.013761153,0.0026576451,0.00011994731],"about_ca_topic_score_codex":0.0008515969,"about_ca_topic_score_gemma":0.00063627947,"teacher_disagreement_score":0.0030020517,"about_ca_system_score_codex":0.0009571096,"about_ca_system_score_gemma":0.000525787,"threshold_uncertainty_score":0.015876532},"labels":[],"label_agreement":null},{"id":"W2120870660","doi":"10.1109/glocom.2009.5425811","title":"An Efficient Hybrid Adaptive Location-Aided Gateway Advertisement and Discovery Protocol for Heterogeneous Wireless and Mobile Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; H.248; Gateway (web page); Gateway address; Service discovery; Interior gateway protocol; Neighbor Discovery Protocol; Routing protocol; Wireless network; Network packet; Default gateway; Wireless; Internetworking; Distributed computing; Telecommunications; Wireless Routing Protocol; The Internet; Internet Protocol; World Wide Web; Web service","score_opus":0.010544198295229512,"score_gpt":0.2631356093836268,"score_spread":0.2525914110883973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120870660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020869872,0.0008644577,0.97375315,0.0003152836,0.00017490034,0.00030806963,0.0000571844,0.0015419548,0.0021149786],"genre_scores_gemma":[0.6203004,0.00085216213,0.37060446,0.00052653416,0.00017355787,0.00086612714,0.0005370533,0.00010015986,0.006039603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990532,0.00025237055,0.00011556174,0.00011805628,0.00036076194,0.00010016182],"domain_scores_gemma":[0.9992403,0.00028805697,0.000116615956,0.000113797934,0.0001790047,0.00006228623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015601098,0.0003780727,0.0007443804,0.00087751215,0.0007983548,0.0008987345,0.0017380029,0.00083999726,0.0006152959],"category_scores_gemma":[0.0018223762,0.00031592356,0.00037168383,0.0006445076,0.0006255568,0.0021988123,0.0022717242,0.0010736121,0.00025601083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009771732,0.00045068242,0.002074495,0.0005444808,0.00025480855,0.0018107073,0.0012480334,0.08292605,0.18160489,0.13163437,0.017416881,0.5790574],"study_design_scores_gemma":[0.00022444662,0.00061013363,0.0011452604,0.00004614171,0.00017878838,0.0014569311,0.00018514808,0.8928792,0.040744025,0.015925778,0.046435762,0.00016848619],"about_ca_topic_score_codex":0.0010650185,"about_ca_topic_score_gemma":0.0013600618,"teacher_disagreement_score":0.0017380029,"about_ca_system_score_codex":0.0006514669,"about_ca_system_score_gemma":0.0008647322,"threshold_uncertainty_score":0.008250713},"labels":[],"label_agreement":null},{"id":"W2121095427","doi":"10.1109/iscc.2003.1214144","title":"A framework for wireless ad hoc networks with a quasi-guaranteed minimum system lifetime","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Network packet; Wireless sensor network; Wireless; Distributed computing; Channel (broadcasting); Mobile ad hoc network; Ad hoc wireless distribution service; Wireless network; Energy (signal processing); Optimized Link State Routing Protocol; Routing (electronic design automation); Routing protocol; Telecommunications; Mathematics","score_opus":0.009685004889297253,"score_gpt":0.23071183821913807,"score_spread":0.22102683332984083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121095427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008903781,0.00060551043,0.9955552,0.00032919698,0.000084771316,0.00006128151,0.00002593892,0.0001218618,0.0023257853],"genre_scores_gemma":[0.13294554,0.0022091083,0.8578593,0.00036789686,0.00052575406,0.0010408849,0.000109264074,0.00021440642,0.0047279866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977927,0.00090489513,0.00010575437,0.00031484413,0.0007111597,0.00017064252],"domain_scores_gemma":[0.99805355,0.0009853666,0.00017051758,0.00035521723,0.00028160238,0.00015381479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041358746,0.0014361256,0.0012916876,0.0009897844,0.0014074738,0.0023954713,0.0040624808,0.0018654861,0.003381568],"category_scores_gemma":[0.0052399123,0.00078393915,0.0017295725,0.0011507816,0.002806257,0.0041143075,0.0034899572,0.0033169629,0.0011894822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003778363,0.00003311346,0.00008752002,0.00018852923,0.000030521904,0.00015734356,0.00017834513,0.16500412,0.0022788825,0.80857474,0.0026110965,0.020818016],"study_design_scores_gemma":[0.000053862317,0.00014663667,0.0000849955,0.00008773638,0.00003461449,0.00023605763,0.00006288753,0.6001773,0.00072844763,0.360862,0.037475042,0.000050416842],"about_ca_topic_score_codex":0.0015980044,"about_ca_topic_score_gemma":0.0022343497,"teacher_disagreement_score":0.0041358746,"about_ca_system_score_codex":0.0020242897,"about_ca_system_score_gemma":0.0021024635,"threshold_uncertainty_score":0.021872878},"labels":[],"label_agreement":null},{"id":"W2121269142","doi":"10.1145/989459.989489","title":"Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional antennas","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Multicast; Directional antenna; Ad hoc wireless distribution service; Metric (unit); Mobile ad hoc network; Geocast; Wireless; Vehicular ad hoc network; Optimized Link State Routing Protocol; Antenna (radio); Distributed computing; Telecommunications; Engineering","score_opus":0.007882852950432713,"score_gpt":0.21619979763004404,"score_spread":0.20831694467961134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121269142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055528294,0.00030017886,0.94133914,0.00015985708,0.000024606836,0.000026524047,0.000046395762,0.00015440673,0.002420665],"genre_scores_gemma":[0.677171,0.0005208015,0.3193404,0.00005840005,0.00005076353,0.0001157208,0.00022599543,0.00013399163,0.0023829243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973387,0.00013680803,0.000009978453,0.000022605373,0.00005953717,0.00003709931],"domain_scores_gemma":[0.99955136,0.00027909147,0.00005116706,0.000035764777,0.000060393977,0.000022198472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057016464,0.0005617113,0.00051931205,0.0004190211,0.00030688578,0.0004512747,0.00051673874,0.0005786708,0.0010148528],"category_scores_gemma":[0.0018232499,0.00034195554,0.00029692537,0.00057802204,0.00033029658,0.0006478686,0.00049184775,0.00039627455,0.00043604954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015564456,0.000076379285,0.0012189305,0.00007036047,0.000022489628,0.000053389158,0.00007203445,0.8856901,0.010851701,0.011034469,0.0019172517,0.088837385],"study_design_scores_gemma":[0.000016266982,0.000058058024,0.00022631224,0.000005633918,0.0000085837955,0.000029217863,0.000027217891,0.98958695,0.0016289525,0.007893855,0.0005129107,0.000006021339],"about_ca_topic_score_codex":0.0007054506,"about_ca_topic_score_gemma":0.0011753796,"teacher_disagreement_score":0.0010148528,"about_ca_system_score_codex":0.00045693005,"about_ca_system_score_gemma":0.00040832078,"threshold_uncertainty_score":0.003395021},"labels":[],"label_agreement":null},{"id":"W2121320520","doi":"10.1002/sec.134","title":"Performance analysis of secure on‐demand services for wireless vehicular networks","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Computer network; Scalability; Latency (audio); Software deployment; Wireless; Service (business); Computer security; Telecommunications","score_opus":0.006859344815508339,"score_gpt":0.22848109043565734,"score_spread":0.221621745620149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121320520","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9450336,0.0005203651,0.04916624,0.00024729493,0.00002490203,0.00006174154,0.000095422096,0.0001540855,0.0046963324],"genre_scores_gemma":[0.99872786,0.00006606495,0.0009089522,0.000004340638,0.0000031940542,0.000006971508,0.000028902683,0.0000061467276,0.00024749624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986156,0.00042165507,0.000039921022,0.0000725435,0.0005719101,0.00027841618],"domain_scores_gemma":[0.9945962,0.003257027,0.00046564857,0.0003539072,0.001195458,0.00013185017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018949683,0.00059402315,0.0003898539,0.0008228414,0.00039657328,0.00089512643,0.0005490724,0.00042817742,0.0012360247],"category_scores_gemma":[0.008208952,0.00018375584,0.0002501052,0.0006647884,0.000505617,0.0007707132,0.0006785031,0.00038303845,0.00017299497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067454984,0.000078811405,0.0064063077,0.000077034,0.00003900912,0.00011385982,0.00007258605,0.9510734,0.009403928,0.0097980015,0.000649226,0.021613285],"study_design_scores_gemma":[0.0000063028892,0.000119649645,0.0011780447,0.0000020540224,0.000009433071,0.000038231126,0.00004010246,0.99503446,0.0024091443,0.0009946675,0.00016263135,0.0000053362305],"about_ca_topic_score_codex":0.007559287,"about_ca_topic_score_gemma":0.0039669042,"teacher_disagreement_score":0.007559287,"about_ca_system_score_codex":0.0025656011,"about_ca_system_score_gemma":0.00082319474,"threshold_uncertainty_score":0.018614888},"labels":[],"label_agreement":null},{"id":"W2121336614","doi":"10.1109/wcnc.2008.461","title":"A Secure Routing Protocol in Proactive Security Approach for Mobile Ad-Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Zone Routing Protocol; Dynamic Source Routing; Routing protocol; Link-state routing protocol; Optimized Link State Routing Protocol; Computer security; Distributed computing; Network packet","score_opus":0.018166066593804535,"score_gpt":0.2633137387827134,"score_spread":0.24514767218890887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121336614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038929007,0.0022784085,0.98182803,0.0011948365,0.0009915022,0.00037641058,0.000061030263,0.0008056107,0.008571294],"genre_scores_gemma":[0.14216559,0.004747933,0.8282948,0.0010925563,0.00067597703,0.001203421,0.00039240776,0.00027046484,0.021156844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979723,0.00059721834,0.0002268286,0.00028506794,0.0008165733,0.0001019817],"domain_scores_gemma":[0.99910116,0.00021097944,0.00009527035,0.0002845023,0.00022983848,0.000078236124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017304732,0.00077748415,0.0006600146,0.0011514407,0.0014523455,0.0023444984,0.0016596769,0.0018752606,0.0018249212],"category_scores_gemma":[0.0020206643,0.00048087697,0.0011462872,0.0012843075,0.0019524966,0.0045923116,0.0025287191,0.002804748,0.0014320661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010888587,0.00011708852,0.00033990803,0.00072867086,0.00010269406,0.0010358876,0.0007139184,0.014391563,0.026381852,0.79011333,0.011054992,0.15491115],"study_design_scores_gemma":[0.00014132554,0.0006548395,0.0005355645,0.00038235483,0.00034519652,0.0037744935,0.00038647992,0.19118574,0.032389082,0.39695862,0.37303632,0.00021003331],"about_ca_topic_score_codex":0.00040137122,"about_ca_topic_score_gemma":0.00049292203,"teacher_disagreement_score":0.0023444984,"about_ca_system_score_codex":0.0007872558,"about_ca_system_score_gemma":0.0013044184,"threshold_uncertainty_score":0.009151697},"labels":[],"label_agreement":null},{"id":"W2121367195","doi":"10.1109/iwcmc.2008.147","title":"Integer Linear Optimization Model for Channel Assignment Problem in Wireless Mesh Network","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Interference (communication); Mesh networking; Wireless network; Wireless; Integer programming; Linear programming; Reliability (semiconductor); Wireless broadband; Channel (broadcasting); Scalability; Radio resource management; Distributed computing; Mathematical optimization; Telecommunications; Algorithm; Mathematics","score_opus":0.026774365523592785,"score_gpt":0.23706841089044622,"score_spread":0.21029404536685345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121367195","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007862761,0.0013072417,0.97785187,0.0009731057,0.00016666703,0.00010326429,0.0003819808,0.00019298123,0.011160103],"genre_scores_gemma":[0.7053255,0.0042759874,0.25635943,0.00083885243,0.00058486994,0.0015503485,0.0013498664,0.00028547866,0.029429663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986872,0.00060186966,0.00004048999,0.00021012952,0.00019714031,0.00026316315],"domain_scores_gemma":[0.9981736,0.001397885,0.00016049306,0.00003296131,0.00017197418,0.000063049294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017740722,0.0021131206,0.0017487154,0.0007176922,0.00063777115,0.0021098466,0.0018777658,0.002355046,0.007877795],"category_scores_gemma":[0.003320805,0.0008224294,0.0009223498,0.0018413365,0.001078509,0.0016818221,0.0012681577,0.0027218186,0.0010134272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030852487,0.00004150084,0.0001652627,0.00010697509,0.000015935266,0.00008964353,0.000030181163,0.976364,0.0001891336,0.015800443,0.0018732817,0.0052927276],"study_design_scores_gemma":[0.000011942018,0.000019154928,0.00004490216,0.000007998635,0.000004938915,0.00001234608,0.000013418145,0.99310017,0.000043945787,0.0061996845,0.00053673756,0.000004817466],"about_ca_topic_score_codex":0.009896377,"about_ca_topic_score_gemma":0.0072000325,"teacher_disagreement_score":0.009896377,"about_ca_system_score_codex":0.0016716556,"about_ca_system_score_gemma":0.0015751858,"threshold_uncertainty_score":0.026353836},"labels":[],"label_agreement":null},{"id":"W2121376232","doi":"10.1109/lcn.2008.4664184","title":"Fuzzy trust recommendation based on collaborative filtering for mobile ad-hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Mobile ad hoc network; Trustworthiness; Wireless ad hoc network; Trust management (information system); Collaborative filtering; Fuzzy logic; Computational trust; Computer network; Trusted Computing; Subjective logic; Computer security; Distributed computing; Recommender system; World Wide Web; Artificial intelligence; Wireless; Network packet; Reputation","score_opus":0.01873204253371566,"score_gpt":0.25328603245939013,"score_spread":0.23455398992567447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121376232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024234148,0.00033425266,0.9729898,0.00026121075,0.000071532915,0.00008182555,0.00005426773,0.00018111874,0.0017918346],"genre_scores_gemma":[0.8473831,0.0004931965,0.14867482,0.00011894268,0.000107645305,0.0001679866,0.00017351388,0.000025120455,0.0028557382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972203,0.0008172846,0.00025945695,0.00061894633,0.00085989526,0.0002240837],"domain_scores_gemma":[0.99579537,0.0024098083,0.00043654992,0.00028582173,0.00093854277,0.00013385495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029226632,0.0008014964,0.0017511544,0.0015401382,0.0011689244,0.0015365375,0.0021642055,0.0017596404,0.001577073],"category_scores_gemma":[0.010466597,0.00054878276,0.0015359627,0.0015866712,0.00093135773,0.0023667577,0.0006515299,0.0010735753,0.00032918065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024262132,0.00019160136,0.0030972625,0.0001638408,0.00025491565,0.0002675129,0.00028436,0.85860825,0.002364575,0.024381962,0.0017091492,0.108433895],"study_design_scores_gemma":[0.000012117119,0.000035190482,0.00025535404,0.0000063878674,0.000026623835,0.000029309353,0.000012178113,0.9951757,0.00025869126,0.0039331196,0.00024185106,0.000013467144],"about_ca_topic_score_codex":0.03443991,"about_ca_topic_score_gemma":0.02539986,"teacher_disagreement_score":0.03443991,"about_ca_system_score_codex":0.0024619142,"about_ca_system_score_gemma":0.0012462735,"threshold_uncertainty_score":0.06847894},"labels":[],"label_agreement":null},{"id":"W2121452655","doi":"10.1109/icdcsw.2007.91","title":"A Cooperative Approach for Analyzing Intrusions in Mobile Ad hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"False positive paradox; Computer science; Mobile ad hoc network; Intrusion detection system; Node (physics); Class (philosophy); Game theory; Reputation; Shapley value; Wireless ad hoc network; Computer security; Artificial intelligence; Mathematics; Wireless; Engineering","score_opus":0.01513698251937869,"score_gpt":0.2645134588495537,"score_spread":0.24937647633017498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121452655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01642185,0.00018159118,0.9821181,0.000084996675,0.000021304057,0.00008284352,0.000012336382,0.00007468182,0.0010023188],"genre_scores_gemma":[0.7541695,0.00041260943,0.24297677,0.00013761721,0.00010565294,0.00041242078,0.00006273481,0.00003393335,0.0016887891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995353,0.0021480713,0.00023961079,0.0006376159,0.0013253953,0.00029640345],"domain_scores_gemma":[0.99126774,0.005792112,0.0010308402,0.00074476673,0.00090390875,0.00026069587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005628698,0.0017328828,0.0014622032,0.0024504575,0.000799475,0.0016339646,0.0026261003,0.0017525819,0.00068315526],"category_scores_gemma":[0.012668557,0.00060861744,0.0012428813,0.0015434383,0.0029235247,0.0025857254,0.0017655923,0.0010891437,0.00016630054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010424361,0.0002002517,0.0028787828,0.00016244336,0.00020278076,0.00033727777,0.00036889047,0.8727218,0.0073493267,0.07799561,0.0003864085,0.03729213],"study_design_scores_gemma":[0.000011129514,0.00011777165,0.00019078616,0.000007744663,0.000036197962,0.000077523146,0.000039043105,0.9793727,0.0008771762,0.018805543,0.0004531214,0.000011315402],"about_ca_topic_score_codex":0.0018355541,"about_ca_topic_score_gemma":0.0010797144,"teacher_disagreement_score":0.005628698,"about_ca_system_score_codex":0.0015223577,"about_ca_system_score_gemma":0.001125535,"threshold_uncertainty_score":0.029767811},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; 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","score_opus":0.011635127426964889,"score_gpt":0.21716750167963278,"score_spread":0.2055323742526679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121480725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01755072,0.0016382823,0.9735985,0.00056450814,0.00029337493,0.00025651633,0.000077702534,0.0015234927,0.0044970387],"genre_scores_gemma":[0.508302,0.0014017328,0.482041,0.0003240407,0.00051077036,0.00063022756,0.00036356173,0.00007782994,0.006348847],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985876,0.00040522398,0.00011075418,0.00014859808,0.0006494637,0.000098364224],"domain_scores_gemma":[0.9986319,0.00031609644,0.00017969903,0.00049217045,0.00026119186,0.000119022356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016524753,0.0005251804,0.0005862416,0.00089567446,0.0011028228,0.00086608337,0.0016041289,0.0010963363,0.0012508752],"category_scores_gemma":[0.0037247436,0.00026353917,0.00031619144,0.0016789241,0.0011261066,0.0030150642,0.0027504105,0.00084807875,0.0007510548],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042456106,0.0001648443,0.00092036906,0.00044704432,0.00008108386,0.00074904365,0.00060071686,0.12698524,0.061987076,0.27454108,0.015217165,0.51788175],"study_design_scores_gemma":[0.00023141665,0.0008527892,0.00064622954,0.00007540821,0.00010184134,0.0010616716,0.00015525795,0.7964559,0.017608777,0.0988115,0.08386139,0.0001378569],"about_ca_topic_score_codex":0.0005939909,"about_ca_topic_score_gemma":0.00057381514,"teacher_disagreement_score":0.0016524753,"about_ca_system_score_codex":0.0006399753,"about_ca_system_score_gemma":0.00065327523,"threshold_uncertainty_score":0.008739233},"labels":[],"label_agreement":null},{"id":"W2121489931","doi":"10.1109/icc.2006.255664","title":"An Improved Busy-Tone Solution for Collision Avoidance in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Transmitter; Wireless ad hoc network; Network packet; Channel (broadcasting); Tone (literature); Throughput; Carrier sense multiple access with collision avoidance; Multiple Access with Collision Avoidance for Wireless; Hidden node problem; Wireless; Terminal (telecommunication); Real-time computing; Vehicular ad hoc network; Wireless network; Telecommunications; Wi-Fi array","score_opus":0.046086353421271715,"score_gpt":0.33417887621203207,"score_spread":0.28809252279076036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121489931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052940425,0.0022122385,0.9417926,0.00020199524,0.00020845834,0.00011056198,0.00002260073,0.00051009335,0.0020010818],"genre_scores_gemma":[0.7176042,0.0013281667,0.27670345,0.00035919476,0.00023279924,0.00017460102,0.00006533043,0.000057173656,0.003475066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924016,0.00023654771,0.000039538932,0.0000877381,0.00028878805,0.00010726303],"domain_scores_gemma":[0.99907136,0.00034119436,0.000086926724,0.00015447671,0.0002566107,0.00008934239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009417039,0.00056231476,0.0007528594,0.00065603637,0.00081541494,0.00092401437,0.0013567739,0.00068502605,0.001139578],"category_scores_gemma":[0.0028742317,0.00030320775,0.00030624456,0.0006235321,0.0005987287,0.0016402011,0.0015639755,0.0010105208,0.00035626942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010595669,0.00034254635,0.0015998464,0.00070639746,0.00022230072,0.00097403396,0.001296273,0.09792479,0.15867305,0.079025075,0.004487762,0.6536884],"study_design_scores_gemma":[0.00031500834,0.0015135447,0.00082367414,0.00006859544,0.00021527497,0.001531786,0.00027547692,0.91000825,0.034183417,0.033362255,0.017557962,0.00014478041],"about_ca_topic_score_codex":0.0005004961,"about_ca_topic_score_gemma":0.0006648758,"teacher_disagreement_score":0.0013567739,"about_ca_system_score_codex":0.00028034352,"about_ca_system_score_gemma":0.0006437049,"threshold_uncertainty_score":0.004980266},"labels":[],"label_agreement":null},{"id":"W2121685703","doi":"10.1109/mcom.2006.1668385","title":"MobileMAN: integration and experimentation of legacy mobile multihop ad hoc networks","year":2006,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Computer science; Wireless ad hoc network; Quality of service; Protocol stack; Mobile ad hoc network; Computer network; Vehicular ad hoc network; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Distributed computing; Optimized Link State Routing Protocol; Protocol (science); Wireless; Telecommunications; Wireless sensor network","score_opus":0.018673415045155434,"score_gpt":0.2831224144914297,"score_spread":0.2644489994462743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121685703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5574401,0.00051699305,0.41488144,0.0005083585,0.00031412375,0.00090160366,0.0004997725,0.00603209,0.01890551],"genre_scores_gemma":[0.6834521,0.00034819616,0.31173646,0.00013082262,0.000040875675,0.00052906515,0.00062034035,0.00035671444,0.0027854089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981273,0.0009290441,0.00007890866,0.00017997963,0.0005539872,0.0001308321],"domain_scores_gemma":[0.9978193,0.0011989397,0.000114941846,0.0004987887,0.00027679504,0.00009123049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025873135,0.00055805,0.00033554956,0.00061584037,0.00035393357,0.00062853267,0.0014230487,0.0005700733,0.0011510277],"category_scores_gemma":[0.0040703234,0.0003096791,0.00030426035,0.0005474104,0.0005238281,0.0010068015,0.00084621366,0.0007674006,0.00027850826],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012994653,0.0039745932,0.022435019,0.0011158749,0.00047196695,0.0017415322,0.0031452598,0.4418703,0.11805628,0.045171283,0.009536868,0.35118154],"study_design_scores_gemma":[0.00013769904,0.0024301873,0.006383598,0.00007454706,0.00009271596,0.0006268784,0.00058650284,0.9011796,0.05623697,0.0073629287,0.024816876,0.00007143555],"about_ca_topic_score_codex":0.0009616168,"about_ca_topic_score_gemma":0.0011910774,"teacher_disagreement_score":0.0025873135,"about_ca_system_score_codex":0.00044261344,"about_ca_system_score_gemma":0.00032268313,"threshold_uncertainty_score":0.0136832},"labels":[],"label_agreement":null},{"id":"W2121822500","doi":"10.1109/glocom.2010.5684283","title":"Mitigating Load Imbalance in Wireless Mesh Networks with Mixed Application Traffic Types","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Wireless mesh network; File sharing; Quality of service; Overlay network; Routing protocol; Distributed computing; Order One Network Protocol; Peer-to-peer; Dynamic Source Routing; Wireless network; The Internet; Routing (electronic design automation); Wireless; Telecommunications; World Wide Web","score_opus":0.004269417402207452,"score_gpt":0.2050389053721514,"score_spread":0.20076948796994393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121822500","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235834,0.0010120124,0.46919012,0.00060165726,0.00017358609,0.00012983776,0.00010852923,0.0010703966,0.0041305283],"genre_scores_gemma":[0.9765505,0.00022524138,0.022162545,0.000063869105,0.00009903408,0.000049421436,0.00009513194,0.000049255716,0.0007050205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992563,0.000215069,0.000054764325,0.00010759015,0.00022711806,0.00013906373],"domain_scores_gemma":[0.99800533,0.0010255638,0.00028926058,0.00021817924,0.00034296597,0.000118662385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013144498,0.00066737016,0.0006909733,0.001069679,0.0011933629,0.00094811927,0.0010470977,0.00069463474,0.00061603385],"category_scores_gemma":[0.0051438846,0.00037922652,0.00022348113,0.0008466415,0.00044331566,0.0024780275,0.0015213817,0.0003676232,0.00024856854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012077595,0.00030202023,0.0144960005,0.0002600076,0.00013025872,0.000823178,0.00054787676,0.662186,0.07068739,0.011406504,0.0030321851,0.2349208],"study_design_scores_gemma":[0.00002452752,0.00014737398,0.0016179993,0.000011339188,0.000032821357,0.00017052417,0.00019550655,0.98106647,0.008650398,0.006268363,0.001798926,0.000015663398],"about_ca_topic_score_codex":0.0010369937,"about_ca_topic_score_gemma":0.0014175106,"teacher_disagreement_score":0.0013144498,"about_ca_system_score_codex":0.00076966954,"about_ca_system_score_gemma":0.00037751286,"threshold_uncertainty_score":0.006951511},"labels":[],"label_agreement":null},{"id":"W2122466841","doi":"10.1109/ccece.2001.933605","title":"Load-balanced wireless ad hoc routing","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Wireless Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Wireless; Routing (electronic design automation); Routing protocol; Telecommunications","score_opus":0.015541307523148548,"score_gpt":0.21760971267679266,"score_spread":0.2020684051536441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122466841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038079616,0.0038529027,0.93365145,0.000831875,0.0004213892,0.00046908561,0.00033389262,0.0030053891,0.019354327],"genre_scores_gemma":[0.78576493,0.0038007214,0.19310178,0.0004257907,0.00042562792,0.00054675195,0.0010242984,0.00025877802,0.01465126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896026,0.00026701426,0.000045167722,0.00012256637,0.0004784096,0.00012669194],"domain_scores_gemma":[0.99902856,0.0002863475,0.00012815745,0.00015007608,0.00033718013,0.000069694885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767224,0.0010079234,0.00092028244,0.0009744067,0.0011851038,0.0013166104,0.0017695474,0.0008171507,0.0027664432],"category_scores_gemma":[0.0027341947,0.00034812736,0.00028038627,0.0011249058,0.00051002816,0.0025698193,0.0015172167,0.0005725427,0.0015391308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007235658,0.00043819885,0.0015798925,0.00062935305,0.00015946063,0.00038487947,0.00024431414,0.48657486,0.03948164,0.047549214,0.022027468,0.4002071],"study_design_scores_gemma":[0.00012499453,0.00027791853,0.000487898,0.000047590303,0.000057351728,0.00035536083,0.00009439411,0.9141789,0.008395963,0.037241355,0.038685154,0.000053130985],"about_ca_topic_score_codex":0.0009671666,"about_ca_topic_score_gemma":0.0014997614,"teacher_disagreement_score":0.0027664432,"about_ca_system_score_codex":0.00079283107,"about_ca_system_score_gemma":0.0007577383,"threshold_uncertainty_score":0.009254634},"labels":[],"label_agreement":null},{"id":"W2122476743","doi":"10.1109/mobiquitous.2005.18","title":"Content-based routing in mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Fault tolerance; Distributed computing; Reliability (semiconductor); Communication source; Overhead (engineering)","score_opus":0.020056607174620027,"score_gpt":0.23725854895931678,"score_spread":0.21720194178469676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122476743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012902934,0.034290727,0.92731404,0.001714372,0.001482444,0.000909888,0.00021009283,0.0027178894,0.018457614],"genre_scores_gemma":[0.362375,0.031104911,0.58813643,0.0007524322,0.0019387633,0.0014181685,0.0010294534,0.00037048763,0.012874385],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970293,0.0010731899,0.00015384931,0.00017218216,0.0014455859,0.00012582132],"domain_scores_gemma":[0.9965102,0.002020331,0.00024229503,0.0004416773,0.0006868775,0.000098586635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002814632,0.0010575403,0.0012275109,0.0018116056,0.00085567153,0.0028176904,0.0027874305,0.0024237898,0.002237689],"category_scores_gemma":[0.0076146065,0.00061432994,0.00031818362,0.0033059102,0.0015965155,0.0034738057,0.0010177545,0.0009732961,0.0014564645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002309976,0.00023171445,0.0012941355,0.0015058527,0.00015526115,0.0004783,0.00038657713,0.21008356,0.015138351,0.1746535,0.026037727,0.569804],"study_design_scores_gemma":[0.00016501168,0.00040823568,0.00069048326,0.00026727596,0.00014060175,0.0009666648,0.00013300842,0.6699716,0.007772976,0.22198796,0.09739655,0.00009959932],"about_ca_topic_score_codex":0.0013217265,"about_ca_topic_score_gemma":0.0010470174,"teacher_disagreement_score":0.0028176904,"about_ca_system_score_codex":0.0015068824,"about_ca_system_score_gemma":0.0009867868,"threshold_uncertainty_score":0.014885366},"labels":[],"label_agreement":null},{"id":"W2122642220","doi":"10.1109/icc.2008.429","title":"A Utility-Based Incentive Scheme for P2P File Sharing in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; File sharing; Scheme (mathematics); Mobile ad hoc network; Incentive; Computer network; File transfer; Wireless ad hoc network; Download; Focus (optics); Peer-to-peer; Network topology; Distributed computing; Transfer (computing); Operating system; The Internet; Microeconomics; Wireless","score_opus":0.024324067095993832,"score_gpt":0.25095860497632183,"score_spread":0.226634537880328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122642220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03206291,0.0004958127,0.9624537,0.0005652415,0.0001285598,0.0002276289,0.00007422398,0.00039589655,0.0035959803],"genre_scores_gemma":[0.8667024,0.00038074827,0.12832522,0.000097350465,0.00012246496,0.00020561446,0.00006644907,0.00003250468,0.004067253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853337,0.00067104195,0.00009394818,0.00013467803,0.00042968395,0.00013724099],"domain_scores_gemma":[0.9977951,0.000984269,0.00022647817,0.00032958918,0.00041302503,0.00025155421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002466949,0.00057472376,0.00075389363,0.00073127757,0.001196428,0.0011798823,0.0022191417,0.0010365774,0.0013339492],"category_scores_gemma":[0.0063404143,0.000299292,0.00038644747,0.0012434202,0.0010719192,0.002561909,0.0018288229,0.0009404186,0.00029988756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007803851,0.00045880323,0.0018386485,0.0003534611,0.0001016664,0.00087159354,0.0005771682,0.33595318,0.01637346,0.3704999,0.008504912,0.26368675],"study_design_scores_gemma":[0.00008499144,0.00027552675,0.00032424915,0.000023011582,0.00002994112,0.00047285037,0.000062242776,0.9274537,0.0030466185,0.057924863,0.010244771,0.00005731055],"about_ca_topic_score_codex":0.0012717242,"about_ca_topic_score_gemma":0.0012191922,"teacher_disagreement_score":0.002466949,"about_ca_system_score_codex":0.0010245094,"about_ca_system_score_gemma":0.0013138953,"threshold_uncertainty_score":0.013046622},"labels":[],"label_agreement":null},{"id":"W2122800556","doi":"10.1109/ccece.2004.1345225","title":"Composite metric for quality of service routing in OLSR","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Optimized Link State Routing Protocol; Computer network; Computer science; Ad hoc wireless distribution service; Wireless Routing Protocol; Distributed computing; Routing protocol; Link-state routing protocol; Dynamic Source Routing; Mobile ad hoc network; Zone Routing Protocol; Metrics; Quality of service; Wireless ad hoc network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.03648334275823301,"score_gpt":0.3057151354228864,"score_spread":0.2692317926646534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122800556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012399289,0.0015964629,0.9795559,0.0003138024,0.00065467675,0.00022915006,0.0002261355,0.0013045543,0.0037200279],"genre_scores_gemma":[0.26522082,0.0010091008,0.7280412,0.00023365956,0.0003761977,0.0004913996,0.0007255855,0.0003515175,0.0035505008],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99519676,0.0016964525,0.00040088277,0.0004925263,0.0020273982,0.00018597292],"domain_scores_gemma":[0.99619955,0.0010508274,0.00045595827,0.00049476244,0.0016079176,0.00019099876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028281626,0.001079158,0.001184799,0.0021115004,0.0006432943,0.0018633318,0.0011580973,0.0010792413,0.0011987917],"category_scores_gemma":[0.0069858143,0.0001888981,0.0005273354,0.0020551172,0.0006134339,0.0022695593,0.0013006348,0.0012712992,0.0006937499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00095257664,0.00024456112,0.005098044,0.00086011726,0.00036218387,0.0003971095,0.00030876847,0.2294139,0.05658392,0.21678156,0.018641645,0.47035557],"study_design_scores_gemma":[0.000036586574,0.00069168495,0.002719643,0.000052544467,0.00010367149,0.00071342534,0.00011431555,0.89584786,0.019055517,0.038259294,0.042247664,0.00015770641],"about_ca_topic_score_codex":0.0008248598,"about_ca_topic_score_gemma":0.0009852735,"teacher_disagreement_score":0.0028281626,"about_ca_system_score_codex":0.00088316033,"about_ca_system_score_gemma":0.0008289523,"threshold_uncertainty_score":0.014956951},"labels":[],"label_agreement":null},{"id":"W2122968084","doi":"10.1109/glocom.2008.ecp.155","title":"A Self-X Approach for OLSR Routing Protocol in Large-Scale Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Hazy Sighted Link State Routing Protocol; Optimized Link State Routing Protocol; Order One Network Protocol; Ad hoc wireless distribution service; Distributed computing; Routing protocol; Wireless ad hoc network; Wireless Routing Protocol; Wireless network; Mesh networking; Network packet; Mobile ad hoc network; Throughput; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.016641288630637085,"score_gpt":0.25016432620567575,"score_spread":0.23352303757503867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122968084","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020303983,0.0007838984,0.9706242,0.00041848523,0.00017777091,0.00014656223,0.000020697491,0.00077675213,0.0067476192],"genre_scores_gemma":[0.57942635,0.0013861886,0.40731612,0.00043143073,0.00021820737,0.0003103604,0.000108198634,0.00013016418,0.010673051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957293,0.00016341536,0.000024382427,0.000046599274,0.00017034353,0.000022254444],"domain_scores_gemma":[0.9996793,0.000082775834,0.000044534794,0.00007632018,0.000100851175,0.000016167594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005077537,0.0002693623,0.00023226812,0.00052467734,0.0005462343,0.000489233,0.0006723717,0.000480148,0.00080681284],"category_scores_gemma":[0.0007821442,0.00013898304,0.00042080984,0.00030852156,0.00044230954,0.00089373725,0.00063221314,0.0005826126,0.00034713923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015958535,0.00031187362,0.0026625374,0.000405268,0.00015943278,0.0009506811,0.00060281757,0.15961246,0.10025111,0.26412445,0.008747005,0.46201283],"study_design_scores_gemma":[0.00003913234,0.00061686354,0.0014512236,0.00004105033,0.00009809455,0.0011841747,0.00016928556,0.89516515,0.031903774,0.03372719,0.03552653,0.00007746017],"about_ca_topic_score_codex":0.00038011186,"about_ca_topic_score_gemma":0.000597703,"teacher_disagreement_score":0.00080681284,"about_ca_system_score_codex":0.00021944602,"about_ca_system_score_gemma":0.00030410086,"threshold_uncertainty_score":0.0026990175},"labels":[],"label_agreement":null},{"id":"W2123168387","doi":"10.1109/glocom.2004.1379003","title":"Mobility-aware pro-active low energy (MAPLE) clustering in ad hoc mobile wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Maple; Cluster analysis; Wireless ad hoc network; Mobile ad hoc network; Computer network; Wireless; Mobile computing; Wireless sensor network; Telecommunications; Artificial intelligence","score_opus":0.009083795368124736,"score_gpt":0.22994405369001622,"score_spread":0.2208602583218915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123168387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051914304,0.00051554875,0.99246454,0.0002058225,0.000054767705,0.0000542061,0.0000152167695,0.00023630232,0.0012620338],"genre_scores_gemma":[0.42378187,0.001399638,0.5690053,0.00025224555,0.0002192259,0.0003343639,0.00012822633,0.00009066414,0.004788531],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995141,0.0001559346,0.000021549602,0.00006946672,0.00018685349,0.00005212784],"domain_scores_gemma":[0.9996755,0.000096449236,0.000046585614,0.00006268338,0.0000847199,0.000034018405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064598996,0.0005494019,0.0006122123,0.0007269508,0.0009534009,0.0008559619,0.0022116706,0.00095803937,0.0006330467],"category_scores_gemma":[0.0012340782,0.00029715872,0.00053042057,0.000838525,0.0008130431,0.0014737353,0.0013727582,0.000921708,0.00037825634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093848765,0.00014102146,0.0010849206,0.0003183085,0.00008802833,0.0002780528,0.0005090734,0.5513982,0.021685474,0.18537821,0.0066988743,0.23232597],"study_design_scores_gemma":[0.000021044116,0.00015976034,0.00037612906,0.000022888224,0.00002792219,0.0002470818,0.000091424205,0.9450678,0.005329384,0.031941596,0.016671838,0.00004311701],"about_ca_topic_score_codex":0.0011814946,"about_ca_topic_score_gemma":0.0017484225,"teacher_disagreement_score":0.0022116706,"about_ca_system_score_codex":0.0005778353,"about_ca_system_score_gemma":0.00059655815,"threshold_uncertainty_score":0.004192531},"labels":[],"label_agreement":null},{"id":"W2123586911","doi":"10.1109/wamicon.2006.351911","title":"Tactical AD HOC Scenarios Generator Coupled with Channel Modeling","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Wireless ad hoc network; Computer science; Generator (circuit theory); Vehicular ad hoc network; Channel (broadcasting); Distributed computing; Set (abstract data type); Wireless; Mobile ad hoc network; Wireless network; Network topology; Topology (electrical circuits); Physical layer; Computer network; Engineering; Telecommunications; Power (physics); Electrical engineering","score_opus":0.012648775877849135,"score_gpt":0.21233299038704706,"score_spread":0.19968421450919793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123586911","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1022245,0.0000796903,0.8896891,0.00012928476,0.000074916956,0.00017682982,0.0001566748,0.0017563815,0.005712695],"genre_scores_gemma":[0.8774799,0.00010451012,0.119020596,0.00004418317,0.000026318243,0.00022845207,0.00021981317,0.00016652353,0.002709644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961734,0.00016904251,0.000014542283,0.000043496217,0.000117489195,0.000038089758],"domain_scores_gemma":[0.99878234,0.00069426285,0.00009795667,0.00022137765,0.00013961887,0.0000643534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045005188,0.0005391347,0.000490189,0.00040146036,0.00030550736,0.00034706213,0.00082760234,0.0005833552,0.0023715082],"category_scores_gemma":[0.0019139161,0.00030010834,0.00037642842,0.0003863042,0.00035427758,0.0006965986,0.0006462276,0.00063853106,0.0002770123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003852773,0.000049013568,0.0004430364,0.000024505955,0.0000148670715,0.00010920809,0.00003458947,0.9816669,0.0030795643,0.005932105,0.00030601159,0.008301785],"study_design_scores_gemma":[0.000004494579,0.000014877283,0.000054516444,8.883e-7,0.0000024449284,0.00002092618,0.0000024886751,0.9979202,0.00074383296,0.0009605451,0.0002721775,0.000002716555],"about_ca_topic_score_codex":0.0019368645,"about_ca_topic_score_gemma":0.0011498563,"teacher_disagreement_score":0.0023715082,"about_ca_system_score_codex":0.00026854224,"about_ca_system_score_gemma":0.00035040185,"threshold_uncertainty_score":0.007933497},"labels":[],"label_agreement":null},{"id":"W2123814287","doi":"10.4236/wsn.2010.24038","title":"Comparative Review of QoS-Aware On-Demand Routing in Ad Hoc Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Wireless Sensor Network","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Quality of service; Computer network; Mobile ad hoc network; Mobile QoS; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing (electronic design automation); Routing protocol; Optimized Link State Routing Protocol; Wireless; Distributed computing; Service (business); Telecommunications; Network packet; Service provider","score_opus":0.016187667210714886,"score_gpt":0.2647569987575913,"score_spread":0.2485693315468764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123814287","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055451253,0.9330031,0.035486706,0.0011596043,0.0013903487,0.00006503578,0.00012208523,0.000110507695,0.023117308],"genre_scores_gemma":[0.023915386,0.9463937,0.023229422,0.00055338803,0.0010578076,0.000040113544,0.0002750691,0.000038536666,0.0044964734],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938846,0.00016023451,0.00008588735,0.00006789896,0.0002618241,0.00003561648],"domain_scores_gemma":[0.99802953,0.0011164455,0.00011528336,0.00007622454,0.00060819945,0.000054304826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011859682,0.00047426662,0.00069075247,0.0019687985,0.0003252671,0.001232129,0.00086562335,0.0006890883,0.0019173503],"category_scores_gemma":[0.0024172603,0.00029853536,0.00033039768,0.004054594,0.00020806772,0.002068211,0.00039764238,0.00041023447,0.0007543981],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108665285,0.000086259824,0.0005980115,0.00975769,0.000084384745,0.00018443297,0.000098874465,0.0083860075,0.003671942,0.018407846,0.015233398,0.9433824],"study_design_scores_gemma":[0.000017799577,0.00048279433,0.0017449895,0.0029167666,0.00023531355,0.0013914127,0.00034257502,0.012381271,0.0043235966,0.009569695,0.9665258,0.00006803938],"about_ca_topic_score_codex":0.0008285626,"about_ca_topic_score_gemma":0.0011809674,"teacher_disagreement_score":0.0019687985,"about_ca_system_score_codex":0.0005427984,"about_ca_system_score_gemma":0.0007770786,"threshold_uncertainty_score":0.0064142346},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.02377303206741777,"score_gpt":0.2757971317582326,"score_spread":0.25202409969081485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124297703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008296354,0.0003935005,0.9897288,0.0001021748,0.00006787667,0.00010200966,0.000030988245,0.00013492696,0.0011433926],"genre_scores_gemma":[0.22309552,0.0009787502,0.77413684,0.00009655498,0.00011925927,0.00044335154,0.00016692752,0.000057304667,0.0009055345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982241,0.0008049326,0.00010160625,0.00012780732,0.00069185154,0.00004968208],"domain_scores_gemma":[0.9963243,0.0027356565,0.00017044877,0.00017594025,0.00053179485,0.000061956336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020678234,0.0010278265,0.0009578199,0.0018116126,0.0008042568,0.0009166897,0.0013580874,0.00082568737,0.0010151172],"category_scores_gemma":[0.00925751,0.00043714978,0.00076256413,0.0018179389,0.0006880921,0.0015126459,0.00094075914,0.000662765,0.0002765315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006492996,0.0000460274,0.00087930326,0.00024873184,0.000078160054,0.00012848791,0.00014338236,0.8744886,0.0026780062,0.023033764,0.0016093671,0.096601225],"study_design_scores_gemma":[0.000012955124,0.00004766504,0.00015563869,0.000024040351,0.000020193716,0.000081880156,0.000017486376,0.9839499,0.0015951284,0.0121928165,0.0018904648,0.000011773433],"about_ca_topic_score_codex":0.0012384156,"about_ca_topic_score_gemma":0.0014309189,"teacher_disagreement_score":0.0020678234,"about_ca_system_score_codex":0.000965055,"about_ca_system_score_gemma":0.0007994884,"threshold_uncertainty_score":0.010935783},"labels":[],"label_agreement":null},{"id":"W2124311847","doi":"10.1109/snpd-sawn.2005.1","title":"A Design Framework for Wireless MANET QoS Gateway","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Quality of service; Gateway (web page); Wireless; Wireless ad hoc network; Telecommunications; World Wide Web; Network packet","score_opus":0.024780209982315643,"score_gpt":0.26126882044701843,"score_spread":0.2364886104647028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124311847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013504568,0.00021116479,0.99111897,0.00026387826,0.00011108369,0.00019036731,0.000034056262,0.0010998456,0.0056201117],"genre_scores_gemma":[0.062185887,0.0008036607,0.91734266,0.0003954231,0.000157204,0.0009785346,0.00023796818,0.00045418093,0.01744453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993924,0.00014082994,0.000059855804,0.00009768168,0.00022884454,0.00008043249],"domain_scores_gemma":[0.9995801,0.00006418847,0.00003335155,0.00009250847,0.00015028415,0.00007964042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001827676,0.00073526235,0.00050071254,0.00074168155,0.0010939133,0.0026220856,0.0024223549,0.0019063352,0.0045933053],"category_scores_gemma":[0.0016309323,0.00066895667,0.0010050854,0.00044826348,0.00093510025,0.0022535385,0.0019537236,0.0023520936,0.0026734725],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007495815,0.0000944323,0.00037749688,0.00026472248,0.000050829378,0.0008645194,0.00087745977,0.03180389,0.018253462,0.82966375,0.011757368,0.105917044],"study_design_scores_gemma":[0.000107012,0.00025485965,0.00027428035,0.00019591542,0.00012471635,0.001676245,0.00023777521,0.33445,0.01478187,0.16440219,0.4833886,0.000106577514],"about_ca_topic_score_codex":0.0015636017,"about_ca_topic_score_gemma":0.0018254415,"teacher_disagreement_score":0.0045933053,"about_ca_system_score_codex":0.0009246133,"about_ca_system_score_gemma":0.0014409999,"threshold_uncertainty_score":0.015366137},"labels":[],"label_agreement":null},{"id":"W2124377129","doi":"10.1016/j.comnet.2008.09.012","title":"Mobility-aware clustering algorithms with interference constraints in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Interference (communication); Throughput; Wireless mesh network; Distributed computing; Metric (unit); Wireless; Wireless network; Algorithm; Telecommunications; Machine learning","score_opus":0.017695455332587318,"score_gpt":0.225574170565699,"score_spread":0.2078787152331117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124377129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042154647,0.0012216477,0.95309275,0.0004102266,0.000108869426,0.00007899215,0.00007075829,0.0003272064,0.0025348458],"genre_scores_gemma":[0.67490757,0.000884912,0.3207438,0.00015293356,0.00018490056,0.00017142764,0.00023710453,0.00014389856,0.0025734843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906737,0.0003694491,0.00005633259,0.00012749912,0.00026043158,0.00011892037],"domain_scores_gemma":[0.99674964,0.0020321144,0.00025078576,0.00032857226,0.00051366596,0.00012513943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018564324,0.0006780512,0.0011328505,0.0011088147,0.0011159951,0.0009985375,0.00304349,0.00113083,0.0011634147],"category_scores_gemma":[0.0076887025,0.00066723087,0.00047360573,0.0023162002,0.0006610233,0.0023876023,0.0016978703,0.0009828499,0.00028787574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022456347,0.000095175885,0.00088593835,0.00009550849,0.00007267219,0.00004708736,0.00015203684,0.8702255,0.00250845,0.018685715,0.002305229,0.10470212],"study_design_scores_gemma":[0.000018681974,0.000029400991,0.00014590465,0.0000066378566,0.000012959681,0.000029146635,0.000032709184,0.990921,0.0006466729,0.007576316,0.00057270436,0.000007735598],"about_ca_topic_score_codex":0.003790409,"about_ca_topic_score_gemma":0.0047010398,"teacher_disagreement_score":0.003790409,"about_ca_system_score_codex":0.0009891904,"about_ca_system_score_gemma":0.0011139611,"threshold_uncertainty_score":0.009817839},"labels":[],"label_agreement":null},{"id":"W2124446522","doi":"10.1109/pccc.2010.5682307","title":"Multiple description video multicast in MANETs","year":2010,"lang":"en","type":"article","venue":"International Performance, Computing, and Communications Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Multicast; Computer science; Computer network; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Multiple description coding; Xcast; Source-specific multicast; Pragmatic General Multicast; Distributed computing; Reliable multicast; IP multicast; Network packet","score_opus":0.026062257849050086,"score_gpt":0.26828848189874316,"score_spread":0.24222622404969307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124446522","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03529082,0.009206061,0.9430069,0.0013136545,0.00046733022,0.00026557702,0.00023127439,0.0010660641,0.009152403],"genre_scores_gemma":[0.71477723,0.008282235,0.26698238,0.00059822615,0.00056601816,0.00036476145,0.0006447741,0.000103194936,0.0076811854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991974,0.00032540518,0.00004019312,0.00007700989,0.0002787881,0.00008115642],"domain_scores_gemma":[0.99933654,0.00034624242,0.00007292875,0.000066777124,0.0001352089,0.000042297455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011389285,0.00041795516,0.0006545484,0.0009542756,0.00073542283,0.00079584785,0.0009184736,0.00093385106,0.0014089799],"category_scores_gemma":[0.001779821,0.00021732964,0.00028803933,0.0010843234,0.00028981638,0.0017421759,0.0011344666,0.0005294305,0.00039434116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047996236,0.00017152634,0.0018283778,0.0011183259,0.00016448008,0.0010103541,0.0003923148,0.22557804,0.01863985,0.09752891,0.020851789,0.6322361],"study_design_scores_gemma":[0.00011994161,0.00038668176,0.000636941,0.00009362386,0.00008548516,0.00074463245,0.00021199044,0.8724558,0.0077013914,0.06550183,0.05200816,0.000053579293],"about_ca_topic_score_codex":0.001085906,"about_ca_topic_score_gemma":0.0008750695,"teacher_disagreement_score":0.0014089799,"about_ca_system_score_codex":0.000467422,"about_ca_system_score_gemma":0.00037768003,"threshold_uncertainty_score":0.006023288},"labels":[],"label_agreement":null},{"id":"W2125411441","doi":"10.1109/icccn.2003.1284211","title":"KELOP: distributed key-value lookup in wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Overhead (engineering); Optimized Link State Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Scalability; Node (physics); Key (lock); Wireless network; Wireless; Routing protocol; Network packet; Computer security; Telecommunications; Engineering","score_opus":0.007512863055798477,"score_gpt":0.21826731092193713,"score_spread":0.21075444786613864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125411441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023568366,0.003217134,0.9624184,0.0005210229,0.00026645313,0.0002874165,0.00016229389,0.003983357,0.0055756033],"genre_scores_gemma":[0.7065275,0.0028118447,0.28170875,0.0003753178,0.00024687193,0.00046500246,0.00071918446,0.00022867092,0.006916871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992211,0.00020956286,0.000075439326,0.000088327884,0.00030047566,0.0001051278],"domain_scores_gemma":[0.998792,0.00048682213,0.00010944346,0.00035718156,0.00016127178,0.00009341994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001612061,0.00050504867,0.00081343093,0.0007413713,0.0008616549,0.0015525905,0.0016576501,0.00092199526,0.0015435126],"category_scores_gemma":[0.002959585,0.0003253958,0.00020338004,0.001042909,0.0010358262,0.0040812553,0.0029215044,0.0009743604,0.00090043765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012022192,0.00022025345,0.0018113349,0.001192947,0.000121118894,0.0009750056,0.00050620263,0.12035414,0.042632505,0.15290263,0.0259957,0.65208596],"study_design_scores_gemma":[0.0004679325,0.0008083017,0.0007194301,0.00010315049,0.00012497051,0.0016809928,0.00031415295,0.7227031,0.03882338,0.15789689,0.07621192,0.00014575462],"about_ca_topic_score_codex":0.0005659142,"about_ca_topic_score_gemma":0.0005833663,"teacher_disagreement_score":0.0016576501,"about_ca_system_score_codex":0.00042954367,"about_ca_system_score_gemma":0.00091593625,"threshold_uncertainty_score":0.00852555},"labels":[],"label_agreement":null},{"id":"W2125852758","doi":"10.1002/wcm.391","title":"Vulnerability assessment of <i>ad hoc</i> networks to MAC layer misbehavior","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Vulnerability (computing); Node (physics); Exploit; Network packet; Computer security; Mobile ad hoc network; Channel (broadcasting); Protocol (science); Wireless; Telecommunications","score_opus":0.019965237451510926,"score_gpt":0.30802571052148425,"score_spread":0.28806047306997334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125852758","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9272423,0.00059587206,0.06645517,0.00023242403,0.00003940008,0.00013785386,0.000090593014,0.00042318986,0.004783236],"genre_scores_gemma":[0.9965216,0.00009104427,0.0031904352,0.000014907412,0.000004382119,0.000009740921,0.00002573911,0.0000057902475,0.0001363401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898523,0.00038881376,0.00005025426,0.00007078523,0.00041788368,0.00008703867],"domain_scores_gemma":[0.9946714,0.0025296055,0.0010920352,0.0004749732,0.000985884,0.00024609567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001010287,0.00038866125,0.00030102074,0.0015067402,0.000451279,0.0006792681,0.0003545308,0.00046529112,0.0003489745],"category_scores_gemma":[0.0062259194,0.00013274694,0.00025205908,0.00040444735,0.0005927532,0.00093501253,0.0007585641,0.00030353255,0.00008442349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012475802,0.00031772678,0.26533797,0.00061531825,0.00044928349,0.0024680472,0.0015777028,0.4336113,0.10963593,0.014886814,0.0027586569,0.16709365],"study_design_scores_gemma":[0.000019456456,0.0012385896,0.037683673,0.00011326161,0.00017077236,0.0025568397,0.0009334687,0.88670784,0.0592258,0.008393407,0.0028777441,0.000079245845],"about_ca_topic_score_codex":0.0008777572,"about_ca_topic_score_gemma":0.00046026884,"teacher_disagreement_score":0.0015067402,"about_ca_system_score_codex":0.0005554881,"about_ca_system_score_gemma":0.00025028602,"threshold_uncertainty_score":0.0053429604},"labels":[],"label_agreement":null},{"id":"W2125880075","doi":"10.1109/lcn.2008.4664292","title":"CDMA/MPLS platforms for WIMAX mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Time division multiple access; Computer science; WiMAX; Code division multiple access; Transmitter; Multi-frequency time division multiple access; Frequency-division multiple access; Network packet; Wireless; Telecommunications; MIMO; MIMO-OFDM; Orthogonal frequency-division multiplexing","score_opus":0.023384979505832217,"score_gpt":0.23613729862655722,"score_spread":0.212752319120725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125880075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016882867,0.00420732,0.8552473,0.0017605266,0.0006497613,0.00039432305,0.0005765999,0.007209834,0.11307133],"genre_scores_gemma":[0.2460678,0.0055063977,0.6193054,0.0005725087,0.0005286732,0.00056412566,0.0011843604,0.00073112734,0.12553963],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997404,0.00005118972,0.000009636341,0.00002110791,0.00015379494,0.00002386815],"domain_scores_gemma":[0.99978226,0.000048596106,0.00002240339,0.00004833118,0.00007782079,0.000020584695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037574203,0.00036949522,0.00019614487,0.0005146242,0.00042223712,0.0009359434,0.0006068222,0.00052765035,0.018484958],"category_scores_gemma":[0.0006898557,0.00020671496,0.00016837606,0.000503793,0.00025436707,0.0008583361,0.00056812144,0.001025275,0.0064352024],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027463937,0.00019644613,0.0007633937,0.0003799215,0.000025007092,0.0003882975,0.00015679866,0.01865601,0.1282607,0.34108016,0.05159015,0.45822853],"study_design_scores_gemma":[0.00007052442,0.00039377608,0.0010321725,0.00013328769,0.000037959035,0.0005062394,0.00009108617,0.1997446,0.09079102,0.0951629,0.6119718,0.00006460948],"about_ca_topic_score_codex":0.0005600954,"about_ca_topic_score_gemma":0.0008978957,"teacher_disagreement_score":0.018484958,"about_ca_system_score_codex":0.00061366224,"about_ca_system_score_gemma":0.00037441243,"threshold_uncertainty_score":0.06183833},"labels":[],"label_agreement":null},{"id":"W2126051929","doi":"10.1109/vetecs.2003.1207124","title":"Load-aware on-demand routing (LAOR) protocol for mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Routing protocol; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Distance-vector routing protocol; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Distributed computing; Network packet; Telecommunications; Wireless","score_opus":0.0185664943137992,"score_gpt":0.28853357137236785,"score_spread":0.26996707705856865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126051929","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027991964,0.007816322,0.936848,0.0015474517,0.00091385894,0.0008890785,0.00054249424,0.0040603075,0.01939053],"genre_scores_gemma":[0.53738236,0.015263627,0.42010403,0.0011895754,0.0007945658,0.0018215202,0.0025480988,0.0005081207,0.020388134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994165,0.00016210512,0.000044378023,0.000058395144,0.00027318546,0.000045522705],"domain_scores_gemma":[0.99920255,0.0002548255,0.000122458,0.00018096219,0.0002036014,0.00003571522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006808433,0.00064754573,0.0006301392,0.0006348907,0.00085101236,0.0009616924,0.0017009638,0.0006498518,0.0012874496],"category_scores_gemma":[0.0014288389,0.000226581,0.0003396453,0.00080546364,0.0005026893,0.0013075593,0.00091673376,0.00081138837,0.001018272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033048054,0.00022379716,0.0016538192,0.0016456678,0.00016010452,0.0006336775,0.0005157149,0.043020975,0.10768646,0.07388048,0.03383149,0.73641735],"study_design_scores_gemma":[0.00017882606,0.0009722271,0.0024978155,0.00020696485,0.0002514503,0.0023450959,0.00051583967,0.48454434,0.055725142,0.046309523,0.40619895,0.00025373924],"about_ca_topic_score_codex":0.0010283422,"about_ca_topic_score_gemma":0.0018697717,"teacher_disagreement_score":0.0017009638,"about_ca_system_score_codex":0.00056431507,"about_ca_system_score_gemma":0.0007628251,"threshold_uncertainty_score":0.004306972},"labels":[],"label_agreement":null},{"id":"W2126139071","doi":"10.1109/pccc.2003.1203691","title":"Optimal cross-layer designs for energy-efficient wireless ad hoc and sensor networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Wireless sensor network; Efficient energy use; Distributed computing; Probabilistic logic; Mobile ad hoc network; Network layer; Routing protocol; Cross-layer optimization; Routing (electronic design automation); Wireless; Layer (electronics); Wireless network; Engineering; Telecommunications; Network packet; Electrical engineering","score_opus":0.024097583423090325,"score_gpt":0.26121986081920756,"score_spread":0.23712227739611724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126139071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073534646,0.00041012277,0.99041814,0.00009267948,0.000043675518,0.00005373277,0.000014507744,0.00009534426,0.0015183165],"genre_scores_gemma":[0.57344735,0.00092649396,0.42224318,0.00025822246,0.00015223536,0.00046897563,0.000094067895,0.00008418387,0.002325348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970181,0.0015001544,0.00016490991,0.00032995592,0.000731813,0.00025511417],"domain_scores_gemma":[0.9967997,0.0014035198,0.00045050634,0.0004173593,0.0008250077,0.0001038946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062714536,0.001201351,0.00064473244,0.0009134875,0.00053837086,0.0014652922,0.0012990414,0.0008173033,0.0021310162],"category_scores_gemma":[0.0071539734,0.0008664192,0.00050248683,0.0007203059,0.000990732,0.0015999464,0.0015936602,0.0011552557,0.0005252728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022763474,0.00013361643,0.0008877668,0.00024546238,0.00020320881,0.000115832394,0.0002541208,0.7374942,0.015417569,0.14433898,0.0020149546,0.098666675],"study_design_scores_gemma":[0.000033217555,0.00013790566,0.00018044362,0.000018860304,0.00004561985,0.000051599203,0.000029794828,0.96725833,0.0026145638,0.027853662,0.0017602602,0.000015704243],"about_ca_topic_score_codex":0.00054149266,"about_ca_topic_score_gemma":0.00096751534,"teacher_disagreement_score":0.0062714536,"about_ca_system_score_codex":0.00092837296,"about_ca_system_score_gemma":0.0013191993,"threshold_uncertainty_score":0.033167005},"labels":[],"label_agreement":null},{"id":"W2126393089","doi":"10.1007/978-3-540-28634-9_12","title":"Connectivity of Wireless Sensor Networks with Constant Density","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Constant (computer programming); Square (algebra); Wireless sensor network; RADIUS; Fraction (chemistry); Computer science; Wireless; Topology (electrical circuits); Combinatorics; Mathematics; Telecommunications; Computer network; Geometry","score_opus":0.009789113678247734,"score_gpt":0.2119327028476343,"score_spread":0.20214358916938657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126393089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07989738,0.022990368,0.8149345,0.0019665689,0.0007147467,0.0001948313,0.00051333435,0.0008323395,0.077955976],"genre_scores_gemma":[0.8292511,0.027585853,0.11185968,0.00034260913,0.0011679495,0.00055432064,0.0008629723,0.00029633613,0.028079195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995459,0.00013257927,0.00002153907,0.00010575303,0.00015704034,0.00003717616],"domain_scores_gemma":[0.99872977,0.00091551046,0.00010002394,0.000098832796,0.000115291434,0.000040636318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033188114,0.0004726404,0.00058356434,0.0013583914,0.00048507488,0.001020234,0.001294717,0.0008005007,0.0034159285],"category_scores_gemma":[0.0034053773,0.0004947541,0.00037848434,0.0023145217,0.00086627854,0.0022847468,0.00086199766,0.0007979555,0.0003940206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020047455,0.00006710431,0.0011650042,0.00091289065,0.000074502874,0.00042844488,0.000395984,0.2588512,0.006822706,0.50449944,0.0187242,0.20785813],"study_design_scores_gemma":[0.00007284106,0.00017021467,0.0013021919,0.00011110663,0.00007348057,0.0014336348,0.00013746136,0.53033906,0.0017615117,0.43266645,0.031897154,0.000034892968],"about_ca_topic_score_codex":0.0009031851,"about_ca_topic_score_gemma":0.0007785655,"teacher_disagreement_score":0.0034159285,"about_ca_system_score_codex":0.00051515,"about_ca_system_score_gemma":0.00031085845,"threshold_uncertainty_score":0.011427462},"labels":[],"label_agreement":null},{"id":"W2126534256","doi":"10.1155/2009/764047","title":"Multicast Routing Protocols in Mobile Ad Hoc Networks: A Comparative Survey and Taxonomy","year":2009,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multicast; Computer network; Geocast; Mobile ad hoc network; Protocol Independent Multicast; Distributed computing; Xcast; Wireless ad hoc network; Routing protocol; Distance Vector Multicast Routing Protocol; Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.09889582834060706,"score_gpt":0.33665263039289167,"score_spread":0.2377568020522846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126534256","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008311024,0.8812041,0.08221081,0.0018017986,0.001381228,0.00045132163,0.0001939319,0.000366974,0.02407877],"genre_scores_gemma":[0.03165168,0.86267877,0.0988179,0.0007365772,0.002391995,0.00037467442,0.0005346544,0.00008478667,0.0027289642],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979938,0.000444035,0.00034199786,0.00019382898,0.0008786563,0.00014762336],"domain_scores_gemma":[0.99774027,0.0013039723,0.00017904579,0.00014219218,0.0005589994,0.00007557959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021607885,0.0011184019,0.0019185488,0.0061156093,0.0013044669,0.00349376,0.0026705018,0.002521741,0.0017329728],"category_scores_gemma":[0.0035917265,0.0007158015,0.0007799921,0.011887215,0.0010902985,0.007091679,0.0014942596,0.00207524,0.0012033668],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012000751,0.00027111743,0.0018882884,0.008182155,0.00008585511,0.00048142328,0.0009184699,0.0063319756,0.0025247147,0.05892399,0.015058782,0.9052133],"study_design_scores_gemma":[0.000058866954,0.000725449,0.0032534373,0.0055348035,0.00022372535,0.005332373,0.0017324211,0.024461418,0.002716957,0.088539414,0.8672124,0.00020868775],"about_ca_topic_score_codex":0.0011491643,"about_ca_topic_score_gemma":0.0007553289,"teacher_disagreement_score":0.0061156093,"about_ca_system_score_codex":0.0009391185,"about_ca_system_score_gemma":0.001407941,"threshold_uncertainty_score":0.011427462},"labels":[],"label_agreement":null},{"id":"W2126605442","doi":"10.1109/lcn.2010.5735788","title":"A variable neighborhood search method for multi-objective channel assignment problem in Multi-Radio WMNs","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Handover; Throughput; Computer network; Channel (broadcasting); Overhead (engineering); Heuristic; Channel allocation schemes; Variable (mathematics); Interference (communication); Variable neighborhood search; Wireless; Mathematical optimization; Wireless network; Algorithm; Metaheuristic; Mathematics; Telecommunications","score_opus":0.03884085931076241,"score_gpt":0.3168400684836015,"score_spread":0.2779992091728391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126605442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010080214,0.00026015838,0.9878626,0.00013465148,0.0000296083,0.000042637617,0.000026711115,0.00008645196,0.0014769784],"genre_scores_gemma":[0.44929224,0.00037402732,0.54689777,0.00015898707,0.000072173214,0.0004939099,0.0001313667,0.00007837811,0.0025011224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948466,0.00029530493,0.000016998843,0.00006597425,0.00009021318,0.000046762583],"domain_scores_gemma":[0.999271,0.00053504127,0.00006664487,0.00002119979,0.00007512538,0.00003106859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013782411,0.00071162457,0.0012108549,0.0007347357,0.0004963964,0.0005890513,0.0012431098,0.0010731586,0.0014676682],"category_scores_gemma":[0.0018972396,0.0004999214,0.00062210864,0.000876471,0.00061571505,0.00096496765,0.0006748156,0.0008239249,0.00017602967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021779657,0.000022940809,0.00015824704,0.000030762523,0.000021416326,0.000021426911,0.000022604323,0.9805696,0.000270025,0.0044418895,0.0004005747,0.014018669],"study_design_scores_gemma":[0.0000099829085,0.0000144519945,0.000024379382,0.0000037458906,0.0000033265876,0.0000054266097,0.0000056454287,0.9983259,0.000064583684,0.0013420304,0.00019828627,0.000002170707],"about_ca_topic_score_codex":0.0054532066,"about_ca_topic_score_gemma":0.004814827,"teacher_disagreement_score":0.0054532066,"about_ca_system_score_codex":0.0007504137,"about_ca_system_score_gemma":0.0011017943,"threshold_uncertainty_score":0.010842919},"labels":[],"label_agreement":null},{"id":"W2126761450","doi":"10.1109/vtcf.2006.431","title":"On Link Reliability in Wireless Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Reliability (semiconductor); Wireless ad hoc network; Network packet; Packet forwarding; Optimized Link State Routing Protocol; Geocast; Vehicular ad hoc network; Wireless; Distributed computing; Routing protocol; Telecommunications","score_opus":0.006428539356868657,"score_gpt":0.21587788437845815,"score_spread":0.2094493450215895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126761450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020212863,0.10472916,0.8448109,0.0037254132,0.0026397216,0.00016367309,0.00021492681,0.00033061422,0.023172734],"genre_scores_gemma":[0.691158,0.17119038,0.110950015,0.0017123483,0.0144220535,0.00067812554,0.0005155147,0.00063322287,0.008740396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941438,0.0024396984,0.00032058553,0.0005685608,0.0021555934,0.00037181162],"domain_scores_gemma":[0.9741512,0.020084094,0.0012499647,0.001090065,0.003186091,0.0002385017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0061123325,0.0022043735,0.002067061,0.0034492791,0.0011362664,0.0022512504,0.0023893293,0.0022492486,0.0018283857],"category_scores_gemma":[0.025748463,0.00075665815,0.0010298756,0.004954846,0.0033478832,0.0058219605,0.0020912844,0.0036251321,0.0010092272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028798974,0.00011543602,0.0026127072,0.0014740948,0.00021484854,0.0010119699,0.0009801087,0.5089109,0.0030352522,0.3445416,0.011619355,0.12519568],"study_design_scores_gemma":[0.000042979824,0.00031221873,0.0011799678,0.00061933434,0.0001674524,0.0007478853,0.00022458374,0.5928283,0.0014595899,0.37290016,0.029419906,0.000097514596],"about_ca_topic_score_codex":0.0025464783,"about_ca_topic_score_gemma":0.00092851976,"teacher_disagreement_score":0.0061123325,"about_ca_system_score_codex":0.002165829,"about_ca_system_score_gemma":0.0010536686,"threshold_uncertainty_score":0.032325506},"labels":[],"label_agreement":null},{"id":"W2126775139","doi":"10.1109/icdcs.2002.1022287","title":"On-demand multicasting in ad-hoc networks:comparing AODV and ODMRP","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Protocol Independent Multicast; Ad hoc On-Demand Distance Vector Routing; Geocast; Distributed computing; Distance Vector Multicast Routing Protocol; Mobile ad hoc network; Wireless ad hoc network; Xcast; Optimized Link State Routing Protocol; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.017451091126228568,"score_gpt":0.23781248745356093,"score_spread":0.22036139632733237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126775139","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.834658,0.03838503,0.08158629,0.001441476,0.00083185703,0.00030747397,0.00021688725,0.0008054124,0.041767627],"genre_scores_gemma":[0.9487417,0.010123625,0.037620727,0.00012922994,0.00027052348,0.000035913108,0.00023623148,0.00008734008,0.0027546359],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986904,0.0004179548,0.00006402745,0.00006430158,0.00067013374,0.00009307592],"domain_scores_gemma":[0.99744165,0.0015331246,0.00014008401,0.00014851548,0.0006477549,0.00008888009],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00136566,0.00051054766,0.00056428544,0.0018495348,0.0004623437,0.0009665167,0.0010999867,0.00070569036,0.00086314185],"category_scores_gemma":[0.003926714,0.00015782044,0.00030186248,0.0012487111,0.00034586186,0.0029378093,0.0007301015,0.00040691157,0.00017640738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031779509,0.0009434141,0.019898282,0.0015986942,0.00042340424,0.00044137004,0.00071845046,0.10969108,0.021559127,0.017653376,0.0030356988,0.82085913],"study_design_scores_gemma":[0.00039949775,0.008854318,0.022666182,0.00028995506,0.00071205606,0.0012489825,0.00317917,0.87744135,0.041432854,0.017103218,0.02648811,0.00018424039],"about_ca_topic_score_codex":0.003370197,"about_ca_topic_score_gemma":0.0034151736,"teacher_disagreement_score":0.003370197,"about_ca_system_score_codex":0.0005742331,"about_ca_system_score_gemma":0.0003201563,"threshold_uncertainty_score":0.007222414},"labels":[],"label_agreement":null},{"id":"W2126844396","doi":"10.5555/514151.514179","title":"A distributed mechanism for topology discovery in ad hoc wireless networks using mobile agents","year":2000,"lang":"en","type":"article","venue":"Mobile Ad Hoc Networking and Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"PricewaterhouseCoopers (Canada)","funders":"","keywords":"Wireless ad hoc network; Mobile ad hoc network; Computer science; Computer network; Vehicular ad hoc network; Mechanism (biology); Distributed computing; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Network topology; Wireless; Topology (electrical circuits); Telecommunications; Engineering","score_opus":0.016137762965336377,"score_gpt":0.2583582691832998,"score_spread":0.24222050621796343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126844396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016598039,0.0016317023,0.98913467,0.0004158877,0.000342596,0.0004894265,0.00004881846,0.002511155,0.0037659765],"genre_scores_gemma":[0.11051557,0.0022593166,0.8742188,0.00063652796,0.00088856166,0.0025001834,0.00029175103,0.00018843779,0.00850077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672145,0.000779853,0.00029700834,0.00050037913,0.0015760273,0.00012531981],"domain_scores_gemma":[0.9979511,0.00067345536,0.0002774003,0.00060925464,0.00025398724,0.00023480594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033138935,0.0012835298,0.0015797113,0.0022734604,0.0021494543,0.0031322902,0.0062781107,0.003359839,0.0040170657],"category_scores_gemma":[0.0051447386,0.0009742614,0.0011183013,0.0026144253,0.0031355869,0.004751329,0.0051272716,0.0033274211,0.0018234373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028697317,0.00044933482,0.0007655509,0.0011230988,0.0003452863,0.0012036406,0.0013995143,0.050857536,0.029939063,0.45621225,0.027289316,0.4301284],"study_design_scores_gemma":[0.0007780884,0.0011283705,0.0006654641,0.00043260455,0.00031035728,0.00257235,0.00021647757,0.4878168,0.0142573,0.17145716,0.32008666,0.00027841903],"about_ca_topic_score_codex":0.0007436504,"about_ca_topic_score_gemma":0.0011242427,"teacher_disagreement_score":0.0062781107,"about_ca_system_score_codex":0.0009967388,"about_ca_system_score_gemma":0.0014701806,"threshold_uncertainty_score":0.017525792},"labels":[],"label_agreement":null},{"id":"W2126926086","doi":"10.1109/wcnc.2008.493","title":"A Mechanism Design-Based Multi-Leader Election Scheme for Intrusion Detection in MANET","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mobile ad hoc network; Node (physics); Incentive; Computer science; Reputation; Intrusion detection system; Computer network; Wireless ad hoc network; Resource (disambiguation); Scheme (mathematics); Resource allocation; Computer security; Process (computing); Resource consumption; Distributed computing; Microeconomics; Economics; Engineering; Wireless; Telecommunications","score_opus":0.0411875585090779,"score_gpt":0.2502001528663985,"score_spread":0.2090125943573206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126926086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01643671,0.0006733618,0.9797737,0.0004253844,0.0002011055,0.0003530944,0.000035397774,0.00038459795,0.0017166632],"genre_scores_gemma":[0.688504,0.000743659,0.30632305,0.0003478,0.00017010402,0.0006924578,0.00010764236,0.00003664754,0.0030746844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976992,0.0011032051,0.00018216198,0.00033968946,0.00051862694,0.00015696397],"domain_scores_gemma":[0.99659365,0.0013700031,0.0006067212,0.00058239454,0.00063585595,0.00021136268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045522507,0.00058198185,0.0010973393,0.001153282,0.0012001193,0.0012635371,0.0027029766,0.0014651874,0.001109659],"category_scores_gemma":[0.0068456805,0.0003890544,0.00081868726,0.0010659184,0.0009440864,0.0025321096,0.0012740527,0.001120039,0.00030283825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008762841,0.0008633422,0.00462742,0.0012386447,0.0006088032,0.0010428634,0.0011929488,0.25300115,0.04772243,0.34202984,0.009649254,0.33714706],"study_design_scores_gemma":[0.00037046894,0.0010492256,0.00062188844,0.00005747094,0.00021552067,0.0011236318,0.000110809946,0.9234992,0.01129246,0.040516637,0.021038419,0.00010422147],"about_ca_topic_score_codex":0.0003662605,"about_ca_topic_score_gemma":0.00036084815,"teacher_disagreement_score":0.0045522507,"about_ca_system_score_codex":0.00087727595,"about_ca_system_score_gemma":0.0011268733,"threshold_uncertainty_score":0.024074852},"labels":[],"label_agreement":null},{"id":"W2127246288","doi":"10.1109/icc.2007.573","title":"Utility-based Optimal Rate Allocation for Heterogeneous Wireless Multicast","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Xcast; Computer network; Source-specific multicast; Pragmatic General Multicast; Protocol Independent Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; IP multicast; Multicast address","score_opus":0.02088322843791237,"score_gpt":0.27071635596767263,"score_spread":0.24983312752976025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127246288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027026335,0.0002461595,0.970922,0.000095361465,0.000015833215,0.000032848537,0.000010935315,0.00014020542,0.0015103073],"genre_scores_gemma":[0.8569931,0.00022382948,0.14142151,0.00004464963,0.000030907137,0.00008963189,0.00003845729,0.000058553862,0.001099453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.00051984465,0.000031363474,0.0000901647,0.00022111712,0.00013379393],"domain_scores_gemma":[0.9988972,0.0006873013,0.00012210786,0.00009352963,0.00014687526,0.000053108422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002336557,0.00061449216,0.00076467555,0.0007492779,0.0006000006,0.0009365238,0.0012178116,0.0005562331,0.0006436697],"category_scores_gemma":[0.005388111,0.00038778246,0.00041081465,0.00066031306,0.00075094454,0.0012186042,0.00094647857,0.00068968977,0.00018398112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097500335,0.000052670064,0.0003830926,0.000025239917,0.000021298498,0.000044697303,0.00007121178,0.93544203,0.002236983,0.02291999,0.00049219135,0.0382132],"study_design_scores_gemma":[0.0000069873568,0.00000767059,0.00002989382,0.0000015634854,0.0000026533182,0.000006815621,0.0000056453873,0.9956477,0.0003898579,0.003758382,0.00014051475,0.0000023867378],"about_ca_topic_score_codex":0.0023499103,"about_ca_topic_score_gemma":0.0015724704,"teacher_disagreement_score":0.0023499103,"about_ca_system_score_codex":0.0016228574,"about_ca_system_score_gemma":0.0008549971,"threshold_uncertainty_score":0.012357056},"labels":[],"label_agreement":null},{"id":"W2127780655","doi":"10.1109/wimob.2007.4390846","title":"Exploiting Clustering and Cross-Layer Design Approaches for Data Caching in MANETs","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Scheme (mathematics); Mobile ad hoc network; Wireless ad hoc network; Cluster analysis; Layer (electronics); Distributed computing; False sharing; Complement (music); Protocol (science); Cache; Wireless; CPU cache; Cache algorithms","score_opus":0.2359337686655813,"score_gpt":0.3361253757490391,"score_spread":0.10019160708345781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127780655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02038224,0.00093546446,0.9762031,0.00014535438,0.00006868982,0.000108553446,0.000018686818,0.0005333932,0.0016044652],"genre_scores_gemma":[0.5448237,0.0010784217,0.45009628,0.00025681854,0.00009791377,0.00025682416,0.00015207617,0.00010068045,0.0031371769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990381,0.00030889706,0.00010057275,0.00014553477,0.00032004903,0.00008701672],"domain_scores_gemma":[0.9976463,0.0006401452,0.00025523984,0.0005436415,0.0008360265,0.00007860767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015468001,0.00064524106,0.0006207195,0.00089468894,0.00075263774,0.0009686651,0.001594649,0.0007709372,0.0008231771],"category_scores_gemma":[0.002883493,0.0004968009,0.0005879735,0.00092009484,0.00056131236,0.0019095071,0.0009564775,0.00076514354,0.00035944235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003293433,0.00031321318,0.005739959,0.00080392824,0.00063847756,0.00042010716,0.0006096854,0.4691686,0.10131504,0.058340847,0.0039732223,0.35834756],"study_design_scores_gemma":[0.000035232602,0.00036491873,0.0012786034,0.000031705607,0.00019970721,0.0005140489,0.000096007534,0.9418401,0.03382176,0.010825748,0.010912419,0.000079813784],"about_ca_topic_score_codex":0.0016964807,"about_ca_topic_score_gemma":0.0034042525,"teacher_disagreement_score":0.0016964807,"about_ca_system_score_codex":0.0009188894,"about_ca_system_score_gemma":0.00062439794,"threshold_uncertainty_score":0.00818038},"labels":[],"label_agreement":null},{"id":"W2127783162","doi":"10.1007/s11276-013-0559-z","title":"A ring-based multicast routing topology with QoS support in wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Multicast; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Source-specific multicast; Wireless mesh network; Inter-domain; Pragmatic General Multicast; Topology (electrical circuits); Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.009230560273041116,"score_gpt":0.2235935872610726,"score_spread":0.21436302698803147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127783162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24943654,0.0013979734,0.7350911,0.00082447083,0.00031959012,0.000175548,0.0002722716,0.0010800032,0.011402502],"genre_scores_gemma":[0.81551623,0.0005702558,0.17982331,0.000083057355,0.00014084164,0.00009055471,0.0001909646,0.000059340746,0.0035254091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970835,0.000114180926,0.000028119593,0.000039917017,0.0000805953,0.000028823324],"domain_scores_gemma":[0.9993048,0.00023843863,0.00007617171,0.00014385484,0.00017574558,0.00006107019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273455,0.00014718047,0.00028911978,0.0004824851,0.0004851378,0.0005767225,0.0010952668,0.00045088923,0.00136298],"category_scores_gemma":[0.0015834107,0.00019552009,0.00023554936,0.00040268153,0.00027837683,0.00095505826,0.00065989315,0.0003435374,0.00031498913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015263932,0.00041579566,0.003488382,0.0005140216,0.00009837059,0.00062341517,0.00036255378,0.22394451,0.18539844,0.15891074,0.009410427,0.4153069],"study_design_scores_gemma":[0.00009899814,0.0007239955,0.0009807965,0.00003266923,0.00009062255,0.00056100416,0.0000918012,0.93379474,0.02598215,0.02289618,0.014697833,0.000049096092],"about_ca_topic_score_codex":0.00039222796,"about_ca_topic_score_gemma":0.00051590824,"teacher_disagreement_score":0.00136298,"about_ca_system_score_codex":0.0002535269,"about_ca_system_score_gemma":0.00024840506,"threshold_uncertainty_score":0.004559636},"labels":[],"label_agreement":null},{"id":"W2127810392","doi":"10.1109/iwcmc.2011.5982612","title":"Markov analysis of the mobile hidden station problem in MANET","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Throughput; Mobile station; Mobile computing; Mobile telephony; Mobile radio; Hidden Markov model; Vehicular ad hoc network; Wireless ad hoc network; Base station; Wireless; Telecommunications; Artificial intelligence","score_opus":0.013433641851256754,"score_gpt":0.22118205027646726,"score_spread":0.2077484084252105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127810392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049704485,0.0016990463,0.9359317,0.0011549989,0.00016331795,0.00005182298,0.000213149,0.00013102432,0.010950546],"genre_scores_gemma":[0.9593693,0.003037621,0.02897029,0.00025111713,0.0002479266,0.0001332145,0.00023058665,0.000057833888,0.0077020307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914944,0.0002574679,0.000033246404,0.000122025514,0.00027147803,0.00016634513],"domain_scores_gemma":[0.9976775,0.0014428457,0.00031533992,0.00012414067,0.00034672974,0.000093591094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012170475,0.0005119984,0.0005987421,0.0007298083,0.0005319894,0.00091680326,0.00089893234,0.0007187733,0.0020509923],"category_scores_gemma":[0.00394376,0.00045018573,0.0007049892,0.00058072986,0.0011775392,0.0019828451,0.0009620022,0.0014550423,0.00027512823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051169023,0.000030832965,0.001983783,0.00010250844,0.00006293524,0.0002902516,0.00023126391,0.6016457,0.0016032648,0.38469478,0.0018299917,0.0074735465],"study_design_scores_gemma":[0.0000048286483,0.000013626214,0.00027415663,0.000011977193,0.000010969466,0.00004150879,0.000021671975,0.94339746,0.00019746837,0.055437576,0.00057701475,0.000011803228],"about_ca_topic_score_codex":0.007286601,"about_ca_topic_score_gemma":0.0046916963,"teacher_disagreement_score":0.007286601,"about_ca_system_score_codex":0.0013407156,"about_ca_system_score_gemma":0.0012388363,"threshold_uncertainty_score":0.014488399},"labels":[],"label_agreement":null},{"id":"W2128012664","doi":"10.1109/pccc.2009.5403837","title":"Analysis of the impact of swarm mobility on performance of routing protocols in MANETs","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Mobility model; Link-state routing protocol; Routing protocol; Destination-Sequenced Distance Vector routing; Distributed computing; Static routing; Optimized Link State Routing Protocol; Network packet; Dynamic Source Routing","score_opus":0.017177504111697845,"score_gpt":0.3050323465676969,"score_spread":0.28785484245599907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128012664","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8715622,0.002856126,0.118113846,0.00063768093,0.000094627554,0.00008258884,0.00011699439,0.0003809334,0.00615509],"genre_scores_gemma":[0.9956195,0.00046670745,0.0034674455,0.00002364237,0.000029413643,0.000019447793,0.00005071343,0.00002316199,0.00030004117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829584,0.00062762416,0.000080704085,0.00012900832,0.0006927919,0.00017413059],"domain_scores_gemma":[0.98639673,0.011124066,0.00092584366,0.0006600924,0.0007488428,0.00014443678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002236629,0.00071889965,0.0006510669,0.000990607,0.00042779476,0.0007447855,0.0005538928,0.00063563936,0.00045568173],"category_scores_gemma":[0.014856159,0.0002636955,0.00030428733,0.00083687983,0.00068368803,0.0014552841,0.0005496033,0.0005974942,0.00011211462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015767587,0.00007577299,0.0031934176,0.00009525595,0.000067750516,0.00017121529,0.00007278627,0.9693475,0.00903959,0.00422342,0.00028075112,0.013274981],"study_design_scores_gemma":[0.0000049130076,0.00013523405,0.001362359,0.000006889826,0.00001854995,0.00006599688,0.000028166427,0.9938421,0.0027878594,0.0015601927,0.00017728252,0.0000104894125],"about_ca_topic_score_codex":0.0013247038,"about_ca_topic_score_gemma":0.0007771697,"teacher_disagreement_score":0.002236629,"about_ca_system_score_codex":0.0010018016,"about_ca_system_score_gemma":0.00044694464,"threshold_uncertainty_score":0.011828601},"labels":[],"label_agreement":null},{"id":"W2128098252","doi":"10.6138/jit.2014.15.1.12","title":"Equilibrium Flows and Path Dilation for a Network Forwarding Game","year":2014,"lang":"en","type":"article","venue":"網際網路技術學刊","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Shortest path problem; Packet forwarding; Node (physics); Path (computing); Network packet; Routing (electronic design automation); Nash equilibrium; Relay; Computer network; Flow (mathematics); Flow network; Mathematical optimization; Graph; Mathematics; Theoretical computer science","score_opus":0.010232420737181731,"score_gpt":0.22333016454751328,"score_spread":0.21309774381033156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128098252","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6465158,0.0001445442,0.33843115,0.00064693665,0.000038148173,0.00028043534,0.00022413582,0.0002201192,0.013498714],"genre_scores_gemma":[0.954964,0.00014683869,0.04244648,0.00007891027,0.00001887829,0.0002432611,0.000093979084,0.000049223378,0.00195853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981342,0.00094660267,0.00007285004,0.00025964892,0.00030155672,0.00028523765],"domain_scores_gemma":[0.98538613,0.011455395,0.0016772094,0.0005720852,0.0004347567,0.00047445172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00294866,0.0009969533,0.0008897807,0.0009421397,0.0008714155,0.0016868856,0.0010366075,0.0014214105,0.0036441528],"category_scores_gemma":[0.016475229,0.0005020368,0.0005421596,0.00058460695,0.0025390899,0.0032687976,0.001181861,0.0011763171,0.00021541229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045791548,0.00037283477,0.0016730551,0.00010642179,0.00004885358,0.00020217273,0.0004139909,0.6080044,0.013964994,0.36230162,0.0010803889,0.011373346],"study_design_scores_gemma":[0.000073114265,0.00015371287,0.0005220519,0.000010297658,0.000015649417,0.00008289317,0.00008960163,0.8710368,0.0020482633,0.12540214,0.0005463598,0.000019066701],"about_ca_topic_score_codex":0.0017218268,"about_ca_topic_score_gemma":0.0008199188,"teacher_disagreement_score":0.0036441528,"about_ca_system_score_codex":0.0033163182,"about_ca_system_score_gemma":0.0013598858,"threshold_uncertainty_score":0.02406162},"labels":[],"label_agreement":null},{"id":"W2128259464","doi":"10.5130/ajict.v3i2.549","title":"The Full ESWAN Destination-Based Approach: Operations And Evaluation","year":2007,"lang":"en","type":"article","venue":"African journal of information and communication technologies/African journal of communication and information systems/African journal of information and communication technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Quality of service; Computer network; Admission control; Wireless ad hoc network; Mobile ad hoc network; Channel (broadcasting); Routing (electronic design automation); Vehicular ad hoc network; Wireless; Distributed computing; Telecommunications; Network packet","score_opus":0.01295313948540431,"score_gpt":0.24523986695984248,"score_spread":0.23228672747443818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128259464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47835672,0.00084531243,0.44153357,0.00081323145,0.00032658625,0.00220246,0.0011012653,0.005264895,0.06955601],"genre_scores_gemma":[0.79429543,0.00038466466,0.18505062,0.00022100486,0.00006164341,0.0006602827,0.0013802624,0.00023239965,0.017713737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965334,0.0011747804,0.0001430294,0.00027330712,0.0016208338,0.0002546414],"domain_scores_gemma":[0.9931432,0.0023030392,0.00021131497,0.0011667801,0.002903793,0.00027189226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005342245,0.0009585383,0.001012194,0.0018308425,0.00091415236,0.0018897877,0.002320557,0.0013506396,0.010651235],"category_scores_gemma":[0.009247649,0.00022413324,0.00049772183,0.00215262,0.00062923005,0.003104941,0.0020762922,0.0007027324,0.0022494434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030919667,0.0019298283,0.0138207115,0.00039873167,0.00014156075,0.00029205263,0.0002604503,0.27638927,0.0071839937,0.021257801,0.0055726734,0.6696609],"study_design_scores_gemma":[0.00012264411,0.0011874458,0.0022141396,0.000017035967,0.00005215661,0.00017537775,0.00024349068,0.9799355,0.006978957,0.004323063,0.0047083055,0.00004182249],"about_ca_topic_score_codex":0.0053033233,"about_ca_topic_score_gemma":0.0034646136,"teacher_disagreement_score":0.010651235,"about_ca_system_score_codex":0.0020225411,"about_ca_system_score_gemma":0.001851202,"threshold_uncertainty_score":0.035631895},"labels":[],"label_agreement":null},{"id":"W2128334819","doi":"10.1109/wcnc.2007.779","title":"G-BFS: A Scheme for Scheduling Real-Time CBR Traffic in IEEE 802.11-Based Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Switched mesh; Shared mesh; Mesh networking; Distributed computing; Round-robin scheduling; Network topology; Bottleneck; Order One Network Protocol; Dynamic priority scheduling; Wireless network; Wireless; Embedded system","score_opus":0.014838641558206784,"score_gpt":0.257439796795634,"score_spread":0.24260115523742723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128334819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065633856,0.00077762373,0.9279718,0.00043210713,0.00026729645,0.00021407774,0.0002499154,0.002276883,0.0021764492],"genre_scores_gemma":[0.756788,0.00035569337,0.24061523,0.0002020587,0.00009674407,0.00017529987,0.0003270242,0.00015650726,0.0012835448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992987,0.00021684977,0.000041491625,0.000101071346,0.00017706344,0.00016484053],"domain_scores_gemma":[0.9986243,0.00033019576,0.0002115251,0.00032918082,0.00036271554,0.00014205417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016792038,0.00077745045,0.00095666794,0.0012996318,0.0011405228,0.00075979944,0.0023720576,0.0008976883,0.0014219913],"category_scores_gemma":[0.0032878018,0.00035856463,0.0004354655,0.0014102578,0.0010687796,0.0012762971,0.0010038591,0.00085083075,0.00037483854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019702537,0.00033608315,0.0016157218,0.00037697004,0.00013496802,0.00027967495,0.00049111753,0.5004283,0.05773792,0.05039838,0.017007805,0.36922282],"study_design_scores_gemma":[0.00011032734,0.00023178273,0.0003618205,0.000016271855,0.00001930093,0.00012657358,0.000052086525,0.97387516,0.008821869,0.011810163,0.004536426,0.000038296468],"about_ca_topic_score_codex":0.0070332387,"about_ca_topic_score_gemma":0.006138703,"teacher_disagreement_score":0.0070332387,"about_ca_system_score_codex":0.0020016227,"about_ca_system_score_gemma":0.00183228,"threshold_uncertainty_score":0.01452291},"labels":[],"label_agreement":null},{"id":"W2128360204","doi":"10.1109/rttas.2001.929872","title":"A versatile wireless network architecture with high throughput, low power, and QoS guarantees","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Quality of service; Throughput; Cellular network; Wireless network; Wireless; Network architecture; Distributed computing; Telecommunications","score_opus":0.005262917597165243,"score_gpt":0.18003898277786448,"score_spread":0.17477606518069924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128360204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03757458,0.0032266825,0.92285305,0.0012898566,0.0004228341,0.00009414001,0.000107298925,0.001172158,0.033259414],"genre_scores_gemma":[0.58182,0.006082465,0.38172737,0.00063670025,0.0006197408,0.00022804906,0.0003221926,0.00014583478,0.028417675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998492,0.00002516094,0.000007551385,0.000028875509,0.000067661815,0.000021550126],"domain_scores_gemma":[0.9998716,0.000022974857,0.000014146437,0.000028197692,0.000037131183,0.000025806383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023298897,0.00040322755,0.00023113922,0.00033394413,0.0004625196,0.00091704214,0.0006121656,0.00046109594,0.0010620033],"category_scores_gemma":[0.00041855144,0.00019511113,0.0001667949,0.00040202853,0.00044484745,0.0012329926,0.0008642693,0.00066631864,0.0005801249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014626836,0.00009588553,0.0006721014,0.0003994701,0.000044743283,0.00053624524,0.00023917321,0.055552755,0.24014139,0.38751832,0.016708873,0.2979448],"study_design_scores_gemma":[0.000095804964,0.00058861804,0.0012235466,0.00012651732,0.00011398711,0.0028704237,0.00013466658,0.3120534,0.05138192,0.17402776,0.45726556,0.00011784582],"about_ca_topic_score_codex":0.00040886857,"about_ca_topic_score_gemma":0.00092087366,"teacher_disagreement_score":0.0010620033,"about_ca_system_score_codex":0.00028653702,"about_ca_system_score_gemma":0.00036475452,"threshold_uncertainty_score":0.0035527349},"labels":[],"label_agreement":null},{"id":"W2128382483","doi":"10.1109/lcn.2008.4664186","title":"The design of a secure key management system for mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Key management; Computer science; Rekeying; Key (lock); Computer network; Key distribution; Mobile ad hoc network; Wireless ad hoc network; Scalability; Distributed computing; Scheme (mathematics); Key generation; Public-key cryptography; Wireless; Computer security; Encryption; Telecommunications","score_opus":0.015850919083040902,"score_gpt":0.21640002976456854,"score_spread":0.20054911068152764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128382483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012121331,0.0006410352,0.9827231,0.00029803178,0.00021059396,0.0007455677,0.000047234375,0.00093063415,0.002282447],"genre_scores_gemma":[0.4107986,0.001208097,0.5812625,0.00027695816,0.00024181578,0.0013844707,0.00027965673,0.000092977905,0.00445479],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918383,0.00015194522,0.00012485044,0.00014187049,0.00029635621,0.00010116609],"domain_scores_gemma":[0.9992779,0.00012512015,0.00013456681,0.00012744538,0.00026466194,0.000070244896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011413118,0.00061346666,0.0007370608,0.0006735518,0.0011408976,0.0014409258,0.0012678421,0.0011766696,0.001463634],"category_scores_gemma":[0.0017608795,0.0005028726,0.000483595,0.00047326548,0.0006764699,0.002335469,0.0012340747,0.00084149535,0.0012805973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006372253,0.0003577743,0.003684662,0.0018296822,0.00029566823,0.0017233164,0.0010939476,0.13137843,0.23210171,0.21739268,0.012457454,0.3970474],"study_design_scores_gemma":[0.00029492602,0.0011082378,0.0011575144,0.00017748977,0.00026957627,0.0019046232,0.00023185572,0.7696248,0.09809627,0.033603255,0.09339629,0.00013520183],"about_ca_topic_score_codex":0.0003954255,"about_ca_topic_score_gemma":0.00043438468,"teacher_disagreement_score":0.001463634,"about_ca_system_score_codex":0.00069338235,"about_ca_system_score_gemma":0.00150598,"threshold_uncertainty_score":0.006035924},"labels":[],"label_agreement":null},{"id":"W2128598873","doi":"10.1109/ccnc.2006.1592994","title":"Routing in autonomic communications","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Routing (electronic design automation); Telecommunications","score_opus":0.015113737969582257,"score_gpt":0.24281891549894324,"score_spread":0.22770517752936098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128598873","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012990148,0.11060761,0.49444357,0.04336538,0.011729836,0.0002137303,0.00018748219,0.0014274712,0.32503477],"genre_scores_gemma":[0.56349146,0.1164241,0.20079331,0.009760154,0.018388709,0.00060299604,0.00040986892,0.0004323451,0.089697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998139,0.0007217735,0.00011753796,0.0003122814,0.000576391,0.00013299212],"domain_scores_gemma":[0.9983034,0.0007470791,0.00021539815,0.00033673205,0.00027096507,0.00012636259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020780338,0.00064392766,0.0006231828,0.0010949495,0.0015102337,0.0053370357,0.0010735292,0.0026877234,0.0039201956],"category_scores_gemma":[0.0031817772,0.00043267728,0.00036406613,0.0019048352,0.0025361883,0.0068938187,0.0020379906,0.0020465069,0.0013851962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022363201,0.000020080493,0.0003648733,0.00023940249,0.000021398295,0.00014590874,0.0002121992,0.005490854,0.0010505038,0.8424796,0.016037555,0.13391523],"study_design_scores_gemma":[0.000013192357,0.00007232839,0.000369723,0.00025350807,0.000031156836,0.0005477639,0.00024257493,0.024875764,0.0006132934,0.5734441,0.3994969,0.000039683746],"about_ca_topic_score_codex":0.0005885418,"about_ca_topic_score_gemma":0.0007936837,"teacher_disagreement_score":0.0053370357,"about_ca_system_score_codex":0.0010972469,"about_ca_system_score_gemma":0.0010668737,"threshold_uncertainty_score":0.013114393},"labels":[],"label_agreement":null},{"id":"W2129001313","doi":"10.1109/msn.2008.44","title":"Design of Infrastructure Wireless Mesh Networks: Formulations and Solutions","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Tabu search; Computer science; Network planning and design; Computer network; Wireless network; Key (lock); Mesh networking; Channel (broadcasting); Network topology; Distributed computing; Mathematical optimization; Wireless; Transmission (telecommunications); Topology (electrical circuits); Engineering; Telecommunications; Mathematics","score_opus":0.02103558453288668,"score_gpt":0.22230888401354626,"score_spread":0.20127329948065958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129001313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044400464,0.0011280112,0.98755914,0.00043539994,0.000053087457,0.000069985945,0.000108524,0.000053061845,0.0061527556],"genre_scores_gemma":[0.25235772,0.005231435,0.7309787,0.00027956383,0.0002859837,0.0009728496,0.00048285094,0.00015029678,0.009260536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955636,0.00021463336,0.000018233432,0.000061769315,0.00009795959,0.00005104026],"domain_scores_gemma":[0.9994986,0.0002956906,0.000071051414,0.00003260036,0.00008119342,0.00002091872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001141613,0.0010573892,0.00072361826,0.0006600891,0.00033882566,0.0012044223,0.0012918168,0.0016988138,0.002444205],"category_scores_gemma":[0.0026334794,0.0007803526,0.00084471685,0.0010058479,0.0006909354,0.0010767473,0.0011671371,0.0011488227,0.0003538381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013383056,0.00002334712,0.0001878091,0.00018596693,0.000025667487,0.00004839094,0.000040261264,0.8919466,0.00036802038,0.08257969,0.0019338515,0.022646975],"study_design_scores_gemma":[0.000012128668,0.000019821886,0.000058714846,0.000044662323,0.000009232073,0.000025146768,0.000037030284,0.93574536,0.00024903895,0.05877117,0.0050213286,0.000006261967],"about_ca_topic_score_codex":0.0022950745,"about_ca_topic_score_gemma":0.0019932266,"teacher_disagreement_score":0.002444205,"about_ca_system_score_codex":0.0014119638,"about_ca_system_score_gemma":0.0013492666,"threshold_uncertainty_score":0.010244548},"labels":[],"label_agreement":null},{"id":"W2129330942","doi":"10.1109/infcom.2009.5062212","title":"Exploring the Multicast Lifetime Capacity of WANETs with Directional Multibeam Antennas","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Beamwidth; Multicast; Computer science; Directional antenna; Computer network; Smart antenna; Wireless ad hoc network; Node (physics); Antenna (radio); Electronic engineering; Wireless; Distributed computing; Telecommunications; Physics; Engineering; Acoustics","score_opus":0.04793260110331286,"score_gpt":0.2265008862838946,"score_spread":0.17856828518058174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129330942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42243573,0.0020976427,0.55513066,0.0010777838,0.000035359106,0.000045226367,0.00015854063,0.00013400923,0.018885052],"genre_scores_gemma":[0.97994584,0.0007436419,0.017719066,0.00006081674,0.000027873157,0.0000532746,0.00006107509,0.00002450315,0.0013638363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997427,0.00013193341,0.00000512217,0.000021339833,0.00004186624,0.000057100235],"domain_scores_gemma":[0.99843353,0.0013437793,0.00008393423,0.000046112767,0.00006131461,0.00003136752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010233144,0.00054258044,0.0004564727,0.00041132976,0.00034152388,0.0006645771,0.0004733532,0.00066030433,0.0010715195],"category_scores_gemma":[0.0030125123,0.00027762726,0.00031954827,0.00044820644,0.00050342554,0.0017700975,0.0006170118,0.00057850376,0.00008643583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032962605,0.000034142195,0.00038565378,0.000038171205,0.000013255983,0.00006209083,0.000026489688,0.97609234,0.0020932958,0.014154496,0.00027672685,0.0067903493],"study_design_scores_gemma":[0.0000027998015,0.000018938055,0.00007674347,0.0000041825433,0.0000036005642,0.000017333863,0.000017654498,0.9914358,0.00073167804,0.007475311,0.00021254517,0.0000033695806],"about_ca_topic_score_codex":0.00095455925,"about_ca_topic_score_gemma":0.0007994625,"teacher_disagreement_score":0.0010715195,"about_ca_system_score_codex":0.00060768373,"about_ca_system_score_gemma":0.0003921668,"threshold_uncertainty_score":0.0054118037},"labels":[],"label_agreement":null},{"id":"W2129386751","doi":"10.1109/glocom.2008.ecp.1014","title":"A Multi-Objective Optimization Model For Planning Robust and Least Interfered Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Metric (unit); Network topology; Order One Network Protocol; Heuristic; Network planning and design; Mathematical optimization; Planner; Key (lock); Wireless network; Distributed computing; Network performance; Mesh networking; Computer network; Wireless; Artificial intelligence; Engineering; Mathematics","score_opus":0.04057924424577694,"score_gpt":0.24929896890865585,"score_spread":0.2087197246628789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129386751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008832607,0.00028577528,0.98693335,0.00033438695,0.000034768134,0.00008138119,0.00015569905,0.0001100637,0.003232],"genre_scores_gemma":[0.4832238,0.00078346644,0.5081424,0.00022622386,0.00008061111,0.0011172256,0.00041973748,0.00013664438,0.005869849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910396,0.00044153334,0.000040453688,0.00014381635,0.00016943298,0.00010070272],"domain_scores_gemma":[0.998678,0.000882057,0.00016876355,0.000058316895,0.00014944424,0.00006330975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023010154,0.0015801867,0.001529956,0.0008524156,0.0005724969,0.0014784893,0.0018215732,0.0018848743,0.0026971137],"category_scores_gemma":[0.0037290074,0.00088408095,0.0011082059,0.0013496798,0.00095152884,0.0016230689,0.0010484768,0.0016452107,0.0003908143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005545095,0.000006490445,0.000036492027,0.000014741061,0.000008105159,0.000011184854,0.000005584451,0.99559,0.00006553254,0.0027556387,0.00012723553,0.001373532],"study_design_scores_gemma":[0.0000050341996,0.000010216265,0.000018105922,0.0000035848236,0.0000030201697,0.0000034324366,0.000003847606,0.9974132,0.000041727602,0.0023081165,0.00018733929,0.0000023621365],"about_ca_topic_score_codex":0.006711739,"about_ca_topic_score_gemma":0.0054335385,"teacher_disagreement_score":0.006711739,"about_ca_system_score_codex":0.0018766507,"about_ca_system_score_gemma":0.0015519607,"threshold_uncertainty_score":0.013616145},"labels":[],"label_agreement":null},{"id":"W2129522531","doi":"10.1109/wimob.2005.1512900","title":"IP configuration in ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Merge (version control); Wireless ad hoc network; Distributed computing; Node (physics); Vehicular ad hoc network; Latency (audio); Optimized Link State Routing Protocol; Overhead (engineering); Routing protocol; Engineering; Routing (electronic design automation); Telecommunications; Operating system","score_opus":0.007474246878594172,"score_gpt":0.21137984800935056,"score_spread":0.2039056011307564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129522531","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01563543,0.037956417,0.8731588,0.0017626822,0.0015206237,0.00025274215,0.00012505702,0.0016574942,0.06793082],"genre_scores_gemma":[0.53031445,0.047124457,0.3902902,0.0011713003,0.003195621,0.000780316,0.0007747547,0.00041513314,0.025933744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984285,0.000557608,0.000106978514,0.0002707216,0.000543617,0.00009257168],"domain_scores_gemma":[0.9985505,0.0007401558,0.000120361576,0.00032640065,0.00019332478,0.000069256865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010651945,0.00083488063,0.0006926998,0.001319132,0.0009671951,0.0025637725,0.0013744157,0.0014795081,0.0025471516],"category_scores_gemma":[0.0039118086,0.0006483448,0.0002658222,0.0026456749,0.0018640031,0.004629272,0.0014207189,0.001436839,0.0020385473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010054931,0.000089470595,0.0014490519,0.0007799303,0.000043949116,0.000990115,0.00049666816,0.046890274,0.0040960824,0.47266957,0.019464072,0.45293027],"study_design_scores_gemma":[0.00006622546,0.00021404198,0.0007462489,0.00037449502,0.00006950231,0.0028210315,0.0002804188,0.15417388,0.0056475704,0.6281246,0.20739421,0.000087804205],"about_ca_topic_score_codex":0.00043194313,"about_ca_topic_score_gemma":0.00022624835,"teacher_disagreement_score":0.0025637725,"about_ca_system_score_codex":0.00060173497,"about_ca_system_score_gemma":0.0004565811,"threshold_uncertainty_score":0.00852102},"labels":[],"label_agreement":null},{"id":"W2129686664","doi":"10.1109/iscc.2005.59","title":"Efficient Grid-Based Routing in Wireless Multi-Hop Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Zone Routing Protocol; Grid; Link-state routing protocol; Interior gateway protocol; Wireless Routing Protocol; Dynamic Source Routing; Geographic routing; Wireless network; Static routing; Policy-based routing; Routing domain; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.013387730265650589,"score_gpt":0.2398154651005655,"score_spread":0.2264277348349149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129686664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016653214,0.0024901128,0.9772091,0.0003434742,0.00010110809,0.000060472994,0.000043107164,0.00065834186,0.0024410114],"genre_scores_gemma":[0.60685045,0.004054785,0.38547152,0.00019153181,0.00011415365,0.00021384428,0.00024401787,0.00013267198,0.0027269982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939585,0.00026286862,0.00003332973,0.000053848296,0.00020043545,0.000053675],"domain_scores_gemma":[0.9994666,0.00024527396,0.00006708494,0.00012045913,0.00007638542,0.000024238856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007583831,0.00039528625,0.0005809856,0.0005340185,0.00047806435,0.0008108824,0.0010590935,0.00064213754,0.0006586808],"category_scores_gemma":[0.0016575995,0.00030884764,0.00020366142,0.00091511925,0.00067795435,0.0015817198,0.0010373361,0.000484908,0.00037424313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014296535,0.00006394843,0.00089075894,0.00039121657,0.0000682215,0.00024624157,0.00015123987,0.70471936,0.015066649,0.10641721,0.004888361,0.16695383],"study_design_scores_gemma":[0.00004455483,0.000074414624,0.00021444586,0.000030162377,0.000019501427,0.00012952805,0.00004861867,0.9224013,0.0045769312,0.059475027,0.012966067,0.000019484714],"about_ca_topic_score_codex":0.00082895707,"about_ca_topic_score_gemma":0.001069726,"teacher_disagreement_score":0.0010590935,"about_ca_system_score_codex":0.0004462173,"about_ca_system_score_gemma":0.0004172388,"threshold_uncertainty_score":0.004010737},"labels":[],"label_agreement":null},{"id":"W2129759135","doi":"10.1109/noms.2010.5488350","title":"Management through cross-layer design in mobile tactical networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Interoperability; Computer network; Network architecture; Architecture; Interface (matter); Bandwidth (computing); Layer (electronics); Distributed computing; Operating system","score_opus":0.020946550487211488,"score_gpt":0.2925597418924692,"score_spread":0.2716131914052577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129759135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048049334,0.002073165,0.9425376,0.00050554133,0.00016173681,0.00017958517,0.000019511332,0.0014031738,0.0050703743],"genre_scores_gemma":[0.5415688,0.0016119919,0.4498605,0.0005092142,0.00016256166,0.0002705794,0.00012918393,0.00024908432,0.005638023],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979334,0.00090929813,0.00021470788,0.00023242217,0.0004656028,0.00024451708],"domain_scores_gemma":[0.99807775,0.00049923826,0.00028898046,0.00045430937,0.00053270336,0.00014698027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051359944,0.0006504246,0.00037083548,0.0005087153,0.00067716395,0.0030668657,0.0013830648,0.0010006097,0.0010143312],"category_scores_gemma":[0.0030245895,0.00066651904,0.00044848528,0.00041898515,0.0009161116,0.0034499709,0.0018018666,0.0013287226,0.00035448602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006339319,0.00052150583,0.0067936894,0.0011008396,0.0005719202,0.0018615668,0.0028166352,0.18752028,0.14833072,0.16668822,0.00660494,0.4765557],"study_design_scores_gemma":[0.00013685529,0.00077865843,0.002237656,0.00025510625,0.0005985452,0.0011483022,0.00047986035,0.75587624,0.07771429,0.08090899,0.07971102,0.00015441445],"about_ca_topic_score_codex":0.0010051749,"about_ca_topic_score_gemma":0.0012174782,"teacher_disagreement_score":0.0051359944,"about_ca_system_score_codex":0.0006523,"about_ca_system_score_gemma":0.0007352897,"threshold_uncertainty_score":0.027162075},"labels":[],"label_agreement":null},{"id":"W2129785134","doi":"10.1145/1454609.1454628","title":"A security management scheme using a novel computational reputation model for wireless and mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Reputation; Mobile ad hoc network; Wireless ad hoc network; Trust management (information system); Node (physics); Computer network; Vehicular ad hoc network; Computer security; Reputation system; Wireless; Mobile computing; Set (abstract data type); Wireless network; Distributed computing; Adaptation (eye); Telecommunications; Engineering","score_opus":0.029635979990365175,"score_gpt":0.2621333189240596,"score_spread":0.23249733893369443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129785134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021032395,0.00016078736,0.973089,0.00040086627,0.00013822204,0.00014259799,0.000033717424,0.0006016106,0.0044008372],"genre_scores_gemma":[0.7959547,0.00023340608,0.19824605,0.0001230515,0.00018278771,0.00019141013,0.000088085144,0.00005605236,0.0049244147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985398,0.00042852943,0.00013377224,0.0002585797,0.0005150299,0.00012424678],"domain_scores_gemma":[0.9971336,0.00077418424,0.00050752226,0.0006777927,0.000656196,0.00025063436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022183794,0.0005607084,0.000888413,0.00081042474,0.0012307902,0.0021216946,0.0026550526,0.0011929572,0.001284127],"category_scores_gemma":[0.0067780637,0.0003007018,0.0007225516,0.00071873044,0.0010934075,0.0036637676,0.0018355977,0.0011982654,0.0005782229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027801737,0.00029323096,0.0016684814,0.0001824312,0.00017627272,0.00058355666,0.00042559195,0.50695914,0.022705346,0.3269484,0.0078291595,0.1319504],"study_design_scores_gemma":[0.000026695461,0.00010415835,0.00017419868,0.000008673925,0.000040574254,0.00019509383,0.00001996673,0.98156816,0.0017218818,0.012919521,0.003182694,0.000038474547],"about_ca_topic_score_codex":0.0014596941,"about_ca_topic_score_gemma":0.0017310245,"teacher_disagreement_score":0.0026550526,"about_ca_system_score_codex":0.0012030865,"about_ca_system_score_gemma":0.0014996529,"threshold_uncertainty_score":0.011732042},"labels":[],"label_agreement":null},{"id":"W2129817040","doi":"10.1109/wcnc.2004.1311573","title":"Interference and error probability evaluation in multiservice interference limited wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Wireless ad hoc network; Node (physics); Computer science; Computer network; Interference (communication); Wireless network; Mobile ad hoc network; Network packet; Stochastic geometry models of wireless networks; Wireless; Optimized Link State Routing Protocol; Channel (broadcasting); Telecommunications; Engineering","score_opus":0.037710321211096534,"score_gpt":0.2746970777838204,"score_spread":0.2369867565727239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129817040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044512242,0.0012290487,0.95127326,0.00018223858,0.000027479979,0.000041474304,0.000026152677,0.0001623825,0.002545712],"genre_scores_gemma":[0.93008554,0.0011748711,0.06690468,0.000084090665,0.000070556096,0.000085800406,0.000041598214,0.00005930945,0.0014936433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99598336,0.0017361022,0.0001840874,0.00024383455,0.001589992,0.0002626149],"domain_scores_gemma":[0.97935414,0.017139167,0.0013353355,0.0006173525,0.0013680076,0.000185948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051652095,0.0009685677,0.00088745187,0.0020041799,0.0004869201,0.0015314288,0.001716059,0.0011539496,0.00093396846],"category_scores_gemma":[0.033555824,0.0004655238,0.00045315007,0.0014430528,0.0018223163,0.0025907822,0.0012729348,0.0008770048,0.00019286934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062870415,0.000030358167,0.001182653,0.00007585747,0.000026778598,0.00022651738,0.00007718487,0.9562372,0.0013720264,0.03081508,0.00015685508,0.009736606],"study_design_scores_gemma":[0.000003416692,0.000021944697,0.00020814297,0.000008731654,0.000006240226,0.00010765237,0.000018658695,0.9920477,0.0005552054,0.0068671596,0.00014755015,0.000007429409],"about_ca_topic_score_codex":0.0017735072,"about_ca_topic_score_gemma":0.0008048107,"teacher_disagreement_score":0.0051652095,"about_ca_system_score_codex":0.0016357197,"about_ca_system_score_gemma":0.0006214449,"threshold_uncertainty_score":0.02731651},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; 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","score_opus":0.024322612645583167,"score_gpt":0.2716753881650107,"score_spread":0.24735277551942753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129819894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08047351,0.00044160726,0.90906185,0.0002143134,0.00004614921,0.00018307472,0.00018964874,0.00049665355,0.008893216],"genre_scores_gemma":[0.66439646,0.00032530658,0.32894573,0.00009903357,0.000028968965,0.00024235302,0.00025724052,0.00017479372,0.005530082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995882,0.00012501322,0.000017710061,0.00006751255,0.00012075732,0.000080771126],"domain_scores_gemma":[0.9992687,0.00041454687,0.00011917199,0.00005242285,0.00010519229,0.000040064107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078918505,0.0005002174,0.00041243449,0.0005709053,0.00053962594,0.0006047339,0.000748275,0.00032402627,0.0033619346],"category_scores_gemma":[0.0020580718,0.00032301337,0.00027567043,0.00070959603,0.0003745695,0.00061149563,0.00046805272,0.00039865746,0.00037836639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021520199,0.000139556,0.00091183756,0.00018749997,0.00003810645,0.00012428143,0.00021528962,0.8203277,0.009454302,0.060519822,0.0029240323,0.10494236],"study_design_scores_gemma":[0.00004517579,0.00012840037,0.00028694337,0.0000143057005,0.000017454966,0.00006182424,0.000051741572,0.965166,0.005435987,0.024721425,0.004059493,0.000011205887],"about_ca_topic_score_codex":0.003302416,"about_ca_topic_score_gemma":0.0055358363,"teacher_disagreement_score":0.0033619346,"about_ca_system_score_codex":0.00091778074,"about_ca_system_score_gemma":0.0015830646,"threshold_uncertainty_score":0.0112468},"labels":[],"label_agreement":null},{"id":"W2129864673","doi":"10.1007/3-540-36498-6_11","title":"Formal Description of a Distributed Location Service for Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Distributed computing; Computer network; Adaptive quality of service multi-hop routing; Link-state routing protocol; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless ad hoc network; Wireless Routing Protocol; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.015546403062880989,"score_gpt":0.22878434803105735,"score_spread":0.21323794496817636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129864673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035404733,0.00032671378,0.9854455,0.0005496697,0.0001363214,0.00019909712,0.00028118677,0.00058850134,0.0089324545],"genre_scores_gemma":[0.23602575,0.0009813542,0.74429196,0.0005210109,0.00030929723,0.0010044749,0.0012883116,0.00036360073,0.015214177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978667,0.0005757333,0.00025343997,0.00025371034,0.0008226482,0.00022776004],"domain_scores_gemma":[0.9981839,0.0008931088,0.00012819793,0.00030292012,0.00039713242,0.00009482726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021409437,0.0007831275,0.00065032265,0.00096126646,0.0012604953,0.0045541525,0.0026853585,0.0016254251,0.0059354906],"category_scores_gemma":[0.0037755228,0.00078514125,0.0013182567,0.0011097091,0.0028417448,0.0033321623,0.0021813533,0.0023842924,0.001403296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045686895,0.00008708839,0.00022729622,0.0002057047,0.000024490375,0.00032684178,0.00047880143,0.029678043,0.00322378,0.94019026,0.0034991165,0.02201297],"study_design_scores_gemma":[0.00016689539,0.000088620414,0.0001803264,0.00016394685,0.00007339215,0.00043832208,0.00025301188,0.2298109,0.0046233255,0.6685805,0.095568106,0.000052683667],"about_ca_topic_score_codex":0.005996656,"about_ca_topic_score_gemma":0.0051432527,"teacher_disagreement_score":0.005996656,"about_ca_system_score_codex":0.0018599072,"about_ca_system_score_gemma":0.002733564,"threshold_uncertainty_score":0.019856215},"labels":[],"label_agreement":null},{"id":"W2130187259","doi":"10.1109/wcnc.2008.400","title":"Soft QoS in CSMA/CA-Based Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Quality of service; Wireless mesh network; Queue; Bandwidth (computing); Network packet; Wireless network; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.013933870512240043,"score_gpt":0.22005228104003752,"score_spread":0.20611841052779747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130187259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1149431,0.0020812205,0.8742298,0.00062289863,0.00035496603,0.000121630146,0.000069735695,0.0011655183,0.00641114],"genre_scores_gemma":[0.9509677,0.00063658046,0.04559726,0.000121482335,0.00011150344,0.000082055885,0.00003403797,0.00003802185,0.0024113208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990414,0.00023678999,0.000066952554,0.0001440485,0.00037624757,0.000134551],"domain_scores_gemma":[0.9977532,0.0013544997,0.0002490293,0.00022266287,0.0002961253,0.00012437692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016833338,0.0004610621,0.00049666804,0.00074851996,0.00080592616,0.0014353489,0.0012673434,0.0007423034,0.0012924352],"category_scores_gemma":[0.005904829,0.00039472553,0.00021072528,0.0006016653,0.0011022168,0.0017317301,0.0010692057,0.00093690655,0.00020653645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005188331,0.00015218313,0.0033504725,0.00027467243,0.00007292036,0.0003496609,0.00045914896,0.73596025,0.02453425,0.092149824,0.0032157053,0.13896203],"study_design_scores_gemma":[0.000032902248,0.000050864783,0.00023334112,0.000010306662,0.00001530597,0.000040624862,0.000034109155,0.9822751,0.0014894851,0.014351525,0.0014519824,0.000014408745],"about_ca_topic_score_codex":0.0054591945,"about_ca_topic_score_gemma":0.004441056,"teacher_disagreement_score":0.0054591945,"about_ca_system_score_codex":0.0009388143,"about_ca_system_score_gemma":0.0010975987,"threshold_uncertainty_score":0.01085484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.008706074272355162,"score_gpt":0.21628290245058343,"score_spread":0.20757682817822826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130196300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20507827,0.0027318506,0.7836389,0.0004021982,0.00016559473,0.000101635786,0.000051672505,0.0011876757,0.0066422285],"genre_scores_gemma":[0.954969,0.0008946304,0.042394336,0.000039940176,0.000115131916,0.00004544079,0.000040506864,0.0000537337,0.0014472364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955255,0.00012505885,0.000019243947,0.000049536622,0.00019941624,0.000054112406],"domain_scores_gemma":[0.9994804,0.00025051678,0.00007913713,0.0000516911,0.000115962415,0.000022381402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067497033,0.0005174796,0.0003389623,0.00072840677,0.0005749541,0.00066187687,0.00059005345,0.0004256845,0.0007315375],"category_scores_gemma":[0.001697361,0.00028227834,0.00022027215,0.0007650684,0.00044983896,0.001197769,0.0005539276,0.0002975823,0.00017075423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023894722,0.00009107515,0.002205964,0.00015587818,0.000073527706,0.00017437726,0.00012036697,0.7410349,0.039567977,0.023815723,0.0012807627,0.1912405],"study_design_scores_gemma":[0.000019140134,0.00011832464,0.0005153025,0.0000102899785,0.000031429336,0.00013388057,0.000032828408,0.97246325,0.008404473,0.015069303,0.0031840773,0.000017677943],"about_ca_topic_score_codex":0.0012663275,"about_ca_topic_score_gemma":0.001278196,"teacher_disagreement_score":0.0012663275,"about_ca_system_score_codex":0.00068792887,"about_ca_system_score_gemma":0.0005116569,"threshold_uncertainty_score":0.004991293},"labels":[],"label_agreement":null},{"id":"W2130215523","doi":"10.1109/medhocnet.2009.5205196","title":"Preventing Layer-3 wormhole attacks in ad-hoc networks with multipath DSR","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wormhole; Computer science; Computer network; Wireless ad hoc network; Multipath propagation; Multipath routing; Vehicular ad hoc network; Routing protocol; Mobile ad hoc network; Routing (electronic design automation); Protocol (science); Optimized Link State Routing Protocol; Exploit; Computer security; Distributed computing; Dynamic Source Routing; Network packet; Telecommunications; Channel (broadcasting); Wireless","score_opus":0.011804161915463312,"score_gpt":0.2427506360595929,"score_spread":0.23094647414412958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130215523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46205813,0.001645277,0.5229803,0.00032619247,0.00012362534,0.00030096463,0.00007252251,0.0039619086,0.008531154],"genre_scores_gemma":[0.9423411,0.00048674492,0.055924736,0.00003954215,0.00003101397,0.000053012795,0.000055802626,0.00004711136,0.0010209761],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993975,0.00014896913,0.00006156579,0.00005895404,0.00021559536,0.000117308075],"domain_scores_gemma":[0.9981529,0.00057349546,0.00037800954,0.00044641324,0.00034732497,0.00010176686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008308902,0.0006496369,0.0006407553,0.0009807962,0.00043625664,0.00077847985,0.0005387407,0.0005414896,0.0008393596],"category_scores_gemma":[0.003250501,0.00033432705,0.0003403659,0.0003704945,0.00044407125,0.0015236717,0.0020529923,0.0004969233,0.00035698985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010840255,0.00029615572,0.008745594,0.00064581446,0.00027121863,0.0012651044,0.0005711326,0.14643922,0.23370565,0.02478229,0.003047156,0.5791466],"study_design_scores_gemma":[0.00029750023,0.0018900592,0.006097335,0.0001682201,0.00039766292,0.0028814492,0.0005396181,0.69368374,0.25431347,0.019092819,0.020484023,0.00015402377],"about_ca_topic_score_codex":0.0005594189,"about_ca_topic_score_gemma":0.0005817652,"teacher_disagreement_score":0.0009807962,"about_ca_system_score_codex":0.00023410279,"about_ca_system_score_gemma":0.00051530544,"threshold_uncertainty_score":0.004394233},"labels":[],"label_agreement":null},{"id":"W2130384422","doi":"10.1109/jlt.2007.909197","title":"Interference Management in WLAN Mesh Networks Using Free-Space Optical Links","year":2008,"lang":"en","type":"article","venue":"Journal of Lightwave Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Frequency assignment; Computer science; Interference (communication); Wireless mesh network; Heuristic; Mesh networking; Channel (broadcasting); Channel allocation schemes; Computer network; Wireless network; Wireless; Telecommunications","score_opus":0.020123841228730985,"score_gpt":0.24929179475579144,"score_spread":0.22916795352706046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130384422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34503454,0.001067552,0.6468498,0.00039540793,0.00005062787,0.00009289326,0.000052377087,0.00037919392,0.0060777036],"genre_scores_gemma":[0.9622936,0.00020646986,0.036494173,0.000031018408,0.000034892364,0.00003870282,0.000028931394,0.000014012192,0.00085819996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995597,0.00018842514,0.000017024926,0.000043448355,0.00009303388,0.00009825857],"domain_scores_gemma":[0.99909437,0.0005824312,0.00013940525,0.000051623454,0.00009188204,0.000040463798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007860857,0.00040486435,0.0003377773,0.00056186685,0.0006343455,0.00063844986,0.00079262257,0.00044557292,0.0006635152],"category_scores_gemma":[0.0015595937,0.00020322224,0.00022760907,0.0006382825,0.00047053368,0.0010646107,0.000673298,0.00025897793,0.00009804376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005567815,0.00016988529,0.003659384,0.00011045847,0.00006366939,0.00029843306,0.00018979711,0.8203585,0.018496152,0.011037392,0.0012419316,0.14381757],"study_design_scores_gemma":[0.000030526266,0.00011846878,0.0005030284,0.0000059398494,0.000028294311,0.00006925871,0.00007723252,0.9900856,0.004634122,0.0036555235,0.00078481727,0.0000072285993],"about_ca_topic_score_codex":0.002062132,"about_ca_topic_score_gemma":0.003210576,"teacher_disagreement_score":0.002062132,"about_ca_system_score_codex":0.0009341216,"about_ca_system_score_gemma":0.00044762064,"threshold_uncertainty_score":0.0067775846},"labels":[],"label_agreement":null},{"id":"W2130412147","doi":"10.1002/wcm.2333","title":"Improving routing in networks of Unmanned Aerial Vehicles: Reactive‐Greedy‐Reactive","year":2012,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Zone Routing Protocol; Wireless Routing Protocol; Computer network; Link-state routing protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Routing protocol; Distributed computing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation)","score_opus":0.016282711646537253,"score_gpt":0.25914455609058307,"score_spread":0.24286184444404582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130412147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115126275,0.0016576342,0.87066966,0.000764037,0.00032621739,0.00015328219,0.000059943446,0.0013450399,0.009897776],"genre_scores_gemma":[0.7943881,0.000781948,0.20054919,0.00033143818,0.00007708751,0.00007624357,0.00009953515,0.00008670017,0.0036097714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945325,0.00018605318,0.000026010352,0.00007334797,0.00019937096,0.00006206591],"domain_scores_gemma":[0.99922526,0.000302937,0.00014301736,0.00013356822,0.00014815494,0.000047029487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010392774,0.00069248263,0.00027579532,0.00048746713,0.00040065503,0.0005149419,0.0010474309,0.00048141312,0.0011748564],"category_scores_gemma":[0.0017948938,0.0002107512,0.00027055343,0.0004788762,0.0005399869,0.0009927109,0.0011123784,0.000538569,0.00027293884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022122706,0.000121541096,0.001964433,0.00023621,0.00015888484,0.00030106882,0.00019765318,0.70627016,0.076052286,0.03436595,0.0056379144,0.1744727],"study_design_scores_gemma":[0.000034990284,0.00020774551,0.000392962,0.000016787464,0.000046337536,0.0001768175,0.00007028667,0.9678227,0.016469182,0.006813061,0.007922751,0.000026494245],"about_ca_topic_score_codex":0.0013721205,"about_ca_topic_score_gemma":0.0023031048,"teacher_disagreement_score":0.0013721205,"about_ca_system_score_codex":0.0003720006,"about_ca_system_score_gemma":0.00038051337,"threshold_uncertainty_score":0.005496323},"labels":[],"label_agreement":null},{"id":"W2130446371","doi":"10.1109/icn.2007.36","title":"Design Issues of Peer-to-Peer Systems for Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Peer-to-peer; Optimized Link State Routing Protocol; File sharing; Distributed computing; Ad hoc wireless distribution service; Vehicular ad hoc network; Node (physics); Mobile computing; Adaptive quality of service multi-hop routing; Bandwidth (computing); Routing protocol; Wireless; Routing (electronic design automation); The Internet; World Wide Web; Network packet; Telecommunications; Engineering","score_opus":0.027057234704719015,"score_gpt":0.28030386328981866,"score_spread":0.25324662858509966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130446371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013575667,0.00921207,0.969923,0.0034156838,0.00081189506,0.00038983577,0.000050603052,0.00032699076,0.0145122735],"genre_scores_gemma":[0.09873493,0.015389312,0.86673105,0.0014890484,0.001956591,0.0017660253,0.00020534436,0.00030888934,0.013418878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.992073,0.002869545,0.0006947174,0.000900107,0.003160925,0.00030171464],"domain_scores_gemma":[0.99301845,0.0034207222,0.00042506482,0.0010546795,0.001830806,0.00025016814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069469986,0.0012896869,0.0014384018,0.0008552045,0.0022306067,0.0046822736,0.00411129,0.004360924,0.0044718347],"category_scores_gemma":[0.016574234,0.0012302159,0.00093525933,0.0017466422,0.0038101063,0.009044637,0.002586568,0.003737009,0.003421585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030851785,0.000050047598,0.0002127166,0.000920044,0.00004540246,0.00029668532,0.0007294231,0.020469919,0.0024533072,0.8722342,0.0112868,0.0912707],"study_design_scores_gemma":[0.000059122776,0.00014600296,0.00013158922,0.00030222672,0.000062095125,0.00077694305,0.00026578747,0.07877913,0.0019975863,0.58210504,0.3353147,0.000059839607],"about_ca_topic_score_codex":0.0010102821,"about_ca_topic_score_gemma":0.00095936697,"teacher_disagreement_score":0.0069469986,"about_ca_system_score_codex":0.001999693,"about_ca_system_score_gemma":0.0021062002,"threshold_uncertainty_score":0.036739647},"labels":[],"label_agreement":null},{"id":"W2130716036","doi":"10.1109/milcom.2010.5680091","title":"Distributed geolocation mapping in a mobile tactical environment using service overlay over MANET","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Toronto; Solana Networks (Canada)","funders":"","keywords":"Computer science; Geolocation; Computer network; Network packet; Overlay; Mobile ad hoc network; Overlay network; Node (physics); Routing protocol; Location-based service; Mobile computing; Wireless network; Protocol (science); Real-time computing; Wireless; Distributed computing; The Internet; Telecommunications; Engineering","score_opus":0.012124409665974093,"score_gpt":0.23371356175191732,"score_spread":0.22158915208594324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130716036","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9235939,0.00017344637,0.07444217,0.00007511141,0.000023539522,0.000051914205,0.0000117443715,0.0006218632,0.0010063694],"genre_scores_gemma":[0.9896115,0.000052895717,0.0101623675,0.0000066360235,0.0000050026356,0.000007314497,0.000009804479,0.0000064875444,0.00013803589],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994387,0.00025393005,0.000025679994,0.000060133905,0.00015985276,0.00006163461],"domain_scores_gemma":[0.99709713,0.0018252832,0.0002587701,0.00028823712,0.00035831926,0.00017217384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013510546,0.00045334408,0.00047405245,0.0004501596,0.0003575384,0.00045654696,0.0004556984,0.00040249768,0.00024660947],"category_scores_gemma":[0.0048608296,0.00011609679,0.00012595573,0.00041996207,0.00044383173,0.0009596792,0.0007718167,0.00028806596,0.00006322588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020034048,0.00050816266,0.013200828,0.0001794506,0.00011803524,0.0006939719,0.00048059117,0.75043094,0.07377555,0.002709574,0.0005494386,0.15535003],"study_design_scores_gemma":[0.000038187103,0.0007141397,0.0016561516,0.0000033617168,0.000026825637,0.00012530592,0.00011970224,0.98690027,0.0095274225,0.00047120618,0.00040764138,0.000009842171],"about_ca_topic_score_codex":0.002685794,"about_ca_topic_score_gemma":0.0020638136,"teacher_disagreement_score":0.002685794,"about_ca_system_score_codex":0.00038291616,"about_ca_system_score_gemma":0.00032358392,"threshold_uncertainty_score":0.0071451664},"labels":[],"label_agreement":null},{"id":"W2131143723","doi":"10.1109/glocom.2005.1578458","title":"Support of multimedia SIP applications in mobile ad hoc networks: service discovery and networking architecture","year":2005,"lang":"en","type":"article","venue":"GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Session Initiation Protocol; Computer science; Computer network; SIP trunking; Mobile ad hoc network; Service discovery; Session (web analytics); Service layer; Wireless ad hoc network; Voice over IP; The Internet; Quality of service; Server; World Wide Web; Telecommunications; Web service; Wireless","score_opus":0.014263055367609436,"score_gpt":0.2592723045023577,"score_spread":0.24500924913474828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131143723","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12976788,0.0057734847,0.821392,0.001370814,0.00027710848,0.00027256657,0.00007186279,0.002914458,0.038159885],"genre_scores_gemma":[0.6824269,0.0046144207,0.2987667,0.00035895355,0.000258141,0.00028462367,0.0002654604,0.00014103095,0.012883752],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996836,0.00011218057,0.000021228032,0.000024419267,0.00013067198,0.000027869306],"domain_scores_gemma":[0.9996201,0.000080230304,0.000035249574,0.000057013305,0.0001734833,0.00003384366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285384,0.00036341802,0.00024364695,0.00036918413,0.000494316,0.0010613261,0.0006399875,0.00064206164,0.0008257838],"category_scores_gemma":[0.00083997846,0.00016051337,0.00014380856,0.00042037337,0.0003768476,0.0011141702,0.00039637223,0.00045298875,0.00045844112],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000638051,0.00041078447,0.0034726,0.0007658178,0.00008424125,0.0007333585,0.00065857306,0.06322841,0.2133576,0.18830708,0.01272994,0.51561356],"study_design_scores_gemma":[0.0000677565,0.00081084634,0.0022831517,0.00012471054,0.00015232482,0.0016558303,0.00022619624,0.7746114,0.07729742,0.05095746,0.09174016,0.00007274329],"about_ca_topic_score_codex":0.00044283332,"about_ca_topic_score_gemma":0.0008025927,"teacher_disagreement_score":0.0010613261,"about_ca_system_score_codex":0.0004337731,"about_ca_system_score_gemma":0.0006058704,"threshold_uncertainty_score":0.004910648},"labels":[],"label_agreement":null},{"id":"W2131158343","doi":"10.1109/msn.2008.43","title":"Hybrid Position-Based Routing Algorithms for 3D Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Computer network; Static routing; Hybrid routing; Dynamic Source Routing; Algorithm; Distributed computing; Wireless ad hoc network; Optimized Link State Routing Protocol; Flooding (psychology); Routing (electronic design automation); Routing protocol; Wireless; Telecommunications","score_opus":0.015531280359745495,"score_gpt":0.24039721468918684,"score_spread":0.22486593432944135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131158343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034172758,0.0004197809,0.99408025,0.000096675925,0.00005210711,0.0000442062,0.000029911638,0.00059342984,0.0012663387],"genre_scores_gemma":[0.12679651,0.0008194694,0.86900324,0.00012841611,0.000070916765,0.00025709948,0.00019642992,0.0000876687,0.002640268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992092,0.00023096378,0.00004644795,0.00011536175,0.00035416384,0.000043939606],"domain_scores_gemma":[0.9992428,0.00027091784,0.0000976515,0.00019291605,0.0001661005,0.000029683491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008869899,0.0009942212,0.00079592475,0.0012521913,0.00084603427,0.0013135631,0.002066535,0.0012111702,0.0020670404],"category_scores_gemma":[0.002385149,0.0004684437,0.0006591411,0.0015644983,0.00070043275,0.002018766,0.001971693,0.00087500195,0.0010601014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010630996,0.000048330705,0.0006504371,0.00010567114,0.00008030439,0.000089639856,0.0001863552,0.5841785,0.005654146,0.0523819,0.0040657185,0.35245264],"study_design_scores_gemma":[0.000025267009,0.00005921351,0.0001288027,0.000011165408,0.000016126376,0.000106126274,0.000036111745,0.97056794,0.0016874193,0.021373674,0.0059648375,0.000023405275],"about_ca_topic_score_codex":0.0024076847,"about_ca_topic_score_gemma":0.003121637,"teacher_disagreement_score":0.0024076847,"about_ca_system_score_codex":0.00078398315,"about_ca_system_score_gemma":0.00058639643,"threshold_uncertainty_score":0.0069149137},"labels":[],"label_agreement":null},{"id":"W2131298272","doi":"10.1109/dnsr.2004.1344735","title":"Intelligent agents for routing on mobile ad-hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Distributed computing; Routing protocol; Zone Routing Protocol; Adaptive quality of service multi-hop routing; Enhanced Interior Gateway Routing Protocol; Network packet","score_opus":0.024115891223082258,"score_gpt":0.2732130738068228,"score_spread":0.24909718258374056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131298272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001576039,0.03420237,0.90628743,0.004063176,0.0032836497,0.00025914516,0.00020076396,0.0020417918,0.04808563],"genre_scores_gemma":[0.07151447,0.046938483,0.8092235,0.001986712,0.003867242,0.0013690218,0.0009912916,0.0005512022,0.06355815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860173,0.00046883544,0.00011218181,0.000121244724,0.0006326792,0.0000633443],"domain_scores_gemma":[0.99906915,0.0004461902,0.00008810238,0.00016562625,0.0001661198,0.000064839885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010222738,0.001617576,0.0013002817,0.0014189448,0.00094719615,0.0031779956,0.0018418939,0.0026226481,0.0060370634],"category_scores_gemma":[0.0030793224,0.000560919,0.00075574656,0.0021875438,0.0016959412,0.0044198404,0.0022152944,0.0031759206,0.0042619426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003777549,0.00003573508,0.00018902037,0.0006634356,0.00006782064,0.00039010055,0.00028760935,0.015852273,0.0021216846,0.78368115,0.037440863,0.1592324],"study_design_scores_gemma":[0.00005928152,0.00007503469,0.00017204203,0.00035165856,0.00006549755,0.00063407567,0.000099098805,0.07283786,0.0013747666,0.41492432,0.5093509,0.000055571843],"about_ca_topic_score_codex":0.0008059984,"about_ca_topic_score_gemma":0.0011742561,"teacher_disagreement_score":0.0060370634,"about_ca_system_score_codex":0.0007647608,"about_ca_system_score_gemma":0.0009195677,"threshold_uncertainty_score":0.020195961},"labels":[],"label_agreement":null},{"id":"W2131378061","doi":"10.1109/icc.2008.544","title":"Connectivity Model for Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Computer science; Wireless network; Computer network; Mesh networking; Boundary (topology); Network topology; Upper and lower bounds; Order One Network Protocol; Topology (electrical circuits); Switched mesh; Network model; Distributed computing; Wireless; Mathematics; Data mining; Telecommunications; Combinatorics","score_opus":0.027889082335057023,"score_gpt":0.242128410223665,"score_spread":0.21423932788860797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131378061","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004271852,0.0008735054,0.9877638,0.0004535277,0.00011640143,0.000051788316,0.00025839516,0.00018239678,0.00602834],"genre_scores_gemma":[0.52548796,0.008710279,0.4327909,0.00067655905,0.0011084267,0.0011758478,0.0022568556,0.00037568304,0.027417505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993279,0.00020900503,0.000036214242,0.0001174889,0.00025858686,0.000050751525],"domain_scores_gemma":[0.99948704,0.00025269526,0.00007701062,0.00006430552,0.00009465768,0.000024401104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005906375,0.000738101,0.0007653339,0.0011797048,0.00055370195,0.0009911116,0.0021530176,0.0014013834,0.0029795833],"category_scores_gemma":[0.0029615052,0.00030642183,0.0007940052,0.0017931996,0.00072428474,0.002933205,0.0010336014,0.0013173982,0.0010828984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024753685,0.000020606916,0.00037736248,0.00013438499,0.000032436794,0.000253127,0.00010901536,0.4644594,0.0017230429,0.50587183,0.0051608635,0.021833224],"study_design_scores_gemma":[0.0000075652083,0.000023709455,0.000092587914,0.000019358755,0.000009871099,0.00015348781,0.000020774716,0.8369993,0.00016783614,0.15342082,0.009072522,0.000012140838],"about_ca_topic_score_codex":0.0030550153,"about_ca_topic_score_gemma":0.0018382041,"teacher_disagreement_score":0.0030550153,"about_ca_system_score_codex":0.00087888405,"about_ca_system_score_gemma":0.0005473906,"threshold_uncertainty_score":0.009967685},"labels":[],"label_agreement":null},{"id":"W2131737328","doi":"10.1109/wcnc.2006.1683635","title":"Performance analysis of a wireless sensor network","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless sensor network; Computer network; Computer science; Key distribution in wireless sensor networks; Node (physics); Network packet; Mobile wireless sensor network; Time division multiple access; Throughput; Sensor node; Wireless network; Wireless; Engineering; Telecommunications","score_opus":0.006509418757623649,"score_gpt":0.20315092551409614,"score_spread":0.1966415067564725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131737328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09017755,0.0031192028,0.88510394,0.0011333921,0.00016601585,0.00008272039,0.00016888467,0.0004917911,0.019556511],"genre_scores_gemma":[0.9670758,0.0020824398,0.02697126,0.000110217174,0.0001832665,0.0000882577,0.00013161977,0.00009865577,0.003258343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984333,0.0005785819,0.000054413755,0.00017303691,0.000643992,0.00011669615],"domain_scores_gemma":[0.9978915,0.0012369656,0.00022075849,0.00014882184,0.00044519446,0.000056792665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016558021,0.0007760031,0.00051659177,0.00058733916,0.00042128804,0.0011148693,0.00066454423,0.0006936788,0.001896696],"category_scores_gemma":[0.0064898925,0.00022839296,0.00034121404,0.00069387845,0.0005082587,0.001426652,0.0005468462,0.00063857675,0.00044261935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059511196,0.000025846699,0.0009987116,0.000118220494,0.000045237088,0.00009239611,0.00006079802,0.9304366,0.005887152,0.041564863,0.00067631877,0.020034365],"study_design_scores_gemma":[0.0000026467987,0.000038309357,0.00021423046,0.00001025171,0.000008714239,0.000029204932,0.000012363999,0.9925517,0.0006797892,0.005495701,0.00095275993,0.000004290082],"about_ca_topic_score_codex":0.0017595541,"about_ca_topic_score_gemma":0.00066712376,"teacher_disagreement_score":0.001896696,"about_ca_system_score_codex":0.0010326491,"about_ca_system_score_gemma":0.0007283193,"threshold_uncertainty_score":0.008756816},"labels":[],"label_agreement":null},{"id":"W2131980718","doi":"10.1109/twc.2011.071411.102123","title":"Structural Results for Combined Continuous User Authentication and Intrusion Detection in High Security Mobile Ad-Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Computer science; Mobile ad hoc network; Intrusion detection system; Authentication (law); Partially observable Markov decision process; Wireless ad hoc network; Computer network; Markov decision process; Markov process; Scheme (mathematics); Distributed computing; Markov chain; Computer security; Wireless; Markov model; Machine learning; Network packet","score_opus":0.01853554168608504,"score_gpt":0.24420598328340334,"score_spread":0.2256704415973183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131980718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017218502,0.00043275047,0.97396415,0.0007603878,0.00007684216,0.00008564959,0.0000690108,0.00011573324,0.0072770184],"genre_scores_gemma":[0.880914,0.0019177734,0.10799519,0.00031425964,0.00035625297,0.0006244592,0.00028086037,0.00010423527,0.0074929856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997693,0.000924761,0.000095652074,0.0003369764,0.00068088435,0.0002686964],"domain_scores_gemma":[0.98679906,0.009517043,0.0012113912,0.00056013605,0.0014898791,0.00042249603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004269803,0.0016179103,0.0011021758,0.0013049751,0.00087472185,0.0016280256,0.002002848,0.0015747733,0.006104912],"category_scores_gemma":[0.015706392,0.0009490548,0.0013506996,0.0010686889,0.0023731738,0.00375838,0.002472201,0.002178593,0.00091709854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012011237,0.00020227439,0.00074443925,0.0002845082,0.00007334344,0.00014070014,0.00022159971,0.7560988,0.002936901,0.21687365,0.0025653008,0.019738331],"study_design_scores_gemma":[0.000017694141,0.000082184575,0.00015359314,0.000018477913,0.000018385244,0.000025283183,0.000027744347,0.93792975,0.00040561915,0.06083235,0.00047632196,0.0000127254225],"about_ca_topic_score_codex":0.0021938088,"about_ca_topic_score_gemma":0.002767084,"teacher_disagreement_score":0.006104912,"about_ca_system_score_codex":0.0025508506,"about_ca_system_score_gemma":0.0022065067,"threshold_uncertainty_score":0.02258116},"labels":[],"label_agreement":null},{"id":"W2132028461","doi":"10.5539/cis.v3n1p3","title":"Improvement in Network Lifetime for On-Demand Routing in Mobile Ad hoc Networks using either On-Demand Recharging or Transmission Power Control or Both","year":2010,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Node (physics); Power control; Routing protocol; Transmission (telecommunications); Dynamic Source Routing; Routing (electronic design automation); Power (physics); Telecommunications; Engineering","score_opus":0.010807493522692117,"score_gpt":0.25803840537492323,"score_spread":0.24723091185223112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132028461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95646703,0.00077349495,0.034026038,0.0002854399,0.000030979198,0.00004393305,0.00010987929,0.00019194602,0.008071255],"genre_scores_gemma":[0.9972107,0.00014454455,0.002269674,0.000011275982,0.000002360333,0.000010595038,0.00003527576,0.000009594832,0.00030598126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999624,0.0001534129,0.000012024365,0.00003760298,0.00009897196,0.000073928546],"domain_scores_gemma":[0.9983864,0.0011238949,0.00017558789,0.00013345342,0.00014035449,0.000040391646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007587651,0.00043491606,0.00023522283,0.00039360597,0.00024870198,0.00036904318,0.0004064458,0.0003737461,0.00070401607],"category_scores_gemma":[0.0031221611,0.000106127976,0.0003112431,0.00027095617,0.0003687383,0.00084604317,0.0003255221,0.00029341143,0.000051544943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031796255,0.00017349856,0.0049800505,0.00015063155,0.00005367717,0.00011257341,0.00008924197,0.9490434,0.011530804,0.0027661342,0.0004786506,0.030303404],"study_design_scores_gemma":[0.000022995733,0.00070635957,0.004448369,0.000019349065,0.0000548149,0.00017397162,0.00012000808,0.981531,0.010186357,0.0016842358,0.0010319073,0.000020543495],"about_ca_topic_score_codex":0.0016587102,"about_ca_topic_score_gemma":0.0029118834,"teacher_disagreement_score":0.0016587102,"about_ca_system_score_codex":0.00084568537,"about_ca_system_score_gemma":0.00038474845,"threshold_uncertainty_score":0.006135881},"labels":[],"label_agreement":null},{"id":"W2132838300","doi":"10.1109/ism.2009.43","title":"An Efficient Video Multicast Routing Protocol for Heterogeneous Destinations in MANETs","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Xcast; Source-specific multicast; Distributed computing; IP multicast","score_opus":0.025288783637532276,"score_gpt":0.32636573713556155,"score_spread":0.30107695349802926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132838300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03375965,0.0015152551,0.95928514,0.000374578,0.0001706347,0.0002996141,0.00019385778,0.0008000917,0.0036012523],"genre_scores_gemma":[0.48944092,0.0013920461,0.5017926,0.0002757941,0.000132165,0.00036749037,0.001025813,0.0000761212,0.0054970193],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995944,0.00013262592,0.00002522347,0.000037829108,0.0001746688,0.000035245208],"domain_scores_gemma":[0.9996308,0.00012536334,0.000048937338,0.00006128583,0.00011018695,0.000023271617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009151306,0.00031684415,0.000502633,0.00068786234,0.0005115453,0.00043947747,0.0010190294,0.00047024534,0.00072450045],"category_scores_gemma":[0.0013559742,0.00015628607,0.00024373057,0.0005190985,0.00022359111,0.0009782154,0.0008975921,0.0004161732,0.00024202414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062581856,0.00025057152,0.0015709299,0.0007161011,0.00021358197,0.00079671614,0.00029862724,0.15029612,0.09982317,0.08392711,0.013858318,0.6476229],"study_design_scores_gemma":[0.00017784545,0.00060547114,0.00085279,0.00005117384,0.0001266159,0.0008444985,0.0001389233,0.9064568,0.029608352,0.01848394,0.042590935,0.000062598236],"about_ca_topic_score_codex":0.0006728576,"about_ca_topic_score_gemma":0.001114675,"teacher_disagreement_score":0.0010190294,"about_ca_system_score_codex":0.0004496132,"about_ca_system_score_gemma":0.00044889053,"threshold_uncertainty_score":0.0048397183},"labels":[],"label_agreement":null},{"id":"W2133011206","doi":"10.1109/icsnc.2006.2","title":"A Flexible Weight Based Clustering Algorithm in Mobile Ad hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Cluster analysis; Computer science; Mobile ad hoc network; Overhead (engineering); Distributed computing; Wireless ad hoc network; Computer network; Cluster (spacecraft); Mobile computing; Algorithm; Wireless; Artificial intelligence","score_opus":0.007113935744345424,"score_gpt":0.21872710188228067,"score_spread":0.21161316613793524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133011206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012944731,0.0005205447,0.9846673,0.00013656702,0.00009598139,0.00008559114,0.000026794158,0.0003966063,0.0011259518],"genre_scores_gemma":[0.24866499,0.0006917837,0.74640155,0.00010368817,0.00009925228,0.00021508384,0.00018196956,0.000108089705,0.003533599],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933016,0.00014865823,0.000040098374,0.0001101265,0.0003154297,0.000055460703],"domain_scores_gemma":[0.99957377,0.00009640411,0.000058030626,0.00007991275,0.0001602769,0.000031638356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007065773,0.00057251955,0.00049754296,0.0010541596,0.00083263783,0.0007583401,0.00149758,0.0009742856,0.00066395075],"category_scores_gemma":[0.0019738213,0.00030395592,0.00036184126,0.0020537407,0.0006342113,0.0014116007,0.000982225,0.00080355967,0.00042202184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013650254,0.00007898278,0.0009863932,0.0001561692,0.00009175419,0.000109845656,0.00018012685,0.4073474,0.026435643,0.036378488,0.0036425772,0.52445614],"study_design_scores_gemma":[0.000028872224,0.00012128149,0.00046135465,0.000016241725,0.000019758518,0.00017111245,0.00004037832,0.9679424,0.0054021706,0.016500102,0.009255926,0.00004037732],"about_ca_topic_score_codex":0.0034531543,"about_ca_topic_score_gemma":0.0035736759,"teacher_disagreement_score":0.0034531543,"about_ca_system_score_codex":0.0004750365,"about_ca_system_score_gemma":0.00075434207,"threshold_uncertainty_score":0.006866157},"labels":[],"label_agreement":null},{"id":"W2133209629","doi":"10.1109/ccece.2014.6901105","title":"On the connectivity of multi-band cognitive radio ad hoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cognitive radio; Metric (unit); Computer science; Wireless ad hoc network; Metrics; Graph; Graph theory; Computer network; Theoretical computer science; Routing protocol; Mathematics; Routing (electronic design automation); Wireless; Telecommunications; Engineering","score_opus":0.01637821757764681,"score_gpt":0.2346786565743026,"score_spread":0.21830043899665577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133209629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123964556,0.0037609495,0.85959744,0.0007094059,0.000112194444,0.000050379807,0.00016783728,0.00009747975,0.011539732],"genre_scores_gemma":[0.9469178,0.004278784,0.046815857,0.00008256649,0.00019128261,0.00008773405,0.00013112315,0.000051473588,0.0014432566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944824,0.00027627873,0.000019096678,0.000075808675,0.0001398622,0.00004070773],"domain_scores_gemma":[0.9963664,0.0029543042,0.0002634611,0.00012029249,0.00022699204,0.00006862981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005487488,0.0006743322,0.00036531026,0.0012287303,0.00040386038,0.0007393915,0.0006991416,0.00052550016,0.0010462531],"category_scores_gemma":[0.005212411,0.00017924336,0.00031418205,0.001613509,0.0010287998,0.0018073183,0.00066603615,0.0006188042,0.00009946694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006118341,0.000022375085,0.001400495,0.00012951701,0.000032312804,0.000293233,0.00011074173,0.8413419,0.002900761,0.13104106,0.00074986863,0.02191647],"study_design_scores_gemma":[0.0000036939737,0.000057146393,0.00083113345,0.000022438622,0.000012527935,0.0001748903,0.000034594927,0.9415921,0.0005074426,0.055385403,0.001368825,0.000009787361],"about_ca_topic_score_codex":0.0016378398,"about_ca_topic_score_gemma":0.0015799265,"teacher_disagreement_score":0.0016378398,"about_ca_system_score_codex":0.00071443943,"about_ca_system_score_gemma":0.00026049223,"threshold_uncertainty_score":0.005183637},"labels":[],"label_agreement":null},{"id":"W2133798603","doi":"10.1109/glocom.2006.265","title":"NIS01-5: A Novel Voting Mechanism for Compromised Node Revocation in Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Node (physics); Revocation; Computer security; Mobile ad hoc network; Wireless; Engineering; Telecommunications; Network packet; Overhead (engineering)","score_opus":0.012599220609024553,"score_gpt":0.22932695867421815,"score_spread":0.2167277380651936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133798603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.076251194,0.0007796655,0.90502715,0.00039478284,0.00066555466,0.00084542664,0.00014212432,0.0052875914,0.010606585],"genre_scores_gemma":[0.8451493,0.00027800046,0.14332908,0.00034564076,0.0001413222,0.00039005745,0.00035615562,0.00015987137,0.009850578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751925,0.0007444739,0.00027396207,0.0003195164,0.0008338953,0.0003088165],"domain_scores_gemma":[0.9965243,0.0009030021,0.00048562328,0.0010180912,0.0008224108,0.0002465574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030933334,0.0005180106,0.0009865989,0.0012322812,0.0009874795,0.0010677476,0.004200985,0.0012951702,0.0026096224],"category_scores_gemma":[0.0064039635,0.00026282528,0.00051830866,0.00074131653,0.0009807635,0.0024176857,0.0023103424,0.0011984297,0.00090809166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021884802,0.00092953834,0.0072948234,0.0006671491,0.00031783935,0.0011149483,0.00080226414,0.07527773,0.13407768,0.10306289,0.016288625,0.65797806],"study_design_scores_gemma":[0.00030077767,0.0015493351,0.0017858392,0.000074066455,0.00019928435,0.0016696395,0.0001760064,0.8566187,0.06491328,0.023745248,0.04879468,0.00017326677],"about_ca_topic_score_codex":0.00079194113,"about_ca_topic_score_gemma":0.0014511296,"teacher_disagreement_score":0.004200985,"about_ca_system_score_codex":0.0007531608,"about_ca_system_score_gemma":0.0011152119,"threshold_uncertainty_score":0.01635927},"labels":[],"label_agreement":null},{"id":"W2133866328","doi":"10.1145/1023756.1023775","title":"A framework of secure location service for position-based ad hoc routing","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Routing protocol; Wireless Routing Protocol; Link-state routing protocol; Wireless ad hoc network; Dynamic Source Routing; Distributed computing; Interior gateway protocol; Ad hoc wireless distribution service; Zone Routing Protocol; Destination-Sequenced Distance Vector routing; Computer security; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.010880395836482686,"score_gpt":0.2510930856714108,"score_spread":0.24021268983492813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133866328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013421056,0.0007483359,0.98809516,0.0007878216,0.00034879547,0.00020671666,0.00006024513,0.0015320993,0.0068788324],"genre_scores_gemma":[0.13710287,0.0024594816,0.84119606,0.00065336796,0.00092916796,0.0010459226,0.00043265137,0.00039124204,0.015789175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9966523,0.0008998941,0.0002747261,0.00042935027,0.001464032,0.00027985728],"domain_scores_gemma":[0.9984023,0.00029743373,0.000156131,0.00059779256,0.00030801672,0.00023835283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032287994,0.0012553534,0.0012933378,0.0019051307,0.0025545426,0.0042879595,0.004043908,0.0029086566,0.004120756],"category_scores_gemma":[0.0034706492,0.00082274183,0.0018498271,0.0018847891,0.004513046,0.00570051,0.005438772,0.0037761184,0.004375549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047364352,0.00004256059,0.00016220243,0.00013335716,0.0000333846,0.0004023836,0.00029030655,0.013576038,0.0036246555,0.9375453,0.005868261,0.038274232],"study_design_scores_gemma":[0.00011212278,0.000327397,0.0002393211,0.00015566127,0.00010796346,0.0013039688,0.0002139957,0.24117045,0.0069586625,0.41891,0.3303341,0.00016645431],"about_ca_topic_score_codex":0.0026789962,"about_ca_topic_score_gemma":0.002175817,"teacher_disagreement_score":0.0042879595,"about_ca_system_score_codex":0.001769278,"about_ca_system_score_gemma":0.0031556934,"threshold_uncertainty_score":0.017075717},"labels":[],"label_agreement":null},{"id":"W2134124253","doi":"10.1109/wcnc.2009.4917728","title":"Flow Starvation Mitigation for Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless mesh network; Computer network; Computer science; Mesh networking; Scalability; Order One Network Protocol; Default gateway; Throughput; Wireless network; Shared mesh; Switched mesh; Wireless; Distributed computing; Telecommunications","score_opus":0.010446601971624324,"score_gpt":0.23146546801498327,"score_spread":0.22101886604335894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134124253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08079999,0.001880487,0.9116644,0.0006003346,0.00033542907,0.00019780523,0.000049383256,0.00092810777,0.003544118],"genre_scores_gemma":[0.80079055,0.00069459016,0.19588394,0.00019764712,0.00016310858,0.0001389224,0.00009484569,0.0000480016,0.0019883108],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995714,0.00016138409,0.000030216304,0.00004941238,0.00013365985,0.000053864795],"domain_scores_gemma":[0.99875116,0.0005935988,0.00015447669,0.00018981614,0.00024126422,0.000069802954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016623418,0.0003423262,0.0003509471,0.00083190145,0.0010503058,0.00053492584,0.00084856537,0.0004786854,0.00072823884],"category_scores_gemma":[0.0043045026,0.00018738334,0.00029476933,0.0004647539,0.000441886,0.0010402303,0.00084892404,0.00044125735,0.00013391608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000497472,0.00030883309,0.0049721445,0.00033646313,0.000111789006,0.00027828888,0.00030722356,0.27463868,0.038537897,0.043466467,0.008417761,0.62812704],"study_design_scores_gemma":[0.000030441362,0.00017041704,0.0008444301,0.00002872989,0.000033470365,0.00023711228,0.000054205215,0.9623764,0.012844428,0.018011708,0.0053417264,0.000026913487],"about_ca_topic_score_codex":0.0012188002,"about_ca_topic_score_gemma":0.0010970985,"teacher_disagreement_score":0.0016623418,"about_ca_system_score_codex":0.0007114771,"about_ca_system_score_gemma":0.0008303757,"threshold_uncertainty_score":0.008791447},"labels":[],"label_agreement":null},{"id":"W2134225174","doi":"10.1109/icc.2005.1494964","title":"On constructing minimum-energy path-preserving graphs for ad-hoc wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Path (computing); Vehicular ad hoc network; Wireless; Distributed computing; Telecommunications","score_opus":0.011140593779752203,"score_gpt":0.22751526656895452,"score_spread":0.2163746727892023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134225174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029201161,0.00035187497,0.967572,0.00028536402,0.000030908053,0.00010082796,0.000074855045,0.00026666184,0.0021163037],"genre_scores_gemma":[0.20234728,0.0011747929,0.7934551,0.00012688155,0.00007342032,0.00025443328,0.000487684,0.0001424421,0.0019379739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995616,0.00019579795,0.000022645987,0.00006889719,0.000110436005,0.000040634965],"domain_scores_gemma":[0.99780613,0.0015217981,0.00014996994,0.0002666221,0.00017147664,0.00008398314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292707,0.00088868727,0.0005905114,0.00077509624,0.0007410739,0.0006084591,0.0011180541,0.000681436,0.0011915416],"category_scores_gemma":[0.004741296,0.00037597152,0.0006089938,0.0011135659,0.0011409025,0.0021453083,0.0014354364,0.0008850136,0.00036139466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020517787,0.00019652605,0.001148441,0.00048437863,0.00008412328,0.0002035662,0.00037784656,0.632886,0.010510518,0.1056677,0.003941527,0.24429415],"study_design_scores_gemma":[0.000052482595,0.00021574412,0.00036982153,0.000039541963,0.00003842295,0.00013614741,0.00011885854,0.74473554,0.005376932,0.24429184,0.0046042907,0.000020344985],"about_ca_topic_score_codex":0.00074831926,"about_ca_topic_score_gemma":0.0010357354,"teacher_disagreement_score":0.0011915416,"about_ca_system_score_codex":0.00042147323,"about_ca_system_score_gemma":0.0005719584,"threshold_uncertainty_score":0.00438565},"labels":[],"label_agreement":null},{"id":"W2134576430","doi":"10.1016/j.bjp.2014.01.004","title":"Energy efficient management framework for multihop TDMA-based wireless networks","year":2014,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"European Commission","keywords":"Computer science; Time division multiple access; Computer network; Energy consumption; Scheduling (production processes); Efficient energy use; Wireless; Distributed computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.008224359579328155,"score_gpt":0.22003438411646578,"score_spread":0.21181002453713763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134576430","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032978412,0.00029995016,0.9927295,0.00014704505,0.000080303405,0.000048575337,0.000037037786,0.00037772127,0.0029821056],"genre_scores_gemma":[0.54569274,0.0013197599,0.43579638,0.00018210323,0.00022813736,0.00037516264,0.00022226061,0.00019135521,0.015992109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996319,0.00006509574,0.00002420498,0.000050988263,0.00016976244,0.000057966572],"domain_scores_gemma":[0.99977463,0.00006276078,0.00001807793,0.000038500868,0.00007981195,0.000026136548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063924934,0.0005173807,0.00057943776,0.00058549363,0.0007003756,0.0015644013,0.0018340076,0.00067830266,0.0027054108],"category_scores_gemma":[0.00087630306,0.00025197066,0.00045171392,0.00048732705,0.00040730785,0.0015564814,0.0012299288,0.0009487343,0.0006604959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105218794,0.00021301818,0.0004844655,0.00018997326,0.000081524726,0.00041696598,0.000257873,0.4356977,0.021309825,0.38591665,0.0072293826,0.1480974],"study_design_scores_gemma":[0.000010129407,0.00003307845,0.00008263758,0.000011416746,0.000022401517,0.00008243451,0.000036847243,0.95964664,0.0020990032,0.030936569,0.0070266305,0.000012268254],"about_ca_topic_score_codex":0.0020272995,"about_ca_topic_score_gemma":0.0033208572,"teacher_disagreement_score":0.0027054108,"about_ca_system_score_codex":0.0006435666,"about_ca_system_score_gemma":0.0009571393,"threshold_uncertainty_score":0.009050548},"labels":[],"label_agreement":null},{"id":"W2134627619","doi":"10.1109/wcnc.2008.565","title":"A Novel Fair Incentive Protocol for Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Incentive; Computer network; Mobile ad hoc network; Computer science; Selfishness; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Protocol (science); Network packet; Computer security; Routing protocol; Microeconomics; Wireless; Telecommunications; Economics; Engineering; Law","score_opus":0.028255459214356744,"score_gpt":0.28254488354055446,"score_spread":0.2542894243261977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134627619","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050627966,0.00088153826,0.9865002,0.00061283476,0.00066516304,0.0003520936,0.00008037424,0.00029612548,0.005548904],"genre_scores_gemma":[0.36038178,0.0017637688,0.62079936,0.0008133421,0.0007875855,0.0011799595,0.00019350708,0.00007071679,0.014010005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871826,0.00033860613,0.000111837246,0.00019474633,0.00049608,0.00014054916],"domain_scores_gemma":[0.99902666,0.00043865957,0.00010067639,0.00012000351,0.0002133414,0.000100727106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408717,0.0006501612,0.0007686243,0.0008596056,0.0016800491,0.0011773002,0.0019929933,0.0014969377,0.0016347301],"category_scores_gemma":[0.0045121266,0.000283724,0.0006006437,0.00094346324,0.0012376385,0.0035132924,0.0018827281,0.0016741467,0.00041565404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002788465,0.000208747,0.0005826494,0.00040545178,0.0000817066,0.0010551374,0.0006681848,0.053330418,0.01991567,0.68614566,0.015663195,0.22166435],"study_design_scores_gemma":[0.00027020837,0.00044714918,0.0003308448,0.00011687009,0.000116847805,0.0016593713,0.00011304075,0.5205375,0.008799073,0.32119113,0.14625387,0.0001640167],"about_ca_topic_score_codex":0.0009093644,"about_ca_topic_score_gemma":0.00095287367,"teacher_disagreement_score":0.002408717,"about_ca_system_score_codex":0.00084699254,"about_ca_system_score_gemma":0.001976265,"threshold_uncertainty_score":0.012738645},"labels":[],"label_agreement":null},{"id":"W2134726560","doi":"10.1109/pimrc.2003.1260272","title":"Bandwidth allocation in wireless ad-hoc networks with minimum-energy consumption","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Energy consumption; Wireless ad hoc network; Bandwidth (computing); Routing (electronic design automation); Shortest path problem; Link-state routing protocol; Dynamic Source Routing; Wireless; Routing protocol; Distributed computing; Telecommunications; Engineering; Electrical engineering","score_opus":0.00954045730882186,"score_gpt":0.21396977765173864,"score_spread":0.20442932034291678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134726560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053864315,0.00247182,0.9381906,0.0004565634,0.000092952134,0.00005490556,0.00005937346,0.00033594365,0.0044735176],"genre_scores_gemma":[0.87172437,0.0024664013,0.12066119,0.00010043364,0.0001373835,0.00018422012,0.00010952196,0.00015457759,0.004461947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907196,0.0004040923,0.000044118857,0.00011706494,0.00023786418,0.00012499932],"domain_scores_gemma":[0.9991571,0.00053168385,0.000090143796,0.000075683594,0.00010499312,0.000040469426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011087233,0.0007039466,0.0007558744,0.00087689655,0.00064138067,0.0014048431,0.0014610564,0.0010014375,0.0014643206],"category_scores_gemma":[0.003381523,0.00051591906,0.0003014817,0.0014799464,0.00085102255,0.0028916579,0.00097126607,0.00056105026,0.00032888795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016158911,0.00007678414,0.00062977074,0.00023594589,0.00004478972,0.00012163675,0.00012996673,0.8290969,0.0050364053,0.08314225,0.0017015946,0.07962235],"study_design_scores_gemma":[0.00001575986,0.000045434237,0.00016356785,0.000017898996,0.000015868234,0.00007980743,0.00004462273,0.94878954,0.0009749225,0.048112594,0.0017275129,0.000012423565],"about_ca_topic_score_codex":0.0017831621,"about_ca_topic_score_gemma":0.0016896157,"teacher_disagreement_score":0.0017831621,"about_ca_system_score_codex":0.00085019134,"about_ca_system_score_gemma":0.0006846442,"threshold_uncertainty_score":0.0061685443},"labels":[],"label_agreement":null},{"id":"W2135149085","doi":"10.1109/dnsr.2004.1344730","title":"On the performance and policies of mobile peer-to-peer network protocols","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Node (physics); Scalability; Zipf's law; Distributed computing; Throughput; Mobile ad hoc network; Peer-to-peer; Incentive; Routing protocol; Wireless ad hoc network; Mobile computing; Popularity; Routing (electronic design automation); Wireless; Database","score_opus":0.01492950736663311,"score_gpt":0.2662020303494079,"score_spread":0.2512725229827748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135149085","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19515067,0.00985193,0.74609435,0.00890026,0.0007594268,0.0005629476,0.00040503495,0.0010060339,0.03726941],"genre_scores_gemma":[0.9618704,0.0029895748,0.031446952,0.0002742453,0.000470075,0.00024269806,0.00012290721,0.000121588535,0.0024615705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915046,0.0042239283,0.00039477687,0.00083150767,0.0022892023,0.00075598917],"domain_scores_gemma":[0.9341966,0.049544882,0.004252603,0.004491656,0.0058350344,0.0016792595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014289171,0.0014045099,0.0022241941,0.0018833489,0.002431085,0.0039729318,0.002885538,0.003090203,0.0018335937],"category_scores_gemma":[0.100261055,0.00085790927,0.00056987634,0.0019986597,0.0039040905,0.0075761043,0.002887734,0.0025970293,0.0007702976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004712771,0.00015361462,0.003308189,0.00017546327,0.000070959744,0.00023878344,0.00069308595,0.4971424,0.001957886,0.45674494,0.004331472,0.03471186],"study_design_scores_gemma":[0.000051615458,0.00013074244,0.00050978543,0.000049532977,0.000024291503,0.00015596882,0.000138889,0.8469252,0.00063680595,0.14886057,0.0024829123,0.000033623866],"about_ca_topic_score_codex":0.002580077,"about_ca_topic_score_gemma":0.0012777093,"teacher_disagreement_score":0.014289171,"about_ca_system_score_codex":0.003291188,"about_ca_system_score_gemma":0.0026921532,"threshold_uncertainty_score":0.07556927},"labels":[],"label_agreement":null},{"id":"W2135158652","doi":"10.1109/icdcsw.2003.1203637","title":"Clusterhead controlled token for virtual base station on-demand in MANETs","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer network; Polling; Computer science; Mobile ad hoc network; Security token; Wireless ad hoc network; Base station; Network packet; Wireless; Mobile computing; Polling system; Telecommunications","score_opus":0.012660696297387416,"score_gpt":0.2504822377523699,"score_spread":0.23782154145498247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135158652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033408948,0.0008341293,0.99164057,0.00010097956,0.00016588299,0.00010299517,0.00006393932,0.0007589164,0.0029915604],"genre_scores_gemma":[0.45582986,0.0023241504,0.5276323,0.0002550307,0.00028514036,0.0005683476,0.00038172046,0.00048921176,0.012234288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990502,0.0003165813,0.00004588358,0.00011442308,0.0003531595,0.000119809185],"domain_scores_gemma":[0.9985398,0.0008322199,0.0001348937,0.00019258297,0.00023825293,0.000062262574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011595009,0.00056075805,0.00058937055,0.0010927598,0.00065888296,0.0016273173,0.0020391578,0.00062657386,0.004115728],"category_scores_gemma":[0.005825151,0.0002899645,0.00039816773,0.0019562878,0.0010248086,0.0021002556,0.00073622115,0.0011525671,0.0013603288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023906845,0.000094408155,0.0009965224,0.00045492363,0.000048762566,0.00044712666,0.00018332638,0.32255307,0.0047989707,0.49209934,0.010168496,0.16791594],"study_design_scores_gemma":[0.000029311364,0.00008479373,0.00016846064,0.000043771084,0.000027940308,0.00028716555,0.00004745478,0.8917074,0.003815216,0.08441344,0.019339196,0.000035882153],"about_ca_topic_score_codex":0.002128904,"about_ca_topic_score_gemma":0.0035361485,"teacher_disagreement_score":0.004115728,"about_ca_system_score_codex":0.0015283842,"about_ca_system_score_gemma":0.0015940153,"threshold_uncertainty_score":0.013768494},"labels":[],"label_agreement":null},{"id":"W2135207211","doi":"10.1109/icc.2006.255627","title":"A Position-Based QoS Routing Scheme for UWB Ad-Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Quality of service; Adaptive quality of service multi-hop routing; Reservation; Optimized Link State Routing Protocol; Wireless Routing Protocol; Bandwidth (computing); Ad hoc wireless distribution service; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Mobile ad hoc network; Geographic routing; Routing protocol; Distributed computing; Telecommunications; Network packet","score_opus":0.058441837904731245,"score_gpt":0.3214503915157503,"score_spread":0.26300855361101905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135207211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03176087,0.0013478729,0.9590479,0.00056035025,0.0007064298,0.00017269989,0.00008211396,0.0013510077,0.0049707647],"genre_scores_gemma":[0.5056254,0.0012895948,0.4827368,0.00041011663,0.0003782878,0.00017972928,0.00032433876,0.00011562956,0.008940113],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994654,0.00011119872,0.00005131884,0.00008441252,0.00023593882,0.000051778632],"domain_scores_gemma":[0.99932563,0.00011131961,0.000093334376,0.0001355466,0.00026447096,0.00006975677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073610933,0.0004992147,0.00039029846,0.00058515667,0.00092618406,0.00074497785,0.0010753266,0.000617063,0.0012476732],"category_scores_gemma":[0.0015450299,0.0001885278,0.00030896367,0.00045656893,0.00050202745,0.0010850871,0.0008247909,0.00083514396,0.00060986995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005012825,0.00020806224,0.0009753825,0.00039658076,0.00007831116,0.00055008294,0.0005457944,0.055096373,0.25602898,0.109960355,0.0073914495,0.56826735],"study_design_scores_gemma":[0.00020150935,0.0015098586,0.0013766646,0.00009706272,0.00019307002,0.0025602346,0.00023852008,0.7069079,0.14749227,0.028872976,0.11028395,0.00026588925],"about_ca_topic_score_codex":0.00052529335,"about_ca_topic_score_gemma":0.0007473703,"teacher_disagreement_score":0.0012476732,"about_ca_system_score_codex":0.00061701686,"about_ca_system_score_gemma":0.0004467889,"threshold_uncertainty_score":0.0044767857},"labels":[],"label_agreement":null},{"id":"W2135290577","doi":"10.1109/lcn.2001.990837","title":"Profile-based protocols in wireless mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Wireless network; Routing (electronic design automation); Mobile computing; Wireless; Distributed computing; Ad hoc wireless distribution service; Telecommunications; Network packet","score_opus":0.02015228534443083,"score_gpt":0.2538532421629141,"score_spread":0.23370095681848327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135290577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002386157,0.015775379,0.96604276,0.0014496928,0.0016027465,0.00040652233,0.000078582605,0.0011246132,0.011133614],"genre_scores_gemma":[0.12936655,0.05148289,0.79181415,0.0017043906,0.0038290462,0.0028442794,0.000818566,0.00054407446,0.017596088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961681,0.0012166704,0.00039707287,0.00031099314,0.0016923512,0.00021479277],"domain_scores_gemma":[0.9961365,0.0017707949,0.0003371673,0.0008823494,0.0007043299,0.00016887933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041316818,0.0016232659,0.0015131717,0.0016399277,0.0015465623,0.0040306877,0.0036017285,0.0032032111,0.0022259632],"category_scores_gemma":[0.010477092,0.0012495524,0.00081276154,0.0039188755,0.002763117,0.009943824,0.0027385473,0.0050931256,0.00275733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011536881,0.00013370592,0.00039982743,0.00068226346,0.00006368404,0.0003841949,0.00056877197,0.038371302,0.0032268085,0.71362627,0.018992785,0.22343497],"study_design_scores_gemma":[0.000089542285,0.00019415481,0.00020329423,0.00043885183,0.000105037245,0.0010959493,0.00017389622,0.16772845,0.0031485448,0.6261776,0.20051382,0.00013086415],"about_ca_topic_score_codex":0.0010235372,"about_ca_topic_score_gemma":0.0006293671,"teacher_disagreement_score":0.0041316818,"about_ca_system_score_codex":0.0012608862,"about_ca_system_score_gemma":0.0016250242,"threshold_uncertainty_score":0.021850646},"labels":[],"label_agreement":null},{"id":"W2135410054","doi":"10.1186/1687-1499-2013-106","title":"Data dissemination with rateless coding in a grid vehicular topology","year":2013,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Iran University of Science and Technology; Isfahan University of Technology; University of Victoria; University of Canterbury","keywords":"Computer science; Computer network; Vehicular ad hoc network; Coding (social sciences); Wireless ad hoc network; Grid; Dissemination; Decoding methods; Network topology; Ranging; Crash; Wireless; Distributed computing; Telecommunications","score_opus":0.03790265162574818,"score_gpt":0.2933127146743258,"score_spread":0.2554100630485776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135410054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28907424,0.00050788483,0.70424294,0.0005004258,0.00010483334,0.00009790805,0.0001305023,0.00059681846,0.004744461],"genre_scores_gemma":[0.97637784,0.0001281647,0.022751706,0.000025296233,0.00001006493,0.000028251547,0.000038459824,0.0000090757185,0.0006312017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996209,0.00018120672,0.000019052313,0.000038899496,0.00009186429,0.00004797454],"domain_scores_gemma":[0.9982146,0.001031345,0.0002130938,0.00021000687,0.00028737762,0.000043526405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007589535,0.00024054215,0.00043130844,0.00043641886,0.00027406143,0.00046636412,0.0005988183,0.00044022908,0.0004135859],"category_scores_gemma":[0.0031055654,0.00014681647,0.00017811006,0.0005061687,0.0004475611,0.00076313445,0.00068839284,0.00034312412,0.000113084396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055283436,0.000055193064,0.0009141502,0.00009588012,0.00003128503,0.0004013576,0.00015615404,0.9071553,0.021614019,0.026176294,0.0010354613,0.0418121],"study_design_scores_gemma":[0.000028018545,0.00006015455,0.000072921874,0.000003308841,0.0000053722797,0.000054097833,0.000014845965,0.9936945,0.0022048627,0.0035017256,0.0003542552,0.0000060894668],"about_ca_topic_score_codex":0.0025964268,"about_ca_topic_score_gemma":0.0013543719,"teacher_disagreement_score":0.0025964268,"about_ca_system_score_codex":0.0005488356,"about_ca_system_score_gemma":0.00037906805,"threshold_uncertainty_score":0.0051626563},"labels":[],"label_agreement":null},{"id":"W2135455695","doi":"10.1109/wcnc.2004.1311576","title":"A selective CSMA protocol with cooperative nulling for ad hoc networks with smart antennas","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Omnidirectional antenna; Network packet; Distributed coordination function; Directional antenna; Wireless ad hoc network; Beamforming; Transmission (telecommunications); Protocol (science); Throughput; Antenna (radio); IEEE 802.11; Wireless; Telecommunications","score_opus":0.010933017130866255,"score_gpt":0.24458476003472585,"score_spread":0.2336517429038596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135455695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008712971,0.00047643165,0.9874894,0.0001484001,0.00018213927,0.00019031375,0.000017664059,0.00044458103,0.0023380702],"genre_scores_gemma":[0.5434348,0.0012365362,0.4445522,0.00054986286,0.00040352068,0.0016441465,0.00018128507,0.000099047495,0.007898548],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991371,0.00023321307,0.00007707556,0.00008851947,0.00038398628,0.00008009577],"domain_scores_gemma":[0.99844295,0.00064209313,0.00021971451,0.00028191754,0.00033461844,0.00007872838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012996917,0.00064433285,0.00047306836,0.000799605,0.00075198256,0.0007735445,0.0014658867,0.0006075161,0.0013356698],"category_scores_gemma":[0.0022689279,0.00023607098,0.00046501268,0.0006996835,0.0012696462,0.001418866,0.00094773463,0.0010186459,0.0004854174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054102874,0.00025311214,0.0015537104,0.00087690004,0.00016410335,0.00067967334,0.00060439634,0.10320599,0.13368328,0.33742544,0.008746968,0.4122654],"study_design_scores_gemma":[0.00028153215,0.0012045874,0.00057718076,0.000080801125,0.0002684744,0.001282811,0.00016957484,0.8158747,0.054552212,0.046372186,0.07919807,0.00013791387],"about_ca_topic_score_codex":0.0007127187,"about_ca_topic_score_gemma":0.0012530659,"teacher_disagreement_score":0.0014658867,"about_ca_system_score_codex":0.00047920793,"about_ca_system_score_gemma":0.0011011679,"threshold_uncertainty_score":0.006873548},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; 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","score_opus":0.03262381685992377,"score_gpt":0.27130757681035667,"score_spread":0.2386837599504329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135495315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01498531,0.0011870187,0.9828414,0.0001115695,0.00004303242,0.00003415679,0.000034226672,0.00006312906,0.0007001634],"genre_scores_gemma":[0.5139667,0.0015801669,0.48272872,0.00007613738,0.00016686982,0.00017371817,0.0001567682,0.00010522301,0.0010457162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987533,0.0004927084,0.00010026009,0.0001536056,0.00043200544,0.000068194255],"domain_scores_gemma":[0.99799395,0.0010883743,0.00045174992,0.00013418285,0.0002616359,0.00007012019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019184868,0.0011747462,0.00088932255,0.0011805046,0.00036429995,0.0008914974,0.001299516,0.0008398211,0.00046086745],"category_scores_gemma":[0.004806029,0.000229083,0.0004134501,0.001172866,0.000572027,0.0029231703,0.0008728357,0.00060821534,0.00011128277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008104402,0.000056988803,0.0015088446,0.00033309264,0.00009886321,0.000056975216,0.000087592714,0.860741,0.017033523,0.03048553,0.0007794711,0.088737085],"study_design_scores_gemma":[0.000007422825,0.00018652699,0.00037274067,0.000017896507,0.000026605998,0.000112575006,0.000025550406,0.9829002,0.0051311217,0.008844371,0.0023545008,0.000020493513],"about_ca_topic_score_codex":0.00036575002,"about_ca_topic_score_gemma":0.00050675956,"teacher_disagreement_score":0.0019184868,"about_ca_system_score_codex":0.001061071,"about_ca_system_score_gemma":0.0006044495,"threshold_uncertainty_score":0.010146022},"labels":[],"label_agreement":null},{"id":"W2135526557","doi":"10.1109/glocom.2003.1258299","title":"Efficient on-demand routing for mobile ad-hoc wireless access networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Computer network; Computer science; Ad hoc On-Demand Distance Vector Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Wireless ad hoc network; Ad hoc wireless distribution service; Destination-Sequenced Distance Vector routing; Interior gateway protocol; Routing protocol; Distributed computing; Network packet; Wireless; Telecommunications","score_opus":0.015652036723786726,"score_gpt":0.27064241891390095,"score_spread":0.2549903821901142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135526557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024778286,0.004307873,0.9569347,0.0007368054,0.0003322981,0.0002055087,0.00014820925,0.00055465766,0.0120017035],"genre_scores_gemma":[0.7073596,0.0076754447,0.26444677,0.00025667247,0.00033858675,0.00025384175,0.00092735566,0.0001848143,0.018556986],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999456,0.00018628787,0.00002155978,0.000037386344,0.00024884508,0.000049828857],"domain_scores_gemma":[0.9995832,0.000190576,0.000050714454,0.00006503765,0.00008840642,0.0000220108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000463874,0.00053651514,0.0005387895,0.0003919672,0.0004668879,0.0008090505,0.0011165619,0.0005448392,0.0014664654],"category_scores_gemma":[0.0011797402,0.00021491991,0.00024353428,0.0006395265,0.0003146095,0.0013609527,0.0007394634,0.00041957587,0.00054061005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019453387,0.00026741368,0.001380388,0.0011423266,0.000116997304,0.0006593944,0.00018529725,0.35034916,0.030392269,0.13058208,0.015581445,0.46914876],"study_design_scores_gemma":[0.000036102905,0.00021776244,0.00064809155,0.000039635175,0.00004662898,0.0005548961,0.00013431278,0.895698,0.007759274,0.051074874,0.043761883,0.000028467972],"about_ca_topic_score_codex":0.00077637285,"about_ca_topic_score_gemma":0.0017298879,"teacher_disagreement_score":0.0014664654,"about_ca_system_score_codex":0.00042249402,"about_ca_system_score_gemma":0.00038888308,"threshold_uncertainty_score":0.0049057603},"labels":[],"label_agreement":null},{"id":"W2135532095","doi":"10.1109/wimob.2005.1512892","title":"On the inadequacy of MANET routing to efficiently use the wireless capacity","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Ad hoc On-Demand Distance Vector Routing; Bandwidth (computing); Mobile ad hoc network; Routing protocol; Distributed computing; Network packet","score_opus":0.02032626954660214,"score_gpt":0.2124601501176749,"score_spread":0.19213388057107278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135532095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18679081,0.009852693,0.7388126,0.008799575,0.00024879386,0.00010365092,0.00019824476,0.0008397434,0.054353774],"genre_scores_gemma":[0.8944906,0.006171107,0.09202559,0.0007868172,0.00017161567,0.00010541623,0.00008371213,0.00018551284,0.0059797107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983852,0.00072219555,0.000036013258,0.00014911944,0.0005696686,0.00013786663],"domain_scores_gemma":[0.99391925,0.0046288557,0.00026942798,0.0004684116,0.00059034035,0.00012378964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034793133,0.0004257835,0.0006141531,0.0006904349,0.00062650995,0.001999024,0.00088075607,0.0009809667,0.0014702366],"category_scores_gemma":[0.008493476,0.00037507707,0.0002790933,0.0008639408,0.002098182,0.004271062,0.00085933163,0.0014716486,0.00070516934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022358584,0.000104643375,0.001957756,0.00032558365,0.00008187284,0.00015601842,0.00020919745,0.707174,0.009873913,0.16227439,0.003442926,0.11417615],"study_design_scores_gemma":[0.0000258188,0.00027959314,0.0010270934,0.00018937388,0.0000308842,0.00043339387,0.00028746805,0.84408134,0.011617423,0.12808935,0.01387098,0.00006735393],"about_ca_topic_score_codex":0.0018445152,"about_ca_topic_score_gemma":0.002447969,"teacher_disagreement_score":0.0034793133,"about_ca_system_score_codex":0.00094042264,"about_ca_system_score_gemma":0.0011637211,"threshold_uncertainty_score":0.01840061},"labels":[],"label_agreement":null},{"id":"W2135851458","doi":"10.1109/aina.2012.93","title":"Assessing the Expected Performance of the OLSR Routing Protocol for Denser Urban Core Ad Hoc Network Deployments","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Optimized Link State Routing Protocol; Computer science; Computer network; Routing protocol; Ad hoc wireless distribution service; Wireless ad hoc network; Node (physics); Mobile ad hoc network; Distributed computing; Routing (electronic design automation); Telecommunications; Engineering; Wireless","score_opus":0.05502475831077048,"score_gpt":0.32677164757975247,"score_spread":0.271746889268982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135851458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9765505,0.00013830268,0.017168144,0.00016996989,0.000033499073,0.00017568821,0.0004552189,0.00036137583,0.0049473145],"genre_scores_gemma":[0.9926403,0.000101838115,0.006243793,0.00002508208,0.0000068992167,0.0000521827,0.0003289115,0.000025316558,0.00057559804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797446,0.00049656135,0.00014622536,0.00028486145,0.00073254504,0.00036526704],"domain_scores_gemma":[0.9870483,0.0072099757,0.0012943088,0.0010610351,0.003011744,0.00037453833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024504787,0.00054468546,0.0002970845,0.00096180785,0.0004415645,0.00078763743,0.00062889006,0.0007886047,0.000806658],"category_scores_gemma":[0.013860077,0.00017294748,0.00021638266,0.00084243476,0.0005678166,0.0017933676,0.00049180107,0.00050167827,0.00042050646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00149083,0.00096484245,0.079277046,0.00040795753,0.00016182751,0.00086242513,0.0004913709,0.7752237,0.060400818,0.004474623,0.00260226,0.073642366],"study_design_scores_gemma":[0.00009310583,0.0069991695,0.080504306,0.000053724507,0.00008784737,0.0010724422,0.0010420097,0.84445274,0.060849518,0.0025131912,0.0022302757,0.000101689795],"about_ca_topic_score_codex":0.0033003353,"about_ca_topic_score_gemma":0.0026935146,"teacher_disagreement_score":0.0033003353,"about_ca_system_score_codex":0.0007969395,"about_ca_system_score_gemma":0.0004743024,"threshold_uncertainty_score":0.01295954},"labels":[],"label_agreement":null},{"id":"W2135887976","doi":"10.1109/wimob.2006.1696347","title":"Integrating UMTS and Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; General Packet Radio Service; UMTS frequency bands; Wireless ad hoc network; Mobile ad hoc network; Internetworking; Vehicular ad hoc network; Handover; GPRS core network; Network packet; Wireless; Telecommunications; The Internet","score_opus":0.005338774427980054,"score_gpt":0.21128938387650942,"score_spread":0.20595060944852936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135887976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023161404,0.009414784,0.835642,0.0025461465,0.0019084928,0.00021472818,0.00009338007,0.0027803574,0.124238744],"genre_scores_gemma":[0.51240534,0.011018177,0.41768947,0.0017440928,0.003037789,0.00026489876,0.00028839856,0.00029319496,0.0532586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987872,0.0004705545,0.00007057049,0.000116175106,0.00037231596,0.00018319873],"domain_scores_gemma":[0.99945587,0.00008674995,0.000044032055,0.00016814141,0.00017735681,0.0000677598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009893823,0.00063943455,0.00030655653,0.00048864225,0.0007311235,0.0014917055,0.0008280594,0.0007363794,0.0022194975],"category_scores_gemma":[0.0014211438,0.00034572303,0.00040184078,0.0006906142,0.0005103535,0.0019427635,0.0016649701,0.0009474154,0.0014195713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014035554,0.00008840436,0.0034527937,0.00033762003,0.00010284605,0.000788153,0.00068164937,0.020212635,0.029892841,0.2869372,0.012014632,0.6453509],"study_design_scores_gemma":[0.000031847103,0.00066346145,0.0026134406,0.0002504116,0.000241549,0.0017155502,0.00039601212,0.09795123,0.029452184,0.10560516,0.76098967,0.00008951371],"about_ca_topic_score_codex":0.0013627568,"about_ca_topic_score_gemma":0.0017521197,"teacher_disagreement_score":0.0022194975,"about_ca_system_score_codex":0.0007711811,"about_ca_system_score_gemma":0.0007559817,"threshold_uncertainty_score":0.0074249506},"labels":[],"label_agreement":null},{"id":"W2135952676","doi":"10.1109/ccece.2004.1349658","title":"A network layer based architecture for service discovery in mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Service discovery; Computer network; Computer science; Mobile ad hoc network; Vehicular ad hoc network; Scalability; Service (business); Network layer; Distributed computing; Routing protocol; Service layer; Wireless ad hoc network; Adaptive quality of service multi-hop routing; Application layer; Mobile computing; Context (archaeology); Optimized Link State Routing Protocol; Layer (electronics); Routing (electronic design automation); Quality of service; World Wide Web; Web service; Telecommunications; Wireless; Network packet; Database","score_opus":0.011112299966585604,"score_gpt":0.23124798157861365,"score_spread":0.22013568161202804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135952676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029608225,0.0013599303,0.9782572,0.001030262,0.00038270478,0.00041624185,0.000092229384,0.0058063045,0.009694268],"genre_scores_gemma":[0.08647078,0.0028809174,0.8915573,0.0009784302,0.00030010325,0.00080742396,0.0007690318,0.00037699888,0.01585893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986203,0.00026522757,0.0002073671,0.00015036235,0.00063935673,0.00011731985],"domain_scores_gemma":[0.99921966,0.00013052701,0.00008170907,0.0001930752,0.00026020434,0.00011482862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022438467,0.00067185034,0.0007312577,0.0011855306,0.00154963,0.0038313603,0.0029134622,0.001959867,0.0031136686],"category_scores_gemma":[0.0024489346,0.0007940624,0.00091780216,0.0014111169,0.0011679628,0.003921242,0.0022570149,0.002819616,0.002642657],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030085247,0.00033693778,0.0015281534,0.0011548552,0.00035346675,0.0010751677,0.0011280978,0.06023198,0.056745216,0.4481599,0.041029405,0.38795596],"study_design_scores_gemma":[0.00012302177,0.00048375645,0.00086068717,0.00027870774,0.00034562722,0.001182151,0.00020967961,0.4831097,0.02060347,0.10569494,0.38688767,0.00022050373],"about_ca_topic_score_codex":0.0040921387,"about_ca_topic_score_gemma":0.006200131,"teacher_disagreement_score":0.0040921387,"about_ca_system_score_codex":0.0013280634,"about_ca_system_score_gemma":0.0022167198,"threshold_uncertainty_score":0.011866748},"labels":[],"label_agreement":null},{"id":"W2135959573","doi":"10.1109/wcnc.2011.5779216","title":"Best path to best gateway scheme for multichannel multi-interface wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer network; Computer science; Interior gateway protocol; Gateway (web page); Wireless mesh network; Default gateway; Internetworking; Path (computing); Gateway address; Network packet; The Internet; Routing protocol; Router; Metrics; Border Gateway Protocol; Shortest path problem; Distributed computing; H.248; Wireless; Wireless network; Telecommunications; Routing table; Link-state routing protocol","score_opus":0.04534983274878299,"score_gpt":0.27130847701783567,"score_spread":0.22595864426905268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135959573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043421492,0.0012907805,0.9510493,0.0003059222,0.00018012903,0.00029047448,0.000109237946,0.00077076245,0.0025817628],"genre_scores_gemma":[0.5318493,0.0007288103,0.4642134,0.00022697177,0.00014103446,0.00027151834,0.00033177587,0.0000843134,0.002152974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990107,0.00041968236,0.00005627548,0.000109865585,0.0002926786,0.000110741115],"domain_scores_gemma":[0.99891603,0.00044017693,0.00018053115,0.00024512087,0.0001429142,0.00007523699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019679768,0.00075363496,0.001075737,0.0013313359,0.0011284708,0.0008048981,0.0020779616,0.00095562625,0.0013498474],"category_scores_gemma":[0.00315983,0.0002807803,0.00044643856,0.0012554898,0.0007453099,0.0016106395,0.0015316395,0.0008617961,0.00038136117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008492031,0.0003831725,0.0031272944,0.0004871185,0.00026541113,0.00047867405,0.0005997131,0.29564837,0.028076388,0.061560307,0.009345364,0.59917897],"study_design_scores_gemma":[0.0002079456,0.0006837731,0.0012266294,0.000045992525,0.00010012969,0.0007291259,0.0001338213,0.9412921,0.010258631,0.033403546,0.011844226,0.00007410697],"about_ca_topic_score_codex":0.001047186,"about_ca_topic_score_gemma":0.0025362244,"teacher_disagreement_score":0.0020779616,"about_ca_system_score_codex":0.0008220409,"about_ca_system_score_gemma":0.0006571656,"threshold_uncertainty_score":0.010407805},"labels":[],"label_agreement":null},{"id":"W2136004719","doi":"10.1109/wcnc.2006.1683491","title":"A performance modeling of connectivity in ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Node (physics); Population; Poisson distribution; Mobile ad hoc network; Mobility model; Service (business); Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Distributed computing; Telecommunications; Mathematics; Statistics; Wireless; Engineering","score_opus":0.011206440491986788,"score_gpt":0.21001586375979275,"score_spread":0.19880942326780596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136004719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08211605,0.0037015302,0.88562375,0.0020945824,0.0002369369,0.00013428889,0.00052523275,0.0007256494,0.024841944],"genre_scores_gemma":[0.95449275,0.0043626884,0.03147665,0.00016261089,0.00037302243,0.00018452165,0.00042435993,0.00013621144,0.0083871605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989949,0.0003350612,0.000042182866,0.00015621696,0.00037596788,0.00009571006],"domain_scores_gemma":[0.9979778,0.0011044376,0.0003058139,0.00017526197,0.00037315907,0.00006342322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094613497,0.0009937258,0.0004825603,0.000963916,0.00056825706,0.0014486057,0.0013680728,0.0015560694,0.0017254339],"category_scores_gemma":[0.007202143,0.00038668147,0.00039572173,0.0016509695,0.0007459334,0.0031578976,0.0005428091,0.0008587214,0.0008909969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029085671,0.000031684405,0.0012864331,0.00006189872,0.00002216189,0.00015565538,0.00008136829,0.9376427,0.0018880024,0.044711586,0.0012619537,0.012827377],"study_design_scores_gemma":[0.0000042485653,0.000046029185,0.00037413882,0.000013118605,0.0000108246195,0.00012086248,0.000025149857,0.98216313,0.00033018706,0.0138904685,0.0030137622,0.000008114273],"about_ca_topic_score_codex":0.003039609,"about_ca_topic_score_gemma":0.001258628,"teacher_disagreement_score":0.003039609,"about_ca_system_score_codex":0.0010877956,"about_ca_system_score_gemma":0.0005194378,"threshold_uncertainty_score":0.007892549},"labels":[],"label_agreement":null},{"id":"W2136419300","doi":"10.1109/bsc.2006.1644620","title":"Hidden Problems with the Hidden Node Problem","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hidden node problem; Computer science; Jamming; Node (physics); Focus (optics); Computer network; Wireless; Collision avoidance; Wireless network; Distributed computing; Collision; Multiple Access with Collision Avoidance for Wireless; Computer security; Key distribution in wireless sensor networks; Engineering; Wi-Fi array; Telecommunications","score_opus":0.007853951358443417,"score_gpt":0.1953538881335024,"score_spread":0.187499936775059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136419300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02987638,0.0034697328,0.9427117,0.004478253,0.00071565894,0.00020160011,0.00007111143,0.00026598122,0.018209536],"genre_scores_gemma":[0.7798066,0.0065628197,0.18420032,0.0016166943,0.0022148534,0.00047969207,0.00013262032,0.00017916718,0.02480718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946557,0.0016113766,0.00024252248,0.000657346,0.0022162695,0.0006168037],"domain_scores_gemma":[0.97520655,0.017557776,0.0023381328,0.0029168895,0.0014482631,0.0005323928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041498267,0.0015156087,0.0010931795,0.0010291067,0.0024529148,0.0032401942,0.0027977165,0.005428825,0.009279847],"category_scores_gemma":[0.026690837,0.0011315369,0.001470768,0.0011540815,0.005289715,0.0116194105,0.0056599323,0.0060960655,0.0013044078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055267167,0.00025017784,0.0042241113,0.00097059866,0.00034842023,0.0035449786,0.0023570708,0.11958153,0.012345804,0.7232516,0.009754416,0.12281865],"study_design_scores_gemma":[0.00040392732,0.0004331566,0.0014778528,0.00042650432,0.00030525937,0.00591822,0.0011968793,0.24260676,0.01692175,0.7003466,0.029727586,0.0002355365],"about_ca_topic_score_codex":0.0012948434,"about_ca_topic_score_gemma":0.0006490227,"teacher_disagreement_score":0.009279847,"about_ca_system_score_codex":0.0010379564,"about_ca_system_score_gemma":0.0012171894,"threshold_uncertainty_score":0.031044185},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.13926628085592266,"score_gpt":0.29909816619566626,"score_spread":0.1598318853397436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136520221","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061832764,0.5678076,0.37093315,0.0030938445,0.0024195467,0.00027928254,0.00034583622,0.0004161897,0.0485213],"genre_scores_gemma":[0.08009025,0.7460493,0.144651,0.0010281501,0.0039541256,0.00038883422,0.0009735351,0.00019497923,0.02266986],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930906,0.00016575895,0.00007324275,0.00012379113,0.00028571775,0.000042397944],"domain_scores_gemma":[0.99921477,0.00040795488,0.00006249335,0.00007620132,0.00020519765,0.000033223412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009817824,0.0006990833,0.0007325439,0.0014046236,0.00043195565,0.001585691,0.001683207,0.0012739567,0.0038769338],"category_scores_gemma":[0.0020551377,0.00060550636,0.00051456114,0.0023165694,0.00043195958,0.0027481802,0.00083735725,0.0008648579,0.0017738331],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000641705,0.00009717504,0.0010626344,0.003366744,0.00006175956,0.00016631755,0.000102567436,0.020128077,0.0027786898,0.049584895,0.024731657,0.89785546],"study_design_scores_gemma":[0.000028729999,0.00029617702,0.0011316806,0.0014775968,0.00007853465,0.0021802266,0.0002422295,0.07126268,0.0044925082,0.069641516,0.84910554,0.00006266226],"about_ca_topic_score_codex":0.0007141747,"about_ca_topic_score_gemma":0.00066724553,"teacher_disagreement_score":0.0038769338,"about_ca_system_score_codex":0.00059801893,"about_ca_system_score_gemma":0.00061950646,"threshold_uncertainty_score":0.012969613},"labels":[],"label_agreement":null},{"id":"W2136625716","doi":"10.1109/glocom.2009.5425384","title":"Probability Distribution of Multi-Hop Multipath connection in a Random Network","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Connection (principal bundle); Computer science; Probability distribution; Hop (telecommunications); Path (computing); Multipath propagation; Topology (electrical circuits); Computer network; Mathematics; Statistics; Channel (broadcasting); Combinatorics","score_opus":0.02065994585666211,"score_gpt":0.2451261556075376,"score_spread":0.22446620975087547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136625716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14687917,0.0006708236,0.84640694,0.00060231134,0.00007185485,0.00010399599,0.00024469366,0.0006597454,0.0043605077],"genre_scores_gemma":[0.97366446,0.00070960156,0.02247523,0.00007635668,0.00009924061,0.00015307068,0.00015998188,0.00007651181,0.0025855645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861,0.00044267788,0.00005874523,0.00028043802,0.00044159545,0.00016653696],"domain_scores_gemma":[0.9808687,0.014108015,0.0019872594,0.0012358463,0.0014014844,0.000398671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028931554,0.00046991603,0.00068408303,0.0016887793,0.00055284926,0.0014129013,0.0012365998,0.0011026384,0.0027839073],"category_scores_gemma":[0.019068427,0.00045402694,0.00045857797,0.0011465843,0.0016691269,0.0029888605,0.00078259635,0.0010014294,0.00055225124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002857563,0.00006440499,0.007837242,0.00022409321,0.00006745351,0.00076163025,0.00036018956,0.60067743,0.0077447724,0.3625969,0.0014778647,0.017902263],"study_design_scores_gemma":[0.000026586484,0.00009522984,0.0021868197,0.00003434043,0.00002285237,0.00055539474,0.00007374486,0.93361765,0.0020786994,0.060164988,0.0010880786,0.000055557455],"about_ca_topic_score_codex":0.0008167933,"about_ca_topic_score_gemma":0.00042601168,"teacher_disagreement_score":0.0028931554,"about_ca_system_score_codex":0.0010045579,"about_ca_system_score_gemma":0.00040183676,"threshold_uncertainty_score":0.0153006315},"labels":[],"label_agreement":null},{"id":"W2136712551","doi":"10.1109/iwcmc.2011.5982686","title":"Optimal antenna placement in multi-hop wireless networks with heterogeneous antennas","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Smart antenna; Beamforming; Directional antenna; Computer network; Wireless network; Reconfigurable antenna; Wireless; Distributed computing; Antenna (radio); Omnidirectional antenna; Telecommunications","score_opus":0.027155860035172903,"score_gpt":0.23143569182308663,"score_spread":0.20427983178791373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136712551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0486982,0.00062165037,0.94732314,0.00022201422,0.00004436712,0.000053968084,0.000052915115,0.00023754679,0.0027461739],"genre_scores_gemma":[0.7442714,0.00058943697,0.2527671,0.00007413095,0.00003894653,0.000114910355,0.0000997207,0.0000726412,0.0019717277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991443,0.0005233361,0.00002464048,0.0000927374,0.00011131768,0.0001035276],"domain_scores_gemma":[0.9987839,0.0008244112,0.00014353148,0.00009511629,0.00008084232,0.000072288574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011303024,0.001105235,0.0010827993,0.0007574478,0.00070903363,0.0008930933,0.0008222719,0.00092809915,0.0010009601],"category_scores_gemma":[0.003148729,0.0007969957,0.0004576408,0.0012564539,0.0009947338,0.0012805297,0.0009190745,0.00059766823,0.00033859105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004046272,0.000014909129,0.00019028783,0.000022663766,0.000009632228,0.000042608877,0.000016001171,0.98444206,0.0008209748,0.003297859,0.0003305274,0.010771933],"study_design_scores_gemma":[0.00001083928,0.00002471543,0.0000766608,0.000003424609,0.000004912075,0.000019624124,0.000025541869,0.9938222,0.0004574623,0.005311831,0.00023850489,0.0000042935258],"about_ca_topic_score_codex":0.001924559,"about_ca_topic_score_gemma":0.0023103356,"teacher_disagreement_score":0.001924559,"about_ca_system_score_codex":0.0010186713,"about_ca_system_score_gemma":0.00050099107,"threshold_uncertainty_score":0.0073910356},"labels":[],"label_agreement":null},{"id":"W2136858214","doi":"10.1109/lcn.2005.94","title":"No junk, no peeking, serious offers only: P2P file exchange in wireless ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer security; Wireless ad hoc network; Computer network; Enforcement; Authentication (law); Wireless; Protocol (science); Scheme (mathematics); Internet privacy; Telecommunications","score_opus":0.0083819968687198,"score_gpt":0.2194359259936359,"score_spread":0.2110539291249161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136858214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083239175,0.007913571,0.79558504,0.02151619,0.0035046372,0.00034928985,0.00015640297,0.0020728617,0.08566287],"genre_scores_gemma":[0.77920675,0.006311249,0.14552912,0.002440149,0.0024080088,0.00031627406,0.00023092523,0.00038317774,0.06317437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820566,0.00080405426,0.000081956336,0.00019182962,0.0006128697,0.00010362465],"domain_scores_gemma":[0.9961281,0.0018622548,0.000311348,0.0009395344,0.0004444086,0.00031435158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027096597,0.00044222694,0.00060507486,0.0006540349,0.0021953022,0.0030545173,0.0010067228,0.001618858,0.002779977],"category_scores_gemma":[0.009378789,0.0003068264,0.00029879223,0.00096708135,0.0027682972,0.009531723,0.0027631237,0.001799303,0.0013707274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052101427,0.00011557681,0.0020741099,0.00039004127,0.000050596995,0.0014487167,0.0012491632,0.013845965,0.005703342,0.6004436,0.034862887,0.33929494],"study_design_scores_gemma":[0.00011398146,0.0004231568,0.0009646144,0.00010611744,0.00012313784,0.003966384,0.0009221169,0.10983875,0.007477594,0.6536274,0.22229537,0.00014134649],"about_ca_topic_score_codex":0.00060801423,"about_ca_topic_score_gemma":0.00075203413,"teacher_disagreement_score":0.0030545173,"about_ca_system_score_codex":0.000524197,"about_ca_system_score_gemma":0.0009423232,"threshold_uncertainty_score":0.014330208},"labels":[],"label_agreement":null},{"id":"W2137095935","doi":"10.1109/lcn.2002.1181868","title":"Infrastructure-based MAC in wireless mobile ad-hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Network allocation vector; Multiple Access with Collision Avoidance for Wireless; Wireless ad hoc network; Inter-Access Point Protocol; IEEE 802.11; Network packet; Distributed coordination function; Service set; Backward compatibility; IEEE 802.11s; Ad hoc wireless distribution service; Vehicular ad hoc network; Media access control; Wireless network; Mobile ad hoc network; Wireless; Optimized Link State Routing Protocol; Wi-Fi; Routing protocol; Telecommunications; Wireless mesh network","score_opus":0.005403251742674791,"score_gpt":0.2144563516972464,"score_spread":0.2090530999545716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137095935","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047035776,0.012777324,0.9708702,0.0005776612,0.000822688,0.0001561483,0.000025177396,0.0010901267,0.0089771105],"genre_scores_gemma":[0.36573339,0.026054978,0.5890148,0.0006673981,0.00241496,0.0010162137,0.00025548192,0.0002677595,0.014574975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785185,0.0008721426,0.00012272158,0.00020407254,0.0007958697,0.00015322711],"domain_scores_gemma":[0.99866366,0.0006295393,0.00013882507,0.00023158385,0.000281796,0.000054633907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028057336,0.001088444,0.00087686855,0.0012621635,0.0008875909,0.0020459713,0.0024086449,0.0014409497,0.0019532114],"category_scores_gemma":[0.00449168,0.00067991257,0.00044890147,0.0018507227,0.0014587957,0.003354955,0.0014745656,0.0016512539,0.0010881942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018231658,0.0001512125,0.0012896196,0.0010651235,0.00013983317,0.0006675392,0.0005693805,0.1797943,0.008691115,0.3767795,0.015750963,0.41491902],"study_design_scores_gemma":[0.00009134169,0.0004382641,0.0007221331,0.000310702,0.0001779428,0.00083766895,0.00017641076,0.746116,0.0072389757,0.13358039,0.11020199,0.00010825959],"about_ca_topic_score_codex":0.0013188575,"about_ca_topic_score_gemma":0.0009603872,"teacher_disagreement_score":0.0028057336,"about_ca_system_score_codex":0.0009396269,"about_ca_system_score_gemma":0.0009727145,"threshold_uncertainty_score":0.014838338},"labels":[],"label_agreement":null},{"id":"W2137149451","doi":"10.1109/icn.2007.24","title":"Architectural Analysis of Multicast Routing Protocols for Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Multicast; Distributed computing; Wireless ad hoc network; Protocol Independent Multicast; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Distance Vector Multicast Routing Protocol; Geocast; Ad hoc wireless distribution service; Vehicular ad hoc network; Xcast; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.021467101254887537,"score_gpt":0.3054916500476797,"score_spread":0.28402454879279215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137149451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027551087,0.011305911,0.92047906,0.0012947113,0.0003355122,0.00022946062,0.00008905096,0.0003723253,0.03834278],"genre_scores_gemma":[0.48839113,0.014685943,0.4833226,0.00042430754,0.00060017494,0.00054714497,0.00053100643,0.00025709622,0.011240533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999206,0.00023793013,0.000049269078,0.000051722316,0.0003736262,0.00008138545],"domain_scores_gemma":[0.9995097,0.00015689335,0.00005280121,0.000067371926,0.00018666868,0.00002652324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554347,0.0006868754,0.00036116492,0.0010233797,0.0010901921,0.0016197106,0.001217441,0.0010456567,0.0014073531],"category_scores_gemma":[0.0023195425,0.00043276514,0.0006427814,0.0011287928,0.0006985908,0.0024051093,0.0007524553,0.0009813748,0.00048123783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005559942,0.0000664073,0.0008961802,0.00039081028,0.00005871389,0.0004054938,0.0005991913,0.10380639,0.0116430875,0.7917564,0.003821382,0.08650034],"study_design_scores_gemma":[0.0000176857,0.00017004837,0.00091760687,0.00021157453,0.00009804398,0.0009281223,0.00048686675,0.41792983,0.0052213157,0.4698625,0.104099594,0.000056803114],"about_ca_topic_score_codex":0.0008197297,"about_ca_topic_score_gemma":0.000849988,"teacher_disagreement_score":0.0016197106,"about_ca_system_score_codex":0.00093463575,"about_ca_system_score_gemma":0.00062144344,"threshold_uncertainty_score":0.00678128},"labels":[],"label_agreement":null},{"id":"W2137256981","doi":"10.1109/infcom.2010.5462065","title":"Optimal SINR-based Random Access","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Aloha; Random access; Optimization problem; Mathematical optimization; Maximization; Convex optimization; Utility maximization problem; Wireless network; Wireless ad hoc network; Throughput; Signal-to-interference-plus-noise ratio; Distributed computing; Wireless; Computer network; Utility maximization; Regular polygon; Algorithm; Mathematics; Telecommunications","score_opus":0.012929789558737508,"score_gpt":0.26386570200721987,"score_spread":0.25093591244848235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137256981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027064248,0.0002051054,0.99435294,0.00007701362,0.000028901406,0.000041863914,0.000019605228,0.00017276155,0.0023953759],"genre_scores_gemma":[0.67084223,0.00090377795,0.32132062,0.0004096931,0.00016802471,0.0004271014,0.0001638323,0.00011674682,0.0056479685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99461234,0.0027830575,0.00024734056,0.00084203755,0.001150897,0.00036430423],"domain_scores_gemma":[0.99670666,0.0018376672,0.00038926292,0.0003864282,0.0005951904,0.000084907166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028540618,0.0012825484,0.0014037638,0.0006691429,0.00051599334,0.0014545816,0.0014291607,0.0009569584,0.0023854],"category_scores_gemma":[0.008338309,0.0005237839,0.00059528364,0.0008024796,0.0012596971,0.0016517933,0.0011849959,0.0010373435,0.0011805339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027966723,0.00013201854,0.0005539619,0.00017674155,0.00008947247,0.0001082136,0.00012140771,0.76801276,0.0077083,0.119978465,0.0026789214,0.10016005],"study_design_scores_gemma":[0.00005233883,0.00011980682,0.00010096562,0.000014578627,0.000030687617,0.00008278035,0.000013667521,0.97023845,0.0020481038,0.025467366,0.001813024,0.000018304274],"about_ca_topic_score_codex":0.00066034455,"about_ca_topic_score_gemma":0.0010535743,"teacher_disagreement_score":0.0028540618,"about_ca_system_score_codex":0.000780992,"about_ca_system_score_gemma":0.001136111,"threshold_uncertainty_score":0.015093923},"labels":[],"label_agreement":null},{"id":"W2137342688","doi":"10.1109/sahcn.2006.288573","title":"BENCEManet: An Evaluation Framework for Service Discovery Protocols in MANET","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mobile ad hoc network; Benchmark (surveying); Computer science; Service discovery; Computer network; Wireless ad hoc network; Service (business); Mobile computing; Adaptive quality of service multi-hop routing; Wireless; Distributed computing; Optimized Link State Routing Protocol; World Wide Web; Telecommunications; Web service","score_opus":0.03616019249747484,"score_gpt":0.3321482537421853,"score_spread":0.2959880612447105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137342688","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015591265,0.0011965786,0.9576643,0.00078098377,0.0003028002,0.0017046503,0.0009684119,0.0070841243,0.014706901],"genre_scores_gemma":[0.26362672,0.0008122809,0.72348434,0.00039411566,0.00015505157,0.0037506064,0.0024872131,0.0013367212,0.003952875],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9740888,0.013560153,0.0014582973,0.0010166832,0.008924515,0.0009515652],"domain_scores_gemma":[0.980845,0.009247937,0.0013116989,0.002445966,0.005559989,0.00058950536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.024457822,0.0020401313,0.001663964,0.005083364,0.001474317,0.004301767,0.003959435,0.001969669,0.0032994119],"category_scores_gemma":[0.045311764,0.00049324025,0.0008972701,0.0035963068,0.0013065184,0.00436943,0.002673048,0.002028326,0.00091741176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017382143,0.0010466621,0.0055291625,0.0012479782,0.00030890998,0.0003705357,0.00041273024,0.3139763,0.006975665,0.20329651,0.030231347,0.43486607],"study_design_scores_gemma":[0.00015956239,0.00072842755,0.0008430826,0.0001922747,0.000078600395,0.00023848485,0.00015628946,0.92644835,0.0060886787,0.038400285,0.026594121,0.00007175105],"about_ca_topic_score_codex":0.0054807873,"about_ca_topic_score_gemma":0.0034987174,"teacher_disagreement_score":0.024457822,"about_ca_system_score_codex":0.0034077049,"about_ca_system_score_gemma":0.0034524882,"threshold_uncertainty_score":0.1293469},"labels":[],"label_agreement":null},{"id":"W2137666822","doi":"10.1109/wd.2012.6402827","title":"Improving routing in networks of UAVs via scoped flooding and mobility prediction","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Zone Routing Protocol; Routing protocol; Optimized Link State Routing Protocol; Wireless Routing Protocol; Network packet; Flooding (psychology); Wireless ad hoc network; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Wireless; Telecommunications","score_opus":0.010006107234149332,"score_gpt":0.21870432927899017,"score_spread":0.20869822204484084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137666822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17162623,0.0029041695,0.821021,0.00044920298,0.00007506814,0.0001070421,0.000064587126,0.00091713393,0.002835529],"genre_scores_gemma":[0.8516547,0.0021898076,0.14521615,0.000062649735,0.000069250185,0.00007467528,0.00009818632,0.000023179962,0.00061142864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998084,0.000060461956,0.00001272302,0.000031111336,0.00006946185,0.000017821323],"domain_scores_gemma":[0.9996069,0.0001975808,0.00008716729,0.000041884832,0.000047833615,0.000018751736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042180362,0.0005017388,0.00038886824,0.00067970395,0.00037219992,0.00023035359,0.0005344182,0.0003654595,0.00019492758],"category_scores_gemma":[0.001652539,0.00022152472,0.0002700414,0.0005633426,0.00037453452,0.0012032734,0.00091340096,0.00023074793,0.000068965004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007809296,0.000049944665,0.0027878024,0.00019289064,0.000055772634,0.00036343382,0.00026124745,0.7652105,0.058088724,0.008076246,0.0016209532,0.1632144],"study_design_scores_gemma":[0.000014545424,0.00012823389,0.00084981386,0.000013760631,0.00003269557,0.00016453565,0.000057881294,0.98848265,0.0049750023,0.00333419,0.0019322564,0.0000143651105],"about_ca_topic_score_codex":0.0016261317,"about_ca_topic_score_gemma":0.0015731503,"teacher_disagreement_score":0.0016261317,"about_ca_system_score_codex":0.00021009713,"about_ca_system_score_gemma":0.00027591604,"threshold_uncertainty_score":0.0032333136},"labels":[],"label_agreement":null},{"id":"W2137740059","doi":"10.1109/ccece.2009.5090203","title":"A comprehensive simulation study of SWAN QoS model in MANETs with proactive and reactive routing","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Quality of service; Mobile ad hoc network; Throughput; Routing (electronic design automation); Adaptive quality of service multi-hop routing; Routing protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Wireless; Telecommunications","score_opus":0.023852542511615425,"score_gpt":0.27010304462746904,"score_spread":0.24625050211585361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137740059","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81123596,0.0006651606,0.16766806,0.00055093423,0.000116202835,0.00015427002,0.00041597625,0.00033357806,0.018859802],"genre_scores_gemma":[0.9840709,0.00039643756,0.013111443,0.0000660085,0.000017348788,0.00007074395,0.00016187057,0.000027249522,0.0020779925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970204,0.00012633836,0.000011297159,0.000032486343,0.000086936234,0.000040879346],"domain_scores_gemma":[0.99918264,0.0005407663,0.000072061746,0.000065380664,0.000103797116,0.000035422756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007093046,0.0004575889,0.0004867465,0.00040547716,0.00048497066,0.00046577418,0.00053387857,0.0005684253,0.0007679822],"category_scores_gemma":[0.00185967,0.00018536177,0.00035718252,0.0005027484,0.00036110036,0.0009071261,0.0003597478,0.00048694978,0.00011189097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022775575,0.000031019004,0.0007740495,0.000019102856,0.000011395615,0.000047132897,0.000023597271,0.99363494,0.0008921838,0.0025303408,0.0001538018,0.0018595896],"study_design_scores_gemma":[0.000003619486,0.000037489703,0.00016770838,0.0000025514787,0.000004701852,0.000020096992,0.000019414636,0.99842596,0.0003493433,0.000668513,0.00029689298,0.0000035987862],"about_ca_topic_score_codex":0.005818117,"about_ca_topic_score_gemma":0.0048100585,"teacher_disagreement_score":0.005818117,"about_ca_system_score_codex":0.0007127917,"about_ca_system_score_gemma":0.0005360372,"threshold_uncertainty_score":0.011568546},"labels":[],"label_agreement":null},{"id":"W2137943599","doi":"10.1109/cse.2009.436","title":"Choosing Service Directory Nodes in Proposed Service Discovery Model for Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Directory; Computer network; Service discovery; Mobile ad hoc network; Wireless ad hoc network; Directory service; Service (business); Node (physics); Distributed computing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Mobile computing; Optimized Link State Routing Protocol; World Wide Web; Routing protocol; Routing (electronic design automation); Web service; Telecommunications; Engineering; Operating system; Wireless","score_opus":0.017508847131251306,"score_gpt":0.25435428956608497,"score_spread":0.23684544243483366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137943599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047209244,0.00054788234,0.944249,0.0008557441,0.00010384934,0.00010421961,0.00011455873,0.000244333,0.0065712],"genre_scores_gemma":[0.78409183,0.00096284144,0.20438287,0.00021027791,0.00011812892,0.00033525814,0.00019664539,0.000074499,0.00962769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998502,0.00058650295,0.000064546,0.00021332332,0.00046197211,0.00017167233],"domain_scores_gemma":[0.9986349,0.00067105895,0.00013166624,0.00015195098,0.00031331883,0.00009714406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017933924,0.00049120723,0.000703506,0.000804989,0.0012367913,0.002202325,0.0017591799,0.0016127549,0.0015109256],"category_scores_gemma":[0.0044696867,0.00036071418,0.000605918,0.0015773614,0.0011216411,0.0034202912,0.0010077371,0.00095490273,0.00056408544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002497906,0.00008437705,0.0013444778,0.00018356304,0.000037763402,0.000333564,0.00049550633,0.60044944,0.0060786367,0.34468737,0.00295177,0.043103695],"study_design_scores_gemma":[0.000023831648,0.000059350605,0.00009019326,0.000012953645,0.000020398797,0.00017015485,0.000072049676,0.95976555,0.0009845793,0.035570215,0.0032091874,0.00002162649],"about_ca_topic_score_codex":0.0031265246,"about_ca_topic_score_gemma":0.004547612,"teacher_disagreement_score":0.0031265246,"about_ca_system_score_codex":0.0019486488,"about_ca_system_score_gemma":0.0021634714,"threshold_uncertainty_score":0.01413852},"labels":[],"label_agreement":null},{"id":"W2138159678","doi":"10.1109/ccece.2003.1226060","title":"A framework to use SIP in ad-hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Ad hoc wireless distribution service; Session Initiation Protocol; Vehicular ad hoc network; Scalability; Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Distributed computing; Wireless network; Routing protocol; Wireless; Network packet; Telecommunications; Server","score_opus":0.017735424088650385,"score_gpt":0.2532069419500594,"score_spread":0.235471517861409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138159678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00088288024,0.00079628156,0.98671144,0.0006240657,0.00026780288,0.0002867863,0.000054148328,0.0016379232,0.008738714],"genre_scores_gemma":[0.041572552,0.0019059943,0.94447696,0.00050009246,0.0005376724,0.0012829108,0.00023577706,0.0004354536,0.009052678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955382,0.0018101727,0.00045422945,0.00043957654,0.0014712741,0.00028661225],"domain_scores_gemma":[0.9982963,0.00066301605,0.000096937816,0.00033292692,0.00028925994,0.00032147733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006639065,0.0015787279,0.0011343376,0.0017168346,0.0028651077,0.005749423,0.00481548,0.00376499,0.0043355674],"category_scores_gemma":[0.0040561445,0.0015283339,0.002221417,0.0014220427,0.004274574,0.006208034,0.0053636064,0.0050990684,0.0030141082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003928795,0.00006598835,0.00016655766,0.00024747697,0.00004322499,0.00077606237,0.00092608534,0.016461996,0.002632842,0.9323796,0.006753043,0.039507747],"study_design_scores_gemma":[0.00008601607,0.00017219012,0.00013520593,0.00035202608,0.00008312019,0.0011524798,0.00023792237,0.15671933,0.0037854926,0.40025502,0.43687218,0.00014906291],"about_ca_topic_score_codex":0.001801166,"about_ca_topic_score_gemma":0.0018407231,"teacher_disagreement_score":0.006639065,"about_ca_system_score_codex":0.0013102682,"about_ca_system_score_gemma":0.0021374403,"threshold_uncertainty_score":0.03511113},"labels":[],"label_agreement":null},{"id":"W2138800748","doi":"10.1109/glocom.2007.918","title":"Optimal Design of Broadband Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Network planning and design; Wireless network; Key (lock); Channel (broadcasting); Wireless; Broadband; Software deployment; Network topology; Wireless broadband; Broadband networks; Interference (communication); Transmission (telecommunications); Topology (electrical circuits); Distributed computing; Telecommunications; Engineering; Electrical engineering; Computer security","score_opus":0.016012920976271806,"score_gpt":0.23904978041296882,"score_spread":0.22303685943669702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138800748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01985705,0.0006352587,0.9687195,0.00032857142,0.000044563614,0.00006758985,0.00011385623,0.0001289689,0.010104684],"genre_scores_gemma":[0.7730087,0.0015887183,0.21925965,0.00015218648,0.00008040348,0.00029806767,0.0002420011,0.00008586834,0.0052843764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993955,0.0003064555,0.000018086694,0.00007736867,0.00010931697,0.00009318569],"domain_scores_gemma":[0.9995295,0.00025847534,0.000077291494,0.00003555875,0.00007116225,0.000028095801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008860315,0.0006866424,0.0006875317,0.0005151198,0.00027324245,0.0008933158,0.0006984447,0.0009734222,0.0022366832],"category_scores_gemma":[0.002492077,0.0005899421,0.00047589056,0.00045912468,0.00062020915,0.0008184072,0.0008669226,0.0004891691,0.00023879408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018902589,0.00001112546,0.00013519014,0.000056062956,0.000012777733,0.00002104475,0.000010613033,0.9711694,0.0006199602,0.01772074,0.00052220456,0.009701953],"study_design_scores_gemma":[0.0000080255495,0.000018696122,0.000052678213,0.000007537682,0.0000053270737,0.000008488822,0.000009752895,0.98589015,0.00016886876,0.012969091,0.0008586637,0.0000027272613],"about_ca_topic_score_codex":0.002118276,"about_ca_topic_score_gemma":0.0021738023,"teacher_disagreement_score":0.0022366832,"about_ca_system_score_codex":0.0011288868,"about_ca_system_score_gemma":0.0011857796,"threshold_uncertainty_score":0.008190632},"labels":[],"label_agreement":null},{"id":"W2138896442","doi":"10.1109/icc.2007.617","title":"Min-Max Congestion in Interference-Prone Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Interference (communication); Wireless mesh network; Software deployment; Bandwidth (computing); Wireless network; Distributed computing; Wireless; Telecommunications; Channel (broadcasting)","score_opus":0.0145876249193831,"score_gpt":0.2438256983030325,"score_spread":0.2292380733836494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138896442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06607346,0.0013012411,0.92491335,0.00069457095,0.00007535887,0.000106239706,0.00007587536,0.0001818004,0.0065780664],"genre_scores_gemma":[0.9151401,0.0009294293,0.08011697,0.00016625083,0.00012299647,0.00018303121,0.00006825348,0.000099797646,0.0031731706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988722,0.0007046898,0.000028031844,0.00009615994,0.0001403434,0.00015850057],"domain_scores_gemma":[0.99744844,0.0020986942,0.0001876651,0.00005893813,0.00012788181,0.00007846103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030762018,0.00073365786,0.0008600701,0.0005822032,0.00063474645,0.0012374187,0.0013261699,0.0008992943,0.0012427848],"category_scores_gemma":[0.006271795,0.00067677005,0.0005440128,0.0008817288,0.001555784,0.0018953445,0.0012294768,0.000959309,0.00010832925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008798713,0.000032977525,0.00031096928,0.000080616956,0.000020645193,0.0000772504,0.000072650495,0.96212983,0.00071832695,0.027844751,0.00066194,0.007962025],"study_design_scores_gemma":[0.000012123517,0.000032687105,0.000072986666,0.000006210467,0.0000062051504,0.000016654882,0.000021788308,0.9857277,0.00020843369,0.013591933,0.00029795337,0.0000052824344],"about_ca_topic_score_codex":0.003508323,"about_ca_topic_score_gemma":0.0027259714,"teacher_disagreement_score":0.003508323,"about_ca_system_score_codex":0.0014900473,"about_ca_system_score_gemma":0.00104005,"threshold_uncertainty_score":0.01626867},"labels":[],"label_agreement":null},{"id":"W2139096736","doi":"10.1109/infcom.2003.1208680","title":"Optimizing route-cache lifetime in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cache; Computer network; Dynamic Source Routing; DSRFLOW; Latency (audio); Distributed computing; Source routing; Routing (electronic design automation); Routing protocol; Telecommunications","score_opus":0.011549081020013651,"score_gpt":0.22501404537768346,"score_spread":0.21346496435766982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139096736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44167617,0.0071228365,0.5415512,0.00052454625,0.00008781988,0.00007328373,0.00011844942,0.0010079051,0.007837747],"genre_scores_gemma":[0.9598089,0.0009817804,0.037640173,0.000037737933,0.000026654729,0.00003328786,0.000085305466,0.000077386845,0.0013086584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.00019274549,0.000020920139,0.00004808125,0.00015415197,0.00006245558],"domain_scores_gemma":[0.99842393,0.0008664799,0.00021808848,0.00018778916,0.00024779094,0.000055933688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009678353,0.00056561007,0.00045655825,0.0006132404,0.00042559195,0.0007169382,0.00086772925,0.0005676673,0.00043778177],"category_scores_gemma":[0.00441174,0.0002777337,0.00015826967,0.0006056467,0.00034026016,0.001323306,0.0004160663,0.0002884557,0.00016283467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013925388,0.00008814484,0.0029014463,0.00014991125,0.00006921756,0.00010151942,0.000113548886,0.8497375,0.021455575,0.008891416,0.0011213309,0.115231186],"study_design_scores_gemma":[0.000019884006,0.00015878704,0.00069189415,0.000011550896,0.00003740167,0.00019580375,0.00006716193,0.97955644,0.009862627,0.006991709,0.0023921346,0.0000145980375],"about_ca_topic_score_codex":0.0016625876,"about_ca_topic_score_gemma":0.0025624437,"teacher_disagreement_score":0.0016625876,"about_ca_system_score_codex":0.0008168432,"about_ca_system_score_gemma":0.0005880035,"threshold_uncertainty_score":0.005926609},"labels":[],"label_agreement":null},{"id":"W2139129865","doi":"10.1109/iscc.2012.6249335","title":"LIAITHON: A location-aware multipath video streaming scheme for urban vehicular networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Multipath propagation; Computer network; Multipath routing; Node (physics); Quality of service; Vehicular ad hoc network; Scheme (mathematics); Wireless ad hoc network; Network topology; Video streaming; Distributed computing; Topology (electrical circuits); Routing (electronic design automation); Routing protocol; Telecommunications; Wireless; Dynamic Source Routing","score_opus":0.015267204015512476,"score_gpt":0.24507367752821038,"score_spread":0.2298064735126979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139129865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23892172,0.0027976676,0.74151087,0.0005090211,0.00031326283,0.00044848307,0.0002875942,0.0052984995,0.009912862],"genre_scores_gemma":[0.8819605,0.0006565415,0.11205898,0.00013704655,0.000074099706,0.00009779202,0.0002815536,0.000056957648,0.0046764635],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998317,0.00003496829,0.000008127406,0.000031940814,0.00005213073,0.000041238643],"domain_scores_gemma":[0.9997073,0.000057952817,0.000043024924,0.00004788164,0.00008950349,0.000054314372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024191133,0.00055559084,0.0005381797,0.00062569336,0.0005872902,0.0003871931,0.0010120528,0.00041755356,0.000942207],"category_scores_gemma":[0.00062169763,0.000120809425,0.0002194703,0.0004899694,0.00029270147,0.0009481564,0.0010824425,0.00057364727,0.00024848775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010359985,0.0002401832,0.0017898239,0.00026832958,0.00012272189,0.00089732744,0.00036068837,0.053652715,0.20931788,0.009968071,0.0056241774,0.7167221],"study_design_scores_gemma":[0.00030674489,0.0023374143,0.0026324752,0.00006714998,0.00018721867,0.0024687378,0.00051400805,0.8140367,0.13342285,0.007893515,0.035928097,0.00020507978],"about_ca_topic_score_codex":0.001877284,"about_ca_topic_score_gemma":0.0025402615,"teacher_disagreement_score":0.001877284,"about_ca_system_score_codex":0.0005657209,"about_ca_system_score_gemma":0.0005155288,"threshold_uncertainty_score":0.0041046143},"labels":[],"label_agreement":null},{"id":"W2139317467","doi":"10.1109/aina.2007.147","title":"A Distributed Correlative Power Control Scheme for Mobile Ad hoc Networks using Prediction Filters","year":2007,"lang":"en","type":"article","venue":"Proceedings","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Throughput; Computer network; Handshaking; Network packet; Power control; Kalman filter; Interference (communication); Real-time computing; Channel (broadcasting); Power (physics); Wireless; Telecommunications","score_opus":0.011304178147090565,"score_gpt":0.24377286608621873,"score_spread":0.23246868793912817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139317467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014896447,0.00023398339,0.983432,0.00005722112,0.000061348095,0.000027597851,0.000010827281,0.00050511304,0.0007754568],"genre_scores_gemma":[0.85652065,0.00024886322,0.14002116,0.00008780975,0.00011333674,0.000104344304,0.000048914615,0.000022842625,0.0028320842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997156,0.00005264549,0.000017262457,0.000080184574,0.000104643754,0.00002960174],"domain_scores_gemma":[0.9994529,0.00020836364,0.00006202725,0.00007534113,0.00017913911,0.00002217703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068116526,0.0004599329,0.00043627285,0.0002994824,0.0004617346,0.00036806223,0.0009365452,0.00041611807,0.0007899337],"category_scores_gemma":[0.0011832792,0.00015672795,0.00020991612,0.00036607462,0.0003587626,0.0005958442,0.000326993,0.0006253056,0.00019476243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000400448,0.00025255012,0.001267893,0.00012222087,0.00007740528,0.00022647419,0.00018494828,0.2987028,0.06535509,0.018074265,0.0027163662,0.6126195],"study_design_scores_gemma":[0.000048844453,0.00024340495,0.00040235967,0.000008677989,0.000027243572,0.00011670548,0.000010939521,0.98504466,0.009862694,0.0023987049,0.0018172112,0.000018509108],"about_ca_topic_score_codex":0.002724883,"about_ca_topic_score_gemma":0.0035282215,"teacher_disagreement_score":0.002724883,"about_ca_system_score_codex":0.0004084409,"about_ca_system_score_gemma":0.00056411664,"threshold_uncertainty_score":0.005418062},"labels":[],"label_agreement":null},{"id":"W2139611568","doi":"10.1109/glocom.2010.5684294","title":"Load-Aware Channel Assignment Exploiting Partially Overlapping Channels for Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Channel (broadcasting); Channel allocation schemes; Scheme (mathematics); Distributed computing; Node (physics); Mesh networking; Wireless; Wireless network; Engineering; Telecommunications","score_opus":0.02113756819700702,"score_gpt":0.24488685095536786,"score_spread":0.22374928275836084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139611568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07942547,0.0005778433,0.9175006,0.00014682043,0.000070658774,0.00005609996,0.000028994431,0.0004221472,0.0017713988],"genre_scores_gemma":[0.86619353,0.00033717544,0.13211998,0.00006085214,0.000112030044,0.00008076151,0.000058801324,0.000044413642,0.0009924655],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995258,0.00017877006,0.000019542334,0.000066091634,0.00012298068,0.00008688137],"domain_scores_gemma":[0.99914753,0.00038971842,0.00011893151,0.00017825882,0.00010711233,0.000058426107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040593004,0.00045627958,0.000424481,0.0005061308,0.0007492543,0.00042418996,0.00072439073,0.000252243,0.000633985],"category_scores_gemma":[0.0016774391,0.00020261858,0.00018155307,0.00068340043,0.00051225396,0.0015473032,0.0011395437,0.00047243427,0.00012229558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005355849,0.00021324209,0.0032045273,0.00019920201,0.00009420264,0.00022550061,0.00038032228,0.4551322,0.055931874,0.021709386,0.0024899296,0.45988405],"study_design_scores_gemma":[0.000042437343,0.00016975148,0.00074449927,0.0000108611885,0.000038149035,0.00016149413,0.00010928959,0.9657071,0.014633214,0.013666569,0.0046800147,0.000036541158],"about_ca_topic_score_codex":0.00081722694,"about_ca_topic_score_gemma":0.001205573,"teacher_disagreement_score":0.00081722694,"about_ca_system_score_codex":0.00026837894,"about_ca_system_score_gemma":0.0004857155,"threshold_uncertainty_score":0.00214684},"labels":[],"label_agreement":null},{"id":"W2139648588","doi":"10.1109/ccece.2005.1556957","title":"On the effect of traffic model to the performance evaluation of multicast protocols in Manet","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multicast; Computer network; Computer science; Mobile ad hoc network; Geocast; Protocol Independent Multicast; Xcast; IP multicast; Distributed computing; Pragmatic General Multicast; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Routing (electronic design automation); Wireless","score_opus":0.02591970023915485,"score_gpt":0.2959984273797871,"score_spread":0.27007872714063225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139648588","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8244985,0.0081282025,0.15108638,0.0013195584,0.0004700801,0.00033537985,0.00042123848,0.00096847385,0.0127722295],"genre_scores_gemma":[0.98716277,0.0014653578,0.010192423,0.000120517674,0.000077648234,0.000061290346,0.00019780426,0.00009304202,0.00062909565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911612,0.005587268,0.00039093677,0.00039687144,0.0020252569,0.00043829525],"domain_scores_gemma":[0.9091041,0.07922983,0.002795729,0.0027499322,0.0056028785,0.0005174736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008436153,0.0009890953,0.0011039969,0.002103568,0.000799749,0.0017560173,0.0009728085,0.0013825044,0.0008515575],"category_scores_gemma":[0.050193958,0.0003079864,0.0005423137,0.001999454,0.00076517375,0.0025445435,0.0008090995,0.0009198946,0.00026512615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003084394,0.0009860775,0.026344445,0.0006126818,0.0003140121,0.0006626347,0.00025490054,0.83912647,0.021950083,0.009123836,0.0022073262,0.095333174],"study_design_scores_gemma":[0.000036388967,0.0015993268,0.004304651,0.000069396825,0.00012152245,0.0004626616,0.00015839316,0.97263145,0.016613305,0.0032414289,0.00069580897,0.00006566118],"about_ca_topic_score_codex":0.0019167236,"about_ca_topic_score_gemma":0.0013442469,"teacher_disagreement_score":0.008436153,"about_ca_system_score_codex":0.0014925906,"about_ca_system_score_gemma":0.00059155584,"threshold_uncertainty_score":0.04461521},"labels":[],"label_agreement":null},{"id":"W2140233554","doi":"10.1109/glocom.2010.5684282","title":"High-Performance Multicast Routing in Multi-Channel Multi-Radio Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Multicast; Distributed computing; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Steiner tree problem; Xcast; Routing (electronic design automation); Routing protocol; Wireless network; Wireless; Mathematics; Telecommunications; Mathematical optimization","score_opus":0.01776492422085461,"score_gpt":0.23972757094117472,"score_spread":0.22196264672032012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140233554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12856835,0.0022912542,0.8637663,0.00040259134,0.00014395299,0.00007590443,0.00008438278,0.0010743896,0.003592889],"genre_scores_gemma":[0.82053053,0.00066502177,0.17676948,0.000066197215,0.00013697441,0.00008417489,0.00015302897,0.000050185,0.0015443821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995413,0.00021324579,0.000018830984,0.000041471387,0.00012298857,0.000062236875],"domain_scores_gemma":[0.9994752,0.00029260726,0.000048975326,0.00006129826,0.000096958946,0.00002501842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090658694,0.00028277317,0.00041806814,0.00060154486,0.0006951371,0.0005172557,0.000752342,0.0006177441,0.0008522414],"category_scores_gemma":[0.0011442363,0.00017240644,0.00022705203,0.0006173951,0.0002826823,0.0009685465,0.00061924674,0.00035365144,0.00018944933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005808818,0.00020369206,0.0037951267,0.00052230846,0.00013183172,0.00070051407,0.00025946018,0.46731532,0.06847649,0.030088387,0.0089944955,0.41893145],"study_design_scores_gemma":[0.000027612105,0.00023532193,0.00084912847,0.000017355762,0.000028416322,0.00022342177,0.000064489526,0.97113377,0.011001511,0.0116055915,0.004796693,0.000016624692],"about_ca_topic_score_codex":0.0005897558,"about_ca_topic_score_gemma":0.0007433284,"teacher_disagreement_score":0.00090658694,"about_ca_system_score_codex":0.00036173692,"about_ca_system_score_gemma":0.00020049234,"threshold_uncertainty_score":0.004794538},"labels":[],"label_agreement":null},{"id":"W2140826297","doi":"10.1109/wocn.2005.1436049","title":"Using mobile agents for intrusion detection in wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Queen's University","funders":"","keywords":"Intrusion detection system; Computer science; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Wireless; Ad hoc wireless distribution service; Computer security; Computer network; Mobile computing; Wireless network; Mobile agent; Intrusion prevention system; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.02392711053665377,"score_gpt":0.27601594071318347,"score_spread":0.2520888301765297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140826297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056238253,0.008887107,0.92799836,0.00072772754,0.00020998156,0.00018044956,0.000021527429,0.00081315404,0.0049232766],"genre_scores_gemma":[0.6229228,0.0056950143,0.36754695,0.00023975178,0.00027018687,0.00020028876,0.000051735118,0.000058550653,0.0030147403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984401,0.0007775773,0.00009384593,0.00014064665,0.0004903159,0.000057604793],"domain_scores_gemma":[0.99778545,0.0013810798,0.0002847111,0.0002468751,0.00025928856,0.000042477066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012148266,0.00070821954,0.000562608,0.0010438885,0.0005042105,0.0012641931,0.00066260586,0.0009126411,0.00053495617],"category_scores_gemma":[0.004231029,0.00033722437,0.00031756933,0.0007739939,0.0010363454,0.0021926651,0.0006514231,0.000743469,0.0002278088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000430338,0.00023374836,0.010153295,0.0007953187,0.00038464234,0.0008450862,0.0011946324,0.18458572,0.062398158,0.12512289,0.003629812,0.6102264],"study_design_scores_gemma":[0.00005983476,0.0006486704,0.0017562766,0.00014504456,0.00019641189,0.0015074884,0.00025541784,0.86039394,0.029785696,0.056763723,0.048416417,0.000071032155],"about_ca_topic_score_codex":0.00031856395,"about_ca_topic_score_gemma":0.0005094616,"teacher_disagreement_score":0.0012641931,"about_ca_system_score_codex":0.00036076366,"about_ca_system_score_gemma":0.00030281083,"threshold_uncertainty_score":0.006424725},"labels":[],"label_agreement":null},{"id":"W2140969507","doi":"10.1109/lcn.2008.4664309","title":"Key revocation based on Dirichlet multinomial model for mobile ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Revocation; Computer science; Computer network; Wireless ad hoc network; Key (lock); Node (physics); Revocation list; Mobile ad hoc network; Computer security; Scheme (mathematics); Vehicular ad hoc network; Public-key cryptography; Cryptography; Public key infrastructure; Encryption; Wireless; Overhead (engineering); Telecommunications; Mathematics","score_opus":0.024197731454531204,"score_gpt":0.2474613097411472,"score_spread":0.22326357828661597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140969507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07528405,0.00054786087,0.9207776,0.00084722065,0.00012822362,0.00012001724,0.00011327591,0.0002670379,0.0019147076],"genre_scores_gemma":[0.9488108,0.00056568364,0.045238264,0.00019026651,0.0001431469,0.00020003795,0.00017124828,0.00006234343,0.004618202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575645,0.0022025395,0.00016247998,0.00065547315,0.00076245813,0.00046055773],"domain_scores_gemma":[0.9857658,0.009940501,0.0016052207,0.0014382733,0.00087207946,0.00037816848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059345565,0.00070622656,0.0021460995,0.0012266606,0.0015007512,0.0016962319,0.0030475291,0.0018462788,0.0019750174],"category_scores_gemma":[0.01911724,0.0007487116,0.0013452345,0.0012401207,0.0029126713,0.004868133,0.0023800058,0.002247457,0.0006263565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033842595,0.00007373157,0.0024674546,0.00011534861,0.00010213777,0.00029750785,0.00046311307,0.8061853,0.001936465,0.16806717,0.0015942536,0.01835903],"study_design_scores_gemma":[0.00001606755,0.000022558575,0.00011311323,0.0000051188044,0.000009106764,0.000053887885,0.000024095396,0.97189057,0.00019271216,0.027293062,0.00036273123,0.000016983246],"about_ca_topic_score_codex":0.0038796123,"about_ca_topic_score_gemma":0.0030718998,"teacher_disagreement_score":0.0059345565,"about_ca_system_score_codex":0.0022168949,"about_ca_system_score_gemma":0.0011331777,"threshold_uncertainty_score":0.031385303},"labels":[],"label_agreement":null},{"id":"W2141069652","doi":"10.1109/glocom.2010.5683522","title":"Maximum Lifetime Broadcast and Multicast Routing in Unreliable Wireless Ad-Hoc Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Computer network; Broadcast radiation; Wireless ad hoc network; Distributed computing; Heuristic; Tree (set theory); Multimedia Broadcast Multicast Service; Network packet; Protocol Independent Multicast; Maximization; Wireless; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.006705346717865457,"score_gpt":0.2208917255347404,"score_spread":0.21418637881687494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141069652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023521965,0.0050792866,0.9681484,0.00028248885,0.000072690964,0.000040401475,0.00004989535,0.00017284804,0.0026320638],"genre_scores_gemma":[0.717392,0.007246476,0.2714059,0.0001193628,0.00035292612,0.0002565957,0.00014303115,0.00009549543,0.0029881254],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992656,0.00033736517,0.000027735476,0.000067754,0.00023779212,0.000063728265],"domain_scores_gemma":[0.99885523,0.0007235199,0.00018167868,0.00007426033,0.00013170157,0.00003356176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012003845,0.00054339453,0.00066719146,0.0006959577,0.00080041186,0.0007157343,0.00080846215,0.00075251836,0.00047325075],"category_scores_gemma":[0.0033578852,0.00033710172,0.00033018796,0.0013936324,0.00052966876,0.0015993022,0.0006703256,0.0005430899,0.00014419317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019368525,0.000049164933,0.0010586121,0.0005891654,0.00007141766,0.00034377477,0.00029640493,0.6911411,0.009109716,0.07673748,0.0040583573,0.21635117],"study_design_scores_gemma":[0.000020078958,0.00009358029,0.00031055082,0.00003297482,0.0000391926,0.00017966927,0.00006696057,0.94452435,0.002652386,0.04679768,0.005264494,0.000018112514],"about_ca_topic_score_codex":0.00078882003,"about_ca_topic_score_gemma":0.00096852897,"teacher_disagreement_score":0.0012003845,"about_ca_system_score_codex":0.00053052447,"about_ca_system_score_gemma":0.00047075082,"threshold_uncertainty_score":0.0063482523},"labels":[],"label_agreement":null},{"id":"W2141101485","doi":"10.1109/icccn.2005.1523950","title":"Bounds on throughput capacity of MANETs","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Throughput; Computer science; Mobile ad hoc network; Computer network; Wireless; Telecommunications","score_opus":0.014225679815408343,"score_gpt":0.21734216930719236,"score_spread":0.203116489491784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141101485","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09911992,0.044382527,0.65243477,0.017845321,0.0021857566,0.00025150707,0.003076043,0.0027798135,0.17792434],"genre_scores_gemma":[0.92409265,0.02133821,0.028982785,0.0015806721,0.002806424,0.00073335896,0.0009003323,0.00079346227,0.018772159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950093,0.0012555587,0.0001564384,0.00051387306,0.0016234467,0.0014413741],"domain_scores_gemma":[0.94591916,0.044522595,0.0014945588,0.0031885046,0.0032760056,0.0015992004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065941685,0.0029509375,0.0032302237,0.005104746,0.0026030615,0.0064599877,0.004179143,0.0022123083,0.014111286],"category_scores_gemma":[0.041729297,0.0017433629,0.0010476629,0.005467361,0.004033047,0.010163175,0.0057069813,0.005821626,0.0024944937],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010627098,0.00016316763,0.0010018868,0.0011943835,0.00022646518,0.0003469138,0.0008187501,0.37641114,0.008457017,0.5280432,0.027499598,0.05477475],"study_design_scores_gemma":[0.000046109762,0.000120406454,0.00064572034,0.00043209546,0.00015853839,0.0002540679,0.0002507687,0.50205815,0.003693979,0.48057544,0.011680956,0.000083820785],"about_ca_topic_score_codex":0.0029559967,"about_ca_topic_score_gemma":0.0020801844,"teacher_disagreement_score":0.014111286,"about_ca_system_score_codex":0.0054455856,"about_ca_system_score_gemma":0.0018230207,"threshold_uncertainty_score":0.04720694},"labels":[],"label_agreement":null},{"id":"W2141119026","doi":"10.1145/1298239.1298255","title":"A novel solution based on mobile agent for anonymity in wireless and mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Wireless Routing Protocol; Vehicular ad hoc network; Adaptive quality of service multi-hop routing; Computer security; Routing protocol; Distributed computing; Network packet; Wireless; Telecommunications","score_opus":0.015005834468860979,"score_gpt":0.252129905193164,"score_spread":0.237124070724303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141119026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009196758,0.0010448748,0.9726733,0.0016251899,0.0006888356,0.00034220057,0.00004065306,0.0009649643,0.013423177],"genre_scores_gemma":[0.2881124,0.0011917265,0.68562263,0.0013615786,0.0005365598,0.00081304304,0.00012969934,0.00012814417,0.022104234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978459,0.00078806834,0.00014051897,0.00027992562,0.0007960115,0.00014955344],"domain_scores_gemma":[0.99861026,0.0004057214,0.000171447,0.00037377214,0.00033083474,0.000107946355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016013326,0.000533099,0.0005254759,0.0009104741,0.0022567636,0.0017844212,0.0018714543,0.0024222604,0.0018870689],"category_scores_gemma":[0.0028740554,0.0003075046,0.0008976426,0.0007800798,0.0014299122,0.004612783,0.0034194866,0.0021624402,0.0010084439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021390995,0.00021334235,0.0005620694,0.0004385273,0.00009977894,0.0007342423,0.0011263661,0.006418202,0.028188119,0.78291565,0.013071597,0.16601813],"study_design_scores_gemma":[0.00024439226,0.0010003907,0.00046251467,0.00019979557,0.00027908638,0.004008558,0.00059250224,0.22728433,0.055720456,0.23642053,0.47356382,0.00022368212],"about_ca_topic_score_codex":0.0002596868,"about_ca_topic_score_gemma":0.00040070218,"teacher_disagreement_score":0.0024222604,"about_ca_system_score_codex":0.00056866155,"about_ca_system_score_gemma":0.0014277393,"threshold_uncertainty_score":0.008468807},"labels":[],"label_agreement":null},{"id":"W2141435168","doi":"10.1109/tmc.2008.94","title":"Efficient Broadcasting in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Flooding (psychology); Communication source; Broadcasting (networking); Wireless ad hoc network; Computer network; Algorithm; Mobile ad hoc network; Node (physics); Hop (telecommunications); Distributed computing; Theoretical computer science; Wireless; Network packet; Telecommunications","score_opus":0.015949714305613472,"score_gpt":0.240187802158681,"score_spread":0.2242380878530675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141435168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013101959,0.0039611044,0.97703904,0.00040243458,0.00010847227,0.00011072652,0.000037345315,0.00061668543,0.004622173],"genre_scores_gemma":[0.43761557,0.008497455,0.54724884,0.0002110686,0.0005177061,0.00030001433,0.00022580352,0.00013714077,0.005246425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887174,0.00034632836,0.00007174718,0.00009839427,0.00054314954,0.00006865856],"domain_scores_gemma":[0.9986216,0.0007908437,0.0001435258,0.00018535327,0.00022738328,0.000031269392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012365163,0.00056609715,0.0008749594,0.0011209431,0.00064072054,0.00075853016,0.00093461614,0.00084460416,0.00069093413],"category_scores_gemma":[0.0039218976,0.00042864442,0.00040653607,0.0010443492,0.0006833008,0.001756539,0.00083173864,0.0005908335,0.00038450919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002418209,0.000108551576,0.0012180799,0.0010132608,0.00012903377,0.00031855342,0.0006077061,0.22150631,0.044791207,0.1881418,0.007533241,0.53439045],"study_design_scores_gemma":[0.00015657471,0.0003835695,0.000766438,0.00010185413,0.00014511346,0.0010176199,0.000118019394,0.816842,0.024719736,0.09941672,0.05624254,0.00008979932],"about_ca_topic_score_codex":0.00063233485,"about_ca_topic_score_gemma":0.000538072,"teacher_disagreement_score":0.0012365163,"about_ca_system_score_codex":0.00069718214,"about_ca_system_score_gemma":0.000673351,"threshold_uncertainty_score":0.0065394044},"labels":[],"label_agreement":null},{"id":"W2142435765","doi":"10.1109/ds-rt.2008.53","title":"Simulation-Based Performance Comparison of VANETs Backbone Formation Algorithms","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Connected dominating set; Mobile ad hoc network; Wireless ad hoc network; Algorithm; Heuristics; Overhead (engineering); Vehicular ad hoc network; Distributed computing; Computer network; Broadcasting (networking); Network topology; Cardinality (data modeling); Topology (electrical circuits); Minimum spanning tree; Wireless; Data mining; Telecommunications; Mathematics","score_opus":0.03600980016126568,"score_gpt":0.2759110897521699,"score_spread":0.2399012895909042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142435765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91070753,0.0018682145,0.06951113,0.00053287693,0.00020547821,0.00019875597,0.0006842853,0.0013136148,0.014978099],"genre_scores_gemma":[0.98627603,0.0003457757,0.012056863,0.000028909342,0.00000772659,0.00006500596,0.00051932706,0.000038232967,0.0006620586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821657,0.0007845464,0.00014723868,0.00015093891,0.00041926236,0.00028146763],"domain_scores_gemma":[0.9906867,0.0065937615,0.0004935632,0.0005463137,0.0014056473,0.0002740619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030408723,0.0008342643,0.00096373603,0.001656682,0.0006478093,0.0009373374,0.0009592637,0.0008882047,0.0010439478],"category_scores_gemma":[0.009141682,0.000251354,0.00040237416,0.0017160567,0.00046793028,0.00096192246,0.000757582,0.00048815974,0.00020640003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035498623,0.00010527868,0.0015549022,0.00005258719,0.000049039183,0.000017345434,0.00003557019,0.98267186,0.0010801083,0.001257921,0.0004639531,0.012356465],"study_design_scores_gemma":[0.000029640198,0.00020214912,0.00074167835,0.000008122336,0.000016564522,0.000022507886,0.00004168322,0.9961272,0.0020608692,0.0003972954,0.0003408439,0.000011467707],"about_ca_topic_score_codex":0.007352669,"about_ca_topic_score_gemma":0.004217196,"teacher_disagreement_score":0.007352669,"about_ca_system_score_codex":0.0017611026,"about_ca_system_score_gemma":0.0010724697,"threshold_uncertainty_score":0.01608181},"labels":[],"label_agreement":null},{"id":"W2142573375","doi":"10.1007/s11276-005-5265-z","title":"Fault-Tolerant and 3-Dimensional Distributed Topology Control Algorithms in Wireless Multi-hop Networks","year":2005,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Topology control; Topology (electrical circuits); Algorithm; Hop (telecommunications); Node (physics); Wireless network; Fault tolerance; Computer network; Network topology; Wireless; Distributed algorithm; Power control; Distributed computing; Power (physics); Key distribution in wireless sensor networks; Mathematics; Telecommunications","score_opus":0.009062143242365433,"score_gpt":0.233984949971443,"score_spread":0.22492280672907758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142573375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027508367,0.0010993114,0.96910065,0.00034839605,0.00012880818,0.0000365358,0.000030781488,0.00038916292,0.0013580834],"genre_scores_gemma":[0.8011959,0.00091928005,0.19438536,0.00020098175,0.00017083767,0.00023170194,0.00012516679,0.00009099766,0.002679739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850744,0.00061590946,0.00013446844,0.0001918296,0.0004338977,0.00011643556],"domain_scores_gemma":[0.994965,0.0032625087,0.00058420806,0.0004966178,0.00053412246,0.00015759883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027591728,0.00062699267,0.0012588653,0.0010432632,0.00090670394,0.0015707614,0.0020075678,0.0014284995,0.0013033269],"category_scores_gemma":[0.011190392,0.0005054874,0.00052237767,0.0014456166,0.0016101634,0.0034832805,0.0018833238,0.0011344688,0.00023382885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026912196,0.00006225361,0.000627492,0.00007383737,0.000038043072,0.00005187642,0.00023337099,0.8758921,0.0018149086,0.028959949,0.0013674756,0.090609506],"study_design_scores_gemma":[0.000021177273,0.000042778494,0.00014432924,0.000005047746,0.0000073139745,0.0000312595,0.000023727309,0.97791994,0.000673256,0.020606097,0.0005146583,0.000010448785],"about_ca_topic_score_codex":0.0020101422,"about_ca_topic_score_gemma":0.0014544721,"teacher_disagreement_score":0.0027591728,"about_ca_system_score_codex":0.0009878597,"about_ca_system_score_gemma":0.0005548825,"threshold_uncertainty_score":0.0145920515},"labels":[],"label_agreement":null},{"id":"W2142640113","doi":"10.1109/glocom.2008.ecp.951","title":"A Distributed Directional-to-Directional MAC Protocol for Asynchronous Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Wireless ad hoc network; Directional antenna; Computer network; Asynchronous communication; Network packet; Vehicular ad hoc network; Throughput; Ad hoc wireless distribution service; Distributed computing; Optimized Link State Routing Protocol; Mobile ad hoc network; Omnidirectional antenna; Routing protocol; Wireless; Antenna (radio); Telecommunications","score_opus":0.021831443227477737,"score_gpt":0.274158450148666,"score_spread":0.25232700692118826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142640113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035960483,0.00044148052,0.9904529,0.00022959201,0.00031671097,0.00033932016,0.000119027645,0.0012189576,0.0032860308],"genre_scores_gemma":[0.26566446,0.0012574033,0.7190024,0.0007322222,0.0004460278,0.0022288559,0.0008075327,0.00019254624,0.009668578],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990409,0.00028558145,0.00008649737,0.00012443512,0.00040998514,0.0000525749],"domain_scores_gemma":[0.9987153,0.0003462814,0.00013393375,0.00028163055,0.00042323215,0.0000996353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016490765,0.0006228948,0.0005276245,0.0006285587,0.00087883597,0.0009662203,0.0016414039,0.0007097134,0.0021117327],"category_scores_gemma":[0.003243445,0.00024570612,0.00041531498,0.0007306604,0.00057617994,0.0010443054,0.0011394232,0.0010550718,0.00081387564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058801594,0.0004612387,0.0014045563,0.0009113763,0.00019705432,0.00072214124,0.00048225233,0.1070283,0.0967947,0.25096956,0.045796636,0.49464422],"study_design_scores_gemma":[0.00039844477,0.0008049173,0.00067618006,0.00006566747,0.00016995039,0.0011243769,0.000081407816,0.7604706,0.019763215,0.041102845,0.17522155,0.00012079144],"about_ca_topic_score_codex":0.0006799541,"about_ca_topic_score_gemma":0.0011731918,"teacher_disagreement_score":0.0021117327,"about_ca_system_score_codex":0.0005453941,"about_ca_system_score_gemma":0.0012436557,"threshold_uncertainty_score":0.008721292},"labels":[],"label_agreement":null},{"id":"W2142663125","doi":"10.1109/twc.2009.070536","title":"Severity analysis and countermeasure for the wormhole attack in wireless ad hoc networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wormhole; Computer science; Computer network; Wireless ad hoc network; Countermeasure; Node (physics); Mobile ad hoc network; Wireless network; Topology (electrical circuits); Timestamp; Wireless; Distributed computing; Network topology; Network packet; Telecommunications","score_opus":0.027187029852911652,"score_gpt":0.2795038504657331,"score_spread":0.25231682061282146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142663125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14432171,0.0015779393,0.84562975,0.00070003833,0.00017152888,0.0002946309,0.000073099225,0.00041426904,0.006817042],"genre_scores_gemma":[0.96886414,0.00049618963,0.029727269,0.0000737354,0.00009563251,0.00009088615,0.000048468268,0.000022555469,0.0005810169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975903,0.0008406478,0.00013793315,0.00014641199,0.0011165667,0.00016809668],"domain_scores_gemma":[0.9881665,0.0068503693,0.0021726189,0.00092463807,0.0016113843,0.00027451658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022651851,0.00083643536,0.0006562418,0.0027238673,0.00043481967,0.0007423897,0.00077012065,0.00081121165,0.0006926602],"category_scores_gemma":[0.014125528,0.00023224774,0.0007844888,0.00082023407,0.0008637983,0.002561347,0.0010400891,0.0008179686,0.00009526309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018897098,0.000113221635,0.0068596145,0.000306517,0.00017645724,0.00027223915,0.00013637445,0.79750174,0.018605795,0.10683094,0.001346245,0.06766199],"study_design_scores_gemma":[0.000015229119,0.00020646256,0.0016267919,0.000024791636,0.00006388169,0.00029290118,0.000041997646,0.9809662,0.003365538,0.0121914735,0.0011825146,0.000022177137],"about_ca_topic_score_codex":0.0004968484,"about_ca_topic_score_gemma":0.0003635452,"teacher_disagreement_score":0.0027238673,"about_ca_system_score_codex":0.00093107426,"about_ca_system_score_gemma":0.0005166538,"threshold_uncertainty_score":0.01197958},"labels":[],"label_agreement":null},{"id":"W2142938812","doi":"10.1109/milcom.2008.4753656","title":"Performance of a novel topology control scheme for future wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"New York Institute of Technology","funders":"","keywords":"Scheme (mathematics); Wireless mesh network; Computer science; Topology control; Network topology; Computer network; Throughput; Topology (electrical circuits); Control (management); Wireless; Distributed computing; Wireless network; Mesh networking; Telecommunications; Engineering; Key distribution in wireless sensor networks; Mathematics; Artificial intelligence","score_opus":0.012682509221606117,"score_gpt":0.22635076843857738,"score_spread":0.21366825921697125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142938812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44664848,0.0009457724,0.5461854,0.00038097872,0.00028487225,0.0001592352,0.0000772154,0.0007011643,0.0046169767],"genre_scores_gemma":[0.96650976,0.000095593285,0.032807514,0.000033791697,0.000028312024,0.00003621833,0.000045594807,0.000010088919,0.00043306203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993754,0.00015258079,0.00003921111,0.000093806535,0.00027182756,0.00006716594],"domain_scores_gemma":[0.99846965,0.0005954318,0.00025614866,0.0002745583,0.0003357148,0.00006857938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017755335,0.0003581912,0.00037474703,0.00043197974,0.00048791684,0.00041910878,0.00063770247,0.0006572088,0.0006459484],"category_scores_gemma":[0.003737428,0.000098078075,0.00017783718,0.0002950145,0.00051578926,0.0010951458,0.0005798383,0.000432488,0.00008258217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001887355,0.000475661,0.0037462784,0.0003041047,0.0001290894,0.00031118782,0.00028310798,0.4868944,0.16824606,0.030505186,0.0024736098,0.30474398],"study_design_scores_gemma":[0.000049887207,0.0004108052,0.0006809678,0.000007192055,0.00001752041,0.00015345209,0.000017482522,0.98631823,0.009375568,0.0019314595,0.0010181903,0.00001926554],"about_ca_topic_score_codex":0.00059051905,"about_ca_topic_score_gemma":0.00060621434,"teacher_disagreement_score":0.0017755335,"about_ca_system_score_codex":0.0006262957,"about_ca_system_score_gemma":0.00040357563,"threshold_uncertainty_score":0.009390056},"labels":[],"label_agreement":null},{"id":"W2143152997","doi":"10.5120/14007-2056","title":"Detecting and Preventing Attacks in MANET","year":2013,"lang":"en","type":"article","venue":"International Journal of Computer Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alzheimer Society Research Program","keywords":"Computer science; Computer security; Mobile ad hoc network","score_opus":0.008484139893329523,"score_gpt":0.2606578386803926,"score_spread":0.2521736987870631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143152997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1429188,0.001348315,0.84409213,0.00027598665,0.00012637663,0.000241559,0.00009798747,0.0030072767,0.007891523],"genre_scores_gemma":[0.89494497,0.0009821358,0.10146273,0.0000865882,0.00002859218,0.00009312105,0.00010246824,0.000046969606,0.0022524663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956626,0.00011751087,0.00002846281,0.000067925226,0.00017471521,0.000045078123],"domain_scores_gemma":[0.99922407,0.00033995972,0.00014642102,0.00008737805,0.00016437254,0.00003783291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004543824,0.00042729895,0.00061723683,0.0007752262,0.00033969665,0.0007775742,0.00069047435,0.00058938575,0.0005829853],"category_scores_gemma":[0.0018136615,0.00025669666,0.00028275052,0.00040889764,0.00034520333,0.0008221125,0.00059657637,0.00037561439,0.00040985705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005888413,0.0002470147,0.008579142,0.00056637794,0.00015313877,0.0011506722,0.0002856654,0.4676585,0.09470566,0.012784949,0.002913609,0.41036645],"study_design_scores_gemma":[0.000028079468,0.00041735373,0.0019635074,0.000042622843,0.00004875087,0.0007773831,0.000112819864,0.9496655,0.03729085,0.005166913,0.0044476655,0.00003851733],"about_ca_topic_score_codex":0.0010573937,"about_ca_topic_score_gemma":0.0007236721,"teacher_disagreement_score":0.0010573937,"about_ca_system_score_codex":0.0002466913,"about_ca_system_score_gemma":0.00033199982,"threshold_uncertainty_score":0.0024030209},"labels":[],"label_agreement":null},{"id":"W2143434759","doi":"10.1109/tnet.2014.2313627","title":"Bounding Interference in Wireless Ad Hoc Networks With Nodes in Random Position","year":2014,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Manitoba; University of Alberta","funders":"","keywords":"Wireless ad hoc network; Topology control; Topology (electrical circuits); Wireless network; Upper and lower bounds; Computer science; Approximation algorithm; Mathematics; Discrete mathematics; Combinatorics; Wireless; Key distribution in wireless sensor networks; Telecommunications","score_opus":0.012906072893361334,"score_gpt":0.22872477816238448,"score_spread":0.21581870526902314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143434759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028693656,0.0014539293,0.9650643,0.00056490157,0.000052770618,0.00006384186,0.000111429166,0.00038777164,0.0036073162],"genre_scores_gemma":[0.7864277,0.0023311537,0.20736685,0.00034603107,0.00030321418,0.00042961512,0.00030757158,0.0002719572,0.0022159268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99395615,0.002421485,0.00024845926,0.00095967104,0.0017512011,0.00066313444],"domain_scores_gemma":[0.96958435,0.025479116,0.0015763238,0.0019694637,0.0009315809,0.00045914692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004779575,0.0021864718,0.0022328352,0.0020327226,0.0015099957,0.0022495869,0.004358604,0.0017481046,0.0014167993],"category_scores_gemma":[0.03164098,0.0011242812,0.0011361641,0.0036443814,0.0033926794,0.0054152687,0.004267106,0.002493036,0.0005592816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024221983,0.00006911301,0.0015064318,0.00018154943,0.000086990745,0.00016235326,0.00028191748,0.8987394,0.002883643,0.06912838,0.0018728063,0.02484525],"study_design_scores_gemma":[0.000025264755,0.000070300186,0.00023557775,0.000021138401,0.00002427013,0.00010384295,0.000044529985,0.93241763,0.0013465345,0.06460776,0.0010898352,0.000013328262],"about_ca_topic_score_codex":0.0023530181,"about_ca_topic_score_gemma":0.0020615247,"teacher_disagreement_score":0.004779575,"about_ca_system_score_codex":0.0027906508,"about_ca_system_score_gemma":0.0011617407,"threshold_uncertainty_score":0.025277138},"labels":[],"label_agreement":null},{"id":"W2143516379","doi":"10.1109/glocom.2006.504","title":"WSN07-5: Performance of Directional MAC Protocols in Ad-Hoc Networks over Fading Channels","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fading; Computer network; Directional antenna; Throughput; Additive white Gaussian noise; Wireless ad hoc network; Omnidirectional antenna; Channel (broadcasting); Transmission (telecommunications); Mobile ad hoc network; Antenna (radio); Wireless; Telecommunications; Network packet","score_opus":0.010105763568384897,"score_gpt":0.24281592680255232,"score_spread":0.23271016323416743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143516379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93195873,0.0024724985,0.056295708,0.00023882199,0.00016025173,0.00010292296,0.00040641963,0.0011990374,0.0071656583],"genre_scores_gemma":[0.9880894,0.0004962825,0.010232558,0.000042737793,0.000016017351,0.000039382638,0.00041138535,0.00004574775,0.0006265706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983708,0.00056656724,0.00013485568,0.00011932636,0.00064414827,0.00016429172],"domain_scores_gemma":[0.99707186,0.0015907371,0.00027819106,0.0002793526,0.0006539364,0.00012593041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031661883,0.0008109628,0.0004695439,0.00082145986,0.00039367896,0.0006542619,0.00043339512,0.00048578583,0.0007496857],"category_scores_gemma":[0.006045894,0.00016423524,0.0002176187,0.0007954517,0.000458902,0.0006725781,0.00062365126,0.00033573018,0.00018819717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031890322,0.0006865467,0.028960275,0.00065903616,0.0003494268,0.0004010158,0.00036192255,0.73074096,0.063280806,0.006254332,0.0061750356,0.1589416],"study_design_scores_gemma":[0.00007172597,0.0027406784,0.009332246,0.000042971827,0.0000853398,0.0003848491,0.00015357927,0.94641286,0.036685538,0.0016363005,0.0024098256,0.000044041415],"about_ca_topic_score_codex":0.0016114165,"about_ca_topic_score_gemma":0.0014253808,"teacher_disagreement_score":0.0031661883,"about_ca_system_score_codex":0.0006220556,"about_ca_system_score_gemma":0.00052913086,"threshold_uncertainty_score":0.016744554},"labels":[],"label_agreement":null},{"id":"W2143548806","doi":"10.1109/lcomm.2011.092011.111200","title":"A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Static routing; Link-state routing protocol; Zone Routing Protocol; Distributed computing; Policy-based routing; Routing protocol; Multipath routing; Geographic routing; Routing (electronic design automation)","score_opus":0.1282827549936118,"score_gpt":0.2937703879894708,"score_spread":0.165487632995859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143548806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011047442,0.001136263,0.9829352,0.00024806493,0.00032073588,0.00019539981,0.00010350455,0.0012941988,0.0027191753],"genre_scores_gemma":[0.41840535,0.0016672959,0.5699899,0.0005558976,0.0003464373,0.00049087976,0.00052053685,0.00014620683,0.007877379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.00012055752,0.000055593155,0.000102029364,0.00034767733,0.00006369928],"domain_scores_gemma":[0.9990539,0.0002571545,0.000107703956,0.00023569776,0.00027475564,0.000070849936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010976394,0.0005822351,0.0008127728,0.0012634221,0.0010057014,0.00087259494,0.0021389776,0.0008194295,0.0009553314],"category_scores_gemma":[0.0017789637,0.00027123193,0.00053860515,0.0009421567,0.00062010955,0.0019658343,0.0017027905,0.0008848188,0.00040621433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051148573,0.00026838173,0.0008780713,0.0005294448,0.00017253443,0.0006488582,0.00064890436,0.061580338,0.1211317,0.09241116,0.013188334,0.70803076],"study_design_scores_gemma":[0.00020664353,0.0007727476,0.00061064056,0.000070455324,0.00020560954,0.001601317,0.0001319193,0.86311585,0.033780813,0.03599594,0.06330915,0.0001990606],"about_ca_topic_score_codex":0.0010641514,"about_ca_topic_score_gemma":0.0019967023,"teacher_disagreement_score":0.0021389776,"about_ca_system_score_codex":0.0005876732,"about_ca_system_score_gemma":0.0010741906,"threshold_uncertainty_score":0.0058048964},"labels":[],"label_agreement":null},{"id":"W2143713998","doi":"10.1109/icc.2009.5305933","title":"Performance Analysis of Trust-Based Node Evaluation Schemes in Wireless and Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Node (physics); Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Trustworthiness; Wireless; Wireless network; Process (computing); Wireless sensor network; Computer security; Distributed computing; Network packet; Telecommunications; Engineering","score_opus":0.011442661944610816,"score_gpt":0.2566619107869701,"score_spread":0.24521924884235927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143713998","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5252421,0.005022581,0.4590752,0.0007746175,0.00018802626,0.0004736492,0.00008898103,0.000518942,0.008615924],"genre_scores_gemma":[0.97877,0.000446537,0.019945199,0.00002614107,0.00002591568,0.000059112408,0.00003650663,0.000021363408,0.0006692678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9886497,0.0065797516,0.00043454306,0.00055024296,0.0030156078,0.00077012734],"domain_scores_gemma":[0.9525192,0.03443032,0.0033974126,0.0032493551,0.005523113,0.0008806408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017624976,0.0010024876,0.0012967582,0.0017682676,0.0010683358,0.0017419412,0.001696492,0.0010244376,0.000929434],"category_scores_gemma":[0.050700374,0.0003425861,0.00041823316,0.001571226,0.0015179544,0.0030198195,0.0015978903,0.0007104161,0.00020164646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024096023,0.00034841322,0.006569631,0.00028156172,0.00017437905,0.00018021066,0.00053994363,0.8252528,0.009959794,0.04414021,0.0016138759,0.10852962],"study_design_scores_gemma":[0.000030689567,0.00041507778,0.0004852714,0.000013204971,0.000035495053,0.00007915565,0.00005654923,0.9934493,0.0018793669,0.0032189854,0.00032034816,0.00001664764],"about_ca_topic_score_codex":0.0022103693,"about_ca_topic_score_gemma":0.0014100543,"teacher_disagreement_score":0.017624976,"about_ca_system_score_codex":0.003930364,"about_ca_system_score_gemma":0.0015358969,"threshold_uncertainty_score":0.093210876},"labels":[],"label_agreement":null},{"id":"W2144096129","doi":"10.1109/ccece.2006.277849","title":"Investigating Manet Performance in a VOIP Context","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Voice over IP; Computer network; Computer science; Mobile ad hoc network; Routing protocol; Mobile communications over IP; Node (physics); Optimized Link State Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Mobile telephony; Telecommunications; Routing (electronic design automation); Mobile radio; Wireless; Engineering; The Internet; Public land mobile network","score_opus":0.011262618131889062,"score_gpt":0.20556435470722442,"score_spread":0.19430173657533537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144096129","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799615,0.0008928569,0.010058358,0.00020151769,0.00006877709,0.000079458354,0.0002894351,0.00020280924,0.008245188],"genre_scores_gemma":[0.9959214,0.0005620835,0.0021671222,0.000037519898,0.000040070434,0.000029721357,0.0002073731,0.000024289904,0.0010104587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.00017364153,0.00003405699,0.00009016217,0.00019613217,0.00010999447],"domain_scores_gemma":[0.997326,0.0016386071,0.00023429617,0.00013597148,0.00053871906,0.00012631703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086487643,0.00045883024,0.0004127741,0.0010812305,0.00040023585,0.00076061406,0.00038941117,0.0007513618,0.00089274446],"category_scores_gemma":[0.004746781,0.00012139144,0.00014120896,0.0011359141,0.0002844881,0.0010577777,0.00037592978,0.00040628793,0.0003677762],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027427876,0.0013797614,0.20083266,0.00094802486,0.00046311718,0.0033410569,0.0018200583,0.534042,0.112223744,0.011177685,0.0036607294,0.1273684],"study_design_scores_gemma":[0.00006641164,0.0049859127,0.12968042,0.000103642386,0.00022366227,0.003390613,0.0025614128,0.78576374,0.061268825,0.004809316,0.007019995,0.00012607679],"about_ca_topic_score_codex":0.0015766601,"about_ca_topic_score_gemma":0.0011389056,"teacher_disagreement_score":0.0015766601,"about_ca_system_score_codex":0.00034968284,"about_ca_system_score_gemma":0.00016616516,"threshold_uncertainty_score":0.004573941},"labels":[],"label_agreement":null},{"id":"W2144222216","doi":"10.1109/pccc.2005.1460613","title":"Reliable multicast in wireless ad hoc and sensor networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Multicast; Reliable multicast; Ad hoc wireless distribution service; Geocast; Distributed computing; Vehicular ad hoc network; Optimized Link State Routing Protocol; Protocol Independent Multicast; IP multicast; Mobile ad hoc network; Wireless sensor network; Wireless; Telecommunications; Network packet","score_opus":0.009075986072368722,"score_gpt":0.22411586421575574,"score_spread":0.21503987814338701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144222216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034108683,0.03078437,0.9181283,0.0021899007,0.00073329476,0.00017010968,0.00006492535,0.0005448472,0.013275595],"genre_scores_gemma":[0.57671994,0.028530387,0.38418892,0.0006292131,0.002669378,0.00044016162,0.00016829063,0.00013715218,0.0065165833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729186,0.0012824292,0.0000972923,0.00014514023,0.0010472734,0.00013602414],"domain_scores_gemma":[0.997556,0.0016377452,0.00022275689,0.0001908607,0.0003361406,0.000056439625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003554574,0.0005993133,0.00064403197,0.0010032209,0.0007213809,0.0012176915,0.0010297402,0.0015631075,0.00092640467],"category_scores_gemma":[0.006752597,0.00038353924,0.00039196425,0.0017239371,0.001128137,0.0026558824,0.0008217382,0.00080094143,0.0003702858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016532121,0.0001188469,0.0030109442,0.0012212521,0.00011824691,0.0011693664,0.00072173605,0.28339323,0.008621619,0.42550957,0.011738595,0.26421136],"study_design_scores_gemma":[0.00006416762,0.00036615817,0.0010240534,0.0001815412,0.00008335741,0.0010585084,0.0002571859,0.68186337,0.0031766898,0.2532569,0.058616202,0.000051830746],"about_ca_topic_score_codex":0.0007575322,"about_ca_topic_score_gemma":0.0005130033,"teacher_disagreement_score":0.003554574,"about_ca_system_score_codex":0.0005897214,"about_ca_system_score_gemma":0.00055562844,"threshold_uncertainty_score":0.01879859},"labels":[],"label_agreement":null},{"id":"W2144228191","doi":"10.1109/icycs.2008.340","title":"Lightweight Integrated Authentication for Tactical MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Authentication (law); Mobile ad hoc network; Revocation; Wireless ad hoc network; Authentication protocol; Routing (electronic design automation); Computer security; Scheme (mathematics); Telecommunications; Wireless; Overhead (engineering); Operating system","score_opus":0.021596869482718366,"score_gpt":0.24716547382888768,"score_spread":0.22556860434616932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144228191","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02987335,0.0010826847,0.96037954,0.0002668377,0.00027553577,0.00022548188,0.00004663993,0.0029477864,0.0049021756],"genre_scores_gemma":[0.808558,0.0006703221,0.1829483,0.00017367535,0.00022524268,0.00025177532,0.00023441063,0.00011309001,0.006825097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842846,0.000453321,0.00016867087,0.00016097067,0.00057719165,0.00021143176],"domain_scores_gemma":[0.9965179,0.0005456987,0.0005665484,0.0016088164,0.00053601776,0.00022507645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015960899,0.00053057045,0.0006427581,0.00086673064,0.00086523127,0.001389299,0.0011241115,0.0010344273,0.0026916426],"category_scores_gemma":[0.003012197,0.00036972252,0.00046165206,0.0005403671,0.0008116114,0.0037718122,0.0036059513,0.0016815363,0.0016741675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002240301,0.00034741923,0.003235366,0.00071069424,0.00019595592,0.0012007392,0.0006841782,0.05670095,0.19264773,0.18938482,0.010426727,0.5422251],"study_design_scores_gemma":[0.0003208184,0.001740729,0.0020176908,0.00023158004,0.00023936543,0.0021651122,0.00029065844,0.71950305,0.10373723,0.08848383,0.08100181,0.00026821133],"about_ca_topic_score_codex":0.00023209631,"about_ca_topic_score_gemma":0.00026973544,"teacher_disagreement_score":0.0026916426,"about_ca_system_score_codex":0.0005171512,"about_ca_system_score_gemma":0.0006799301,"threshold_uncertainty_score":0.009004474},"labels":[],"label_agreement":null},{"id":"W2144431530","doi":"10.1109/icc.2012.6363645","title":"A token-based connectivity update scheme for unmanned aerial vehicle ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada; Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Wireless ad hoc network; Scheme (mathematics); Computer network; Security token; Vehicular ad hoc network; Distributed computing; Wireless; Telecommunications","score_opus":0.016326815810152735,"score_gpt":0.2473590977181907,"score_spread":0.23103228190803796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144431530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051435392,0.0004212116,0.94457406,0.00015430726,0.00012711975,0.00012590433,0.00006385336,0.0004900523,0.002608128],"genre_scores_gemma":[0.8548177,0.00028391898,0.1421323,0.000057554927,0.00006118761,0.00011679603,0.00009442028,0.00003091589,0.002405157],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995253,0.00011002329,0.00003632036,0.00007318486,0.00018186316,0.000073374045],"domain_scores_gemma":[0.9984674,0.0005030479,0.00027239896,0.00034353012,0.0003044222,0.00010908814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069477316,0.00027411708,0.00033783464,0.00061170047,0.0006395293,0.0005695997,0.0011536749,0.0003755111,0.0010147077],"category_scores_gemma":[0.003649368,0.00013506023,0.00018893846,0.0007064308,0.00064410875,0.0017092394,0.0007564386,0.000554398,0.00023260278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007991131,0.00020113979,0.0018156838,0.0002723253,0.00006134072,0.00047908322,0.00036636132,0.3736132,0.05654316,0.18186902,0.0059520584,0.37802753],"study_design_scores_gemma":[0.000058692218,0.0003546588,0.00032657434,0.000013755405,0.000030077164,0.0003221832,0.000038871032,0.9668337,0.011897723,0.01255888,0.0075211492,0.000043792406],"about_ca_topic_score_codex":0.0014499099,"about_ca_topic_score_gemma":0.0016324337,"teacher_disagreement_score":0.0014499099,"about_ca_system_score_codex":0.0009985818,"about_ca_system_score_gemma":0.00077115983,"threshold_uncertainty_score":0.007245302},"labels":[],"label_agreement":null},{"id":"W2144505916","doi":"10.1109/milcom.2007.4454856","title":"PPBR: Privacy-Aware Position-Based Routing in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Geographic routing; Wireless ad hoc network; Identifier; Node (physics); Routing protocol; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Overhead (engineering); Link-state routing protocol; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Routing (electronic design automation); Wireless; Engineering; Telecommunications","score_opus":0.008765204733949766,"score_gpt":0.24350446292226724,"score_spread":0.23473925818831748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144505916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011558858,0.0024461842,0.97728014,0.0008184678,0.00034398548,0.0002795308,0.00011445583,0.001964765,0.005193615],"genre_scores_gemma":[0.46270123,0.004804152,0.51830006,0.00061209284,0.000602989,0.00053135346,0.000737317,0.0002117594,0.011499007],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981408,0.00058272603,0.000095979434,0.0001958634,0.0008769714,0.00010766116],"domain_scores_gemma":[0.99880195,0.00033571865,0.00021039393,0.00038322102,0.00021222331,0.000056580226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015388619,0.0006946738,0.00072675274,0.0007963671,0.00092571904,0.0012454487,0.0017713399,0.0013070568,0.0016957879],"category_scores_gemma":[0.0030823306,0.00029028536,0.0004185215,0.0011941952,0.0008994036,0.0024092223,0.00162936,0.0010281286,0.0012010656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050807314,0.00027975955,0.0019533169,0.001295295,0.00020219064,0.0010751032,0.00045453387,0.12776245,0.06678238,0.14164051,0.021021955,0.63702446],"study_design_scores_gemma":[0.0002162868,0.0013873022,0.0014615805,0.00013530623,0.00017872298,0.0047083735,0.00023825515,0.75688434,0.04844872,0.07676499,0.10941764,0.00015855103],"about_ca_topic_score_codex":0.00051522494,"about_ca_topic_score_gemma":0.0005560383,"teacher_disagreement_score":0.0017713399,"about_ca_system_score_codex":0.00040812365,"about_ca_system_score_gemma":0.0008053918,"threshold_uncertainty_score":0.008138359},"labels":[],"label_agreement":null},{"id":"W2144713002","doi":"10.1109/glocom.2007.263","title":"A Reliable Low-Overhead MAC Protocol for Multi-Channel Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Network packet; Hidden node problem; Overhead (engineering); Multiple Access with Collision Avoidance for Wireless; Channel (broadcasting); Access control; Throughput; Mesh networking; Control channel; IEEE 802.11s; Media access control; Network allocation vector; Wireless; Wireless network; IEEE 802.11; Routing protocol; Base station; Wi-Fi array; Telecommunications; Optimized Link State Routing Protocol","score_opus":0.030799766126719183,"score_gpt":0.30393702056479144,"score_spread":0.27313725443807224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144713002","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035003058,0.0028138931,0.98696125,0.0003590212,0.00069681765,0.00042088333,0.00012399918,0.0019865192,0.0031372185],"genre_scores_gemma":[0.20987396,0.003974572,0.7683139,0.00095561164,0.001073076,0.0024125613,0.00091472,0.00050072523,0.01198081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839896,0.00035288537,0.00014317477,0.00013814031,0.000877512,0.00008932909],"domain_scores_gemma":[0.9983311,0.00042303588,0.00028872734,0.00033991144,0.00053360243,0.00008354391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305206,0.000812942,0.0007261238,0.001066259,0.0009915418,0.000854991,0.0027357345,0.0010295366,0.0027391764],"category_scores_gemma":[0.0037013714,0.00044923383,0.0006351319,0.0007530603,0.0006019412,0.0016808154,0.0013824451,0.0017468676,0.001597796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048947305,0.00025032353,0.0012262643,0.0023120055,0.00034324033,0.0011450688,0.0005199002,0.039539315,0.12698479,0.09358758,0.038241252,0.69536084],"study_design_scores_gemma":[0.00032678802,0.0013345628,0.0014779224,0.00029781103,0.00044342282,0.002744774,0.00015646838,0.44247907,0.0668462,0.035647605,0.44793692,0.00030844097],"about_ca_topic_score_codex":0.00045698823,"about_ca_topic_score_gemma":0.0006017081,"teacher_disagreement_score":0.0027391764,"about_ca_system_score_codex":0.0004976727,"about_ca_system_score_gemma":0.0006786282,"threshold_uncertainty_score":0.009163499},"labels":[],"label_agreement":null},{"id":"W2144729791","doi":"10.1109/csit.2013.6588764","title":"A novel communication system for firefighters using audio/video conferencing/sub-conferencing in standalone MANETs","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Videoconferencing; Computer network; Wireless; Multimedia; Communications system; Mobile radio; Teleconference; Architecture; Telecommunications","score_opus":0.03330601494662656,"score_gpt":0.24582937024338927,"score_spread":0.21252335529676272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144729791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14446339,0.000840786,0.8312154,0.0003185629,0.00036703784,0.000417487,0.000131225,0.005267368,0.016978804],"genre_scores_gemma":[0.7846196,0.00051287503,0.19612168,0.0002567259,0.00018083537,0.00026246408,0.00021820274,0.000060894996,0.017766759],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997285,0.00006983036,0.000017425837,0.00005597036,0.00008373765,0.000044444743],"domain_scores_gemma":[0.99984014,0.000023129207,0.000014256084,0.000025452517,0.00005746807,0.000039547813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024986517,0.0004098186,0.00038733616,0.0004777161,0.00062936824,0.0006151056,0.00080518157,0.00067090173,0.0025035823],"category_scores_gemma":[0.00022347005,0.00018276575,0.00030835863,0.0002761979,0.00020383703,0.0006854342,0.0005866035,0.00047791444,0.0011203277],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009381193,0.00035328785,0.0025151123,0.00042258025,0.00011577949,0.002181969,0.0005846816,0.020406732,0.6355997,0.016256662,0.010032396,0.31059307],"study_design_scores_gemma":[0.00022268572,0.004186362,0.007324253,0.00010875172,0.00042534966,0.008158407,0.0006726226,0.59460986,0.2633889,0.0045579206,0.11608897,0.00025600797],"about_ca_topic_score_codex":0.0008185558,"about_ca_topic_score_gemma":0.0009920968,"teacher_disagreement_score":0.0025035823,"about_ca_system_score_codex":0.00022953779,"about_ca_system_score_gemma":0.00030972046,"threshold_uncertainty_score":0.008375287},"labels":[],"label_agreement":null},{"id":"W2144746232","doi":"10.1109/ccece.2002.1012960","title":"AM-SRL: Adaptive Multicast operation of the Supernode-based Reverse Labeling algorithm","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Protocol Independent Multicast; Pragmatic General Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; Quality of service; Xcast; Algorithm","score_opus":0.016015053515498114,"score_gpt":0.22382699301777217,"score_spread":0.20781193950227406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144746232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02070421,0.0002560076,0.97169083,0.00021037515,0.00012460821,0.00010127011,0.000060710543,0.0018043186,0.005047745],"genre_scores_gemma":[0.23380901,0.00022657201,0.7614362,0.0002996693,0.000067577974,0.00017838588,0.00033452024,0.00021881821,0.0034292478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930966,0.00028332364,0.00004777349,0.000094473326,0.00019918801,0.00006555425],"domain_scores_gemma":[0.99895835,0.0002821419,0.000095259275,0.00030523664,0.0002989799,0.00006000294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012015221,0.0003488162,0.00046061294,0.00076707604,0.0006161861,0.000634647,0.0013348502,0.00060290494,0.0016867018],"category_scores_gemma":[0.0018921808,0.00018427466,0.00044073773,0.00058640953,0.00055934774,0.0012977016,0.0013111951,0.00086895126,0.0007918895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008135328,0.0001776397,0.003393671,0.00031404872,0.0000929143,0.0005115145,0.0004915311,0.09202381,0.07261745,0.094721355,0.009095161,0.7257474],"study_design_scores_gemma":[0.000121365905,0.00041913445,0.00059118826,0.0000411694,0.00005440589,0.0009820346,0.00011145492,0.89234304,0.03318344,0.020997081,0.051088445,0.000067255765],"about_ca_topic_score_codex":0.00080012204,"about_ca_topic_score_gemma":0.0010178724,"teacher_disagreement_score":0.0016867018,"about_ca_system_score_codex":0.0004134097,"about_ca_system_score_gemma":0.0007439353,"threshold_uncertainty_score":0.006354332},"labels":[],"label_agreement":null},{"id":"W2145384758","doi":"10.1109/icc.2006.255675","title":"On the Connectivity and Average Delay of Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Waypoint; Wireless ad hoc network; Mobility model; Computer science; Computer network; Mobile ad hoc network; Transmission delay; Transmission (telecommunications); Range (aeronautics); Delay-tolerant networking; Topology (electrical circuits); Optimized Link State Routing Protocol; Mathematics; Real-time computing; Wireless; Telecommunications; Network packet; Engineering; Combinatorics","score_opus":0.040007340002035874,"score_gpt":0.29120700291012813,"score_spread":0.25119966290809226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145384758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05870268,0.025577035,0.90043885,0.0020446654,0.00076033734,0.00007476098,0.00015362239,0.00027238103,0.011975711],"genre_scores_gemma":[0.8844822,0.03476236,0.07205259,0.00056937686,0.002049652,0.0003015954,0.00028482947,0.00021433133,0.0052830777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.00039667683,0.000065909124,0.00020763736,0.00049243093,0.00013359159],"domain_scores_gemma":[0.9843998,0.012715263,0.0010736104,0.00032036484,0.0012942175,0.00019676477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020754011,0.0014344,0.00094858103,0.001810174,0.0006086677,0.001544202,0.0013994911,0.0011595219,0.0016095527],"category_scores_gemma":[0.02382371,0.00044870639,0.0004921282,0.0027900338,0.0019907136,0.005006245,0.0009306321,0.0016012996,0.00039502594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014772815,0.000064999665,0.0017559663,0.00040011297,0.000082417086,0.00043611115,0.00033447656,0.74029213,0.0036481684,0.20582347,0.002539286,0.044475064],"study_design_scores_gemma":[0.000022289641,0.00013361814,0.0006850065,0.000102948776,0.00005093535,0.00042637397,0.000080931815,0.8537734,0.001148349,0.13653149,0.0070044496,0.00004030121],"about_ca_topic_score_codex":0.0018168681,"about_ca_topic_score_gemma":0.0009752087,"teacher_disagreement_score":0.0020754011,"about_ca_system_score_codex":0.0016644518,"about_ca_system_score_gemma":0.0006310236,"threshold_uncertainty_score":0.0120764375},"labels":[],"label_agreement":null},{"id":"W2145404055","doi":"10.1109/icc.2005.1494960","title":"Implementation of a kernel mode IPv6 AODV routing daemon to improve data throughput","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"British Columbia Institute of Technology","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Daemon; Ad hoc On-Demand Distance Vector Routing; Enhanced Interior Gateway Routing Protocol; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Routing protocol; Routing table; Zone Routing Protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.03127010471798527,"score_gpt":0.33872202872911716,"score_spread":0.3074519240111319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145404055","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46221128,0.00037465862,0.45820838,0.00036772786,0.00058724626,0.0013179672,0.00050641154,0.055334177,0.021092117],"genre_scores_gemma":[0.8289194,0.00012251742,0.1594892,0.00011216549,0.000029227069,0.00028932194,0.00063260796,0.00041860397,0.009986905],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999724,0.000028803468,0.000030148432,0.000059397753,0.00009412966,0.000063481435],"domain_scores_gemma":[0.99905604,0.00012389504,0.00004772685,0.00023083237,0.00046495185,0.00007657397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875514,0.00047138912,0.00033431078,0.0005859994,0.00029101304,0.00057258777,0.0009718609,0.0002791191,0.0028127707],"category_scores_gemma":[0.0012095055,0.00023170873,0.00016084891,0.00031783586,0.00015986069,0.0005925244,0.00039321216,0.0006546629,0.0012840617],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012323427,0.0018389164,0.013142312,0.00052965764,0.00012696475,0.00054334785,0.0005304768,0.02018791,0.46306828,0.009164118,0.017507214,0.47212854],"study_design_scores_gemma":[0.00027194218,0.0023186507,0.010401992,0.000030085812,0.00013244375,0.0007483504,0.00009989954,0.28809732,0.6397146,0.0015212356,0.056561027,0.000102474194],"about_ca_topic_score_codex":0.0008729014,"about_ca_topic_score_gemma":0.0008408365,"teacher_disagreement_score":0.0028127707,"about_ca_system_score_codex":0.00035179878,"about_ca_system_score_gemma":0.0006017978,"threshold_uncertainty_score":0.009409666},"labels":[],"label_agreement":null},{"id":"W2145414136","doi":"10.1109/ccece.2003.1226061","title":"A simulation framework for ad-hoc wireless networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Mobile ad hoc network; Protocol stack; Optimized Link State Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Vehicular ad hoc network; Network packet; Adaptive quality of service multi-hop routing; Routing protocol; Wireless network; Throughput; Wireless; Wireless sensor network; Telecommunications","score_opus":0.016628295592142718,"score_gpt":0.2736686003921483,"score_spread":0.25704030480000556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145414136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006642061,0.00036487237,0.9904655,0.00018788327,0.00011787456,0.0002603997,0.00051196665,0.004210098,0.0032171775],"genre_scores_gemma":[0.03583937,0.002018503,0.9517637,0.00018006898,0.00014311391,0.0028587712,0.0022873345,0.0010613377,0.0038477576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765056,0.0011631807,0.00029002744,0.000167628,0.0006185276,0.00010996427],"domain_scores_gemma":[0.9973354,0.0017615752,0.00010560413,0.0002508606,0.00042015655,0.00012637652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036598395,0.0019516011,0.0016309741,0.0017736921,0.0012975959,0.0025918125,0.004164385,0.0022928384,0.009240252],"category_scores_gemma":[0.0067320643,0.0010353995,0.0022427645,0.0015944056,0.0011107466,0.002499123,0.0021833593,0.0032232562,0.0029596288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012981957,0.0001451825,0.0006964867,0.0007705185,0.00019233611,0.00028587654,0.00037473923,0.59831053,0.004320464,0.31348044,0.017782941,0.06351065],"study_design_scores_gemma":[0.00009991738,0.00008139308,0.000113622096,0.00018168485,0.000054565942,0.00013107203,0.00004219611,0.82180095,0.0018063511,0.065464325,0.11017139,0.000052579],"about_ca_topic_score_codex":0.005618723,"about_ca_topic_score_gemma":0.0040957453,"teacher_disagreement_score":0.009240252,"about_ca_system_score_codex":0.0013832841,"about_ca_system_score_gemma":0.0021458645,"threshold_uncertainty_score":0.030911684},"labels":[],"label_agreement":null},{"id":"W2145505680","doi":"10.1109/vetecs.2009.5073289","title":"A Continuous Communication Path Availability Analysis in Vehicular Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Unavailability; Computer science; Wireless ad hoc network; Path (computing); Computer network; Node (physics); Markov process; Topology (electrical circuits); Network topology; Transmission (telecommunications); Range (aeronautics); Mobility model; Distributed computing; Mathematics; Telecommunications; Engineering; Statistics; Wireless","score_opus":0.007942330576945,"score_gpt":0.22824541574428495,"score_spread":0.22030308516733996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145505680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30352834,0.002820847,0.6900629,0.0004207985,0.000055703884,0.00004701508,0.0001577874,0.00019517471,0.0027114386],"genre_scores_gemma":[0.9889809,0.00065174507,0.009633794,0.000028426957,0.000049847018,0.000033449178,0.000068429275,0.000019062438,0.0005343236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988965,0.00035838742,0.000037103608,0.00018354546,0.00038533457,0.00013906471],"domain_scores_gemma":[0.98888844,0.008655095,0.0009132469,0.0003903933,0.0009517998,0.00020109203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017910618,0.00045392002,0.0005245991,0.0014125435,0.00051480543,0.0008793309,0.00093917846,0.00065398787,0.0008021092],"category_scores_gemma":[0.010415743,0.00045733334,0.0004618145,0.0012492863,0.0015891349,0.0021381483,0.00073393015,0.00089937396,0.00012483084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000766421,0.000031308973,0.0051449873,0.00013714745,0.00006981744,0.00034294056,0.00024035398,0.93553394,0.0032963469,0.042309504,0.0004404574,0.0123766875],"study_design_scores_gemma":[0.0000035208643,0.000042580712,0.0013073499,0.000009607739,0.000012359804,0.00011827705,0.000045467637,0.98535943,0.00034971186,0.012423733,0.00031456436,0.000013445195],"about_ca_topic_score_codex":0.0027948285,"about_ca_topic_score_gemma":0.00089864637,"teacher_disagreement_score":0.0027948285,"about_ca_system_score_codex":0.0008134364,"about_ca_system_score_gemma":0.0005708405,"threshold_uncertainty_score":0.009472132},"labels":[],"label_agreement":null},{"id":"W2145644326","doi":"10.1109/icc.2007.211","title":"ASRPAKE: An Anonymous Secure Routing Protocol with Authenticated Key Exchange for Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Computer security; Node (physics); Routing protocol; Mobile ad hoc network; Adversary; Routing (electronic design automation); Wireless; Network packet; Engineering; Telecommunications","score_opus":0.015693429549863885,"score_gpt":0.2726096083847038,"score_spread":0.25691617883483997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145644326","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013147412,0.001586357,0.972866,0.0005410041,0.0006954904,0.00046740507,0.00012766875,0.0035555135,0.0070131896],"genre_scores_gemma":[0.38636628,0.0027731995,0.5882275,0.0007181723,0.00051938347,0.001406914,0.0007960295,0.00040415846,0.018788444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753225,0.00082595967,0.00017495015,0.00021338073,0.0010903833,0.00016307412],"domain_scores_gemma":[0.998833,0.0002731179,0.00020746015,0.00034393757,0.00024291054,0.00009961635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020205767,0.0006806053,0.0007766271,0.0010399579,0.0011370541,0.0013296107,0.002399026,0.0015430077,0.002278318],"category_scores_gemma":[0.0027309356,0.00031897696,0.0006395393,0.0009981504,0.0015114854,0.004372727,0.0028587691,0.0016331311,0.0014023173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014661717,0.00044882463,0.00099167,0.0021367848,0.00029724144,0.0021650305,0.0010342739,0.03785513,0.08315874,0.35404393,0.030816967,0.48558527],"study_design_scores_gemma":[0.0005426976,0.0024009044,0.00067536294,0.00024429287,0.000412315,0.0051764837,0.00042050114,0.36237407,0.05489154,0.12948082,0.4430022,0.0003788831],"about_ca_topic_score_codex":0.00025540232,"about_ca_topic_score_gemma":0.0003405368,"teacher_disagreement_score":0.002399026,"about_ca_system_score_codex":0.00037001408,"about_ca_system_score_gemma":0.000850001,"threshold_uncertainty_score":0.01068598},"labels":[],"label_agreement":null},{"id":"W2145799811","doi":"10.1145/581291.581302","title":"Pro-active route maintenance in DSR","year":2002,"lang":"en","type":"article","venue":"ACM SIGMOBILE Mobile Computing and Communications Review","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Network packet; Computer network; DSRFLOW; Latency (audio); Node (physics); Routing protocol; Throughput; Routing (electronic design automation); Real-time computing; Dynamic Source Routing; Wireless; Telecommunications","score_opus":0.041693350980812095,"score_gpt":0.303140535613777,"score_spread":0.2614471846329649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145799811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12125873,0.0028071909,0.8567923,0.00072369474,0.00037080245,0.00037447488,0.0002536633,0.0049783257,0.012440747],"genre_scores_gemma":[0.703504,0.0010443347,0.28894868,0.00030115142,0.00013632512,0.00015153528,0.0004515979,0.00021703445,0.0052452814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823284,0.0005583679,0.00013373123,0.00030494807,0.00063352456,0.00013646824],"domain_scores_gemma":[0.9947601,0.0011959241,0.0006826275,0.0023954562,0.0008154125,0.00015054371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019033581,0.00066919165,0.00056186743,0.0010861388,0.00060551305,0.0009529391,0.00194374,0.00087791827,0.0013086158],"category_scores_gemma":[0.0070652408,0.000449029,0.0003410537,0.0009501776,0.0006024457,0.0027172666,0.0011302205,0.0009780062,0.00078064785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010496663,0.00033533567,0.0063514053,0.00058261625,0.00014680148,0.00056499057,0.00054511125,0.10678798,0.073294744,0.03387159,0.0077874837,0.76868224],"study_design_scores_gemma":[0.00022446965,0.0015421603,0.0031897656,0.0001326267,0.0002424202,0.0035192866,0.00033687567,0.7830038,0.10089914,0.02794874,0.07882853,0.00013219709],"about_ca_topic_score_codex":0.0011631155,"about_ca_topic_score_gemma":0.0011337294,"teacher_disagreement_score":0.00194374,"about_ca_system_score_codex":0.0004992092,"about_ca_system_score_gemma":0.00061168126,"threshold_uncertainty_score":0.010066032},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.02975569859432026,"score_gpt":0.260003688707304,"score_spread":0.23024799011298375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145885111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025965278,0.16771777,0.7696062,0.0034412448,0.0053275204,0.0003429043,0.00023377375,0.0018777505,0.048856348],"genre_scores_gemma":[0.10287306,0.2855487,0.54089063,0.0016590529,0.007668413,0.0009770491,0.001149074,0.00042320718,0.058810834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985745,0.00038781125,0.00012289023,0.00016913193,0.0006844789,0.00006126463],"domain_scores_gemma":[0.9991811,0.00036305655,0.00007652333,0.00015552255,0.00017762199,0.000046230944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011513442,0.0014722422,0.0012741273,0.0015296304,0.0007217763,0.0031514347,0.0018079361,0.0023786228,0.0047393935],"category_scores_gemma":[0.002622577,0.00078543386,0.0004794357,0.0038328038,0.0018189402,0.004303689,0.0015039751,0.0020412994,0.0048972517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004307417,0.00005832522,0.00043770374,0.001602109,0.000063761996,0.00030325618,0.00031554277,0.031660073,0.0032041508,0.35804775,0.043998025,0.5602662],"study_design_scores_gemma":[0.000038375623,0.00017439936,0.0005004535,0.00053583254,0.00006243538,0.0011789778,0.00016041163,0.06199009,0.0017513289,0.2854776,0.6480537,0.000076421224],"about_ca_topic_score_codex":0.00078120036,"about_ca_topic_score_gemma":0.0007423922,"teacher_disagreement_score":0.0047393935,"about_ca_system_score_codex":0.0007791886,"about_ca_system_score_gemma":0.00075106014,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2146070963","doi":"","title":"Improving ZRP Routing Protocol Against Black Hole Attacks In Mobile Adhoc Networks(MANET)","year":2014,"lang":"en","type":"article","venue":"Journal of academic and applied studies","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer network; Computer science; Zone Routing Protocol; Wireless Routing Protocol; Routing protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Dynamic Source Routing; Interior gateway protocol; Packet drop attack; Optimized Link State Routing Protocol; Hybrid routing; Network packet; Distributed computing","score_opus":0.01748371242831085,"score_gpt":0.29103512918817287,"score_spread":0.273551416759862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146070963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28505936,0.003494826,0.7004527,0.00087670377,0.00042178607,0.00057830836,0.000107478496,0.0026291732,0.006379698],"genre_scores_gemma":[0.89165413,0.0016245367,0.10367897,0.00020590024,0.00006827075,0.00023980068,0.00018063856,0.0000812958,0.002266545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982888,0.0005802439,0.00014447111,0.00017665203,0.0006260272,0.00018389586],"domain_scores_gemma":[0.9978491,0.00072117517,0.00034232676,0.0004003946,0.00061676727,0.000070180264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001457324,0.0006414262,0.0007396307,0.0009199038,0.00078347157,0.0009379605,0.0012859036,0.0008840342,0.00056528806],"category_scores_gemma":[0.0045045335,0.0002963702,0.0005950596,0.000527795,0.00060344074,0.0024651943,0.0014478761,0.0008375065,0.00026670282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013148036,0.00065740367,0.007659665,0.0014861624,0.00057301944,0.0027060527,0.001408654,0.34397888,0.21607725,0.039889734,0.008431958,0.37581635],"study_design_scores_gemma":[0.00023817831,0.0018898601,0.002007242,0.00011965171,0.00040432432,0.0032599282,0.0004982923,0.85500467,0.109770045,0.01193105,0.014709441,0.00016739935],"about_ca_topic_score_codex":0.0010824972,"about_ca_topic_score_gemma":0.00061785453,"teacher_disagreement_score":0.001457324,"about_ca_system_score_codex":0.00036040702,"about_ca_system_score_gemma":0.0010015549,"threshold_uncertainty_score":0.007707119},"labels":[],"label_agreement":null},{"id":"W2146283190","doi":"10.1109/icc.2006.255644","title":"A Self-Adaptive Detection System for MAC Misbehavior in Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Timeout; Network packet; Node (physics); Wireless ad hoc network; Mobile ad hoc network; Intrusion detection system; Transmission (telecommunications); Protocol (science); Transmitter; Process (computing); Packet forwarding; Computer security; Wireless; Channel (broadcasting); Engineering; Telecommunications","score_opus":0.05146023725527795,"score_gpt":0.3018598311065452,"score_spread":0.25039959385126725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146283190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09360639,0.0003112869,0.8808541,0.00018458588,0.00015043796,0.0009027762,0.000048596132,0.021774696,0.0021670836],"genre_scores_gemma":[0.69420874,0.00018436821,0.30014214,0.0002803919,0.00010385508,0.0005794152,0.00014931818,0.0003627781,0.0039889994],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877435,0.00028001162,0.00012515206,0.00021237314,0.00053091027,0.00007725255],"domain_scores_gemma":[0.9947916,0.0014991629,0.00063034915,0.0012286783,0.001563449,0.00028679587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001886145,0.00079744885,0.00064104487,0.0012043598,0.000714464,0.00093167234,0.001698508,0.0009809083,0.0011619781],"category_scores_gemma":[0.006788421,0.00041627084,0.00031705567,0.0003082552,0.00075722655,0.0013331388,0.00075191335,0.0010450911,0.000639985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012477565,0.0016046818,0.013440681,0.0003536281,0.00028367323,0.00079927954,0.001067163,0.062320396,0.3521462,0.01169756,0.006010371,0.5490287],"study_design_scores_gemma":[0.00014395292,0.0016207914,0.0044255177,0.000038666476,0.00017422208,0.0009802876,0.00006638701,0.8181364,0.16171145,0.0024297768,0.010136808,0.0001357551],"about_ca_topic_score_codex":0.00090920756,"about_ca_topic_score_gemma":0.0007663329,"teacher_disagreement_score":0.001886145,"about_ca_system_score_codex":0.00046759722,"about_ca_system_score_gemma":0.00082280685,"threshold_uncertainty_score":0.009975016},"labels":[],"label_agreement":null},{"id":"W2146779403","doi":"10.1109/iwcmc.2011.5982506","title":"MBP: Routing Metric Based on Probabilities for multi-radio multi-channel wireless mesh networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Metrics; Wireless mesh network; Metric (unit); Throughput; Computer network; Channel (broadcasting); Network packet; Routing (electronic design automation); Routing protocol; Interference (communication); Dynamic Source Routing; Flow (mathematics); Flow routing; Wireless; Performance metric; Packet loss; Distributed computing; Wireless network; Telecommunications; Mathematics; Engineering","score_opus":0.06068608699810306,"score_gpt":0.25599642003760503,"score_spread":0.19531033303950196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146779403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010687334,0.0027896583,0.9824948,0.00036286976,0.00030277975,0.00012874829,0.00040414816,0.0009840629,0.0018455641],"genre_scores_gemma":[0.456094,0.0028721746,0.5364571,0.00021673615,0.0003922657,0.0006749016,0.0012667615,0.00029462035,0.0017314196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981153,0.00069164555,0.0001602523,0.00016524797,0.0007958328,0.000071701455],"domain_scores_gemma":[0.9972669,0.0013534342,0.0006045657,0.00021491344,0.00045641218,0.000103832426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013679418,0.0010861937,0.0010206252,0.0017747148,0.00047711836,0.0012575783,0.0013949005,0.0009784362,0.0010671116],"category_scores_gemma":[0.009321274,0.00033041122,0.00041996344,0.0018833159,0.00044977953,0.0026128825,0.0011460034,0.00096382183,0.00040093716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050749903,0.00013164345,0.0045236778,0.0011660816,0.00025243804,0.00030584587,0.00016546025,0.5205158,0.0207213,0.07942555,0.013012173,0.3592725],"study_design_scores_gemma":[0.000038318216,0.00043338793,0.0025209426,0.00008484307,0.00007320643,0.000852889,0.00005104335,0.93695,0.008645761,0.027979033,0.022266788,0.00010380826],"about_ca_topic_score_codex":0.0007195978,"about_ca_topic_score_gemma":0.00056667556,"teacher_disagreement_score":0.0017747148,"about_ca_system_score_codex":0.00068128336,"about_ca_system_score_gemma":0.0006434188,"threshold_uncertainty_score":0.007234454},"labels":[],"label_agreement":null},{"id":"W2146863854","doi":"10.1109/glocom.2010.5683588","title":"Favorable Peer Supported Throughput Optimization in Wireless Mesh Network","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Eion (Canada); Carleton University","funders":"","keywords":"Computer science; Peer-to-peer; Computer network; Throughput; Wireless mesh network; Distributed computing; Bandwidth (computing); Wireless; Wireless network; Maximum throughput scheduling; Selection (genetic algorithm); Interference (communication); Channel (broadcasting); Telecommunications; Quality of service","score_opus":0.00968700289445642,"score_gpt":0.23375367322727578,"score_spread":0.22406667033281935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146863854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.081947535,0.0004474463,0.9150099,0.00012664398,0.000028370612,0.00003250502,0.000027056123,0.00023792854,0.0021426212],"genre_scores_gemma":[0.9512381,0.00018394367,0.047700804,0.000017792992,0.00002543794,0.000041048235,0.000025169504,0.000025594556,0.00074214296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.00034966573,0.000019858213,0.00008104828,0.0002570926,0.00007021761],"domain_scores_gemma":[0.99916923,0.000550608,0.00010439832,0.00004225079,0.000115349205,0.000018263432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010767387,0.00035801966,0.00044749156,0.0005739803,0.0003069809,0.00048017525,0.00056876667,0.0003538516,0.00042773274],"category_scores_gemma":[0.0027199516,0.0001933265,0.00021229342,0.000525547,0.0004465303,0.00076153694,0.0004079595,0.00026279222,0.00008853563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004480027,0.000019820916,0.0005724531,0.00002278599,0.000019243545,0.000041376454,0.000025670995,0.9741732,0.0024535474,0.007110399,0.00031996658,0.015196717],"study_design_scores_gemma":[0.0000017159222,0.00001026102,0.00006680588,5.7453616e-7,0.0000019124575,0.00000602545,0.0000030320152,0.9980646,0.00038278147,0.0013774175,0.00008317885,0.0000017032152],"about_ca_topic_score_codex":0.0016862473,"about_ca_topic_score_gemma":0.0012687813,"teacher_disagreement_score":0.0016862473,"about_ca_system_score_codex":0.00077395444,"about_ca_system_score_gemma":0.00051989994,"threshold_uncertainty_score":0.005694449},"labels":[],"label_agreement":null},{"id":"W2146954976","doi":"10.1109/icc.2007.621","title":"Partially Overlapped Channel Assignment for Multi-Channel Wireless Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Wireless mesh network; Channel allocation schemes; Router; Computer network; Linear programming; Interference (communication); Scheduling (production processes); Integer programming; Wireless; Computation; Wireless network; Algorithm; Topology (electrical circuits); Mathematical optimization; Mathematics; Telecommunications","score_opus":0.03128665736137442,"score_gpt":0.27071658278963834,"score_spread":0.2394299254282639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146954976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01653139,0.000403695,0.98142266,0.000110582165,0.000028028213,0.000023150784,0.00003369537,0.00016725298,0.0012796355],"genre_scores_gemma":[0.8471715,0.0008113489,0.14928521,0.00007680543,0.00007122599,0.00016787916,0.00011015635,0.000058918933,0.0022470404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930143,0.00036400938,0.000015147917,0.00006427427,0.00018475635,0.00007031928],"domain_scores_gemma":[0.9993967,0.00033919208,0.000085684675,0.000068416986,0.0000797084,0.000030324465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006584812,0.00041066355,0.00029882413,0.00030041725,0.00033649875,0.00045982678,0.00053617085,0.00034256588,0.0012629511],"category_scores_gemma":[0.0016103312,0.00025611435,0.00035305132,0.00047075437,0.00045855474,0.0009932469,0.00051066466,0.00050390494,0.00016554604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000555612,0.000027498363,0.00023451532,0.000063210384,0.000022563798,0.000049049515,0.00004431939,0.93919605,0.00318181,0.018097484,0.0006882909,0.0383396],"study_design_scores_gemma":[0.0000049203863,0.000021140686,0.000044099736,0.0000036780857,0.000004622866,0.000012155773,0.000008517848,0.9923644,0.0005206126,0.0063519184,0.0006603029,0.0000036564861],"about_ca_topic_score_codex":0.0029663877,"about_ca_topic_score_gemma":0.0033820216,"teacher_disagreement_score":0.0029663877,"about_ca_system_score_codex":0.0005991192,"about_ca_system_score_gemma":0.0008945906,"threshold_uncertainty_score":0.005898237},"labels":[],"label_agreement":null},{"id":"W2147136121","doi":"10.1109/glocom.2009.5425699","title":"Incremental Routing and Scheduling in Wireless Grids","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Flow routing; Time division multiple access; Distributed computing; Computer network; Wireless mesh network; Grid; Job shop scheduling; Schedule; Wireless; Routing (electronic design automation); Mathematical optimization; Wireless network; Engineering; Mathematics","score_opus":0.010281946722374223,"score_gpt":0.2353089234054905,"score_spread":0.22502697668311628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147136121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044520088,0.0011751574,0.9472764,0.00049178785,0.00009796061,0.0000713822,0.00005635854,0.00058406376,0.005726782],"genre_scores_gemma":[0.67191243,0.001533771,0.32265282,0.00016339845,0.00013944498,0.00015394225,0.00021595723,0.00010002054,0.0031281665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951065,0.00018336972,0.000023861094,0.00006860474,0.0001415213,0.00007204499],"domain_scores_gemma":[0.99921894,0.0004400862,0.00008201543,0.00013929134,0.00008015009,0.000039390707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071026204,0.00032934826,0.00039451188,0.00042981055,0.00056310376,0.0006643052,0.0008731884,0.00043350545,0.0009902489],"category_scores_gemma":[0.0025243978,0.00026305066,0.0003543855,0.0009204311,0.00078962964,0.0014136954,0.00092997396,0.00051640195,0.00017885069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001583086,0.000045071713,0.00095909694,0.00016056422,0.000030037063,0.00018257074,0.00018225638,0.704919,0.004332808,0.14611156,0.003111261,0.13980737],"study_design_scores_gemma":[0.000038801994,0.00005897112,0.0002537484,0.000013270255,0.000017907356,0.00012528064,0.000091082184,0.8679843,0.002393946,0.1205957,0.008414499,0.000012525192],"about_ca_topic_score_codex":0.0022079498,"about_ca_topic_score_gemma":0.0017802065,"teacher_disagreement_score":0.0022079498,"about_ca_system_score_codex":0.0007268175,"about_ca_system_score_gemma":0.0008694324,"threshold_uncertainty_score":0.0052734613},"labels":[],"label_agreement":null},{"id":"W2147301117","doi":"10.1007/978-3-540-24852-1_8","title":"S-RIP: A Secure Distance Vector Routing Protocol","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Distance-vector routing protocol; Routing protocol; Dynamic Source Routing; Zone Routing Protocol; Wireless Routing Protocol; Interior gateway protocol; Routing Information Protocol; Link-state routing protocol; Enhanced Interior Gateway Routing Protocol; Geographic routing; Destination-Sequenced Distance Vector routing; Path vector protocol; Distributed computing; Computer security; Routing (electronic design automation)","score_opus":0.011607321180328083,"score_gpt":0.247982931501988,"score_spread":0.2363756103216599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147301117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016657723,0.0018250797,0.9163992,0.00084524177,0.00096757483,0.00046544088,0.0009987527,0.023048598,0.038792565],"genre_scores_gemma":[0.35912606,0.0032958905,0.5617664,0.0012606509,0.00057585764,0.00067368156,0.0041166074,0.0021801381,0.06700473],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993155,0.000110271176,0.000057084544,0.00008885382,0.00034493822,0.000083313294],"domain_scores_gemma":[0.99938715,0.00014290908,0.000056707395,0.00024154474,0.000120834986,0.00005086191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599521,0.00070773036,0.0007315002,0.0009076941,0.00070456875,0.0011103521,0.0014633016,0.00076508627,0.007063966],"category_scores_gemma":[0.0013227441,0.00037760966,0.00044054285,0.0009251473,0.00092017854,0.002375219,0.0021527768,0.0016243901,0.0049666897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010985909,0.00029017654,0.00044834602,0.00076058495,0.00009145836,0.00046046186,0.0002360987,0.038807366,0.052958284,0.20328495,0.12672044,0.5748432],"study_design_scores_gemma":[0.00044677872,0.00088248006,0.00050002075,0.00014008951,0.0001609212,0.0015590914,0.0001398381,0.34617177,0.0812992,0.20107621,0.3674109,0.00021264098],"about_ca_topic_score_codex":0.00035949118,"about_ca_topic_score_gemma":0.0005819738,"teacher_disagreement_score":0.007063966,"about_ca_system_score_codex":0.00041442888,"about_ca_system_score_gemma":0.00081369956,"threshold_uncertainty_score":0.023631275},"labels":[],"label_agreement":null},{"id":"W2147627962","doi":"10.1109/icc.2005.1494359","title":"A novel multi-hop architecture for future generations of wireless networks with directional antennas","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Throughput; Hop (telecommunications); Reuse; Wireless; Base station; Architecture; Distributed computing; Telecommunications; Engineering","score_opus":0.01246726627334975,"score_gpt":0.23113477130891844,"score_spread":0.2186675050355687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147627962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020789107,0.001931077,0.95844877,0.0010445681,0.00039205464,0.00006987207,0.000078054596,0.00062881864,0.01661765],"genre_scores_gemma":[0.43490726,0.0029990508,0.5417222,0.00054979057,0.0003050526,0.00017205635,0.00013486708,0.00007607886,0.01913371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998945,0.000028736707,0.00000565002,0.000021686932,0.000040092826,0.00000941761],"domain_scores_gemma":[0.9997559,0.000050525898,0.000021899497,0.00005928499,0.00009041718,0.00002193137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029806216,0.00022827541,0.00012683195,0.00030783433,0.00042628386,0.0006921043,0.0005319871,0.00048074586,0.0017313936],"category_scores_gemma":[0.0006011322,0.0001397349,0.00017650095,0.00033302212,0.00025070706,0.00081799127,0.00031481832,0.0006310801,0.0005335476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065011314,0.00006543665,0.0013328578,0.00018605149,0.000032960525,0.00025685038,0.00017614162,0.08504806,0.04194327,0.60691494,0.009878614,0.2540998],"study_design_scores_gemma":[0.000038764945,0.0002496094,0.000920879,0.00007008641,0.000063881445,0.0010353851,0.00009564505,0.6258372,0.013414344,0.14261293,0.21559499,0.00006632903],"about_ca_topic_score_codex":0.00059540593,"about_ca_topic_score_gemma":0.0014666072,"teacher_disagreement_score":0.0017313936,"about_ca_system_score_codex":0.00044403254,"about_ca_system_score_gemma":0.0005018926,"threshold_uncertainty_score":0.0057920814},"labels":[],"label_agreement":null},{"id":"W2147681875","doi":"10.1109/twc.2009.080645","title":"Connection-based scheduling for supporting real-time traffic in wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Scheduling (production processes); Distributed computing; Wireless; Connection (principal bundle); Mesh networking; Switched mesh; Wireless network; Telecommunications; Mathematical optimization","score_opus":0.02143268120356174,"score_gpt":0.27939245826034953,"score_spread":0.2579597770567878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147681875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15625523,0.002088168,0.83715415,0.00044879015,0.00023626041,0.00014924865,0.000061171726,0.00047531017,0.0031315726],"genre_scores_gemma":[0.934668,0.00046339826,0.06415017,0.00004432444,0.0001009744,0.000084957,0.000050707597,0.00004422656,0.00039333312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992787,0.00033940733,0.00003718537,0.000058687998,0.00020061946,0.00008544869],"domain_scores_gemma":[0.998185,0.0010622476,0.0002524631,0.00014886957,0.0002363953,0.00011496698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017787463,0.0005781609,0.0004733886,0.0008232653,0.00092790334,0.0006223577,0.001269691,0.0006564807,0.0010260757],"category_scores_gemma":[0.00412686,0.00031050155,0.00030053844,0.0011981352,0.0006738847,0.0009878498,0.0006517392,0.00063859194,0.00013971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022564622,0.000080549915,0.0011131403,0.00013296987,0.000040522395,0.0000959075,0.000108136315,0.89990467,0.00837877,0.014480033,0.0014282159,0.07401144],"study_design_scores_gemma":[0.00001594925,0.00005523035,0.00017840667,0.0000035381331,0.0000066266716,0.000026363816,0.000012609162,0.99502003,0.00072065357,0.0034705007,0.00048217602,0.0000079302545],"about_ca_topic_score_codex":0.002635742,"about_ca_topic_score_gemma":0.0039684116,"teacher_disagreement_score":0.002635742,"about_ca_system_score_codex":0.0010335565,"about_ca_system_score_gemma":0.0010965096,"threshold_uncertainty_score":0.009407043},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08069712228787203,"score_gpt":0.30873593525937726,"score_spread":0.22803881297150524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147807910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006794458,0.00024743867,0.9913083,0.000109834065,0.000022188457,0.000034152312,0.000014724141,0.00010345268,0.0013654004],"genre_scores_gemma":[0.591588,0.0007311579,0.40518978,0.000110945584,0.000090614376,0.00020729766,0.00010915556,0.00007601871,0.0018969651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896026,0.0004496152,0.00004261713,0.00010811309,0.00033458148,0.0001047039],"domain_scores_gemma":[0.99931,0.00032558964,0.000108798326,0.00007877962,0.00013899298,0.00003786425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015828122,0.0004842736,0.00047849014,0.0005442454,0.0004411644,0.0011352921,0.0013011296,0.0006251283,0.0010157678],"category_scores_gemma":[0.0024213274,0.00035197407,0.00047877734,0.00067848334,0.00074406544,0.0017801515,0.00091144926,0.0006338587,0.00016094587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003948786,0.000036618054,0.00044711248,0.00010170082,0.000023288909,0.00005770165,0.00004710792,0.92284584,0.0037164958,0.028799023,0.0008819373,0.043003567],"study_design_scores_gemma":[0.0000053606204,0.000023723776,0.000056247034,0.000003322849,0.00000673791,0.000019206642,0.000009407571,0.99313617,0.00081209635,0.005212166,0.00071103225,0.00000446376],"about_ca_topic_score_codex":0.002047622,"about_ca_topic_score_gemma":0.0030384834,"teacher_disagreement_score":0.002047622,"about_ca_system_score_codex":0.0012117518,"about_ca_system_score_gemma":0.0015539104,"threshold_uncertainty_score":0.008791864},"labels":[],"label_agreement":null},{"id":"W2147901628","doi":"10.1145/1454586.1454589","title":"Throughput and QoS optimization in nonuniform multichannel wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Scheduling (production processes); Quality of service; Wireless; Wireless network; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.014063608164336385,"score_gpt":0.21913767164712455,"score_spread":0.20507406348278817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147901628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17608415,0.0011168619,0.8171547,0.0004450784,0.00007135088,0.000027175654,0.0001206816,0.00022049081,0.0047595003],"genre_scores_gemma":[0.95987934,0.00035442124,0.038458806,0.000028198925,0.000040663068,0.000029057592,0.000055351633,0.00003706311,0.0011171724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953127,0.00022768484,0.00001628773,0.0000721717,0.00007102615,0.00008155834],"domain_scores_gemma":[0.9990484,0.00063271954,0.000105962616,0.00006474548,0.000103831386,0.000044287535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010248291,0.0004184908,0.00037783326,0.00032972274,0.00035027426,0.0004848024,0.0005347966,0.0002896857,0.0005482325],"category_scores_gemma":[0.003016898,0.00017507237,0.00018551986,0.00047853257,0.00049985276,0.0009860604,0.00059447176,0.0002896887,0.00007989776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007605752,0.000016893138,0.0006990418,0.00003837239,0.000014467751,0.00003930601,0.00002678296,0.95901686,0.0033789757,0.01633236,0.00049811497,0.01986281],"study_design_scores_gemma":[0.0000034595096,0.000015039783,0.0001350012,0.0000015277709,0.0000025880054,0.000008772769,0.0000073486676,0.99424696,0.0006195997,0.0047081267,0.00024940525,0.000002195471],"about_ca_topic_score_codex":0.0016225228,"about_ca_topic_score_gemma":0.001408252,"teacher_disagreement_score":0.0016225228,"about_ca_system_score_codex":0.0011054924,"about_ca_system_score_gemma":0.0004440867,"threshold_uncertainty_score":0.008020937},"labels":[],"label_agreement":null},{"id":"W2148065234","doi":"10.1109/ccece.2009.5090135","title":"Prohibitive-link Detection and Routing Protocol","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Wireless Routing Protocol; Routing (electronic design automation); Hazy Sighted Link State Routing Protocol; Distributed computing","score_opus":0.010819351619046092,"score_gpt":0.25486247604443013,"score_spread":0.24404312442538403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148065234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071042073,0.0008489323,0.94993585,0.001686678,0.00058942894,0.0009208203,0.00075414206,0.004061285,0.034098566],"genre_scores_gemma":[0.3678938,0.0024980768,0.5783965,0.002544118,0.00046837487,0.00274226,0.0036945913,0.0005127911,0.041249495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99638927,0.0008250054,0.00028512266,0.0006332902,0.0014410582,0.00042642106],"domain_scores_gemma":[0.99465054,0.0015040975,0.00051771564,0.002315974,0.0007798918,0.00023182754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027335018,0.0007065201,0.00090696017,0.00092579494,0.0016194854,0.0026254847,0.0027641763,0.0018423155,0.00741752],"category_scores_gemma":[0.0067678695,0.0004229308,0.0005859771,0.0012943533,0.0018057972,0.004162289,0.005317784,0.0026117158,0.0039424454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005520432,0.00022336161,0.00075009884,0.0006601235,0.000079917125,0.0007374949,0.0005765667,0.025991423,0.021017062,0.6499473,0.056290273,0.24317423],"study_design_scores_gemma":[0.00018685046,0.00040499875,0.00044987397,0.00016729342,0.0001216503,0.0022386494,0.00027697923,0.2684652,0.03454583,0.31338882,0.379502,0.0002518603],"about_ca_topic_score_codex":0.00096645544,"about_ca_topic_score_gemma":0.0011521484,"teacher_disagreement_score":0.00741752,"about_ca_system_score_codex":0.0009112508,"about_ca_system_score_gemma":0.0024057627,"threshold_uncertainty_score":0.024814129},"labels":[],"label_agreement":null},{"id":"W2148068092","doi":"10.1109/bsc.2010.5472946","title":"Opportunistic routing for enhanced source-location privacy in wireless sensor networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Computer science; Computer network; Geographic routing; Key distribution in wireless sensor networks; Network packet; Mobile wireless sensor network; Adversary; Software deployment; Dynamic Source Routing; Routing (electronic design automation); Wireless; Routing protocol; Distributed computing; Wireless network; Computer security; Telecommunications","score_opus":0.01644351956957032,"score_gpt":0.25214053109160794,"score_spread":0.23569701152203762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148068092","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030045267,0.001391307,0.9642396,0.00064772373,0.000114048096,0.00009996333,0.00006274904,0.00025932794,0.0031400009],"genre_scores_gemma":[0.87968403,0.0018678294,0.11602894,0.0002161315,0.00012939102,0.00019552353,0.00007450417,0.00005624374,0.0017474003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810284,0.001016749,0.00009787602,0.00015300569,0.00046718985,0.00016225388],"domain_scores_gemma":[0.99561477,0.0030669633,0.00035456812,0.00060693506,0.00026889643,0.0000878905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026127582,0.0005361435,0.0006725932,0.0006364077,0.0010281825,0.0010204955,0.0010328173,0.00082035095,0.0006528175],"category_scores_gemma":[0.0063518016,0.00039470164,0.0005247394,0.0011583549,0.0010486506,0.0022452937,0.0016161575,0.0008139303,0.00014515426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003683154,0.00010053975,0.0012251963,0.00033906676,0.000101884485,0.0006449165,0.00047917236,0.7327109,0.015354236,0.16730821,0.0029933595,0.078374095],"study_design_scores_gemma":[0.000039665116,0.00011022713,0.00020628107,0.00002155381,0.000034555374,0.00037089485,0.00006412205,0.9263141,0.0029321106,0.06498833,0.004889865,0.000028226445],"about_ca_topic_score_codex":0.0008666893,"about_ca_topic_score_gemma":0.001201514,"teacher_disagreement_score":0.0026127582,"about_ca_system_score_codex":0.00071334344,"about_ca_system_score_gemma":0.0011857332,"threshold_uncertainty_score":0.013817728},"labels":[],"label_agreement":null},{"id":"W2148177244","doi":"10.1007/978-3-319-07425-2_18","title":"Energy Efficient Stable Routing Using Adjustable Transmission Ranges in Mobile Ad Hoc Networks","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Routing protocol; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Ad hoc wireless distribution service; Distributed computing; Dynamic Source Routing; Routing (electronic design automation); Wireless; Telecommunications; Network packet","score_opus":0.01203748230677721,"score_gpt":0.22565510370088873,"score_spread":0.21361762139411153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148177244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029513516,0.017013285,0.92990345,0.00040248613,0.0005206437,0.000043132364,0.000065500404,0.00081199047,0.021725936],"genre_scores_gemma":[0.7720718,0.014209744,0.1863346,0.00015107897,0.00057861407,0.000094449264,0.00017222672,0.00031284697,0.026074603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975234,0.000058317135,0.000013619968,0.000045185177,0.00010351851,0.000026989279],"domain_scores_gemma":[0.99967504,0.0001832193,0.000025240302,0.000052127933,0.000053019266,0.000011292437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029652537,0.0005737435,0.0004708998,0.00050325185,0.00028623478,0.00086435856,0.0011496034,0.0004719554,0.0021767407],"category_scores_gemma":[0.0008664276,0.0003145078,0.0002581831,0.0009911493,0.00040101208,0.0014010079,0.00066355156,0.00072577613,0.00077885087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022303329,0.00009191564,0.00036828232,0.0005541314,0.00006738141,0.00023246308,0.00018805571,0.23400939,0.059180852,0.092333525,0.0074589974,0.60529196],"study_design_scores_gemma":[0.000038492257,0.0003657418,0.0006781399,0.0001081104,0.00009342729,0.00080689316,0.0001297357,0.84452206,0.023604836,0.08924458,0.040340465,0.00006754893],"about_ca_topic_score_codex":0.00019643834,"about_ca_topic_score_gemma":0.00025829586,"teacher_disagreement_score":0.0021767407,"about_ca_system_score_codex":0.00027713747,"about_ca_system_score_gemma":0.00016280159,"threshold_uncertainty_score":0.0072818995},"labels":[],"label_agreement":null},{"id":"W2148234869","doi":"10.1109/tvt.2010.2044905","title":"Efficient and Reliable Broadcast in Intervehicle Communication Networks: A Cross-Layer Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Relay; Computer science; Redundancy (engineering); Atomic broadcast; Dissemination; Broadcast domain; Broadcast radiation; Physical layer; Quality of service; Channel (broadcasting); Broadcast communication network; Metric (unit); Provisioning; Distributed computing; Broadcasting (networking); Wireless; Engineering; Telecommunications","score_opus":0.008852814731351681,"score_gpt":0.2417634935938893,"score_spread":0.2329106788625376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148234869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075917896,0.0017967854,0.98868984,0.0002010294,0.000056089066,0.000063374995,0.00001408976,0.00015775727,0.0014291388],"genre_scores_gemma":[0.6475742,0.004277818,0.34434173,0.00024521135,0.00022777711,0.00027901062,0.000111037705,0.000078834,0.0028644172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861336,0.00052045286,0.00010249518,0.00015581472,0.00046355155,0.00014428397],"domain_scores_gemma":[0.99862814,0.0005787908,0.00017973057,0.00015988434,0.00040995982,0.00004344443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026536828,0.00097408186,0.00083911204,0.0008807351,0.0006344476,0.0018560879,0.0016817759,0.0011596986,0.00092238665],"category_scores_gemma":[0.0029070738,0.0006323017,0.0006803689,0.00070831703,0.00069346104,0.001930192,0.0015319627,0.0010548261,0.0003201725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081828715,0.00009203304,0.00087204,0.00040010357,0.00015844691,0.0003043475,0.00025528332,0.82449764,0.02625628,0.05612007,0.0019195816,0.089042336],"study_design_scores_gemma":[0.0000059840095,0.000069768306,0.000094688,0.000016072638,0.000035203902,0.00007586695,0.000033926623,0.9908572,0.002716611,0.0041536884,0.0019275125,0.0000134801585],"about_ca_topic_score_codex":0.0020059538,"about_ca_topic_score_gemma":0.0018446636,"teacher_disagreement_score":0.0026536828,"about_ca_system_score_codex":0.0011131427,"about_ca_system_score_gemma":0.0011793087,"threshold_uncertainty_score":0.014034212},"labels":[],"label_agreement":null},{"id":"W2148514396","doi":"10.1109/mcom.2007.4378324","title":"Multicast Routing in Wireless Mesh Networks: Minimum Cost Trees or Shortest Path Trees?","year":2007,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Multicast address; Source-specific multicast; Wireless mesh network; Unicast; Wireless network; Wireless; Telecommunications","score_opus":0.03735945028488987,"score_gpt":0.2989637978183139,"score_spread":0.26160434753342404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148514396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019471284,0.10810156,0.8193806,0.018153733,0.0032801563,0.00013840086,0.0004391878,0.0006013924,0.030433698],"genre_scores_gemma":[0.49754968,0.13588616,0.33689266,0.0040560937,0.008454092,0.00037818254,0.0011071076,0.00034509558,0.015330845],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993326,0.00020987228,0.00003016757,0.00008704129,0.0002743533,0.00006598434],"domain_scores_gemma":[0.99939716,0.0003112894,0.00008684252,0.000045573866,0.00013118447,0.000027972903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008486503,0.0005564301,0.00085832586,0.0007946334,0.00053451426,0.0014783265,0.0009723902,0.0019223501,0.0029164613],"category_scores_gemma":[0.0037209184,0.0002845155,0.00032693162,0.002039147,0.00081008964,0.004306571,0.0007910308,0.0009441728,0.00090425246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018383857,0.00008179747,0.0010144594,0.0014817325,0.000074135954,0.00026135356,0.00025240585,0.049232744,0.004004407,0.32481423,0.04996891,0.56863004],"study_design_scores_gemma":[0.000051291652,0.00020254038,0.000832508,0.00046999555,0.000065064196,0.0011234765,0.00039203872,0.14917113,0.0033934063,0.64048886,0.2037407,0.00006904601],"about_ca_topic_score_codex":0.0004745936,"about_ca_topic_score_gemma":0.0004967523,"teacher_disagreement_score":0.0029164613,"about_ca_system_score_codex":0.0006448418,"about_ca_system_score_gemma":0.000384074,"threshold_uncertainty_score":0.0097565055},"labels":[],"label_agreement":null},{"id":"W2148521879","doi":"10.1109/lcn.2007.53","title":"Sender Access Control in IP Multicast","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Concordia University","keywords":"Computer science; Computer network; Multicast; IP multicast; Protocol Independent Multicast; Xcast; Source-specific multicast; Pragmatic General Multicast; Inter-domain; Secure multicast; Computer security; Distributed computing","score_opus":0.019263697963812616,"score_gpt":0.29459584652153686,"score_spread":0.27533214855772425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148521879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034737676,0.0025824807,0.93606853,0.0016345426,0.00024281941,0.00022834454,0.000049313036,0.00090615096,0.023550099],"genre_scores_gemma":[0.88059896,0.002285905,0.10340044,0.00039238273,0.00081431324,0.00045959055,0.00009528211,0.00014133741,0.011811702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99247545,0.0030600273,0.00054305233,0.00064039155,0.0026437112,0.00063739385],"domain_scores_gemma":[0.99246216,0.004043447,0.0008121739,0.0015329559,0.0008812571,0.0002679029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007980479,0.00058311754,0.0009280979,0.0014214308,0.0018816538,0.003587267,0.0018566842,0.0021181724,0.0024919275],"category_scores_gemma":[0.014295795,0.0006561905,0.00063504593,0.0012986109,0.002964889,0.006484883,0.0032749465,0.002286528,0.0006018939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021469704,0.00012288608,0.002064351,0.0002690478,0.000040120536,0.00065151596,0.0018495788,0.02122839,0.006339128,0.86012304,0.0031968125,0.10390054],"study_design_scores_gemma":[0.00016565659,0.00029347415,0.0009802541,0.00018868747,0.000186123,0.0012859731,0.0004106998,0.3745586,0.011256781,0.5454025,0.06516613,0.00010502204],"about_ca_topic_score_codex":0.0010689695,"about_ca_topic_score_gemma":0.0004923818,"teacher_disagreement_score":0.007980479,"about_ca_system_score_codex":0.001427574,"about_ca_system_score_gemma":0.0009155204,"threshold_uncertainty_score":0.042205334},"labels":[],"label_agreement":null},{"id":"W2148808586","doi":"10.1109/cnsr.2008.76","title":"Efficient Topology Discovery for Multihop Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Distributed computing; Routing protocol; Wireless Routing Protocol; Dynamic Source Routing; Redundancy (engineering); Zone Routing Protocol; Link-state routing protocol; Network packet; Topology (electrical circuits); Engineering","score_opus":0.015660090218996673,"score_gpt":0.2396758913493613,"score_spread":0.22401580113036462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148808586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013304735,0.0041928375,0.97781897,0.0005169692,0.00016608277,0.00008326211,0.00008669672,0.00076277147,0.0030677167],"genre_scores_gemma":[0.5261402,0.0058072796,0.4577213,0.00015613074,0.00027914948,0.0003243612,0.0007539992,0.000155267,0.008662316],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911684,0.0002758665,0.00005223544,0.00009165193,0.00042588564,0.000037463727],"domain_scores_gemma":[0.99907035,0.0004311172,0.000117675234,0.00022461721,0.00011317687,0.00004315522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009132126,0.00033844454,0.00048309742,0.0008107476,0.0004352819,0.00086818985,0.0007569549,0.0005331252,0.0011730118],"category_scores_gemma":[0.0031248871,0.00030604663,0.0001948005,0.0008919448,0.00046599575,0.002118393,0.0010398395,0.0006811717,0.00050846854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026085184,0.000102927144,0.0008042212,0.00066837476,0.00010554923,0.00029592498,0.00025903856,0.1925317,0.033624988,0.111558706,0.009380078,0.65040773],"study_design_scores_gemma":[0.00007339591,0.00021145253,0.0006544958,0.000060843286,0.000041108367,0.000617915,0.00009058139,0.818288,0.017123105,0.11038614,0.052413996,0.000038926635],"about_ca_topic_score_codex":0.00027142285,"about_ca_topic_score_gemma":0.00033723417,"teacher_disagreement_score":0.0011730118,"about_ca_system_score_codex":0.0003353623,"about_ca_system_score_gemma":0.00033234022,"threshold_uncertainty_score":0.0048295856},"labels":[],"label_agreement":null},{"id":"W2148940158","doi":"10.1109/ccece.2005.1557387","title":"Topology discovery for network fault management using mobile agents in ad-hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Fault management; Mobile ad hoc network; Network topology; Computer network; Wireless ad hoc network; Distributed computing; Network management; Vehicular ad hoc network; Network management station; Network management application; Topology (electrical circuits); Logical topology; Optimized Link State Routing Protocol; Network architecture; Engineering; Routing protocol; Telecommunications; Routing (electronic design automation)","score_opus":0.018031970720156085,"score_gpt":0.2723097314342231,"score_spread":0.254277760714067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148940158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018522805,0.0021424268,0.9741091,0.0006461734,0.00020566795,0.00011310082,0.000026091375,0.00066226325,0.003572317],"genre_scores_gemma":[0.6009314,0.0022280733,0.39088884,0.0001549053,0.00032343774,0.00024863755,0.00013091043,0.00007462623,0.005019171],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916255,0.00033896905,0.00006432346,0.00009911335,0.0002865168,0.000048621456],"domain_scores_gemma":[0.99849975,0.0007646593,0.00017938469,0.00020303526,0.00026845085,0.000084779545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008950164,0.000372305,0.00065604853,0.0010476749,0.0010404681,0.0015629386,0.0008940967,0.0009653176,0.0010495596],"category_scores_gemma":[0.0037993125,0.00021545419,0.00030122313,0.0008813441,0.00078666344,0.0024491022,0.0009900187,0.0007224087,0.00040214753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003488724,0.00015886361,0.0037336922,0.00038735676,0.00012116275,0.0009399704,0.0008003899,0.28267637,0.020363107,0.16317569,0.0071778554,0.5201167],"study_design_scores_gemma":[0.000047765898,0.00018176764,0.0005130819,0.00003795518,0.00005525211,0.00058060454,0.00014033115,0.9327714,0.0065402035,0.035052706,0.024042673,0.00003629242],"about_ca_topic_score_codex":0.0009307035,"about_ca_topic_score_gemma":0.0011755623,"teacher_disagreement_score":0.0015629386,"about_ca_system_score_codex":0.00061637885,"about_ca_system_score_gemma":0.0005351964,"threshold_uncertainty_score":0.0047333837},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.013084612317215149,"score_gpt":0.2267866513309311,"score_spread":0.21370203901371596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149076393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00653404,0.001835563,0.9895489,0.00018581752,0.00008323336,0.00006829674,0.000033196186,0.0003632869,0.0013477751],"genre_scores_gemma":[0.15985438,0.004429102,0.8314243,0.0001482844,0.00025235742,0.0002864437,0.00027489918,0.0001765444,0.0031535747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988691,0.00033915404,0.00008047521,0.00023038039,0.00042175566,0.000059047074],"domain_scores_gemma":[0.9988418,0.00061338895,0.00013486773,0.00016402252,0.00021462764,0.000031165528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089891476,0.00070066605,0.0007760585,0.0013457489,0.0008782922,0.0011545813,0.0017902572,0.0013240316,0.0009791977],"category_scores_gemma":[0.0032214215,0.00048491565,0.00056435214,0.002242678,0.0011193132,0.003087149,0.0010105213,0.0006900356,0.00056233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012742246,0.00006160326,0.0015231222,0.00082765357,0.00013486158,0.00027341655,0.00044880525,0.5570001,0.008417423,0.12131639,0.004863103,0.30500615],"study_design_scores_gemma":[0.000038355734,0.00011081391,0.0008350116,0.00007317971,0.00006601011,0.0004959331,0.00010841501,0.88616836,0.005618916,0.081461355,0.024938906,0.000084793915],"about_ca_topic_score_codex":0.0017155159,"about_ca_topic_score_gemma":0.00200285,"teacher_disagreement_score":0.0017902572,"about_ca_system_score_codex":0.0009624266,"about_ca_system_score_gemma":0.0006010632,"threshold_uncertainty_score":0.006982863},"labels":[],"label_agreement":null},{"id":"W2149601926","doi":"10.1109/iscc.2009.5202319","title":"Performance evaluation of MANETs virtual backbone formation algorithms","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Connected dominating set; Mobile ad hoc network; Algorithm; Wireless ad hoc network; Distributed computing; Topology control; Precomputation; Heuristics; Computer network; Network topology; Wireless network; Logical topology; Overhead (engineering); Wireless; Topology (electrical circuits); Computation; Mathematics","score_opus":0.023877027113671317,"score_gpt":0.26286396191109385,"score_spread":0.23898693479742253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149601926","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75275815,0.0047575156,0.2138874,0.00078204647,0.00032945612,0.00052729045,0.0005832945,0.0019796845,0.024395244],"genre_scores_gemma":[0.9626584,0.00059080886,0.035012815,0.000052908825,0.000024598508,0.00010761157,0.00041060118,0.00006078199,0.0010814259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960008,0.0018632754,0.00023503418,0.00037524558,0.0010419295,0.0004836793],"domain_scores_gemma":[0.98921645,0.0069861943,0.0008217367,0.00082614325,0.0017421651,0.000407347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004833711,0.0011611604,0.0012870689,0.0018217961,0.0009985466,0.001386157,0.0015856737,0.0009635474,0.0013593432],"category_scores_gemma":[0.0138774235,0.00021670703,0.0003390853,0.0017443475,0.00065657304,0.0016221141,0.0011745823,0.00047806275,0.00030488786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056889193,0.00020523512,0.0019378595,0.00010189481,0.00006638749,0.000034167904,0.00004491466,0.94457936,0.0015170726,0.003371179,0.0010741607,0.046498798],"study_design_scores_gemma":[0.00002914838,0.0003241419,0.00043134528,0.000008408026,0.000016409778,0.00004105366,0.000043883694,0.9956097,0.0021870232,0.0008837759,0.00041669313,0.000008459041],"about_ca_topic_score_codex":0.0029493172,"about_ca_topic_score_gemma":0.0019934922,"teacher_disagreement_score":0.004833711,"about_ca_system_score_codex":0.0023368406,"about_ca_system_score_gemma":0.0015995328,"threshold_uncertainty_score":0.025563419},"labels":[],"label_agreement":null},{"id":"W2149749279","doi":"10.1109/ccece.2005.1557168","title":"An architecture for integrating mobile ad hoc networks with the internet using multiple mobile gateways","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Mobile computing; Optimized Link State Routing Protocol; Vehicular ad hoc network; Distributed computing; Mobile IP; The Internet; Node (physics); Routing protocol; Routing (electronic design automation); Telecommunications; Wireless; Engineering; World Wide Web","score_opus":0.008987823894564208,"score_gpt":0.2311991569031054,"score_spread":0.2222113330085412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149749279","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016236207,0.0003042495,0.9740615,0.00035753768,0.00010788438,0.00021112325,0.000019961855,0.0025179056,0.0061835796],"genre_scores_gemma":[0.1729846,0.0006561907,0.8174176,0.00021240668,0.0000829807,0.00022245896,0.0001643264,0.00010904175,0.008150348],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996195,0.0000870559,0.00003977648,0.00006113756,0.00014707878,0.000045503475],"domain_scores_gemma":[0.9996605,0.00004081306,0.00003014715,0.00007798091,0.000127096,0.00006344793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076267606,0.00042036737,0.00035041035,0.0005728277,0.00060353824,0.0011474311,0.0014077271,0.0010061925,0.0011828144],"category_scores_gemma":[0.0007445684,0.00044397052,0.0005144961,0.0005315644,0.000537668,0.002009507,0.0013504885,0.0011089483,0.00069655053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003915828,0.00052997924,0.004773743,0.00059621216,0.0003005022,0.0017926968,0.00117208,0.12515222,0.13683513,0.25829574,0.010560825,0.45959923],"study_design_scores_gemma":[0.00020468084,0.0012960497,0.002439159,0.00016780752,0.0005191877,0.0021318898,0.00028251825,0.7112443,0.04717632,0.0631602,0.17120649,0.0001713707],"about_ca_topic_score_codex":0.0012628946,"about_ca_topic_score_gemma":0.00158566,"teacher_disagreement_score":0.0014077271,"about_ca_system_score_codex":0.00042615688,"about_ca_system_score_gemma":0.0007883361,"threshold_uncertainty_score":0.0040334463},"labels":[],"label_agreement":null},{"id":"W2149949310","doi":"10.1109/pccc.2004.1395119","title":"A dynamic multicast tree reconstruction algorithm for minimum-energy multicasting in wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Wireless ad hoc network; Computer network; Distributed computing; Source-specific multicast; Protocol Independent Multicast; Heuristic; Tree (set theory); Xcast; Energy consumption; Algorithm; Wireless; Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.029437917554160593,"score_gpt":0.2944425630698798,"score_spread":0.26500464551571923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149949310","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012850211,0.0003135328,0.9850021,0.00014088793,0.000027666123,0.000076697535,0.000031325617,0.0005497448,0.0010078414],"genre_scores_gemma":[0.15876515,0.00017103727,0.8395312,0.00008960383,0.000028031924,0.00015956162,0.00017465252,0.00006579859,0.0010149968],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996269,0.00011016099,0.00002002524,0.00006165956,0.00012856592,0.000052715517],"domain_scores_gemma":[0.9996294,0.00019100495,0.000037785252,0.000044985543,0.00006898352,0.000027840779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066763227,0.0005222373,0.00066450116,0.0005814784,0.0007276117,0.0004510526,0.0013600601,0.0009437636,0.0014441919],"category_scores_gemma":[0.0016163759,0.00033764384,0.0004268409,0.0006235547,0.00033253038,0.0010899585,0.00094207004,0.00084818504,0.0003396214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039165525,0.0002603908,0.0010311123,0.00022303588,0.0000678952,0.00014499332,0.0002440141,0.32017168,0.016708145,0.021475917,0.0053891386,0.63389194],"study_design_scores_gemma":[0.000084430554,0.00015120878,0.0001722242,0.00001532734,0.000020018397,0.00016559733,0.000046912395,0.9822282,0.004322844,0.009463487,0.0033157172,0.000014041636],"about_ca_topic_score_codex":0.0011452689,"about_ca_topic_score_gemma":0.0012763677,"teacher_disagreement_score":0.0014441919,"about_ca_system_score_codex":0.0005834119,"about_ca_system_score_gemma":0.0007795035,"threshold_uncertainty_score":0.004831314},"labels":[],"label_agreement":null},{"id":"W2150023691","doi":"10.1109/icpads.2008.78","title":"A Constant Factor Localized Algorithm for Computing Connected Dominating Sets in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Wireless sensor network; Algorithm; Approximation algorithm; Connected dominating set; Wireless network; Simple (philosophy); Flooding (psychology); Context (archaeology); Wireless; Topology (electrical circuits); Mathematics; Minimum spanning tree; Computer network; Combinatorics","score_opus":0.019821042834980058,"score_gpt":0.2550025364415526,"score_spread":0.2351814936065725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150023691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016378358,0.0002977663,0.9810035,0.000098924436,0.000026822616,0.000107631735,0.000060415037,0.0012036752,0.0008228474],"genre_scores_gemma":[0.22669278,0.0002586606,0.77084845,0.00008799595,0.000041198957,0.0003770231,0.00031948992,0.00011576704,0.0012586352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991259,0.00025018136,0.00005540042,0.00022965376,0.00025545267,0.00008341116],"domain_scores_gemma":[0.9986695,0.000698376,0.00012809478,0.00026411086,0.00017416138,0.00006577952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011747662,0.0012238579,0.0012011955,0.0011719737,0.00071751815,0.0009183935,0.0016236068,0.00081266393,0.001992853],"category_scores_gemma":[0.004750269,0.00048715613,0.0007224414,0.0016270524,0.00076882355,0.0019368145,0.0012949778,0.00094529387,0.0008402225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050413556,0.00019631536,0.0009811271,0.00032241052,0.00010116749,0.00014114076,0.00025134077,0.67869765,0.01268788,0.021901492,0.0039000905,0.28031528],"study_design_scores_gemma":[0.0000839785,0.0002100405,0.00019062677,0.000017015283,0.000025982723,0.00007962861,0.00004683974,0.9779238,0.0034471021,0.016077923,0.0018795249,0.000017468612],"about_ca_topic_score_codex":0.0018670381,"about_ca_topic_score_gemma":0.00274199,"teacher_disagreement_score":0.001992853,"about_ca_system_score_codex":0.001101398,"about_ca_system_score_gemma":0.00126989,"threshold_uncertainty_score":0.007991314},"labels":[],"label_agreement":null},{"id":"W2150097385","doi":"10.1109/twc.2010.082710.091521","title":"Distributed Routing Schemes with Accessibility Consideration in Multi-Hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Dynamic Source Routing; Geographic routing; Wireless; Bandwidth (computing); Spectral efficiency; Destination-Sequenced Distance Vector routing; Transmitter; Routing protocol; Hop (telecommunications); Wireless network; Distributed computing; Wireless Routing Protocol; Static routing; Routing (electronic design automation); Telecommunications","score_opus":0.03104097808522263,"score_gpt":0.28810878120426814,"score_spread":0.25706780311904553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150097385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010934709,0.0007350603,0.98685557,0.00011214104,0.00006542845,0.00004815166,0.000009343639,0.00017585821,0.0010637328],"genre_scores_gemma":[0.7882818,0.0013142363,0.20797929,0.000117867894,0.00026371653,0.0002314934,0.00006204606,0.00005397991,0.0016955553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998226,0.0007123287,0.00012645668,0.0002814534,0.0005604986,0.00009326306],"domain_scores_gemma":[0.99605983,0.0020306744,0.0004250071,0.0008678102,0.00050905027,0.000107645305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019289816,0.0007235921,0.0010679807,0.00090924476,0.00078380725,0.0010910238,0.0020366402,0.001008172,0.00063444255],"category_scores_gemma":[0.006084214,0.00031750667,0.0005928193,0.0010093186,0.0010951504,0.0036326319,0.0018105375,0.0010187266,0.00020076703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017520737,0.00011442461,0.0009637858,0.00044451118,0.00010977045,0.0003501213,0.00041164295,0.58497536,0.015099522,0.20680393,0.0012026523,0.18934907],"study_design_scores_gemma":[0.00005026406,0.00019559299,0.00024223073,0.00002664351,0.000062534295,0.00029650974,0.0000577981,0.9235469,0.00352127,0.06623123,0.0057308623,0.000038218248],"about_ca_topic_score_codex":0.00030013238,"about_ca_topic_score_gemma":0.0003611961,"teacher_disagreement_score":0.0020366402,"about_ca_system_score_codex":0.0006273632,"about_ca_system_score_gemma":0.0004986098,"threshold_uncertainty_score":0.010201573},"labels":[],"label_agreement":null},{"id":"W2150156708","doi":"10.1109/glocom.2007.210","title":"On the Average Capacity of Vehicle to Vehicle Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless ad hoc network; Computer science; Dissemination; Vehicular ad hoc network; Computer network; Vehicle-to-vehicle; Task (project management); Wireless; Simple (philosophy); Wireless network; Work (physics); Measure (data warehouse); Telecommunications; Engineering; Data mining","score_opus":0.01619253604382259,"score_gpt":0.22565464800900942,"score_spread":0.20946211196518683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150156708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18574823,0.010937735,0.7652433,0.0026540845,0.0002970978,0.00008219324,0.001124465,0.0009041606,0.033008747],"genre_scores_gemma":[0.97482634,0.0048583266,0.016727852,0.0001916003,0.00031425845,0.00016940157,0.00042572242,0.0001498858,0.0023367698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979937,0.0005508404,0.000063625535,0.0003434037,0.00053595635,0.00051250093],"domain_scores_gemma":[0.98248833,0.0140289515,0.00069311145,0.0009751804,0.0014343378,0.00038006983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031580834,0.0007862441,0.0013213041,0.0019824556,0.0011681218,0.0022510663,0.0026677763,0.0012526487,0.0044548633],"category_scores_gemma":[0.023028556,0.000537708,0.00055526715,0.002279158,0.002720236,0.0065197838,0.001573907,0.0016293258,0.00073728064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001375806,0.00003745166,0.0013049986,0.00017530363,0.00005857271,0.00013888226,0.00018042389,0.8009975,0.0027463164,0.17287204,0.0026271532,0.01872381],"study_design_scores_gemma":[0.000007473751,0.000023284294,0.0005116045,0.000063156585,0.00001732257,0.000102883176,0.0000739103,0.90997815,0.0014145043,0.08574823,0.002030299,0.000029157794],"about_ca_topic_score_codex":0.003900973,"about_ca_topic_score_gemma":0.0015255002,"teacher_disagreement_score":0.0044548633,"about_ca_system_score_codex":0.0023593327,"about_ca_system_score_gemma":0.0010843922,"threshold_uncertainty_score":0.017118216},"labels":[],"label_agreement":null},{"id":"W2150175166","doi":"10.1109/bsc.2006.1644602","title":"Performance Modeling of Ad Hoc Networks with Multi-Cell Interference","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Wireless ad hoc network; Throughput; Computer network; Interference (communication); Multiple Access with Collision Avoidance for Wireless; Vehicular ad hoc network; Ad hoc wireless distribution service; Mobile ad hoc network; Protocol (science); Channel (broadcasting); Optimized Link State Routing Protocol; Distributed computing; Wireless; Network packet; Telecommunications","score_opus":0.012984283068317073,"score_gpt":0.20025746813543358,"score_spread":0.1872731850671165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150175166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10743694,0.0024572338,0.8660335,0.0008149091,0.00017662901,0.00011608695,0.0002333514,0.00042013265,0.022311296],"genre_scores_gemma":[0.9706059,0.0017810559,0.022514556,0.00011643248,0.00015004448,0.00014226369,0.00013350221,0.000062008556,0.0044942587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990416,0.00033825156,0.00003171592,0.00011093554,0.00035190396,0.00012560985],"domain_scores_gemma":[0.9984773,0.0008181361,0.0002379451,0.0001329248,0.00028495607,0.000048730893],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093947916,0.0011660347,0.00055378984,0.0007435204,0.0004631542,0.0012176023,0.0016066472,0.0011719201,0.00094351947],"category_scores_gemma":[0.0036572877,0.00034840722,0.00038854734,0.0008746289,0.0007508336,0.0018320681,0.00068632676,0.00071128627,0.00050555053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013605105,0.000017689033,0.00033236446,0.000019727731,0.000011054819,0.00006691561,0.00003487357,0.9808569,0.0009427339,0.014876299,0.00023100166,0.0025967858],"study_design_scores_gemma":[0.0000013530477,0.000010473381,0.00006815753,0.000002224548,0.0000029899816,0.000015719226,0.0000063015846,0.9967154,0.000119525095,0.0028057906,0.0002494928,0.0000025485776],"about_ca_topic_score_codex":0.0033310035,"about_ca_topic_score_gemma":0.0010682436,"teacher_disagreement_score":0.0033310035,"about_ca_system_score_codex":0.0011799638,"about_ca_system_score_gemma":0.0005415546,"threshold_uncertainty_score":0.008561254},"labels":[],"label_agreement":null},{"id":"W2150432689","doi":"10.1109/wcnc.2010.5506611","title":"Secondary Wireless Mesh Network Design Using Leased Frequency Spectra","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Wireless mesh network; Greedy algorithm; Node (physics); Mathematical optimization; Routing (electronic design automation); Optimization problem; Interference (communication); Computer network; Distributed computing; Channel (broadcasting); Wireless; Wireless network; Algorithm; Engineering; Mathematics; Telecommunications","score_opus":0.019694000753871663,"score_gpt":0.23538674301494975,"score_spread":0.2156927422610781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150432689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02843437,0.00015576859,0.9673259,0.00008910479,0.0000327963,0.00004005569,0.0000217897,0.00014799129,0.003752223],"genre_scores_gemma":[0.7501679,0.0003074635,0.2452573,0.00005655957,0.000055563876,0.00011713974,0.00007495191,0.000055525943,0.003907601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968886,0.00012599054,0.0000102186295,0.0000460691,0.00008337511,0.000045394976],"domain_scores_gemma":[0.99960893,0.00014663704,0.000068446,0.0000364713,0.00011066327,0.000028826642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048721692,0.0004680962,0.00046138238,0.00038264412,0.0003202894,0.0005389983,0.0008773604,0.0004092324,0.0016041548],"category_scores_gemma":[0.0010924631,0.00015979532,0.00026534993,0.00024716737,0.00037154162,0.00064983976,0.0005626791,0.00033954706,0.00032859118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025413735,0.00011593343,0.0016533319,0.00024239783,0.000043819065,0.00031394346,0.00017055645,0.7310688,0.07659858,0.028341921,0.0019538114,0.1592428],"study_design_scores_gemma":[0.000018375289,0.00016298174,0.00014501691,0.000009686051,0.000011737438,0.00013473716,0.000028164222,0.9834858,0.007599723,0.0049833497,0.0034133133,0.000007119605],"about_ca_topic_score_codex":0.0005105681,"about_ca_topic_score_gemma":0.00071357633,"teacher_disagreement_score":0.0016041548,"about_ca_system_score_codex":0.0005212866,"about_ca_system_score_gemma":0.00037242495,"threshold_uncertainty_score":0.005366504},"labels":[],"label_agreement":null},{"id":"W2150787908","doi":"10.1002/wcm.125","title":"Power‐aware broadcasting and activity scheduling in ad hoc wireless networks using connected dominating sets","year":2003,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Connected dominating set; Dominating set; Wireless ad hoc network; Broadcasting (networking); Mobile ad hoc network; Network packet; Distributed computing; Scheduling (production processes); Flooding (psychology); Wireless; Telecommunications; Algorithm; Theoretical computer science; Minimum spanning tree; Graph","score_opus":0.023135541594896367,"score_gpt":0.28304518776245424,"score_spread":0.25990964616755785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150787908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041224897,0.0008134751,0.9543939,0.00016513043,0.000103343475,0.0001555832,0.000031139436,0.00018147328,0.0029309874],"genre_scores_gemma":[0.74268293,0.0008946337,0.25320092,0.00012134866,0.000095528754,0.00030946327,0.0001364646,0.000060255086,0.002498556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889296,0.0005331034,0.00006825844,0.00015299385,0.00028866623,0.0000640513],"domain_scores_gemma":[0.99817264,0.0010181597,0.00018659559,0.00015626519,0.00034203925,0.00012439124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016533312,0.0008251801,0.0009307022,0.000838092,0.0006325404,0.00083905284,0.0014012961,0.00063804054,0.00048975373],"category_scores_gemma":[0.0027076388,0.0003220537,0.00054477196,0.0009416133,0.0007700323,0.0011444079,0.000712279,0.0004891048,0.00016748067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013664794,0.000117031515,0.00079566636,0.00018982292,0.000094654344,0.00017421058,0.00025564083,0.8604072,0.013837307,0.025496203,0.0012147016,0.09728079],"study_design_scores_gemma":[0.00002805434,0.00013082419,0.00018636048,0.000011975961,0.00002417785,0.0000691545,0.000026534302,0.98439884,0.0032310775,0.009821229,0.0020582075,0.000013592521],"about_ca_topic_score_codex":0.0014309053,"about_ca_topic_score_gemma":0.0012096588,"teacher_disagreement_score":0.0016533312,"about_ca_system_score_codex":0.0009472255,"about_ca_system_score_gemma":0.00067619875,"threshold_uncertainty_score":0.008743763},"labels":[],"label_agreement":null},{"id":"W2150958581","doi":"10.1109/wcnc.2008.503","title":"Energy-Aware Co-Operative (ECO) Relay-Based Packet Transmission in Wireless Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Network packet; Computer network; Computer science; Relay; Node (physics); Transmission (telecommunications); Energy (signal processing); Wireless; Efficient energy use; Enhanced Data Rates for GSM Evolution; Energy consumption; Telecommunications; Engineering; Electrical engineering","score_opus":0.013237207933594184,"score_gpt":0.2397479628688017,"score_spread":0.22651075493520753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150958581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095275804,0.0033584465,0.89488107,0.0002396779,0.000091494294,0.00009663234,0.000030292531,0.0004161672,0.0056103677],"genre_scores_gemma":[0.93963444,0.0011433047,0.057559002,0.00007136386,0.000055504075,0.000047636062,0.000029659735,0.00001882472,0.0014403088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990221,0.0003764862,0.000043509594,0.00016134494,0.00030065858,0.00009584429],"domain_scores_gemma":[0.9966869,0.0021520746,0.0003653335,0.0003877225,0.00033949435,0.00006853022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001339704,0.00082519976,0.00066496327,0.0007082644,0.0005465358,0.00074308936,0.0012278109,0.00091557537,0.00058223784],"category_scores_gemma":[0.0041190973,0.00023130128,0.0002940861,0.0010239991,0.0008155276,0.0015862436,0.0010447238,0.00048220833,0.00023926195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001334845,0.00032311137,0.006323059,0.0007163963,0.00019301905,0.0012964038,0.0005928473,0.47814134,0.05785602,0.07282294,0.003143287,0.3772567],"study_design_scores_gemma":[0.00006914863,0.0011652885,0.0018063083,0.000054532622,0.00018463549,0.0038018369,0.0001836207,0.9181593,0.043913305,0.020359822,0.01022049,0.00008177834],"about_ca_topic_score_codex":0.0006433428,"about_ca_topic_score_gemma":0.0007612953,"teacher_disagreement_score":0.001339704,"about_ca_system_score_codex":0.00028452906,"about_ca_system_score_gemma":0.00040908362,"threshold_uncertainty_score":0.0070851445},"labels":[],"label_agreement":null},{"id":"W2151124545","doi":"10.5539/cis.v7n4p129","title":"An Efficient Traffic-Load and Link-Interference Aware Routing Metric for Multi Radio Multi Channel Wireless Mesh Networks Based on Link’s Effective Capacity Estimation","year":2014,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Throughput; Dynamic Source Routing; Multipath routing; Static routing; Equal-cost multi-path routing; Network packet; Routing protocol; Wireless network; Wireless; Telecommunications","score_opus":0.018348205537831973,"score_gpt":0.25620416345795605,"score_spread":0.23785595792012407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151124545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03405269,0.0015702249,0.96188086,0.00016569387,0.00009786469,0.00009413171,0.0001856193,0.000536366,0.0014164946],"genre_scores_gemma":[0.74558216,0.0007582847,0.25194222,0.000054072163,0.00007632324,0.00018193455,0.00056399434,0.00008833022,0.00075260625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862874,0.00043353383,0.00010605901,0.00014123133,0.0006365386,0.000053907686],"domain_scores_gemma":[0.99808383,0.0007848672,0.00038293874,0.00019381745,0.0005068097,0.000047725127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001224351,0.0009421469,0.0007619097,0.0018878704,0.0004064495,0.00087002455,0.0011389679,0.0005769325,0.0003492829],"category_scores_gemma":[0.0039224043,0.00022333862,0.00032536854,0.0014810862,0.00035501277,0.0019944052,0.00063017255,0.000603653,0.00010992519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011704943,0.00016042333,0.004152322,0.0003645138,0.00013421166,0.00010823362,0.00009681312,0.78434736,0.028665649,0.016277129,0.002112052,0.1634643],"study_design_scores_gemma":[0.0000034659004,0.00009659538,0.00092362857,0.000010494818,0.000018796058,0.00010804384,0.000014661857,0.98814166,0.007547994,0.001795213,0.0013135837,0.000025882839],"about_ca_topic_score_codex":0.0008812593,"about_ca_topic_score_gemma":0.0014353174,"teacher_disagreement_score":0.0018878704,"about_ca_system_score_codex":0.0010063943,"about_ca_system_score_gemma":0.00070117303,"threshold_uncertainty_score":0.0073019266},"labels":[],"label_agreement":null},{"id":"W2151501043","doi":"10.1109/icniconsmcl.2006.202","title":"Study of Different Types of Attacks on Multicast in Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Multicast; Mobile ad hoc network; Eavesdropping; Computer security; Network packet","score_opus":0.013062780461317704,"score_gpt":0.2561691658575339,"score_spread":0.2431063853962162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151501043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89519113,0.0041300724,0.09101376,0.0005729465,0.00007467249,0.0001775156,0.0000982903,0.00022788324,0.008513597],"genre_scores_gemma":[0.9904881,0.0012607169,0.0076012285,0.00004144725,0.000043879845,0.000032304342,0.000035901023,0.000018484121,0.00047791627],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997445,0.0011431557,0.000116670955,0.00014813109,0.0008972544,0.00024981215],"domain_scores_gemma":[0.9809559,0.016089797,0.0012424176,0.0007872018,0.00076431927,0.00016044732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001600607,0.00067445304,0.00074139074,0.0015883399,0.0006329314,0.0008236965,0.0005798123,0.001107271,0.0004721086],"category_scores_gemma":[0.012527413,0.00026284257,0.00085680117,0.001015553,0.0008416886,0.0019880543,0.0005682581,0.0006135906,0.000074803196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068297074,0.0004264185,0.029735105,0.00071267795,0.00061597314,0.0013285981,0.00076165824,0.7921652,0.039477475,0.04348026,0.0010970834,0.08951656],"study_design_scores_gemma":[0.000024771223,0.00049503293,0.005603283,0.000065177395,0.00013618094,0.0011410688,0.00016338316,0.9667236,0.0168937,0.0072722295,0.001451666,0.000029873929],"about_ca_topic_score_codex":0.00061053503,"about_ca_topic_score_gemma":0.0003898959,"teacher_disagreement_score":0.001600607,"about_ca_system_score_codex":0.00076404476,"about_ca_system_score_gemma":0.00029214504,"threshold_uncertainty_score":0.008464932},"labels":[],"label_agreement":null},{"id":"W2151666722","doi":"10.1109/wimob.2006.1696399","title":"A Low-Maintenance Energy-Aware Clustering Algorithm for Wireless Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Beacon; Cluster analysis; Computer science; Wireless ad hoc network; Stability (learning theory); Cluster (spacecraft); Energy consumption; Computer network; Algorithm; Wireless sensor network; Mobile ad hoc network; Energy (signal processing); Wireless; Distributed computing; Mathematics; Engineering; Network packet; Telecommunications; Artificial intelligence; Electrical engineering","score_opus":0.006360117410956887,"score_gpt":0.20682535112784842,"score_spread":0.20046523371689154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151666722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008129458,0.0007026746,0.98745245,0.000295697,0.00019542682,0.00022955974,0.000073826246,0.0011864319,0.0017344307],"genre_scores_gemma":[0.11590769,0.00064002874,0.8761813,0.0002483627,0.00012570455,0.00036592144,0.00047781193,0.0001620266,0.0058911266],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.00010371996,0.000037777598,0.00011639793,0.0002988849,0.000036360656],"domain_scores_gemma":[0.99921143,0.00014823684,0.00010246076,0.00012129145,0.0003672776,0.00004940259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006935598,0.00078754814,0.00093033694,0.001216822,0.0017480172,0.0007561348,0.0022440304,0.0012946418,0.0012056251],"category_scores_gemma":[0.002241493,0.0003599634,0.0005440652,0.0017256201,0.00044769997,0.0013749046,0.0009831131,0.0011182602,0.0010807888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021418631,0.00022545263,0.001731173,0.0003021845,0.00014887574,0.00016206023,0.00026947478,0.16925953,0.02385712,0.014453503,0.014945876,0.77443063],"study_design_scores_gemma":[0.000113017,0.00034740052,0.0015125683,0.000041650288,0.00009955545,0.0007474689,0.00009200317,0.9300269,0.016095864,0.010670653,0.040148295,0.00010469703],"about_ca_topic_score_codex":0.003447306,"about_ca_topic_score_gemma":0.0064114016,"teacher_disagreement_score":0.003447306,"about_ca_system_score_codex":0.0008572976,"about_ca_system_score_gemma":0.0012423706,"threshold_uncertainty_score":0.0068544745},"labels":[],"label_agreement":null},{"id":"W2151891176","doi":"10.1109/fgcn.2008.17","title":"Geographic Routing in Wireless Multimedia Sensor Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Geographic routing; Computer science; Computer network; Routing (electronic design automation); Multipath routing; Greedy algorithm; Static routing; Wireless sensor network; Dynamic Source Routing; Policy-based routing; Distributed computing; Routing protocol; Algorithm","score_opus":0.012806049180136253,"score_gpt":0.21616992207885605,"score_spread":0.2033638728987198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151891176","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025650337,0.015953675,0.94403595,0.0012736307,0.0006498775,0.00013722455,0.000119005446,0.0008872943,0.011293039],"genre_scores_gemma":[0.57132804,0.018014316,0.40085015,0.0005053389,0.0006278273,0.00022549323,0.00035496402,0.00008448343,0.008009486],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997391,0.00009568075,0.00001678256,0.000038250677,0.00008960251,0.000020571602],"domain_scores_gemma":[0.9998179,0.00006550789,0.000028010818,0.000031371674,0.000046022567,0.0000111670815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045906473,0.00033487155,0.0002818373,0.0006427431,0.00038791797,0.0006234917,0.00065859983,0.0005168671,0.0008140047],"category_scores_gemma":[0.000751272,0.00014051454,0.00022399395,0.0012227335,0.0003435025,0.0011960702,0.00052560563,0.00027016603,0.00021257417],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011481232,0.000037243688,0.0014836432,0.00066556444,0.00009111812,0.00058283936,0.00017715264,0.20870997,0.015030084,0.20108333,0.013184937,0.55883926],"study_design_scores_gemma":[0.00003926406,0.00019992719,0.0010673654,0.00009109783,0.000095612195,0.0009425217,0.00027359492,0.7326964,0.0106610805,0.1331078,0.12076368,0.00006167174],"about_ca_topic_score_codex":0.0014447668,"about_ca_topic_score_gemma":0.0017071961,"teacher_disagreement_score":0.0014447668,"about_ca_system_score_codex":0.00045609957,"about_ca_system_score_gemma":0.00037740596,"threshold_uncertainty_score":0.0033091903},"labels":[],"label_agreement":null},{"id":"W2151979065","doi":"10.1109/qshine.2005.9","title":"Admission Control with Load Balancing in IEEE 802.11-Based ESS Mesh Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Admission control; Computer science; Computer network; Blocking (statistics); IEEE 802.11s; Mesh networking; Wireless mesh network; Connection (principal bundle); IEEE 802; Scheme (mathematics); Load balancing (electrical power); Path (computing); Shared mesh; Distributed computing; Wireless network; Engineering; Wireless; Telecommunications; Quality of service; Grid; Mathematics","score_opus":0.005898521449718558,"score_gpt":0.21511358244057133,"score_spread":0.20921506099085277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151979065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16857767,0.0010200369,0.8221126,0.0005333081,0.00011108975,0.00004918608,0.000020359987,0.0003183617,0.007257363],"genre_scores_gemma":[0.98775685,0.00023951233,0.010929228,0.000042716038,0.000081866354,0.000026154232,0.000009974076,0.000011069162,0.00090265065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839455,0.000665469,0.00007457673,0.00012653017,0.0005261279,0.0002126427],"domain_scores_gemma":[0.9970853,0.0019089394,0.00037505638,0.00019227678,0.00034549503,0.00009300975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018897635,0.00037791397,0.00045297583,0.00051517604,0.0005608786,0.0011199382,0.0010712434,0.00072476605,0.00070209947],"category_scores_gemma":[0.0071205255,0.00025242416,0.00024081777,0.0006426537,0.0010911828,0.0020622753,0.0010556802,0.0007272855,0.00009763344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016931619,0.00009381532,0.002208449,0.000072074836,0.000040290364,0.00019315541,0.00031752192,0.8731543,0.010377762,0.059223767,0.0007522035,0.053397372],"study_design_scores_gemma":[0.000005682826,0.00002018412,0.0001757423,0.0000034003551,0.0000062006293,0.00002127355,0.000023282459,0.99121946,0.0009952578,0.0070588985,0.00046540637,0.0000051919583],"about_ca_topic_score_codex":0.002392234,"about_ca_topic_score_gemma":0.0012076688,"teacher_disagreement_score":0.002392234,"about_ca_system_score_codex":0.0010069468,"about_ca_system_score_gemma":0.00059551856,"threshold_uncertainty_score":0.009994149},"labels":[],"label_agreement":null},{"id":"W2152003941","doi":"10.1109/glocom.2006.655","title":"WLC07-5: The Effects of Mobility on the Bit Error Rate Performance of Ad Hoc Wireless Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless ad hoc network; Rician fading; Computer science; Bit error rate; Node (physics); Computer network; Waypoint; Mobility model; Mobile ad hoc network; Transmission (telecommunications); Fading; Wireless; Real-time computing; Channel (broadcasting); Telecommunications; Network packet; Physics","score_opus":0.006192139619971153,"score_gpt":0.2025820259056817,"score_spread":0.19638988628571055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152003941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18919379,0.019560104,0.74433166,0.0021662356,0.0010997008,0.0002402342,0.00057968684,0.0031103783,0.039718196],"genre_scores_gemma":[0.9261794,0.007529465,0.052952774,0.00031546675,0.00038376232,0.00019177505,0.0006561922,0.00047290424,0.011318264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972486,0.0009177219,0.000096600226,0.00013846056,0.0013513806,0.0002472916],"domain_scores_gemma":[0.9941554,0.0028632325,0.00044415452,0.0005508999,0.0018775872,0.00010859861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002337321,0.0011820951,0.0008666517,0.0014520619,0.0006098755,0.001558142,0.0009969999,0.0013160382,0.002041586],"category_scores_gemma":[0.010546437,0.00035031902,0.00041473896,0.0017488712,0.00097340136,0.0017126952,0.0007614412,0.00094242336,0.0012938947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066210655,0.0002473563,0.006021361,0.0006237754,0.00025991572,0.0010631456,0.00020359816,0.66583663,0.0411531,0.058987625,0.02325551,0.20168586],"study_design_scores_gemma":[0.000022867938,0.0004196476,0.0016961118,0.00007454295,0.000058854283,0.0006768116,0.000040663104,0.9563131,0.023282837,0.0074786344,0.009888064,0.000047903253],"about_ca_topic_score_codex":0.002466137,"about_ca_topic_score_gemma":0.002437258,"teacher_disagreement_score":0.002466137,"about_ca_system_score_codex":0.0013128802,"about_ca_system_score_gemma":0.0008326767,"threshold_uncertainty_score":0.012361109},"labels":[],"label_agreement":null},{"id":"W2152075021","doi":"10.1109/glocomw.2010.5700108","title":"Fault-tolerant and scalable channel assignment for multi-radio multi-channel IEEE 802.11a-based wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless mesh network; Computer network; Scalability; Mesh networking; Distributed computing; Wireless network; Switched mesh; Channel (broadcasting); Bandwidth (computing); Order One Network Protocol; Wireless; Fault tolerance; Telecommunications","score_opus":0.02614510409378635,"score_gpt":0.254920650497174,"score_spread":0.22877554640338765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152075021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075398676,0.000845594,0.9208055,0.00026947664,0.00015034982,0.00007036579,0.000047684407,0.00092998217,0.0014824129],"genre_scores_gemma":[0.8830571,0.00027710712,0.1152993,0.000060551876,0.00009470909,0.00011506836,0.00008732952,0.00004475644,0.0009640742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994747,0.00017326481,0.000025184925,0.00007713167,0.00016914835,0.00008064981],"domain_scores_gemma":[0.9986526,0.0006510101,0.00019984032,0.00024827776,0.00015846708,0.000089762776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010269593,0.00037621768,0.00032122823,0.0004962393,0.00067460473,0.00057747605,0.0009170639,0.0004334854,0.0011866541],"category_scores_gemma":[0.003583092,0.00015607133,0.00020674808,0.0004952722,0.000697797,0.0011745157,0.00072019844,0.00067334744,0.00020454494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035976016,0.00014831348,0.001347913,0.00017519355,0.000047514182,0.00020032245,0.0001569013,0.717328,0.030329728,0.038538195,0.004191399,0.20717677],"study_design_scores_gemma":[0.000023595276,0.000083693296,0.00019933755,0.0000051917477,0.000006916909,0.000050758,0.000020784031,0.9874177,0.0034447596,0.0074926624,0.001244512,0.000010158795],"about_ca_topic_score_codex":0.0012359981,"about_ca_topic_score_gemma":0.0012593265,"teacher_disagreement_score":0.0012359981,"about_ca_system_score_codex":0.00043351782,"about_ca_system_score_gemma":0.0007015607,"threshold_uncertainty_score":0.0054311156},"labels":[],"label_agreement":null},{"id":"W2152166852","doi":"10.1109/aiccsa.2006.205147","title":"Efficient Service Discovery forWireless Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"IEEE International Conference on Computer Systems and Applications, 2006.","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Service discovery; Computer network; Vehicular ad hoc network; Mobile computing; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; World Wide Web; Telecommunications; Web service; Wireless","score_opus":0.01705280237716733,"score_gpt":0.2536467305527304,"score_spread":0.23659392817556307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152166852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058450844,0.0033011124,0.9290425,0.0011994414,0.00029067718,0.00025284596,0.00021199715,0.0017105566,0.00554005],"genre_scores_gemma":[0.81530875,0.0014780244,0.17404215,0.00016368862,0.00022387196,0.00015843016,0.00062441843,0.000119020486,0.007881752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.00051764067,0.00014013762,0.0001853493,0.00078730535,0.00029493953],"domain_scores_gemma":[0.9967349,0.001770455,0.00025491722,0.00057590444,0.0005058984,0.00015786622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020484983,0.00046821515,0.0010029523,0.0014845012,0.0011746733,0.001772503,0.0013736502,0.0008618639,0.0017227632],"category_scores_gemma":[0.0067943777,0.0005358789,0.0003069891,0.0013104952,0.00070351403,0.0028310379,0.0019422522,0.0010175258,0.00063810736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014538859,0.00036444544,0.0025404715,0.0004098942,0.00014655998,0.00033539403,0.00041081777,0.16475344,0.02986612,0.10337313,0.018806241,0.6775396],"study_design_scores_gemma":[0.000070751776,0.00013544335,0.00037389676,0.000018036875,0.000035674413,0.00022669305,0.0001004014,0.9278461,0.006011298,0.057767652,0.0073953867,0.000018755687],"about_ca_topic_score_codex":0.001849431,"about_ca_topic_score_gemma":0.0031524894,"teacher_disagreement_score":0.0020484983,"about_ca_system_score_codex":0.0009969604,"about_ca_system_score_gemma":0.0015139731,"threshold_uncertainty_score":0.010833621},"labels":[],"label_agreement":null},{"id":"W2152547455","doi":"10.1109/wimob.2008.21","title":"A Moderate to Robust Game Theoretical Model for Intrusion Detection in MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Intrusion detection system; Computer science; Bayesian game; Node (physics); Resource (disambiguation); Computer security; Game theory; Resource consumption; Energy consumption; Consumption (sociology); Mode (computer interface); Bayesian probability; Computer network; Sequential game; Artificial intelligence; Mathematics; Engineering","score_opus":0.022822046739494336,"score_gpt":0.23479837977326876,"score_spread":0.21197633303377442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152547455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015778882,0.00026509617,0.96877253,0.0007902524,0.00008947887,0.00016808373,0.00019027211,0.00011552567,0.013829884],"genre_scores_gemma":[0.88292235,0.00088726537,0.09604952,0.0004949406,0.0001540321,0.0008257263,0.00019651878,0.00004508566,0.018424613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980033,0.00095624133,0.00007029695,0.00032442607,0.00039841546,0.00024733625],"domain_scores_gemma":[0.99818915,0.0010836133,0.00025343223,0.00007618295,0.00022862351,0.00016897767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019513634,0.0015975222,0.0014207629,0.000836107,0.00070828537,0.0022258856,0.0030745978,0.0021584807,0.0048869173],"category_scores_gemma":[0.0047178003,0.0005462781,0.0009616704,0.0010566702,0.0023330862,0.0027132793,0.0015011058,0.0022169056,0.0008192417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009816067,0.00008589975,0.00035451681,0.00012341555,0.000053203723,0.00029165373,0.00020775532,0.57254004,0.0015679585,0.4165689,0.0017736258,0.006334805],"study_design_scores_gemma":[0.000031851516,0.00005468917,0.00007282129,0.000009037023,0.000011959479,0.0000408771,0.000031593943,0.9195017,0.00011383558,0.07898336,0.0011298764,0.000018360273],"about_ca_topic_score_codex":0.005573542,"about_ca_topic_score_gemma":0.0038787075,"teacher_disagreement_score":0.005573542,"about_ca_system_score_codex":0.0025752394,"about_ca_system_score_gemma":0.0015555781,"threshold_uncertainty_score":0.018684685},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.028573412772905905,"score_gpt":0.29935406266511017,"score_spread":0.27078064989220424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152683746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013181132,0.00029596573,0.98466474,0.00011998444,0.000027315415,0.00006949514,0.000023569062,0.00042417902,0.0011936415],"genre_scores_gemma":[0.24054037,0.00053440395,0.7559516,0.00011894441,0.00004944378,0.0002673419,0.00016597651,0.0000744536,0.0022974294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994892,0.0001542358,0.000028719527,0.000078895704,0.00020598937,0.000042911626],"domain_scores_gemma":[0.9991497,0.00044738353,0.00012883205,0.00007599911,0.00016982721,0.000028180986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009527779,0.0007900203,0.00066177594,0.0007704951,0.0007018302,0.00063547556,0.0016612705,0.000685201,0.00090232753],"category_scores_gemma":[0.0029136285,0.00037422223,0.0002824024,0.0010882637,0.0007327334,0.0015586999,0.0009407166,0.0007190573,0.00029693867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093163675,0.00005565663,0.0007864135,0.00006488842,0.00003124684,0.00003467429,0.00011683125,0.81093925,0.002070236,0.026949115,0.001827355,0.15703127],"study_design_scores_gemma":[0.000017370074,0.00004578343,0.00009718787,0.0000044089556,0.0000049085547,0.000019471783,0.00002081292,0.9880314,0.00070987665,0.010298659,0.0007447336,0.000005414669],"about_ca_topic_score_codex":0.0024840555,"about_ca_topic_score_gemma":0.0037647574,"teacher_disagreement_score":0.0024840555,"about_ca_system_score_codex":0.0012381149,"about_ca_system_score_gemma":0.0011522213,"threshold_uncertainty_score":0.008983135},"labels":[],"label_agreement":null},{"id":"W2152729060","doi":"10.1109/pimrc.2008.4699725","title":"An achievable capacity for hierarchical multicast ad hoc networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Multicast; Computer science; Computer network; Wireless ad hoc network; Throughput; Distributed computing; Geocast; Optimized Link State Routing Protocol; Routing (electronic design automation); Mobile ad hoc network; Routing protocol; Wireless; Network packet","score_opus":0.03140329988080966,"score_gpt":0.2557388514577241,"score_spread":0.22433555157691448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152729060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11626026,0.0011096487,0.85907817,0.00057820027,0.0000650484,0.00009786626,0.000236334,0.00068656175,0.021887919],"genre_scores_gemma":[0.97265416,0.0005387371,0.025070105,0.00008141202,0.000049031496,0.00018750755,0.000094973104,0.00006129657,0.0012627818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827015,0.0004703033,0.000053234966,0.0001361642,0.00077561947,0.00029445314],"domain_scores_gemma":[0.99341416,0.004887121,0.00037560228,0.00052642584,0.0006319367,0.0001647092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019701247,0.00080074184,0.00057007413,0.001098907,0.0010523405,0.0015423144,0.0010330614,0.0008387216,0.0020868895],"category_scores_gemma":[0.013621874,0.0003637149,0.00038011186,0.0010615132,0.0015614891,0.0019076683,0.0015250513,0.0009565541,0.00040787747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014265609,0.000067124536,0.00063559605,0.00037625365,0.00004473693,0.00033328825,0.00036701743,0.5238635,0.028215246,0.4166936,0.0019185642,0.027342472],"study_design_scores_gemma":[0.000014075293,0.00007195757,0.00025430042,0.00005632469,0.00001989974,0.00017948018,0.00007659624,0.8461486,0.00959572,0.1411815,0.0023763112,0.00002527582],"about_ca_topic_score_codex":0.0008116358,"about_ca_topic_score_gemma":0.00042516194,"teacher_disagreement_score":0.0020868895,"about_ca_system_score_codex":0.0014844149,"about_ca_system_score_gemma":0.0007952721,"threshold_uncertainty_score":0.010770202},"labels":[],"label_agreement":null},{"id":"W2152960680","doi":"10.1016/j.comcom.2004.07.019","title":"An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Mobile ad hoc network; Node (physics); Wireless Routing Protocol; Computer security; Routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.02131202181975967,"score_gpt":0.30161222326954323,"score_spread":0.28030020144978357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152960680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024820516,0.00064392213,0.9650073,0.0004960167,0.00050339167,0.00042312287,0.00015978231,0.0023569905,0.0055889892],"genre_scores_gemma":[0.48767877,0.0008593598,0.49218044,0.00031544376,0.00030125814,0.0005960613,0.00059118925,0.00030831262,0.017169075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820006,0.0003872119,0.00013963039,0.00012698078,0.0009989974,0.000147161],"domain_scores_gemma":[0.997672,0.0007115282,0.00019860647,0.00081948505,0.0004959805,0.000102368096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019007716,0.0006100089,0.00092149904,0.0008838523,0.0015461589,0.0013570104,0.0017659914,0.0009806458,0.0018866945],"category_scores_gemma":[0.0034408679,0.0004537299,0.0005280408,0.00075786107,0.00097647775,0.0028380922,0.0031401718,0.0013268271,0.00092582277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001620269,0.00048393774,0.0009474752,0.0004701449,0.00018447572,0.0009912783,0.0004945459,0.16530044,0.055652317,0.2716492,0.025430663,0.47677532],"study_design_scores_gemma":[0.00029604093,0.00040363017,0.00043023858,0.000045851953,0.00020664858,0.0007560924,0.00013443854,0.8143558,0.025168447,0.111719385,0.046367534,0.00011592974],"about_ca_topic_score_codex":0.00069278036,"about_ca_topic_score_gemma":0.0017047874,"teacher_disagreement_score":0.0019007716,"about_ca_system_score_codex":0.0007476852,"about_ca_system_score_gemma":0.0016480521,"threshold_uncertainty_score":0.010052383},"labels":[],"label_agreement":null},{"id":"W2152964432","doi":"10.1109/rttas.2004.1317247","title":"FAIR: fee arbitrated incentive architecture in wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Wireless ad hoc network; Incentive; Computer science; Relay; Throughput; Wireless network; Wireless; Vehicular ad hoc network; Protocol (science); Telecommunications; Microeconomics; Economics","score_opus":0.006232819693949206,"score_gpt":0.21033943022658294,"score_spread":0.20410661053263374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152964432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032483723,0.0010375347,0.9577285,0.0006792276,0.00027275414,0.00035816082,0.000107534666,0.0011549286,0.0061775767],"genre_scores_gemma":[0.71393925,0.00081989815,0.2783881,0.00021249194,0.00012665153,0.00038314905,0.00010911695,0.000080624166,0.0059406254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885905,0.00042387357,0.00006910294,0.000114812145,0.00038767915,0.00014555918],"domain_scores_gemma":[0.9983851,0.0007456682,0.00013657578,0.00022141477,0.00035966697,0.00015159573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035285018,0.0005389176,0.00061673054,0.0007350435,0.0016545721,0.0017486904,0.002010476,0.0013142282,0.0024500228],"category_scores_gemma":[0.00712964,0.00039767195,0.0004147178,0.0009337185,0.001734014,0.0037431205,0.0012337122,0.001350016,0.0002796148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040643054,0.00021692176,0.0013687864,0.00017321465,0.00006308143,0.0002790672,0.00043610993,0.43590596,0.007087852,0.44299275,0.0057199695,0.10534998],"study_design_scores_gemma":[0.00013970115,0.0002363108,0.00032003724,0.000029981637,0.000040136092,0.00013299749,0.000044707842,0.81229925,0.003866895,0.16638412,0.016446274,0.00005960093],"about_ca_topic_score_codex":0.0055699437,"about_ca_topic_score_gemma":0.0040118573,"teacher_disagreement_score":0.0055699437,"about_ca_system_score_codex":0.0017411794,"about_ca_system_score_gemma":0.0026271932,"threshold_uncertainty_score":0.018660724},"labels":[],"label_agreement":null},{"id":"W2153083381","doi":"10.1145/1163653.1163660","title":"An efficient management algorithm for clustering in mobile ad hoc network","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Cluster analysis; Computer science; Weighting; Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Algorithm; Computer network; Data mining; Artificial intelligence; Wireless","score_opus":0.006579370840289864,"score_gpt":0.23337195319261597,"score_spread":0.2267925823523261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153083381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063146376,0.00028833217,0.9915325,0.00011480135,0.00004939452,0.000116780146,0.000021424952,0.0004792938,0.0010828151],"genre_scores_gemma":[0.15981264,0.00034835763,0.83636785,0.00009256439,0.00006271122,0.00027539543,0.00017532449,0.00006125846,0.0028039867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942577,0.00015439112,0.000037763835,0.0001052594,0.00022847993,0.0000482946],"domain_scores_gemma":[0.99945647,0.00012295562,0.00007845338,0.0000969588,0.00022151228,0.00002368826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088615436,0.00053419435,0.0005122977,0.00094751746,0.0009872678,0.00073870126,0.0013027969,0.00087267515,0.0008855712],"category_scores_gemma":[0.0015786445,0.000297095,0.000261425,0.0012882383,0.00051123527,0.0015969146,0.00074482494,0.000805134,0.00047449183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011068626,0.00014540127,0.0011734569,0.0002089344,0.0000789281,0.00008948571,0.00024023562,0.21123351,0.027944446,0.053834893,0.0070999432,0.69784003],"study_design_scores_gemma":[0.000035801386,0.00014084249,0.0005650455,0.000018499584,0.000027198517,0.00025718703,0.000078502424,0.947999,0.0142155355,0.014835923,0.021786977,0.000039643943],"about_ca_topic_score_codex":0.0018127302,"about_ca_topic_score_gemma":0.0023673095,"teacher_disagreement_score":0.0018127302,"about_ca_system_score_codex":0.00075434207,"about_ca_system_score_gemma":0.0009909463,"threshold_uncertainty_score":0.005473137},"labels":[],"label_agreement":null},{"id":"W2153360118","doi":"10.4236/wsn.2009.15049","title":"An Energy-Efficient MAC Protocol for Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"Wireless Sensor Network","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Network allocation vector; IEEE 802.11s; Multiple Access with Collision Avoidance for Wireless; Throughput; Wireless ad hoc network; Optimized Link State Routing Protocol; IEEE 802.1X; IEEE 802.11; Inter-Access Point Protocol; Wireless network; Distributed computing; Wireless; Routing protocol; Telecommunications; Wi-Fi; Network packet; Wireless mesh network","score_opus":0.013678220243082248,"score_gpt":0.2708562068048754,"score_spread":0.25717798656179314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153360118","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001396021,0.018746762,0.95849144,0.0008517745,0.0018814005,0.0007139006,0.00031528494,0.0024184794,0.015185038],"genre_scores_gemma":[0.09535025,0.028250523,0.83625877,0.0026285779,0.00216686,0.0048492886,0.0021763076,0.0005049587,0.027814465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974734,0.0007355689,0.0002291677,0.00021181899,0.0012316921,0.00011837586],"domain_scores_gemma":[0.99876356,0.00039920237,0.00018399385,0.00017719895,0.00042055926,0.00005558531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014341112,0.0014620919,0.001250989,0.0013332182,0.0012319988,0.0016353428,0.003088692,0.0018152006,0.004405951],"category_scores_gemma":[0.0034305512,0.00049214833,0.0006512034,0.002319537,0.0009797105,0.0027925437,0.0019122635,0.0029764443,0.0035239612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029616003,0.00026691606,0.00050149555,0.0032178203,0.00037593843,0.0009778601,0.00045144072,0.041163106,0.035924196,0.22372188,0.12778604,0.56531715],"study_design_scores_gemma":[0.00014891881,0.00044754345,0.0004821269,0.00058343756,0.0001905351,0.0023061852,0.00010909523,0.14393957,0.015235611,0.0613839,0.77495986,0.00021327243],"about_ca_topic_score_codex":0.00063990336,"about_ca_topic_score_gemma":0.00087866094,"teacher_disagreement_score":0.004405951,"about_ca_system_score_codex":0.00067403214,"about_ca_system_score_gemma":0.0010965739,"threshold_uncertainty_score":0.014739335},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.009531872383462547,"score_gpt":0.21650163505795017,"score_spread":0.20696976267448763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153410375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039170766,0.0030101587,0.9891095,0.0001879294,0.00015016126,0.00010839449,0.000024984332,0.00065420574,0.002837591],"genre_scores_gemma":[0.18997559,0.007265182,0.7984392,0.00023079198,0.00024314917,0.0004420167,0.00016000832,0.00015264838,0.0030915148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00033461707,0.000057208737,0.00014227655,0.0004218145,0.000048095906],"domain_scores_gemma":[0.9988249,0.0005442994,0.00013741243,0.00015694892,0.00028765452,0.000048778693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069458876,0.0008176149,0.0008469599,0.0011584768,0.0008825866,0.0006692969,0.0013047241,0.001250616,0.0025086745],"category_scores_gemma":[0.0032043213,0.0004622113,0.0006765398,0.003459803,0.0008099137,0.001201188,0.0017556929,0.00114291,0.0010747766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110955894,0.00008328333,0.0016987321,0.0011464407,0.00008305799,0.0005791963,0.00054301496,0.32822886,0.016676046,0.048900716,0.0088492045,0.5931005],"study_design_scores_gemma":[0.00003332702,0.00016621021,0.00047209652,0.00011515099,0.00004282001,0.0006342244,0.00020488258,0.8970006,0.007860844,0.044076953,0.049344663,0.00004822149],"about_ca_topic_score_codex":0.00158843,"about_ca_topic_score_gemma":0.001248657,"teacher_disagreement_score":0.0025086745,"about_ca_system_score_codex":0.00050593977,"about_ca_system_score_gemma":0.0005098121,"threshold_uncertainty_score":0.008392334},"labels":[],"label_agreement":null},{"id":"W2153460996","doi":"10.1109/ipdps.2002.1016539","title":"A hybrid randomized initialization protocol for TDMA in single-hop wireless networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Nortel (Canada)","funders":"","keywords":"Initialization; Time division multiple access; Computer science; Partition (number theory); Binary number; Algorithm; Computer network; Protocol (science); Hop (telecommunications); Distributed computing; Real-time computing; Mathematics; Combinatorics","score_opus":0.03368632825693607,"score_gpt":0.26944210112744527,"score_spread":0.2357557728705092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153460996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013911984,0.00024226491,0.9836404,0.00008825815,0.0000693953,0.00017454245,0.000027756701,0.0005840305,0.0012613543],"genre_scores_gemma":[0.39783442,0.00025251412,0.5975597,0.00014066999,0.000079645084,0.0007040066,0.00018055581,0.00010500307,0.0031434481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982179,0.00076520495,0.00009692032,0.00023445649,0.0005203867,0.00016515027],"domain_scores_gemma":[0.9976457,0.0010913427,0.00027610784,0.0005229413,0.00034375288,0.00012019759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022306417,0.0005326848,0.00061608193,0.0006402886,0.0008548672,0.0009172505,0.0019993207,0.0007737181,0.0012865878],"category_scores_gemma":[0.0047472767,0.00042703914,0.00041754876,0.00068327703,0.0010803348,0.001552995,0.0014581493,0.0012121241,0.0004707203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012807293,0.00038901024,0.0013979415,0.0003807332,0.00016428994,0.0002986657,0.00038140075,0.3717595,0.09189543,0.24971768,0.004951607,0.277383],"study_design_scores_gemma":[0.00016953747,0.00035290487,0.00022935835,0.000024267327,0.000043103213,0.00020777927,0.000023577517,0.9519047,0.022440778,0.01748489,0.0070510907,0.00006799141],"about_ca_topic_score_codex":0.0009430396,"about_ca_topic_score_gemma":0.0011963705,"teacher_disagreement_score":0.0022306417,"about_ca_system_score_codex":0.0010176847,"about_ca_system_score_gemma":0.001486333,"threshold_uncertainty_score":0.011796892},"labels":[],"label_agreement":null},{"id":"W2153799035","doi":"10.1109/icw.2005.22","title":"Advanced Mobility Models for Ad Hoc Network Simulations","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Mobility model; Computer science; Animation; Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Computer network; Computer graphics (images); Wireless; Telecommunications","score_opus":0.02099696252417899,"score_gpt":0.2706906879725744,"score_spread":0.2496937254483954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153799035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002261362,0.0017411364,0.98383003,0.00030824495,0.00038384798,0.00014828522,0.0008347494,0.0022123596,0.008280081],"genre_scores_gemma":[0.11575651,0.008632873,0.844671,0.0002656148,0.0005104628,0.0016041829,0.0044554365,0.0011891758,0.022914758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921,0.0002597875,0.00006270261,0.000068453744,0.00034737028,0.000051793104],"domain_scores_gemma":[0.9988186,0.00046090028,0.000083376595,0.00020584409,0.00036271324,0.00006863541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007944911,0.0012246269,0.0010760111,0.0010382882,0.0005415056,0.0013113,0.0022408606,0.0016432593,0.008976491],"category_scores_gemma":[0.0037751873,0.0007085206,0.0010907089,0.0016034701,0.00033251234,0.0020159176,0.0013742776,0.002356515,0.005705523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000849686,0.000073846146,0.00056122395,0.0003965346,0.000088266024,0.00029209084,0.00016917742,0.75268614,0.004640871,0.12541054,0.019439952,0.09615639],"study_design_scores_gemma":[0.00003703149,0.000031553027,0.0001118541,0.00007030532,0.000020930394,0.000107569955,0.00001931139,0.891284,0.00095591485,0.040556457,0.066779576,0.000025454452],"about_ca_topic_score_codex":0.0025892179,"about_ca_topic_score_gemma":0.0018980047,"teacher_disagreement_score":0.008976491,"about_ca_system_score_codex":0.00060671347,"about_ca_system_score_gemma":0.0008104545,"threshold_uncertainty_score":0.030029356},"labels":[],"label_agreement":null},{"id":"W2153993559","doi":"10.1109/hicss.2003.1174846","title":"Increasing packet delivery ratio in DSR by link prediction","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DSRFLOW; Computer science; Computer network; Network packet; Routing protocol; Latency (audio); Node (physics); Throughput; Source routing; Packet loss; Real-time computing; Dynamic Source Routing; Wireless; Engineering; Telecommunications","score_opus":0.008313945752097316,"score_gpt":0.20501603097167756,"score_spread":0.19670208521958024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153993559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3819235,0.0054210876,0.59156376,0.00076574215,0.00029457654,0.00022476415,0.00026877975,0.0074489005,0.012088912],"genre_scores_gemma":[0.89496195,0.0012629227,0.10055688,0.00017830005,0.00008255018,0.00009925549,0.00024591543,0.00014237624,0.002469873],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987062,0.00030724137,0.00006301151,0.0002026261,0.00057855184,0.00014237396],"domain_scores_gemma":[0.99744415,0.0011691072,0.0002469856,0.0004899948,0.00055274187,0.000097044336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447103,0.0009594566,0.00078408484,0.0015548266,0.00048809574,0.0006859828,0.0013043042,0.00080870365,0.0010289404],"category_scores_gemma":[0.005256996,0.0003565054,0.00023660797,0.0010160896,0.00041085872,0.0019538214,0.00087696133,0.00074864767,0.0007503093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008946143,0.00041024847,0.0079734735,0.00038838247,0.000111276415,0.00047240342,0.00028632203,0.22547998,0.11717165,0.0092416145,0.004385584,0.63318443],"study_design_scores_gemma":[0.00008057227,0.0010894759,0.0029080734,0.000035990943,0.000089971305,0.000937633,0.00008727081,0.9178042,0.062806435,0.006074825,0.00801824,0.00006725923],"about_ca_topic_score_codex":0.0014264855,"about_ca_topic_score_gemma":0.0014084338,"teacher_disagreement_score":0.0017447103,"about_ca_system_score_codex":0.0006143537,"about_ca_system_score_gemma":0.00042670587,"threshold_uncertainty_score":0.009227037},"labels":[],"label_agreement":null},{"id":"W2154302286","doi":"10.1109/icc.2004.1313245","title":"Position-aided on demand routing protocol for wireless ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Flooding (psychology); Computer network; Routing protocol; Wireless ad hoc network; Overhead (engineering); Routing (electronic design automation); Distributed computing; Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.01692709049735114,"score_gpt":0.27868401008356186,"score_spread":0.2617569195862107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154302286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006843207,0.001807338,0.9787417,0.00063891016,0.00045736725,0.00035648007,0.00015989413,0.0012158027,0.0097793685],"genre_scores_gemma":[0.31489405,0.0046513607,0.65570253,0.00088122726,0.00049655547,0.0013932565,0.0014418769,0.0002638882,0.020275299],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929714,0.00018905142,0.000046665078,0.00006929074,0.0003412933,0.00005652455],"domain_scores_gemma":[0.9994149,0.00015082669,0.00006463269,0.0001412808,0.00019138894,0.000037127993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656614,0.0005132161,0.0004870001,0.00050012534,0.00072118366,0.0009552171,0.0014152682,0.0006798449,0.0019361695],"category_scores_gemma":[0.0014310163,0.0002566947,0.0003105054,0.00065426464,0.00050743844,0.001123167,0.0010404612,0.0009204895,0.0012393709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034745637,0.00021546033,0.0011714036,0.0011422852,0.00013070124,0.0008114028,0.0004055759,0.059971135,0.09004898,0.17312327,0.035415422,0.6372168],"study_design_scores_gemma":[0.00017474938,0.00095806696,0.00109323,0.00011621641,0.00015856157,0.0020344695,0.0002412066,0.5529192,0.036016364,0.06854474,0.33758962,0.00015355833],"about_ca_topic_score_codex":0.00076647825,"about_ca_topic_score_gemma":0.0014474487,"teacher_disagreement_score":0.0019361695,"about_ca_system_score_codex":0.00052881497,"about_ca_system_score_gemma":0.0007169696,"threshold_uncertainty_score":0.0064771175},"labels":[],"label_agreement":null},{"id":"W2154354324","doi":"10.1109/mdm.2006.29","title":"Ad-Hoc Collaboration Between Messengers: Operations and Incentives","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; World Wide Web; Web service; Wireless ad hoc network; Computer network; Telecommunications; Wireless","score_opus":0.007865597806315976,"score_gpt":0.23833924266038456,"score_spread":0.23047364485406857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154354324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21442087,0.0017957177,0.4188124,0.017287003,0.000573265,0.00068878196,0.00015788156,0.0004925898,0.34577143],"genre_scores_gemma":[0.9611139,0.000517672,0.017999839,0.00046862234,0.00029692153,0.0003310501,0.000032681914,0.000050543105,0.019188639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936293,0.0035396584,0.00021479384,0.0006313509,0.0012066567,0.0007783224],"domain_scores_gemma":[0.9490648,0.03584815,0.004528475,0.003344509,0.002602113,0.004611955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012204941,0.00065466354,0.0006829472,0.0014358466,0.0030424641,0.005881066,0.0015661027,0.0031024637,0.013147181],"category_scores_gemma":[0.036223777,0.00060917926,0.0005020703,0.0011019134,0.002987129,0.00825024,0.004830801,0.0020707971,0.0015483814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030454222,0.00023030271,0.0046034874,0.0001745007,0.00005321103,0.00051056634,0.0016007788,0.017144356,0.003161955,0.9074139,0.004593907,0.060208473],"study_design_scores_gemma":[0.00026350812,0.0003828854,0.0020865686,0.00011330328,0.00005056794,0.0006623886,0.0018549619,0.08625081,0.0018542393,0.83947784,0.06691899,0.00008389655],"about_ca_topic_score_codex":0.0007180134,"about_ca_topic_score_gemma":0.0006817264,"teacher_disagreement_score":0.013147181,"about_ca_system_score_codex":0.0018215481,"about_ca_system_score_gemma":0.0019625588,"threshold_uncertainty_score":0.064546704},"labels":[],"label_agreement":null},{"id":"W2154601749","doi":"10.1109/percomw.2005.8","title":"A Lightweight Service Discovery Mechanism for Mobile Ad Hoc Pervasive Environment Using Cross-Layer Design","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Service discovery; Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Scalability; Overhead (engineering); Distributed computing; Service layer; Ad hoc wireless distribution service; Service (business); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Mechanism (biology); Layer (electronics); Network layer; Routing (electronic design automation); Routing protocol; Quality of service; Web service; Telecommunications; Wireless; Database; World Wide Web; Operating system","score_opus":0.03236000064353097,"score_gpt":0.26514977032322606,"score_spread":0.23278976967969509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154601749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041938545,0.00026300497,0.9921262,0.00011466662,0.00009411283,0.0001201807,0.000013679494,0.0024458468,0.0006282706],"genre_scores_gemma":[0.19858417,0.000641426,0.7950505,0.00045337706,0.00022859978,0.0004985486,0.00021717328,0.00035627844,0.0039698984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972754,0.00055678474,0.0004208487,0.00035746954,0.0011352419,0.00025431073],"domain_scores_gemma":[0.9969227,0.0007516548,0.00041778834,0.0009255763,0.0007171526,0.00026524378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050549163,0.0010252061,0.001056939,0.0015302394,0.0011325415,0.002682673,0.0036380137,0.0018652431,0.0015509747],"category_scores_gemma":[0.0051404694,0.0009905952,0.001153765,0.0007907049,0.0009838111,0.0040445398,0.0030251574,0.003031006,0.0010488613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007558457,0.00065652607,0.0024674411,0.0014411549,0.00052804686,0.0013661279,0.0013630461,0.030789925,0.20711584,0.221103,0.008751818,0.5236612],"study_design_scores_gemma":[0.00032974826,0.0012719204,0.0012769571,0.0002019272,0.0006559059,0.003369391,0.0001671236,0.6942627,0.14227544,0.048309993,0.107465625,0.0004133535],"about_ca_topic_score_codex":0.00082212157,"about_ca_topic_score_gemma":0.00065138337,"teacher_disagreement_score":0.0050549163,"about_ca_system_score_codex":0.000751446,"about_ca_system_score_gemma":0.0011937255,"threshold_uncertainty_score":0.02673328},"labels":[],"label_agreement":null},{"id":"W2154649555","doi":"10.1142/s1793830912500383","title":"STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE","year":2012,"lang":"en","type":"article","venue":"Discrete Mathematics Algorithms and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University","funders":"","keywords":"Omnidirectional antenna; Antenna (radio); Computer science; Range (aeronautics); Directional antenna; Transmission (telecommunications); Set (abstract data type); Orientation (vector space); Wireless sensor network; Bounded function; Throughput; Topology (electrical circuits); Computer network; Telecommunications; Wireless; Electrical engineering; Mathematics; Engineering; Geometry; Aerospace engineering","score_opus":0.012690487256631367,"score_gpt":0.2593403503057864,"score_spread":0.24664986304915504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154649555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07553751,0.00059865596,0.91653925,0.0008432083,0.000054020085,0.00017189239,0.00013058825,0.00034123095,0.0057836995],"genre_scores_gemma":[0.7990132,0.0013296085,0.19537729,0.00028145692,0.00010962724,0.0005041843,0.00029690022,0.00009756486,0.0029900677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977506,0.00091809186,0.00013773066,0.00044370498,0.00049047946,0.0002593848],"domain_scores_gemma":[0.98602444,0.010585742,0.0013636514,0.0009404753,0.0006317115,0.00045399784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022769473,0.0008581133,0.00080651813,0.0009157477,0.0008243588,0.0017428832,0.0016030014,0.0010926005,0.0022140257],"category_scores_gemma":[0.017711593,0.00078179437,0.0008663793,0.0013105196,0.0026747545,0.0050592204,0.0026608594,0.0018106418,0.00040515297],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045903193,0.00009810446,0.0028316383,0.0005488363,0.00007986888,0.00047694732,0.00045813646,0.7121241,0.009244759,0.2376709,0.0024009328,0.03360674],"study_design_scores_gemma":[0.000059987637,0.00025677274,0.0005471498,0.000057897996,0.00004093084,0.00030020977,0.00018262747,0.8719175,0.0023327386,0.121068485,0.0032117767,0.00002402222],"about_ca_topic_score_codex":0.00072162435,"about_ca_topic_score_gemma":0.0010457708,"teacher_disagreement_score":0.0022769473,"about_ca_system_score_codex":0.0011227016,"about_ca_system_score_gemma":0.0008771168,"threshold_uncertainty_score":0.012041748},"labels":[],"label_agreement":null},{"id":"W2154744516","doi":"10.1109/ccece.2006.277328","title":"Hybrid Position-Based 3D Routing Algorithms with Partial Flooding","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Link-state routing protocol; Static routing; Dynamic Source Routing; Flooding (psychology); Equal-cost multi-path routing; Algorithm; Wireless Routing Protocol; Zone Routing Protocol; Routing table; Multipath routing; Policy-based routing; Computer network; Geographic routing; Distributed computing; Routing (electronic design automation); Routing protocol","score_opus":0.006891157685412839,"score_gpt":0.20564176777069942,"score_spread":0.19875061008528658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154744516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018292397,0.0005141002,0.9764896,0.0001809335,0.000060748873,0.000091100104,0.000079336714,0.0020686314,0.0022231038],"genre_scores_gemma":[0.2507638,0.00065778074,0.74313223,0.00011016432,0.00006534251,0.00025671613,0.00035527884,0.0001642546,0.0044944044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992544,0.00015963895,0.00006252982,0.00009369737,0.00038648676,0.00004315786],"domain_scores_gemma":[0.9988311,0.00042289996,0.00015603786,0.00030522657,0.00023507643,0.000049742404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104997,0.00088089827,0.0009087593,0.0014708359,0.0006976218,0.0011692991,0.0019976555,0.0008866041,0.0013160801],"category_scores_gemma":[0.002431801,0.00056565594,0.00067237363,0.0011553059,0.00061068253,0.002202364,0.001805523,0.00058008614,0.0007733156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035085948,0.000101490135,0.0014925712,0.00020889804,0.00013965386,0.00015676778,0.00035717068,0.47855365,0.026034795,0.032274485,0.0036531207,0.4566766],"study_design_scores_gemma":[0.000102313876,0.00018415884,0.00037898132,0.000016341393,0.000046680376,0.00022292083,0.00006342649,0.96448874,0.011068562,0.012241643,0.011125668,0.000060615963],"about_ca_topic_score_codex":0.0029513289,"about_ca_topic_score_gemma":0.003097561,"teacher_disagreement_score":0.0029513289,"about_ca_system_score_codex":0.0005929597,"about_ca_system_score_gemma":0.0007924798,"threshold_uncertainty_score":0.0058683157},"labels":[],"label_agreement":null},{"id":"W2155002805","doi":"10.1109/icpp-w.2008.22","title":"A Novel Mobility Management Scheme for IEEE 802.11-Based Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"Proceedings - International Workshops on Parallel Processing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Mobility management; Handover; Routing (electronic design automation); IEEE 802.11s; Scheme (mathematics); Wireless ad hoc network; Network packet; Distributed computing; Wireless network; Wireless; Telecommunications","score_opus":0.030744065530090587,"score_gpt":0.27441703977821824,"score_spread":0.24367297424812764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155002805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01821452,0.0018771153,0.9674292,0.0007455087,0.0012898537,0.00032186523,0.00012370902,0.0014772458,0.00852093],"genre_scores_gemma":[0.4988775,0.0019225306,0.48063692,0.0006337587,0.00086332666,0.0007445266,0.00064904377,0.00011705672,0.015555287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954945,0.000106193955,0.00005921444,0.00006583923,0.00015947058,0.000059885253],"domain_scores_gemma":[0.9995617,0.000073884476,0.00006126535,0.00010707634,0.0001588934,0.000037256395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073579437,0.0004910181,0.00034690253,0.00064209715,0.0009215754,0.0006281512,0.0012049949,0.0007238145,0.0014567099],"category_scores_gemma":[0.0012582492,0.00017384524,0.00033064472,0.00051085046,0.00039973197,0.0018173298,0.0011605893,0.0010199671,0.0007421036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040142232,0.00021412692,0.00090660516,0.00031495036,0.00008936291,0.00059455173,0.00042383446,0.016415544,0.13546671,0.1104511,0.016519044,0.71820265],"study_design_scores_gemma":[0.0002545561,0.0013603781,0.0017164217,0.00014168274,0.0002760091,0.004150664,0.00020320682,0.5501111,0.07369008,0.042920224,0.32488078,0.0002949089],"about_ca_topic_score_codex":0.00041829975,"about_ca_topic_score_gemma":0.00068674,"teacher_disagreement_score":0.0014567099,"about_ca_system_score_codex":0.00039747995,"about_ca_system_score_gemma":0.00039695724,"threshold_uncertainty_score":0.0048731565},"labels":[],"label_agreement":null},{"id":"W2155095386","doi":"10.1109/lcn.2008.4664266","title":"Utilizing IEEE 802.11n to enhance QoS support in wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Quality of service; Wireless mesh network; Network packet; Link adaptation; Throughput; Service set; Frame (networking); Scheduling (production processes); Wireless; Wireless network; Distributed computing; Channel (broadcasting); Wi-Fi array; Telecommunications","score_opus":0.018598557810083006,"score_gpt":0.2631482667754114,"score_spread":0.2445497089653284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155095386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18555918,0.0020806086,0.79447025,0.0010756537,0.0006639531,0.00012884974,0.000043359512,0.00064268085,0.015335421],"genre_scores_gemma":[0.7794286,0.0012906097,0.2154359,0.00021829362,0.00031470155,0.00008177272,0.00011006954,0.000031995398,0.0030880335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966586,0.00012290037,0.00002891099,0.000030466861,0.00010523098,0.000046577923],"domain_scores_gemma":[0.9994578,0.00019011645,0.000067969035,0.00010017296,0.00016436174,0.000019647237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012688265,0.0002905229,0.00019126327,0.00029733783,0.00030537456,0.0006455856,0.0005335016,0.0003563754,0.00046128588],"category_scores_gemma":[0.0023183024,0.00013293997,0.0001339977,0.0003389037,0.00032669233,0.0011972175,0.00051386317,0.0004944552,0.00012154246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003754934,0.00028271836,0.011652878,0.00035413273,0.00006791708,0.00073014677,0.0003744631,0.13154584,0.16824973,0.08263124,0.006095263,0.5976402],"study_design_scores_gemma":[0.000042073334,0.00039193893,0.0038774763,0.000060949136,0.00007942241,0.0007455,0.00010266415,0.87862325,0.046874873,0.02149066,0.047660958,0.000050226365],"about_ca_topic_score_codex":0.0008550349,"about_ca_topic_score_gemma":0.0023920825,"teacher_disagreement_score":0.0012688265,"about_ca_system_score_codex":0.00028892414,"about_ca_system_score_gemma":0.00041473654,"threshold_uncertainty_score":0.006710291},"labels":[],"label_agreement":null},{"id":"W2155141687","doi":"10.1109/aina.2008.146","title":"Using Mobile Internet Gateways in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Multipath routing; Distributed computing; Dynamic Source Routing; Link-state routing protocol; Routing protocol; Policy-based routing; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.02948043992571484,"score_gpt":0.2514772727675813,"score_spread":0.22199683284186647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155141687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14517307,0.008575735,0.8291814,0.00117858,0.0004950996,0.0001884286,0.000057800233,0.0008558943,0.014293982],"genre_scores_gemma":[0.81072867,0.0059746117,0.17954814,0.000290397,0.00032855463,0.00017077845,0.000098649325,0.00005482405,0.0028053562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994941,0.00027223004,0.000024818632,0.00006062803,0.0001041788,0.000044148866],"domain_scores_gemma":[0.99948835,0.00028868488,0.00006904158,0.00008462757,0.000047482226,0.000021813898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009301198,0.0003723477,0.0003638933,0.0005371796,0.00045071307,0.0009462784,0.0007160208,0.0010079463,0.000728913],"category_scores_gemma":[0.0013456931,0.00030269017,0.00036223474,0.00079131883,0.0009200067,0.0017798626,0.00086341123,0.00049373583,0.00022204196],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041045184,0.00025931842,0.008345187,0.0007178745,0.00022608417,0.0020826075,0.00066299527,0.31277168,0.08313808,0.2759533,0.005747759,0.3096847],"study_design_scores_gemma":[0.0001323425,0.001109012,0.0030764698,0.0002064817,0.00028669494,0.0027200277,0.00042842343,0.72431946,0.040072143,0.14842021,0.07912103,0.000107714426],"about_ca_topic_score_codex":0.0003856312,"about_ca_topic_score_gemma":0.00034554972,"teacher_disagreement_score":0.0010079463,"about_ca_system_score_codex":0.00024885687,"about_ca_system_score_gemma":0.00021399524,"threshold_uncertainty_score":0.0049189925},"labels":[],"label_agreement":null},{"id":"W2155201381","doi":"10.1109/lcn.2004.14","title":"Alleviating self-interference in MANETs","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Network packet; Network topology; Mobile ad hoc network; Throughput; Interference (communication); Wireless ad hoc network; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.010669937628927909,"score_gpt":0.22648283679500816,"score_spread":0.21581289916608026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155201381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21841878,0.010566778,0.7366839,0.0008925515,0.0005845,0.00020415797,0.00013329726,0.0041349446,0.02838114],"genre_scores_gemma":[0.9107421,0.0037947237,0.07666516,0.00039350073,0.00031409945,0.0001338741,0.00020325246,0.00019461557,0.0075587165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929667,0.00024413576,0.00003858985,0.00006422806,0.00023140138,0.00012490695],"domain_scores_gemma":[0.9977665,0.00090172957,0.0002299304,0.0005436365,0.0004162434,0.00014192646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008665419,0.00093239476,0.00083523954,0.00084964756,0.00072781945,0.00072995987,0.001215098,0.00064999954,0.0014482753],"category_scores_gemma":[0.0029945453,0.000352488,0.0003996641,0.00070808554,0.00057248026,0.0017453848,0.0022204323,0.00060979265,0.00090479676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004715866,0.0006249852,0.0057443944,0.0011901396,0.00026517213,0.0011928951,0.0011188065,0.3194408,0.07010175,0.04137238,0.0150934635,0.54338366],"study_design_scores_gemma":[0.000106540814,0.0009557395,0.0028484322,0.000115606614,0.00022750825,0.0018977365,0.0005863786,0.849864,0.042066127,0.050082434,0.05115605,0.000093539245],"about_ca_topic_score_codex":0.00063744513,"about_ca_topic_score_gemma":0.0008453111,"teacher_disagreement_score":0.0014482753,"about_ca_system_score_codex":0.00024425468,"about_ca_system_score_gemma":0.00046037458,"threshold_uncertainty_score":0.0048449636},"labels":[],"label_agreement":null},{"id":"W2155207803","doi":"10.1109/glocom.2009.5425848","title":"On a Stochastic Delay Bound for Disrupted Vehicle-to-Infrastructure Communication with Random Traffic","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Randomness; Upper and lower bounds; Network packet; Computer science; Computer network; Bandwidth (computing); Path (computing); Channel (broadcasting); Stochastic process; Real-time computing; Mathematics; Statistics","score_opus":0.0065785669855379795,"score_gpt":0.23677155316932105,"score_spread":0.23019298618378306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155207803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057587262,0.00233585,0.9313474,0.0010775119,0.00015843111,0.00007004934,0.00018079017,0.00024439459,0.006998344],"genre_scores_gemma":[0.955464,0.002618976,0.03764543,0.00034758123,0.00032530428,0.00022967604,0.00017675442,0.00020319007,0.0029891366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967565,0.0009147195,0.00012167454,0.0005380326,0.0009847088,0.0006843335],"domain_scores_gemma":[0.95201653,0.039228775,0.0040362687,0.001402039,0.002288446,0.0010280688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006733483,0.0017082659,0.0017793814,0.0029618598,0.0013812574,0.002928742,0.0027545346,0.0017368806,0.0023025617],"category_scores_gemma":[0.041840583,0.0011986461,0.0009867718,0.001810953,0.0046422184,0.004977157,0.002496077,0.0024617244,0.00042523062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000857102,0.000025330428,0.0006391746,0.00009700686,0.000039237886,0.00016339314,0.00010900183,0.8642184,0.0015915878,0.12975758,0.00061388506,0.0026595562],"study_design_scores_gemma":[0.000010931833,0.000039819275,0.00022650365,0.00002743729,0.000024292936,0.000087760236,0.0000425056,0.9705165,0.00052800187,0.02786139,0.0006064946,0.000028341361],"about_ca_topic_score_codex":0.004963392,"about_ca_topic_score_gemma":0.0027145245,"teacher_disagreement_score":0.006733483,"about_ca_system_score_codex":0.0060501164,"about_ca_system_score_gemma":0.0023284878,"threshold_uncertainty_score":0.043896854},"labels":[],"label_agreement":null},{"id":"W2155575604","doi":"10.4108/icst.broadnets2009.7258","title":"Centered and Robust Multicast Routing in Mobile Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Computer network; Distributed computing; Optimized Link State Routing Protocol; Wireless Routing Protocol; Ad hoc wireless distribution service; Wireless ad hoc network; Geocast; Adaptive quality of service multi-hop routing; Multicast; Mobile ad hoc network; Vehicular ad hoc network; Protocol Independent Multicast; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.01618335530208423,"score_gpt":0.23643872862985835,"score_spread":0.22025537332777412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155575604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019899733,0.0035000616,0.965036,0.00039228503,0.00024599355,0.00005807333,0.000052407177,0.0009921938,0.009823245],"genre_scores_gemma":[0.6293026,0.0028609762,0.35664076,0.0003963399,0.0010060109,0.00019910281,0.00028238556,0.00017437933,0.009137491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895084,0.0003542236,0.000050839655,0.00012693169,0.00044434806,0.000072800474],"domain_scores_gemma":[0.9992198,0.00031237034,0.00010601223,0.00017495571,0.0001389995,0.000047878428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086169475,0.0004211642,0.00043365464,0.00083372754,0.00041192997,0.001022059,0.0010586597,0.0009874932,0.0013914647],"category_scores_gemma":[0.0023763685,0.00031069343,0.00032398367,0.0005313344,0.0007521481,0.0017460795,0.0012008369,0.00084344327,0.00066862046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042235805,0.00011195063,0.00080470956,0.0002472395,0.00010039822,0.00056907843,0.0002769926,0.17043398,0.045032315,0.40405563,0.011609598,0.36633575],"study_design_scores_gemma":[0.000079401056,0.00066930114,0.0006462723,0.00010003416,0.000076633776,0.0009558543,0.000110539586,0.72132695,0.01778447,0.21016493,0.048006915,0.00007873914],"about_ca_topic_score_codex":0.0002946193,"about_ca_topic_score_gemma":0.00025534167,"teacher_disagreement_score":0.0013914647,"about_ca_system_score_codex":0.0003354502,"about_ca_system_score_gemma":0.0003256239,"threshold_uncertainty_score":0.004654944},"labels":[],"label_agreement":null},{"id":"W2155745450","doi":"10.1145/1089803.1089980","title":"Performance of distributed algorithms for maximizing multicast lifetime in mobile ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Computer science; Computer network; Distributed computing; Geocast; Wireless ad hoc network; Source-specific multicast; Pragmatic General Multicast; Xcast; Protocol Independent Multicast; Mobile ad hoc network; Node (physics); Algorithm; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications; Engineering","score_opus":0.013405791266337301,"score_gpt":0.24718831556202214,"score_spread":0.23378252429568483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155745450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43726,0.005353173,0.5467045,0.00084172067,0.00016838587,0.0002038202,0.000103005084,0.0014310315,0.007934451],"genre_scores_gemma":[0.9585768,0.0005232107,0.040041592,0.000057511716,0.000045970733,0.00012268007,0.00006779574,0.000049765884,0.000514725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972657,0.0013108852,0.00013560364,0.00028021834,0.00079264626,0.00021492835],"domain_scores_gemma":[0.9878665,0.00924718,0.00083109096,0.0007248821,0.0010461602,0.00028415016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068385517,0.00095447886,0.0011789887,0.0009944282,0.0008385534,0.0011327739,0.0012138285,0.0015261874,0.0006405648],"category_scores_gemma":[0.022400951,0.00034925842,0.00022995441,0.0008127263,0.0009846344,0.0018239556,0.0012772091,0.00069935655,0.00016551305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012830101,0.00025382568,0.002636415,0.00017096639,0.0000999304,0.000050052597,0.00017618666,0.8952496,0.007305131,0.01050451,0.0011802235,0.08109015],"study_design_scores_gemma":[0.000119373435,0.00028289974,0.00030999514,0.000010162372,0.000015534368,0.000034348057,0.000032007818,0.99190277,0.0022940189,0.0046465495,0.0003427667,0.0000096310505],"about_ca_topic_score_codex":0.00094405265,"about_ca_topic_score_gemma":0.00062220293,"teacher_disagreement_score":0.0068385517,"about_ca_system_score_codex":0.0014185619,"about_ca_system_score_gemma":0.0010728152,"threshold_uncertainty_score":0.03616613},"labels":[],"label_agreement":null},{"id":"W2155759597","doi":"10.1109/iuce.2009.103","title":"General-purpose Identity Hiding Schemes for Ad-hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; ElGamal encryption; Computer network; Identity (music); Wireless ad hoc network; Cryptosystem; Routing (electronic design automation); Routing protocol; Scheme (mathematics); Mobile ad hoc network; Anonymity; Computer security; Distributed computing; Encryption; Public-key cryptography; Mathematics; Wireless; Telecommunications","score_opus":0.017897406910748932,"score_gpt":0.2713873383209884,"score_spread":0.25348993141023946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155759597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023313247,0.0069573633,0.95508665,0.0010530968,0.00035019938,0.00033747646,0.00007798445,0.00060208206,0.012221854],"genre_scores_gemma":[0.54545474,0.008648432,0.4279081,0.00042518714,0.00058197026,0.0006457028,0.00032228828,0.0001117239,0.015901906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859375,0.00042675238,0.000092349255,0.00013889877,0.00061685155,0.0001312987],"domain_scores_gemma":[0.99838626,0.00042458548,0.00017540144,0.0007836007,0.00015345092,0.00007671115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017779616,0.0006833903,0.00060885015,0.000651601,0.0011031465,0.0015835643,0.0014886226,0.0013052741,0.0022966266],"category_scores_gemma":[0.002327428,0.00041397268,0.0007502414,0.0013094255,0.0019742919,0.0046423348,0.0022069446,0.0023059358,0.00088412815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019917576,0.00009901574,0.00031092213,0.0007114009,0.000050619532,0.00032548507,0.0005617831,0.014245024,0.017906921,0.8625353,0.0039978786,0.09905634],"study_design_scores_gemma":[0.00016556097,0.00033186833,0.0005224989,0.00022736409,0.00011836985,0.0014852377,0.00018183628,0.15890759,0.022488818,0.6993347,0.1160994,0.00013681575],"about_ca_topic_score_codex":0.0002071751,"about_ca_topic_score_gemma":0.00025101082,"teacher_disagreement_score":0.0022966266,"about_ca_system_score_codex":0.000993589,"about_ca_system_score_gemma":0.00073080347,"threshold_uncertainty_score":0.009402871},"labels":[],"label_agreement":null},{"id":"W2155785578","doi":"10.1109/tmc.2006.130","title":"End-to-End Batch Transmission in a Multihop and Multirate Wireless Network: Latency, Reliability, and Throughput Analysis","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"Asian Institute of Technology; Thammasat University; University of British Columbia; University of Manitoba","keywords":"Computer science; Computer network; Network packet; Latency (audio); Hybrid automatic repeat request; Wireless network; Automatic repeat request; Wireless; Transmission (telecommunications); Transmission Control Protocol; Selective Repeat ARQ; Node (physics); Reliability (semiconductor); End-to-end principle; Markov chain; Telecommunications; Engineering; Telecommunications link","score_opus":0.009240752330363608,"score_gpt":0.24402687829733063,"score_spread":0.23478612596696702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155785578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13644648,0.00062261254,0.86073536,0.0001846529,0.00003162035,0.0000756088,0.000105222796,0.0003225492,0.001475944],"genre_scores_gemma":[0.9700815,0.00054166006,0.027625205,0.0000461492,0.000044948407,0.000117116855,0.000081767364,0.00006551903,0.0013961899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989485,0.0002840636,0.00004798806,0.0001358996,0.0004126138,0.0001708811],"domain_scores_gemma":[0.9949216,0.0033721405,0.0006364816,0.00043180442,0.000516363,0.0001215553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002874974,0.0010032223,0.00090945454,0.00079371245,0.00040216342,0.0008104363,0.0016581828,0.0010037185,0.0007541735],"category_scores_gemma":[0.007413831,0.00053025497,0.0007959411,0.00051805034,0.00112911,0.002389586,0.0006337647,0.0011556789,0.00024140328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016610508,0.00005695124,0.0017476003,0.00006131802,0.00003975367,0.00020242755,0.00011989181,0.9572641,0.009232518,0.025596308,0.00023322077,0.0052798255],"study_design_scores_gemma":[0.00000226842,0.000024010908,0.00017307716,0.0000023898542,0.000007195823,0.00002680307,0.0000069574303,0.9972389,0.0007799674,0.0016850999,0.000046808553,0.000006466813],"about_ca_topic_score_codex":0.0037576335,"about_ca_topic_score_gemma":0.0016243993,"teacher_disagreement_score":0.0037576335,"about_ca_system_score_codex":0.0016185751,"about_ca_system_score_gemma":0.00081581593,"threshold_uncertainty_score":0.015204489},"labels":[],"label_agreement":null},{"id":"W2155791978","doi":"10.1109/pacrim.2009.5291275","title":"Regulating voice traffic rate in mobile wireless ad hoc networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Throughput; Wireless network; Packet loss; Network packet; Mobile radio; Wireless; Vehicular ad hoc network; Scheme (mathematics); Telecommunications","score_opus":0.009162609227971416,"score_gpt":0.2314588952278429,"score_spread":0.2222962859998715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155791978","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7183073,0.0015379013,0.2681591,0.00029041004,0.00012488231,0.00008324812,0.00006772544,0.000912372,0.010517133],"genre_scores_gemma":[0.99478596,0.00024403825,0.0044026687,0.000022653356,0.000017431774,0.000011288336,0.000014601674,0.00001613666,0.00048520378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995154,0.00021179239,0.000019449393,0.00003571877,0.00016069226,0.000056941102],"domain_scores_gemma":[0.99881387,0.00079166045,0.00010230383,0.00008349588,0.00017508608,0.000033649594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091235805,0.00031899672,0.00025376148,0.00046373624,0.00029535923,0.00045501546,0.0005136259,0.00030600725,0.00037523644],"category_scores_gemma":[0.0039628274,0.00016363594,0.00015151913,0.00022619052,0.00042055477,0.0007818252,0.0002571746,0.00022996648,0.00014714118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039591017,0.00015237206,0.009041044,0.00018115572,0.000060860733,0.0004942255,0.0002560044,0.8203787,0.06844855,0.008597474,0.00089383166,0.0910999],"study_design_scores_gemma":[0.000030500038,0.0002476777,0.001246249,0.000011827655,0.000037539452,0.00023797591,0.000091899026,0.9782491,0.015365994,0.0030157818,0.0014485735,0.000016990405],"about_ca_topic_score_codex":0.001077187,"about_ca_topic_score_gemma":0.00086287287,"teacher_disagreement_score":0.001077187,"about_ca_system_score_codex":0.0003365672,"about_ca_system_score_gemma":0.00021765563,"threshold_uncertainty_score":0.0048250556},"labels":[],"label_agreement":null},{"id":"W2155828185","doi":"10.1109/vetecf.2007.35","title":"New CDMA-Based MAC Protocol for Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Vehicular Technology Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Code division multiple access; Ad hoc wireless distribution service; Throughput; Network packet; Channel access method; Wireless network; Optimized Link State Routing Protocol; Multiple Access with Collision Avoidance for Wireless; Mobile ad hoc network; Channel (broadcasting); Access control; Bottleneck; Control channel; Reverse Address Resolution Protocol; Distributed computing; Wireless; Routing protocol; Telecommunications link; Telecommunications; The Internet; Internet Protocol","score_opus":0.021476617678477052,"score_gpt":0.2872264197602288,"score_spread":0.26574980208175175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155828185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032536897,0.03811502,0.9222583,0.0014321295,0.0052266303,0.0013843038,0.00068056025,0.0022950713,0.025354255],"genre_scores_gemma":[0.08694628,0.031567384,0.8142214,0.0032068945,0.0035757057,0.0050355373,0.0030820998,0.00027711704,0.05208758],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973363,0.00067518186,0.00024653864,0.00037556564,0.0011632268,0.00020307719],"domain_scores_gemma":[0.9987841,0.00031476258,0.00014895809,0.00013304876,0.0005325712,0.000086592656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013397122,0.0010542163,0.0011261507,0.0015277461,0.0013491465,0.0015919844,0.002764748,0.0018497787,0.0041527483],"category_scores_gemma":[0.002455336,0.0003854526,0.0005947001,0.002292246,0.0009002858,0.0023017062,0.0013102856,0.003228078,0.003186128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059092283,0.00032165422,0.00087340426,0.0029793854,0.00026010894,0.0011001261,0.0004614925,0.016620623,0.050246824,0.19063777,0.12105707,0.61485064],"study_design_scores_gemma":[0.0001996494,0.00039481246,0.0005883839,0.00030459958,0.00015172787,0.0026943341,0.00007256368,0.06020898,0.014655346,0.03275129,0.88777435,0.00020392136],"about_ca_topic_score_codex":0.0011990726,"about_ca_topic_score_gemma":0.0014441608,"teacher_disagreement_score":0.0041527483,"about_ca_system_score_codex":0.0011389744,"about_ca_system_score_gemma":0.0016434485,"threshold_uncertainty_score":0.013892293},"labels":[],"label_agreement":null},{"id":"W2156046876","doi":"10.1109/tnet.2005.860109","title":"Cooperation in wireless ad hoc networks: a market-based approach","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless ad hoc network; Convergence (economics); Computer network; Mobile ad hoc network; Network packet; Wireless; Ad hoc wireless distribution service; Wireless network; Iterative method; Optimized Link State Routing Protocol; Mathematical optimization; Telecommunications; Algorithm; Economics; Mathematics","score_opus":0.01717339039060323,"score_gpt":0.23230330249416412,"score_spread":0.2151299121035609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156046876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029107844,0.002586329,0.9439325,0.0021465123,0.00021027305,0.00021099742,0.000057347468,0.00007449082,0.02167375],"genre_scores_gemma":[0.8734734,0.0036444438,0.11078535,0.00039308038,0.00063281436,0.0005115449,0.000048034773,0.000062841784,0.01044839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822253,0.0011400132,0.000036554407,0.0001287253,0.00032787622,0.00014433688],"domain_scores_gemma":[0.9975189,0.0017307475,0.0001935866,0.00009921507,0.00032133912,0.0001362591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029089458,0.00095812295,0.00114283,0.0010324331,0.001168576,0.0023678162,0.0025368386,0.0025802918,0.0033012107],"category_scores_gemma":[0.0054281787,0.0005151397,0.0009635574,0.001390544,0.002721077,0.004220168,0.0017194975,0.0015985956,0.00037757328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032252345,0.00007569374,0.0002463977,0.00010672847,0.000050448292,0.00023115608,0.000111912035,0.5809804,0.00083468587,0.40865517,0.0012004538,0.007474691],"study_design_scores_gemma":[0.00002292433,0.000039910152,0.00005618334,0.000012340735,0.000010315446,0.00004367708,0.000039300772,0.8993962,0.00012302409,0.099100046,0.0011440995,0.000011967417],"about_ca_topic_score_codex":0.002335098,"about_ca_topic_score_gemma":0.0023008182,"teacher_disagreement_score":0.0033012107,"about_ca_system_score_codex":0.0016809313,"about_ca_system_score_gemma":0.0014582805,"threshold_uncertainty_score":0.015384138},"labels":[],"label_agreement":null},{"id":"W2156199875","doi":"10.1109/icc.2006.255670","title":"A New Approach to Service Discovery in Wireless Mobile Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Multicast; Service discovery; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Protocol Independent Multicast; Reliable multicast; Geocast; Optimized Link State Routing Protocol; Wireless; Routing protocol; World Wide Web; Routing (electronic design automation); Web service; Telecommunications","score_opus":0.051087268054257444,"score_gpt":0.3036527420738922,"score_spread":0.25256547401963475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156199875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035158438,0.007644914,0.97413796,0.0024636358,0.0018063681,0.00027056597,0.000066665874,0.0004660862,0.009628048],"genre_scores_gemma":[0.14456333,0.016548628,0.81573415,0.002661483,0.0038148023,0.0007981042,0.00028702692,0.00016706932,0.015425372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994936,0.0011138126,0.00032268092,0.00064544094,0.0027454258,0.00023651446],"domain_scores_gemma":[0.9976265,0.0011600187,0.00017818088,0.0004380627,0.00045009723,0.00014716861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031342055,0.0011675656,0.001589349,0.002214919,0.0015030961,0.003926979,0.003921499,0.00247559,0.002280723],"category_scores_gemma":[0.0064615207,0.0006449847,0.0011426416,0.0032746831,0.0033121374,0.0077196145,0.003652032,0.005321755,0.0011613828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025853876,0.00023313978,0.000484436,0.0010087008,0.0002183167,0.00029104756,0.0004960376,0.036702026,0.009496794,0.545878,0.016200589,0.3887324],"study_design_scores_gemma":[0.00020316997,0.00074594404,0.00030020432,0.0002401621,0.0002377997,0.0017118852,0.0002410762,0.44994643,0.0073678056,0.32774046,0.2111275,0.00013748348],"about_ca_topic_score_codex":0.0011402577,"about_ca_topic_score_gemma":0.0013084904,"teacher_disagreement_score":0.003926979,"about_ca_system_score_codex":0.0015293668,"about_ca_system_score_gemma":0.0015934858,"threshold_uncertainty_score":0.016575456},"labels":[],"label_agreement":null},{"id":"W2156378926","doi":"10.1109/pacrim.2007.4313181","title":"A Framework for Evaluating Video Transmission over Wireless Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Dynamic Source Routing; Ad hoc On-Demand Distance Vector Routing; Zone Routing Protocol; Wireless ad hoc network; Ad hoc wireless distribution service; Link-state routing protocol; Routing protocol; Distance-vector routing protocol; Distributed computing; Destination-Sequenced Distance Vector routing; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.028031109437308844,"score_gpt":0.3252073877126158,"score_spread":0.29717627827530696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156378926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007069205,0.0008657168,0.986204,0.00011269,0.0000991988,0.00040763165,0.0002661501,0.0005929676,0.0043824883],"genre_scores_gemma":[0.17364949,0.0014260677,0.8207934,0.00006366171,0.0001473249,0.0014924295,0.0006958406,0.00016250326,0.0015691916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959566,0.0016623258,0.00038442042,0.00024943534,0.0015803121,0.00016695108],"domain_scores_gemma":[0.99661463,0.0015603469,0.00035607454,0.0003506815,0.00094485114,0.00017343594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050982633,0.0018132041,0.0010890751,0.003396349,0.00090738846,0.0033075272,0.002560508,0.0013802213,0.001539531],"category_scores_gemma":[0.009902784,0.000387106,0.00089225295,0.0020741294,0.0012270666,0.0029832772,0.002026736,0.0012623558,0.00048265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023623329,0.00032206872,0.0035044332,0.0006423771,0.0002528995,0.00045711958,0.00033528113,0.583508,0.02674212,0.20050895,0.00479256,0.17869793],"study_design_scores_gemma":[0.00004281754,0.000703818,0.0009864455,0.000148301,0.000081312166,0.00025597788,0.00021695613,0.92997915,0.007865497,0.040936243,0.018689595,0.00009393928],"about_ca_topic_score_codex":0.0036697655,"about_ca_topic_score_gemma":0.0018253843,"teacher_disagreement_score":0.0050982633,"about_ca_system_score_codex":0.0012558689,"about_ca_system_score_gemma":0.0009732618,"threshold_uncertainty_score":0.026962519},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.009027105612704069,"score_gpt":0.2084926108908004,"score_spread":0.19946550527809634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156689181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057475856,0.0054945857,0.9810963,0.0011858575,0.0006511275,0.00008554261,0.000070549344,0.0012134502,0.0044550262],"genre_scores_gemma":[0.5064427,0.01020058,0.45995525,0.0007134337,0.0018508487,0.0005714041,0.00047157746,0.0005847398,0.01920949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650925,0.001464367,0.00018859953,0.00040330223,0.0011308021,0.0003036048],"domain_scores_gemma":[0.9937668,0.0042539937,0.00033871864,0.00097649347,0.0004971776,0.00016688596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039838967,0.0011811069,0.0018058881,0.001352282,0.0013182203,0.0031406614,0.003031211,0.0022055442,0.004205835],"category_scores_gemma":[0.014566101,0.00093987526,0.00064867985,0.0021207146,0.002080135,0.005926028,0.0026822889,0.0027032245,0.0013416256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007086205,0.00014566492,0.000597756,0.0009234546,0.00015281647,0.00028412626,0.00042129328,0.27972794,0.0030018261,0.4081822,0.028260484,0.27759385],"study_design_scores_gemma":[0.00013732394,0.00016148572,0.00019070794,0.000094882416,0.00010023291,0.00026072405,0.00007644321,0.70328575,0.0019053136,0.27100182,0.022741988,0.000043297397],"about_ca_topic_score_codex":0.0016344797,"about_ca_topic_score_gemma":0.0013000377,"teacher_disagreement_score":0.004205835,"about_ca_system_score_codex":0.0016396733,"about_ca_system_score_gemma":0.0014437718,"threshold_uncertainty_score":0.02106911},"labels":[],"label_agreement":null},{"id":"W2156766794","doi":"10.1145/1089803.1089985","title":"The impact of transient traffic on mobile, ad-hoc routing","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Bottleneck; Computer network; Transient (computer programming); Wireless ad hoc network; Routing protocol; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Routing (electronic design automation); Distributed computing; Telecommunications; Embedded system; Wireless","score_opus":0.010149238262853074,"score_gpt":0.2600744529980691,"score_spread":0.249925214735216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156766794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9506373,0.0019454467,0.036907535,0.000608536,0.00017337543,0.000050979623,0.00016288325,0.00047382867,0.009039979],"genre_scores_gemma":[0.9977823,0.000328419,0.0014296952,0.000041121864,0.00004110289,0.000007736258,0.00006298769,0.00002910615,0.00027750846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800366,0.00073994877,0.00009272867,0.00016016257,0.00064425287,0.00035937154],"domain_scores_gemma":[0.9783488,0.01762187,0.00096132373,0.0008570061,0.0016698175,0.0005412239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018579616,0.00044307124,0.0004003341,0.00075084827,0.00091747206,0.0012807943,0.00080041646,0.00080309,0.0008621928],"category_scores_gemma":[0.020362537,0.00025720696,0.00022814094,0.0008708689,0.0009270833,0.002312229,0.0006111297,0.00046449498,0.00026121622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013823274,0.0004952923,0.08311265,0.00064946036,0.0001229393,0.0024518315,0.000768699,0.6465374,0.05305236,0.016629,0.0047756582,0.1900223],"study_design_scores_gemma":[0.000052374136,0.0020758286,0.04042691,0.000085055486,0.00017833743,0.0029338128,0.0010936981,0.9009683,0.03722235,0.009579836,0.0053185117,0.00006483009],"about_ca_topic_score_codex":0.0026637502,"about_ca_topic_score_gemma":0.0023480006,"teacher_disagreement_score":0.0026637502,"about_ca_system_score_codex":0.0012762113,"about_ca_system_score_gemma":0.000545961,"threshold_uncertainty_score":0.0098260045},"labels":[],"label_agreement":null},{"id":"W2157078070","doi":"","title":"Signaling for conferencing in mobile ad hoc networks","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications; Network packet","score_opus":0.027794061905526732,"score_gpt":0.2763126338463907,"score_spread":0.24851857194086396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157078070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007319655,0.055371515,0.8515602,0.0019071731,0.002593097,0.00049844856,0.0002649599,0.0022194367,0.0782656],"genre_scores_gemma":[0.24018289,0.071693726,0.60068846,0.0025479149,0.0038739922,0.0011011506,0.0014408823,0.00054604956,0.07792486],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984559,0.0004789487,0.00012751896,0.00016438753,0.0006618161,0.00011152608],"domain_scores_gemma":[0.9989073,0.00043882368,0.00007752982,0.00017114427,0.00035695682,0.000048207996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010470473,0.0008556157,0.0006751755,0.0011454789,0.0009926968,0.0023719335,0.0012817846,0.0016531566,0.0082704555],"category_scores_gemma":[0.0022430664,0.00040573737,0.00057299016,0.0015270435,0.0008870964,0.0027059282,0.0010971847,0.0018111366,0.0039146785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013678083,0.00009758621,0.0003381802,0.0019397835,0.000054585504,0.00059934123,0.00048971816,0.011395414,0.030921396,0.4352286,0.0318211,0.4869775],"study_design_scores_gemma":[0.000053664775,0.00031427853,0.00048142724,0.0006395831,0.00012545458,0.0017728902,0.00028175546,0.06689796,0.025629712,0.17441817,0.7292622,0.00012286744],"about_ca_topic_score_codex":0.0005845591,"about_ca_topic_score_gemma":0.000631374,"teacher_disagreement_score":0.0082704555,"about_ca_system_score_codex":0.0008849179,"about_ca_system_score_gemma":0.0010498811,"threshold_uncertainty_score":0.027667403},"labels":[],"label_agreement":null},{"id":"W2157635692","doi":"10.1109/jcn.2002.6596933","title":"Multipath routing for mobile ad hoc networks","year":2002,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Multipath routing; Wireless ad hoc network; Mobile ad hoc network; Multipath propagation; Routing (electronic design automation); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless Routing Protocol; Routing protocol; Telecommunications; Wireless","score_opus":0.03099292896093242,"score_gpt":0.27057946885483497,"score_spread":0.23958653989390255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157635692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023925398,0.045477442,0.92234886,0.0027658285,0.0029229093,0.00034447515,0.00025321098,0.003442566,0.020052183],"genre_scores_gemma":[0.12602057,0.0785624,0.7610517,0.0011780587,0.0040089306,0.0012404174,0.0010944327,0.0005740658,0.026269492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990276,0.00030441588,0.00006270623,0.000094517934,0.0004492917,0.00006138106],"domain_scores_gemma":[0.99918395,0.0003335212,0.00007449916,0.00014093034,0.00021619779,0.000050950253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074158714,0.0012542707,0.0007837255,0.0011951944,0.0007722821,0.0016441036,0.0013670777,0.0013560059,0.004750096],"category_scores_gemma":[0.003059016,0.0004213266,0.0004550239,0.002303904,0.00080917927,0.0022835266,0.0013456495,0.0017870842,0.0031164049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009596059,0.00004007304,0.00033514207,0.0013283208,0.00010148186,0.0005061479,0.00024679126,0.054248873,0.0066227745,0.2167491,0.053894404,0.6658309],"study_design_scores_gemma":[0.00007366489,0.00018347004,0.00036252508,0.0004446109,0.00008512951,0.0014309738,0.0001536852,0.15062875,0.0027850755,0.26037544,0.5833712,0.000105534775],"about_ca_topic_score_codex":0.0010426184,"about_ca_topic_score_gemma":0.0013026741,"teacher_disagreement_score":0.004750096,"about_ca_system_score_codex":0.0010924647,"about_ca_system_score_gemma":0.00094200094,"threshold_uncertainty_score":0.015890658},"labels":[],"label_agreement":null},{"id":"W2157753773","doi":"10.1109/tmc.2006.1599403","title":"Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multicast; Wireless ad hoc network; Heuristic; Integer programming; Wireless network; Wireless; Distributed computing; Computer network; Mobile ad hoc network; Linear programming; Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.009490260515106751,"score_gpt":0.21924146352580023,"score_spread":0.20975120301069347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157753773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070482446,0.0005913667,0.98754406,0.00037360544,0.000043613363,0.00007185185,0.00005392295,0.00015053508,0.004122842],"genre_scores_gemma":[0.34240997,0.0014604698,0.6521446,0.00025979645,0.00013307731,0.0005701544,0.0001754039,0.00010869556,0.002737826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943095,0.0003522522,0.000017605034,0.000041396877,0.000090731955,0.0000669802],"domain_scores_gemma":[0.9984149,0.0012404391,0.00014429975,0.00005383825,0.00010120968,0.00004544301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015200727,0.0014181309,0.0011847888,0.00074134057,0.0006220882,0.0014437181,0.0012656841,0.0016238588,0.0018743585],"category_scores_gemma":[0.0029752927,0.0007240667,0.00061451737,0.001187164,0.0008407219,0.0012718247,0.0010700113,0.0013667849,0.0003100404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019271483,0.000023753753,0.00007742395,0.000045218185,0.000011352666,0.000029268567,0.000021410646,0.976307,0.00016975775,0.013340193,0.0006102374,0.009345153],"study_design_scores_gemma":[0.000009461172,0.00000873608,0.000013324182,0.000011025591,0.0000035888067,0.000006830887,0.000019036712,0.99024546,0.0001353963,0.0090300115,0.0005143573,0.000002788674],"about_ca_topic_score_codex":0.002380186,"about_ca_topic_score_gemma":0.002637163,"teacher_disagreement_score":0.002380186,"about_ca_system_score_codex":0.00095610897,"about_ca_system_score_gemma":0.0011313327,"threshold_uncertainty_score":0.008038998},"labels":[],"label_agreement":null},{"id":"W2157812733","doi":"10.1109/icc.2007.630","title":"Distributed Link Scheduling for TDMA Mesh Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Time division multiple access; Wireless mesh network; Scheduling (production processes); Distributed computing; Computer network; Distributed algorithm; Switched mesh; Wireless ad hoc network; Shared mesh; Algorithm; Mathematical optimization; Wireless network; Wireless; Mathematics","score_opus":0.01518950564502533,"score_gpt":0.2567358114500305,"score_spread":0.24154630580500516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157812733","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004084832,0.0005125761,0.9928814,0.00010432809,0.0000992672,0.000040866533,0.000033887824,0.00034981215,0.0018929602],"genre_scores_gemma":[0.3637567,0.001169631,0.6292951,0.00011689954,0.00020221228,0.00037584,0.00028362966,0.0001462485,0.004653685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994863,0.00018426137,0.000026621754,0.0000746444,0.0001895451,0.000038619193],"domain_scores_gemma":[0.9993086,0.0003800654,0.00006129377,0.00010660788,0.00011400254,0.000029342482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007262636,0.00044199257,0.00043314626,0.00043643443,0.0005225475,0.000684339,0.00095160224,0.00045060564,0.0022781282],"category_scores_gemma":[0.002801585,0.00018870729,0.00025278976,0.00070363475,0.0004235703,0.000727972,0.00053805095,0.0006642523,0.00051242835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014993676,0.00006431619,0.0004540086,0.00018926905,0.000042224907,0.00010302565,0.000085892054,0.6842482,0.0069626733,0.09193149,0.004779501,0.21098946],"study_design_scores_gemma":[0.00003466291,0.0000393244,0.000058305275,0.000007420613,0.000009783334,0.00003512774,0.000009174916,0.9652115,0.0013348986,0.026146587,0.0071068616,0.0000062278173],"about_ca_topic_score_codex":0.0013469805,"about_ca_topic_score_gemma":0.0014323395,"teacher_disagreement_score":0.0022781282,"about_ca_system_score_codex":0.0007969881,"about_ca_system_score_gemma":0.0007381035,"threshold_uncertainty_score":0.00762105},"labels":[],"label_agreement":null},{"id":"W2158171519","doi":"10.1109/icc.2008.408","title":"Modeling and Managing the Trust for Wireless and Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Trust management (information system); Computer science; Reputation; Computational trust; Mobile ad hoc network; Wireless ad hoc network; Computer security; Popularity; Computer network; Reputation system; Vehicular ad hoc network; Wireless; Trust anchor; Wireless network; Telecommunications","score_opus":0.015769570719199082,"score_gpt":0.22425047831446954,"score_spread":0.20848090759527046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158171519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025080198,0.003021896,0.96029806,0.0014251858,0.00022204645,0.0001565176,0.00009874511,0.00017409456,0.009523175],"genre_scores_gemma":[0.7759204,0.004565395,0.210602,0.0001401949,0.0003975859,0.000410893,0.000209048,0.000059027825,0.007695561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982158,0.0008484517,0.00013970704,0.00017790467,0.00049884844,0.00011935905],"domain_scores_gemma":[0.9981213,0.0009100893,0.0003265539,0.00024252922,0.00027625926,0.00012330207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020715492,0.00077000586,0.00070843275,0.00079231977,0.00091008865,0.0025143642,0.0017676061,0.0016770046,0.00089359755],"category_scores_gemma":[0.006375989,0.00048078824,0.0006833392,0.0010733518,0.001740736,0.0037401593,0.0016172349,0.0012701192,0.0003010589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049230166,0.000049749662,0.0014414213,0.00015708827,0.000059603284,0.00035918484,0.00048210475,0.6001082,0.001365111,0.35872552,0.0020658553,0.035137016],"study_design_scores_gemma":[0.000013295736,0.000032604283,0.00019792563,0.000024560453,0.000021866403,0.000080853366,0.00007961944,0.9163217,0.00022502274,0.076937005,0.0060506505,0.000014975952],"about_ca_topic_score_codex":0.007480797,"about_ca_topic_score_gemma":0.0063261753,"teacher_disagreement_score":0.007480797,"about_ca_system_score_codex":0.0016877691,"about_ca_system_score_gemma":0.0016614106,"threshold_uncertainty_score":0.014874518},"labels":[],"label_agreement":null},{"id":"W2158198228","doi":"10.1109/wimob.2006.1696387","title":"Mitigating Smart Selfish MAC Layer Misbehavior in Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Exponential backoff; Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Node (physics); Throughput; Survivability; Reliability (semiconductor); Vehicular ad hoc network; Access control; Layer (electronics); Distributed computing; Wireless; Network packet; Engineering; Telecommunications","score_opus":0.010381323981458891,"score_gpt":0.2263852959945577,"score_spread":0.21600397201309882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158198228","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57592213,0.000736769,0.42025322,0.00021913333,0.00004192704,0.00008770931,0.000015975947,0.00085893145,0.0018640346],"genre_scores_gemma":[0.98302215,0.00015195792,0.016581656,0.000039505565,0.000010522632,0.000014392556,0.000008740256,0.000015214187,0.000155775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936646,0.00025654605,0.000034662695,0.000053724325,0.00021269874,0.00007592865],"domain_scores_gemma":[0.9966967,0.0015970223,0.0007577693,0.00055443397,0.00027556045,0.00011855969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001527439,0.0004858021,0.00038473395,0.0005425331,0.00045975906,0.0005432863,0.00060094375,0.00037526846,0.00019218295],"category_scores_gemma":[0.0054601575,0.0002954091,0.00016385951,0.0002561549,0.0007294609,0.0012566665,0.0007211895,0.00039025626,0.00010496813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052031735,0.00028999,0.015021568,0.00021816103,0.00017566515,0.0003403723,0.00041640314,0.75829697,0.08616065,0.0142650595,0.0010728159,0.123221934],"study_design_scores_gemma":[0.00002607645,0.00031349016,0.001408749,0.000008791226,0.00003477226,0.00022913588,0.000049242008,0.98128957,0.012059642,0.0039382945,0.00062813686,0.000014172031],"about_ca_topic_score_codex":0.00056791946,"about_ca_topic_score_gemma":0.0006224488,"teacher_disagreement_score":0.001527439,"about_ca_system_score_codex":0.00020794316,"about_ca_system_score_gemma":0.00045655022,"threshold_uncertainty_score":0.008077979},"labels":[],"label_agreement":null},{"id":"W2158297842","doi":"10.1109/infcom.2012.6195514","title":"Capacity and delay analysis for social-proximity urban vehicular networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Unicast; Relay; Throughput; Computer science; Constant (computer programming); Computer network; Population; Scalability; Topology (electrical circuits); Wireless; Mathematics; Telecommunications; Network packet; Combinatorics; Physics","score_opus":0.025895130164475113,"score_gpt":0.24220141421181884,"score_spread":0.21630628404734373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158297842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23064841,0.0056007984,0.734768,0.0012602746,0.00010766861,0.000094864205,0.00047000233,0.0004594893,0.02659042],"genre_scores_gemma":[0.98895895,0.0017397004,0.006887056,0.00007613972,0.000085036925,0.00007099669,0.000117088704,0.000042658932,0.0020225076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889874,0.0002954399,0.000025529023,0.00012662547,0.00033461032,0.00031909443],"domain_scores_gemma":[0.9886107,0.008487385,0.0008104151,0.0004349376,0.0013922482,0.00026418339],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016861053,0.0009293619,0.0006757714,0.0019357143,0.00077353854,0.0011520106,0.0013275583,0.00067198736,0.0025707262],"category_scores_gemma":[0.013822547,0.00040361023,0.00040232737,0.0020244257,0.0021867196,0.002182408,0.0015659103,0.0010032204,0.00038524577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000855732,0.000029624369,0.00083164184,0.00015450474,0.000028308155,0.0001770448,0.00022464129,0.86848295,0.0028182536,0.11930263,0.0010569303,0.0068078283],"study_design_scores_gemma":[0.000003684274,0.000026297208,0.00030566988,0.000019834279,0.0000114484565,0.00010627977,0.00008284358,0.9596086,0.00090399245,0.038137596,0.0007776117,0.000016137214],"about_ca_topic_score_codex":0.0048851552,"about_ca_topic_score_gemma":0.0022993935,"teacher_disagreement_score":0.0048851552,"about_ca_system_score_codex":0.0028461923,"about_ca_system_score_gemma":0.0007978403,"threshold_uncertainty_score":0.020650685},"labels":[],"label_agreement":null},{"id":"W2158609113","doi":"10.1109/wcnc.2007.54","title":"A Power Control Scheme for Directional MAC Protocols in MANET","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"","keywords":"Computer science; Directional antenna; Throughput; Computer network; Transmission (telecommunications); Mobile ad hoc network; Power control; Directivity; Wireless ad hoc network; Power (physics); Wireless; Electronic engineering; Telecommunications; Engineering; Network packet; Antenna (radio)","score_opus":0.012576885120910378,"score_gpt":0.28799932578823895,"score_spread":0.27542244066732857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158609113","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050062956,0.00076771533,0.9888371,0.00018566738,0.00020216104,0.00018069206,0.00003313806,0.00060204905,0.0041851248],"genre_scores_gemma":[0.5812711,0.0018526909,0.40311784,0.0005434096,0.0003668375,0.00080506585,0.00018094532,0.00010792586,0.011754201],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993942,0.00014885546,0.00006874088,0.00010557889,0.00024323532,0.00003940799],"domain_scores_gemma":[0.99932265,0.00016517889,0.000085138876,0.00015567325,0.00023534715,0.00003590353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009158053,0.00054632255,0.00035325802,0.0006206243,0.00069225236,0.00090514764,0.0010546423,0.0005977021,0.0016233455],"category_scores_gemma":[0.0025897818,0.00021430766,0.00025375423,0.00056382956,0.00060165266,0.0009043925,0.0007568384,0.0010018952,0.0006767942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032779554,0.0002181308,0.0005483122,0.0005218299,0.00008788915,0.000518711,0.00044197214,0.083077975,0.085741214,0.20833163,0.0087291775,0.6114554],"study_design_scores_gemma":[0.00015314732,0.0006938806,0.0005934147,0.00010210064,0.00011048359,0.0015112713,0.00008579438,0.823159,0.035402086,0.053173315,0.0848947,0.00012080084],"about_ca_topic_score_codex":0.00038415543,"about_ca_topic_score_gemma":0.0005622502,"teacher_disagreement_score":0.0016233455,"about_ca_system_score_codex":0.00037627312,"about_ca_system_score_gemma":0.0004328759,"threshold_uncertainty_score":0.005430579},"labels":[],"label_agreement":null},{"id":"W2158872443","doi":"10.1109/wcnc.2009.4917955","title":"Routing and Admission Control for Wireless Mesh Networks with Directional Antennas","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless mesh network; Distributed computing; Quality of service; Wireless network; Multipath routing; Geographic routing; Static routing; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications","score_opus":0.007641362743946928,"score_gpt":0.2232055636408979,"score_spread":0.215564200896951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158872443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10455104,0.0016738432,0.88571954,0.0013265881,0.00015606711,0.00011842225,0.00004422298,0.0003835754,0.0060267267],"genre_scores_gemma":[0.9654375,0.0003889399,0.032231264,0.000072094044,0.00009188891,0.00008993991,0.00002817471,0.000019106701,0.0016411534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988932,0.0004904814,0.00004638599,0.0001044332,0.00029336987,0.00017203222],"domain_scores_gemma":[0.9985226,0.0010058775,0.00018790302,0.00008591251,0.00011637071,0.00008123629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018522323,0.00044899073,0.00047756493,0.0004849665,0.00076065864,0.0012749023,0.0009524095,0.0007867185,0.001060842],"category_scores_gemma":[0.0050579365,0.00025503535,0.0003544426,0.00063281774,0.0011880883,0.0011743093,0.0011457441,0.0008815999,0.00012382763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022444515,0.00007815566,0.001141922,0.000057298355,0.00003715243,0.00015505873,0.00018673978,0.85160375,0.0064746346,0.07959578,0.0013427017,0.059102375],"study_design_scores_gemma":[0.000012682978,0.000018743907,0.00009827353,0.000002635907,0.000007027825,0.000017077087,0.000018628536,0.98797256,0.00039851983,0.01104304,0.00040500163,0.000005823622],"about_ca_topic_score_codex":0.004122077,"about_ca_topic_score_gemma":0.0023368795,"teacher_disagreement_score":0.004122077,"about_ca_system_score_codex":0.0015460338,"about_ca_system_score_gemma":0.0012305423,"threshold_uncertainty_score":0.011217356},"labels":[],"label_agreement":null},{"id":"W2159081239","doi":"10.1109/dnsr.2004.1344708","title":"Self-limiting, adaptive protocols for controlled flooding in ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Connectionless communication; Computer science; Computer network; Flooding (psychology); Wireless ad hoc network; Limiting; Bandwidth (computing); Distributed computing; Power consumption; Mobile ad hoc network; Node (physics); Power (physics); Network packet; Wireless; Telecommunications; Engineering","score_opus":0.02184225004683924,"score_gpt":0.27033049627731665,"score_spread":0.2484882462304774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159081239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024118186,0.004922938,0.98445815,0.0007516251,0.00069496484,0.00027936965,0.000045806963,0.00073922065,0.005696147],"genre_scores_gemma":[0.17464273,0.013518245,0.78777426,0.0010342457,0.0015606818,0.0023564403,0.00037658104,0.00039585226,0.018341001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829036,0.0005320354,0.00013467108,0.00015320677,0.0008310668,0.000058666697],"domain_scores_gemma":[0.99801326,0.0009923031,0.00019844604,0.00033679826,0.00037062052,0.00008856404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018245983,0.0009888376,0.000884305,0.0012766704,0.0011773973,0.0016543565,0.0029822858,0.001807522,0.0028597682],"category_scores_gemma":[0.0073448285,0.0005060394,0.000578192,0.0016440653,0.0028407462,0.003512084,0.0017042697,0.0025483975,0.0010861647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013484001,0.00011970226,0.00028983798,0.0006714039,0.000060271526,0.00047545007,0.0005140275,0.06944379,0.012045658,0.77592534,0.016125696,0.124193944],"study_design_scores_gemma":[0.00015725887,0.00023328245,0.0001715798,0.0002268297,0.000077420096,0.000855471,0.00011908029,0.488426,0.0047955895,0.3812192,0.123603314,0.00011500882],"about_ca_topic_score_codex":0.000828916,"about_ca_topic_score_gemma":0.0010146666,"teacher_disagreement_score":0.0029822858,"about_ca_system_score_codex":0.0008536365,"about_ca_system_score_gemma":0.0011654295,"threshold_uncertainty_score":0.009649515},"labels":[],"label_agreement":null},{"id":"W2159152015","doi":"10.1287/ijoc.1110.0463","title":"A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Broadcasting (networking); Node (physics); Wireless sensor network; Computer science; Tree (set theory); Wireless; Energy consumption; Wireless network; Branch and cut; Mathematical optimization; Energy (signal processing); Exponential function; Computer network; Mathematics; Algorithm; Integer programming; Telecommunications","score_opus":0.027168394556127684,"score_gpt":0.23032226209390816,"score_spread":0.20315386753778047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159152015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005244483,0.00090340327,0.988226,0.0006053328,0.000075550546,0.0002035743,0.00016728054,0.00015391057,0.004420374],"genre_scores_gemma":[0.0912212,0.0015696661,0.90232664,0.00028131212,0.0001724315,0.00068736734,0.00054383115,0.00018109016,0.0030163797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849486,0.00081239187,0.00005429415,0.0001793491,0.00033923847,0.00011986439],"domain_scores_gemma":[0.9976029,0.0019293835,0.00012152216,0.00007764108,0.00018260775,0.00008586269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024458484,0.0018889029,0.0017212353,0.0014990396,0.0010744424,0.0018589735,0.0021477174,0.0022289187,0.0051637297],"category_scores_gemma":[0.0057777176,0.0009301171,0.0011569771,0.003035339,0.0011050486,0.002146646,0.0012451451,0.0029789077,0.00068452547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088376095,0.00016348284,0.00036168183,0.0003640346,0.000073206844,0.00013133885,0.00011914756,0.85559416,0.00089076615,0.0535161,0.005768886,0.08292876],"study_design_scores_gemma":[0.000045393615,0.000061825405,0.00009028279,0.00004857968,0.000024645202,0.00007496807,0.000053604967,0.94605285,0.0004569723,0.04919908,0.0038813872,0.000010376487],"about_ca_topic_score_codex":0.0042465846,"about_ca_topic_score_gemma":0.004523087,"teacher_disagreement_score":0.0051637297,"about_ca_system_score_codex":0.0016338916,"about_ca_system_score_gemma":0.002311456,"threshold_uncertainty_score":0.01727438},"labels":[],"label_agreement":null},{"id":"W2159161342","doi":"10.1109/glocom.2008.ecp.139","title":"Design of Wireless Mesh Networks: Expansion and Reliability Studies","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Reliability (semiconductor); Node (physics); Wireless; Wireless network; Network planning and design; Channel (broadcasting); Routing (electronic design automation); Distributed computing; Power (physics); Telecommunications; Engineering","score_opus":0.034087004862206914,"score_gpt":0.25685560951131753,"score_spread":0.2227686046491106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159161342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013836034,0.0024693874,0.9797941,0.0002866551,0.000039776616,0.00005056126,0.000024963081,0.000069323374,0.0034291046],"genre_scores_gemma":[0.7263989,0.007387099,0.26102448,0.00020622545,0.00044489658,0.00042014584,0.000112236026,0.00015434354,0.003851719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828845,0.00091931416,0.0000766257,0.00019366354,0.00040471336,0.000117231],"domain_scores_gemma":[0.9972983,0.0015983941,0.00037639,0.00024459395,0.00042685974,0.00005551223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029507214,0.00094530423,0.0008125892,0.000634702,0.00030255658,0.0006645315,0.0015535443,0.0009132905,0.0010117057],"category_scores_gemma":[0.0074709114,0.00066664227,0.0006367963,0.0006979985,0.0010412154,0.0025803002,0.001147754,0.0011087502,0.00018148385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000668614,0.00003904959,0.0008480822,0.00039861668,0.000044413406,0.00015090703,0.00019802162,0.8488741,0.0068299645,0.09305253,0.0010809834,0.04841644],"study_design_scores_gemma":[0.000008864642,0.000116395975,0.00026694196,0.00006438905,0.000030813637,0.00014977872,0.000038267273,0.9659732,0.0018017587,0.026926612,0.004610756,0.000012152508],"about_ca_topic_score_codex":0.00068080705,"about_ca_topic_score_gemma":0.00054116733,"teacher_disagreement_score":0.0029507214,"about_ca_system_score_codex":0.00082510343,"about_ca_system_score_gemma":0.0004742886,"threshold_uncertainty_score":0.015605152},"labels":[],"label_agreement":null},{"id":"W2159695473","doi":"10.1109/pacrim.2009.5291291","title":"A low-cost realistic testbed for mobile ad hoc networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Testbed; Computer science; Mobile ad hoc network; Software deployment; Wireless ad hoc network; Wireless; Adapter (computing); Wireless mesh network; Computer network; Wireless network; Embedded system; Distributed computing; Operating system","score_opus":0.012473124536677265,"score_gpt":0.25490645085763547,"score_spread":0.2424333263209582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159695473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10080126,0.00032311524,0.86549383,0.0005225706,0.00041549874,0.0022213326,0.0018238844,0.011656553,0.016741859],"genre_scores_gemma":[0.4404087,0.0003233009,0.546766,0.00014100195,0.000071487935,0.0026405726,0.0034230829,0.00039822567,0.0058276323],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99938536,0.0002457274,0.000044534776,0.000056033914,0.00020559,0.000062710795],"domain_scores_gemma":[0.99866915,0.00033422472,0.000088557696,0.0004581028,0.00017475079,0.0002752558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010746691,0.00037082098,0.00047854308,0.00051586673,0.0005370588,0.0005117852,0.0012973252,0.0005239617,0.0049936697],"category_scores_gemma":[0.0022714173,0.00023296187,0.00021102928,0.00046429955,0.0003622023,0.00095585216,0.00083529437,0.000530485,0.0015032401],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016917852,0.0023181136,0.011062171,0.0012415206,0.00012282441,0.0018066078,0.0005650656,0.26249385,0.3108905,0.072337635,0.057646647,0.27782324],"study_design_scores_gemma":[0.00080199743,0.0045403503,0.010740624,0.0001571488,0.0001455236,0.0020191038,0.0002592085,0.58266133,0.14249152,0.018589394,0.23743531,0.0001585093],"about_ca_topic_score_codex":0.0004697203,"about_ca_topic_score_gemma":0.0005775168,"teacher_disagreement_score":0.0049936697,"about_ca_system_score_codex":0.00039722124,"about_ca_system_score_gemma":0.00053455855,"threshold_uncertainty_score":0.016705513},"labels":[],"label_agreement":null},{"id":"W2159990088","doi":"10.1145/1089803.1089981","title":"On the resiliency of mobile ad hoc networks to MAC layer misbehavior","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Node (physics); Vulnerability (computing); Network packet; Mobile ad hoc network; Exploit; Packet forwarding; Computer security; Wireless; Telecommunications; Engineering","score_opus":0.013348930163870606,"score_gpt":0.2553657521964517,"score_spread":0.24201682203258107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159990088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40142375,0.032676816,0.51734126,0.008326816,0.0012551816,0.000246834,0.00016644485,0.0007797871,0.03778308],"genre_scores_gemma":[0.96719277,0.009254179,0.020879962,0.00032746486,0.0005946558,0.0000443315,0.00004613608,0.00004490474,0.001615575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984653,0.0005175231,0.000072976436,0.00016687228,0.0005752064,0.00020208904],"domain_scores_gemma":[0.9861909,0.010398518,0.0010381946,0.0011303384,0.0010418213,0.00020015656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020268615,0.00071538956,0.0005688236,0.0013609002,0.00082146685,0.0011551562,0.0007850631,0.001027521,0.00074675377],"category_scores_gemma":[0.014407381,0.00028656353,0.00039565796,0.0009355716,0.0028172669,0.0032803067,0.001307982,0.0012528396,0.00019304523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060292584,0.0001680921,0.01608141,0.00065151055,0.00040610324,0.0019481971,0.0011062837,0.597987,0.024703892,0.12171081,0.0052065235,0.22942723],"study_design_scores_gemma":[0.00004871526,0.0009250711,0.0064129,0.00026577956,0.00033202092,0.0029048878,0.0006121916,0.7879417,0.015588104,0.16533892,0.019484164,0.0001454702],"about_ca_topic_score_codex":0.0008933805,"about_ca_topic_score_gemma":0.0006473557,"teacher_disagreement_score":0.0020268615,"about_ca_system_score_codex":0.0008835408,"about_ca_system_score_gemma":0.00031508494,"threshold_uncertainty_score":0.01071918},"labels":[],"label_agreement":null},{"id":"W2160091785","doi":"10.1109/twc.2008.070238","title":"Cross-Layer Fair Bandwidth Sharing for Multi-Channel Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Wireless network; Order One Network Protocol; Bandwidth (computing); Distributed computing; Topology (electrical circuits); Wireless; Telecommunications; Mathematics","score_opus":0.07096105373342611,"score_gpt":0.3089124393258086,"score_spread":0.2379513855923825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160091785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03592024,0.00025096227,0.96240526,0.00006568731,0.000026017804,0.000027728447,0.000013739346,0.00010013004,0.0011902389],"genre_scores_gemma":[0.92208636,0.00014175058,0.07662165,0.000043754604,0.000024868337,0.00006825465,0.000018852392,0.000030564224,0.0009639068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984446,0.0007674414,0.000053127864,0.00017190937,0.00037071583,0.00019219877],"domain_scores_gemma":[0.998582,0.0008610625,0.00013817908,0.00017149988,0.00018529256,0.00006185169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036110003,0.00063816056,0.0006539436,0.00055210857,0.0006515377,0.0010157016,0.0012718695,0.00062013796,0.0014076078],"category_scores_gemma":[0.004379325,0.00032476636,0.00046059408,0.0006127981,0.0011394715,0.0017262684,0.0013273029,0.0005724754,0.00016951788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020373963,0.0000674082,0.00049182866,0.000071107475,0.000043889333,0.00006770308,0.000096918506,0.9173008,0.0068688234,0.03847879,0.00045999602,0.035848845],"study_design_scores_gemma":[0.000007800199,0.000033959805,0.000060505616,0.0000029087485,0.000007001642,0.00001517977,0.000010377107,0.9896946,0.0013016324,0.008563866,0.0002962811,0.000005972419],"about_ca_topic_score_codex":0.0011571561,"about_ca_topic_score_gemma":0.0014706643,"teacher_disagreement_score":0.0036110003,"about_ca_system_score_codex":0.0013297437,"about_ca_system_score_gemma":0.000851042,"threshold_uncertainty_score":0.01909703},"labels":[],"label_agreement":null},{"id":"W2160131598","doi":"10.1109/icc.2008.448","title":"Differentiated Reliable Routing in Hybrid Vehicular Ad-Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Redundancy (engineering); Vehicular ad hoc network; Node (physics); Routing protocol; Blocking (statistics); Optimized Link State Routing Protocol; Mobile ad hoc network; Overhead (engineering); Wireless; Distributed computing; Routing (electronic design automation); Network packet; Telecommunications; Engineering","score_opus":0.012177369668240911,"score_gpt":0.2061087032120118,"score_spread":0.1939313335437709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160131598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037492063,0.0031333945,0.9544543,0.0002646747,0.00012793756,0.00006166851,0.000032355638,0.00031145848,0.0041221194],"genre_scores_gemma":[0.8800266,0.0018903998,0.11476899,0.00014315399,0.000097331016,0.00009698134,0.00008509164,0.000041850093,0.0028495826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992623,0.0003007776,0.000038184775,0.00009071612,0.00024387348,0.00006410604],"domain_scores_gemma":[0.998965,0.00054499076,0.00011578816,0.00016015029,0.00017509754,0.00003904418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011661901,0.00042877372,0.00036826215,0.00053872244,0.0002956348,0.0008395344,0.0010375975,0.0006265312,0.00048516228],"category_scores_gemma":[0.002260955,0.00030867895,0.00029282598,0.0005961197,0.00080154376,0.0011919644,0.0008354245,0.00047989676,0.0001378815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014587073,0.000044130396,0.0009701552,0.00027351582,0.000055703014,0.0004945637,0.00031373522,0.71304387,0.011497906,0.16916569,0.0018162174,0.102178685],"study_design_scores_gemma":[0.00002124997,0.00009669733,0.0001829091,0.000019867255,0.000025809608,0.0001752135,0.000052664054,0.9525087,0.0016272834,0.040803626,0.0044643264,0.000021651202],"about_ca_topic_score_codex":0.0020619975,"about_ca_topic_score_gemma":0.0016671149,"teacher_disagreement_score":0.0020619975,"about_ca_system_score_codex":0.0007727985,"about_ca_system_score_gemma":0.00052507006,"threshold_uncertainty_score":0.0061674714},"labels":[],"label_agreement":null},{"id":"W2160150831","doi":"","title":"Mechanism design and game theoretical models for intrusion detection","year":2008,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Intrusion detection system; Selfishness; Incentive; Computer science; Node (physics); Mobile ad hoc network; Overhead (engineering); Computer security; Game theory; Resource (disambiguation); Mechanism design; Computer network; Engineering; Mathematical economics; Microeconomics; Economics; Political science; Law","score_opus":0.025936228573308025,"score_gpt":0.25888329511205865,"score_spread":0.23294706653875064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160150831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00552963,0.0007858032,0.97954834,0.0014364137,0.00015143004,0.00022643995,0.00013433729,0.00013931617,0.012048269],"genre_scores_gemma":[0.6305235,0.003183159,0.3430705,0.0012102949,0.00058582576,0.002423082,0.00036617884,0.00010916744,0.018528244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931959,0.003779112,0.00034230712,0.0009779809,0.0011010136,0.00060379924],"domain_scores_gemma":[0.9865753,0.010225685,0.0011415052,0.0008139043,0.0009203063,0.00032326468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066898433,0.0018656702,0.0016007927,0.0016426883,0.0012571232,0.0046679843,0.004069842,0.004299251,0.006963047],"category_scores_gemma":[0.016542422,0.0011172992,0.0021341403,0.0020499688,0.0038650816,0.0069524907,0.0021446845,0.004329407,0.0009371655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021813612,0.000052555988,0.00019955283,0.000086291206,0.000038319147,0.00007786926,0.00010837379,0.06513952,0.00021277566,0.92782295,0.001035769,0.0052042245],"study_design_scores_gemma":[0.0000791726,0.00006471475,0.00007140994,0.000036166126,0.00002596253,0.00009022165,0.00005198464,0.33791754,0.0001570865,0.6550565,0.0064252065,0.000024059367],"about_ca_topic_score_codex":0.0025899445,"about_ca_topic_score_gemma":0.001238477,"teacher_disagreement_score":0.006963047,"about_ca_system_score_codex":0.0042328574,"about_ca_system_score_gemma":0.0023362204,"threshold_uncertainty_score":0.035379708},"labels":[],"label_agreement":null},{"id":"W2160180223","doi":"10.1109/wimob.2008.17","title":"Accurately Predicting Residual Energy Levels in MANETs","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Routing protocol; Optimized Link State Routing Protocol; Computer network; Link-state routing protocol; Metric (unit); Zone Routing Protocol; Dynamic Source Routing; Wireless Routing Protocol; Routing (electronic design automation); Residual; Distributed computing; Engineering; Algorithm","score_opus":0.05835062680358663,"score_gpt":0.2639265854424347,"score_spread":0.20557595863884806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160180223","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64977235,0.000604278,0.34628198,0.00015827043,0.000052024578,0.000029727384,0.00016776819,0.001161519,0.0017719674],"genre_scores_gemma":[0.9809461,0.00016629786,0.018467983,0.000020532332,0.000008872378,0.000009926789,0.00011891902,0.000016050228,0.00024526208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999716,0.000093028015,0.000020054356,0.000050225834,0.00009202772,0.000028666931],"domain_scores_gemma":[0.99894625,0.00047876436,0.00018497306,0.0002208707,0.00013607138,0.000033065753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006285033,0.0004834738,0.00043199127,0.0005703217,0.00018384452,0.0005086513,0.00044944885,0.0004503115,0.00020079692],"category_scores_gemma":[0.0027322425,0.00024349318,0.00013040731,0.0004470539,0.00027262466,0.0011198748,0.00052725273,0.00033381267,0.00017584482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003190304,0.00007544927,0.011895118,0.000075540986,0.00005058998,0.00014402992,0.00012976937,0.8631761,0.02380785,0.0016282097,0.0007092952,0.097988956],"study_design_scores_gemma":[0.0000046999075,0.00007698269,0.002933132,0.000006095593,0.000011238209,0.000065437365,0.000044367047,0.98729044,0.00735169,0.0019074362,0.00029180027,0.000016563945],"about_ca_topic_score_codex":0.0012122265,"about_ca_topic_score_gemma":0.0013316687,"teacher_disagreement_score":0.0012122265,"about_ca_system_score_codex":0.00017418739,"about_ca_system_score_gemma":0.00017419102,"threshold_uncertainty_score":0.003323853},"labels":[],"label_agreement":null},{"id":"W2160301165","doi":"10.1109/icccn.2003.1284145","title":"Routing anomaly detection in mobile ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Intrusion detection system; Computer network; Anomaly detection; Mobile ad hoc network; Routing protocol; Markov chain; Dynamic Source Routing; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; False alarm; Wireless ad hoc network; Routing (electronic design automation); Data mining; Artificial intelligence; Wireless; Machine learning; Network packet","score_opus":0.007618753141068389,"score_gpt":0.21820100165702647,"score_spread":0.21058224851595808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160301165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10886837,0.0008738192,0.88762367,0.00036581367,0.00007640738,0.000043987548,0.000041378436,0.0013028327,0.0008037389],"genre_scores_gemma":[0.89236695,0.0005621009,0.10601601,0.000055654993,0.00008211183,0.000051214898,0.00008758733,0.000035986308,0.00074239506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901974,0.00031091378,0.00005680604,0.0001511425,0.00039780853,0.00006366344],"domain_scores_gemma":[0.99657506,0.002081104,0.00038887688,0.00030611915,0.00057388697,0.00007498075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012568136,0.0003320897,0.00061746576,0.001154357,0.00045507637,0.0007568121,0.0006203017,0.0006195773,0.00026833927],"category_scores_gemma":[0.0071119945,0.00028890514,0.00022383042,0.00090108777,0.0005824149,0.001210416,0.00047418577,0.0005573624,0.00011982483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025811535,0.00011633039,0.019266447,0.00012062532,0.00011687037,0.00035102584,0.00017475156,0.56656975,0.016668444,0.015514712,0.0017109355,0.379132],"study_design_scores_gemma":[0.0000056672934,0.00004169277,0.0008434247,0.0000037662774,0.000012677784,0.00015248748,0.000015520234,0.9895893,0.0024587396,0.006291453,0.00057829666,0.0000069647904],"about_ca_topic_score_codex":0.0017732783,"about_ca_topic_score_gemma":0.001072995,"teacher_disagreement_score":0.0017732783,"about_ca_system_score_codex":0.0005430497,"about_ca_system_score_gemma":0.00046942756,"threshold_uncertainty_score":0.0066466928},"labels":[],"label_agreement":null},{"id":"W2160320927","doi":"10.1109/lcn.2007.122","title":"Performance Evaluation of an Anonymous Routing Protocol using Mobile Agents for Wireless Ad hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Vehicular ad hoc network; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Routing protocol; Distributed computing; Computer security; Wireless; Routing (electronic design automation); Network packet; Telecommunications","score_opus":0.051471167444802714,"score_gpt":0.3484818782166423,"score_spread":0.29701071077183955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160320927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86367834,0.002209807,0.11716135,0.0004976836,0.00036130333,0.0005031397,0.00024584105,0.0024448556,0.012897665],"genre_scores_gemma":[0.9818194,0.000285728,0.01678052,0.000026081896,0.000020504,0.00009131579,0.00020424869,0.000049646635,0.0007225731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938089,0.0027541385,0.00042187332,0.0003060154,0.0023381743,0.00037088],"domain_scores_gemma":[0.9812733,0.0114402715,0.0011984324,0.0015279341,0.0040960927,0.00046403764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065813395,0.0009105544,0.0008460859,0.0016383498,0.0010544856,0.0011749195,0.001161738,0.00085132424,0.00084917527],"category_scores_gemma":[0.017344493,0.00023503273,0.00030272396,0.0014083445,0.00070436305,0.0020792948,0.0008401865,0.0005524421,0.0002669763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003584682,0.0014096132,0.012987922,0.0007084885,0.0004542069,0.0006339492,0.00046868977,0.7644595,0.037872735,0.013177339,0.004243622,0.15999928],"study_design_scores_gemma":[0.00012987484,0.001851155,0.0020307407,0.000016926397,0.000108838365,0.00029485623,0.00013151333,0.973527,0.019045576,0.0013443783,0.0014723387,0.000046723333],"about_ca_topic_score_codex":0.0021440845,"about_ca_topic_score_gemma":0.0013533353,"teacher_disagreement_score":0.0065813395,"about_ca_system_score_codex":0.0016775747,"about_ca_system_score_gemma":0.0011527955,"threshold_uncertainty_score":0.034805834},"labels":[],"label_agreement":null},{"id":"W2160352937","doi":"10.1109/icc.2012.6364842","title":"Opportunistic multihop wireless communications with calibrated channel model","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Wireless; Channel (broadcasting); Broadcasting (networking); Wireless network; Radio networks; Radio resource management; Telecommunications","score_opus":0.05442320653121849,"score_gpt":0.2649626005058707,"score_spread":0.21053939397465224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160352937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36698604,0.00047531852,0.6173056,0.00032099916,0.000108176835,0.00018497622,0.00059081113,0.00074768584,0.013280383],"genre_scores_gemma":[0.98425114,0.00020694148,0.014056213,0.000037838996,0.00001786166,0.000065269654,0.00010383693,0.000017358389,0.0012436161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994326,0.00016263066,0.000019393865,0.00008747334,0.0001831682,0.00011470915],"domain_scores_gemma":[0.99869615,0.0007243594,0.00015036247,0.00020508449,0.00018224353,0.000041794305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005901477,0.00042561672,0.00049653975,0.00038961187,0.00033113337,0.0005815823,0.00093367713,0.0007501188,0.0008422828],"category_scores_gemma":[0.0023429038,0.00032802494,0.00031419165,0.0006784671,0.0005825937,0.0012105614,0.0005287139,0.0006097744,0.00015632036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025933183,0.000021511507,0.00046519967,0.000012045809,0.000009028384,0.00005872459,0.000019240926,0.9921101,0.0011117363,0.0039999876,0.00015368883,0.0020128696],"study_design_scores_gemma":[0.000008658994,0.000026332678,0.00024952652,0.0000014855526,0.0000047402823,0.000030598367,0.000008828783,0.9976509,0.00030530992,0.0015125134,0.00019407179,0.0000071193117],"about_ca_topic_score_codex":0.004636962,"about_ca_topic_score_gemma":0.0027773832,"teacher_disagreement_score":0.004636962,"about_ca_system_score_codex":0.0005886918,"about_ca_system_score_gemma":0.00060299144,"threshold_uncertainty_score":0.0092199445},"labels":[],"label_agreement":null},{"id":"W2160414802","doi":"10.1109/tnsm.2010.1012.0362","title":"A Hierarchical Identity Based Key Management Scheme in Tactical Mobile Ad Hoc Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University","funders":"","keywords":"Computer science; Key management; Node (physics); Computer network; Key (lock); Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Scheme (mathematics); Public-key cryptography; Computer security; Wireless; Encryption; Engineering; Telecommunications","score_opus":0.0077751351545672495,"score_gpt":0.23193523546029296,"score_spread":0.22416010030572572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160414802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027169064,0.0007373752,0.96536636,0.00038926318,0.00013289883,0.00020553116,0.00009507295,0.0005329487,0.005371509],"genre_scores_gemma":[0.78925705,0.0007400964,0.20350832,0.00022486965,0.00013014581,0.00026375236,0.00029305133,0.000030166037,0.005552594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856466,0.0004372981,0.00011785966,0.00021354799,0.00046370935,0.0002030049],"domain_scores_gemma":[0.99892634,0.00019289248,0.00020397243,0.0004006186,0.00018938018,0.0000867623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573096,0.0003401364,0.0004669573,0.00068653905,0.0010955674,0.0009547831,0.0016641032,0.0008173652,0.0011307757],"category_scores_gemma":[0.0022863986,0.00021233533,0.0003654508,0.0011653106,0.0010380691,0.0029003501,0.0021029676,0.001004135,0.0006888388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051595864,0.00023887142,0.0012887752,0.00031454072,0.00006154365,0.0005313884,0.00074754155,0.15241443,0.05232185,0.4839342,0.0074294745,0.30020148],"study_design_scores_gemma":[0.0001308979,0.00055063743,0.0009459388,0.000051467807,0.00006797522,0.0007457239,0.00019617335,0.8103714,0.023738133,0.12979473,0.033278458,0.00012854068],"about_ca_topic_score_codex":0.0011009366,"about_ca_topic_score_gemma":0.00083819585,"teacher_disagreement_score":0.0016641032,"about_ca_system_score_codex":0.000849446,"about_ca_system_score_gemma":0.0014707434,"threshold_uncertainty_score":0.007178247},"labels":[],"label_agreement":null},{"id":"W2160658505","doi":"10.1109/ipdps.2011.41","title":"Connectivity Trade-offs in 3D Wireless Sensor Networks Using Directional Antennae","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Omnidirectional antenna; Orientation (vector space); Computer science; Antenna (radio); Directional antenna; Wireless; Range (aeronautics); Azimuth; Topology (electrical circuits); Telecommunications; Geometry; Mathematics; Engineering; Electrical engineering; Aerospace engineering","score_opus":0.03502869491223717,"score_gpt":0.23803274924862336,"score_spread":0.20300405433638619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160658505","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56074244,0.0010074566,0.43277892,0.0007380283,0.00003088349,0.000091322465,0.0001419614,0.00024471452,0.004224239],"genre_scores_gemma":[0.95773286,0.000463418,0.041147802,0.00004773514,0.0000144509695,0.00007153644,0.00009903542,0.000031394113,0.000391643],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846727,0.0008359321,0.00007944721,0.00017666034,0.00026690084,0.00017388599],"domain_scores_gemma":[0.99017525,0.0073977592,0.0009900482,0.00070692954,0.00033421835,0.0003957793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00192795,0.00074548705,0.00062013534,0.00069136196,0.00071875134,0.0009961516,0.0010314411,0.0009531235,0.00082793395],"category_scores_gemma":[0.010208332,0.00049430254,0.0006098787,0.0012560801,0.0013616482,0.0027252792,0.0017457097,0.00065649516,0.00012904342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028524178,0.00007010425,0.003645521,0.000114612165,0.00005446152,0.0001966974,0.00025188853,0.94160604,0.008255638,0.016643925,0.00042225732,0.028453512],"study_design_scores_gemma":[0.00005594838,0.00043921568,0.001947242,0.000016859785,0.00004525971,0.00035202844,0.00025478538,0.9651438,0.0047507347,0.025890676,0.0010779839,0.000025506873],"about_ca_topic_score_codex":0.0008455378,"about_ca_topic_score_gemma":0.0013894466,"teacher_disagreement_score":0.00192795,"about_ca_system_score_codex":0.0008639271,"about_ca_system_score_gemma":0.00031417247,"threshold_uncertainty_score":0.010196149},"labels":[],"label_agreement":null},{"id":"W2160715871","doi":"10.1007/978-3-540-39611-6_7","title":"Delivering Messages in Disconnected Mobile Ad Hoc Networks","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Protocol (science); Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Scheme (mathematics); Ad hoc wireless distribution service; Wireless Routing Protocol; Vehicular ad hoc network; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Mathematics; Network packet","score_opus":0.010127019722640133,"score_gpt":0.2252859922444902,"score_spread":0.21515897252185007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160715871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04161424,0.007725349,0.91519624,0.00079695927,0.0005730552,0.00017818385,0.00010526199,0.0014852094,0.03232551],"genre_scores_gemma":[0.58258307,0.014326109,0.3256808,0.00045003646,0.0008071142,0.0005026046,0.00067230075,0.00065510283,0.074322864],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999553,0.000118987824,0.00002742889,0.000058335707,0.00019766645,0.000044585177],"domain_scores_gemma":[0.99820566,0.001254804,0.000095486634,0.00016867714,0.00018911203,0.0000863142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634251,0.0007018011,0.00076325197,0.0010161017,0.000982854,0.0014685525,0.0016872751,0.0011239471,0.0036220502],"category_scores_gemma":[0.0040745256,0.0005903184,0.00026111488,0.0015222678,0.0009365897,0.003176612,0.0016855667,0.0009715432,0.0012041401],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052010355,0.0001834405,0.0009699926,0.0012186813,0.0000576639,0.0010146529,0.0018124984,0.130899,0.021118414,0.28306445,0.018903503,0.54023767],"study_design_scores_gemma":[0.0000948555,0.00035133827,0.00043912136,0.00017461127,0.00009160112,0.0009792782,0.00061131304,0.49742204,0.012124221,0.41187888,0.07578076,0.000051919502],"about_ca_topic_score_codex":0.0005827564,"about_ca_topic_score_gemma":0.0005417531,"teacher_disagreement_score":0.0036220502,"about_ca_system_score_codex":0.0005705201,"about_ca_system_score_gemma":0.0003583562,"threshold_uncertainty_score":0.012116969},"labels":[],"label_agreement":null},{"id":"W2160960055","doi":"10.1504/ijahuc.2008.017003","title":"A multi-gateway-based architecture for integrating ad hoc networks with the internet using multiple Foreign Agents","year":2008,"lang":"en","type":"article","venue":"International Journal of Ad Hoc and Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Ad hoc On-Demand Distance Vector Routing; The Internet; Wireless ad hoc network; Vehicular ad hoc network; Distributed computing; Optimized Link State Routing Protocol; Routing protocol; Wireless; Routing (electronic design automation); Telecommunications; World Wide Web; Network packet","score_opus":0.027430189065159656,"score_gpt":0.26521412167319003,"score_spread":0.23778393260803038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160960055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028746078,0.00059400406,0.95878935,0.000266604,0.00019208665,0.00037604079,0.000042266234,0.0034727843,0.00752079],"genre_scores_gemma":[0.2461099,0.00067279075,0.74460083,0.00026643722,0.0000710551,0.0002717788,0.0002294794,0.00009511888,0.0076826545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977714,0.000049924216,0.000020529853,0.000045926336,0.000080444726,0.000026048476],"domain_scores_gemma":[0.9998142,0.000019949233,0.000021613154,0.000046727084,0.00005727951,0.000040193314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043431512,0.0003718818,0.00036989225,0.00064953015,0.0005397424,0.00082978694,0.0015473372,0.0008473562,0.0010889511],"category_scores_gemma":[0.0003799811,0.00025971033,0.0005282198,0.00056616997,0.00042853656,0.0013685484,0.00085046847,0.0009269013,0.00055392523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040313444,0.0007416864,0.0046261484,0.00078428775,0.00033360516,0.0018941973,0.0008291472,0.09268656,0.19613485,0.18534486,0.010697437,0.50552416],"study_design_scores_gemma":[0.00020936725,0.0018488804,0.0036789195,0.00015517704,0.00047870516,0.003085499,0.00019033332,0.75450766,0.069323346,0.032355018,0.13399142,0.00017564218],"about_ca_topic_score_codex":0.0014869281,"about_ca_topic_score_gemma":0.0021268274,"teacher_disagreement_score":0.0015473372,"about_ca_system_score_codex":0.00044276577,"about_ca_system_score_gemma":0.000733054,"threshold_uncertainty_score":0.0036429167},"labels":[],"label_agreement":null},{"id":"W2161048429","doi":"10.1109/cnsr.2006.26","title":"Divalia: A Practical Framework for Anonymous Peer-to-Peer File Exchange in Wireless Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of Calgary","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Peer-to-peer; Mobile ad hoc network; Vehicular ad hoc network; Hash function; File sharing; Cryptography; Authentication (law); Wireless; Wireless network; Computer security; Network packet; World Wide Web; The Internet; Telecommunications","score_opus":0.02025493651843654,"score_gpt":0.29039887562779787,"score_spread":0.27014393910936135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161048429","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016035319,0.00030103448,0.99261004,0.00037370372,0.00008162105,0.00022965534,0.000037962887,0.0008738591,0.0038886233],"genre_scores_gemma":[0.1313743,0.0010630375,0.85634243,0.00022927641,0.00021769296,0.0008834759,0.0001714424,0.0002507581,0.00946762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966828,0.0012733397,0.00018426238,0.0002918315,0.0013282754,0.00023948493],"domain_scores_gemma":[0.99770457,0.0008527691,0.00017379427,0.0008283444,0.0002757205,0.0001648586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004575289,0.00077767053,0.00078841986,0.0010399291,0.0023518708,0.0032208734,0.0035758452,0.0019231243,0.0040476774],"category_scores_gemma":[0.00663473,0.0007406203,0.0007816811,0.00095009344,0.0031946234,0.006420119,0.0058296714,0.002904435,0.0018569723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008821843,0.00007068278,0.0002037959,0.00021958834,0.000025774612,0.0004128119,0.00061045354,0.02462359,0.0050417013,0.8669881,0.009156485,0.09255877],"study_design_scores_gemma":[0.00013234335,0.0002454152,0.00016730517,0.0001639483,0.000043498894,0.0016424111,0.00024557818,0.29224634,0.009382037,0.40521044,0.29038978,0.00013096503],"about_ca_topic_score_codex":0.0010168963,"about_ca_topic_score_gemma":0.0011897717,"teacher_disagreement_score":0.004575289,"about_ca_system_score_codex":0.0009967672,"about_ca_system_score_gemma":0.0018434285,"threshold_uncertainty_score":0.024196684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.049739119508639754,"score_gpt":0.30679542447167674,"score_spread":0.257056304963037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161060874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059679605,0.0026577176,0.9171239,0.00081404985,0.0005577723,0.0008435213,0.000198733,0.0035785113,0.014546102],"genre_scores_gemma":[0.7107566,0.0011523791,0.27724135,0.0005990766,0.00014782783,0.0005287586,0.00035516766,0.0001267064,0.009092162],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990922,0.0002611471,0.000052280502,0.00012739522,0.00032587492,0.00014112478],"domain_scores_gemma":[0.9988294,0.00033961295,0.00018799466,0.00027497933,0.0002651291,0.00010285727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013065856,0.000689533,0.0007487961,0.00089831377,0.0010749128,0.00082384486,0.0023275919,0.00079426816,0.00087542273],"category_scores_gemma":[0.0023534142,0.00023627837,0.00040142593,0.0010645939,0.00077091437,0.0014541743,0.0019813427,0.0007635076,0.00026484366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074574153,0.0004328088,0.0025147523,0.00064663525,0.00021729956,0.0013775153,0.0010450451,0.19631764,0.053459894,0.09745849,0.02059853,0.6251857],"study_design_scores_gemma":[0.00015967734,0.0005212717,0.0005743904,0.000057208857,0.00008435616,0.0010551899,0.00019987002,0.9205274,0.010721748,0.021136574,0.044868737,0.00009359959],"about_ca_topic_score_codex":0.0041654687,"about_ca_topic_score_gemma":0.006725231,"teacher_disagreement_score":0.0041654687,"about_ca_system_score_codex":0.0007734022,"about_ca_system_score_gemma":0.001927548,"threshold_uncertainty_score":0.008282423},"labels":[],"label_agreement":null},{"id":"W2161281242","doi":"10.1145/1860684.1860690","title":"Decomposing broadcast algorithms using abstract MAC layers","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Division of Computer and Network Systems; Air Force Office of Scientific Research; Division of Computing and Communication Foundations; Engineering and Physical Sciences Research Council","keywords":"Computer science; Probabilistic logic; Layer (electronics); Probabilistic analysis of algorithms; Algorithm; Wireless; Algorithm design; Computer network; Physical layer; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.01979548141769421,"score_gpt":0.27663315862782295,"score_spread":0.25683767721012873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161281242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007450367,0.0004218862,0.98881245,0.00024142771,0.00007305173,0.00009187205,0.000037825368,0.00023016328,0.0026409978],"genre_scores_gemma":[0.2573539,0.0018276159,0.7359606,0.0004904347,0.00037425765,0.00048074935,0.0002447306,0.0002994707,0.002968146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99264354,0.0022315923,0.00074317167,0.00064450427,0.0031243726,0.00061295554],"domain_scores_gemma":[0.9859108,0.0075331153,0.0010111054,0.0038226412,0.00142674,0.0002957262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005503062,0.0014456084,0.0013404627,0.001547578,0.00072289014,0.0038288278,0.0020293833,0.0013673363,0.0020067529],"category_scores_gemma":[0.01704872,0.0011472064,0.0017180796,0.0012494362,0.0024907105,0.010521022,0.0035041375,0.0047744107,0.000773459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002357261,0.0000915778,0.000906807,0.00039210916,0.00009225953,0.000102663056,0.00039173034,0.22560994,0.009490712,0.693942,0.001655702,0.067088656],"study_design_scores_gemma":[0.00005496748,0.000097497774,0.00020966753,0.00007170985,0.00007298959,0.000069990194,0.00006250208,0.6809559,0.004646998,0.3061773,0.0075356606,0.000044763317],"about_ca_topic_score_codex":0.0011827264,"about_ca_topic_score_gemma":0.00073040347,"teacher_disagreement_score":0.005503062,"about_ca_system_score_codex":0.0017664875,"about_ca_system_score_gemma":0.0023334601,"threshold_uncertainty_score":0.02910328},"labels":[],"label_agreement":null},{"id":"W2161515511","doi":"10.1109/glocom.2006.982","title":"WSN16-1: A Weighted Clustering Algorithm Using Local Cluster-heads Election for QoS in MANETs","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Cluster analysis; Computer network; Quality of service; Network packet; Routing protocol; Distributed computing; Mobile ad hoc network; Wireless ad hoc network; Network topology; Topology (electrical circuits); Algorithm; Wireless; Mathematics; Artificial intelligence","score_opus":0.009823099420125637,"score_gpt":0.24271082640668218,"score_spread":0.23288772698655655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161515511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011751042,0.0004668882,0.9847514,0.00013029383,0.00013698816,0.00012761664,0.000047145804,0.0011666323,0.0014219249],"genre_scores_gemma":[0.2244573,0.0006334531,0.7689806,0.00015895504,0.000113275615,0.00032545888,0.0005075707,0.0002719731,0.0045514638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993487,0.0001656339,0.00004158339,0.00012836613,0.00026565834,0.000050032108],"domain_scores_gemma":[0.99945945,0.00012280107,0.00005538441,0.00008577116,0.00023462836,0.000041955365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010211047,0.00081992,0.000866101,0.0011921052,0.0007149442,0.00057137175,0.0022208295,0.0007858392,0.0011987397],"category_scores_gemma":[0.0016606632,0.00032276651,0.0004327313,0.0015005749,0.00044103636,0.0015230195,0.0010372926,0.00066083437,0.000742326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033314567,0.00019096896,0.0023728628,0.00024701317,0.00022959609,0.00013590294,0.00020621826,0.3263294,0.025450973,0.016920736,0.009238545,0.6183446],"study_design_scores_gemma":[0.00006990421,0.00016748498,0.0006560692,0.000014190542,0.00004478855,0.00015204707,0.000057839326,0.97105545,0.008622822,0.0053642266,0.013748943,0.000046178047],"about_ca_topic_score_codex":0.0026040361,"about_ca_topic_score_gemma":0.0036846814,"teacher_disagreement_score":0.0026040361,"about_ca_system_score_codex":0.0005711581,"about_ca_system_score_gemma":0.0008570077,"threshold_uncertainty_score":0.005400181},"labels":[],"label_agreement":null},{"id":"W2161605375","doi":"10.1109/icc.2010.5501865","title":"A Cross Layer Broadcast Protocol for Multihop Emergency Message Dissemination in Inter-Vehicle Communication","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Dissemination; Computer science; Broadcast radiation; Relay; Atomic broadcast; Redundancy (engineering); Vehicular ad hoc network; Broadcast domain; Wireless ad hoc network; Broadcast communication network; Node (physics); Wireless; Broadcasting (networking); Distributed computing; Telecommunications; Network packet; Engineering","score_opus":0.023002828105632308,"score_gpt":0.3668639517179456,"score_spread":0.3438611236123133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161605375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006411577,0.0018613859,0.9867512,0.0003213767,0.00037129023,0.00031148037,0.00006739179,0.00075584353,0.003148411],"genre_scores_gemma":[0.5479498,0.0031384798,0.4348351,0.00081281847,0.00034649257,0.0014956559,0.0006922457,0.000136575,0.01059285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889743,0.00034672656,0.00010575904,0.000120742145,0.000449802,0.000079533],"domain_scores_gemma":[0.99897265,0.0003762581,0.00011696871,0.00012396114,0.0003533032,0.00005692581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015574879,0.00059350644,0.00072714244,0.0008185257,0.0007998477,0.0010696735,0.0012380925,0.00092224294,0.0014040358],"category_scores_gemma":[0.0026298072,0.00029664385,0.0005304029,0.00071377424,0.00054241036,0.00120883,0.0012981268,0.0013909652,0.00047034307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074093195,0.00043820989,0.0013150203,0.0016058913,0.00044676464,0.0015987298,0.0008541477,0.17094457,0.10967537,0.17345378,0.028692925,0.5102337],"study_design_scores_gemma":[0.00022562346,0.0010416091,0.0007267693,0.00011656288,0.00027657967,0.0014374704,0.0001275304,0.87823826,0.027013453,0.015728796,0.07493959,0.00012772757],"about_ca_topic_score_codex":0.0011695554,"about_ca_topic_score_gemma":0.0013015157,"teacher_disagreement_score":0.0015574879,"about_ca_system_score_codex":0.0005516425,"about_ca_system_score_gemma":0.0009007105,"threshold_uncertainty_score":0.008236885},"labels":[],"label_agreement":null},{"id":"W2161904217","doi":"10.1145/1641804.1641814","title":"Gateway-assisted max-min rate allocation for wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Wireless; Gateway (web page); Mesh networking; Wireless network; Distributed computing; Telecommunications; World Wide Web","score_opus":0.015391393183545045,"score_gpt":0.24492336638796125,"score_spread":0.2295319732044162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161904217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026111003,0.001123408,0.96989274,0.00016880916,0.0001117492,0.000038370803,0.00002405481,0.0004210555,0.0021088794],"genre_scores_gemma":[0.87247175,0.0006305744,0.124940574,0.000104405735,0.00018099819,0.000091446964,0.000044139462,0.00005189326,0.0014842608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994474,0.00023817673,0.000035427176,0.000075265736,0.00015023482,0.000053491756],"domain_scores_gemma":[0.9991978,0.000423008,0.00011142624,0.00012763732,0.00010463913,0.000035644887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020332576,0.00036161227,0.0004248461,0.00035447977,0.0004445757,0.00061966677,0.0009850617,0.00037479293,0.0005990501],"category_scores_gemma":[0.0032677613,0.0001951487,0.0002361421,0.00045210076,0.0007085098,0.0009369713,0.0006143369,0.0005490724,0.00016037858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040939802,0.00010376219,0.001516096,0.0001899467,0.00006904489,0.00018943891,0.00026067073,0.6512275,0.029948104,0.1324157,0.0037167831,0.17995362],"study_design_scores_gemma":[0.000018484214,0.00007575644,0.00023748183,0.000008399868,0.000013164734,0.000065741115,0.000015776,0.9650638,0.0038996376,0.027630784,0.002955092,0.000015716685],"about_ca_topic_score_codex":0.00075683737,"about_ca_topic_score_gemma":0.00068732136,"teacher_disagreement_score":0.0020332576,"about_ca_system_score_codex":0.00071104674,"about_ca_system_score_gemma":0.00060639204,"threshold_uncertainty_score":0.010753036},"labels":[],"label_agreement":null},{"id":"W2161931435","doi":"10.1109/icc.2006.255095","title":"A Game Theoretic Model to Handle Network Intrusions over Multiple Packets","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network packet; Computer science; Path (computing); Router; Computer network; Sampling (signal processing); Game theory; Routing (electronic design automation); Packet drop attack; Distributed computing; Routing protocol; Mathematics; Telecommunications; Link-state routing protocol","score_opus":0.06062968476393932,"score_gpt":0.31584585955154904,"score_spread":0.2552161747876097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161931435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006652093,0.00024242014,0.9822311,0.0008688505,0.000109715365,0.00020327681,0.00013313787,0.00009396972,0.009465497],"genre_scores_gemma":[0.643994,0.0012805008,0.33163294,0.0007785017,0.0003517011,0.0011545777,0.00025954042,0.00010693145,0.020441443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973219,0.0013725244,0.00011270676,0.00036063977,0.0005048017,0.00032745168],"domain_scores_gemma":[0.9976088,0.001576056,0.00025502028,0.00013717054,0.00020825247,0.00021483075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002728459,0.001968761,0.0013997337,0.0010333743,0.0011729699,0.002794742,0.0036191638,0.0029968696,0.004673098],"category_scores_gemma":[0.004637765,0.0008537402,0.0013679562,0.0011879276,0.002500337,0.0046460647,0.0019442424,0.0036961825,0.0007724767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000491853,0.00010476535,0.00027485352,0.00008411231,0.000046678688,0.0002272471,0.00016759442,0.5350177,0.000993968,0.45389956,0.0020646842,0.0070695844],"study_design_scores_gemma":[0.000027381691,0.000051398427,0.000051350216,0.00001204302,0.00001426884,0.000069074624,0.000036910733,0.88976985,0.00012310069,0.10686313,0.0029643169,0.000017255981],"about_ca_topic_score_codex":0.0071686916,"about_ca_topic_score_gemma":0.0054866043,"teacher_disagreement_score":0.0071686916,"about_ca_system_score_codex":0.0034645298,"about_ca_system_score_gemma":0.002550854,"threshold_uncertainty_score":0.025137067},"labels":[],"label_agreement":null},{"id":"W2162151497","doi":"10.1155/2013/794549","title":"On the Relationship between Multicast/Broadcast Throughput and Resource Utilizations in Wireless Mesh Networks","year":2013,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Computer network; Multicast; Multimedia Broadcast Multicast Service; Wireless mesh network; Throughput; Distributed computing; Source-specific multicast; Wireless network; Channel (broadcasting); Broadcast radiation; Bandwidth (computing); Node (physics); Atomic broadcast; Wireless; Broadcasting (networking); Network packet; Telecommunications","score_opus":0.04258274857547446,"score_gpt":0.26459206840158045,"score_spread":0.222009319826106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162151497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28224522,0.011972408,0.6831172,0.0027062623,0.00019468213,0.00007236144,0.00020288539,0.00037711224,0.01911195],"genre_scores_gemma":[0.98037064,0.002981908,0.015073842,0.00010870719,0.0002053308,0.000049871927,0.000044605214,0.00008965551,0.0010753804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787974,0.0011933275,0.00005974754,0.0001381222,0.00043865058,0.00029055864],"domain_scores_gemma":[0.9768052,0.0205223,0.001183244,0.00040241252,0.00093866827,0.000148265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043513137,0.0008637671,0.00076762005,0.001418389,0.00083809596,0.0016760095,0.000913922,0.00084875536,0.0011914286],"category_scores_gemma":[0.026521634,0.0004434828,0.00034703437,0.0020403573,0.0015493695,0.0033555913,0.0011474502,0.0011133447,0.00023270326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017682463,0.00008769773,0.003918272,0.0001812003,0.000081542625,0.00023318025,0.00020035193,0.88756466,0.0032047995,0.073859006,0.0015356002,0.028956762],"study_design_scores_gemma":[0.0000039994397,0.000036106798,0.00070151495,0.000025260895,0.000019975658,0.000076441735,0.00006456393,0.97684187,0.0010797592,0.020778473,0.000361753,0.000010295462],"about_ca_topic_score_codex":0.002247829,"about_ca_topic_score_gemma":0.0015178792,"teacher_disagreement_score":0.0043513137,"about_ca_system_score_codex":0.0020126079,"about_ca_system_score_gemma":0.00069375517,"threshold_uncertainty_score":0.02301222},"labels":[],"label_agreement":null},{"id":"W2162214249","doi":"10.1109/cnsr.2006.56","title":"Trusted Computing for Protecting Ad-hoc Routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Trusted Computing; Trusted Network Connect; Computer security; Mobile ad hoc network; Overhead (engineering); Vehicular ad hoc network; Routing protocol; Optimized Link State Routing Protocol; Routing (electronic design automation); Distributed computing; Wireless; Network packet","score_opus":0.013543248897527577,"score_gpt":0.2387350188530689,"score_spread":0.2251917699555413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162214249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011585377,0.01849769,0.89598066,0.005317634,0.0021633096,0.0004221221,0.0002164939,0.002460131,0.063356586],"genre_scores_gemma":[0.6908796,0.02047442,0.2591773,0.0012911594,0.002232331,0.0008776392,0.00053471304,0.00046451643,0.024068313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935127,0.0019101509,0.0004807184,0.00059053296,0.0030007875,0.0005050737],"domain_scores_gemma":[0.9912463,0.0035724598,0.0007150761,0.002892219,0.001179555,0.0003944738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028795556,0.0012660098,0.0011494517,0.0014993807,0.0027637715,0.0048931497,0.0021297066,0.0029070943,0.004894836],"category_scores_gemma":[0.01328254,0.0007129292,0.0009731789,0.0024057592,0.0039478154,0.0062385476,0.0044675884,0.004373005,0.002757945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022930995,0.000060260878,0.00049435295,0.00073072687,0.0000712594,0.0007145205,0.0007191017,0.031434365,0.0042564915,0.7746623,0.01973323,0.16689412],"study_design_scores_gemma":[0.0001455933,0.00016261077,0.00025694445,0.00087735784,0.000105187435,0.0012626448,0.00026568133,0.14790559,0.0111697465,0.6806923,0.15705165,0.00010473239],"about_ca_topic_score_codex":0.0014387291,"about_ca_topic_score_gemma":0.00077515794,"teacher_disagreement_score":0.004894836,"about_ca_system_score_codex":0.0020767446,"about_ca_system_score_gemma":0.0025268425,"threshold_uncertainty_score":0.016374826},"labels":[],"label_agreement":null},{"id":"W2162375717","doi":"10.1109/glocomw.2008.ecp.35","title":"Uplink Scheduling in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Wireless mesh network; Maximum throughput scheduling; Fairness measure; Computer science; Computer network; Wireless broadband; Scheduling (production processes); Throughput; Wireless network; Switched mesh; Router; Service set; Mesh networking; Max-min fairness; Wireless; Distributed computing; Round-robin scheduling; Quality of service; Dynamic priority scheduling; Wi-Fi array; Telecommunications; Resource allocation; Engineering","score_opus":0.017173843553991753,"score_gpt":0.23139877569784567,"score_spread":0.2142249321438539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162375717","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06883331,0.0042624194,0.9183676,0.00035463515,0.0004507515,0.00008536573,0.00007006174,0.00051991356,0.0070558875],"genre_scores_gemma":[0.8981356,0.0014741969,0.0980043,0.000077215795,0.0002846969,0.00006968081,0.00006695057,0.00006837973,0.0018189455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892753,0.00052892714,0.000052447052,0.00009250593,0.0002943996,0.00010429605],"domain_scores_gemma":[0.99847025,0.0008991597,0.00015081251,0.00019169299,0.0002359146,0.000052173466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017248022,0.00030569787,0.00051659025,0.00052000745,0.0006102307,0.00089958357,0.00057845854,0.0003764485,0.0008495823],"category_scores_gemma":[0.005185254,0.00017456047,0.00018472977,0.0008402594,0.0003313867,0.0009117498,0.0005225151,0.00040860227,0.00017797577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024626474,0.00009367198,0.0016254527,0.00019753499,0.000045761615,0.000107250315,0.000107912274,0.69835603,0.008745969,0.042068433,0.0028067206,0.24559899],"study_design_scores_gemma":[0.000016699845,0.000065009364,0.0002437385,0.000011903435,0.000015180939,0.000036320238,0.00003545632,0.9783478,0.0030876677,0.015109602,0.003021448,0.000009272438],"about_ca_topic_score_codex":0.0018923392,"about_ca_topic_score_gemma":0.0012547008,"teacher_disagreement_score":0.0018923392,"about_ca_system_score_codex":0.00069098815,"about_ca_system_score_gemma":0.0007645167,"threshold_uncertainty_score":0.009121776},"labels":[],"label_agreement":null},{"id":"W2162588452","doi":"10.1007/978-3-540-28634-9_26","title":"Lifetime-Extended, Power-Aware, Non-position Base Localized Routing in Hybrid Ad-Hoc/Infrastructure Network","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Routing (electronic design automation); Base (topology); Base station; Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Wireless","score_opus":0.0055256614143444575,"score_gpt":0.21888714078620314,"score_spread":0.21336147937185868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162588452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0528636,0.006125601,0.92431134,0.00043718136,0.00023370616,0.000040296916,0.00006926931,0.0010695761,0.0148493815],"genre_scores_gemma":[0.82490975,0.0031032166,0.15293728,0.00011127358,0.00019108262,0.00005477022,0.00016393306,0.00015794708,0.018370703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998735,0.000029570634,0.000005594707,0.000027008104,0.0000483962,0.000015867528],"domain_scores_gemma":[0.99979836,0.00007504099,0.000020796575,0.000050529492,0.000041576,0.000013726886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032245895,0.00034616847,0.0003803645,0.00025862706,0.00025522,0.00047792858,0.0012564516,0.0003870846,0.0010335802],"category_scores_gemma":[0.00047498825,0.00022064886,0.00023361939,0.00031720442,0.0002910169,0.0010599031,0.00061603024,0.00048801457,0.00029460862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026029113,0.00009218002,0.0007856649,0.00036398982,0.000059656308,0.00036635413,0.00025540934,0.39672065,0.052975085,0.07400466,0.008327636,0.46578842],"study_design_scores_gemma":[0.000017313381,0.00029580665,0.00065907056,0.00003518999,0.000056207173,0.00077133515,0.00007133939,0.9434123,0.011382344,0.030590197,0.012677497,0.00003133883],"about_ca_topic_score_codex":0.00035032904,"about_ca_topic_score_gemma":0.00092705013,"teacher_disagreement_score":0.0012564516,"about_ca_system_score_codex":0.0003527514,"about_ca_system_score_gemma":0.00027016085,"threshold_uncertainty_score":0.0034576654},"labels":[],"label_agreement":null},{"id":"W2163004199","doi":"10.1109/tmc.2008.26","title":"A Mobile-Directory Approach to Service Discovery in Wireless Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Forskningsrådet om Hälsa, Arbetsliv och Välfärd","keywords":"Computer science; Service discovery; Computer network; Directory; Directory service; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Network topology; Service (business); Wireless network; Heuristic; Wireless; World Wide Web; Web service; Artificial intelligence; Telecommunications","score_opus":0.0189154969990156,"score_gpt":0.23876511610395823,"score_spread":0.21984961910494263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163004199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00905023,0.0009613567,0.9863831,0.00030197884,0.000056786103,0.00005535703,0.000028579236,0.00034170714,0.002820897],"genre_scores_gemma":[0.4672232,0.001558815,0.5262264,0.00016427934,0.00019314617,0.00021760269,0.000110414534,0.00005681843,0.0042493786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991891,0.00036035088,0.00003649049,0.00011895029,0.00022170214,0.00007348435],"domain_scores_gemma":[0.9993087,0.0003403465,0.00006715422,0.0001342446,0.00009096768,0.00005853604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010105993,0.00039924297,0.00059427513,0.00087487017,0.0010365023,0.0010509709,0.0013648148,0.0008552778,0.0014093395],"category_scores_gemma":[0.0020804894,0.00028568212,0.00035280336,0.001287977,0.0011287879,0.0017796101,0.0012529494,0.00074212725,0.0003764842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015975017,0.00013347804,0.0013444443,0.00019477874,0.000054918157,0.00019411756,0.0002988452,0.43735167,0.0047437865,0.34240514,0.004173377,0.20894569],"study_design_scores_gemma":[0.00002373866,0.00009204381,0.00014616577,0.00001453503,0.000015443136,0.00019454832,0.0000569438,0.9317874,0.0013824338,0.05670863,0.0095626665,0.00001546197],"about_ca_topic_score_codex":0.0021403958,"about_ca_topic_score_gemma":0.0037903807,"teacher_disagreement_score":0.0021403958,"about_ca_system_score_codex":0.0009039303,"about_ca_system_score_gemma":0.0011453584,"threshold_uncertainty_score":0.0065585375},"labels":[],"label_agreement":null},{"id":"W2163048703","doi":"10.1109/sarnof.2010.5469704","title":"Provisioning backhaul traffic flows in TDMA/OFDMA infrastructure Wireless Mesh Networks with near-perfect QoS","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Backhaul (telecommunications); Computer science; Computer network; Time division multiple access; Wireless mesh network; Quality of service; Scheduling (production processes); Beamforming; Frequency-division multiple access; Wireless; Wireless network; Channel (broadcasting); Mathematical optimization; Base station; Orthogonal frequency-division multiplexing; Telecommunications; Mathematics","score_opus":0.0034504977645576944,"score_gpt":0.2000117285165861,"score_spread":0.19656123075202842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163048703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15813142,0.00017661402,0.83810383,0.00012292193,0.000030658033,0.00008722175,0.000055004137,0.00022505589,0.003067159],"genre_scores_gemma":[0.7894745,0.00019890262,0.20915504,0.000031107196,0.000020800066,0.00010264646,0.00006501648,0.000020724052,0.0009312848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998274,0.00006239597,0.0000070776455,0.000020553845,0.000041812888,0.000040756702],"domain_scores_gemma":[0.99960905,0.00023325469,0.000051600568,0.000031110943,0.000053220017,0.000021758664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006067187,0.00035283025,0.0002674744,0.00028653702,0.000517975,0.00037236867,0.0004949555,0.00030362315,0.0006780906],"category_scores_gemma":[0.0013098333,0.00016582139,0.00021195629,0.00036803418,0.0004337603,0.00046200625,0.00038997937,0.00029456313,0.000091430586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006674195,0.000041169533,0.0011424498,0.000043876218,0.000012531546,0.00006630951,0.000060695787,0.9385504,0.0063425233,0.012583876,0.00041206475,0.040677413],"study_design_scores_gemma":[0.00000722874,0.00002507039,0.000101140584,0.0000017245743,0.0000023949854,0.000014434411,0.000013538566,0.99631655,0.0006711489,0.0025749279,0.00026932653,0.00000238404],"about_ca_topic_score_codex":0.003946175,"about_ca_topic_score_gemma":0.0052647213,"teacher_disagreement_score":0.003946175,"about_ca_system_score_codex":0.00067012757,"about_ca_system_score_gemma":0.000765907,"threshold_uncertainty_score":0.007846415},"labels":[],"label_agreement":null},{"id":"W2163310702","doi":"10.1109/ccece.2007.24","title":"Performance of Mobile Agent Based Network Topology Discovery","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Network topology; Mobile ad hoc network; Distributed computing; Logical topology; Wireless ad hoc network; Topology (electrical circuits); Wireless network; Simple Network Management Protocol; Neighbor Discovery Protocol; Network management; Wireless; The Internet; Network packet; Engineering; Telecommunications; Internet protocol suite; World Wide Web","score_opus":0.009275369815417238,"score_gpt":0.23552116562285494,"score_spread":0.2262457958074377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163310702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9162389,0.003063737,0.05102506,0.00084385613,0.0005537137,0.00025361305,0.00092265767,0.009261889,0.017836574],"genre_scores_gemma":[0.98815745,0.00022683908,0.009653987,0.00003628439,0.000020418087,0.000033613273,0.00063564983,0.000067399,0.001168396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996671,0.0009004441,0.00023027472,0.00042418035,0.0014773178,0.00029683727],"domain_scores_gemma":[0.989611,0.0056145936,0.0007253479,0.0011376911,0.002322556,0.0005887428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029285594,0.0005973308,0.0010837555,0.0017150008,0.00081323565,0.0018464555,0.0011908772,0.0009558116,0.0012995105],"category_scores_gemma":[0.013014303,0.00021074779,0.00023110972,0.0015811627,0.00045260158,0.0016433273,0.00089627,0.00065406144,0.000610006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0060250866,0.001248305,0.027894482,0.00048745034,0.00030557453,0.0006559972,0.00052606896,0.6362074,0.03123047,0.0069349417,0.010507297,0.2779769],"study_design_scores_gemma":[0.0000939716,0.0007422378,0.005730446,0.000018915423,0.00005470484,0.00031108037,0.00015603052,0.97207165,0.01633336,0.0009839976,0.0034642383,0.000039384235],"about_ca_topic_score_codex":0.0058993404,"about_ca_topic_score_gemma":0.002355891,"teacher_disagreement_score":0.0058993404,"about_ca_system_score_codex":0.0012636683,"about_ca_system_score_gemma":0.00088027574,"threshold_uncertainty_score":0.01548785},"labels":[],"label_agreement":null},{"id":"W2163711090","doi":"10.1109/milcom.2008.4753215","title":"A trust-based security architecture for tactical MANETS","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Computer network; Computer security; Mobile ad hoc network; Routing protocol; Cryptographic protocol; Routing (electronic design automation); Architecture; Enterprise information security architecture; Cryptography","score_opus":0.01443679182783158,"score_gpt":0.2401761102634779,"score_spread":0.22573931843564632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163711090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009502113,0.0010592535,0.97228956,0.0015675323,0.00026081724,0.00026100385,0.000053926364,0.0014363197,0.013569517],"genre_scores_gemma":[0.5699519,0.0024975003,0.39913255,0.0005458125,0.00024260287,0.0005114565,0.00032088743,0.00019278453,0.026604468],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988568,0.00023794587,0.00015158941,0.00015380798,0.00046811023,0.00013182015],"domain_scores_gemma":[0.99879104,0.00016790432,0.00016366481,0.00024672618,0.0004216101,0.00020899098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019329075,0.00055409473,0.00047465943,0.00065418426,0.0015441065,0.002799565,0.0017831153,0.0017792815,0.0023782777],"category_scores_gemma":[0.0026468113,0.00050932495,0.00062729564,0.0006867017,0.0014391142,0.0046554636,0.0028934774,0.00250819,0.0014668041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020686939,0.00015275633,0.0009861271,0.0003271107,0.00011080347,0.0009824894,0.0015785631,0.078214474,0.019466989,0.73750246,0.013173501,0.1472979],"study_design_scores_gemma":[0.00007383439,0.0004860469,0.0006185348,0.00025385962,0.00016818845,0.001380734,0.0004336882,0.51426,0.014462727,0.26964185,0.19805671,0.00016386314],"about_ca_topic_score_codex":0.002822186,"about_ca_topic_score_gemma":0.002415921,"teacher_disagreement_score":0.002822186,"about_ca_system_score_codex":0.0013006025,"about_ca_system_score_gemma":0.0017540759,"threshold_uncertainty_score":0.010222316},"labels":[],"label_agreement":null},{"id":"W2163876445","doi":"10.1109/glocom.2008.ecp.353","title":"A Secure Key Management Scheme for Wireless and Mobile Ad Hoc Networks Using Frequency-Based Approach: Proof and Correctness","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Key management; Computer science; Key (lock); Key distribution; Encryption; Correctness; Computer security; Computer network; Wireless ad hoc network; Mobile ad hoc network; Scheme (mathematics); Security association; Public-key cryptography; Symmetric-key algorithm; Key generation; Wireless; Telecommunications; Cloud computing; Algorithm; Security information and event management; Cloud computing security","score_opus":0.02076796292371894,"score_gpt":0.23003322790205002,"score_spread":0.2092652649783311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163876445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061888467,0.00040454397,0.9882967,0.00058330543,0.00015666998,0.00019340828,0.00004718027,0.0003501494,0.0037791906],"genre_scores_gemma":[0.43761954,0.001308729,0.5532089,0.0004879939,0.00035358948,0.0006496808,0.00018211783,0.0001314789,0.00605803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696606,0.0006268425,0.000281218,0.00030323633,0.0015457643,0.00027690778],"domain_scores_gemma":[0.9955527,0.0018293934,0.0006734983,0.0008938184,0.00089790527,0.00015257693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034331603,0.00065812457,0.000746926,0.0010091667,0.0015348317,0.0023763902,0.0012601693,0.0017413109,0.002103238],"category_scores_gemma":[0.0071269535,0.0005563054,0.00092805986,0.0010480303,0.0030773543,0.0053860056,0.0031840072,0.0018612028,0.0011857077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012106885,0.00008610731,0.00031143223,0.00036022632,0.00005494893,0.00044982322,0.0005878455,0.015601342,0.01748496,0.89102525,0.0040360694,0.06988093],"study_design_scores_gemma":[0.00059974595,0.00070533325,0.0005253647,0.00028442216,0.00018478143,0.0030840903,0.00020947037,0.2629598,0.042300183,0.591627,0.097247414,0.00027232882],"about_ca_topic_score_codex":0.00044316208,"about_ca_topic_score_gemma":0.00030479894,"teacher_disagreement_score":0.0034331603,"about_ca_system_score_codex":0.0010864395,"about_ca_system_score_gemma":0.0023791566,"threshold_uncertainty_score":0.018156469},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025765794179914397,"score_gpt":0.277298228032923,"score_spread":0.2515324338530086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163943736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016435076,0.006281592,0.9615806,0.0007366139,0.00052594143,0.00045863717,0.00030952902,0.0042699366,0.009402177],"genre_scores_gemma":[0.31466857,0.009219932,0.6596486,0.00064324355,0.00046999057,0.0009982357,0.0015533987,0.0003658845,0.012432172],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967897,0.000072728246,0.000023957442,0.00003279313,0.00017014987,0.000021418535],"domain_scores_gemma":[0.99961436,0.0001174605,0.00005493227,0.00006794255,0.00011141806,0.00003387847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005545092,0.0005525729,0.0005122091,0.00078205473,0.00045965475,0.00061875884,0.0013617008,0.0007139603,0.0013215138],"category_scores_gemma":[0.0011565121,0.00020366607,0.0002810238,0.000693904,0.00046683804,0.001232547,0.00090901484,0.0009339556,0.0007405229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034727526,0.00019833905,0.0006265123,0.0012687473,0.00016799332,0.00079242914,0.0003438561,0.083486885,0.09521808,0.06566422,0.02997225,0.7219133],"study_design_scores_gemma":[0.0002392919,0.0008790641,0.0010444383,0.00013781503,0.00022859713,0.0029106704,0.00015108679,0.59887975,0.056881387,0.04264882,0.29583254,0.00016652736],"about_ca_topic_score_codex":0.0004836058,"about_ca_topic_score_gemma":0.0008233421,"teacher_disagreement_score":0.0013617008,"about_ca_system_score_codex":0.00028821902,"about_ca_system_score_gemma":0.0005380964,"threshold_uncertainty_score":0.004420936},"labels":[],"label_agreement":null},{"id":"W2164224206","doi":"10.1109/icnp.2006.320213","title":"Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Transmission (telecommunications); Protocol (science); Wireless sensor network; Geocast; Mobile ad hoc network; Data transmission; Wireless; Vehicular ad hoc network; Distributed computing; Telecommunications; Network packet; Medicine","score_opus":0.010733672922338289,"score_gpt":0.21108865525066112,"score_spread":0.20035498232832283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164224206","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021342566,0.001927187,0.9729101,0.00027850142,0.00017818363,0.000057494108,0.000018471348,0.00029812436,0.0029893764],"genre_scores_gemma":[0.7316511,0.002180294,0.26245335,0.00016575305,0.00035238243,0.0001890374,0.00009254467,0.00007388522,0.0028415723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910223,0.00031822393,0.0000373267,0.000091059715,0.00038756165,0.00006364388],"domain_scores_gemma":[0.9986829,0.00080212665,0.00016400925,0.00014540827,0.00014086317,0.00006467503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010320899,0.00050253235,0.0006330512,0.00077409897,0.00077281136,0.0010282192,0.0014066021,0.0011160966,0.0011419109],"category_scores_gemma":[0.0039304704,0.00028340766,0.0004733701,0.0009203881,0.0012567682,0.0025259953,0.0014468258,0.0009032001,0.00025676787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047481278,0.00012998053,0.0008203255,0.0005506247,0.000101413,0.00060439383,0.00041852283,0.4278295,0.0191519,0.27297884,0.005742549,0.27119705],"study_design_scores_gemma":[0.000037721875,0.0002498137,0.00018200523,0.000031121686,0.000040466188,0.00043418378,0.00006711632,0.92685133,0.004054407,0.058831867,0.009183229,0.000036763628],"about_ca_topic_score_codex":0.0014201812,"about_ca_topic_score_gemma":0.0009271261,"teacher_disagreement_score":0.0014201812,"about_ca_system_score_codex":0.0007051381,"about_ca_system_score_gemma":0.0007097012,"threshold_uncertainty_score":0.0054582357},"labels":[],"label_agreement":null},{"id":"W2164367088","doi":"10.1109/mnet.2011.5687952","title":"Toward scalable cut vertex and link detection with applications in wireless ad hoc networks","year":2011,"lang":"en","type":"article","venue":"IEEE Network","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scalability; Wireless ad hoc network; Distributed computing; Correctness; Network partition; Partition (number theory); Fault tolerance; Node (physics); Wireless; Algorithm","score_opus":0.016082498406386113,"score_gpt":0.20911764243544415,"score_spread":0.19303514402905803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164367088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006374831,0.0007819076,0.9895912,0.00050433096,0.00006153588,0.00007652101,0.000026409572,0.00061973196,0.0019636294],"genre_scores_gemma":[0.12769866,0.0013526874,0.867801,0.00030592128,0.00020946645,0.0002524131,0.00013448288,0.00013347718,0.0021119441],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845576,0.00053000497,0.00007752138,0.0001892233,0.00065973145,0.00008772485],"domain_scores_gemma":[0.99575365,0.0024153213,0.00024005542,0.00069383025,0.0007513579,0.00014581443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020458302,0.0010747378,0.0009199638,0.001838639,0.00080527057,0.0020723853,0.0020777045,0.0012542713,0.0018560861],"category_scores_gemma":[0.010091353,0.00062347745,0.00058685313,0.0030151126,0.0012628897,0.0035192287,0.0026631712,0.0023981861,0.00092801434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020873331,0.0001961167,0.0019000954,0.0004427555,0.00006187711,0.00036485377,0.00043818416,0.23735547,0.013813466,0.25263402,0.011745848,0.4808386],"study_design_scores_gemma":[0.00002281752,0.00008355914,0.00019086008,0.000043807027,0.000022203158,0.00016033895,0.000093093215,0.8199419,0.0037182404,0.1677833,0.007921913,0.000017929107],"about_ca_topic_score_codex":0.0010220313,"about_ca_topic_score_gemma":0.0012459524,"teacher_disagreement_score":0.0020777045,"about_ca_system_score_codex":0.0006490051,"about_ca_system_score_gemma":0.00079259195,"threshold_uncertainty_score":0.010819495},"labels":[],"label_agreement":null},{"id":"W2164562671","doi":"10.1109/tmc.2009.42","title":"Large Connectivity for Dynamic Random Geometric Graphs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Random graph; Random geometric graph; Wireless ad hoc network; Geometric networks; Spatial network; Torus; Wireless network; Theoretical computer science; Wireless; Mathematics; Combinatorics; Complex network; Graph; Telecommunications","score_opus":0.010224502172423966,"score_gpt":0.25905162031996715,"score_spread":0.24882711814754319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164562671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12008026,0.0021579014,0.84464806,0.002883249,0.00013445261,0.000092454735,0.00039523325,0.00067526835,0.028933074],"genre_scores_gemma":[0.96324205,0.0016384803,0.028888427,0.00042109846,0.00028309334,0.00022877067,0.0003649625,0.00019311199,0.0047400654],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897254,0.0003263867,0.000031384454,0.00016368237,0.00036356488,0.00014237323],"domain_scores_gemma":[0.9904254,0.006671222,0.0010586425,0.00065720355,0.000779782,0.00040778553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014498015,0.00068127015,0.0007573424,0.0021677199,0.00081246876,0.0014633399,0.0012885991,0.00091962074,0.0040872097],"category_scores_gemma":[0.0146752475,0.00048532675,0.0006105993,0.0011630129,0.0021479863,0.004317678,0.0014721791,0.0020381915,0.00041770042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003111004,0.000026536816,0.00048302856,0.00009095524,0.000017401164,0.00018572148,0.00018165955,0.059936192,0.0021480757,0.92885333,0.0028251086,0.0052208044],"study_design_scores_gemma":[0.000021163043,0.000035488203,0.00047815414,0.000025579213,0.000014985507,0.00033689605,0.000058937403,0.28848985,0.0005738501,0.7063498,0.00359285,0.000022476972],"about_ca_topic_score_codex":0.0008772743,"about_ca_topic_score_gemma":0.0009687366,"teacher_disagreement_score":0.0040872097,"about_ca_system_score_codex":0.0016492876,"about_ca_system_score_gemma":0.0004980977,"threshold_uncertainty_score":0.013673067},"labels":[],"label_agreement":null},{"id":"W2164604973","doi":"10.1109/aina.2011.84","title":"Detecting Forged Acknowledgements in MANETs","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada; King Fahd University of Petroleum and Minerals; King Abdulaziz City for Science and Technology; Acadia University","keywords":"Acknowledgement; Mobile ad hoc network; Computer science; Computer network; Network packet; Node (physics); Digital signature; Computer security; Wireless ad hoc network; Intrusion detection system; Scheme (mathematics); Wireless; Telecommunications; Engineering","score_opus":0.032995971436257356,"score_gpt":0.2375696809913666,"score_spread":0.20457370955510926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164604973","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5899325,0.00289135,0.4007175,0.00051393174,0.00073775905,0.0003517387,0.00021153539,0.0026380115,0.002005684],"genre_scores_gemma":[0.9380829,0.0007419992,0.059590336,0.00012571622,0.00012510925,0.00007583882,0.00014342723,0.000038949456,0.0010756392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960127,0.00087778963,0.0005519152,0.00048640568,0.0016960689,0.0003751046],"domain_scores_gemma":[0.980451,0.008707126,0.004170951,0.0032408985,0.0028571575,0.00057292054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038618606,0.0010000445,0.0012898498,0.0025142124,0.0011056799,0.0012418655,0.0015192328,0.0015128108,0.00036432617],"category_scores_gemma":[0.022192774,0.0005758618,0.00030963542,0.0015106674,0.0009783757,0.0038291516,0.0023385398,0.0010744664,0.00031380818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005440035,0.00077393104,0.054808017,0.0010029797,0.00045450378,0.0073749674,0.002928806,0.20006432,0.14655921,0.025254808,0.00509072,0.55024767],"study_design_scores_gemma":[0.00017492581,0.0022366291,0.006710889,0.00012524868,0.00020822957,0.006104978,0.0010415788,0.85396403,0.104003996,0.017136471,0.00805821,0.00023483862],"about_ca_topic_score_codex":0.00062044035,"about_ca_topic_score_gemma":0.00049374596,"teacher_disagreement_score":0.0038618606,"about_ca_system_score_codex":0.0005637404,"about_ca_system_score_gemma":0.0008176721,"threshold_uncertainty_score":0.02042371},"labels":[],"label_agreement":null},{"id":"W2164609872","doi":"10.1109/iwwan.2004.1525544","title":"Controlled flooding in wireless ad-hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Flooding (psychology); Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Distributed computing; Routing protocol; Mobile ad hoc network; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Telecommunications; Network packet","score_opus":0.00638858301303747,"score_gpt":0.2080677596017409,"score_spread":0.20167917658870343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164609872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0130127,0.016070578,0.9586376,0.0010964487,0.0005897053,0.00018484704,0.00003767736,0.0004392079,0.009931152],"genre_scores_gemma":[0.64885086,0.03660236,0.30148044,0.0006189066,0.0016100745,0.0009061793,0.00014615008,0.00012277564,0.009662248],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990709,0.00040091065,0.000060708106,0.00007635605,0.00033487234,0.000056215256],"domain_scores_gemma":[0.9988218,0.00079580804,0.000120206816,0.00011569374,0.00010616352,0.000040239098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001199889,0.00055853504,0.0005829875,0.0006242436,0.0007014023,0.0011423988,0.0009339053,0.001157756,0.00061182585],"category_scores_gemma":[0.004213087,0.00038067577,0.00035546525,0.0012020201,0.002206302,0.002510784,0.0010808154,0.0009302257,0.00031266946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066261106,0.00004547614,0.0007486563,0.0008242055,0.000055464163,0.0006998358,0.00083188555,0.14850925,0.012241798,0.7040959,0.00828883,0.12359238],"study_design_scores_gemma":[0.00007380112,0.00023937917,0.00040741713,0.00016716235,0.00008641038,0.0011306107,0.00023338146,0.3730756,0.004764256,0.5004495,0.11928901,0.00008343579],"about_ca_topic_score_codex":0.000970336,"about_ca_topic_score_gemma":0.00054499635,"teacher_disagreement_score":0.001199889,"about_ca_system_score_codex":0.0005292494,"about_ca_system_score_gemma":0.00046721514,"threshold_uncertainty_score":0.0063456893},"labels":[],"label_agreement":null},{"id":"W2164675320","doi":"10.1109/icc.2008.561","title":"Interference-Aware Routing Metric for Improved Load Balancing in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Arkansas","keywords":"Computer science; Wireless mesh network; Computer network; Metrics; Metric (unit); Distributed computing; Routing (electronic design automation); Mesh networking; Dynamic Source Routing; Interference (communication); Geographic routing; Network packet; Wireless; Channel (broadcasting); Routing protocol; Wireless network; Telecommunications; Engineering","score_opus":0.017516661792905164,"score_gpt":0.2376866132779111,"score_spread":0.22016995148500593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164675320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05007457,0.0024552294,0.94177747,0.00037145903,0.00027792394,0.00010397637,0.00012365493,0.0012503578,0.003565444],"genre_scores_gemma":[0.68567747,0.000737648,0.3115078,0.00010094195,0.00014896443,0.00014340233,0.00036566227,0.00013101996,0.0011870689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912196,0.0003397767,0.00007612815,0.00008241548,0.00034583762,0.000033800545],"domain_scores_gemma":[0.99889296,0.00035787097,0.00020580426,0.00011665928,0.0003857822,0.000040945597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013923945,0.0007048344,0.00066488504,0.0011310278,0.00039190764,0.0006370197,0.0009309075,0.00039724493,0.0005450215],"category_scores_gemma":[0.0049183364,0.00013765779,0.00020086853,0.0010517591,0.0002216255,0.0011554615,0.00059798534,0.00039476412,0.00017029064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028891885,0.00017962711,0.0032649508,0.0003337836,0.00014339502,0.00018319073,0.00020931575,0.3995594,0.0846901,0.035477653,0.006741351,0.4689283],"study_design_scores_gemma":[0.00001695596,0.00023205967,0.0011450594,0.000018849438,0.000034332046,0.00019889628,0.000026622965,0.9723523,0.013779837,0.004435021,0.007726063,0.000033969394],"about_ca_topic_score_codex":0.00044192644,"about_ca_topic_score_gemma":0.00066783366,"teacher_disagreement_score":0.0013923945,"about_ca_system_score_codex":0.0005579386,"about_ca_system_score_gemma":0.0004159275,"threshold_uncertainty_score":0.0073637962},"labels":[],"label_agreement":null},{"id":"W2164784415","doi":"10.1109/glocom.2007.244","title":"ARMA: An Efficient Secure Ad Hoc Routing Protocol","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Wireless ad hoc network; Routing protocol; Optimized Link State Routing Protocol; Node (physics); Zone Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Dynamic Source Routing; Mobile ad hoc network; Computer security; Routing (electronic design automation); Wireless; Network packet; Engineering","score_opus":0.013267210362179671,"score_gpt":0.286544509353487,"score_spread":0.27327729899130737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164784415","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014161023,0.00147498,0.95658743,0.0016191857,0.00059393473,0.00084501127,0.0004125131,0.005584622,0.018721372],"genre_scores_gemma":[0.27654618,0.0015494542,0.7043015,0.00061645574,0.00027825666,0.0014761473,0.00059680064,0.00031474492,0.014320497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972037,0.0007963911,0.00021654379,0.0002361557,0.0013879151,0.00015930481],"domain_scores_gemma":[0.9983109,0.0005367647,0.00028909429,0.00045686276,0.0003150347,0.00009130992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018877734,0.00072224665,0.00086149195,0.0012615708,0.0015346082,0.0018165126,0.002177245,0.0014597018,0.0023268592],"category_scores_gemma":[0.0037520505,0.0005227804,0.00071850105,0.0011418168,0.0016362166,0.003190907,0.0035578606,0.0019295445,0.0016685439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005650174,0.0002735785,0.0008106969,0.0011988546,0.00017482061,0.0019862598,0.0006728786,0.04936112,0.058332436,0.5632029,0.033398546,0.29002288],"study_design_scores_gemma":[0.00032775907,0.0006864355,0.0005661546,0.00022139854,0.00022963359,0.002882042,0.00017284288,0.41672423,0.03087068,0.23380125,0.31329226,0.000225303],"about_ca_topic_score_codex":0.00046820156,"about_ca_topic_score_gemma":0.00071537663,"teacher_disagreement_score":0.0023268592,"about_ca_system_score_codex":0.00056604884,"about_ca_system_score_gemma":0.0015605177,"threshold_uncertainty_score":0.009983599},"labels":[],"label_agreement":null},{"id":"W2164953903","doi":"10.1109/ccece.2006.277680","title":"Mobile Agent System for Network Topology Discovery","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Distributed computing; Network topology; Vehicular ad hoc network; Mobile computing; Optimized Link State Routing Protocol; Wireless network; Adaptive quality of service multi-hop routing; Network simulation; Mobility model; Wireless; Routing protocol; Telecommunications; Routing (electronic design automation)","score_opus":0.008701223132534942,"score_gpt":0.22692026292983986,"score_spread":0.21821903979730492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164953903","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007893032,0.0019591714,0.87929004,0.0008195488,0.0009781424,0.001354889,0.0016391798,0.044268474,0.06179749],"genre_scores_gemma":[0.17345117,0.0019256972,0.7059187,0.0005466136,0.0004149333,0.0026575,0.005686406,0.0010563418,0.108342595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992902,0.0001859822,0.00008117247,0.000109567525,0.00027325362,0.00005976453],"domain_scores_gemma":[0.9990841,0.00017866703,0.000098152734,0.00021115619,0.00030658505,0.000121361605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008419509,0.0007411908,0.00092650135,0.0010293351,0.0007907422,0.0017773024,0.001828459,0.001369733,0.017429046],"category_scores_gemma":[0.0020935605,0.0003577851,0.00039742654,0.00089704787,0.00035382225,0.001638594,0.0014241277,0.001371411,0.013371099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088283984,0.00036117894,0.0020365987,0.0008642059,0.00016022054,0.0011444632,0.00070733886,0.027334567,0.03277741,0.110113665,0.17359164,0.65002584],"study_design_scores_gemma":[0.00034028676,0.00043012874,0.000778653,0.00010749219,0.00011241132,0.0011790558,0.0001127106,0.19052939,0.016543427,0.019674,0.77009296,0.00009947605],"about_ca_topic_score_codex":0.00085381174,"about_ca_topic_score_gemma":0.0011087698,"teacher_disagreement_score":0.017429046,"about_ca_system_score_codex":0.00048293374,"about_ca_system_score_gemma":0.000852509,"threshold_uncertainty_score":0.05830598},"labels":[],"label_agreement":null},{"id":"W2165072660","doi":"10.1109/glocom.2006.985","title":"WSN16-4: Logical Topology Design and Interface Assignment for Multi-Channel Wireless Mesh Networks","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Computer science; Logical topology; Router; Wireless mesh network; Topology (electrical circuits); Network topology; Interface (matter); Distributed computing; Mesh networking; Goodput; Wireless network; Switched mesh; Channel (broadcasting); Wireless; Throughput; Engineering; Telecommunications; Parallel computing","score_opus":0.032760701758184,"score_gpt":0.2707320205910452,"score_spread":0.23797131883286118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165072660","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02111707,0.00017052724,0.97585016,0.00011714835,0.000038283375,0.00010670436,0.00005162583,0.00043717862,0.0021112985],"genre_scores_gemma":[0.27120817,0.00018338465,0.72617155,0.00005017777,0.000036673086,0.0001640631,0.00018489418,0.000093872346,0.0019071833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969745,0.00012685971,0.000020122683,0.000034931003,0.00009137668,0.000029285759],"domain_scores_gemma":[0.99965525,0.0000955819,0.00006233878,0.000058096884,0.000105533974,0.000023192091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010488014,0.0003495872,0.0003155422,0.0005392429,0.00031774107,0.00052381714,0.0009801044,0.0003189654,0.0018362044],"category_scores_gemma":[0.0015150375,0.00021419204,0.00021534656,0.00049522734,0.00029745125,0.00073298864,0.0005438557,0.0003130641,0.00023227255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018690043,0.00009426551,0.00221009,0.00025837385,0.0000756486,0.000083188235,0.00008676546,0.6642131,0.023773892,0.016292546,0.004730708,0.28799447],"study_design_scores_gemma":[0.000029897188,0.00005549065,0.00027229838,0.000005763364,0.000009465307,0.000038848193,0.000012731813,0.98792136,0.0056010927,0.0026119177,0.0034355663,0.0000057039597],"about_ca_topic_score_codex":0.0013712033,"about_ca_topic_score_gemma":0.0032709795,"teacher_disagreement_score":0.0018362044,"about_ca_system_score_codex":0.0005922791,"about_ca_system_score_gemma":0.0007182676,"threshold_uncertainty_score":0.0061427355},"labels":[],"label_agreement":null},{"id":"W2165222084","doi":"10.1109/hicss.2003.1174865","title":"PYLON: an architectural framework for ad-hoc QoS interconnectivity with access domains","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Mobile ad hoc network; Computer science; Wireless ad hoc network; Quality of service; Integrated services; Node (physics); Interconnectivity; Vehicular ad hoc network; Distributed computing; Multicast; Wireless; Telecommunications; Network packet; Engineering","score_opus":0.02378664691434934,"score_gpt":0.29735295830011366,"score_spread":0.2735663113857643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165222084","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003914946,0.00037174235,0.9834082,0.0005094702,0.00016384157,0.00019725159,0.00006987793,0.0033024151,0.0080621885],"genre_scores_gemma":[0.14960435,0.0017785552,0.81690913,0.00054178917,0.00017293963,0.00082350726,0.00063790043,0.0009770019,0.028554847],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905413,0.00023473504,0.00009788367,0.00012028397,0.0003515461,0.00014133437],"domain_scores_gemma":[0.99917716,0.0001617854,0.00007702075,0.00022628135,0.00014724,0.00021040834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024139383,0.0007418522,0.00063659484,0.0006942307,0.001591676,0.004315032,0.0033788309,0.0015210297,0.003971493],"category_scores_gemma":[0.0020983138,0.00084086607,0.0010730246,0.0006892811,0.0019399058,0.0058568832,0.0045399205,0.002481265,0.0019728765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023567869,0.00013039056,0.0011878214,0.00055747066,0.00008695456,0.0010463661,0.002186762,0.051113345,0.012865362,0.77221674,0.016477082,0.14189605],"study_design_scores_gemma":[0.000103766964,0.00025694584,0.0004546389,0.0003041031,0.00016905043,0.0009861604,0.0007100239,0.31147143,0.011260535,0.20936531,0.46477845,0.00013956062],"about_ca_topic_score_codex":0.003028248,"about_ca_topic_score_gemma":0.0042164465,"teacher_disagreement_score":0.004315032,"about_ca_system_score_codex":0.0012448373,"about_ca_system_score_gemma":0.0025966996,"threshold_uncertainty_score":0.013285935},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01915252195389812,"score_gpt":0.2278275419431529,"score_spread":0.2086750199892548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165275875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019974144,0.0044432073,0.9666889,0.0004504882,0.00020346695,0.0002559781,0.00012914915,0.00043950742,0.0074151545],"genre_scores_gemma":[0.37979433,0.0065179374,0.60329074,0.0005435481,0.00040646634,0.0008319906,0.00058976776,0.00014247412,0.007882712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.00061813195,0.000077006625,0.00020260295,0.00046081643,0.0000960222],"domain_scores_gemma":[0.9984048,0.0009911354,0.0001910938,0.00013261799,0.00022154313,0.00005881342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809924,0.0009280157,0.000934955,0.001315973,0.00085621065,0.0010033447,0.0015469246,0.00089049526,0.0010647805],"category_scores_gemma":[0.0040578744,0.00045496796,0.00064318796,0.0019702062,0.001097076,0.0016222394,0.00097587984,0.0009897032,0.00041555896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001915239,0.000117594645,0.0010077669,0.0007273169,0.00020428796,0.000134362,0.00063476374,0.5024277,0.006687006,0.19834554,0.00592226,0.28359985],"study_design_scores_gemma":[0.0001260573,0.0003425378,0.00062421616,0.000095831965,0.00009152482,0.00036838293,0.00019219301,0.7871311,0.0056294557,0.17535229,0.029989233,0.000057123667],"about_ca_topic_score_codex":0.0016680633,"about_ca_topic_score_gemma":0.0015346315,"teacher_disagreement_score":0.0016680633,"about_ca_system_score_codex":0.0012676356,"about_ca_system_score_gemma":0.00087324163,"threshold_uncertainty_score":0.009197414},"labels":[],"label_agreement":null},{"id":"W2165290294","doi":"10.1109/pccc.2004.1395018","title":"Adaptive gossip-based routing algorithm","year":2005,"lang":"en","type":"article","venue":"IEEE International Conference on Performance, Computing, and Communications, 2004","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Ad hoc On-Demand Distance Vector Routing; Dynamic Source Routing; Computer network; Gossip; Distance-vector routing protocol; Multipath routing; Static routing; Optimized Link State Routing Protocol; Algorithm; Distributed computing; Routing (electronic design automation); Routing protocol; Psychology","score_opus":0.04607843156584731,"score_gpt":0.303006085752787,"score_spread":0.2569276541869397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165290294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02966591,0.0012217992,0.95373094,0.000270732,0.00027511266,0.00023342563,0.00011970748,0.002235346,0.012247062],"genre_scores_gemma":[0.59922,0.0011799451,0.3886398,0.00025748872,0.00018146959,0.0002698644,0.00034108883,0.00015586709,0.009754486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996362,0.0000716173,0.000024592402,0.000063609725,0.00017393041,0.00003009391],"domain_scores_gemma":[0.99955446,0.00015885817,0.000043270564,0.000082405095,0.00013241639,0.00002864492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047101112,0.00044388458,0.00047471983,0.0004935848,0.00043790363,0.0005851809,0.0011715713,0.00046966365,0.001534931],"category_scores_gemma":[0.000997399,0.00013059497,0.00024529183,0.00044010108,0.00038708662,0.00077383127,0.0005114897,0.0004540003,0.0007293619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000519546,0.00022064241,0.0016304466,0.00044968256,0.00023534059,0.00043088885,0.00025483637,0.43197042,0.07036907,0.08468871,0.010850758,0.39837962],"study_design_scores_gemma":[0.00009805683,0.00032205944,0.00045531962,0.000016096801,0.00009076285,0.00037182114,0.000057708115,0.93409944,0.018952683,0.020400334,0.025096614,0.000039126513],"about_ca_topic_score_codex":0.0006907893,"about_ca_topic_score_gemma":0.0008292651,"teacher_disagreement_score":0.001534931,"about_ca_system_score_codex":0.00032918912,"about_ca_system_score_gemma":0.00047566585,"threshold_uncertainty_score":0.0051348805},"labels":[],"label_agreement":null},{"id":"W2165591146","doi":"10.1504/ijssc.2013.051984","title":"Performance evaluation of mixed-bias scheduling schemes for wireless mesh networks","year":2013,"lang":"en","type":"article","venue":"International Journal of Space-Based and Situated Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Scheduling (production processes); Network packet; Queue; Distributed computing; Wireless; Wireless network; Real-time computing; Engineering; Telecommunications","score_opus":0.027526933685265514,"score_gpt":0.270950328732046,"score_spread":0.24342339504678048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165591146","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83116394,0.0024159509,0.16091773,0.0003270144,0.00018432684,0.00024063185,0.000120855555,0.00071675197,0.0039127655],"genre_scores_gemma":[0.9610803,0.00024569768,0.038195748,0.000040623425,0.000028446291,0.00004535286,0.000062993175,0.00002245202,0.00027843955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979685,0.00090059795,0.0001349157,0.00014064713,0.00061044586,0.00024485824],"domain_scores_gemma":[0.99020886,0.0060616694,0.00073544285,0.00070034707,0.0018961723,0.00039748542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047007003,0.0008600066,0.000574867,0.0012067436,0.0006470994,0.0006693387,0.0012233596,0.00058045035,0.00064149924],"category_scores_gemma":[0.011513391,0.00020765052,0.00023576888,0.0010982549,0.00046003723,0.0010241449,0.0007593488,0.000372973,0.00011524945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041567655,0.0009352553,0.013025627,0.00040342903,0.00025129694,0.00012246706,0.00032464915,0.72885716,0.040512174,0.0067877234,0.0016908537,0.20293269],"study_design_scores_gemma":[0.00009245247,0.0009509704,0.0011014908,0.00001359139,0.000027707798,0.00006063037,0.00007359758,0.989652,0.0068082963,0.00076683634,0.00043083957,0.000021544514],"about_ca_topic_score_codex":0.002257294,"about_ca_topic_score_gemma":0.002769872,"teacher_disagreement_score":0.0047007003,"about_ca_system_score_codex":0.0015930193,"about_ca_system_score_gemma":0.0009896123,"threshold_uncertainty_score":0.024860024},"labels":[],"label_agreement":null},{"id":"W2165636876","doi":"10.1109/wimob.2009.52","title":"Optimal Control of Spatial, Temporal and Bandwidth Contention in Wireless Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Throughput; Wireless network; Network packet; Bandwidth (computing); Network congestion; Bandwidth allocation; Packet loss; Mobile ad hoc network; Vehicular ad hoc network; Wireless; Distributed computing; Telecommunications","score_opus":0.007685789095282644,"score_gpt":0.21546587292759117,"score_spread":0.20778008383230853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165636876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20157255,0.0031733436,0.78587323,0.0006025116,0.00016835371,0.000080668295,0.000026815487,0.00023060567,0.00827192],"genre_scores_gemma":[0.98814327,0.00043054702,0.010833808,0.00002583654,0.0000337063,0.000020130405,0.0000048463776,0.00000867082,0.0004992302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915385,0.00031072015,0.000044909375,0.0000718003,0.00025584723,0.00016291994],"domain_scores_gemma":[0.99824226,0.0011187518,0.00027153952,0.00007231266,0.00021041806,0.00008469273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013584463,0.00049792725,0.00042871185,0.00046405089,0.00044706624,0.00081124145,0.0006698629,0.00037028865,0.0004527753],"category_scores_gemma":[0.00408262,0.00027070232,0.00015044514,0.0004740732,0.0012713397,0.0010077467,0.0006118611,0.00045319265,0.000058010228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014436044,0.00009583118,0.0008100537,0.00006777585,0.00004016682,0.00007165824,0.0000911542,0.93178225,0.0073453966,0.02586211,0.00048918155,0.03320019],"study_design_scores_gemma":[0.000035486613,0.00010092617,0.00025016037,0.0000050262847,0.000016499156,0.000027188169,0.000037146263,0.98481673,0.0016208522,0.012485702,0.0005924733,0.000011809365],"about_ca_topic_score_codex":0.0030859036,"about_ca_topic_score_gemma":0.0020898478,"teacher_disagreement_score":0.0030859036,"about_ca_system_score_codex":0.000600393,"about_ca_system_score_gemma":0.001006251,"threshold_uncertainty_score":0.007184267},"labels":[],"label_agreement":null},{"id":"W2165816901","doi":"10.1109/glocom.2008.ecp.120","title":"Channel Capacity and Second Order Statistics in Tactical Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Hydro-Québec","funders":"","keywords":"Computer science; Wireless ad hoc network; Channel (broadcasting); Computer network; Channel capacity; Wireless; Telecommunications","score_opus":0.016831102614213795,"score_gpt":0.22865240728342223,"score_spread":0.21182130466920843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165816901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22849396,0.006095009,0.75354457,0.0007815026,0.00016090076,0.00005526672,0.0002786598,0.0009559585,0.00963418],"genre_scores_gemma":[0.985076,0.0019308463,0.011178303,0.00007189093,0.00010505065,0.000058516183,0.00010760259,0.00007976641,0.001392017],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999006,0.00031669985,0.000027477505,0.00010337871,0.0003893553,0.0001571817],"domain_scores_gemma":[0.9936952,0.00484247,0.0005481112,0.00036057355,0.0004449609,0.00010876666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016057388,0.0005878054,0.0006264449,0.0015654563,0.00052106654,0.0013152336,0.0005083714,0.00082722306,0.0005544926],"category_scores_gemma":[0.0065228296,0.0005533356,0.0002970919,0.00184476,0.0017605518,0.001819867,0.000587199,0.0008471964,0.00017198184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041049094,0.000025747831,0.0013388012,0.00004595036,0.000020337096,0.00013476021,0.000099610545,0.944453,0.0017018837,0.045218494,0.0005435241,0.006376802],"study_design_scores_gemma":[0.0000049247715,0.000034221648,0.0011807149,0.00001293974,0.000012247036,0.000087978064,0.00003287776,0.96694714,0.0010790396,0.029946132,0.00063620304,0.000025578232],"about_ca_topic_score_codex":0.006794448,"about_ca_topic_score_gemma":0.0022657542,"teacher_disagreement_score":0.006794448,"about_ca_system_score_codex":0.0012983945,"about_ca_system_score_gemma":0.0009984433,"threshold_uncertainty_score":0.01350981},"labels":[],"label_agreement":null},{"id":"W2166042527","doi":"10.1109/mahss.2008.4660048","title":"Drift: A highly condensed emulation framework for mobile nodes in server clusters","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Emulation; Testbed; Computer science; Scalability; Distributed computing; Wireless network; Computer network; Wireless; Network packet; Real-time computing; Operating system","score_opus":0.021749061885845748,"score_gpt":0.26236133172195036,"score_spread":0.24061226983610462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166042527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009365867,0.000056068435,0.98263276,0.00010911452,0.000042022883,0.00014141276,0.00015708519,0.0054861023,0.0020095822],"genre_scores_gemma":[0.28056028,0.00035005802,0.7116353,0.00016101093,0.00005694748,0.0009513731,0.00075956003,0.0021211803,0.0034042634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993851,0.00027408896,0.000038963673,0.000056964418,0.00018310416,0.00006169228],"domain_scores_gemma":[0.998998,0.0004592102,0.00007845898,0.0002244776,0.00014611593,0.0000937332],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020525008,0.00075934234,0.0005787539,0.0005934994,0.00052303955,0.0009866769,0.002755879,0.00087385834,0.0036690247],"category_scores_gemma":[0.00382505,0.0004965715,0.0007311929,0.00035763948,0.0008522649,0.0016090774,0.0018077287,0.001311207,0.0007838517],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016638747,0.00011488902,0.0018214819,0.00019396297,0.00006824551,0.000188106,0.00037194553,0.8780884,0.0131328935,0.061522085,0.0066048014,0.037726842],"study_design_scores_gemma":[0.000051235842,0.00008008204,0.00018911227,0.000020912279,0.00001174959,0.00005976468,0.000031908985,0.97375274,0.003896762,0.008855825,0.013032275,0.000017677798],"about_ca_topic_score_codex":0.0027685212,"about_ca_topic_score_gemma":0.0023684483,"teacher_disagreement_score":0.0036690247,"about_ca_system_score_codex":0.0008258334,"about_ca_system_score_gemma":0.0011621148,"threshold_uncertainty_score":0.0122740865},"labels":[],"label_agreement":null},{"id":"W2166329832","doi":"10.1109/icc.2007.519","title":"Power-Aware 3D Position-based Routing Algorithms for Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Dynamic Source Routing; Static routing; Geographic routing; Wireless ad hoc network; Routing protocol; Wireless Routing Protocol; Distributed computing; Routing (electronic design automation); Policy-based routing; Multipath routing; Algorithm; Wireless; Telecommunications","score_opus":0.01205166071261048,"score_gpt":0.2570038361692447,"score_spread":0.24495217545663422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166329832","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029038296,0.0011743564,0.99317425,0.00013629746,0.000093661576,0.000049516944,0.000047426234,0.000829383,0.0015911666],"genre_scores_gemma":[0.08613153,0.0033334624,0.9058449,0.00017491546,0.000097077726,0.00027061044,0.00035649576,0.00019547838,0.003595475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949825,0.00013720221,0.000030479654,0.00006022375,0.00025160852,0.000022132504],"domain_scores_gemma":[0.99927205,0.00030637236,0.00009900989,0.00013890435,0.00016260345,0.000021100695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051378825,0.0013623455,0.0008561209,0.0010659199,0.00068673835,0.0011450638,0.0014880983,0.0011065577,0.002661891],"category_scores_gemma":[0.0024732617,0.0005715469,0.0006913804,0.0015277314,0.00049625064,0.0017305252,0.001066947,0.0009129768,0.0013271556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009550866,0.000053964246,0.0006127697,0.00019331422,0.00008337734,0.00007725953,0.00013295304,0.5858044,0.006480875,0.017503522,0.00591969,0.3830424],"study_design_scores_gemma":[0.00004373362,0.000073585674,0.00024594896,0.00003578299,0.000043742173,0.00018666824,0.000039820217,0.9493399,0.004689904,0.023896148,0.02135901,0.0000456717],"about_ca_topic_score_codex":0.001968181,"about_ca_topic_score_gemma":0.0032412352,"teacher_disagreement_score":0.002661891,"about_ca_system_score_codex":0.00051274104,"about_ca_system_score_gemma":0.0005646378,"threshold_uncertainty_score":0.008904874},"labels":[],"label_agreement":null},{"id":"W2166363051","doi":"10.1002/sec.150","title":"PAPA‐UIC: a design approach and a framework for secure mobile<i>ad hoc</i>networks","year":2009,"lang":"en","type":"article","venue":"Security and Communication Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Key escrow; Computer science; Computer security; Mobile ad hoc network; Cryptography; Computer network; Optimized Link State Routing Protocol; Network packet; Routing protocol; Public-key cryptography; Encryption","score_opus":0.0160787962579281,"score_gpt":0.2511120003558638,"score_spread":0.23503320409793568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166363051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017525975,0.0004806974,0.9891093,0.0006199626,0.00013751541,0.00024753198,0.000023518529,0.0013639693,0.0062649935],"genre_scores_gemma":[0.09933057,0.0010856058,0.88757867,0.00048598356,0.00015509449,0.0009359734,0.00012581104,0.000259538,0.0100427745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998099,0.0006119941,0.00012969521,0.00023888567,0.0007230928,0.00019736498],"domain_scores_gemma":[0.998898,0.00018462208,0.000118896365,0.00030448296,0.00032933854,0.00016469182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034990995,0.00092715654,0.00048073762,0.0009854593,0.0014510129,0.0037818342,0.0029008577,0.0019475986,0.0021720787],"category_scores_gemma":[0.0032722123,0.00081251876,0.0009007714,0.00058530946,0.0029917806,0.0035801867,0.0027553744,0.002795586,0.0012739968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067803376,0.000072180235,0.00046069679,0.00035488638,0.0000331207,0.0005342031,0.0006702587,0.022250485,0.007805666,0.86434436,0.009750511,0.09365577],"study_design_scores_gemma":[0.00008922166,0.00045476801,0.0002778409,0.0004323888,0.00011375669,0.0017922265,0.0003073394,0.37779054,0.024143383,0.22325417,0.37122524,0.000119073055],"about_ca_topic_score_codex":0.0018491503,"about_ca_topic_score_gemma":0.0011382066,"teacher_disagreement_score":0.0037818342,"about_ca_system_score_codex":0.0014513736,"about_ca_system_score_gemma":0.0039720587,"threshold_uncertainty_score":0.018505275},"labels":[],"label_agreement":null},{"id":"W2166400127","doi":"10.1007/s11036-009-0173-6","title":"Gateway Selection Protocol in Hybrid MANET Using DYMO Routing","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Routing protocol; Interior gateway protocol; Node (physics); Computer security; Optimized Link State Routing Protocol; Routing (electronic design automation); Network packet","score_opus":0.009679137836690901,"score_gpt":0.2666954570117184,"score_spread":0.2570163191750275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166400127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24034314,0.0032833829,0.7435337,0.0006385246,0.00043356177,0.00033653885,0.00021082468,0.0017500655,0.009470203],"genre_scores_gemma":[0.9166504,0.0006844043,0.077676445,0.00013863212,0.00009062854,0.00021736718,0.00025247785,0.00005988547,0.004229763],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949086,0.00018091449,0.000033766748,0.0000786684,0.00013784647,0.00007793898],"domain_scores_gemma":[0.9995937,0.00016617261,0.00004042958,0.000051999865,0.000101294485,0.000046520803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009909477,0.00042269583,0.0010420548,0.0010162353,0.0008207228,0.0010971617,0.0010888935,0.0005158146,0.0007255556],"category_scores_gemma":[0.000898164,0.00032963534,0.00025362335,0.00069739006,0.0004017789,0.0011299633,0.0015218381,0.0005192591,0.00023841688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032614907,0.00059892674,0.0091099385,0.0009058145,0.0005958548,0.0027754665,0.0015818657,0.19323981,0.16881676,0.13300413,0.016227597,0.4698823],"study_design_scores_gemma":[0.000162837,0.0005891211,0.0018739619,0.00003668551,0.00023083891,0.0013850678,0.00040785223,0.93997264,0.02724232,0.014230271,0.013791372,0.00007704224],"about_ca_topic_score_codex":0.00096639886,"about_ca_topic_score_gemma":0.0016022911,"teacher_disagreement_score":0.0010971617,"about_ca_system_score_codex":0.00042102428,"about_ca_system_score_gemma":0.00045276317,"threshold_uncertainty_score":0.005240679},"labels":[],"label_agreement":null},{"id":"W2166611122","doi":"10.1109/ccece.2005.1557392","title":"Achieve load balancing and avoid bandwidth fragmentation in MANET QoS routing","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile ad hoc network; Quality of service; Computer network; Bandwidth (computing); Admission control; Fragmentation (computing); Dynamic bandwidth allocation; Distributed computing; Bandwidth allocation; Routing protocol; Routing (electronic design automation)","score_opus":0.004433856441146073,"score_gpt":0.20462949201980404,"score_spread":0.20019563557865797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166611122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06601554,0.000599898,0.92923474,0.0002089247,0.00003969516,0.000056158005,0.000012892921,0.00042254088,0.0034097207],"genre_scores_gemma":[0.78618425,0.00072963507,0.21057655,0.00016158765,0.00006679299,0.00007566284,0.00003917902,0.0000678249,0.0020984751],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996069,0.000095400246,0.000019321718,0.0000485558,0.00017030237,0.000059578684],"domain_scores_gemma":[0.9995436,0.00018165969,0.000068278416,0.00007161244,0.00009441221,0.000040417337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080605206,0.0005823472,0.0003981833,0.0007306475,0.00083381246,0.0007670749,0.00076910306,0.00048020796,0.00054412615],"category_scores_gemma":[0.0014859077,0.00020981107,0.00019041786,0.0004945622,0.00066037383,0.0012709675,0.0008368595,0.00053151755,0.00019071586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032677726,0.00024124105,0.0028943794,0.00024620272,0.000065594446,0.00046818476,0.0006155443,0.2783206,0.1728158,0.108048186,0.0016431517,0.43431434],"study_design_scores_gemma":[0.00004464936,0.00020232031,0.00059783383,0.000020211673,0.000029435929,0.00043130538,0.000109225155,0.9105953,0.04658551,0.034316376,0.0070380038,0.000029839486],"about_ca_topic_score_codex":0.00089485466,"about_ca_topic_score_gemma":0.00096844963,"teacher_disagreement_score":0.00089485466,"about_ca_system_score_codex":0.00045307554,"about_ca_system_score_gemma":0.0005456619,"threshold_uncertainty_score":0.0042628646},"labels":[],"label_agreement":null},{"id":"W2166951008","doi":"10.1109/icniconsmcl.2006.172","title":"Preemptive Multicast Routing in Mobile Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Computer science; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Multicast; Distributed computing; Link-state routing protocol; Wireless Routing Protocol; Xcast; Source-specific multicast; Routing protocol; Routing (electronic design automation)","score_opus":0.008106315471774353,"score_gpt":0.2291702823600524,"score_spread":0.22106396688827806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166951008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018506927,0.015968371,0.946181,0.0011786765,0.0005675932,0.00031507312,0.000057077214,0.0014631603,0.015762094],"genre_scores_gemma":[0.50544196,0.015810536,0.46560863,0.00056877884,0.0009832806,0.0004946823,0.0002319425,0.0001633523,0.010696808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991041,0.00041502205,0.000037311573,0.000057891564,0.000324682,0.00006107574],"domain_scores_gemma":[0.99902713,0.0004593863,0.0000905078,0.00016186452,0.0002139358,0.000047219863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011733198,0.0005258181,0.00044997895,0.0006548392,0.0007022959,0.0011324234,0.0011342312,0.0011649145,0.001179411],"category_scores_gemma":[0.0024847256,0.00038870258,0.00024324421,0.000853562,0.0005948401,0.001593919,0.000673538,0.00091055135,0.00049020373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022567765,0.0001605856,0.0018639567,0.0010279209,0.00007260062,0.00094350084,0.00047670826,0.1194321,0.03403408,0.13890901,0.016347129,0.6865068],"study_design_scores_gemma":[0.00011991318,0.0005289546,0.0010847836,0.00022962468,0.00009594335,0.001991846,0.00021214504,0.72011316,0.016335431,0.12139382,0.13781404,0.000080377016],"about_ca_topic_score_codex":0.0009881539,"about_ca_topic_score_gemma":0.00092190295,"teacher_disagreement_score":0.001179411,"about_ca_system_score_codex":0.00068639644,"about_ca_system_score_gemma":0.0006524194,"threshold_uncertainty_score":0.0062051415},"labels":[],"label_agreement":null},{"id":"W2167320146","doi":"10.1109/glocom.2007.116","title":"EM2NET: An Energy-Saving Explicit Multicast Protocol for MANETs","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Protocol Independent Multicast; Multicast; Xcast; Distance Vector Multicast Routing Protocol; Source-specific multicast; Computer network; Computer science; Pragmatic General Multicast; IP multicast; Distributed computing; Reliable multicast; Inter-domain; Header","score_opus":0.05816399305474652,"score_gpt":0.35072093901886797,"score_spread":0.29255694596412146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167320146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029004533,0.0023289623,0.9564025,0.00052398327,0.000686641,0.00026970403,0.00017794705,0.0015820427,0.009023673],"genre_scores_gemma":[0.5343762,0.003395396,0.440548,0.000852368,0.00040968266,0.0006895377,0.0010057958,0.00024596025,0.018477075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997273,0.00008010335,0.000018027458,0.000027163209,0.00011887041,0.000028635997],"domain_scores_gemma":[0.99975175,0.0000822938,0.000035703713,0.000043632863,0.000059907372,0.000026669435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006180957,0.00034790955,0.00037953828,0.00042509628,0.00045263633,0.00048364594,0.0012493761,0.00055989367,0.0014479796],"category_scores_gemma":[0.00088672416,0.00014926656,0.0002133828,0.00037302315,0.00034688698,0.0013268277,0.0011832606,0.0006530116,0.00034707767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087893737,0.00029529136,0.0015906229,0.0012965217,0.00021284702,0.0012758144,0.00052455673,0.07671719,0.09750093,0.15673782,0.02522001,0.63774943],"study_design_scores_gemma":[0.00026495144,0.0010479242,0.0016900894,0.00021222084,0.00027716882,0.0028422552,0.00031043772,0.50718576,0.085667096,0.040861424,0.35943592,0.0002047636],"about_ca_topic_score_codex":0.00025869094,"about_ca_topic_score_gemma":0.00058311725,"teacher_disagreement_score":0.0014479796,"about_ca_system_score_codex":0.00020470357,"about_ca_system_score_gemma":0.0002751954,"threshold_uncertainty_score":0.0048439503},"labels":[],"label_agreement":null},{"id":"W2167488136","doi":"10.1109/milcom.2010.5680089","title":"Efficiency of multiparty networking protocols over mobile tactical radios on VHF bands","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Dissemination; Multicast; Network packet; Routing protocol; Cluster analysis; Overhead (engineering); Distributed computing; Telecommunications","score_opus":0.01315637254902437,"score_gpt":0.29024765650031226,"score_spread":0.2770912839512879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167488136","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70286834,0.001202838,0.28413406,0.0003260868,0.000065671906,0.00012026543,0.000061069855,0.00046787038,0.010753771],"genre_scores_gemma":[0.98058426,0.00028046034,0.018024925,0.000018492154,0.000013522133,0.000057116722,0.000045747227,0.00003711556,0.00093834236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761665,0.0010235661,0.000104102575,0.00016285852,0.00078156806,0.00031128858],"domain_scores_gemma":[0.9875301,0.0096319495,0.0007734173,0.0013617928,0.00059062464,0.00011210945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036334433,0.00056702405,0.00084162044,0.0008331072,0.0009838303,0.001421902,0.001113951,0.00082403055,0.0009799168],"category_scores_gemma":[0.011425118,0.00026666722,0.00039268343,0.0008509252,0.00083898695,0.0019529716,0.0008387647,0.00056266435,0.00020411749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005236629,0.00020201155,0.0024013752,0.00015051173,0.00008720002,0.00021039197,0.00022249535,0.84232,0.02800191,0.061838515,0.0008572755,0.06318458],"study_design_scores_gemma":[0.000013039927,0.00009543259,0.0003048311,0.0000052984105,0.000018766896,0.00006218409,0.000035854482,0.985889,0.006631063,0.0066370256,0.0003008571,0.0000066594375],"about_ca_topic_score_codex":0.00078301894,"about_ca_topic_score_gemma":0.00066564867,"teacher_disagreement_score":0.0036334433,"about_ca_system_score_codex":0.0010054063,"about_ca_system_score_gemma":0.0005669714,"threshold_uncertainty_score":0.019215703},"labels":[],"label_agreement":null},{"id":"W2167862188","doi":"10.1109/aina.2008.41","title":"Parameterless Broadcasting in Static to Highly Mobile Wireless Ad Hoc, Sensor and Actuator Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Timeout; Computer science; Flooding (psychology); Network packet; Broadcasting (networking); Node (physics); Wireless ad hoc network; Mobile ad hoc network; Protocol (science); Wireless; Operating system","score_opus":0.015603605093497154,"score_gpt":0.2349315486033602,"score_spread":0.21932794350986307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167862188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16910109,0.01112009,0.79073757,0.0006078906,0.000445445,0.00038315478,0.0001074725,0.0018170109,0.025680333],"genre_scores_gemma":[0.86545205,0.003972862,0.121406406,0.0003237324,0.00016158658,0.00017279753,0.00016510548,0.00011564139,0.008229774],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927574,0.00025456047,0.000046538928,0.00012264299,0.00024640726,0.000054030137],"domain_scores_gemma":[0.99907315,0.00039312744,0.00015683469,0.00016796215,0.00016741603,0.000041484673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007034484,0.0003143145,0.0003713557,0.0004203714,0.0005600672,0.0006052396,0.0010244371,0.00056474336,0.0008534803],"category_scores_gemma":[0.0017491749,0.00015719446,0.00023072661,0.0007704484,0.0007344315,0.0014678906,0.00072758185,0.00042851715,0.00028890927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007213488,0.00042355587,0.0067210365,0.0018098423,0.00017777293,0.0013720933,0.0015297263,0.13728535,0.16034311,0.087876834,0.0070713125,0.5946681],"study_design_scores_gemma":[0.00014030721,0.002820294,0.00788009,0.00018893999,0.00039613323,0.006818765,0.0014170554,0.69026446,0.10428506,0.05367926,0.13192123,0.00018842929],"about_ca_topic_score_codex":0.0011475065,"about_ca_topic_score_gemma":0.00092207955,"teacher_disagreement_score":0.0011475065,"about_ca_system_score_codex":0.00047606346,"about_ca_system_score_gemma":0.0005491192,"threshold_uncertainty_score":0.0037202835},"labels":[],"label_agreement":null},{"id":"W2167990496","doi":"10.1109/twc.2007.060449","title":"An Interference Aware Distributed Resource Management Scheme for CDMA-Based Wireless Mesh Backbone","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Alberta","funders":"","keywords":"Computer science; Computer network; Interference (communication); Wireless mesh network; Overhead (engineering); Radio resource management; Wireless; Wireless network; Code division multiple access; Power control; Resource allocation; Distributed computing; Telecommunications; Power (physics); Channel (broadcasting)","score_opus":0.02859687822757778,"score_gpt":0.28740925970696296,"score_spread":0.2588123814793852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167990496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032249037,0.00042690485,0.96450484,0.0001386777,0.00010505685,0.00008380856,0.000021402664,0.00057976565,0.0018905366],"genre_scores_gemma":[0.75473803,0.00023233933,0.24220349,0.0002035683,0.00011645868,0.00017057238,0.00007954412,0.00002982421,0.0022262319],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954444,0.00010549068,0.000030792427,0.00009491712,0.00016759694,0.000056735364],"domain_scores_gemma":[0.9995022,0.00012419373,0.000065881846,0.000099274956,0.00016178496,0.000046643992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081385236,0.00035918423,0.0004252426,0.0005824882,0.00082647265,0.00056932913,0.0014840942,0.0004850148,0.0009037068],"category_scores_gemma":[0.0012930768,0.0001547796,0.00026418117,0.0004397442,0.00040519756,0.0010690122,0.0009157978,0.00066212355,0.00022812615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007749287,0.00053524645,0.0019383134,0.00024014163,0.00015268537,0.00038479664,0.00043010723,0.13484707,0.1544515,0.0632472,0.0059165475,0.63708144],"study_design_scores_gemma":[0.000109328685,0.0003526159,0.00067467085,0.000013813555,0.00008121736,0.0003618736,0.000057443736,0.9565257,0.024316125,0.009014815,0.008433342,0.000059090442],"about_ca_topic_score_codex":0.00068277126,"about_ca_topic_score_gemma":0.0009919541,"teacher_disagreement_score":0.0014840942,"about_ca_system_score_codex":0.00063734734,"about_ca_system_score_gemma":0.00046128215,"threshold_uncertainty_score":0.0046243668},"labels":[],"label_agreement":null},{"id":"W2167990797","doi":"10.1109/glocom.2011.6133939","title":"Impact of Node Clustering on Routing Overhead in Wireless Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Wireless Routing Protocol; Distributed computing; Overhead (engineering); Node (physics); Wireless ad hoc network; Link-state routing protocol; Static routing; Routing protocol; Geographic routing; Cluster analysis; Zone Routing Protocol; Routing (electronic design automation); Wireless; Engineering; Telecommunications","score_opus":0.02762488325113705,"score_gpt":0.2614174387991383,"score_spread":0.23379255554800127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167990797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8560395,0.005144553,0.1299438,0.0008329571,0.0001736737,0.000066831955,0.00012320456,0.0006609672,0.0070145032],"genre_scores_gemma":[0.99394506,0.00076366053,0.004687996,0.000037552803,0.000030931362,0.000014398638,0.000044176082,0.00006375799,0.00041241464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820447,0.00062700675,0.000068329566,0.00016207059,0.000715353,0.00022272534],"domain_scores_gemma":[0.98635155,0.011146824,0.0009417419,0.00060405734,0.0008167059,0.0001391724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016966889,0.0005759644,0.00051507395,0.0008674882,0.000518137,0.00054937263,0.00051591883,0.0007061478,0.00052422646],"category_scores_gemma":[0.012641602,0.00027479112,0.0002666741,0.0009557711,0.00054971204,0.0015468023,0.00043218222,0.00043123914,0.0001261062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023436992,0.00006121173,0.0046457495,0.0001507154,0.00007547303,0.00020936198,0.00010042357,0.94034016,0.01736001,0.004213994,0.00066716445,0.031941388],"study_design_scores_gemma":[0.000023356459,0.00030987835,0.006860526,0.000027268527,0.000107757405,0.00041034928,0.000094938085,0.9709334,0.016247252,0.00381239,0.0011397152,0.000033166856],"about_ca_topic_score_codex":0.0010284034,"about_ca_topic_score_gemma":0.0010658341,"teacher_disagreement_score":0.0016966889,"about_ca_system_score_codex":0.0008208276,"about_ca_system_score_gemma":0.0004133096,"threshold_uncertainty_score":0.008973062},"labels":[],"label_agreement":null},{"id":"W2168263268","doi":"10.1109/wirles.2005.1549465","title":"Energy Aware Dynamic Task Allocation in Mobile Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Energy consumption; Scheduling (production processes); Distributed computing; Dynamic priority scheduling; Mobile ad hoc network; Wireless ad hoc network; Task (project management); Efficient energy use; Performance metric; Mobile computing; Metric (unit); Real-time computing; Computer network; Wireless; Quality of service; Mathematical optimization; Engineering","score_opus":0.005060116675542627,"score_gpt":0.221079107491785,"score_spread":0.21601899081624237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168263268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10034458,0.004321025,0.8900615,0.0003428759,0.00020786085,0.000085069674,0.00003693868,0.00042915728,0.0041709654],"genre_scores_gemma":[0.8594488,0.0016794858,0.1354587,0.00011069911,0.00013528144,0.00010508113,0.000067198845,0.00007193409,0.0029228611],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961746,0.00014242642,0.000024554374,0.000059438564,0.0001002639,0.000055893415],"domain_scores_gemma":[0.9993882,0.00032458515,0.000085675536,0.000060015653,0.0001011047,0.0000403454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072451466,0.00058399414,0.0005514467,0.00056282955,0.0005683616,0.0006007565,0.00078835234,0.0004532494,0.00051775784],"category_scores_gemma":[0.001952324,0.00025946554,0.00018325612,0.0007946285,0.00035269104,0.0010039542,0.0005465752,0.00034402584,0.00017613982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024811676,0.0001019123,0.001198378,0.00014497069,0.000054182183,0.00012591705,0.00009308506,0.76660955,0.014910132,0.008489142,0.0018724835,0.20615214],"study_design_scores_gemma":[0.000028072529,0.00009700139,0.00039037954,0.0000101023315,0.000024840114,0.00014657421,0.000044580127,0.98492706,0.003891739,0.006887015,0.0035394493,0.000013203271],"about_ca_topic_score_codex":0.0010520542,"about_ca_topic_score_gemma":0.0015194302,"teacher_disagreement_score":0.0010520542,"about_ca_system_score_codex":0.00038308668,"about_ca_system_score_gemma":0.00056163635,"threshold_uncertainty_score":0.003831625},"labels":[],"label_agreement":null},{"id":"W2168638178","doi":"10.1109/aina.2006.83","title":"An efficient coverage-based flooding scheme for geocasting in mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Geocast; Flooding (psychology); Computer network; Computer science; Mobile ad hoc network; Network packet; Multicast; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Wireless; Telecommunications","score_opus":0.01014704748170149,"score_gpt":0.23891462703387564,"score_spread":0.22876757955217414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168638178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022063315,0.0012798945,0.97109735,0.00028010586,0.00012591956,0.00027141956,0.00009710657,0.0007570688,0.004027779],"genre_scores_gemma":[0.61288816,0.002076911,0.37880912,0.00018535789,0.00017235604,0.0004083698,0.0005069165,0.000078620236,0.0048741964],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995943,0.00009397529,0.000027969989,0.000041232866,0.00020681357,0.000035685363],"domain_scores_gemma":[0.9994783,0.00017215004,0.00008373831,0.00010480485,0.00013131605,0.00002969383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054595247,0.00041614525,0.00055177213,0.00082834903,0.0006574741,0.00041875418,0.00095136603,0.00070718693,0.00074243994],"category_scores_gemma":[0.0019761296,0.00020976465,0.00039240692,0.00095752336,0.0005435717,0.001197692,0.0010830562,0.00053317985,0.0003140425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047015763,0.00014683243,0.0011766771,0.0007424764,0.00016540302,0.0007445866,0.0008903448,0.17499003,0.18125539,0.122721724,0.0096177,0.5070786],"study_design_scores_gemma":[0.00021677853,0.00069757085,0.0014656553,0.00009001923,0.00017074212,0.0014845069,0.00015449955,0.8182359,0.053885084,0.035416022,0.0880506,0.00013266061],"about_ca_topic_score_codex":0.0011555083,"about_ca_topic_score_gemma":0.0015527235,"teacher_disagreement_score":0.0011555083,"about_ca_system_score_codex":0.00048634742,"about_ca_system_score_gemma":0.00057818374,"threshold_uncertainty_score":0.0035287142},"labels":[],"label_agreement":null},{"id":"W2168724353","doi":"10.1109/aina.2008.77","title":"PACONET: imProved&amp;#x0A0;&amp;#x0A0;Ant Colony Optimization Routing Algorithm for Mobile Ad Hoc NETworks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Destination-Sequenced Distance Vector routing; Computer network; Ad hoc On-Demand Distance Vector Routing; Ant colony optimization algorithms; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Distance-vector routing protocol; Link-state routing protocol; Distributed computing; Mobile ad hoc network; Routing protocol; Wireless ad hoc network; Routing (electronic design automation); Algorithm; Wireless; Telecommunications","score_opus":0.018819418750002877,"score_gpt":0.24722654251360424,"score_spread":0.22840712376360137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168724353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02872315,0.0018781817,0.9275246,0.0008138365,0.00071034057,0.00036448808,0.0004701617,0.006424946,0.033090305],"genre_scores_gemma":[0.23311692,0.001183489,0.7244857,0.0006495411,0.0001719781,0.0006741607,0.0014901878,0.00067743694,0.03755059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966073,0.00005816062,0.000014037096,0.000040789568,0.00019353011,0.000032785185],"domain_scores_gemma":[0.9996362,0.00008278877,0.00004259126,0.000049294427,0.00016211077,0.000027148975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036701353,0.0006349691,0.0006914762,0.0006034355,0.00042661862,0.00072915375,0.0016088369,0.00082277355,0.0060154162],"category_scores_gemma":[0.0016069969,0.00021011576,0.0003439324,0.0007391453,0.00028263917,0.0008165233,0.00066382985,0.0010178298,0.0018177554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003898644,0.00027607905,0.0015497085,0.00035572337,0.000099582954,0.00051357166,0.00009286473,0.3298472,0.018037425,0.012667221,0.045379028,0.5907917],"study_design_scores_gemma":[0.00009298526,0.00015688877,0.00054940995,0.000021106687,0.00002333634,0.00025473867,0.000013147653,0.9631464,0.004461803,0.002373367,0.02888549,0.000021354224],"about_ca_topic_score_codex":0.0025711174,"about_ca_topic_score_gemma":0.0034300832,"teacher_disagreement_score":0.0060154162,"about_ca_system_score_codex":0.00031603654,"about_ca_system_score_gemma":0.0007007833,"threshold_uncertainty_score":0.020123601},"labels":[],"label_agreement":null},{"id":"W2168745817","doi":"10.5555/1218112.1218516","title":"Wireless network simulation extensions in SIDE/SMURPH","year":2006,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless network; Wireless; Stochastic geometry models of wireless networks; Interference (communication); Wireless ad hoc network; Channel (broadcasting); Computer network; Shadow mapping; Radio resource management; Radio propagation; Network packet; Mobile radio; Telecommunications; Artificial intelligence","score_opus":0.02411231716629415,"score_gpt":0.2696579873759761,"score_spread":0.245545670209682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168745817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005320022,0.0002643115,0.9150781,0.00054276455,0.0003206198,0.0002477924,0.0030339365,0.03136754,0.04382493],"genre_scores_gemma":[0.09596276,0.0011586174,0.83376646,0.00097514485,0.0002784211,0.0014030073,0.008436195,0.023699684,0.03431969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999119,0.0003343772,0.00006894724,0.00007316753,0.00031929262,0.000085228174],"domain_scores_gemma":[0.99787056,0.0008954065,0.00008013351,0.00050998834,0.00053813955,0.000105732965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017699071,0.00086382136,0.0008003379,0.00063315645,0.00042114352,0.0011732314,0.002848739,0.0010849569,0.029744525],"category_scores_gemma":[0.0047218613,0.0007687181,0.001537254,0.00062383525,0.00044404165,0.001791356,0.002620044,0.001960745,0.010731603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005558095,0.0003488093,0.0020524585,0.00094545033,0.00022256587,0.0006849052,0.00063325197,0.4719991,0.0108329505,0.1800029,0.16104503,0.17067684],"study_design_scores_gemma":[0.00014364808,0.00006779387,0.00019347685,0.000094155876,0.000026478854,0.00026782023,0.000025544876,0.7898902,0.0045631984,0.031876117,0.17280796,0.00004348182],"about_ca_topic_score_codex":0.0019475446,"about_ca_topic_score_gemma":0.0027543367,"teacher_disagreement_score":0.029744525,"about_ca_system_score_codex":0.00045702982,"about_ca_system_score_gemma":0.00090548105,"threshold_uncertainty_score":0.099505365},"labels":[],"label_agreement":null},{"id":"W2168911585","doi":"10.1109/ntms.2008.ecp.14","title":"A Simple and Efficient Detection of Wormhole Attacks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Wormhole; Computer science; Mobile ad hoc network; Global Positioning System; Simple (philosophy); Computer network; Routing protocol; Synchronization (alternating current); Optimized Link State Routing Protocol; Node (physics); Protocol (science); Routing (electronic design automation); Wireless ad hoc network; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.011977581602404998,"score_gpt":0.2232924202902413,"score_spread":0.2113148386878363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168911585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08203943,0.0015154325,0.9027208,0.00029263913,0.00023736437,0.0003839346,0.00016940158,0.007676517,0.004964521],"genre_scores_gemma":[0.6199244,0.00096742605,0.37208676,0.0001849286,0.0001291576,0.0002222835,0.0004607328,0.00015441154,0.005869757],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722916,0.000441196,0.00017691172,0.00036785533,0.0016096279,0.00017529023],"domain_scores_gemma":[0.9969765,0.0006107657,0.0005213622,0.00084174087,0.00092544185,0.00012416353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075534836,0.0007995874,0.0015043268,0.0021795367,0.0004556339,0.00093699276,0.0015328439,0.0015694585,0.0013081621],"category_scores_gemma":[0.0043532564,0.0005711306,0.00046774137,0.0010099949,0.0005025149,0.0022938543,0.0017301043,0.0008164937,0.0011778466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045876682,0.00032039042,0.0038929374,0.00042133234,0.00012651735,0.00078149943,0.00017430793,0.014361918,0.33980462,0.00948758,0.0056572966,0.6245129],"study_design_scores_gemma":[0.0002806306,0.0018039829,0.0088594975,0.000094891344,0.00025605396,0.0067648944,0.00016907857,0.48768482,0.45264164,0.008341755,0.032815527,0.00028717026],"about_ca_topic_score_codex":0.0003068928,"about_ca_topic_score_gemma":0.00027915637,"teacher_disagreement_score":0.0021795367,"about_ca_system_score_codex":0.00021209354,"about_ca_system_score_gemma":0.00038361913,"threshold_uncertainty_score":0.004376292},"labels":[],"label_agreement":null},{"id":"W2169488092","doi":"10.1109/wimob.2006.1696350","title":"Mobility Metrics to Enable Adaptive Routing in MANET","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Routing protocol; Link-state routing protocol; Mobility model; Zone Routing Protocol; Dynamic Source Routing; Static routing; Wireless Routing Protocol; Interior gateway protocol; Metrics; Distributed computing; Node (physics); Routing (electronic design automation); Engineering","score_opus":0.015795777997846875,"score_gpt":0.2294194218821041,"score_spread":0.21362364388425722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169488092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026478129,0.0100991195,0.95181173,0.0016250331,0.0013032384,0.00021610748,0.0003237528,0.0020384581,0.006104446],"genre_scores_gemma":[0.47471437,0.010915211,0.5072939,0.00043471716,0.00068295683,0.00038035063,0.0006326347,0.00041262855,0.0045332815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994068,0.0002311904,0.000068950794,0.00005317927,0.00021506775,0.000024801015],"domain_scores_gemma":[0.998684,0.00051669544,0.00027228508,0.00020960029,0.00025929246,0.000058100853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010508257,0.0007622873,0.00047115755,0.0011272583,0.00032675805,0.00089504913,0.0006492411,0.0005727851,0.0009361352],"category_scores_gemma":[0.005993099,0.00024799237,0.00024704862,0.0012601316,0.00050543057,0.002403898,0.0011277368,0.00094416965,0.00034042448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025915966,0.000110903915,0.0045720977,0.0008503816,0.00017465738,0.000811149,0.0005144439,0.19311994,0.057198197,0.3395592,0.01412029,0.38870952],"study_design_scores_gemma":[0.00006181673,0.0004978014,0.0034615814,0.0003577895,0.00015588447,0.0015500074,0.00025940168,0.61753464,0.03551386,0.17906944,0.16136263,0.00017509337],"about_ca_topic_score_codex":0.0004974114,"about_ca_topic_score_gemma":0.00056037284,"teacher_disagreement_score":0.0011272583,"about_ca_system_score_codex":0.00028425385,"about_ca_system_score_gemma":0.00023959525,"threshold_uncertainty_score":0.0055573583},"labels":[],"label_agreement":null},{"id":"W2169622138","doi":"10.1109/ccece.2004.1345014","title":"Connectivity in inter-vehicle ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":97,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Wireless ad hoc network; Vehicular ad hoc network; Computer science; Range (aeronautics); Computer network; Key (lock); Probability density function; Traffic flow (computer networking); Mobile ad hoc network; Session (web analytics); Topology (electrical circuits); Telecommunications; Engineering; Computer security; Mathematics; Wireless; Electrical engineering","score_opus":0.010795421069097587,"score_gpt":0.22958807457087818,"score_spread":0.2187926535017806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169622138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40955552,0.00072182744,0.5731606,0.0006781301,0.000086997214,0.00026817917,0.0003790902,0.00041042996,0.014739295],"genre_scores_gemma":[0.97774655,0.00044041555,0.01771796,0.000059387865,0.00002278947,0.00022989567,0.00016953271,0.00002192127,0.0035914027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999257,0.0003823827,0.000026472973,0.00008216363,0.00013460903,0.00011734104],"domain_scores_gemma":[0.9981048,0.0012056726,0.00024633645,0.00010664846,0.00022142482,0.00011510727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008221427,0.0006730888,0.00062251376,0.0007379639,0.0007295276,0.00089528284,0.0014414438,0.0014395206,0.00177955],"category_scores_gemma":[0.0038134505,0.00044277823,0.00055323273,0.00075368746,0.0010740407,0.0018150632,0.0008502983,0.0008187415,0.000239072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022060494,0.000024887751,0.0009480314,0.000013032261,0.00001229146,0.00007382385,0.000042939646,0.98656476,0.00038323714,0.010143842,0.00012688753,0.0016441818],"study_design_scores_gemma":[0.000010479733,0.00003225858,0.00015977345,0.0000030573854,0.000006898347,0.000023115837,0.000013718608,0.99603015,0.0001238804,0.0032277172,0.00036516902,0.0000038778303],"about_ca_topic_score_codex":0.009109612,"about_ca_topic_score_gemma":0.0055021257,"teacher_disagreement_score":0.009109612,"about_ca_system_score_codex":0.0011936517,"about_ca_system_score_gemma":0.0007956374,"threshold_uncertainty_score":0.018113196},"labels":[],"label_agreement":null},{"id":"W2169905864","doi":"10.1109/iswpc.2007.342627","title":"3-D Localized Position-Based Routing with Nearly Certain Delivery in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Link-state routing protocol; Dynamic Source Routing; Algorithm; Routing (electronic design automation); Computer network; Routing protocol","score_opus":0.006643805350068194,"score_gpt":0.2197528402641716,"score_spread":0.2131090349141034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169905864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0670109,0.00032844621,0.93000066,0.00017329023,0.000028854945,0.000041247902,0.000032694938,0.00091071025,0.0014732535],"genre_scores_gemma":[0.6867807,0.00025456445,0.3114045,0.000076367,0.000028385923,0.00010356379,0.00009852399,0.00006359088,0.0011897638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995372,0.00020160417,0.000020548861,0.00005128617,0.00014745709,0.000041852647],"domain_scores_gemma":[0.9994004,0.00023207472,0.0000754702,0.00015017431,0.00011458824,0.00002728979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005411111,0.0004360506,0.00055318786,0.00038362425,0.0005894281,0.00051309203,0.00092295976,0.0004394004,0.0007307986],"category_scores_gemma":[0.0017687829,0.0002779133,0.00026810783,0.0005146877,0.0004982466,0.00085795915,0.0008862363,0.00034685293,0.0002921208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025656194,0.000055582328,0.0010426624,0.00006387855,0.00004520527,0.00010595945,0.00014254324,0.79272544,0.026197132,0.012301974,0.0023237814,0.16473927],"study_design_scores_gemma":[0.000018963157,0.00008225359,0.00020921163,0.0000023893563,0.000008980073,0.000063934596,0.000025004025,0.9916372,0.0041745435,0.0028645834,0.0009053488,0.000007674312],"about_ca_topic_score_codex":0.0019159656,"about_ca_topic_score_gemma":0.0022522276,"teacher_disagreement_score":0.0019159656,"about_ca_system_score_codex":0.00050285505,"about_ca_system_score_gemma":0.0004622091,"threshold_uncertainty_score":0.0038096905},"labels":[],"label_agreement":null},{"id":"W2170089590","doi":"10.1109/vtc.2002.1002801","title":"A time space division multiple access (TSDMA) protocol for multihop wireless networks with access points","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Time division multiple access; Computer network; Computer science; Channel access method; Wireless ad hoc network; Wireless network; Multi-frequency time division multiple access; Access control; Throughput; Media access control; Multiple Access with Collision Avoidance for Wireless; Hidden node problem; Wireless; Channel (broadcasting); Wi-Fi array; Telecommunications; Orthogonal frequency-division multiplexing; MIMO-OFDM","score_opus":0.027912313006489373,"score_gpt":0.31111586586646967,"score_spread":0.2832035528599803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170089590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070319804,0.0033437728,0.9770577,0.00040971788,0.00082921435,0.00043987026,0.00008703201,0.001713203,0.0090876315],"genre_scores_gemma":[0.20241359,0.0064759725,0.7663993,0.0007006274,0.00076806557,0.0012185517,0.0004549948,0.00015646714,0.021412378],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942267,0.00013661919,0.000053075582,0.00008517915,0.00025284628,0.00004972608],"domain_scores_gemma":[0.9995528,0.000095748524,0.000057946512,0.00009328066,0.00015603079,0.000044274075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006487951,0.0005836758,0.00045253537,0.00069954514,0.0007431829,0.0009332008,0.0012423168,0.00075211475,0.002763619],"category_scores_gemma":[0.0010563175,0.00025333723,0.00052838447,0.000730186,0.00063964113,0.001314767,0.00083535333,0.0011219985,0.0015261918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001863636,0.00025219732,0.00073154515,0.001041303,0.00016066802,0.0007332854,0.0004273495,0.030708741,0.11846155,0.1878256,0.024636894,0.6348345],"study_design_scores_gemma":[0.0002227819,0.001055302,0.0007094719,0.00012242673,0.0002950649,0.0024063084,0.00017415272,0.26231867,0.07911026,0.03865695,0.6147644,0.00016418513],"about_ca_topic_score_codex":0.0008143243,"about_ca_topic_score_gemma":0.0012808084,"teacher_disagreement_score":0.002763619,"about_ca_system_score_codex":0.00039087114,"about_ca_system_score_gemma":0.00068606844,"threshold_uncertainty_score":0.009245276},"labels":[],"label_agreement":null},{"id":"W2170096365","doi":"10.1016/j.tcs.2014.10.044","title":"On a class of covering problems with variable capacities in wireless networks","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Queen's University","funders":"","keywords":"Class (philosophy); Variable (mathematics); Computer science; Wireless; Wireless network; Mathematics; Theoretical computer science; Computer network; Telecommunications; Artificial intelligence","score_opus":0.005265615106788304,"score_gpt":0.1913742510683054,"score_spread":0.1861086359615171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170096365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05291928,0.005342117,0.88533413,0.004684223,0.00048270408,0.00049195235,0.0010823586,0.00048811652,0.049175188],"genre_scores_gemma":[0.6232471,0.014029914,0.3210733,0.0022734248,0.0034030597,0.0018784592,0.0024969482,0.00080384314,0.030793894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99488986,0.0028892865,0.00016147313,0.0006341956,0.0007143286,0.0007109539],"domain_scores_gemma":[0.98978055,0.008275802,0.0006134874,0.00053106603,0.00037692857,0.00042215467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034392835,0.0038939738,0.0027083587,0.0018903697,0.0023903253,0.004180959,0.0032351788,0.004355627,0.009617819],"category_scores_gemma":[0.013366802,0.0014961212,0.003448127,0.004835053,0.003357033,0.007508385,0.0038041128,0.0045012506,0.0010014533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020664731,0.00026037506,0.0006525963,0.00041407556,0.00018341577,0.00041695283,0.00032363556,0.58811927,0.00081177126,0.3603502,0.016209831,0.03205132],"study_design_scores_gemma":[0.00012638654,0.00012358178,0.00027534668,0.00011842023,0.00004573455,0.00027736666,0.00011252194,0.6362726,0.00025829786,0.35020983,0.012142528,0.000037345148],"about_ca_topic_score_codex":0.0045148586,"about_ca_topic_score_gemma":0.0026663672,"teacher_disagreement_score":0.009617819,"about_ca_system_score_codex":0.0034583171,"about_ca_system_score_gemma":0.0018057346,"threshold_uncertainty_score":0.032174766},"labels":[],"label_agreement":null},{"id":"W2170126448","doi":"10.1109/glocom.2010.5684220","title":"An Enhanced Reservation-Based Medium Access Control with Scheduling and Admission Control for Voice over Wireless Mesh Networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Network packet; Access control; Scheduling (production processes); Router; Voice over IP; Shared mesh; Wireless; Distributed computing; Wireless network; The Internet; Telecommunications","score_opus":0.01050858864291172,"score_gpt":0.27168681772710035,"score_spread":0.26117822908418864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170126448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056295045,0.00061826344,0.94039255,0.00014477696,0.00017927166,0.000089069035,0.00003306595,0.0006453543,0.0016026122],"genre_scores_gemma":[0.8790811,0.0002266037,0.11913445,0.00008479659,0.00014130506,0.00007993077,0.000052919157,0.000020716128,0.0011783276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937147,0.00019582159,0.00005928209,0.0001019397,0.00019871118,0.000072691735],"domain_scores_gemma":[0.99923193,0.00028729212,0.00011790277,0.00013655325,0.00018254331,0.000043774515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088114804,0.00034350512,0.0003674799,0.00045575103,0.00038852828,0.00050122204,0.0009766374,0.0004018306,0.0004509266],"category_scores_gemma":[0.0020039587,0.00013997401,0.00039405667,0.00033202005,0.00037385852,0.00067739113,0.00065327896,0.0006986544,0.00012794143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074951665,0.00039327913,0.002776811,0.00033256743,0.0001893458,0.0004379353,0.00025793302,0.2961331,0.22601311,0.06072533,0.0028809858,0.40911007],"study_design_scores_gemma":[0.00002577696,0.00018314418,0.00038100206,0.00000513192,0.00003160257,0.00012704975,0.000011631536,0.98296183,0.010936325,0.0022411149,0.0030725931,0.000022797736],"about_ca_topic_score_codex":0.0012560897,"about_ca_topic_score_gemma":0.00138988,"teacher_disagreement_score":0.0012560897,"about_ca_system_score_codex":0.00046444515,"about_ca_system_score_gemma":0.000738119,"threshold_uncertainty_score":0.0046600103},"labels":[],"label_agreement":null},{"id":"W2170311083","doi":"10.1109/icc.2008.616","title":"Call Admission Control for Mobile Agent Based Handoff in Wireless Mesh Networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Handover; Computer network; Computer science; Wireless mesh network; Router; Shared mesh; Quality of service; Switched mesh; Call Admission Control; Bandwidth (computing); Mobility management; Wireless network; Admission control; Wireless; Telecommunications","score_opus":0.014188743334744814,"score_gpt":0.23793156144527602,"score_spread":0.2237428181105312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170311083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055660598,0.001306956,0.9375822,0.00043668007,0.00027272067,0.00010371616,0.000027979937,0.0007034622,0.0039057317],"genre_scores_gemma":[0.97518677,0.00030293668,0.02295612,0.00008749147,0.00013904241,0.00007253041,0.00002005292,0.00002139775,0.0012137719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861693,0.00045298305,0.00006913642,0.00015396209,0.00055008265,0.0001568021],"domain_scores_gemma":[0.9985869,0.0008718604,0.00014590667,0.00006905289,0.00024958607,0.00007664933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017528889,0.00043543358,0.0005336921,0.00057848333,0.00089912,0.0012107326,0.0012470928,0.0007513958,0.0009769036],"category_scores_gemma":[0.005426436,0.00018356163,0.00023256218,0.00043461827,0.0010494451,0.0009576844,0.00074052153,0.0011574776,0.00016432485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006681322,0.000305954,0.0020142181,0.00015899904,0.00008948807,0.0003437505,0.00050457893,0.61389345,0.029650759,0.10721379,0.004200506,0.24095641],"study_design_scores_gemma":[0.00001674977,0.00003208957,0.00015317007,0.0000042178226,0.000010192108,0.00001889695,0.000013782191,0.9920691,0.0010606756,0.006100211,0.00051078165,0.000010261364],"about_ca_topic_score_codex":0.0050043426,"about_ca_topic_score_gemma":0.0028884108,"teacher_disagreement_score":0.0050043426,"about_ca_system_score_codex":0.0010896719,"about_ca_system_score_gemma":0.001021255,"threshold_uncertainty_score":0.009950459},"labels":[],"label_agreement":null},{"id":"W2170461666","doi":"10.5539/cis.v5n3p83","title":"Load Balancing Using Multiple Node Disjoint Paths","year":2012,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Optimized Link State Routing Protocol; Network packet; Routing protocol; Wireless Routing Protocol; Wireless ad hoc network; Distributed computing; Wireless; Telecommunications","score_opus":0.016027681351510996,"score_gpt":0.2393161390488886,"score_spread":0.2232884576973776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170461666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059206802,0.0026279315,0.92359,0.00043329768,0.00027898164,0.00020447068,0.0000927424,0.0017978292,0.011767917],"genre_scores_gemma":[0.81262875,0.0014683276,0.17868277,0.00016843918,0.00021917382,0.00026035157,0.00023273063,0.0002436532,0.006095811],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936265,0.00013138563,0.00003328923,0.00012370419,0.00028690803,0.000062127016],"domain_scores_gemma":[0.99942505,0.00022544006,0.00009653347,0.000078489305,0.00013133809,0.000043252916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062039396,0.0006884476,0.0008031062,0.0014653137,0.001024226,0.0010760474,0.001324707,0.0005460435,0.0027581297],"category_scores_gemma":[0.0015258234,0.0002636925,0.0004623805,0.0012299676,0.0004492405,0.0017602276,0.001288893,0.00039132283,0.00055259455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043562453,0.00020339167,0.0012246905,0.00047061563,0.00016358167,0.00034834078,0.0003720129,0.41586134,0.06390499,0.024419725,0.005052533,0.48754317],"study_design_scores_gemma":[0.00012885962,0.00035044533,0.0007786586,0.000049353315,0.00007966349,0.0004400143,0.00015230347,0.9324646,0.0171734,0.018197333,0.030126235,0.0000592503],"about_ca_topic_score_codex":0.00079693453,"about_ca_topic_score_gemma":0.0010797832,"teacher_disagreement_score":0.0027581297,"about_ca_system_score_codex":0.00067005504,"about_ca_system_score_gemma":0.0004896879,"threshold_uncertainty_score":0.009226799},"labels":[],"label_agreement":null},{"id":"W2170503384","doi":"10.1145/570758.570767","title":"Energy-aware routing in MANETs","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Dynamic Source Routing; Routing protocol; Link-state routing protocol; Wireless ad hoc network; Adaptive quality of service multi-hop routing; Zone Routing Protocol; Distributed computing; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.015562074331286082,"score_gpt":0.20553308011782326,"score_spread":0.18997100578653717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170503384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021195445,0.029392593,0.917093,0.002018707,0.0011520524,0.00022206678,0.000099580335,0.0012487881,0.027577758],"genre_scores_gemma":[0.5620251,0.061973684,0.34485877,0.0009561174,0.0016496637,0.00056020904,0.0004718275,0.0002733813,0.027231256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00024729953,0.00004299959,0.00006767146,0.00022869372,0.00003544627],"domain_scores_gemma":[0.9994392,0.0003112734,0.000060925748,0.000084081374,0.0000790157,0.00002555485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083720003,0.0005480706,0.0005946587,0.00077860814,0.0005256535,0.0013363792,0.00085710234,0.00091017794,0.0013035559],"category_scores_gemma":[0.0023639244,0.00048219846,0.00022742838,0.0013248931,0.0007067358,0.0024877423,0.0009165255,0.00067910145,0.00059450744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092043556,0.00008175444,0.0009488535,0.0008978366,0.00008789334,0.0005800162,0.00034997068,0.30937538,0.007209061,0.29128662,0.012929855,0.3761607],"study_design_scores_gemma":[0.00003720099,0.0001526074,0.00057214603,0.00020536131,0.00007977437,0.0008094148,0.00023761122,0.5296523,0.003956314,0.34620956,0.118016705,0.00007108636],"about_ca_topic_score_codex":0.00059301086,"about_ca_topic_score_gemma":0.00087858725,"teacher_disagreement_score":0.0013363792,"about_ca_system_score_codex":0.0003366988,"about_ca_system_score_gemma":0.00040599215,"threshold_uncertainty_score":0.004427612},"labels":[],"label_agreement":null},{"id":"W2170507502","doi":"10.1109/lcn.2003.1243205","title":"Reliable multipath routing with fixed delays in manet using regenerating nodes","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Computer network; Network packet; Mobile ad hoc network; Multipath routing; Redundancy (engineering); End-to-end delay; Node (physics); Wireless ad hoc network; Multipath propagation; Network topology; Distributed computing; Routing protocol; Optimized Link State Routing Protocol; Packet loss; Link-state routing protocol; Wireless; Channel (broadcasting); Telecommunications","score_opus":0.01765563175706949,"score_gpt":0.23059502165938514,"score_spread":0.21293938990231565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170507502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05996634,0.0019007887,0.93555707,0.00017693694,0.00009067434,0.000059791128,0.000032795066,0.0005829936,0.0016326099],"genre_scores_gemma":[0.705047,0.0019567218,0.28997996,0.000070967726,0.00011262405,0.00010253579,0.000056120396,0.00006536394,0.0026086948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.000099498975,0.00001889046,0.000053126936,0.000098116274,0.0000350303],"domain_scores_gemma":[0.9993839,0.00027077633,0.00011743678,0.00010561184,0.00009045209,0.00003182889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086171814,0.00068323174,0.0005515221,0.00082524185,0.000625626,0.0006544895,0.0011774388,0.00054083625,0.00049165083],"category_scores_gemma":[0.0015320319,0.00030886295,0.00034804802,0.00061310455,0.00068460277,0.0012427855,0.00076601934,0.0004912749,0.00017392846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027590155,0.000037895676,0.00072855374,0.00023190195,0.00007323018,0.0005254767,0.0002043875,0.75972825,0.037935868,0.06525971,0.0008625172,0.13413629],"study_design_scores_gemma":[0.000040547755,0.00033714477,0.00021784283,0.000027844606,0.00007260324,0.0003790561,0.000060866136,0.953242,0.013158697,0.025424048,0.006983334,0.000055980294],"about_ca_topic_score_codex":0.0011170555,"about_ca_topic_score_gemma":0.0013668167,"teacher_disagreement_score":0.0011774388,"about_ca_system_score_codex":0.0005775749,"about_ca_system_score_gemma":0.0005326985,"threshold_uncertainty_score":0.004557252},"labels":[],"label_agreement":null},{"id":"W2170543182","doi":"10.1007/978-3-540-79549-0_80","title":"On the Probability of Finding Non-interfering Paths in Wireless Multihop Networks","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Multipath routing; Computer network; Multipath propagation; Wireless network; Distributed computing; Wireless; Topology (electrical circuits); Routing (electronic design automation); Routing protocol; Dynamic Source Routing; Algorithm; Telecommunications; Mathematics","score_opus":0.019200683630686385,"score_gpt":0.23003433965046563,"score_spread":0.21083365601977924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170543182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07778084,0.017421754,0.8750336,0.005722801,0.0011867469,0.00024920158,0.0007402339,0.00071974954,0.021145072],"genre_scores_gemma":[0.8707906,0.022266706,0.08434181,0.0009906379,0.0044209547,0.00079251477,0.0009277595,0.0006635041,0.014805605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906317,0.0033543953,0.000505946,0.0012409221,0.0033312268,0.0009357833],"domain_scores_gemma":[0.75717,0.22814988,0.0044471244,0.0039534406,0.004371713,0.0019077729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01513807,0.0026739812,0.0052005537,0.004675463,0.002204385,0.0053761825,0.008588838,0.0053326,0.006580211],"category_scores_gemma":[0.097836964,0.0029378638,0.0017632607,0.0070998906,0.009328494,0.011325184,0.0050684744,0.006301996,0.0009258986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012313891,0.00021156986,0.0060693324,0.0015488033,0.0003025957,0.00058216765,0.0008736909,0.5839585,0.0030172851,0.34175116,0.0080238255,0.05242974],"study_design_scores_gemma":[0.00010342078,0.0002361082,0.0021089863,0.00026483356,0.000191819,0.0010606823,0.0002615291,0.7440232,0.0013738717,0.24792306,0.0023146463,0.00013786565],"about_ca_topic_score_codex":0.0017337566,"about_ca_topic_score_gemma":0.001295388,"teacher_disagreement_score":0.01513807,"about_ca_system_score_codex":0.0035436063,"about_ca_system_score_gemma":0.0016724151,"threshold_uncertainty_score":0.08005875},"labels":[],"label_agreement":null},{"id":"W2170547778","doi":"10.1109/lcn.2009.5355141","title":"Optimal placement of gateways in multi-hop Wireless Mesh Networks: A clustering-based approach","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Wireless mesh network; Scalability; Network topology; Distributed computing; Computer network; Quality of service; Network performance; Mesh networking; Default gateway; Network planning and design; Cluster analysis; Wireless network; Order One Network Protocol; Heuristic; Mathematical optimization; Wireless; Mathematics","score_opus":0.021206705714614416,"score_gpt":0.24726521502677182,"score_spread":0.2260585093121574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170547778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02023331,0.0004295908,0.97713464,0.000233999,0.000033772147,0.000084691936,0.00003274926,0.00014991767,0.001667312],"genre_scores_gemma":[0.46939427,0.0007161412,0.5272466,0.0000981548,0.0000473453,0.0002099422,0.0001244748,0.00009413259,0.0020689373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999485,0.00023243972,0.000024333222,0.000097216376,0.000100817735,0.00006019516],"domain_scores_gemma":[0.9993555,0.0003033471,0.00012430703,0.00006166075,0.0001038538,0.000051363182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011232215,0.0010386434,0.0010212117,0.0012906983,0.0007424884,0.0008897387,0.0016324734,0.0014866599,0.001064915],"category_scores_gemma":[0.0021500108,0.00089651346,0.00074610935,0.0012560335,0.00080930506,0.0014945783,0.00096049655,0.00061745895,0.00023663096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026018008,0.000022911945,0.00023092274,0.000045224962,0.00001796677,0.000032287673,0.000030893407,0.9772181,0.00097427086,0.0049030785,0.00033482068,0.016163448],"study_design_scores_gemma":[0.0000109131915,0.000030526462,0.00008809326,0.000008576962,0.000008731277,0.000019671508,0.000030614974,0.9943235,0.0005559354,0.0045239916,0.00039228372,0.000007163088],"about_ca_topic_score_codex":0.0032808022,"about_ca_topic_score_gemma":0.0038416095,"teacher_disagreement_score":0.0032808022,"about_ca_system_score_codex":0.0014114744,"about_ca_system_score_gemma":0.0012667442,"threshold_uncertainty_score":0.010240972},"labels":[],"label_agreement":null},{"id":"W2170583945","doi":"10.1109/icns.2007.17","title":"A Routing Based Service Discovery Protocol for Ad hoc Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Wireless Routing Protocol; Zone Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Ad hoc On-Demand Distance Vector Routing; Link-state routing protocol; Distributed computing; Routing protocol; Distance-vector routing protocol; Enhanced Interior Gateway Routing Protocol; Service discovery; Routing (electronic design automation); World Wide Web; Web service","score_opus":0.022378735557539647,"score_gpt":0.29092050126765523,"score_spread":0.26854176571011557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170583945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035846839,0.004558153,0.957151,0.0019596962,0.0030980192,0.0014735918,0.0006828622,0.0048879557,0.022603981],"genre_scores_gemma":[0.080438234,0.007978278,0.85389394,0.002425541,0.001358756,0.0033109765,0.0032139723,0.0005912144,0.046789154],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974927,0.00047131086,0.00024744746,0.00025610262,0.001403994,0.0001285094],"domain_scores_gemma":[0.99895394,0.0002813201,0.00011548878,0.00023916007,0.00028251356,0.00012754607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022234642,0.00076976005,0.0009039669,0.0016148115,0.0019691414,0.0022962212,0.002181643,0.0017571127,0.0035289691],"category_scores_gemma":[0.002781024,0.00042310962,0.0007866106,0.002476147,0.0012991608,0.0034342161,0.002553866,0.0026839757,0.00327855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023698459,0.00027628677,0.0005854901,0.0017192247,0.00024942608,0.00090609264,0.0007302013,0.007582476,0.04511697,0.36933348,0.08340298,0.48986042],"study_design_scores_gemma":[0.00012847532,0.0003147425,0.00036036022,0.00016878181,0.000189141,0.0016727035,0.00014823975,0.03349712,0.018716667,0.058941662,0.8857172,0.0001449586],"about_ca_topic_score_codex":0.001211314,"about_ca_topic_score_gemma":0.0017681649,"teacher_disagreement_score":0.0035289691,"about_ca_system_score_codex":0.0009238317,"about_ca_system_score_gemma":0.0016732359,"threshold_uncertainty_score":0.011805594},"labels":[],"label_agreement":null},{"id":"W2170774653","doi":"10.1109/vetecs.2007.32","title":"Multicast Capacity of Wireless Ad Hoc Networks with Hierarchical Routing","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Multicast; Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Ad hoc wireless distribution service; Geocast; Protocol Independent Multicast; Vehicular ad hoc network; Routing (electronic design automation); Routing protocol; Wireless; Telecommunications","score_opus":0.014076668590842334,"score_gpt":0.23000265576543635,"score_spread":0.21592598717459402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170774653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31031853,0.011506178,0.62152517,0.0018834675,0.00026714677,0.00009410137,0.0006248863,0.0008506278,0.052929845],"genre_scores_gemma":[0.9836255,0.0025804627,0.010302246,0.00013739236,0.00024445276,0.000118324686,0.00017924093,0.00006193881,0.002750427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993018,0.00017666238,0.000022935128,0.00006447855,0.0002563057,0.00017770089],"domain_scores_gemma":[0.9972275,0.0019385878,0.00019274521,0.00020122042,0.0003513472,0.000088560504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009623666,0.00047791944,0.0005569983,0.0014090711,0.0005186487,0.0009955947,0.0009709908,0.00055563723,0.002160105],"category_scores_gemma":[0.0051898947,0.00029625552,0.00035335,0.0012162831,0.0008230543,0.0020003,0.00097552146,0.0007481976,0.00037730703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000241206,0.00013248263,0.0014957958,0.00048189473,0.0000749011,0.00051032886,0.00041148355,0.5821551,0.023846632,0.31909004,0.0070197894,0.064540446],"study_design_scores_gemma":[0.000011735277,0.00006440421,0.0008604509,0.00005948854,0.00003475944,0.0002084606,0.00007358264,0.8197161,0.004290759,0.17110538,0.0035507989,0.000024190813],"about_ca_topic_score_codex":0.0010598677,"about_ca_topic_score_gemma":0.00055024674,"teacher_disagreement_score":0.002160105,"about_ca_system_score_codex":0.0012927189,"about_ca_system_score_gemma":0.00047778236,"threshold_uncertainty_score":0.009379387},"labels":[],"label_agreement":null},{"id":"W2171011077","doi":"10.1109/nomsw.2007.5","title":"Provisioning Services in Multihop Cellular Networks when the End-Users Are in the Mobile Ad-Hoc Network Portion","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer network; Mobile ad hoc network; Computer science; Provisioning; Wireless ad hoc network; Flexibility (engineering); Distributed computing; Cellular network; Telecommunications; Wireless","score_opus":0.010559677242922737,"score_gpt":0.21198815795590506,"score_spread":0.20142848071298233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171011077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34794176,0.0020285887,0.6087598,0.0011436533,0.00019234692,0.0001373491,0.000063096675,0.0014289239,0.03830455],"genre_scores_gemma":[0.91195023,0.00061418826,0.082452185,0.00009961989,0.000045049193,0.000033108936,0.000042950305,0.000023135814,0.0047395797],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998105,0.000053229473,0.000008714235,0.000023269387,0.00006868071,0.000035643723],"domain_scores_gemma":[0.9998628,0.000045053675,0.000015373113,0.0000278018,0.000026972702,0.000022020946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026579964,0.00015805296,0.000119593096,0.00020982546,0.0006064239,0.0008754602,0.0003118508,0.00043023628,0.00046092563],"category_scores_gemma":[0.0004790444,0.00014852686,0.000103566425,0.00022591077,0.0003516588,0.00091025076,0.00056302163,0.00033777842,0.00019763337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039830437,0.00015007856,0.011793085,0.00041716069,0.000057616264,0.0036950868,0.0018047821,0.11218214,0.16538918,0.302762,0.0088438615,0.39250663],"study_design_scores_gemma":[0.000027876524,0.00018138555,0.0047060824,0.000090215086,0.00006581352,0.0020831355,0.0010534159,0.7555949,0.0666309,0.077280484,0.09224241,0.000043320568],"about_ca_topic_score_codex":0.001137424,"about_ca_topic_score_gemma":0.002290308,"teacher_disagreement_score":0.001137424,"about_ca_system_score_codex":0.00030298438,"about_ca_system_score_gemma":0.00040146342,"threshold_uncertainty_score":0.0022616386},"labels":[],"label_agreement":null},{"id":"W2171109488","doi":"10.1109/rws.2008.4463622","title":"Combating routing holes by means of mobile nodes: Should energy really matter!?","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bridging (networking); Computer science; Computer network; Node (physics); Software deployment; Triangular routing; Distributed computing; Routing (electronic design automation); Static routing; Routing protocol; Engineering","score_opus":0.0179541041122974,"score_gpt":0.2348523289042455,"score_spread":0.21689822479194812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171109488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17712526,0.055029597,0.644857,0.07560614,0.0045665056,0.00015112852,0.00010819081,0.0003601937,0.042196024],"genre_scores_gemma":[0.90853643,0.019643627,0.059203964,0.003151421,0.0008325394,0.00008886859,0.00003581054,0.00009654417,0.008410753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996699,0.0001202787,0.000012502695,0.0000567229,0.00008179205,0.000058885922],"domain_scores_gemma":[0.9973573,0.0018592462,0.00019032616,0.000253473,0.00025489205,0.00008473489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010619198,0.0004400799,0.0006091514,0.00026308175,0.0005408386,0.0012991923,0.00090433,0.0018294592,0.002460754],"category_scores_gemma":[0.0049381843,0.00022351075,0.0002847418,0.00028102644,0.0025759658,0.0074693626,0.00079222873,0.0009311044,0.00051964575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005425546,0.00013352673,0.0036979557,0.0015990762,0.00013762744,0.0009248977,0.0007682833,0.05725678,0.03255726,0.62923616,0.010958562,0.26218727],"study_design_scores_gemma":[0.00005971421,0.0006699213,0.0021845114,0.0004894014,0.000108861335,0.001177536,0.0025601455,0.08621387,0.018266132,0.8309536,0.05720389,0.00011243163],"about_ca_topic_score_codex":0.00033472697,"about_ca_topic_score_gemma":0.0005532533,"teacher_disagreement_score":0.002460754,"about_ca_system_score_codex":0.00028087432,"about_ca_system_score_gemma":0.00023653352,"threshold_uncertainty_score":0.0082319975},"labels":[],"label_agreement":null},{"id":"W2171182192","doi":"10.1109/t-wc.2008.071252","title":"Joint medium access control, routing and energy distribution in multi-hop wireless networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless network; Quality of service; Convex optimization; Quasiconvex function; Computer network; Wireless; Optimization problem; Mathematical optimization; Regular polygon; Telecommunications; Convex combination; Algorithm; Mathematics","score_opus":0.03992311093209853,"score_gpt":0.2698131163579134,"score_spread":0.22989000542581486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171182192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024574568,0.0013378123,0.9712006,0.00040108524,0.00004486442,0.00003405166,0.000032740227,0.00011852869,0.0022558237],"genre_scores_gemma":[0.92748475,0.0019044691,0.0666859,0.00010559558,0.00013062639,0.00011168347,0.000061870116,0.000073052805,0.0034421359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982284,0.00081410725,0.000066064356,0.00018795696,0.00052291946,0.00018065289],"domain_scores_gemma":[0.99864095,0.00083012076,0.00018040673,0.0001249007,0.00017026214,0.000053412925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023790628,0.00086043443,0.000825669,0.00041375292,0.00041583655,0.0016918653,0.0010114551,0.0009805453,0.00073865487],"category_scores_gemma":[0.0036569335,0.0004893505,0.00037788192,0.00083583896,0.0014166792,0.0022105586,0.0014749574,0.0009093237,0.00017844784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085309934,0.00004717624,0.00031248346,0.00010014878,0.000027963073,0.00012073962,0.000051082014,0.91726416,0.004425855,0.055197448,0.0006048126,0.021762885],"study_design_scores_gemma":[0.000009693555,0.000031505544,0.00011328889,0.0000050796234,0.000007494821,0.000024177942,0.000011523276,0.9821389,0.0012869883,0.015853962,0.0005109326,0.000006497037],"about_ca_topic_score_codex":0.0016456384,"about_ca_topic_score_gemma":0.0010901936,"teacher_disagreement_score":0.0023790628,"about_ca_system_score_codex":0.0010165094,"about_ca_system_score_gemma":0.0011172637,"threshold_uncertainty_score":0.012581825},"labels":[],"label_agreement":null},{"id":"W2171275398","doi":"10.1109/jsen.2007.894149","title":"Bandwidth-Efficient Geographic Multicast Routing Protocol for Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Distance Vector Multicast Routing Protocol; Protocol Independent Multicast; Computer network; Xcast; Computer science; Source-specific multicast; Pragmatic General Multicast; Geographic routing; Distributed computing; Inter-domain; Routing protocol; Routing (electronic design automation); Dynamic Source Routing","score_opus":0.02083476456480327,"score_gpt":0.29267814244004786,"score_spread":0.2718433778752446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171275398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011041003,0.0076271277,0.96877575,0.0013007985,0.0005701863,0.00024391415,0.00028782405,0.0020364432,0.008116976],"genre_scores_gemma":[0.32587582,0.008190503,0.65391004,0.00085898093,0.0005882527,0.0009890177,0.0017413641,0.00023566598,0.0076103383],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993832,0.00020866707,0.000038105612,0.000045040266,0.00027531054,0.000049600407],"domain_scores_gemma":[0.9996524,0.00009724415,0.000049276332,0.000074972304,0.00010657857,0.000019529216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059586775,0.0005431794,0.00057758036,0.0007721915,0.00075876835,0.0005936541,0.0011320615,0.0006684567,0.0016702613],"category_scores_gemma":[0.0014171016,0.00018826949,0.0003557956,0.0010446227,0.00037552806,0.0015659923,0.0012340278,0.00072561257,0.00061892986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037700616,0.00012420825,0.00078044,0.0011491594,0.00021608162,0.0007274244,0.00038521815,0.115200914,0.04224872,0.1934174,0.058266006,0.58710736],"study_design_scores_gemma":[0.0001736167,0.0005115881,0.00086441555,0.0001506187,0.00021620323,0.0012967198,0.00020849783,0.51677126,0.01862669,0.13309723,0.32796904,0.00011400925],"about_ca_topic_score_codex":0.00071433943,"about_ca_topic_score_gemma":0.0012323756,"teacher_disagreement_score":0.0016702613,"about_ca_system_score_codex":0.0005290383,"about_ca_system_score_gemma":0.0005042307,"threshold_uncertainty_score":0.0055876374},"labels":[],"label_agreement":null},{"id":"W2171611083","doi":"10.1109/cnsr.2011.46","title":"Performance Comparison of Opportunistic Routing Schemes in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Routing protocol; Dynamic Source Routing; Wireless sensor network; Latency (audio); Network packet; Wireless Routing Protocol; Link-state routing protocol; Geographic routing; Zone Routing Protocol; Packet forwarding; Routing (electronic design automation); Distributed computing; Telecommunications","score_opus":0.053050472675897985,"score_gpt":0.2627921032331041,"score_spread":0.2097416305572061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171611083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8278442,0.012274636,0.14014935,0.00060332083,0.0005061771,0.00046118177,0.00037160885,0.0010291093,0.01676032],"genre_scores_gemma":[0.9804546,0.0015926675,0.016796272,0.000056414665,0.00003859758,0.000090346264,0.00015625717,0.00002539924,0.0007894324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969139,0.0011888713,0.00024133101,0.00019214328,0.0011374878,0.00032623575],"domain_scores_gemma":[0.99127334,0.0058249333,0.0005235202,0.0009246663,0.0012666599,0.00018696791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047386037,0.0007260463,0.0007746204,0.0015208365,0.00077930925,0.0009970109,0.0010307668,0.00081083877,0.00059178396],"category_scores_gemma":[0.010885511,0.00021725423,0.00033125715,0.0016884137,0.0005536906,0.0015158795,0.0009730445,0.00030411273,0.0001238588],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042727166,0.0006402178,0.011223889,0.0009830889,0.0004939898,0.00042438487,0.000442863,0.6090564,0.03268968,0.018414702,0.004093162,0.31726483],"study_design_scores_gemma":[0.00019626968,0.0032554546,0.006771901,0.000082929495,0.0002316445,0.00091354956,0.00050774176,0.9515499,0.02189059,0.007850245,0.0066180155,0.00013182554],"about_ca_topic_score_codex":0.0015339083,"about_ca_topic_score_gemma":0.0018022406,"teacher_disagreement_score":0.0047386037,"about_ca_system_score_codex":0.0010432851,"about_ca_system_score_gemma":0.000818339,"threshold_uncertainty_score":0.025060415},"labels":[],"label_agreement":null},{"id":"W2171871567","doi":"10.1109/bsc.2006.1644612","title":"Game Theory Applications in Network Reliability","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reliability (semiconductor); Game theory; Randomness; Reliability theory; Mathematical optimization; Reliability engineering; Mathematical economics; Mathematics; Engineering","score_opus":0.004676645533466059,"score_gpt":0.21292998135547564,"score_spread":0.20825333582200958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171871567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004866712,0.018038573,0.9030567,0.006337895,0.00106264,0.000117542986,0.00013400361,0.00016877866,0.0662171],"genre_scores_gemma":[0.48592907,0.040859878,0.439036,0.0027534647,0.0041815224,0.0008385022,0.00026841142,0.0002832579,0.025849849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849916,0.00084512983,0.00006092669,0.000120594596,0.00037936118,0.00009481859],"domain_scores_gemma":[0.99638003,0.0028173742,0.00014861612,0.0001951148,0.00035525343,0.000103641694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002213381,0.0017716198,0.0015838412,0.0015774574,0.0010440572,0.0020713264,0.0016533462,0.002162253,0.0067748125],"category_scores_gemma":[0.0077883513,0.00061079464,0.0014497911,0.002348185,0.002980218,0.0026847417,0.0021001936,0.0045951065,0.0011734958],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080573745,0.000020465148,0.00011462541,0.00012072958,0.000021193177,0.00005836025,0.00010075537,0.059361264,0.00022095637,0.92610663,0.003068214,0.010798758],"study_design_scores_gemma":[0.000013323186,0.000015496076,0.0000553674,0.000052950934,0.0000083565255,0.000042915584,0.000047355406,0.12864624,0.00007857349,0.8587217,0.012307541,0.0000102867425],"about_ca_topic_score_codex":0.004193559,"about_ca_topic_score_gemma":0.0021588113,"teacher_disagreement_score":0.0067748125,"about_ca_system_score_codex":0.0019255567,"about_ca_system_score_gemma":0.0016264701,"threshold_uncertainty_score":0.02266401},"labels":[],"label_agreement":null},{"id":"W2171888989","doi":"10.1007/3-540-45512-4_18","title":"QoS-Aware Adaptive Services in Mobile Ad-Hoc Networks","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Quality of service; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Mobile computing; Mobile QoS; Distributed computing; Optimized Link State Routing Protocol; Telecommunications; Service (business); Wireless","score_opus":0.011379264124026579,"score_gpt":0.22950865630725065,"score_spread":0.21812939218322408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171888989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024488047,0.034762427,0.88590574,0.001208238,0.0017338997,0.000096250384,0.000096842785,0.00195699,0.049751565],"genre_scores_gemma":[0.63816744,0.036113016,0.24285933,0.0006010309,0.0020878487,0.00015103453,0.00034374348,0.00034188016,0.07933476],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979573,0.000033934095,0.000011425141,0.000026534879,0.0001115477,0.000020770634],"domain_scores_gemma":[0.99972504,0.00014313638,0.000012103127,0.00003363715,0.000069297406,0.00001673618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029326658,0.00051460136,0.00037116793,0.00038401558,0.00028098706,0.00081061287,0.0009118037,0.0005626724,0.0021933496],"category_scores_gemma":[0.0007706643,0.00027180946,0.00015819196,0.000880618,0.00040203563,0.0012387849,0.00042549867,0.0009807434,0.00072122837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017542164,0.00011549349,0.0005218728,0.00047700896,0.00003980025,0.0003007573,0.00024108197,0.06610411,0.03887716,0.12379317,0.021637376,0.74771667],"study_design_scores_gemma":[0.000043050684,0.00023423738,0.0011726057,0.00017120142,0.00007891395,0.0012011152,0.00016438833,0.6611795,0.023056282,0.1389634,0.17367245,0.00006291305],"about_ca_topic_score_codex":0.0007534903,"about_ca_topic_score_gemma":0.0007674159,"teacher_disagreement_score":0.0021933496,"about_ca_system_score_codex":0.00040386154,"about_ca_system_score_gemma":0.00022446581,"threshold_uncertainty_score":0.0073375106},"labels":[],"label_agreement":null},{"id":"W2172049743","doi":"10.1002/wcm.1159","title":"Multichannel medium access control for ad hoc wireless networks","year":2011,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Multiple Access with Collision Avoidance for Wireless; Control channel; Interface (matter); Channel (broadcasting); Throughput; Transmission (telecommunications); Protocol (science); Synchronization (alternating current); Hidden node problem; Wireless network; Wireless; Network interface; Data transmission; Vehicular ad hoc network; Wi-Fi array; Telecommunications; Telecommunications link; Operating system","score_opus":0.04181441175237899,"score_gpt":0.287475893324235,"score_spread":0.24566148157185602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172049743","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012099983,0.011232543,0.97087497,0.0004014604,0.00071542873,0.000090599104,0.000035753295,0.0003008595,0.004248486],"genre_scores_gemma":[0.7852786,0.011665062,0.19154315,0.00042617496,0.0012458727,0.0005357696,0.00014438317,0.00006301158,0.009097925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873513,0.00056585314,0.0000646752,0.00015139513,0.00040776547,0.00007525263],"domain_scores_gemma":[0.9982895,0.00093137805,0.00021466859,0.00015865621,0.0003508778,0.00005496341],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012682411,0.00060751516,0.0006501231,0.00057166076,0.00049857295,0.0010747873,0.000992069,0.0008034407,0.0016337632],"category_scores_gemma":[0.003134338,0.00014246716,0.0002516408,0.00090939173,0.00073718757,0.0011156464,0.0007219267,0.0010676454,0.0003669086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002009834,0.00016434776,0.0015661548,0.0009812886,0.0002856501,0.0007694737,0.00040041818,0.3390416,0.02078987,0.19825402,0.009498724,0.42804742],"study_design_scores_gemma":[0.00003661029,0.00016080377,0.0002904126,0.00004967696,0.000035260728,0.00022140356,0.000042553205,0.94036156,0.0026306433,0.03451742,0.02162279,0.0000308932],"about_ca_topic_score_codex":0.0011345936,"about_ca_topic_score_gemma":0.0007794043,"teacher_disagreement_score":0.0016337632,"about_ca_system_score_codex":0.0004831462,"about_ca_system_score_gemma":0.0005551703,"threshold_uncertainty_score":0.0067071915},"labels":[],"label_agreement":null},{"id":"W2172100059","doi":"10.1109/tmc.2013.147","title":"A Scalable Bandwidth-Efficient Hybrid Adaptive Service Discovery Protocol for Vehicular Networks with Infrastructure Support","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Service discovery; Scalability; Correctness; Service provider; Bandwidth (computing); Routing protocol; Network packet; Vehicular ad hoc network; Service (business); Distributed computing; Wireless ad hoc network; Wireless; Web service; Telecommunications; World Wide Web; Database","score_opus":0.00934413978443698,"score_gpt":0.23763467440057165,"score_spread":0.22829053461613466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172100059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018162938,0.0012956784,0.97341746,0.00060356036,0.00025867965,0.00052599865,0.00013795496,0.0016574604,0.003940277],"genre_scores_gemma":[0.71537155,0.0014088608,0.2763724,0.0003588111,0.00012699522,0.001149084,0.0007729412,0.000094487936,0.0043447586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987086,0.00030316177,0.00014983871,0.00012640821,0.0005792168,0.00013272554],"domain_scores_gemma":[0.998691,0.0005274627,0.00014063908,0.00015021549,0.00041715743,0.00007358297],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016548699,0.0005595392,0.00079850084,0.0013537575,0.0011180573,0.001059371,0.0019909258,0.0007847994,0.00082983583],"category_scores_gemma":[0.0038152626,0.00033663222,0.000551262,0.0014294079,0.0008854408,0.0015411878,0.0021707544,0.0010682849,0.00026391735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008252289,0.000246902,0.0018532631,0.00078404445,0.00030433192,0.0018883473,0.0010400178,0.2709332,0.07934679,0.20718855,0.018318582,0.41727072],"study_design_scores_gemma":[0.00014131385,0.00030811699,0.00045762854,0.00004975127,0.0001174755,0.00092133565,0.00016031261,0.9188772,0.013568705,0.028051844,0.037228756,0.0001175238],"about_ca_topic_score_codex":0.0039475663,"about_ca_topic_score_gemma":0.0039806175,"teacher_disagreement_score":0.0039475663,"about_ca_system_score_codex":0.0011772739,"about_ca_system_score_gemma":0.001924003,"threshold_uncertainty_score":0.008751869},"labels":[],"label_agreement":null},{"id":"W2173002974","doi":"10.1016/j.tcs.2015.02.017","title":"Strong connectivity of sensor networks with double antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Wireless sensor network; Mathematics; Computer network","score_opus":0.0180973245174269,"score_gpt":0.24659175151804394,"score_spread":0.22849442700061703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2173002974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3613303,0.003457916,0.61061555,0.00173202,0.0003546255,0.00008407629,0.00023762541,0.00027896263,0.021909047],"genre_scores_gemma":[0.98493516,0.0011195827,0.0106534455,0.00010173269,0.00013146394,0.00006133415,0.00007808705,0.000022201959,0.0028969755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923384,0.0003186883,0.000038723236,0.00014280678,0.00016538094,0.00010059237],"domain_scores_gemma":[0.99454236,0.0037167084,0.0005801796,0.00044126398,0.0004542739,0.00026514978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007693992,0.0004386975,0.0005896869,0.0009907235,0.00059722975,0.0011434528,0.00080431084,0.0007196053,0.0018485833],"category_scores_gemma":[0.007672116,0.00054223073,0.00031224647,0.0009927815,0.0011698272,0.0021486925,0.0020323126,0.0009698693,0.0002492192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011240471,0.00011487803,0.0076132957,0.0007427454,0.00017505804,0.0013688793,0.0007565285,0.425012,0.029952938,0.42286062,0.0062942305,0.10398477],"study_design_scores_gemma":[0.0001463891,0.0005094971,0.003388682,0.000088859524,0.00010628706,0.0012957717,0.0004082211,0.65260565,0.0055006286,0.32738113,0.008510347,0.000058597678],"about_ca_topic_score_codex":0.00026012518,"about_ca_topic_score_gemma":0.0003436987,"teacher_disagreement_score":0.0018485833,"about_ca_system_score_codex":0.0003523214,"about_ca_system_score_gemma":0.0002699003,"threshold_uncertainty_score":0.006184101},"labels":[],"label_agreement":null},{"id":"W2176074649","doi":"10.1109/icc.2006.255550","title":"Totally Disjoint Multipath Routing in Multihop Wireless Networks","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multipath routing; Computer network; Computer science; Dynamic Source Routing; Geographic routing; Static routing; Distributed computing; Multipath propagation; Multipath interference; Link-state routing protocol; Equal-cost multi-path routing; Wireless Routing Protocol; Throughput; Disjoint sets; Wireless network; Routing (electronic design automation); Wireless; Routing protocol; Telecommunications","score_opus":0.052186951716863515,"score_gpt":0.3070467231362634,"score_spread":0.2548597714193999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176074649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055075917,0.009178599,0.9302046,0.00035152785,0.00024349248,0.00011946943,0.00007140148,0.0006000364,0.004154985],"genre_scores_gemma":[0.6913235,0.009506468,0.2944994,0.00014478127,0.00033719622,0.00022621667,0.00014640663,0.000101103404,0.003714922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919325,0.00035060942,0.000037941874,0.00007062551,0.00027960193,0.00006792099],"domain_scores_gemma":[0.9987336,0.0006973966,0.00019427185,0.00015600359,0.00016705199,0.00005171359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011073917,0.0007488168,0.0005279492,0.0008115133,0.00058245903,0.0009563154,0.00083229557,0.00071403413,0.000771359],"category_scores_gemma":[0.0028816727,0.0004067716,0.00031973934,0.0012974852,0.0007201792,0.0017071457,0.001048278,0.00048207917,0.00020085702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014253109,0.000046850328,0.00089287735,0.00039550968,0.00014246533,0.00028163166,0.00016520909,0.7451404,0.013759958,0.05658314,0.002012079,0.18043737],"study_design_scores_gemma":[0.00003623895,0.0003046062,0.00050788256,0.000043076332,0.000058751655,0.00056789414,0.0000811637,0.91156185,0.005129029,0.07347104,0.008191885,0.000046544963],"about_ca_topic_score_codex":0.0007518704,"about_ca_topic_score_gemma":0.0010911132,"teacher_disagreement_score":0.0011073917,"about_ca_system_score_codex":0.0005377016,"about_ca_system_score_gemma":0.00052514893,"threshold_uncertainty_score":0.005856514},"labels":[],"label_agreement":null},{"id":"W2176317645","doi":"10.1007/978-3-642-17994-5_5","title":"Location Management in Heterogeneous VANETs: A Mobility Aware Server Selection Method","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer network; Server; Computer science; Mobility management; Mobility model; Wireless ad hoc network; Limiting; Bandwidth (computing); Vehicular ad hoc network; Wireless; Telecommunications; Engineering","score_opus":0.017105500428256912,"score_gpt":0.2524897526179928,"score_spread":0.23538425218973585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176317645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014298562,0.00019706786,0.9832692,0.0000726772,0.000054940625,0.000059139024,0.0000448633,0.0007276847,0.001275819],"genre_scores_gemma":[0.46833137,0.00027449074,0.52567357,0.00008948831,0.00018615878,0.0001348207,0.00026912568,0.00021551212,0.0048254915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992748,0.00021689525,0.00005047135,0.00013128128,0.00024164615,0.00008481057],"domain_scores_gemma":[0.99892277,0.00052298786,0.00007265826,0.00017133489,0.00023444243,0.00007572706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011172881,0.00062127376,0.0012129055,0.0012912897,0.000835767,0.0011499696,0.0018048545,0.00074438856,0.0023082285],"category_scores_gemma":[0.0019046855,0.0003998055,0.000671779,0.0013358835,0.00036888546,0.0014017506,0.0009504171,0.0006083919,0.00060221634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005852677,0.00038833093,0.0029014177,0.00013449915,0.00022720675,0.00028100042,0.00027098827,0.1707664,0.041054554,0.013784132,0.006014876,0.76359123],"study_design_scores_gemma":[0.000038132814,0.00006310501,0.0005311457,0.0000064184565,0.00005815597,0.00013618443,0.00005698774,0.9888176,0.00565657,0.0032268658,0.0013865632,0.000022249695],"about_ca_topic_score_codex":0.0015329542,"about_ca_topic_score_gemma":0.0026892333,"teacher_disagreement_score":0.0023082285,"about_ca_system_score_codex":0.00046300833,"about_ca_system_score_gemma":0.0005521686,"threshold_uncertainty_score":0.0077217817},"labels":[],"label_agreement":null},{"id":"W2181695566","doi":"10.22215/etd/2006-07848","title":"Transport layer fairness and congestion control in wireless ad hoc access networks","year":2006,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer network; Computer science; Network congestion; Wireless ad hoc network; Telecommunications; Wireless","score_opus":0.009278421515642425,"score_gpt":0.24943229331343203,"score_spread":0.2401538717977896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181695566","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11700898,0.019628955,0.8210649,0.0066566397,0.0033908093,0.00018745544,0.00018078409,0.0005121149,0.031369463],"genre_scores_gemma":[0.9616427,0.0037061453,0.02075398,0.0002802798,0.001835691,0.000109972476,0.00004617453,0.00006312346,0.011562034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981186,0.0008788993,0.000081278886,0.0001904449,0.0004862736,0.00024452817],"domain_scores_gemma":[0.9930038,0.00526712,0.0003944001,0.0003248951,0.0007534339,0.00025625716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004369855,0.0004764166,0.0006335685,0.0007155809,0.00092155393,0.0021997113,0.0012270713,0.00077047746,0.0020912057],"category_scores_gemma":[0.0142796505,0.00035687213,0.00027128184,0.0008568464,0.0015975108,0.003272113,0.000880095,0.0015407152,0.00025986094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008180571,0.00024518787,0.0032890856,0.00025464158,0.00010377908,0.00036261257,0.00060648186,0.31386316,0.004660022,0.54686075,0.010156706,0.1187796],"study_design_scores_gemma":[0.0000510399,0.000110682326,0.0009000116,0.000040661293,0.000044004766,0.00008666329,0.000093149916,0.8023887,0.0011432188,0.18703137,0.008076125,0.000034296776],"about_ca_topic_score_codex":0.0058673294,"about_ca_topic_score_gemma":0.0035874236,"teacher_disagreement_score":0.0058673294,"about_ca_system_score_codex":0.0023087678,"about_ca_system_score_gemma":0.001958984,"threshold_uncertainty_score":0.02311027},"labels":[],"label_agreement":null},{"id":"W2182396347","doi":"","title":"On the Pitfalls of Directional Location-based Randomized Routing","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Routing (electronic design automation); Static routing; Network packet; Network topology; Equal-cost multi-path routing; Geographic routing; Destination-Sequenced Distance Vector routing; Energy consumption; Link-state routing protocol; Routing protocol; Computer network; Engineering","score_opus":0.009306263841739045,"score_gpt":0.23081122616091712,"score_spread":0.22150496231917807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182396347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010794403,0.0059691435,0.9598472,0.009205423,0.0007071791,0.00013465135,0.00007530987,0.0005241947,0.012742567],"genre_scores_gemma":[0.5436493,0.011944735,0.42969373,0.004406926,0.0017242669,0.000585772,0.00020987778,0.0004792623,0.0073061385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9896225,0.006308069,0.0004006533,0.00080150383,0.002438602,0.00042869407],"domain_scores_gemma":[0.96351695,0.025184682,0.0018120976,0.0066978503,0.002427895,0.00036050327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012576697,0.0008555056,0.0013162199,0.0012047086,0.0017521157,0.0027196866,0.0028157707,0.0024586748,0.002296301],"category_scores_gemma":[0.038096674,0.00072479644,0.0008661737,0.0018267576,0.004954912,0.009207804,0.0034643172,0.005038766,0.0013540663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038279413,0.00007890195,0.0011442299,0.00027930917,0.000092806134,0.00034400137,0.00039474835,0.115105666,0.003619901,0.737631,0.008015136,0.13291155],"study_design_scores_gemma":[0.00015082888,0.00034793973,0.00045991768,0.0002225122,0.00009434176,0.0010503192,0.00020292113,0.4110914,0.0029953027,0.5449076,0.038288172,0.00018882492],"about_ca_topic_score_codex":0.0016453908,"about_ca_topic_score_gemma":0.0014903836,"teacher_disagreement_score":0.012576697,"about_ca_system_score_codex":0.001500082,"about_ca_system_score_gemma":0.0013605723,"threshold_uncertainty_score":0.06651276},"labels":[],"label_agreement":null},{"id":"W2182673174","doi":"","title":"A framework for peer-to-peer computing in mobile ad hoc networks","year":2010,"lang":"en","type":"article","venue":"QSpace (Queen's University Library)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Distributed computing; Overlay network; Wireless ad hoc network; File sharing; Node (physics); Multicast; Peer-to-peer; Mobile computing; Vehicular ad hoc network; The Internet; Wireless; Network packet; World Wide Web","score_opus":0.007069048599526745,"score_gpt":0.2126427082067049,"score_spread":0.20557365960717813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2182673174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005128763,0.00305409,0.9798814,0.0014711134,0.0006085486,0.00058948895,0.000138389,0.0013732582,0.012370804],"genre_scores_gemma":[0.03977462,0.0056657665,0.9369809,0.0006682312,0.0011300797,0.0024443502,0.00046334194,0.0003013273,0.012571336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952531,0.0017117147,0.000443909,0.0005625786,0.001747069,0.0002816052],"domain_scores_gemma":[0.9981111,0.0008313174,0.00012744709,0.0003659325,0.00036368362,0.00020049552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049465657,0.0019343558,0.0019328687,0.0018277926,0.0031452198,0.0064903167,0.0077548,0.005010049,0.0077468595],"category_scores_gemma":[0.005812344,0.0014487422,0.00232782,0.0030139505,0.0047391504,0.0077660386,0.004706226,0.00623032,0.0043201363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002567399,0.000042226195,0.000106332554,0.00039310285,0.00004514657,0.00033368825,0.00038750915,0.029298456,0.0009832015,0.90836126,0.014519612,0.04550376],"study_design_scores_gemma":[0.00011764514,0.00011552129,0.00009938841,0.0002640949,0.000053740474,0.0004931466,0.00014003039,0.14736246,0.00080027804,0.49288994,0.3575751,0.000088721696],"about_ca_topic_score_codex":0.004840496,"about_ca_topic_score_gemma":0.004238203,"teacher_disagreement_score":0.0077548,"about_ca_system_score_codex":0.0026125668,"about_ca_system_score_gemma":0.0043833,"threshold_uncertainty_score":0.02616024},"labels":[],"label_agreement":null},{"id":"W2183275409","doi":"","title":"A Survey on Geographic Routing Protocols for Mobile Ad hoc Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Telecommunications; Wireless","score_opus":0.05130974733714501,"score_gpt":0.28407728729665893,"score_spread":0.23276753995951394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183275409","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070828353,0.5357154,0.36046076,0.0043456736,0.0043868744,0.0007100453,0.0014018378,0.002591877,0.0833048],"genre_scores_gemma":[0.055542096,0.7015497,0.20014939,0.0022169354,0.0030019055,0.0007830095,0.0039843996,0.00040375857,0.032368787],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991748,0.00015244342,0.00012131684,0.00009311661,0.00038774734,0.00007052991],"domain_scores_gemma":[0.9993436,0.0002831571,0.000051669926,0.00008101933,0.00021076312,0.000029801111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006418488,0.0010604762,0.0011181382,0.0024022989,0.0007319601,0.00191794,0.0016740359,0.0015165017,0.006743393],"category_scores_gemma":[0.0017500403,0.00055790745,0.0006006357,0.0066719144,0.00043303458,0.0039740796,0.0011815554,0.001273793,0.0048769284],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055070974,0.0000936721,0.00061533717,0.0035344318,0.00005737988,0.00036868875,0.00024362147,0.006436648,0.0036308528,0.050011676,0.0810426,0.85391],"study_design_scores_gemma":[0.0000149860425,0.00010527585,0.00063032616,0.00076854276,0.00005891996,0.0014438309,0.00018598541,0.012190071,0.0013588861,0.02494585,0.9582425,0.000054848668],"about_ca_topic_score_codex":0.0012376751,"about_ca_topic_score_gemma":0.0012420984,"teacher_disagreement_score":0.006743393,"about_ca_system_score_codex":0.0005900161,"about_ca_system_score_gemma":0.00093115447,"threshold_uncertainty_score":0.022558928},"labels":[],"label_agreement":null},{"id":"W2183577945","doi":"","title":"An Approach for Establishing Trust in MANETs for Network Services","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer security; Business; Internet privacy; Computer network","score_opus":0.014550027317301779,"score_gpt":0.24477103940254238,"score_spread":0.2302210120852406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2183577945","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003443493,0.00024007667,0.9901541,0.0010981238,0.00015047619,0.00028182284,0.00004586455,0.00025033063,0.0043356386],"genre_scores_gemma":[0.24823436,0.00078620826,0.7387685,0.00044302183,0.0002548412,0.00047843455,0.00014997165,0.00012256857,0.01076208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206513,0.0029796867,0.0005818713,0.00085159944,0.0030325053,0.0004892673],"domain_scores_gemma":[0.9890041,0.003830161,0.00079370494,0.003321118,0.0023877742,0.00066314475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069997907,0.00094095065,0.0014599145,0.0019154634,0.003965135,0.005745796,0.0037813347,0.0036136396,0.0031504612],"category_scores_gemma":[0.016018651,0.0010006616,0.0020642302,0.0021085117,0.003948299,0.012337866,0.0066241887,0.005141923,0.0013061826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002115927,0.00017301393,0.0012264098,0.00042666096,0.00021631074,0.0007714838,0.0028792184,0.03157337,0.0064116893,0.83880275,0.0077046035,0.10960298],"study_design_scores_gemma":[0.000090922986,0.00029147984,0.00048234963,0.00020662886,0.00029811278,0.0010271256,0.001992628,0.36934868,0.008702586,0.5445403,0.07283875,0.0001804848],"about_ca_topic_score_codex":0.004352446,"about_ca_topic_score_gemma":0.0058927024,"teacher_disagreement_score":0.0069997907,"about_ca_system_score_codex":0.0028890865,"about_ca_system_score_gemma":0.0033863652,"threshold_uncertainty_score":0.037018895},"labels":[],"label_agreement":null},{"id":"W2184571975","doi":"10.22215/etd/2012-09612","title":"Mitigation of flooding disruption attacks in link state mobile ad hoc networks","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"Mitacs; Consejo Nacional de Ciencia y Tecnología","keywords":"Flooding (psychology); Computer science; State (computer science); Computer security; Psychology","score_opus":0.0099572785218132,"score_gpt":0.2682976928160626,"score_spread":0.25834041429424937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2184571975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43718347,0.004670002,0.523379,0.0027067894,0.0005662841,0.0005185199,0.0001859637,0.0032309885,0.027558995],"genre_scores_gemma":[0.98290896,0.00067244226,0.013203156,0.000078376725,0.00009797353,0.000049452232,0.00010130831,0.000027680253,0.0028606325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993537,0.00020911869,0.00003789777,0.000054599754,0.00021763846,0.00012704876],"domain_scores_gemma":[0.99854004,0.0006012331,0.00023022083,0.00026772663,0.00025383022,0.000107063956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074517744,0.00052581006,0.00047423458,0.000775285,0.0005222072,0.00055709155,0.00068160193,0.00056311314,0.0010599727],"category_scores_gemma":[0.0039510475,0.00020289775,0.00019521441,0.00040037915,0.0004227244,0.0013671884,0.0014059934,0.0005673073,0.00039513307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001125037,0.00039008813,0.007562355,0.0003801353,0.0001778906,0.00062842097,0.00057183334,0.40405348,0.07275304,0.022180092,0.012394458,0.47778314],"study_design_scores_gemma":[0.00006991101,0.00093560776,0.0032239659,0.000051498046,0.00007488585,0.0007081191,0.00038879568,0.94938004,0.02018282,0.012764774,0.012191332,0.000028316377],"about_ca_topic_score_codex":0.000731157,"about_ca_topic_score_gemma":0.0008018223,"teacher_disagreement_score":0.0010599727,"about_ca_system_score_codex":0.00038983437,"about_ca_system_score_gemma":0.00047146843,"threshold_uncertainty_score":0.00394094},"labels":[],"label_agreement":null},{"id":"W2186670902","doi":"10.46298/dmtcs.610","title":"Connectivity for line-of-sight networks in higher dimensions","year":2013,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Queen's University; McGill University","keywords":"Mathematics; Combinatorics; Graph; Line-of-sight; Line (geometry); Discrete mathematics; Integer (computer science); Random geometric graph; Random graph; Norm (philosophy); Line graph; Geometry; Physics; Voltage graph; Computer science","score_opus":0.018431229348205444,"score_gpt":0.25904175825019093,"score_spread":0.24061052890198548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186670902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24704513,0.0030056764,0.73138326,0.0028138033,0.00007629568,0.000183805,0.0008246128,0.00059762277,0.01406973],"genre_scores_gemma":[0.9231552,0.001942217,0.06728452,0.0002868453,0.00018877909,0.00035317818,0.0007691407,0.00016700722,0.005853122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99828476,0.00064719166,0.00008275044,0.0003050538,0.00042092384,0.0002593468],"domain_scores_gemma":[0.97957474,0.01565099,0.0020152233,0.0009660137,0.0010864312,0.00070662634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001980073,0.00087231066,0.0011665517,0.0023204177,0.0012118845,0.0026008415,0.0027755522,0.0014858616,0.0044014105],"category_scores_gemma":[0.02299052,0.0006469492,0.0007643153,0.0021584434,0.0022226423,0.0051508048,0.0023753436,0.0017483849,0.00050480897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020262894,0.00010755088,0.0045003234,0.00027512442,0.00009755297,0.00019643478,0.00045174398,0.54691434,0.002070056,0.4255884,0.004854548,0.014741295],"study_design_scores_gemma":[0.00002358438,0.00003951053,0.00087345927,0.000027048445,0.000017628578,0.00009243985,0.00008471011,0.83783126,0.00029706044,0.15918404,0.0015139004,0.000015446289],"about_ca_topic_score_codex":0.0040806932,"about_ca_topic_score_gemma":0.0030725277,"teacher_disagreement_score":0.0044014105,"about_ca_system_score_codex":0.002993912,"about_ca_system_score_gemma":0.00070849154,"threshold_uncertainty_score":0.021722436},"labels":[],"label_agreement":null},{"id":"W2200044402","doi":"10.1002/9780470396384.ch2","title":"Establishing a Communication Infrastructure in Ad Hoc Networks","year":2008,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network; Wireless ad hoc network; Cluster analysis; Distributed computing; Routing protocol; Telecommunications; Artificial intelligence; Wireless","score_opus":0.0073726349176905836,"score_gpt":0.21686825392625014,"score_spread":0.20949561900855956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200044402","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005820484,0.06460792,0.56687665,0.0039191833,0.004401947,0.00062440475,0.00021007375,0.001668142,0.35187128],"genre_scores_gemma":[0.096530005,0.14445885,0.5257498,0.0012146751,0.004309158,0.00087555574,0.0011026195,0.0005064222,0.22525291],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992907,0.00014921695,0.000037055324,0.00009460117,0.00035762085,0.000070807815],"domain_scores_gemma":[0.99955183,0.00020572526,0.000027933696,0.00007307082,0.00010226465,0.000039273353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006029538,0.0005556499,0.00040787083,0.0010125696,0.0009268479,0.0029867596,0.0014096904,0.0012899541,0.0115273995],"category_scores_gemma":[0.001551307,0.00060160196,0.00028071823,0.0022962168,0.0010583033,0.0041494896,0.0015369874,0.0014802613,0.007014997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018323411,0.00007455663,0.00026718387,0.00090602686,0.000009484654,0.0001674917,0.00043458174,0.008035129,0.0040848716,0.42693102,0.05491334,0.5041581],"study_design_scores_gemma":[0.000008043025,0.00007962611,0.0003665904,0.0007163036,0.00001942302,0.00038361998,0.00039182467,0.00954395,0.0033938668,0.111706704,0.8733617,0.00002839481],"about_ca_topic_score_codex":0.00084944314,"about_ca_topic_score_gemma":0.00095439615,"teacher_disagreement_score":0.0115273995,"about_ca_system_score_codex":0.0007864498,"about_ca_system_score_gemma":0.0010810328,"threshold_uncertainty_score":0.038562953},"labels":[],"label_agreement":null},{"id":"W2201300238","doi":"10.1002/9780470396360.ch7","title":"Clustering in Wireless Sensor Networks: A Graph Theory Perspective","year":2008,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Cluster analysis; Wireless sensor network; Perspective (graphical); Computer science; Graph theory; Wireless network; Computer network; Wireless; Mathematics; Artificial intelligence; Telecommunications; Combinatorics","score_opus":0.00888527200912012,"score_gpt":0.22585577778559587,"score_spread":0.21697050577647575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201300238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004694719,0.24193075,0.62398946,0.016794197,0.008926015,0.00023019793,0.0009194781,0.00048273764,0.10203237],"genre_scores_gemma":[0.08037563,0.4562325,0.38158646,0.0046337326,0.013722258,0.00044464046,0.0019239149,0.00045408422,0.06062684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992411,0.00020620847,0.000043959408,0.00016664446,0.00030463806,0.000037524173],"domain_scores_gemma":[0.9989673,0.0006480364,0.00004683753,0.00007442493,0.0002169311,0.000046449106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000828102,0.00082602026,0.0010522442,0.003880261,0.0008589534,0.0025783412,0.0017734794,0.0016549983,0.007917529],"category_scores_gemma":[0.002486332,0.000688718,0.00075739366,0.010730975,0.0017309051,0.0052822186,0.0010210148,0.002471767,0.0021483111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001769054,0.000045284934,0.00026107614,0.0017746219,0.000045159344,0.00011153386,0.00026496605,0.017596181,0.00076088763,0.7317054,0.06241635,0.18500084],"study_design_scores_gemma":[0.000007798515,0.000028346527,0.00046567863,0.0005610619,0.00004049775,0.00024459072,0.00020855393,0.01744098,0.00045613575,0.6864027,0.29411244,0.000031329473],"about_ca_topic_score_codex":0.001957221,"about_ca_topic_score_gemma":0.0023334469,"teacher_disagreement_score":0.007917529,"about_ca_system_score_codex":0.0017201524,"about_ca_system_score_gemma":0.00095884706,"threshold_uncertainty_score":0.026486754},"labels":[],"label_agreement":null},{"id":"W2205892834","doi":"10.1109/intellisys.2015.7361260","title":"A Markov chain model for securing link layer in mobile ad hoc networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Computer security; Wireless network; Wireless; Distributed computing; Routing protocol; Network packet; Telecommunications","score_opus":0.029850583835858747,"score_gpt":0.2620739376455661,"score_spread":0.23222335380970732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205892834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021600218,0.00085019215,0.97083664,0.00064572896,0.00012229304,0.00012770388,0.00032215138,0.00032514837,0.0051697963],"genre_scores_gemma":[0.90104574,0.003343577,0.082086995,0.00036193774,0.00031951224,0.0007202149,0.00080586894,0.00009922832,0.011216806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886763,0.00041871282,0.000047788075,0.00021435398,0.00026223905,0.00018943391],"domain_scores_gemma":[0.99460053,0.0041111517,0.0004515813,0.00020866266,0.0004994685,0.00012848922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018503943,0.0011592484,0.0012257945,0.001030815,0.0010140052,0.0016165222,0.0017708534,0.0018471436,0.0050253966],"category_scores_gemma":[0.0067333267,0.0005652485,0.00093799277,0.0012899332,0.0017741431,0.002628088,0.00083175127,0.0022541077,0.0010292669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009372401,0.00005819628,0.0014934274,0.000105130115,0.00004491977,0.000288257,0.00017366366,0.850757,0.0012167171,0.13651814,0.0015078314,0.007742998],"study_design_scores_gemma":[0.000017609722,0.000037691785,0.00015671624,0.000014419934,0.000018039294,0.00005088326,0.0000167497,0.97624767,0.0001573539,0.02261743,0.0006498687,0.000015590118],"about_ca_topic_score_codex":0.011669415,"about_ca_topic_score_gemma":0.007628968,"teacher_disagreement_score":0.011669415,"about_ca_system_score_codex":0.0018112159,"about_ca_system_score_gemma":0.0015910055,"threshold_uncertainty_score":0.023203015},"labels":[],"label_agreement":null},{"id":"W2207212001","doi":"10.1109/milcom.2015.7357528","title":"An optimized link scheduling technique for mobile ad hoc networks using directional antennas","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Fair-share scheduling; Dynamic priority scheduling; Round-robin scheduling; Distributed computing; Rate-monotonic scheduling; Computer network; Two-level scheduling; Mobile ad hoc network; Scheduling (production processes); Earliest deadline first scheduling; Mathematical optimization; Mathematics","score_opus":0.03576103174133035,"score_gpt":0.2974933303737653,"score_spread":0.26173229863243497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2207212001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007927527,0.00022431836,0.99035054,0.00005900363,0.000029526767,0.000022607845,0.000017437997,0.000083872656,0.0012850789],"genre_scores_gemma":[0.40735835,0.00093269936,0.5870713,0.00013635684,0.00014496656,0.00012471361,0.00016045905,0.00013387155,0.0039372547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996145,0.00015977492,0.00001118637,0.000047002955,0.000124381,0.000043101787],"domain_scores_gemma":[0.99954516,0.0002601144,0.0000734119,0.000042705164,0.00006300841,0.000015547976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006631798,0.0005074121,0.00043078393,0.00033518678,0.00034028303,0.00042466432,0.0005993687,0.00034444412,0.0011454637],"category_scores_gemma":[0.0012454351,0.00026138962,0.00029029808,0.0008371725,0.00032543862,0.0007221389,0.00033507784,0.000608173,0.0003531131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006308549,0.00007134044,0.00021407449,0.00009152015,0.000033511224,0.000043562475,0.000045878955,0.88476616,0.012252089,0.021637565,0.0014326609,0.07934846],"study_design_scores_gemma":[0.00000924272,0.00008288429,0.00006992062,0.000003519303,0.000009600804,0.000028466407,0.000011456507,0.9919744,0.002047202,0.004027806,0.0017297516,0.0000056589993],"about_ca_topic_score_codex":0.0010494376,"about_ca_topic_score_gemma":0.0014782,"teacher_disagreement_score":0.0011454637,"about_ca_system_score_codex":0.00044079174,"about_ca_system_score_gemma":0.0007278891,"threshold_uncertainty_score":0.003831923},"labels":[],"label_agreement":null},{"id":"W2212193925","doi":"10.1109/milcom.2015.7357530","title":"HMS: Holistic MPR selection and network connectivity for tactical edge networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Unicast; Computer network; Enhanced Data Rates for GSM Evolution; Routing (electronic design automation); Greedy algorithm; Heuristic; Selection (genetic algorithm); Transmission (telecommunications); Bandwidth (computing); Distributed computing; Multicast; Telecommunications; Algorithm; Artificial intelligence","score_opus":0.04132812273756616,"score_gpt":0.2843229503750665,"score_spread":0.24299482763750033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2212193925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14036958,0.00092964637,0.8481942,0.0002452805,0.000077045035,0.00015120968,0.00018797917,0.0016427067,0.008202367],"genre_scores_gemma":[0.76940703,0.00024358045,0.22813661,0.000104365754,0.000030125666,0.00009507478,0.00021211292,0.00008146708,0.0016896576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997018,0.000067534704,0.000010941916,0.00005641106,0.000101452315,0.00006188475],"domain_scores_gemma":[0.9996799,0.0001039544,0.00006085952,0.00006366895,0.000055686258,0.000035944395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004189858,0.0006915698,0.0006622343,0.0006389931,0.00040038239,0.0005050508,0.0010315783,0.00041860252,0.0016923718],"category_scores_gemma":[0.0010866967,0.00023350958,0.00032970545,0.00053374044,0.000426787,0.00088471215,0.0010648496,0.00032419592,0.00027268185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022136782,0.00010347638,0.003090759,0.0001907081,0.00008705163,0.00029344295,0.00015490493,0.6121298,0.04248605,0.015018354,0.004866239,0.32135788],"study_design_scores_gemma":[0.000024835303,0.00035163586,0.0017056329,0.0000133967715,0.000032767974,0.00039575298,0.00008969562,0.9800341,0.009587728,0.0046822494,0.0030572163,0.000024961815],"about_ca_topic_score_codex":0.0014103007,"about_ca_topic_score_gemma":0.002216915,"teacher_disagreement_score":0.0016923718,"about_ca_system_score_codex":0.00054872554,"about_ca_system_score_gemma":0.0005311865,"threshold_uncertainty_score":0.005661607},"labels":[],"label_agreement":null},{"id":"W2223611515","doi":"10.1007/978-3-319-08783-2_43","title":"Displacing Random Sensors to Avoid Interference","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Interference (communication); Computer science; Telecommunications","score_opus":0.011445154485956274,"score_gpt":0.23231634482387584,"score_spread":0.22087119033791958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223611515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0281498,0.0014847597,0.94549024,0.00036273088,0.0005196396,0.00007905661,0.0000562439,0.0012274276,0.02263003],"genre_scores_gemma":[0.6477542,0.0019180014,0.309749,0.00082077837,0.00017379905,0.00012252816,0.00014869081,0.00037421173,0.038938724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.00006499874,0.000017499446,0.00013403573,0.00013777461,0.000039310646],"domain_scores_gemma":[0.99939287,0.00024328394,0.000061286315,0.00017380204,0.00009220693,0.00003662073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004170386,0.0009400406,0.0005637127,0.00034430754,0.00036526847,0.0006719947,0.0015000429,0.00085150066,0.005494887],"category_scores_gemma":[0.0017081137,0.00035657795,0.000404608,0.00043511612,0.00062639295,0.0015817154,0.0012954972,0.0008654094,0.001823295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005662152,0.00019207889,0.00076051964,0.00059535564,0.00011329304,0.00060331257,0.00034643908,0.11656784,0.41708848,0.07414983,0.0064383326,0.3825783],"study_design_scores_gemma":[0.00015862456,0.001406256,0.0010521443,0.0001650742,0.00017137376,0.0028678596,0.00034381854,0.569649,0.26331258,0.09569442,0.06503728,0.00014153802],"about_ca_topic_score_codex":0.00025595006,"about_ca_topic_score_gemma":0.00044691947,"teacher_disagreement_score":0.005494887,"about_ca_system_score_codex":0.00025410892,"about_ca_system_score_gemma":0.00026132283,"threshold_uncertainty_score":0.018382251},"labels":[],"label_agreement":null},{"id":"W2223766154","doi":"10.24138/jcomss.v4i4.215","title":"A Quality of Service Driven Approach for Clustering in Mobile Ad hoc Networks Based on Metrics Adaptation: Looking Beyond Clustering","year":2008,"lang":"en","type":"article","venue":"Journal of Communications Software and Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Cluster analysis; Distributed computing; Quality of service; Scalability; Computer network; Mobile ad hoc network; Handover; Load balancing (electrical power); Wireless ad hoc network; Wireless; Artificial intelligence","score_opus":0.07730239140907635,"score_gpt":0.30245283507221427,"score_spread":0.2251504436631379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2223766154","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009193855,0.0014124286,0.98537666,0.0010632124,0.00021050312,0.000116805735,0.000025927573,0.00032920204,0.0022714247],"genre_scores_gemma":[0.6961801,0.0028171302,0.29597184,0.00052127155,0.00045777214,0.0003070255,0.00013076687,0.00015809188,0.00345606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985703,0.000472005,0.00006902331,0.00020136555,0.00060447445,0.00008272534],"domain_scores_gemma":[0.9987287,0.00031060868,0.00015906758,0.00015733557,0.00054991024,0.00009432678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016991193,0.00084967504,0.0006868934,0.0013047588,0.0007041019,0.0015422778,0.0022166132,0.0013013775,0.0007295882],"category_scores_gemma":[0.003882263,0.00028783374,0.0006642014,0.0015129938,0.0010239795,0.0022927434,0.0010987902,0.0015332528,0.0003304547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000858915,0.00016016603,0.002587514,0.00028113753,0.00013647343,0.00017672213,0.00039635238,0.6699287,0.010604235,0.1087317,0.0038248105,0.20308618],"study_design_scores_gemma":[0.000006788227,0.00012451329,0.00051174936,0.000017936556,0.000017186445,0.00009658101,0.00006438875,0.9753329,0.0010242125,0.018470554,0.004298366,0.000034866152],"about_ca_topic_score_codex":0.003100459,"about_ca_topic_score_gemma":0.0024763187,"teacher_disagreement_score":0.003100459,"about_ca_system_score_codex":0.0015106307,"about_ca_system_score_gemma":0.001019617,"threshold_uncertainty_score":0.01096046},"labels":[],"label_agreement":null},{"id":"W2228319189","doi":"","title":"Issues and solutions of applying identity-based cryptography to mobile ad-hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mobile ad hoc network; Cryptography; Computer security; Public key infrastructure; Key management; Public-key cryptography; Wireless ad hoc network; Key (lock); Context (archaeology); Encryption; Telecommunications; Wireless","score_opus":0.01782302760459963,"score_gpt":0.2704305052404551,"score_spread":0.25260747763585545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228319189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011816615,0.1519248,0.6687423,0.043626115,0.0068691545,0.000632757,0.000095733165,0.0003554065,0.115937114],"genre_scores_gemma":[0.37314937,0.2887162,0.27772778,0.006499748,0.012705824,0.00085171475,0.00032216863,0.00016476434,0.03986246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9929321,0.0028517458,0.00049664686,0.0007605675,0.0024771013,0.00048182544],"domain_scores_gemma":[0.9940501,0.0024604215,0.00034022823,0.00142784,0.0015834665,0.00013783744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066897008,0.0009976141,0.0007931639,0.0020000546,0.0022592796,0.006323595,0.0029713123,0.0038263204,0.0027776475],"category_scores_gemma":[0.011698875,0.0009525783,0.0012860721,0.002749499,0.003709661,0.012886182,0.0038129885,0.0069145076,0.002051217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030772608,0.000071374394,0.00062037446,0.0007349455,0.00003904033,0.00022418196,0.00041969307,0.0046473364,0.0014534612,0.8221195,0.0084811635,0.1611583],"study_design_scores_gemma":[0.000026870257,0.00012339377,0.00042718294,0.0011708905,0.000048802973,0.0014503235,0.00063241564,0.035706118,0.005592955,0.66293037,0.29179612,0.000094647534],"about_ca_topic_score_codex":0.0008619661,"about_ca_topic_score_gemma":0.00040031123,"teacher_disagreement_score":0.0066897008,"about_ca_system_score_codex":0.0025558795,"about_ca_system_score_gemma":0.002748669,"threshold_uncertainty_score":0.035378933},"labels":[],"label_agreement":null},{"id":"W2231385767","doi":"","title":"Physical Layer Measurements for an 802.11 Wireless Mesh Network Testbed","year":2011,"lang":"en","type":"article","venue":"International Conference on the Digital Society","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Mesh networking; Order One Network Protocol; Switched mesh; Shared mesh; Time division multiple access; Physical layer; Wireless network; Testbed; Service set; Wireless; Wi-Fi; Telecommunications","score_opus":0.1429397759831863,"score_gpt":0.2997964540346006,"score_spread":0.1568566780514143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2231385767","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80505264,0.00039093586,0.18425529,0.00027289198,0.00028255593,0.00036701356,0.0012918953,0.00298546,0.0051013893],"genre_scores_gemma":[0.9718616,0.00016005462,0.024804503,0.00007992042,0.000021231099,0.0002433293,0.0013695689,0.00008505343,0.0013747077],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99871624,0.00020493768,0.000109448934,0.00013865216,0.0006887461,0.00014209298],"domain_scores_gemma":[0.9984738,0.0003302178,0.00022276038,0.00025109405,0.0006159257,0.000106014646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011260187,0.00056628353,0.0004348404,0.00059249956,0.00052274,0.00044836433,0.0007245105,0.00046856364,0.0012028981],"category_scores_gemma":[0.0027172873,0.00015516928,0.00016578946,0.0005320335,0.00026013658,0.00058308337,0.0003674459,0.0006027495,0.00034975822],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014766816,0.00088720245,0.03619279,0.00042207248,0.00011638095,0.0007972788,0.00044837952,0.043987058,0.8335097,0.0027676693,0.0064282734,0.072966635],"study_design_scores_gemma":[0.00024722295,0.00690367,0.058503486,0.000060777325,0.00016193396,0.00153798,0.0003231591,0.22372013,0.6876946,0.0012983716,0.019431554,0.00011710846],"about_ca_topic_score_codex":0.0006785299,"about_ca_topic_score_gemma":0.00063010893,"teacher_disagreement_score":0.0012028981,"about_ca_system_score_codex":0.00061464007,"about_ca_system_score_gemma":0.0002336176,"threshold_uncertainty_score":0.0059550405},"labels":[],"label_agreement":null},{"id":"W2247616096","doi":"","title":"A New Message Recognition Protocol with Self-recoverability for A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks","year":2009,"lang":"en","type":"article","venue":"Applied Cryptography and Network Security","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Protocol (science); Computer science; Computer network; Wireless ad hoc network; Otway–Rees protocol; Universal composability; Neighbor Discovery Protocol; Cryptographic protocol; Distributed computing; Computer security; Internet protocol suite; Wireless; Authentication protocol; Cryptography; Challenge-Handshake Authentication Protocol","score_opus":0.010062885972430774,"score_gpt":0.23713070821255777,"score_spread":0.227067822240127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2247616096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015046406,0.000693501,0.9740908,0.0007636849,0.00085027557,0.0007316292,0.00007673629,0.0022944591,0.005452431],"genre_scores_gemma":[0.36512974,0.0008909936,0.60570616,0.0011059911,0.0007799825,0.0018789881,0.0004949939,0.0005349769,0.023478149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963463,0.00073581474,0.00042582783,0.00054260856,0.0014868969,0.00046251816],"domain_scores_gemma":[0.9962935,0.00068794115,0.00038980466,0.0013024089,0.0010279724,0.00029845405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026667921,0.0009798566,0.00159096,0.0014602086,0.0015901081,0.0020315622,0.0027748172,0.0019837173,0.0039215996],"category_scores_gemma":[0.004064978,0.0005151628,0.0010669709,0.0009767951,0.0018356451,0.005711296,0.0036100706,0.0041399226,0.0014584757],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016121359,0.0007367249,0.0006651431,0.0010307332,0.00024788358,0.0018348199,0.00079162046,0.021880873,0.19393201,0.47641134,0.019079741,0.28177693],"study_design_scores_gemma":[0.0007845848,0.0021878758,0.0011467658,0.0002093806,0.0006564761,0.0048719905,0.00029254938,0.5956846,0.14630598,0.114513606,0.13269642,0.0006496929],"about_ca_topic_score_codex":0.00074950216,"about_ca_topic_score_gemma":0.0007912431,"teacher_disagreement_score":0.0039215996,"about_ca_system_score_codex":0.0011877798,"about_ca_system_score_gemma":0.0017801498,"threshold_uncertainty_score":0.014103472},"labels":[],"label_agreement":null},{"id":"W2251202461","doi":"","title":"QoS routing through alternate paths in wireless ad hoc networks: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Quality of service; Adaptive quality of service multi-hop routing; Distributed computing; Wireless ad hoc network; Routing protocol; Overhead (engineering); Routing (electronic design automation); Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.0642016965399944,"score_gpt":0.3572156189492834,"score_spread":0.293013922409289,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2251202461","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025537783,0.56259066,0.3416385,0.010269302,0.0071332008,0.00021105839,0.000120715864,0.0006225475,0.051876206],"genre_scores_gemma":[0.16238958,0.61576337,0.1655884,0.0011931454,0.009412871,0.00019143605,0.0003971303,0.0002681522,0.044796035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938846,0.0001408005,0.000046903187,0.00007814444,0.000303885,0.000041687923],"domain_scores_gemma":[0.99818546,0.00091555226,0.00007767457,0.0000816224,0.0006236778,0.00011600439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013760875,0.0006451027,0.00060158444,0.0014123854,0.00062372204,0.0023821385,0.0007446379,0.0012778151,0.0033655935],"category_scores_gemma":[0.0023131103,0.00037196846,0.00024406498,0.0037118718,0.0009656823,0.002744188,0.00052904105,0.000919212,0.0010785408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013797972,0.00015733122,0.00092069816,0.0018952764,0.00005360057,0.00035815078,0.00039195476,0.016620137,0.006875856,0.10758269,0.028551012,0.8364554],"study_design_scores_gemma":[0.00007439793,0.00048014466,0.0013314388,0.0010600664,0.00014836645,0.0025911387,0.0006278104,0.10100108,0.0064518047,0.14901438,0.7371409,0.000078573205],"about_ca_topic_score_codex":0.00093088445,"about_ca_topic_score_gemma":0.00076649437,"teacher_disagreement_score":0.0033655935,"about_ca_system_score_codex":0.0007677166,"about_ca_system_score_gemma":0.0009095654,"threshold_uncertainty_score":0.011259079},"labels":[],"label_agreement":null},{"id":"W2254710028","doi":"","title":"A Backup Routing Scheme for Mobile Ad-Hoc Networks","year":2009,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless ad hoc network; Ad hoc On-Demand Distance Vector Routing; Distributed computing; Destination-Sequenced Distance Vector routing; Backbone network; Ad hoc wireless distribution service; Throughput; Wireless Routing Protocol; Routing protocol; Link-state routing protocol; Routing (electronic design automation); Wireless; Network packet; Telecommunications","score_opus":0.15697851797720222,"score_gpt":0.5095223670216067,"score_spread":0.3525438490444045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254710028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03425604,0.0038751245,0.9434384,0.0010763584,0.0015831245,0.0004330303,0.0004167737,0.0027693447,0.012151852],"genre_scores_gemma":[0.6049315,0.002399922,0.37630543,0.00058176124,0.000424087,0.00045184523,0.0008479673,0.00018520452,0.0138722425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960643,0.000107927466,0.000031583197,0.00006674262,0.00014195702,0.000045473425],"domain_scores_gemma":[0.9991997,0.00012899096,0.00007613095,0.0002763518,0.0002655025,0.00005337909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006586058,0.00054167537,0.000664145,0.00097589614,0.0013644671,0.00067713356,0.0012922481,0.00064859824,0.002369749],"category_scores_gemma":[0.0017427158,0.00017334452,0.00040991526,0.00071240455,0.00047038883,0.0013366294,0.00089336344,0.0006888391,0.00095964037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007168531,0.0001500678,0.0011629007,0.00086325535,0.00011268086,0.0006408737,0.00045241203,0.07252582,0.050919466,0.10516633,0.026923906,0.74036545],"study_design_scores_gemma":[0.00029130737,0.0013836452,0.0013962305,0.0002268146,0.00023234908,0.0034566482,0.0003452644,0.6544252,0.035715733,0.1112038,0.19114771,0.00017535301],"about_ca_topic_score_codex":0.00077152514,"about_ca_topic_score_gemma":0.0011211177,"teacher_disagreement_score":0.002369749,"about_ca_system_score_codex":0.0006286968,"about_ca_system_score_gemma":0.00066376093,"threshold_uncertainty_score":0.007927656},"labels":[],"label_agreement":null},{"id":"W2260826774","doi":"10.14288/1.0065045","title":"Performance evaluation of the border gateway protocol","year":2009,"lang":"en","type":"article","venue":"cIRcle (University of British Columbia)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Gateway (web page); Protocol (science); Computer science; Medicine; World Wide Web","score_opus":0.011020855834731148,"score_gpt":0.21613340785884969,"score_spread":0.20511255202411854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2260826774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91533995,0.004852905,0.033525106,0.00087450346,0.00036855455,0.00033286063,0.0009633181,0.0021320712,0.041610807],"genre_scores_gemma":[0.99040145,0.0006760332,0.0060749794,0.00004875788,0.00003858552,0.000043741144,0.0007924128,0.00008467797,0.0018393496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938617,0.0018272058,0.00029820864,0.00053958094,0.0028754482,0.0005979133],"domain_scores_gemma":[0.98942566,0.004748221,0.00063334673,0.0011942782,0.0036896786,0.00030880133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049331565,0.00060919195,0.00071171485,0.0014794716,0.0007178601,0.0019571297,0.0009139316,0.0006783747,0.0021168594],"category_scores_gemma":[0.013433689,0.0001857875,0.00029416208,0.0016236694,0.00048721553,0.0021863752,0.00075699243,0.0006318658,0.00057253323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071715075,0.0017510243,0.04741013,0.0010821143,0.00047628765,0.0008958261,0.0008184727,0.43664896,0.07312147,0.035865236,0.022987068,0.3717719],"study_design_scores_gemma":[0.00015572924,0.0033506153,0.0123719135,0.00006149735,0.0001660476,0.0005712523,0.00034218899,0.92850715,0.041770246,0.0029933795,0.009634305,0.00007561317],"about_ca_topic_score_codex":0.0039858483,"about_ca_topic_score_gemma":0.0018994288,"teacher_disagreement_score":0.0049331565,"about_ca_system_score_codex":0.0021403327,"about_ca_system_score_gemma":0.0012338996,"threshold_uncertainty_score":0.02608937},"labels":[],"label_agreement":null},{"id":"W2269058731","doi":"10.1007/978-3-642-29222-4_15","title":"Admission Control and QoS Provisioning in Multi-service MDA for IEEE 802.11s-Based Wireless Mesh Networks","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Handover; Wireless mesh network; Computer network; Quality of service; Call Admission Control; Computer science; Provisioning; Wireless; Wireless network; Telecommunications","score_opus":0.024839159626173595,"score_gpt":0.24961451328663292,"score_spread":0.22477535366045934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269058731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04202331,0.00994691,0.9241874,0.0010896719,0.0006682129,0.00008537005,0.00005641152,0.000616616,0.021326104],"genre_scores_gemma":[0.8922054,0.0040073097,0.08500988,0.00016171442,0.00087988575,0.00012634271,0.0000981145,0.00010475737,0.017406665],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924976,0.00018558081,0.000047386486,0.00008978742,0.00032518336,0.00010226505],"domain_scores_gemma":[0.9994778,0.00028115348,0.000043311466,0.00007211253,0.00009259812,0.000032974865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095549977,0.00048361256,0.00047360797,0.00047150344,0.000590164,0.0018170314,0.0013317087,0.0007334656,0.0020646919],"category_scores_gemma":[0.002329579,0.00033795252,0.00034025934,0.0007408137,0.0009908406,0.0020340097,0.0011068217,0.0015807578,0.000392147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004509665,0.00017850194,0.0008148845,0.00021246547,0.000046898997,0.00026295174,0.00048544398,0.2370956,0.023856737,0.27054733,0.006686282,0.45936185],"study_design_scores_gemma":[0.000014480421,0.00006636589,0.0003969384,0.000037505095,0.000018611096,0.00013417161,0.00006545747,0.9128628,0.0047725234,0.07373502,0.007868569,0.000027547889],"about_ca_topic_score_codex":0.0021502217,"about_ca_topic_score_gemma":0.0019646185,"teacher_disagreement_score":0.0021502217,"about_ca_system_score_codex":0.0011898272,"about_ca_system_score_gemma":0.000783419,"threshold_uncertainty_score":0.008632839},"labels":[],"label_agreement":null},{"id":"W2269469264","doi":"10.1109/wcnc.2015.7127576","title":"An efficient method to minimize TDMA frame length in wireless sensor networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University","keywords":"Time division multiple access; Computer science; Wireless sensor network; Scalability; Power control; Heuristic; Computer network; Frame (networking); Node (physics); Wireless; Transmission (telecommunications); Real-time computing; Distributed computing; Power (physics); Engineering; Telecommunications","score_opus":0.023791942809180906,"score_gpt":0.29545021529522825,"score_spread":0.27165827248604735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269469264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006574294,0.00024114046,0.9917966,0.00006711265,0.000038060272,0.000049672813,0.000037381757,0.00025106035,0.0009446835],"genre_scores_gemma":[0.18227153,0.00037448108,0.8145189,0.00008848063,0.00007358451,0.00030876207,0.00017573465,0.00016004607,0.0020284667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963653,0.00011344477,0.000013691055,0.00005594722,0.00014500151,0.000035299137],"domain_scores_gemma":[0.99945253,0.0002985473,0.000064309366,0.000056682336,0.000105680956,0.000022247646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063706463,0.0009702755,0.0006448406,0.0007486391,0.00042868833,0.0005599113,0.00090271025,0.0005316688,0.001773037],"category_scores_gemma":[0.0021541724,0.00042931794,0.00037564302,0.0008644303,0.000493063,0.0006929431,0.00060690235,0.00062238827,0.00041756986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007323329,0.000067190274,0.00031709502,0.000110388486,0.000031871474,0.000034391873,0.00005401301,0.8333928,0.008773706,0.011578603,0.0024178424,0.14314882],"study_design_scores_gemma":[0.000017571141,0.00005085009,0.0000671154,0.0000063924404,0.000007853311,0.000016619135,0.000007714528,0.9936407,0.0019442713,0.0031526587,0.0010828323,0.0000054179295],"about_ca_topic_score_codex":0.0028257633,"about_ca_topic_score_gemma":0.0038480617,"teacher_disagreement_score":0.0028257633,"about_ca_system_score_codex":0.0007807907,"about_ca_system_score_gemma":0.0012426677,"threshold_uncertainty_score":0.0059313774},"labels":[],"label_agreement":null},{"id":"W2280720320","doi":"10.1109/vtcfall.2015.7390909","title":"Effects of Correlated Shadowing Modeling on Performance Evaluation of Wireless Sensor Networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Wireless sensor network; Computer science; Shadow mapping; Wireless; Computer network; Telecommunications; Artificial intelligence","score_opus":0.03222948956542889,"score_gpt":0.2564345101427749,"score_spread":0.224205020577346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2280720320","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7760957,0.0006622451,0.21771967,0.00023719436,0.000054031338,0.00012386368,0.00020940475,0.0006686136,0.0042293947],"genre_scores_gemma":[0.98761123,0.00017841026,0.011904948,0.000024679188,0.0000069201587,0.00002488276,0.000052555424,0.000032216103,0.00016415515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729,0.0017028595,0.00011484637,0.00014894959,0.00059185596,0.00015158854],"domain_scores_gemma":[0.98565775,0.011249464,0.0008828319,0.0011921198,0.0008830786,0.00013475656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023603197,0.0009596628,0.00060776767,0.0004975086,0.00041694677,0.0005800856,0.0008143868,0.0006055621,0.00052298326],"category_scores_gemma":[0.012411809,0.00041955008,0.00067042786,0.00079176953,0.0006361321,0.0011103209,0.00055391603,0.00049813115,0.00009783857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000704215,0.000030151767,0.0014822747,0.000027677048,0.000020275784,0.000044670516,0.00002685421,0.99262345,0.001593062,0.0005953394,0.00007857959,0.0034072],"study_design_scores_gemma":[0.000008690046,0.000082519735,0.0005668395,0.00000660128,0.000013830523,0.000029029625,0.000012770021,0.99627763,0.0026201697,0.00030239183,0.00007154379,0.000007964099],"about_ca_topic_score_codex":0.006019218,"about_ca_topic_score_gemma":0.004663599,"teacher_disagreement_score":0.006019218,"about_ca_system_score_codex":0.0009333333,"about_ca_system_score_gemma":0.0008347621,"threshold_uncertainty_score":0.012482703},"labels":[],"label_agreement":null},{"id":"W2282674517","doi":"10.71781/9677","title":"Novel multicast protocols in ad-hoc networks","year":2008,"lang":"en","type":"dissertation","venue":"Open MIND","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multicast; Computer science; Computer network; Wireless ad hoc network; Geocast; Vehicular ad hoc network; Telecommunications; Wireless","score_opus":0.048215969837363634,"score_gpt":0.3418997349733493,"score_spread":0.29368376513598565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2282674517","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055620763,0.035197455,0.85918427,0.0053016613,0.004030515,0.0003886137,0.00016076014,0.0008262035,0.03928973],"genre_scores_gemma":[0.59199,0.021340476,0.34442046,0.0008336315,0.0041247527,0.00069200364,0.0004122735,0.00015048179,0.036035854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991279,0.0002807435,0.00007281568,0.000101372316,0.00033445132,0.00008280832],"domain_scores_gemma":[0.99883085,0.00057593524,0.0000765898,0.00014506603,0.0002810227,0.00009058465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015120129,0.0005031996,0.0005750659,0.0007157773,0.00089746085,0.0020403874,0.0014782485,0.0011522252,0.0017180125],"category_scores_gemma":[0.0030051686,0.0003908672,0.00034174486,0.00065934873,0.0007502192,0.0037231604,0.0012238602,0.0017623452,0.00047425533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040940798,0.00024912116,0.00090743246,0.0006602105,0.00014125167,0.0007992766,0.0006819696,0.035395604,0.03545589,0.60980767,0.024631236,0.29086095],"study_design_scores_gemma":[0.00024183562,0.00063785084,0.0008832454,0.0003148209,0.00020681313,0.0024636271,0.00045522908,0.48095956,0.024183001,0.29053354,0.1990066,0.00011383751],"about_ca_topic_score_codex":0.00041981996,"about_ca_topic_score_gemma":0.00059276336,"teacher_disagreement_score":0.0020403874,"about_ca_system_score_codex":0.0009668607,"about_ca_system_score_gemma":0.0005160472,"threshold_uncertainty_score":0.007996321},"labels":[],"label_agreement":null},{"id":"W2286955625","doi":"10.1007/978-3-642-20573-6_38","title":"Hybrid Routing for Ad Hoc Wireless Networks","year":2011,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer network; Computer science; Hybrid routing; Zone Routing Protocol; Wireless Routing Protocol; Routing protocol; Enhanced Interior Gateway Routing Protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Distributed computing; Link-state routing protocol; Wireless ad hoc network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.03854846068641695,"score_gpt":0.26812668030881087,"score_spread":0.22957821962239391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2286955625","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038333961,0.083479755,0.7864704,0.0008150831,0.003460801,0.00012995522,0.0002708383,0.0021999993,0.11933977],"genre_scores_gemma":[0.091094464,0.07735932,0.5159447,0.0007887985,0.0023754796,0.00037835995,0.0012875486,0.00077710935,0.30999416],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99979883,0.000034841916,0.0000098186765,0.000035644807,0.00010721702,0.000013684113],"domain_scores_gemma":[0.9998442,0.00006878732,0.0000068860854,0.0000313126,0.00004073555,0.000008063243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022037426,0.0008489577,0.0005898325,0.0005335258,0.0002794642,0.0010680162,0.0012836129,0.0007881367,0.011575988],"category_scores_gemma":[0.0004185742,0.00034906305,0.0003120959,0.0010706089,0.00035407735,0.0016894515,0.00060902745,0.0009593364,0.0044110785],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052352723,0.0000562873,0.00008453319,0.0009941744,0.000058634454,0.00011465844,0.00010650998,0.026569199,0.0102661615,0.14914933,0.06583769,0.7467105],"study_design_scores_gemma":[0.000030922885,0.00013815866,0.00023606957,0.0002607181,0.000058843394,0.0006514131,0.00006282812,0.0934856,0.0037698115,0.19095218,0.71031106,0.00004235639],"about_ca_topic_score_codex":0.00033681645,"about_ca_topic_score_gemma":0.000550736,"teacher_disagreement_score":0.011575988,"about_ca_system_score_codex":0.00036659307,"about_ca_system_score_gemma":0.00024843134,"threshold_uncertainty_score":0.038725555},"labels":[],"label_agreement":null},{"id":"W2288747342","doi":"10.1109/glocom.2015.7417764","title":"Globally Aware Network Flow Allocation Optimization Based on Multipath Routing","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multipath routing; Computer science; Computer network; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Equal-cost multi-path routing; Static routing; Multipath propagation; Routing (electronic design automation); Distributed computing; Link-state routing protocol; Mathematical optimization; Routing protocol; Channel (broadcasting); Mathematics","score_opus":0.06270134270456333,"score_gpt":0.3044923533574463,"score_spread":0.24179101065288294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288747342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021413384,0.0003234538,0.9759989,0.000071257426,0.000038667724,0.000040398445,0.000037180074,0.00034462064,0.0017321039],"genre_scores_gemma":[0.64827734,0.00045167728,0.3481517,0.000052581265,0.000055639353,0.00017122754,0.00012275828,0.00016133825,0.00255567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999607,0.00013015242,0.0000135033815,0.00007744544,0.00009408051,0.00007785021],"domain_scores_gemma":[0.9996226,0.00020971727,0.00005220579,0.000028448563,0.00006318931,0.000023881159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079039147,0.0012390357,0.0011273066,0.00078540243,0.00051779265,0.00071756775,0.0006319682,0.00048717606,0.0013872967],"category_scores_gemma":[0.0013540701,0.0003291524,0.0005701765,0.0008072936,0.00043683383,0.0009537098,0.00081126625,0.0006365269,0.00013169844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032506636,0.000013792256,0.00019750495,0.000021926377,0.000019014064,0.000016080307,0.000013833276,0.96714205,0.0016929371,0.0033258,0.00040970778,0.0271149],"study_design_scores_gemma":[0.0000056142376,0.000032629796,0.0000623966,0.0000025106795,0.000008589542,0.0000128865,0.000005536218,0.9962263,0.000661623,0.0024969534,0.00047975508,0.0000052424252],"about_ca_topic_score_codex":0.002637242,"about_ca_topic_score_gemma":0.0026775238,"teacher_disagreement_score":0.002637242,"about_ca_system_score_codex":0.0009410613,"about_ca_system_score_gemma":0.0010672798,"threshold_uncertainty_score":0.0068279505},"labels":[],"label_agreement":null},{"id":"W2291124555","doi":"10.5555/2888619.2888912","title":"Evaluating the effectiveness of situational awareness dissemination in tactical mobile ad hoc networks","year":2015,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mobile ad hoc network; Situation awareness; Relay; Wireless ad hoc network; Vehicular ad hoc network; Computer network; Distributed computing; Mobility model; Mobile computing; Overhead (engineering); Mobile radio; Wireless; Engineering; Telecommunications","score_opus":0.07414688811036792,"score_gpt":0.39340361855500944,"score_spread":0.31925673044464153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291124555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9701375,0.0008464799,0.0256066,0.00017181496,0.000034142042,0.00017812866,0.00004395638,0.0001319009,0.0028495246],"genre_scores_gemma":[0.9901928,0.00019632457,0.009379046,0.000013640653,0.0000086700475,0.000030465118,0.000026050744,0.000008302356,0.00014487322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660504,0.002120181,0.00019144002,0.00019054352,0.00066283275,0.00022997728],"domain_scores_gemma":[0.9592124,0.03499041,0.0022235103,0.0014932927,0.0016100476,0.00047043842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058380403,0.0009400509,0.0006505775,0.0013608919,0.00045646733,0.00093517324,0.00072711334,0.0009902607,0.00038373854],"category_scores_gemma":[0.03137521,0.0002841517,0.00024231091,0.00084065064,0.0008955653,0.0018930879,0.0009035802,0.00048428882,0.00005744092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010831766,0.0005682621,0.0079357745,0.00029148982,0.00017180342,0.000067759094,0.00015882599,0.92025214,0.013216989,0.0021867086,0.00022022623,0.053846803],"study_design_scores_gemma":[0.000088191366,0.0027700157,0.0037774364,0.000026146428,0.00008583686,0.000072609364,0.00014679726,0.9769505,0.0150494315,0.0006818245,0.00032055887,0.000030529638],"about_ca_topic_score_codex":0.0023596808,"about_ca_topic_score_gemma":0.002076877,"teacher_disagreement_score":0.0058380403,"about_ca_system_score_codex":0.0010718078,"about_ca_system_score_gemma":0.00060105947,"threshold_uncertainty_score":0.030874848},"labels":[],"label_agreement":null},{"id":"W2291750360","doi":"","title":"Optimal gathering algorithms in multi-hop radio tree networks with interferences.","year":2008,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Hop (telecommunications); Communication source; Unit disk graph; Broadcasting (networking); Node (physics); Tree (set theory); Computer network; Graph; Algorithm; Interference (communication); Message passing; Theoretical computer science; Mathematics; Distributed computing; Wireless network; Telecommunications; Combinatorics; Wireless","score_opus":0.019718600678934207,"score_gpt":0.22819412300820174,"score_spread":0.20847552232926753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2291750360","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02822197,0.0015074182,0.96240866,0.0005584476,0.00009241121,0.00018200482,0.00012634223,0.00039076846,0.006511979],"genre_scores_gemma":[0.5050047,0.0018751337,0.4855427,0.00028254144,0.00023176018,0.0004342575,0.00038952287,0.0001842383,0.0060551134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865985,0.00057830324,0.0000678624,0.00018089323,0.000306537,0.0002065822],"domain_scores_gemma":[0.9943851,0.0044823387,0.00034723897,0.00025550672,0.00033050298,0.00019932633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025014991,0.0009611126,0.0014902416,0.0012975686,0.00090752676,0.0012524733,0.0019504506,0.0014654937,0.0025665285],"category_scores_gemma":[0.010752395,0.0007787028,0.00058845896,0.0016168137,0.0010158863,0.00273511,0.0019251067,0.0012934833,0.000593416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003702961,0.00017126392,0.000587466,0.0003018261,0.000088936176,0.00007903557,0.00029281995,0.83219725,0.0026373058,0.04193591,0.0058403616,0.11549759],"study_design_scores_gemma":[0.00007136699,0.000103121594,0.0001597695,0.000026271275,0.000025773466,0.000061351566,0.00006644437,0.9556118,0.00069955154,0.041924905,0.0012384809,0.000011256179],"about_ca_topic_score_codex":0.0014653835,"about_ca_topic_score_gemma":0.002266772,"teacher_disagreement_score":0.0025665285,"about_ca_system_score_codex":0.001311398,"about_ca_system_score_gemma":0.0014015617,"threshold_uncertainty_score":0.01322937},"labels":[],"label_agreement":null},{"id":"W2292172383","doi":"10.1109/glocom.2015.7417422","title":"A Comprehensive Reputation System to Improve the Security of Opportunistic Routing Protocols in Wireless Networks","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Computer science; Computer network; Reliability (semiconductor); Routing protocol; Trust management (information system); Network packet; Routing (electronic design automation); Computer security; Wireless; Reputation system; Wireless network; Telecommunications","score_opus":0.083615609809657,"score_gpt":0.345561148906993,"score_spread":0.26194553909733603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292172383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046090417,0.001751659,0.9425615,0.00052240945,0.0003516404,0.00017516139,0.00006739164,0.0012026067,0.007277145],"genre_scores_gemma":[0.9003819,0.00064118614,0.09457558,0.00011502712,0.00020053527,0.00007607904,0.00009326059,0.00004516579,0.003871312],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998781,0.00036708504,0.000112627786,0.000214838,0.00040892957,0.00011545987],"domain_scores_gemma":[0.99747306,0.00071023224,0.000362504,0.00043667696,0.00082244916,0.00019497004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020251346,0.0004519685,0.0007635956,0.0007603217,0.0008366438,0.0013446938,0.0011573463,0.00072440354,0.0010107774],"category_scores_gemma":[0.005777082,0.00022643588,0.00046396506,0.0006250157,0.0005205753,0.002757945,0.0012001513,0.0008967214,0.00041236627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005225028,0.00042080783,0.0049817786,0.00052420824,0.00033863878,0.001088396,0.0005963801,0.2661103,0.05832421,0.13734494,0.014531629,0.51521623],"study_design_scores_gemma":[0.00006200592,0.00063399127,0.0018780385,0.000043304248,0.00021558949,0.0007994351,0.00007873623,0.957845,0.0075417324,0.019170228,0.011604079,0.00012788516],"about_ca_topic_score_codex":0.0014945512,"about_ca_topic_score_gemma":0.0019428652,"teacher_disagreement_score":0.0020251346,"about_ca_system_score_codex":0.00068131916,"about_ca_system_score_gemma":0.0011797632,"threshold_uncertainty_score":0.010710001},"labels":[],"label_agreement":null},{"id":"W2293866909","doi":"10.82308/33610","title":"Security protocols for mobile ad hoc networks","year":2006,"lang":"en","type":"book","venue":"eScholarship@McGill (McGill)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Revocation list; Mobile ad hoc network; Computer science; Computer security; Computer network; Wireless ad hoc network; Revocation; Certificate; Certificate authority; Vehicular ad hoc network; Network packet; Wireless; Public-key cryptography; Telecommunications; Overhead (engineering); Encryption","score_opus":0.01511313107739135,"score_gpt":0.24574052071541655,"score_spread":0.2306273896380252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293866909","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022814984,0.041757736,0.8555111,0.005539684,0.006621919,0.0020219723,0.0010868458,0.0038890701,0.081290126],"genre_scores_gemma":[0.090206444,0.071699,0.73902667,0.0065890173,0.007833746,0.008576799,0.004579976,0.000900331,0.07058803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99269074,0.001998121,0.0009990389,0.00067071186,0.0032444892,0.0003969153],"domain_scores_gemma":[0.9940357,0.002827166,0.00044452393,0.0011347929,0.0013408759,0.00021692255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040150634,0.00283359,0.0019712988,0.0029436776,0.0026563217,0.0053827674,0.003474336,0.004832486,0.013037783],"category_scores_gemma":[0.010612523,0.0012216851,0.0015399328,0.0045529096,0.0042851022,0.008138354,0.0046160594,0.009024999,0.011230907],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007124794,0.000098859215,0.00022255567,0.0013444801,0.00006428292,0.0006498313,0.000806195,0.007676062,0.0028851507,0.76158845,0.05472606,0.16986679],"study_design_scores_gemma":[0.00009283918,0.00012161644,0.00017034101,0.00091223855,0.000047927533,0.0012077293,0.00020474517,0.018857127,0.0015875144,0.32518852,0.6515268,0.00008261611],"about_ca_topic_score_codex":0.0011865948,"about_ca_topic_score_gemma":0.00079177745,"teacher_disagreement_score":0.013037783,"about_ca_system_score_codex":0.0021012663,"about_ca_system_score_gemma":0.0034686,"threshold_uncertainty_score":0.0436157},"labels":[],"label_agreement":null},{"id":"W2299848644","doi":"10.1016/j.comgeo.2016.03.002","title":"Connectivity with directional antennas in the symmetric communication model","year":2016,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Carleton University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Computer science; Directional antenna; Telecommunications; Antenna (radio)","score_opus":0.01741006633043694,"score_gpt":0.2419086116873564,"score_spread":0.22449854535691946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2299848644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13800262,0.0008591356,0.8101344,0.0025760357,0.00018645378,0.000075179545,0.0005611746,0.00022933047,0.047375623],"genre_scores_gemma":[0.9609858,0.0015022627,0.022780096,0.0003399233,0.00032516295,0.000114741684,0.00033329104,0.000060157705,0.013558689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861753,0.000669752,0.000043271502,0.00018299947,0.00028245503,0.00020402843],"domain_scores_gemma":[0.9971245,0.0016296635,0.00044540584,0.00037524317,0.0002656643,0.00015955883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009390572,0.0005725555,0.0010171172,0.00093138084,0.00074386696,0.0017936776,0.0016195432,0.001581661,0.0047755665],"category_scores_gemma":[0.005045907,0.0004564323,0.0006089389,0.0015130097,0.0014444139,0.0033355483,0.001553358,0.0011851783,0.00092343264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013282537,0.00005054186,0.00068511505,0.00007029722,0.00003151616,0.00031199114,0.00012659535,0.23983924,0.001048484,0.74090165,0.0048616854,0.01194007],"study_design_scores_gemma":[0.00004327089,0.00004553441,0.00023865733,0.000010771305,0.000022132352,0.00025702946,0.00006638911,0.6218294,0.0002431692,0.3750499,0.002177001,0.000016706774],"about_ca_topic_score_codex":0.0015181921,"about_ca_topic_score_gemma":0.0012421736,"teacher_disagreement_score":0.0047755665,"about_ca_system_score_codex":0.00082381815,"about_ca_system_score_gemma":0.0006351574,"threshold_uncertainty_score":0.015975833},"labels":[],"label_agreement":null},{"id":"W2312451142","doi":"10.1371/journal.pone.0119679","title":"Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution","year":2015,"lang":"en","type":"article","venue":"PLoS ONE","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Wireless mesh network; Mesh networking; Routing protocol; Hazy Sighted Link State Routing Protocol; Order One Network Protocol; Link-state routing protocol; IEEE 802.11s; Distributed computing; Dynamic Source Routing; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.03455372288388801,"score_gpt":0.2155073728032442,"score_spread":0.1809536499193562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312451142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03996315,0.002972512,0.9489017,0.0008347718,0.00017024043,0.00008279727,0.000035305544,0.0003193588,0.006720187],"genre_scores_gemma":[0.605244,0.004905927,0.3815213,0.0003202448,0.0003034589,0.00018101429,0.00015141151,0.00010624144,0.007266453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996364,0.00011537805,0.000018433131,0.000061403174,0.00013030853,0.000037998907],"domain_scores_gemma":[0.99968636,0.00010159762,0.0000702647,0.00006698914,0.00005888004,0.000015905885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004131339,0.00054594595,0.00029626992,0.00054676016,0.0004789522,0.00065406295,0.0010648743,0.00073055626,0.0011342333],"category_scores_gemma":[0.0009655613,0.00019275793,0.00024819886,0.0005333201,0.0003660423,0.0016518845,0.0009721011,0.000531328,0.00048934214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014739276,0.00024830896,0.0019851215,0.00084314455,0.00010451851,0.0003154484,0.0002275773,0.091101356,0.1400701,0.104283944,0.0036595971,0.65701354],"study_design_scores_gemma":[0.00010199461,0.001220125,0.0019962778,0.00025426957,0.00022033337,0.0016296137,0.0005674352,0.6602266,0.10043625,0.10988789,0.12335788,0.00010128895],"about_ca_topic_score_codex":0.0002532498,"about_ca_topic_score_gemma":0.0004263714,"teacher_disagreement_score":0.0011342333,"about_ca_system_score_codex":0.00030337286,"about_ca_system_score_gemma":0.00033896635,"threshold_uncertainty_score":0.0037944317},"labels":[],"label_agreement":null},{"id":"W2313405325","doi":"10.1109/ccnc.2016.7444801","title":"A comparative study of channel switching latency for conventional and SDN-based routing in multi-hop multi-radio Wireless Mesh Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Wireless mesh network; Computer network; Computer science; Testbed; Latency (audio); Wireless; Channel (broadcasting); Wireless ad hoc network; Routing protocol; Wireless network; Mesh networking; Distributed computing; Routing (electronic design automation); Telecommunications","score_opus":0.04770557821776154,"score_gpt":0.29574711349718696,"score_spread":0.2480415352794254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2313405325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9584713,0.0029204187,0.033166375,0.00014098371,0.00011255797,0.00005193495,0.00027646104,0.0003805268,0.0044793678],"genre_scores_gemma":[0.9961463,0.00032857133,0.0030638094,0.000010660128,0.000015834965,0.000012757772,0.00015982409,0.000018245497,0.00024402686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.0002490657,0.00009178777,0.00019773062,0.000586844,0.00026438347],"domain_scores_gemma":[0.9921278,0.005117974,0.0006818568,0.00052821706,0.0013030324,0.00024125409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018068755,0.0004618096,0.00040056658,0.0014620472,0.00037053812,0.0007306552,0.00063124346,0.00034595584,0.0007799114],"category_scores_gemma":[0.0054722116,0.000121118326,0.00025980716,0.0011835734,0.00034621631,0.0014332953,0.00034526637,0.00032699085,0.00011560022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032650689,0.001152386,0.06945805,0.0010422892,0.00031618332,0.0009176458,0.00067201833,0.56177044,0.10903283,0.014869244,0.002204201,0.23529963],"study_design_scores_gemma":[0.00003979601,0.0018102013,0.025337992,0.000043067637,0.00013495763,0.0007057242,0.00051885546,0.9291671,0.03808232,0.0022661346,0.0018304705,0.000063360654],"about_ca_topic_score_codex":0.0013929417,"about_ca_topic_score_gemma":0.0015016455,"teacher_disagreement_score":0.0018068755,"about_ca_system_score_codex":0.0010620346,"about_ca_system_score_gemma":0.0005714794,"threshold_uncertainty_score":0.009555757},"labels":[],"label_agreement":null},{"id":"W2315559391","doi":"10.1109/cce.2014.6916760","title":"A discounted stochastic game approach to intrusion detection in wireless ad hoc networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless ad hoc network; Intrusion detection system; Game theory; Wireless network; Wireless; Mobile ad hoc network; Computer network; Distributed computing; Network packet; Computer security; Mathematical economics; Mathematics; Telecommunications","score_opus":0.007664887230507462,"score_gpt":0.21351424925853754,"score_spread":0.2058493620280301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315559391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012864461,0.00048929255,0.98147935,0.00022961687,0.00008585517,0.00006612897,0.000053461066,0.00005306476,0.004678742],"genre_scores_gemma":[0.8887242,0.0014087294,0.10195425,0.00017062793,0.0001524075,0.00031001537,0.000097355296,0.000037956117,0.007144426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980411,0.0009985898,0.00008176188,0.00022438924,0.00043690816,0.00021735363],"domain_scores_gemma":[0.997743,0.0016532999,0.00017906421,0.00005519631,0.00022880614,0.00014065384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022190064,0.0016551197,0.0016038609,0.001084263,0.0006031731,0.0018713999,0.0028191763,0.0012718103,0.0016536973],"category_scores_gemma":[0.004978078,0.00061355345,0.0010778414,0.0009723053,0.0021428252,0.0019196594,0.0014730049,0.0017967083,0.00017121267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029106766,0.000039202452,0.0002733169,0.00006898826,0.000046801477,0.00012645248,0.000061432904,0.8170837,0.0007097344,0.17584231,0.00035599153,0.0053629205],"study_design_scores_gemma":[0.000007679561,0.000028718667,0.000048276135,0.000006095919,0.000011554538,0.000024378005,0.000012994771,0.9638279,0.000100369616,0.035520226,0.00040254122,0.000009170182],"about_ca_topic_score_codex":0.008092402,"about_ca_topic_score_gemma":0.007019293,"teacher_disagreement_score":0.008092402,"about_ca_system_score_codex":0.0030523168,"about_ca_system_score_gemma":0.002284951,"threshold_uncertainty_score":0.022146285},"labels":[],"label_agreement":null},{"id":"W2319951646","doi":"10.1061/40937(261)101","title":"Ad-Hoc Wireless Networking for Supporting Communication and Onsite Data Collection","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Mobile ad hoc network; Ad hoc wireless distribution service; Vehicular ad hoc network; Node (physics); Optimized Link State Routing Protocol; Wireless; Wireless network; Cluster analysis; Distributed computing; Telecommunications; Network packet; Engineering","score_opus":0.04102341132368327,"score_gpt":0.3090094611913174,"score_spread":0.26798604986763414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319951646","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016908986,0.07820635,0.80578166,0.0034224521,0.0032872532,0.0005601688,0.00032293377,0.0019015238,0.089608595],"genre_scores_gemma":[0.24258679,0.0791217,0.61111456,0.0014362986,0.0028039452,0.0007402497,0.0010897415,0.00030656508,0.060800094],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99936897,0.0001601576,0.000030890635,0.00005439778,0.00035484837,0.000030737414],"domain_scores_gemma":[0.99906,0.0005143916,0.000086593034,0.00013273564,0.00015812405,0.000048132202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076846645,0.0005753515,0.0004804323,0.00057041954,0.00061680254,0.0011612561,0.0010602545,0.00092865154,0.003943861],"category_scores_gemma":[0.0014144476,0.00021526692,0.00025954694,0.001393761,0.0006559554,0.0019554994,0.00065343495,0.0008405809,0.002051215],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076931996,0.00014398718,0.0015561655,0.0017757431,0.000070781076,0.00045118592,0.0002923771,0.009554239,0.026440894,0.1979542,0.040056832,0.7216267],"study_design_scores_gemma":[0.000039224018,0.0003931101,0.0012250541,0.00041305064,0.000107196145,0.0016707515,0.00020968662,0.03516861,0.012538018,0.062355615,0.8858224,0.000057195655],"about_ca_topic_score_codex":0.00031742707,"about_ca_topic_score_gemma":0.0006126629,"teacher_disagreement_score":0.003943861,"about_ca_system_score_codex":0.00036949856,"about_ca_system_score_gemma":0.000575246,"threshold_uncertainty_score":0.013193548},"labels":[],"label_agreement":null},{"id":"W2325402680","doi":"10.5121/ijnsa.2014.6501","title":"A Secure Electronic Payment Protocol for Wireless Mesh Networks","year":2014,"lang":"en","type":"article","venue":"International Journal of Network Security & Its Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Protocol (science); Wireless mesh network; Order One Network Protocol; Payment; Wireless Transport Layer Security; Wireless; Computer security; Wireless network; Telecommunications; Wi-Fi array; Medicine; World Wide Web","score_opus":0.009815842880295859,"score_gpt":0.29131775567001356,"score_spread":0.2815019127897177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325402680","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015065485,0.00085417775,0.9742555,0.0007824021,0.0008722589,0.00077315303,0.00016471861,0.00082317996,0.0064092022],"genre_scores_gemma":[0.54216194,0.0023966723,0.42743042,0.0007188892,0.00060016307,0.0016145747,0.0007695521,0.00016707358,0.024140775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989512,0.000245043,0.00018058158,0.00008853583,0.00043446737,0.0001002375],"domain_scores_gemma":[0.9992824,0.00019661774,0.00010576651,0.00018710596,0.00017703234,0.000051124178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012187974,0.00037303488,0.0004437721,0.00064730353,0.0010264296,0.0011158946,0.000962782,0.00095974194,0.0030740602],"category_scores_gemma":[0.0022440676,0.00022652918,0.000490918,0.00079886924,0.00069355586,0.0022213631,0.0024595475,0.0012400912,0.00086655753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005943037,0.00023362988,0.0009767875,0.0007305301,0.0001379265,0.0013209068,0.00049273414,0.032373283,0.07015181,0.44650903,0.022689072,0.4237899],"study_design_scores_gemma":[0.00042360986,0.0013408428,0.0015815315,0.0001886034,0.00024524235,0.0036667248,0.00028265052,0.47112453,0.06235352,0.17786917,0.28062642,0.00029714734],"about_ca_topic_score_codex":0.0003328771,"about_ca_topic_score_gemma":0.00043286599,"teacher_disagreement_score":0.0030740602,"about_ca_system_score_codex":0.000519286,"about_ca_system_score_gemma":0.0009074373,"threshold_uncertainty_score":0.010283709},"labels":[],"label_agreement":null},{"id":"W2328058829","doi":"10.1109/jcn.2016.000013","title":"Impact of trust-based security association and mobility on the delay metric in MANET","year":2016,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation, Science and Economic Development Canada","funders":"","keywords":"Computer science; Metric (unit); Mobile ad hoc network; Computer network; Computer security; Association (psychology); Telecommunications; Business; Network packet","score_opus":0.01539669572079831,"score_gpt":0.27570271071491353,"score_spread":0.2603060149941152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328058829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81757563,0.0041632615,0.17060272,0.0013270554,0.00019042694,0.00007207403,0.00023210644,0.00018800156,0.005648746],"genre_scores_gemma":[0.9973066,0.0003342854,0.0020882052,0.000015289288,0.000011089237,0.0000074915483,0.000019108167,0.000009487045,0.0002084906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871886,0.00055644667,0.00006347068,0.00015052111,0.00026066942,0.0002501555],"domain_scores_gemma":[0.9836728,0.012910074,0.0016022901,0.0005508791,0.0008175938,0.00044642814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022036938,0.0007833253,0.00065128406,0.0011481007,0.0006039902,0.001149697,0.0007192543,0.00091684726,0.00054482307],"category_scores_gemma":[0.016343439,0.0003071416,0.00035205545,0.0009784759,0.0013739399,0.0023229725,0.0010451339,0.0007929221,0.00007014395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025731054,0.000043119253,0.0050252513,0.00008062431,0.000059816535,0.00031794098,0.00009487526,0.9693936,0.0048372676,0.012737437,0.00029608578,0.0068567665],"study_design_scores_gemma":[0.000012637194,0.00021799983,0.0018484271,0.000020514617,0.000055358258,0.00028406325,0.0001281671,0.9892707,0.0027909966,0.004954357,0.00038214703,0.000034665183],"about_ca_topic_score_codex":0.004190205,"about_ca_topic_score_gemma":0.0022260374,"teacher_disagreement_score":0.004190205,"about_ca_system_score_codex":0.0022008324,"about_ca_system_score_gemma":0.00087253796,"threshold_uncertainty_score":0.015968204},"labels":[],"label_agreement":null},{"id":"W2328859875","doi":"10.5121/ijngn.2010.2310","title":"Management of Rescue and Relief Operations Using Wireless Mobile Ad Hoc Technology","year":2010,"lang":"en","type":"article","venue":"International Journal of Next-Generation Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Adaptive quality of service multi-hop routing; Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Ad hoc wireless distribution service; Throughput; Routing (electronic design automation); Wireless Routing Protocol; Quality of service; Optimized Link State Routing Protocol; Wireless; Distributed computing; Routing protocol; Telecommunications","score_opus":0.022472851733972093,"score_gpt":0.2767735093346642,"score_spread":0.2543006576006921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328859875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18428588,0.014543235,0.7662825,0.0034147731,0.00082212756,0.0004674174,0.0001584502,0.0009157002,0.029109899],"genre_scores_gemma":[0.8664091,0.0089168865,0.11374532,0.00033736456,0.00060686487,0.0002003716,0.0002464695,0.00004411342,0.00949347],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99978536,0.00006324826,0.000014552956,0.000027996075,0.00008037331,0.000028479368],"domain_scores_gemma":[0.9997191,0.00008140068,0.00007028778,0.00003659888,0.00006487391,0.000027782855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041830135,0.00043256776,0.0003413593,0.00051982387,0.00053695944,0.0011199756,0.00076821493,0.00071352976,0.0010427838],"category_scores_gemma":[0.00080099405,0.00011318213,0.00019307542,0.0003383052,0.00033441087,0.0014859367,0.0005829603,0.00028789358,0.00042102026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018697916,0.00025664366,0.0063318247,0.0007486881,0.00015076142,0.0015211711,0.00076737016,0.17378995,0.06444266,0.03725573,0.011013806,0.7035345],"study_design_scores_gemma":[0.00013668434,0.0014666881,0.012827627,0.00023353503,0.00032993386,0.0032607897,0.0037166728,0.719064,0.035769023,0.049748972,0.17327704,0.00016902506],"about_ca_topic_score_codex":0.0005118745,"about_ca_topic_score_gemma":0.00060830486,"teacher_disagreement_score":0.0011199756,"about_ca_system_score_codex":0.00015038003,"about_ca_system_score_gemma":0.0002634364,"threshold_uncertainty_score":0.003488481},"labels":[],"label_agreement":null},{"id":"W2351150492","doi":"","title":"Analysis and Research on the Performance of the Ad Hoc Routing Protocol LAR","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Routing protocol; Node (physics); Protocol (science); Set (abstract data type); Wireless ad hoc network; Routing (electronic design automation); Zone Routing Protocol; Optimized Link State Routing Protocol; Distance-vector routing protocol; Wireless Routing Protocol; Telecommunications; Physics; Medicine","score_opus":0.023706492999420428,"score_gpt":0.31432303443800075,"score_spread":0.29061654143858034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2351150492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48062354,0.025494557,0.44594786,0.0017434141,0.00031237194,0.00021967475,0.00039089337,0.0015395836,0.043728206],"genre_scores_gemma":[0.97100943,0.005755591,0.020412926,0.0001490993,0.00021392755,0.00006526114,0.0002473928,0.00008589957,0.0020604334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99489474,0.0017843109,0.00021131651,0.00051201985,0.0022907183,0.00030677774],"domain_scores_gemma":[0.98159677,0.013754294,0.0010082634,0.00087857805,0.0026239615,0.0001382794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028864325,0.00062531716,0.0006670236,0.0016980206,0.00045317685,0.0010805905,0.00078250683,0.00071206316,0.00170305],"category_scores_gemma":[0.02034031,0.0003033318,0.00042473822,0.001861216,0.0009412595,0.002837075,0.0003769333,0.00086271134,0.0005098245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013632495,0.00048615367,0.01870189,0.0022473217,0.00035580384,0.00062089396,0.0008593369,0.47942546,0.10026796,0.063127264,0.0042567924,0.3282878],"study_design_scores_gemma":[0.00003900299,0.0020794007,0.011310617,0.00018732596,0.0002096911,0.0011382169,0.00048529173,0.89914805,0.058150005,0.014354502,0.012791095,0.000106827785],"about_ca_topic_score_codex":0.0011819258,"about_ca_topic_score_gemma":0.00054450304,"teacher_disagreement_score":0.0028864325,"about_ca_system_score_codex":0.0011020829,"about_ca_system_score_gemma":0.00053796585,"threshold_uncertainty_score":0.015265107},"labels":[],"label_agreement":null},{"id":"W2354838881","doi":"","title":"A Security Routing Optimization Scheme for Multi-Hop Wireless Networks","year":2010,"lang":"en","type":"article","venue":"Chuangan jishu xuebao","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Computer network; Link-state routing protocol; Dynamic Source Routing; Multipath routing; Static routing; Routing protocol; Ant colony optimization algorithms; Wireless Routing Protocol; Routing (electronic design automation); Network packet; Destination-Sequenced Distance Vector routing; Distributed computing; Algorithm","score_opus":0.017290810949432366,"score_gpt":0.2563012053422089,"score_spread":0.23901039439277655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354838881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010991844,0.000294515,0.9852571,0.00024408608,0.000078467965,0.00010566816,0.000036691228,0.00028511637,0.0027065722],"genre_scores_gemma":[0.47604617,0.0007476911,0.51505595,0.00018475702,0.00009931323,0.00036943317,0.00021349348,0.0001277431,0.0071555153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.00012013178,0.000032630593,0.00006472008,0.00016546011,0.000039282942],"domain_scores_gemma":[0.9997008,0.00008186723,0.0000618083,0.000052771178,0.00007751188,0.00002523751],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078683626,0.0007561197,0.00071303116,0.0006997885,0.000832637,0.00054533535,0.0008751387,0.0005861474,0.0015530776],"category_scores_gemma":[0.0011301651,0.00025512633,0.00064459513,0.00067277136,0.0004510986,0.0011681196,0.0011565787,0.0008975211,0.0003923884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020253757,0.00010301663,0.0006634595,0.00020056622,0.000104334395,0.00015748826,0.00020861984,0.61066556,0.02817563,0.087625,0.006467819,0.26542592],"study_design_scores_gemma":[0.00002804915,0.00011245777,0.00015730075,0.000010807993,0.000022537135,0.00012091796,0.000019173298,0.9809482,0.0027596548,0.011405815,0.0043975934,0.000017532098],"about_ca_topic_score_codex":0.0007362766,"about_ca_topic_score_gemma":0.0010946316,"teacher_disagreement_score":0.0015530776,"about_ca_system_score_codex":0.0007079742,"about_ca_system_score_gemma":0.0007503061,"threshold_uncertainty_score":0.0051956177},"labels":[],"label_agreement":null},{"id":"W2356589364","doi":"","title":"A Distributed Defending Mechanism Against Routing DoS Attack in Mobile Ad Hoc Networks","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Flooding (psychology); Denial-of-service attack; Mobile ad hoc network; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Computer security; Routing (electronic design automation); Network packet; The Internet; Wireless; Telecommunications; World Wide Web","score_opus":0.011396746811401747,"score_gpt":0.2549893959018554,"score_spread":0.24359264909045364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2356589364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058194637,0.0016242578,0.9292379,0.00042987967,0.00030286945,0.00026799244,0.000053733347,0.0048152893,0.005073425],"genre_scores_gemma":[0.8244215,0.0006214901,0.1666014,0.00036488092,0.00025200867,0.00026564673,0.00011540878,0.0001100581,0.007247602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990453,0.00020315142,0.0000781782,0.00023372576,0.00033946906,0.00010024437],"domain_scores_gemma":[0.9977036,0.00053148926,0.0003118116,0.0007567061,0.00052160217,0.00017466409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015762931,0.00064589386,0.0011129307,0.0012782052,0.0010993854,0.0014214172,0.0025786527,0.0014362527,0.0014068446],"category_scores_gemma":[0.0026293935,0.00029231608,0.0005843552,0.00057566096,0.0008352705,0.0022003383,0.0016848969,0.000926945,0.0005905936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001577759,0.00057628134,0.002220966,0.00061586394,0.00036733167,0.0009927223,0.0007003153,0.07115875,0.20095156,0.10041954,0.008540147,0.6118787],"study_design_scores_gemma":[0.0004832977,0.0023471666,0.002073858,0.0001109282,0.0004171465,0.0032104854,0.00019933798,0.8040278,0.10135322,0.04143322,0.044131894,0.00021156657],"about_ca_topic_score_codex":0.00036969077,"about_ca_topic_score_gemma":0.000284747,"teacher_disagreement_score":0.0025786527,"about_ca_system_score_codex":0.0005357425,"about_ca_system_score_gemma":0.0006491764,"threshold_uncertainty_score":0.008336306},"labels":[],"label_agreement":null},{"id":"W2358762696","doi":"","title":"An Improved MAC Protocol Applied forAd Hoc Networks","year":2009,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Time division multiple access; Network packet; Ad hoc wireless distribution service; Reverse Address Resolution Protocol; Quality of service; Protocol (science); Mobile ad hoc network; Optimized Link State Routing Protocol; Multiple Access with Collision Avoidance for Wireless; Vehicular ad hoc network; Frame (networking); Distributed computing; Internet protocol suite; Wireless; Routing protocol; Telecommunications; The Internet","score_opus":0.006160898020842544,"score_gpt":0.25581761573611017,"score_spread":0.24965671771526762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358762696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007936359,0.018436396,0.9468269,0.00093016407,0.0033895418,0.0008591536,0.00038431713,0.003393599,0.017843565],"genre_scores_gemma":[0.18560182,0.018168855,0.74910957,0.0018889061,0.002247382,0.0021222883,0.001872661,0.00032636686,0.038662236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99839896,0.00037724766,0.00017792714,0.0002468512,0.0006746079,0.00012436797],"domain_scores_gemma":[0.998814,0.00020635339,0.000111070105,0.000188828,0.0006288764,0.000050854313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012001462,0.001169845,0.0009436224,0.0011317758,0.0009718747,0.001120799,0.0016784181,0.0012146542,0.0038726237],"category_scores_gemma":[0.0024298758,0.00034682432,0.00072242075,0.0014654456,0.0005554704,0.0020264601,0.0013095745,0.0020104847,0.0017983442],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061900227,0.0003065295,0.0014159377,0.0028625568,0.0003080334,0.0009714263,0.0004913889,0.01875286,0.13158262,0.08442845,0.04414386,0.71411735],"study_design_scores_gemma":[0.00026931794,0.0011960226,0.002068992,0.00031734863,0.0005028197,0.003346853,0.00013221895,0.11695725,0.06252921,0.017714497,0.79473555,0.0002297876],"about_ca_topic_score_codex":0.001168744,"about_ca_topic_score_gemma":0.0009839002,"teacher_disagreement_score":0.0038726237,"about_ca_system_score_codex":0.0006166647,"about_ca_system_score_gemma":0.0010440561,"threshold_uncertainty_score":0.012955248},"labels":[],"label_agreement":null},{"id":"W2365850636","doi":"","title":"Securing Ad Hoc Networks","year":2005,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Wireless network; Vehicular ad hoc network; Delay-tolerant networking; Ad hoc wireless distribution service; Redundancy (engineering); Vulnerability (computing); Adaptive quality of service multi-hop routing; Computer security; Wireless; Optimized Link State Routing Protocol; Distributed computing; Telecommunications; Network packet","score_opus":0.006058661270046895,"score_gpt":0.2198793967447372,"score_spread":0.2138207354746903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2365850636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033465065,0.08092663,0.68658334,0.0103834625,0.008247135,0.0011379266,0.000814815,0.0062435437,0.17219807],"genre_scores_gemma":[0.5443852,0.104509905,0.2676093,0.0042881323,0.008216184,0.00093128515,0.0020462195,0.00051978615,0.067494005],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961488,0.0008613375,0.00030421102,0.00041106436,0.0020639547,0.0002105573],"domain_scores_gemma":[0.99572575,0.0012818571,0.0005078261,0.0015890441,0.00065894425,0.00023660176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020488424,0.0009550779,0.00062483875,0.0012295224,0.0012768534,0.0035839432,0.0014300245,0.0018678468,0.005597038],"category_scores_gemma":[0.009220071,0.00047809668,0.00038660187,0.0012285741,0.0016880658,0.0064137834,0.002920799,0.0018355078,0.005548588],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099361605,0.000095840136,0.0024206801,0.00112164,0.000092465525,0.00090711593,0.0010054422,0.007970119,0.017971609,0.18695687,0.054675568,0.7266832],"study_design_scores_gemma":[0.000051584557,0.00030254584,0.0010994483,0.00086861115,0.00007479756,0.0033411973,0.00035351145,0.021477517,0.015521763,0.09937091,0.8574505,0.000087664645],"about_ca_topic_score_codex":0.0002456438,"about_ca_topic_score_gemma":0.00019177167,"teacher_disagreement_score":0.005597038,"about_ca_system_score_codex":0.00049242686,"about_ca_system_score_gemma":0.00083108107,"threshold_uncertainty_score":0.018723905},"labels":[],"label_agreement":null},{"id":"W2366192769","doi":"","title":"Performance Analysis of Different Traffic Models over MANET DSR Protocol","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Variable bitrate; Protocol (science); Bit rate; Network packet","score_opus":0.008038044698368727,"score_gpt":0.23175915300668717,"score_spread":0.22372110830831846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366192769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9661747,0.0027759273,0.023717709,0.00042948258,0.00013665155,0.00015353352,0.0006584033,0.0008539603,0.005099648],"genre_scores_gemma":[0.9959884,0.0007516533,0.002192165,0.000045154888,0.000024407322,0.000043008844,0.00042214425,0.00004797695,0.00048505954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970003,0.0011346029,0.00014745051,0.0002226842,0.0009418671,0.0005529788],"domain_scores_gemma":[0.9886397,0.008086961,0.0008012881,0.00049011223,0.0017015246,0.000280387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033216653,0.001526539,0.00097220205,0.0025556607,0.0007341047,0.0012838122,0.0011169311,0.0009870718,0.0009817914],"category_scores_gemma":[0.009449822,0.00027868355,0.0005300531,0.0019553504,0.00066637807,0.001286216,0.0005334678,0.00078255945,0.00022311366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002740961,0.00042004426,0.010373446,0.00042558069,0.0003187464,0.00038269124,0.0002649715,0.92940533,0.018854784,0.0052527795,0.001856285,0.029704306],"study_design_scores_gemma":[0.000031487125,0.0008051358,0.002352438,0.00002485474,0.00008178986,0.00017455562,0.0001155256,0.9880884,0.007140272,0.00074305263,0.0004005524,0.000041773223],"about_ca_topic_score_codex":0.0053900867,"about_ca_topic_score_gemma":0.0032130461,"teacher_disagreement_score":0.0053900867,"about_ca_system_score_codex":0.0021993208,"about_ca_system_score_gemma":0.00056945777,"threshold_uncertainty_score":0.01756686},"labels":[],"label_agreement":null},{"id":"W2366555364","doi":"","title":"Measure on the Basis of the Invasion Forming a Cluster in Wireless Ad hoc Network","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Node (physics); Cluster (spacecraft); Computer network; Wireless; Telecommunications","score_opus":0.009516725009705646,"score_gpt":0.20204105588430618,"score_spread":0.19252433087460052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2366555364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27175367,0.0024456214,0.6975478,0.0013356167,0.0007256659,0.00021418346,0.0003585666,0.0008410746,0.024777811],"genre_scores_gemma":[0.9456072,0.000541722,0.048463117,0.0001335388,0.00019128037,0.00014938571,0.00024031961,0.00005726553,0.004616091],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973073,0.00054321584,0.00013008056,0.0004211223,0.0014141842,0.00018412969],"domain_scores_gemma":[0.99421483,0.0024518515,0.00095181004,0.0006111875,0.0014949681,0.0002753158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016450053,0.00053560594,0.00041411078,0.0021323864,0.0006704266,0.0014648994,0.0011106383,0.00078926026,0.0020161613],"category_scores_gemma":[0.011727876,0.00018349008,0.00025199854,0.0012926254,0.0011121136,0.0028046067,0.0013277391,0.0007534178,0.0005540269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051740516,0.00033792428,0.076856926,0.00082695065,0.0004187989,0.00072687597,0.0016253563,0.19008087,0.04784062,0.33409336,0.008094915,0.33857998],"study_design_scores_gemma":[0.000050122595,0.0011478458,0.06371778,0.00015693314,0.00020304997,0.0021012605,0.0014940866,0.7442601,0.030615743,0.13359539,0.022501668,0.00015608133],"about_ca_topic_score_codex":0.0007731255,"about_ca_topic_score_gemma":0.00075910427,"teacher_disagreement_score":0.0021323864,"about_ca_system_score_codex":0.0011075058,"about_ca_system_score_gemma":0.00049502274,"threshold_uncertainty_score":0.008699715},"labels":[],"label_agreement":null},{"id":"W2369560301","doi":"","title":"Overview of Distributed Key Management for Mobile Ad Hoc Network","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mobile ad hoc network; Key management; Key (lock); Computer network; Wireless ad hoc network; Scheme (mathematics); Wireless; Distributed computing; Computer security; Telecommunications; Network packet; Encryption","score_opus":0.012188726557626633,"score_gpt":0.26273980447764417,"score_spread":0.2505510779200175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2369560301","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018618437,0.09503398,0.8736317,0.0012374682,0.0012494405,0.00052374724,0.00018683332,0.0012557334,0.025019236],"genre_scores_gemma":[0.11757734,0.14902927,0.7006012,0.0012359818,0.0032772678,0.0016631833,0.0013882736,0.00024842017,0.024979077],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99875844,0.00025306,0.00018577263,0.00017588785,0.0005423781,0.0000845407],"domain_scores_gemma":[0.9993887,0.00016934444,0.00006862083,0.00011383459,0.00021145436,0.00004806803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011829991,0.001035431,0.000838092,0.0015412435,0.000890909,0.0022628566,0.0017142311,0.0014810094,0.003626055],"category_scores_gemma":[0.0012406294,0.00060890696,0.0006062305,0.0026140222,0.0008299802,0.0043701613,0.0014757442,0.0020606606,0.0028704936],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015756348,0.00012438554,0.00062527385,0.0034946122,0.00009929692,0.00057164766,0.0003382462,0.012965376,0.012250262,0.27462852,0.03028387,0.66446096],"study_design_scores_gemma":[0.000071163544,0.00025492447,0.0005792591,0.0005294837,0.00009592517,0.0022542225,0.00013506631,0.06031137,0.0052929744,0.10883473,0.8215393,0.00010155921],"about_ca_topic_score_codex":0.0006159724,"about_ca_topic_score_gemma":0.00044348577,"teacher_disagreement_score":0.003626055,"about_ca_system_score_codex":0.0010697086,"about_ca_system_score_gemma":0.0012061875,"threshold_uncertainty_score":0.01213032},"labels":[],"label_agreement":null},{"id":"W2371351365","doi":"","title":"A Dual-Channel Power Control Protocol with Busy Tone for Ad Hoe Network","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Network packet; Control channel; Channel (broadcasting); Tone (literature); Protocol (science); Power control; Collision; Power (physics); Real-time computing; Computer security","score_opus":0.010015925934903379,"score_gpt":0.2508874137098675,"score_spread":0.24087148777496412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371351365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018112976,0.0017737283,0.9737526,0.00024308953,0.00042413847,0.00019576655,0.00003961083,0.00053610397,0.004922059],"genre_scores_gemma":[0.76920056,0.001756899,0.21517526,0.0003639138,0.00039026135,0.000859388,0.0001998258,0.0000667703,0.011987256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992471,0.00017935604,0.000051912775,0.00011785082,0.00031832984,0.00008554571],"domain_scores_gemma":[0.9991998,0.00021296303,0.00007543231,0.00010770736,0.00032762432,0.000076473545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006376086,0.0005252678,0.0005867243,0.00063113094,0.0007169645,0.0009850328,0.0013137858,0.00056450575,0.0013383293],"category_scores_gemma":[0.0011854719,0.00024673718,0.0003077466,0.00051460066,0.00061112887,0.0015961438,0.0010118835,0.0009742368,0.00035012737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088535435,0.00044856497,0.0019856081,0.0011209174,0.00023662363,0.0017886084,0.0008375646,0.053167626,0.20429325,0.15756962,0.014735576,0.56293064],"study_design_scores_gemma":[0.00047628186,0.0016914903,0.0010714039,0.00008861474,0.0003244754,0.00399159,0.0001982463,0.8201217,0.061258875,0.034718018,0.07579787,0.00026150822],"about_ca_topic_score_codex":0.000571062,"about_ca_topic_score_gemma":0.00071656593,"teacher_disagreement_score":0.0013383293,"about_ca_system_score_codex":0.00037498,"about_ca_system_score_gemma":0.00065143494,"threshold_uncertainty_score":0.0044771433},"labels":[],"label_agreement":null},{"id":"W2378341239","doi":"","title":"A Cross-Layer Routing for Wireless Mesh Networks","year":2009,"lang":"en","type":"article","venue":"Computer Knowledge and Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Computer network; Wireless mesh network; Routing protocol; Dynamic Source Routing; Routing (electronic design automation); Zone Routing Protocol; Link-state routing protocol; Network packet; Distributed computing; Wireless; Wireless network; Telecommunications","score_opus":0.013067438842578955,"score_gpt":0.2694376639796872,"score_spread":0.2563702251371083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2378341239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145919155,0.007924587,0.95835274,0.0010926473,0.0012937217,0.0002407713,0.00017777625,0.0012628961,0.015062976],"genre_scores_gemma":[0.39094403,0.007977635,0.5662356,0.0009134718,0.00065703795,0.00044743088,0.0010345109,0.00019637578,0.031593837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960107,0.00012211829,0.000032308326,0.00005999158,0.00016103864,0.000023580244],"domain_scores_gemma":[0.9997428,0.00005925844,0.000032514636,0.000051603387,0.0000954609,0.000018363327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063137704,0.00038144842,0.00018571454,0.00052538275,0.00044347416,0.00078927085,0.00058224285,0.000635979,0.0025788783],"category_scores_gemma":[0.00095064624,0.00018564232,0.00041886375,0.00045284562,0.0002490957,0.00087815576,0.0005961211,0.0005297675,0.0007392889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024483347,0.00015015581,0.0014327052,0.00088462967,0.0002261711,0.0006100211,0.00019383593,0.060602337,0.08261656,0.16821186,0.024248654,0.66057825],"study_design_scores_gemma":[0.00009213276,0.00082455383,0.0025799149,0.00017355163,0.0002457115,0.0018864804,0.000090863854,0.5696852,0.046277568,0.058277395,0.31976593,0.00010062423],"about_ca_topic_score_codex":0.0005706341,"about_ca_topic_score_gemma":0.0005457048,"teacher_disagreement_score":0.0025788783,"about_ca_system_score_codex":0.0002916922,"about_ca_system_score_gemma":0.00038618987,"threshold_uncertainty_score":0.008627236},"labels":[],"label_agreement":null},{"id":"W2387938421","doi":"","title":"A Reaching Phase Protocol with Small Flooding Regions In Ad Hoc Networks","year":2006,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flooding (psychology); Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Relay; Geocast; Delay-tolerant networking; Protocol (science); Blocking (statistics); Optimized Link State Routing Protocol; Computer security; Routing protocol; Telecommunications; Wireless; Routing (electronic design automation); Network packet; Power (physics)","score_opus":0.014387350603264818,"score_gpt":0.2538181840283552,"score_spread":0.2394308334250904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2387938421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015074202,0.0010744138,0.97795814,0.00022856648,0.00015706883,0.00039653975,0.00005377787,0.0007664957,0.004290773],"genre_scores_gemma":[0.475444,0.0023279525,0.5124807,0.0003181107,0.00021038148,0.0011972638,0.00035065404,0.0001548514,0.007516013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992052,0.00027560585,0.00007062204,0.000091171125,0.00030257835,0.000054856966],"domain_scores_gemma":[0.999126,0.00044026566,0.00008747737,0.00014187352,0.00015041427,0.000054020857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00105102,0.00051727664,0.00067084195,0.00076104875,0.00087691034,0.0007221461,0.0012147641,0.0008268912,0.001017724],"category_scores_gemma":[0.0024585417,0.0003426547,0.0005821696,0.0010592837,0.0008878464,0.002098139,0.0014078096,0.00094895036,0.00039569454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006550908,0.00024034032,0.0010919753,0.0011449605,0.0001380939,0.0008462295,0.0010730611,0.13784659,0.12911317,0.31474927,0.0074885995,0.40561268],"study_design_scores_gemma":[0.00042559407,0.0018872409,0.000733101,0.0001637955,0.00021091495,0.002066882,0.00030627684,0.7184286,0.061112326,0.11740222,0.09706014,0.00020281499],"about_ca_topic_score_codex":0.00083051424,"about_ca_topic_score_gemma":0.0006554508,"teacher_disagreement_score":0.0012147641,"about_ca_system_score_codex":0.0003877028,"about_ca_system_score_gemma":0.0009290754,"threshold_uncertainty_score":0.005558431},"labels":[],"label_agreement":null},{"id":"W2388363221","doi":"10.1109/tvt.2015.2449335","title":"Practical Asynchronous Neighbor Discovery in Ad Hoc Networks With Directional Antennas","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Higher Education Discipline Innovation Project; Shanghai Key Laboratory of Digital Media Processing and Transmission; Major State Basic Research Development Program of China; National Natural Science Foundation of China","keywords":"Asynchronous communication; Neighbor Discovery Protocol; Computer science; Initialization; Wireless ad hoc network; Algorithm; Distributed computing; Theoretical computer science; Computer network; Wireless; Telecommunications; The Internet","score_opus":0.014957826142783244,"score_gpt":0.24712007573585767,"score_spread":0.23216224959307444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388363221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026124474,0.000214146,0.97139865,0.000118806165,0.000034998568,0.000046382997,0.000017789722,0.00023857265,0.0018061997],"genre_scores_gemma":[0.7084274,0.0004410741,0.28797734,0.00008520786,0.0000683393,0.00013705445,0.00008392044,0.000053504176,0.0027261965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99818903,0.00076052966,0.00008270652,0.00025606205,0.0005266412,0.00018503779],"domain_scores_gemma":[0.99618727,0.0023891793,0.00033851678,0.00049301883,0.00045555364,0.00013643377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023419275,0.00062925916,0.0006352621,0.00057808735,0.0010614556,0.0012609042,0.0015572476,0.00081533805,0.000991487],"category_scores_gemma":[0.0058311448,0.00038462816,0.0004154508,0.00095358933,0.00088683056,0.0024000076,0.0011682521,0.0008041579,0.00027785977],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003470392,0.0001279352,0.001954368,0.0001575283,0.00004614966,0.00018458649,0.00024778166,0.76868343,0.011483009,0.09998528,0.0022763999,0.11450639],"study_design_scores_gemma":[0.0000290969,0.00005708018,0.00010911593,0.000003030258,0.000008947424,0.000056697852,0.000030058178,0.98701847,0.0019905278,0.009581575,0.0011083557,0.000007119535],"about_ca_topic_score_codex":0.0016673743,"about_ca_topic_score_gemma":0.001680009,"teacher_disagreement_score":0.0023419275,"about_ca_system_score_codex":0.0009982226,"about_ca_system_score_gemma":0.0010799695,"threshold_uncertainty_score":0.012385428},"labels":[],"label_agreement":null},{"id":"W2394001144","doi":"","title":"The Research on Security Mechanism for Mobile Ad Hoc Networks","year":2004,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Node (physics); Wireless network; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Computer security; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Wireless; Distributed computing; Telecommunications; Network packet","score_opus":0.025364774072858195,"score_gpt":0.31484776374749257,"score_spread":0.2894829896746344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394001144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027287541,0.13779369,0.7291784,0.009325675,0.0063418355,0.0003778627,0.00013365406,0.0005937278,0.08896754],"genre_scores_gemma":[0.4832192,0.21257879,0.2491169,0.0030539327,0.007070826,0.0006755879,0.00028847548,0.00014097612,0.043855328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982722,0.00037886863,0.00012477246,0.00034907705,0.00073071365,0.00014447283],"domain_scores_gemma":[0.997684,0.0010123166,0.0001906405,0.00038185943,0.00065467996,0.00007646313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020221851,0.0007851083,0.00065796747,0.0015774725,0.0012071196,0.002186911,0.0013569368,0.0015075885,0.00293037],"category_scores_gemma":[0.0043035806,0.00046054026,0.0009419632,0.0017776139,0.0024743858,0.009050961,0.0013377463,0.0033302468,0.0014388943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006791873,0.00007211469,0.00046546827,0.0007856093,0.000057083453,0.00018026156,0.00048047933,0.0044172215,0.0066883736,0.80071044,0.0059269723,0.18014793],"study_design_scores_gemma":[0.000077498196,0.00072014093,0.0008072298,0.00094987743,0.00017452001,0.0022421202,0.00046136446,0.04094909,0.019567642,0.4399198,0.4939691,0.00016160514],"about_ca_topic_score_codex":0.0004854167,"about_ca_topic_score_gemma":0.00022421704,"teacher_disagreement_score":0.00293037,"about_ca_system_score_codex":0.0014328477,"about_ca_system_score_gemma":0.0013327359,"threshold_uncertainty_score":0.010694504},"labels":[],"label_agreement":null},{"id":"W2398052624","doi":"10.22215/etd/2011-07187","title":"Enhanced topology control interference aware channel assignment algorithm","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Control channel; Interference (communication); Computer science; Topology (electrical circuits); Channel (broadcasting); Algorithm; Topology control; Telecommunications; Mathematics; Combinatorics; Wireless; Wireless network","score_opus":0.012850463268789053,"score_gpt":0.2486556809957319,"score_spread":0.23580521772694285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398052624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03011021,0.0006748351,0.95358664,0.0003357156,0.00025424024,0.00018861359,0.00019545658,0.0015580581,0.01309628],"genre_scores_gemma":[0.69701856,0.00047388076,0.28860018,0.00025728773,0.00019412857,0.00025502683,0.000619863,0.00009497375,0.01248613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993992,0.00011920085,0.00002472167,0.00011943139,0.00021866051,0.00011876421],"domain_scores_gemma":[0.99910176,0.00031513124,0.000087855726,0.00015655735,0.0002729893,0.00006571291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046276723,0.00047005893,0.00068543747,0.00094926683,0.0005514315,0.0009081236,0.0016521834,0.0005244576,0.0040896214],"category_scores_gemma":[0.0018432164,0.0002030758,0.00026647406,0.0010999427,0.00038350996,0.00077689724,0.0008157631,0.00077043235,0.00081102503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003202239,0.00030011247,0.00097321696,0.00011323787,0.000059387567,0.00011337067,0.00008745723,0.60649866,0.0122415805,0.013484281,0.0105363205,0.3552721],"study_design_scores_gemma":[0.00003691359,0.000048586076,0.00018249144,0.0000049154837,0.000011931163,0.00005665108,0.000011342065,0.9941875,0.0018038676,0.0019232145,0.0017253448,0.0000072496714],"about_ca_topic_score_codex":0.0036565792,"about_ca_topic_score_gemma":0.004997561,"teacher_disagreement_score":0.0040896214,"about_ca_system_score_codex":0.0005990221,"about_ca_system_score_gemma":0.0015170549,"threshold_uncertainty_score":0.013681173},"labels":[],"label_agreement":null},{"id":"W2398977411","doi":"","title":"On Constructing Interference-Aware k-Fault Resistant Topologies for Wireless Ad hoc Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Wireless ad hoc network; Topology control; Spanner; Computer network; Node (physics); Distributed computing; Fault tolerance; Interference (communication); Wireless network; Network topology; Wireless; Mobile ad hoc network; Topology (electrical circuits); Network packet; Key distribution in wireless sensor networks; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.018996709965302696,"score_gpt":0.24860318099809833,"score_spread":0.22960647103279563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2398977411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025995012,0.000528642,0.9695469,0.00031704016,0.000037276048,0.0001094234,0.00005227061,0.00031172746,0.0031016916],"genre_scores_gemma":[0.5015817,0.002152629,0.4924371,0.0002245381,0.00013677691,0.00036616984,0.00033726616,0.0001204551,0.0026433452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994085,0.00019745436,0.000038900427,0.00010251831,0.00020270632,0.00004990743],"domain_scores_gemma":[0.99793637,0.0012408743,0.00032441635,0.00022913526,0.0001831953,0.00008602731],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006929272,0.0007866173,0.0005917848,0.0010369113,0.0009144438,0.00070654025,0.001017077,0.00069839775,0.001149548],"category_scores_gemma":[0.0046938853,0.0002711908,0.000483859,0.0014029505,0.0012825126,0.0025512462,0.0014921814,0.0007760496,0.0004450699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013816041,0.0001203916,0.0011792607,0.0004229554,0.00004635153,0.00024208074,0.00046815668,0.7605593,0.0132428305,0.087645836,0.002714235,0.13322042],"study_design_scores_gemma":[0.00003624012,0.00037085553,0.00053612853,0.000069243586,0.000023912515,0.00048819106,0.00017354859,0.86845964,0.005067786,0.11848383,0.006257254,0.000033325396],"about_ca_topic_score_codex":0.00052366534,"about_ca_topic_score_gemma":0.0005059169,"teacher_disagreement_score":0.001149548,"about_ca_system_score_codex":0.0004971642,"about_ca_system_score_gemma":0.00047394127,"threshold_uncertainty_score":0.0038455725},"labels":[],"label_agreement":null},{"id":"W2399075275","doi":"10.1016/j.comgeo.2017.10.006","title":"A note on interference in random networks","year":2017,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Combinatorics; Unit cube; Vertex (graph theory); Interference (communication); Mathematics; Graph; Unit disk graph; Binary logarithm; Discrete mathematics; Connectivity; Cube (algebra); Topology (electrical circuits); Computer science; Telecommunications","score_opus":0.01828418869697818,"score_gpt":0.2794516056992861,"score_spread":0.26116741700230794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399075275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078107608,0.04887723,0.7720158,0.057718266,0.020254426,0.00008317791,0.00045196657,0.00031111296,0.09247728],"genre_scores_gemma":[0.52649283,0.09549724,0.19144545,0.0235395,0.10165062,0.00051893835,0.0005304164,0.00080156967,0.059523396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9945015,0.0023312506,0.0002748298,0.0008369339,0.0017328587,0.0003226849],"domain_scores_gemma":[0.9558905,0.038129557,0.0008461824,0.0026899562,0.0018395884,0.0006042458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052414616,0.0016684477,0.0028867922,0.002744115,0.0020672923,0.004181172,0.0037309527,0.0037484537,0.0063455086],"category_scores_gemma":[0.028736224,0.00085392076,0.0022887068,0.0043959282,0.009500245,0.010835812,0.004408238,0.010306651,0.0013634384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038602586,0.000016330125,0.00018113517,0.00019631251,0.000045428347,0.0001480178,0.00011404414,0.012390318,0.00027513076,0.9575442,0.01754712,0.011503279],"study_design_scores_gemma":[0.000017210366,0.000030171192,0.00012789726,0.00008127954,0.000033633816,0.00013017192,0.000049455815,0.019814175,0.00022269353,0.9464594,0.033004884,0.00002910223],"about_ca_topic_score_codex":0.0021235896,"about_ca_topic_score_gemma":0.001241714,"teacher_disagreement_score":0.0063455086,"about_ca_system_score_codex":0.002319878,"about_ca_system_score_gemma":0.0009867925,"threshold_uncertainty_score":0.027719855},"labels":[],"label_agreement":null},{"id":"W2401461774","doi":"10.1109/aina.2016.164","title":"A Transmit Power Efficient Non-Cooperative Game Design for Wireless Sensor Networks Based on the Utility and Cost Function","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Dalhousie University","funders":"","keywords":"Nash equilibrium; Computer science; Transmitter power output; Power control; Wireless ad hoc network; Function (biology); Wireless sensor network; Game theory; Wireless; Power (physics); Wireless network; Signal-to-noise ratio (imaging); Computer network; Power consumption; Distributed computing; Mathematical optimization; Telecommunications; Channel (broadcasting); Transmitter; Mathematics","score_opus":0.019248242758095443,"score_gpt":0.22310526506030312,"score_spread":0.20385702230220767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401461774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048477664,0.000080067744,0.9924165,0.00009223329,0.000027055292,0.00007659596,0.000015306707,0.000034358996,0.0024102349],"genre_scores_gemma":[0.81815296,0.00041690568,0.1741094,0.00016884544,0.000063415784,0.0006043155,0.000051151357,0.00005063803,0.006382469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988487,0.00049063546,0.000043601933,0.00017126206,0.00033695708,0.000108878136],"domain_scores_gemma":[0.99921894,0.00036289962,0.000094066316,0.00003677575,0.00022780783,0.000059487782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013177526,0.0011739117,0.0010712608,0.00052417023,0.00042377607,0.0010254557,0.0017338432,0.00086043245,0.0011108986],"category_scores_gemma":[0.0024079012,0.0003702385,0.0005064809,0.00065388315,0.0009925413,0.0012143695,0.0010418643,0.0009766198,0.00019134936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007506456,0.00010869118,0.00026212304,0.00013944104,0.00005893189,0.00016079009,0.00013537148,0.8329472,0.0073397346,0.12673575,0.0013208115,0.030716084],"study_design_scores_gemma":[0.000010424579,0.00005995065,0.000045138902,0.0000046470145,0.000010061156,0.000030988827,0.000008058579,0.98957753,0.0004633979,0.009305914,0.00047639437,0.000007535716],"about_ca_topic_score_codex":0.0021480578,"about_ca_topic_score_gemma":0.002153587,"teacher_disagreement_score":0.0021480578,"about_ca_system_score_codex":0.0011848226,"about_ca_system_score_gemma":0.0015415327,"threshold_uncertainty_score":0.0085965395},"labels":[],"label_agreement":null},{"id":"W2402323587","doi":"","title":"On secure mobile ad hoc routing","year":2006,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Ottawa","funders":"","keywords":"Computer science; Adaptive quality of service multi-hop routing; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Link-state routing protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Dynamic Source Routing; Vehicular ad hoc network; Geocast; Computer security; Distributed computing; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.006143640108169047,"score_gpt":0.2035005702592288,"score_spread":0.19735693015105976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402323587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036489613,0.024115091,0.767676,0.020684507,0.011325472,0.00036377905,0.00041217005,0.00096709107,0.13796633],"genre_scores_gemma":[0.75723886,0.03852853,0.08558755,0.0023423512,0.008662127,0.00048404612,0.00095294847,0.00056586624,0.10563775],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871314,0.00034213145,0.000086931526,0.00017531702,0.000497505,0.00018496641],"domain_scores_gemma":[0.9946503,0.0028390705,0.00021458334,0.001291668,0.00082925183,0.00017509372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017623293,0.0013150283,0.0013738864,0.0021579599,0.0018079749,0.002304065,0.0012338097,0.0014021085,0.012952676],"category_scores_gemma":[0.007779145,0.00053898647,0.0005917495,0.003136216,0.002689145,0.005834916,0.0035264802,0.0025952698,0.0032643136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005903936,0.00008662096,0.0009658084,0.0004325026,0.00007655178,0.0003702984,0.0003658585,0.05368448,0.0047314866,0.6217709,0.07137138,0.24555372],"study_design_scores_gemma":[0.00006420395,0.00016092842,0.0004950594,0.00027346678,0.000084116095,0.0004527817,0.00029139814,0.1646499,0.0038383044,0.72587067,0.10377886,0.000040238512],"about_ca_topic_score_codex":0.0010258529,"about_ca_topic_score_gemma":0.0017590374,"teacher_disagreement_score":0.012952676,"about_ca_system_score_codex":0.0014993344,"about_ca_system_score_gemma":0.00075853703,"threshold_uncertainty_score":0.043331027},"labels":[],"label_agreement":null},{"id":"W2404589049","doi":"","title":"A Hybrid Ant-Colony Routing Algorithm for Mobile Ad-Hoc Networks","year":2012,"lang":"en","type":"article","venue":"Complex Sciences. First International Conference, Complex 2009, Shanghai, China, February 23-25, 2009, Revised Papers, Part 2","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Ant colony optimization algorithms; Computer science; Network topology; Link-state routing protocol; Dynamic Source Routing; Optimized Link State Routing Protocol; Computer network; Hybrid routing; Static routing; Wireless Routing Protocol; Distributed computing; Algorithm; Routing (electronic design automation); Routing protocol","score_opus":0.04674685024821383,"score_gpt":0.28931807950730926,"score_spread":0.2425712292590954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2404589049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006801773,0.0007595974,0.9874571,0.00016053233,0.000121122896,0.00012975148,0.000055155735,0.0010391851,0.0034757208],"genre_scores_gemma":[0.16028003,0.00068243995,0.83005124,0.00019668239,0.000058351285,0.00037979014,0.0002421903,0.0001625964,0.007946668],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994981,0.00014036814,0.000026012412,0.0000695425,0.0002438729,0.00002212349],"domain_scores_gemma":[0.99969316,0.00012220257,0.000030478099,0.000038644615,0.000094133226,0.000021420718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004284471,0.000620203,0.00077966694,0.0006060543,0.000480021,0.00070147746,0.0012969805,0.00088314805,0.0015386743],"category_scores_gemma":[0.0013912002,0.00025725208,0.00032468556,0.000906194,0.00026954725,0.0010294165,0.00077653973,0.0006266709,0.0007660683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015654661,0.0001144518,0.0005239344,0.00018937327,0.00010460035,0.00019176725,0.00008744314,0.45796603,0.013668446,0.014604896,0.0069431243,0.50544935],"study_design_scores_gemma":[0.000035275345,0.000085081025,0.0001197481,0.000009431969,0.000012557184,0.00015293814,0.000010717462,0.98350716,0.0016564976,0.004126533,0.010269443,0.000014777168],"about_ca_topic_score_codex":0.001748638,"about_ca_topic_score_gemma":0.0024827218,"teacher_disagreement_score":0.001748638,"about_ca_system_score_codex":0.00028060933,"about_ca_system_score_gemma":0.00045898027,"threshold_uncertainty_score":0.005147338},"labels":[],"label_agreement":null},{"id":"W2420658690","doi":"10.5539/mas.v10n6p238","title":"A Method Based on RTO and Selective Acknowledgement for Improving SCTP Protocol Performance in Mobile Ad Hoc Networks","year":2016,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Stream Control Transmission Protocol; Computer network; Retransmission; Throughput; Mobile ad hoc network; Acknowledgement; Network packet; Timeout; Reliability (semiconductor); Packet loss; Wireless ad hoc network; Wireless; Telecommunications","score_opus":0.011702771641695801,"score_gpt":0.2758943410528387,"score_spread":0.2641915694111429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2420658690","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045370314,0.001033393,0.94822425,0.000112739566,0.00022591812,0.00020023159,0.00004711226,0.002459872,0.0023261555],"genre_scores_gemma":[0.5166371,0.0009767236,0.477975,0.00007410229,0.00015254505,0.00030979514,0.00016119915,0.00018418992,0.0035293004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999511,0.00010644497,0.000037811813,0.00007969752,0.00023473379,0.000030309022],"domain_scores_gemma":[0.9993162,0.0001800576,0.00007295885,0.00008487072,0.00031432055,0.000031623687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005541045,0.00053154764,0.00041149626,0.0010087533,0.0004500845,0.00047326137,0.0007803002,0.00029789313,0.00089707173],"category_scores_gemma":[0.0012383508,0.0001947472,0.00031589827,0.0006068011,0.00028282194,0.00084073114,0.00028057292,0.00037095553,0.00022328242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006291188,0.00028488354,0.0022580612,0.00040589552,0.000104169456,0.0002490846,0.00025703697,0.051215105,0.22957234,0.007894761,0.003615345,0.7035142],"study_design_scores_gemma":[0.00019475474,0.0010661533,0.0033569525,0.0000490192,0.00020230962,0.000762042,0.00009791903,0.8355563,0.14258826,0.0030293355,0.012960615,0.00013634155],"about_ca_topic_score_codex":0.0012641847,"about_ca_topic_score_gemma":0.0011446788,"teacher_disagreement_score":0.0012641847,"about_ca_system_score_codex":0.0003378464,"about_ca_system_score_gemma":0.0006817933,"threshold_uncertainty_score":0.0030010343},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.022113223237784453,"score_gpt":0.2091839475923061,"score_spread":0.18707072435452166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24214201","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7025294,0.0079588285,0.26272482,0.0036731332,0.002157438,0.00033016072,0.0006066386,0.0012495973,0.01877005],"genre_scores_gemma":[0.9785049,0.0011797212,0.016903136,0.000113390815,0.0003021469,0.000056733676,0.00021960639,0.000032931333,0.00268759],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958056,0.00013134912,0.000033312943,0.000091366,0.00006336171,0.000099975005],"domain_scores_gemma":[0.99917597,0.0004094187,0.0000990015,0.0001154279,0.00008743962,0.00011281295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071411213,0.00038589197,0.0005538395,0.0006896168,0.0005246478,0.00070288545,0.00081950944,0.0005886991,0.004233929],"category_scores_gemma":[0.0019022912,0.0002636352,0.00026393446,0.0008015858,0.00034116997,0.0013540849,0.00087474816,0.00033419128,0.0008773575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024504752,0.0005744392,0.048843153,0.0007136787,0.00019765379,0.0035410512,0.00042712394,0.104503326,0.01661237,0.026397178,0.029916214,0.76582336],"study_design_scores_gemma":[0.00038905314,0.0020849064,0.0223337,0.0002024,0.00025916356,0.007788271,0.0010715636,0.88188416,0.010741282,0.040383026,0.032782953,0.00007954024],"about_ca_topic_score_codex":0.0007981536,"about_ca_topic_score_gemma":0.0019928995,"teacher_disagreement_score":0.004233929,"about_ca_system_score_codex":0.00033672704,"about_ca_system_score_gemma":0.0004335639,"threshold_uncertainty_score":0.014163911},"labels":[],"label_agreement":null},{"id":"W2429913138","doi":"10.22215/etd/2010-09500","title":"Communication in networks with spatially correlated faults","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Humanities; Philosophy","score_opus":0.004951592274981953,"score_gpt":0.22523230424475965,"score_spread":0.2202807119697777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2429913138","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41323566,0.0058273436,0.5575524,0.004237676,0.0006625465,0.00009739021,0.00035197815,0.0005415552,0.017493386],"genre_scores_gemma":[0.9713193,0.0026246535,0.016426763,0.00011588728,0.00026308658,0.00005396871,0.00012727096,0.00003085761,0.0090381745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994624,0.00015824221,0.0000281071,0.0001138987,0.00016399739,0.00007332179],"domain_scores_gemma":[0.99661094,0.0021686496,0.00043900753,0.00033942738,0.00035693203,0.00008511678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005200858,0.00029948584,0.00044794544,0.0007203021,0.00044172746,0.0010711863,0.00046681537,0.0005403488,0.0015024843],"category_scores_gemma":[0.0047371695,0.00033452566,0.00023286972,0.0011701393,0.0007046897,0.0013087784,0.0007052742,0.00049559993,0.00028510066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000231055,0.00006516056,0.005062659,0.0002210315,0.00009082272,0.00078986416,0.0002541411,0.8206575,0.008125841,0.07640096,0.0046530906,0.08344795],"study_design_scores_gemma":[0.000034215762,0.00012221985,0.0037727954,0.000046526417,0.00004976873,0.0005033036,0.00021168732,0.9027748,0.0043008057,0.08097367,0.0071889614,0.000021196842],"about_ca_topic_score_codex":0.0013490982,"about_ca_topic_score_gemma":0.0019080833,"teacher_disagreement_score":0.0015024843,"about_ca_system_score_codex":0.00074883393,"about_ca_system_score_gemma":0.00061813043,"threshold_uncertainty_score":0.005433142},"labels":[],"label_agreement":null},{"id":"W2461364671","doi":"10.1145/2947626.2947633","title":"An Algorithm to Facilitate Intrusion Response in Mobile Ad Hoc Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Computer science; Mobile ad hoc network; Optimized Link State Routing Protocol; Intrusion detection system; Wireless ad hoc network; Computer network; Node (physics); Algorithm; Routing protocol; Distributed computing; Routing (electronic design automation); Data mining; Engineering; Wireless","score_opus":0.015967552985273647,"score_gpt":0.24927326370024122,"score_spread":0.23330571071496758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461364671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005892613,0.00014632936,0.9839712,0.00026234545,0.00016299843,0.00044007855,0.000088819455,0.0053482684,0.003687385],"genre_scores_gemma":[0.0638452,0.0001209603,0.9314628,0.00023066413,0.00008973521,0.00038856515,0.00034341333,0.00023509024,0.0032834923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980959,0.00049304473,0.00023027297,0.0003120348,0.0006981004,0.00017074923],"domain_scores_gemma":[0.9974922,0.0009261148,0.00016236771,0.0006211338,0.0007002852,0.0000980156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018568806,0.0010572261,0.0006867746,0.0015340742,0.0010464067,0.0015757775,0.0022624915,0.0013632333,0.005052061],"category_scores_gemma":[0.006537351,0.00037787287,0.00049838645,0.0008510687,0.00079921645,0.002793925,0.001742291,0.0011753864,0.0033504348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012481661,0.00071708625,0.0030138104,0.00052975165,0.00015858469,0.00059814716,0.0006431727,0.06693254,0.06914233,0.11837858,0.031692933,0.7069449],"study_design_scores_gemma":[0.000348539,0.0006098719,0.0006227724,0.00010829791,0.00008842601,0.0010141119,0.00021075804,0.75597364,0.080537684,0.032911416,0.12747313,0.00010136072],"about_ca_topic_score_codex":0.0007089904,"about_ca_topic_score_gemma":0.00081567606,"teacher_disagreement_score":0.005052061,"about_ca_system_score_codex":0.0005459907,"about_ca_system_score_gemma":0.0009323161,"threshold_uncertainty_score":0.016900837},"labels":[],"label_agreement":null},{"id":"W2477462074","doi":"10.4018/978-1-4666-0321-9.ch001","title":"Mobility Prediction and Mobile-aware Routing Protocols in MANETs","year":2012,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Mobile ad hoc network; Computer science; Mobility model; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless network; Ad hoc wireless distribution service; Routing protocol; Distributed computing; Wireless; Routing (electronic design automation); Engineering; Telecommunications; Network packet","score_opus":0.019949368301938847,"score_gpt":0.2603103483047065,"score_spread":0.24036098000276765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2477462074","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070045567,0.49714464,0.40726605,0.0048882696,0.005441009,0.00020754499,0.0003709202,0.0014008518,0.07627616],"genre_scores_gemma":[0.12640263,0.623919,0.1758486,0.0016566808,0.005809106,0.00037387255,0.0012863476,0.00040618712,0.06429759],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995845,0.00010555741,0.000024298517,0.000089411464,0.00016926651,0.000026901289],"domain_scores_gemma":[0.9995059,0.00030184072,0.000041508378,0.00006105795,0.000072652445,0.000017101776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052115595,0.0011548046,0.00075369887,0.00083626126,0.00045184678,0.0018041132,0.0014305946,0.0013573917,0.0041729244],"category_scores_gemma":[0.0019628652,0.0005048321,0.0005083539,0.0029146704,0.0007201915,0.004261388,0.0009703272,0.0023714064,0.0030499003],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000525432,0.000088799985,0.00048743904,0.0015192697,0.00007427722,0.000322905,0.00027791242,0.059239663,0.0025481274,0.204209,0.04664633,0.68453366],"study_design_scores_gemma":[0.000023299253,0.00018868878,0.0010670905,0.0014303504,0.00011341736,0.0013006632,0.00025328284,0.16150683,0.003321067,0.32376975,0.5068896,0.00013609239],"about_ca_topic_score_codex":0.0009706689,"about_ca_topic_score_gemma":0.0008047834,"teacher_disagreement_score":0.0041729244,"about_ca_system_score_codex":0.0006366206,"about_ca_system_score_gemma":0.00056128367,"threshold_uncertainty_score":0.013959825},"labels":[],"label_agreement":null},{"id":"W2480370775","doi":"10.4018/978-1-60960-042-6.ch002","title":"Routing in Wireless Ad Hoc and Sensor Networks","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer network; Geographic routing; Computer science; Wireless ad hoc network; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Distributed computing; Optimized Link State Routing Protocol; Wireless Routing Protocol; Link-state routing protocol; Routing protocol; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.01640797735080617,"score_gpt":0.21903364935117528,"score_spread":0.2026256720003691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2480370775","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023009651,0.31109384,0.21616276,0.0033911653,0.008597582,0.00092887366,0.0012452833,0.004098824,0.45218068],"genre_scores_gemma":[0.021333143,0.32780814,0.21482334,0.0032524278,0.0045315386,0.0010880606,0.0035408896,0.0012689745,0.4223535],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876416,0.00023472891,0.000083631654,0.00016719737,0.0006875254,0.00006282159],"domain_scores_gemma":[0.9994085,0.00025136097,0.000040806197,0.00012272083,0.0001255641,0.000050958497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080057245,0.0019944669,0.0014444125,0.0016785301,0.0007550951,0.003531957,0.0021898232,0.0022661467,0.029664826],"category_scores_gemma":[0.0014258798,0.0006545425,0.0006002477,0.006043545,0.001243133,0.004261722,0.0016731276,0.0022419218,0.033797212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002709351,0.000081152306,0.00014078096,0.0021431874,0.000036124733,0.00023653127,0.00023144236,0.0048238714,0.0016849301,0.11905783,0.18745846,0.6840786],"study_design_scores_gemma":[0.000007676457,0.000046021116,0.00015479469,0.00042840122,0.000010426628,0.000479029,0.000059110713,0.0018320903,0.00022155434,0.037321206,0.9594188,0.0000209521],"about_ca_topic_score_codex":0.00071230036,"about_ca_topic_score_gemma":0.0008375611,"teacher_disagreement_score":0.029664826,"about_ca_system_score_codex":0.000889723,"about_ca_system_score_gemma":0.0012025686,"threshold_uncertainty_score":0.09923869},"labels":[],"label_agreement":null},{"id":"W2483712243","doi":"10.7939/r36649","title":"Non-bifurcated routing and scheduling in wireless mesh networks","year":2010,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Wireless mesh network; Distributed computing; Dynamic Source Routing; Link-state routing protocol; Static routing; Policy-based routing; Routing protocol; Routing (electronic design automation); Wireless network; Wireless; Telecommunications","score_opus":0.004407727122582702,"score_gpt":0.16768258392813937,"score_spread":0.16327485680555667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483712243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013004039,0.01028235,0.960004,0.00087668555,0.00035274442,0.00010786451,0.00005448476,0.00013659951,0.015181276],"genre_scores_gemma":[0.29503042,0.031412378,0.6516492,0.00037558025,0.0008694505,0.00046663353,0.0002609825,0.00011906186,0.019816346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995371,0.00019374829,0.000021509526,0.000076712975,0.00012679318,0.00004410927],"domain_scores_gemma":[0.9993303,0.00048149316,0.000051400988,0.000054333672,0.00006538459,0.000017116228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093548605,0.00041363973,0.00031131253,0.0004449011,0.00041539298,0.0010987148,0.00062797015,0.0006490206,0.0013245896],"category_scores_gemma":[0.0021489523,0.00038799396,0.00052800984,0.00095772586,0.0008040993,0.0013006378,0.00058449473,0.0011526643,0.00038026882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032141943,0.000051941268,0.00054004474,0.00026500088,0.000034172233,0.00009025871,0.00021672226,0.35013,0.0035111955,0.50494194,0.0052974587,0.13488917],"study_design_scores_gemma":[0.000010100511,0.00006091103,0.00033474466,0.00007905185,0.000013112933,0.00008006596,0.000065210224,0.7227346,0.0013102847,0.25026584,0.025027163,0.000018928637],"about_ca_topic_score_codex":0.0012677793,"about_ca_topic_score_gemma":0.001346774,"teacher_disagreement_score":0.0013245896,"about_ca_system_score_codex":0.0010159072,"about_ca_system_score_gemma":0.00090061704,"threshold_uncertainty_score":0.007370889},"labels":[],"label_agreement":null},{"id":"W2486929444","doi":"10.4018/978-1-60566-250-3.ch001","title":"Cooperation-Based Routing Protocol for Mobile Ad-Hoc Network","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Routing protocol; Principal (computer security); Optimized Link State Routing Protocol; Wireless Routing Protocol; Zone Routing Protocol; Distributed computing; Wireless ad hoc network; Node (physics); Network packet; Mobile ad hoc network; Simple (philosophy); Routing (electronic design automation); Engineering; Wireless; Computer security; Telecommunications","score_opus":0.01847053520774558,"score_gpt":0.27549195244283203,"score_spread":0.2570214172350864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2486929444","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021851787,0.09073637,0.70784277,0.00302617,0.0064946255,0.0012888178,0.0013843292,0.0049249586,0.18211673],"genre_scores_gemma":[0.05306811,0.09190746,0.62837523,0.004380311,0.0029458764,0.004260099,0.0074079176,0.0012246039,0.20643035],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907255,0.00024458783,0.00007670036,0.000109037836,0.00043978388,0.00005726902],"domain_scores_gemma":[0.9995882,0.00013804052,0.000034360055,0.000068225745,0.0001429932,0.000028259548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070246024,0.0012951049,0.0009994074,0.0011013389,0.0007852157,0.0015086799,0.0019815972,0.0020223574,0.0100509925],"category_scores_gemma":[0.0011178821,0.00040463326,0.0005642446,0.0027417499,0.0008462572,0.0018025829,0.001333779,0.0027173932,0.0140639255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000793154,0.00010720623,0.00019541504,0.002286537,0.00007795767,0.00079761085,0.00049951253,0.010833152,0.009584636,0.22955933,0.25694892,0.4890304],"study_design_scores_gemma":[0.00002718631,0.000077974546,0.00014967253,0.00032398215,0.00002896961,0.0011080079,0.00005753405,0.009382646,0.0012811348,0.040137455,0.9473766,0.00004886485],"about_ca_topic_score_codex":0.0009883812,"about_ca_topic_score_gemma":0.0012042687,"teacher_disagreement_score":0.0100509925,"about_ca_system_score_codex":0.0010186232,"about_ca_system_score_gemma":0.0011235949,"threshold_uncertainty_score":0.033623874},"labels":[],"label_agreement":null},{"id":"W2492176886","doi":"10.1109/icc.2016.7511233","title":"Cross layer optimization for routing based on link layer delay analysis","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Equal-cost multi-path routing; Link layer; Routing protocol; Path vector protocol; Link-state routing protocol; Transmission delay; Dynamic Source Routing; Metrics; Routing (electronic design automation); Metric (unit); Path (computing); Throughput; Network packet; Distributed computing; Wireless; Telecommunications; Engineering","score_opus":0.02125029260645568,"score_gpt":0.27930128604772886,"score_spread":0.2580509934412732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492176886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013615198,0.0012985475,0.9795799,0.00015229898,0.00009796189,0.000057275643,0.00004368202,0.00025480386,0.0049003684],"genre_scores_gemma":[0.69945216,0.0019862973,0.28929242,0.00016344842,0.00009395816,0.00022847547,0.00018973844,0.00021426758,0.008379253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.00019008742,0.00002749882,0.00008293723,0.00025278112,0.00006800657],"domain_scores_gemma":[0.999411,0.000317553,0.00007689703,0.000034469413,0.00014536724,0.000014837598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013043737,0.0009330071,0.00058617565,0.00080524257,0.00039026386,0.0009959427,0.0006182613,0.00043843893,0.0022736792],"category_scores_gemma":[0.0018555782,0.00027448163,0.0004988479,0.00075146207,0.00036220677,0.0009317944,0.0006826818,0.0005548119,0.0003061876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043026183,0.000025716326,0.00036545444,0.00007156673,0.000046641097,0.00003183241,0.000027639206,0.94687283,0.0044783307,0.015106731,0.0009159052,0.03201429],"study_design_scores_gemma":[0.0000027993817,0.00002123406,0.00008417245,0.000004043361,0.000010008092,0.000012491684,0.0000048261895,0.99682546,0.000705129,0.0016579203,0.00066828687,0.000003625925],"about_ca_topic_score_codex":0.0019271335,"about_ca_topic_score_gemma":0.002409542,"teacher_disagreement_score":0.0022736792,"about_ca_system_score_codex":0.0013124101,"about_ca_system_score_gemma":0.0010785891,"threshold_uncertainty_score":0.0095222},"labels":[],"label_agreement":null},{"id":"W2492859653","doi":"10.4236/ijcns.2016.98028","title":"Joint Routing and Admission Control in Wireless Mesh Network","year":2016,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Handover; Admission control; Quality of service; Call Admission Control; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Wireless mesh network; Static routing; Distributed computing; Routing (electronic design automation); Wireless network; Wireless; Routing protocol","score_opus":0.02519573474975544,"score_gpt":0.2776487129300832,"score_spread":0.25245297818032775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492859653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04849854,0.0015043569,0.9463277,0.00059274834,0.000143708,0.00006645241,0.000039241077,0.00073420955,0.002093064],"genre_scores_gemma":[0.95526576,0.00040872337,0.042468864,0.00007086897,0.00011932782,0.00007784985,0.000048136215,0.000025985524,0.0015145548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982451,0.0006109267,0.00010057193,0.00025622273,0.0005313344,0.00025586112],"domain_scores_gemma":[0.99842715,0.0008714238,0.00023180827,0.00017181195,0.00017885953,0.000118914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018867555,0.00044532111,0.00081892207,0.00071572507,0.00067792035,0.0011784716,0.0012292138,0.0007983354,0.0006650695],"category_scores_gemma":[0.004434889,0.0002958189,0.00043493722,0.0007437865,0.0009300015,0.0012817498,0.0015962943,0.00088976504,0.00012900023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002624693,0.00011189636,0.0020735227,0.000089266105,0.000091207214,0.00015186632,0.00018684866,0.76676697,0.009471157,0.04281473,0.001845549,0.17613447],"study_design_scores_gemma":[0.000008257441,0.000023512626,0.00012561679,0.000002554598,0.000007763231,0.00001953909,0.000009677192,0.9908199,0.0005828982,0.00800075,0.00039214164,0.0000074324084],"about_ca_topic_score_codex":0.00391464,"about_ca_topic_score_gemma":0.0025333504,"teacher_disagreement_score":0.00391464,"about_ca_system_score_codex":0.0009826752,"about_ca_system_score_gemma":0.0012887715,"threshold_uncertainty_score":0.009978235},"labels":[],"label_agreement":null},{"id":"W2497631959","doi":"","title":"Plenary lecture 4: multipath routing over wireless mesh networks for multiple description video","year":2010,"lang":"en","type":"article","venue":"International Conference on Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Multipath routing; Wireless mesh network; Multipath propagation; Network packet; Distributed computing; Wireless; Dynamic Source Routing; Wireless network; Routing protocol; Telecommunications; Channel (broadcasting)","score_opus":0.05489417028073115,"score_gpt":0.3085757327005638,"score_spread":0.25368156241983264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2497631959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012485244,0.07330534,0.41062716,0.083786406,0.16268876,0.0006786894,0.0010077293,0.0026818083,0.25273877],"genre_scores_gemma":[0.11984987,0.08160221,0.12926926,0.009058304,0.14347917,0.0006589403,0.0018483821,0.0019524118,0.51228136],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928087,0.00013021895,0.000047709553,0.00021978254,0.00022693505,0.0000944036],"domain_scores_gemma":[0.99925345,0.00028137924,0.000027674949,0.000048750826,0.00022630295,0.00016241368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001195339,0.0013874474,0.00089987327,0.0007841248,0.0006847907,0.0017148962,0.0012676059,0.0020327691,0.029145015],"category_scores_gemma":[0.0021171717,0.00037481688,0.00089577475,0.0008273606,0.00051173154,0.002144507,0.0012827017,0.0044296416,0.016536774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035663933,0.00027794865,0.0006087535,0.0007231051,0.00008559417,0.00042483036,0.00022635673,0.010217017,0.0056819962,0.043015637,0.5452603,0.39312184],"study_design_scores_gemma":[0.00011261385,0.00073036324,0.0013186004,0.0004234216,0.00008768619,0.000928671,0.00016483771,0.042224094,0.0049823527,0.037924588,0.91099435,0.00010835422],"about_ca_topic_score_codex":0.0011028365,"about_ca_topic_score_gemma":0.0008801541,"teacher_disagreement_score":0.029145015,"about_ca_system_score_codex":0.0013386059,"about_ca_system_score_gemma":0.00070922455,"threshold_uncertainty_score":0.09749973},"labels":[],"label_agreement":null},{"id":"W2502418137","doi":"10.1142/9789812770103_0013","title":"Bootstrapping Security in Mobile Ad Hoc Networks Using Identity-Based Schemes","year":2007,"lang":"en","type":"book-chapter","venue":"WORLD SCIENTIFIC eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bootstrapping (finance); Mobile ad hoc network; Wireless ad hoc network; Computer science; Vehicular ad hoc network; Computer security; Identity (music); Computer network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Telecommunications; Mathematics; Wireless; Art; Econometrics","score_opus":0.03910698305157015,"score_gpt":0.2804419114548718,"score_spread":0.24133492840330165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2502418137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035408556,0.0046345945,0.91923875,0.0010276705,0.0005019504,0.00024603572,0.000051052495,0.00089825183,0.03799308],"genre_scores_gemma":[0.7422631,0.0050140084,0.23183358,0.00022724814,0.00054924266,0.0002801175,0.00014536448,0.00012666889,0.01956065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984067,0.00050686783,0.00008233324,0.00014792434,0.0006495563,0.0002065531],"domain_scores_gemma":[0.99814546,0.0008057371,0.00009670832,0.00074223586,0.00014288747,0.00006697997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016108258,0.0006476377,0.00084384193,0.00078500924,0.0011085031,0.0021452315,0.0013811286,0.0014410451,0.0017240914],"category_scores_gemma":[0.003890633,0.0004890908,0.00055850577,0.0011354007,0.0020737615,0.0052854214,0.0030786009,0.002765357,0.0008930583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029784237,0.00012865901,0.00056209695,0.00027481682,0.000047679125,0.00040453885,0.00084483967,0.032240808,0.016445125,0.64710486,0.007967715,0.29368103],"study_design_scores_gemma":[0.00009205361,0.00031447102,0.00054542796,0.00024261257,0.0000674296,0.0014222064,0.00035848256,0.28786337,0.02175346,0.59129786,0.095969714,0.00007291816],"about_ca_topic_score_codex":0.00019504565,"about_ca_topic_score_gemma":0.00014225718,"teacher_disagreement_score":0.0021452315,"about_ca_system_score_codex":0.00071946235,"about_ca_system_score_gemma":0.000571664,"threshold_uncertainty_score":0.008518994},"labels":[],"label_agreement":null},{"id":"W2505876309","doi":"10.4018/978-1-60566-250-3.ch006","title":"Local Algorithms for Topology Control in Ad-Hoc Networks","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Computer science; Vertex (graph theory); Topology control; Topology (electrical circuits); Wireless ad hoc network; Routing (electronic design automation); Control (management); Enhanced Data Rates for GSM Evolution; Distributed computing; Computer network; Algorithm; Theoretical computer science; Mathematics; Combinatorics; Graph; Artificial intelligence; Telecommunications","score_opus":0.012118800946769637,"score_gpt":0.24491878427736707,"score_spread":0.23279998333059743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505876309","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089761015,0.010170679,0.9754759,0.0002980532,0.0002391677,0.000071852606,0.00005013978,0.00093121425,0.011865421],"genre_scores_gemma":[0.10538558,0.03164123,0.8259643,0.00055951765,0.0011855656,0.00090081675,0.0006234633,0.0007735236,0.032966033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875426,0.00035533326,0.000069757996,0.00023590318,0.00051875965,0.00006597761],"domain_scores_gemma":[0.9985038,0.00083674473,0.00006820434,0.00037920705,0.00016188313,0.000050165127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013282956,0.0014113185,0.0015020553,0.0010346777,0.00080537034,0.0028623191,0.0034468605,0.0011478661,0.008929891],"category_scores_gemma":[0.0028907298,0.0005805616,0.0006472897,0.0029005143,0.0016066518,0.004564876,0.002054286,0.0025117728,0.004653407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046786634,0.0000819081,0.00019537871,0.001313197,0.0000657104,0.000099743054,0.00030588268,0.07420935,0.0021451782,0.37623313,0.025429072,0.51987463],"study_design_scores_gemma":[0.000093120616,0.0001497117,0.0001994139,0.00037746018,0.000069053494,0.00045117748,0.00017744563,0.35485104,0.0037482828,0.44319808,0.19663273,0.000052396284],"about_ca_topic_score_codex":0.0004604988,"about_ca_topic_score_gemma":0.00066471496,"teacher_disagreement_score":0.008929891,"about_ca_system_score_codex":0.0011108933,"about_ca_system_score_gemma":0.00060665305,"threshold_uncertainty_score":0.02987343},"labels":[],"label_agreement":null},{"id":"W2509143211","doi":"10.1007/s10776-016-0318-z","title":"Robustness, Stability, and Gains of Utility Maximization Algorithms for Mobile Ad Hoc Networks","year":2016,"lang":"en","type":"article","venue":"International Journal of Wireless Information Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Asynchronous communication; Computer network; Network topology; Mobile ad hoc network; Robustness (evolution); Distributed computing; Utility maximization; Wireless ad hoc network; Network congestion; Algorithm; Wireless; Network packet","score_opus":0.019867308456306663,"score_gpt":0.26511562237535974,"score_spread":0.24524831391905308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509143211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15266149,0.0015690348,0.8353472,0.0009583546,0.00010428561,0.00013625622,0.00012367123,0.00032793122,0.008771803],"genre_scores_gemma":[0.97557384,0.0005200596,0.022141602,0.000072597824,0.000099602636,0.00009519962,0.000061594765,0.00008703402,0.001348588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697256,0.0015908935,0.0001280094,0.0003913607,0.0005823588,0.00033480185],"domain_scores_gemma":[0.9723188,0.02345564,0.001423616,0.000968957,0.001428433,0.0004044736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005877309,0.0014123713,0.0011136836,0.0014029437,0.0008598947,0.0023697894,0.001637567,0.0012637326,0.0017535464],"category_scores_gemma":[0.033934444,0.00065965677,0.0006619605,0.0013040637,0.0027521648,0.0034655372,0.002456649,0.0019889732,0.0003307327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067258393,0.00010236747,0.0011583698,0.00010178592,0.00008753307,0.00006244001,0.00024135188,0.89443415,0.0029311816,0.06809531,0.0010145955,0.031098273],"study_design_scores_gemma":[0.000028522862,0.00010434363,0.00022454916,0.000012856481,0.00001550909,0.000028777042,0.00003665986,0.96106446,0.00072537916,0.037538435,0.00020818049,0.000012371695],"about_ca_topic_score_codex":0.0018003089,"about_ca_topic_score_gemma":0.00083223963,"teacher_disagreement_score":0.005877309,"about_ca_system_score_codex":0.0019089682,"about_ca_system_score_gemma":0.0011300364,"threshold_uncertainty_score":0.03108257},"labels":[],"label_agreement":null},{"id":"W2513906929","doi":"","title":"Towards secure and trustworthy wireless ad hoc networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer security; Wireless ad hoc network; Key management; Encryption; Wireless network; Trust management (information system); Mobile ad hoc network; Computer network; Key (lock); Wireless; Telecommunications","score_opus":0.009609010680131902,"score_gpt":0.22344143108247164,"score_spread":0.21383242040233974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513906929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048543657,0.00317635,0.980601,0.0034451245,0.00032820666,0.00015424428,0.00002397558,0.00020535514,0.007211429],"genre_scores_gemma":[0.26039386,0.014233801,0.7122275,0.0014377494,0.000949882,0.00074028823,0.00016646108,0.000106045896,0.009744348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926685,0.002671104,0.00039919128,0.00050636247,0.0034600243,0.00029483318],"domain_scores_gemma":[0.9956189,0.0016900944,0.00053388585,0.0008651244,0.0010366989,0.00025529313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056956853,0.0009552212,0.0008513178,0.0013805341,0.0013168405,0.0042655966,0.00255356,0.00353094,0.0011223033],"category_scores_gemma":[0.012356101,0.0010766125,0.00077122706,0.0011276696,0.0036615804,0.008048412,0.0051145228,0.0053153834,0.0012304116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004723924,0.00007075716,0.00050559954,0.00034730148,0.00005199717,0.0004564768,0.0009846624,0.0669079,0.005100865,0.8493947,0.0051512024,0.07098135],"study_design_scores_gemma":[0.00006243596,0.00012568405,0.00014287508,0.00030851839,0.000028421382,0.00032399676,0.0003450387,0.34679985,0.0029515454,0.5595321,0.08933645,0.000043159915],"about_ca_topic_score_codex":0.0011385091,"about_ca_topic_score_gemma":0.00084195856,"teacher_disagreement_score":0.0056956853,"about_ca_system_score_codex":0.0013596144,"about_ca_system_score_gemma":0.0021884139,"threshold_uncertainty_score":0.030122042},"labels":[],"label_agreement":null},{"id":"W2519275224","doi":"10.1109/nana.2016.88","title":"A Distributed Prioritized Multiple Access Scheme for Ad Hoc Networks Using Time-Frequency Hopping Communications","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Random access; Collision; Throughput; Channel (broadcasting); Transmission (telecommunications); Linear network coding; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.05234887144053181,"score_gpt":0.3097661296725792,"score_spread":0.2574172582320474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519275224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0206569,0.0011634346,0.97494894,0.00013186451,0.00017168009,0.00012696692,0.000040205974,0.0006004506,0.0021595526],"genre_scores_gemma":[0.7326831,0.0010262991,0.26241848,0.00021124152,0.00023230142,0.00032190417,0.00010921318,0.000025602467,0.0029718608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994653,0.00014458028,0.000029244633,0.00009595423,0.00021055533,0.00005450538],"domain_scores_gemma":[0.99948585,0.00016761813,0.000069665904,0.000071590075,0.00016179173,0.000043398806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069706456,0.0006900981,0.00048538155,0.0006415515,0.0007956969,0.00071587786,0.001087991,0.0004085265,0.0007929852],"category_scores_gemma":[0.0012950433,0.00019657772,0.00030991065,0.0005770936,0.00042980563,0.0009235435,0.0005775503,0.0005370616,0.00021954942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005024655,0.0003385638,0.0015985915,0.0006632511,0.00017551064,0.0007763932,0.0005074676,0.14811517,0.13774347,0.15155578,0.005946158,0.5520772],"study_design_scores_gemma":[0.00012034028,0.0006872124,0.0006738533,0.000022791806,0.00008621231,0.00085065945,0.00005012765,0.9582176,0.010393063,0.01668363,0.012156987,0.000057513305],"about_ca_topic_score_codex":0.0012898172,"about_ca_topic_score_gemma":0.0022423463,"teacher_disagreement_score":0.0012898172,"about_ca_system_score_codex":0.0006499116,"about_ca_system_score_gemma":0.0010027866,"threshold_uncertainty_score":0.0047155023},"labels":[],"label_agreement":null},{"id":"W2519619947","doi":"10.1109/wispnet.2016.7566500","title":"Detection of single and collaborative black hole attack in MANET","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de Recherche du Québec - Santé","keywords":"Packet drop attack; Computer science; Computer network; Ad hoc On-Demand Distance Vector Routing; Dynamic Source Routing; Routing protocol; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Network packet; Link-state routing protocol; Computer security","score_opus":0.013805396219179247,"score_gpt":0.23392021454083198,"score_spread":0.22011481832165272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519619947","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50521904,0.0009963666,0.48707768,0.00027969986,0.00020864006,0.00019703888,0.00013419852,0.0010099591,0.004877394],"genre_scores_gemma":[0.9754283,0.00020720634,0.023520978,0.000044137898,0.000029443876,0.000036509304,0.00006684713,0.000011714914,0.00065499044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.0002884646,0.000087075416,0.00025518163,0.0006069989,0.0001557097],"domain_scores_gemma":[0.99692446,0.0012037209,0.0007080415,0.00044522475,0.0005484867,0.0001700324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007902522,0.00044666775,0.0008922907,0.001184922,0.00053231505,0.00067483017,0.00079839205,0.0009425522,0.00025481393],"category_scores_gemma":[0.004246952,0.00024809522,0.00034666053,0.0006426965,0.00041816858,0.001290273,0.0010526357,0.00046753546,0.00016394672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018267537,0.0006147882,0.088783816,0.00064803055,0.00067039026,0.006547152,0.0014301038,0.22346148,0.18304813,0.027023688,0.005638239,0.46030745],"study_design_scores_gemma":[0.0000344943,0.0005044657,0.009495721,0.000026904001,0.00007718023,0.004612714,0.00029672164,0.9386777,0.038831707,0.0050898097,0.0022925187,0.00006009639],"about_ca_topic_score_codex":0.0003564694,"about_ca_topic_score_gemma":0.00036273495,"teacher_disagreement_score":0.001184922,"about_ca_system_score_codex":0.00024168563,"about_ca_system_score_gemma":0.00033332768,"threshold_uncertainty_score":0.004179299},"labels":[],"label_agreement":null},{"id":"W2527067261","doi":"10.1109/ficloud.2016.36","title":"Hello-Based Link Failure Detection Analysis in Wireless Mesh Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Backup; Link (geometry); Computer network; Network packet; Wireless mesh network; Reliability (semiconductor); Routing (electronic design automation); Wireless network; Routing protocol; Link state packet; Wireless; Distributed computing; Telecommunications; Transmission delay","score_opus":0.006562391381350232,"score_gpt":0.209414164784356,"score_spread":0.20285177340300578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2527067261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023924991,0.0008358068,0.9710734,0.0003071149,0.00006602028,0.000041234885,0.000034376073,0.00013515525,0.0035818627],"genre_scores_gemma":[0.91380036,0.0021867955,0.07822296,0.00019746312,0.00026323032,0.00019838008,0.00011991006,0.000107497144,0.0049034026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990729,0.00035429292,0.000034867186,0.00008756069,0.00037039534,0.00007996645],"domain_scores_gemma":[0.99625045,0.0027786049,0.00036251836,0.00015780258,0.00037389772,0.00007685141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020724148,0.0006596228,0.0005355477,0.0019003458,0.00045860876,0.00096631737,0.0011349136,0.0006043366,0.0010848535],"category_scores_gemma":[0.009211276,0.00035011352,0.00070738647,0.00069576234,0.0014176429,0.0025281732,0.0008899778,0.0011134658,0.00017258603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004731576,0.000038896018,0.0009279043,0.00009179881,0.00004304366,0.00009147511,0.00012523143,0.8407329,0.0029627667,0.13566884,0.001073994,0.018195938],"study_design_scores_gemma":[0.0000015208523,0.000009598434,0.00009431226,0.0000056653503,0.0000054527945,0.000011666313,0.000008992231,0.9818979,0.0001957568,0.01754547,0.00021810461,0.0000055579394],"about_ca_topic_score_codex":0.0027122884,"about_ca_topic_score_gemma":0.0012158222,"teacher_disagreement_score":0.0027122884,"about_ca_system_score_codex":0.0014715083,"about_ca_system_score_gemma":0.00076265103,"threshold_uncertainty_score":0.010960102},"labels":[],"label_agreement":null},{"id":"W2531951903","doi":"10.1002/9780470579398.ch16","title":"MANET Routing Security","year":2010,"lang":"en","type":"other","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Routing (electronic design automation); Network packet","score_opus":0.0063778796415949034,"score_gpt":0.22045681174831522,"score_spread":0.21407893210672033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531951903","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044390745,0.04378459,0.198664,0.008646567,0.009658168,0.00062919967,0.001400891,0.003310785,0.7294667],"genre_scores_gemma":[0.049423438,0.100578,0.0691276,0.002353722,0.0051689204,0.0005125828,0.0038376674,0.0010226057,0.76797545],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994023,0.00008222535,0.000029511632,0.00008605891,0.0003514485,0.0000483852],"domain_scores_gemma":[0.9995183,0.000116336,0.000025739317,0.00016119755,0.00014958794,0.000028936898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061192294,0.0009141698,0.00044410722,0.001499952,0.0007619667,0.0025024286,0.00086424826,0.0009619371,0.04802411],"category_scores_gemma":[0.0012547582,0.00046009335,0.00041516198,0.0016694433,0.0004877616,0.0032896244,0.0014722014,0.0017239504,0.02553259],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005318337,0.00008784953,0.00015913397,0.00062538666,0.000022728302,0.00012600711,0.00016284404,0.0045913393,0.0065206042,0.2118629,0.21803707,0.55775106],"study_design_scores_gemma":[0.000007275583,0.000035344867,0.00014112704,0.00022288616,0.000018105307,0.00032428227,0.0000618772,0.004171799,0.0033107249,0.02997685,0.96171486,0.000014857695],"about_ca_topic_score_codex":0.00053192955,"about_ca_topic_score_gemma":0.0006867353,"teacher_disagreement_score":0.04802411,"about_ca_system_score_codex":0.00089018815,"about_ca_system_score_gemma":0.00082934776,"threshold_uncertainty_score":0.16065669},"labels":[],"label_agreement":null},{"id":"W2532984736","doi":"10.1109/ants.2009.5409863","title":"Channel Aware Routing Metric for IEEE 802.11 multi-channel Mesh Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Computer science; Metrics; Wireless mesh network; Metric (unit); Channel (broadcasting); Routing (electronic design automation); IEEE 802.11s; Mesh networking; Routing protocol; Distributed computing; Static routing; Wireless; Wireless network; Telecommunications; Engineering","score_opus":0.030006440071639245,"score_gpt":0.2660775485090789,"score_spread":0.23607110843743964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2532984736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031174986,0.0055904556,0.95316416,0.0007927418,0.00088206155,0.0003246079,0.00054645503,0.0012333699,0.0062911673],"genre_scores_gemma":[0.58850634,0.0020508843,0.403854,0.00028043092,0.00027518478,0.00070469675,0.001517553,0.00018339232,0.0026273837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984573,0.000618489,0.00013536154,0.000120081146,0.0006029089,0.00006590907],"domain_scores_gemma":[0.99809366,0.0006997065,0.00026337247,0.0001931317,0.00068570196,0.000064364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001469056,0.0006748121,0.0005065565,0.001303918,0.0005671789,0.00092214724,0.00089564803,0.00052649016,0.0009489395],"category_scores_gemma":[0.006580557,0.00014839436,0.0002792796,0.0010596602,0.0002417202,0.0015862181,0.0005628719,0.00060875755,0.00021768532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033194528,0.00014020801,0.0045582303,0.00094298326,0.00025039873,0.0001909511,0.00019921629,0.31445888,0.030994197,0.081851736,0.020900657,0.54518056],"study_design_scores_gemma":[0.00005053156,0.0006053223,0.0028484492,0.00006646309,0.000098723736,0.0004912504,0.00011017505,0.91412413,0.015273798,0.023264956,0.042958774,0.000107402804],"about_ca_topic_score_codex":0.0009836344,"about_ca_topic_score_gemma":0.0018564528,"teacher_disagreement_score":0.001469056,"about_ca_system_score_codex":0.000886515,"about_ca_system_score_gemma":0.0007733709,"threshold_uncertainty_score":0.007769227},"labels":[],"label_agreement":null},{"id":"W2533652399","doi":"10.20381/ruor-12912","title":"Routing algorithms for ad hoc wireless networks with a realistic physical layer","year":2006,"lang":"en","type":"article","venue":"uO Research (University of Ottawa)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Acknowledgement; Computer network; Interior gateway protocol; Routing protocol; Network packet; Node (physics); Distance-vector routing protocol; Wireless ad hoc network; Distributed computing; Algorithm; Link-state routing protocol; Wireless; Telecommunications; Engineering","score_opus":0.03970033886462388,"score_gpt":0.28850910700330806,"score_spread":0.2488087681386842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533652399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020327177,0.0008701482,0.9949568,0.00022314607,0.00007231597,0.000095208896,0.000032201737,0.00028802024,0.0014294762],"genre_scores_gemma":[0.057663783,0.0037607711,0.9340078,0.00014499438,0.000113932605,0.00045742208,0.0002446443,0.00011097625,0.0034957114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986739,0.000561169,0.00009694647,0.00012271157,0.00050082966,0.000044441105],"domain_scores_gemma":[0.99866843,0.00066518417,0.00012655462,0.00029187519,0.00022432308,0.000023704482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019593327,0.0007842417,0.0005748051,0.00049155223,0.0005969341,0.001742719,0.0016165837,0.0010327297,0.0019477532],"category_scores_gemma":[0.0072709513,0.0006220351,0.0006353862,0.000803629,0.00060369185,0.0032005522,0.0009492474,0.0014038527,0.0012582366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037509035,0.00007380253,0.0006075163,0.00045765753,0.000078040044,0.000099407116,0.0001735191,0.5519749,0.0054053185,0.1980043,0.006734178,0.23635384],"study_design_scores_gemma":[0.0000441142,0.000077572266,0.00017155854,0.00010029651,0.00003446887,0.00019058924,0.000058749727,0.8723467,0.0018719252,0.08562995,0.039449446,0.000024692405],"about_ca_topic_score_codex":0.00074920896,"about_ca_topic_score_gemma":0.0011077125,"teacher_disagreement_score":0.0019593327,"about_ca_system_score_codex":0.0008714242,"about_ca_system_score_gemma":0.0010960699,"threshold_uncertainty_score":0.010362089},"labels":[],"label_agreement":null},{"id":"W2539677917","doi":"10.1109/mahss.2004.1392205","title":"An optimal TDMA-based MAC scheduling for the minimum energy multicast in wireless ad hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Time division multiple access; Quality of service; Multicast; Distributed computing; Scheduling (production processes); Wireless; Mathematical optimization; Telecommunications","score_opus":0.013536488470847458,"score_gpt":0.25462572826726587,"score_spread":0.24108923979641841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539677917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019834619,0.0004302457,0.974835,0.00032663575,0.00014489674,0.0001183319,0.00006706455,0.0001564526,0.004086718],"genre_scores_gemma":[0.6183018,0.0005089738,0.37761757,0.00018500707,0.00015689892,0.00034888668,0.000105514824,0.00008902967,0.0026861965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994388,0.0002481119,0.000029097419,0.00007307239,0.000139448,0.00007152058],"domain_scores_gemma":[0.99923074,0.00044624452,0.00008349298,0.00004732101,0.00013652262,0.000055737357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013850373,0.0006687042,0.00074675056,0.0005900858,0.0008053408,0.00084266363,0.0009784703,0.00056538184,0.0018767776],"category_scores_gemma":[0.0032103062,0.00038483005,0.00036355227,0.00061004347,0.00051722117,0.0007696475,0.0005455904,0.0006212821,0.00026411167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002496954,0.00014169507,0.00037952777,0.00016249076,0.0000452182,0.00008468878,0.0001354844,0.8663035,0.0062977266,0.04672998,0.004435221,0.07503481],"study_design_scores_gemma":[0.000019345704,0.00003765458,0.000044928664,0.0000058017913,0.0000061742076,0.0000107914275,0.000010935807,0.99491525,0.00049038755,0.0037726685,0.0006818754,0.000004119959],"about_ca_topic_score_codex":0.002726262,"about_ca_topic_score_gemma":0.0036161405,"teacher_disagreement_score":0.002726262,"about_ca_system_score_codex":0.0012535129,"about_ca_system_score_gemma":0.0019936222,"threshold_uncertainty_score":0.009094954},"labels":[],"label_agreement":null},{"id":"W2540034369","doi":"10.7939/r3-vzyf-jn11","title":"A controlled flooding approach to efficient routing in ad-hoc wireless networks","year":2006,"lang":"en","type":"article","venue":"University of Alberta Library","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer network; Computer science; Flooding (psychology); Wireless ad hoc network; Optimized Link State Routing Protocol; Distributed computing; Routing protocol; Wireless Routing Protocol; Link-state routing protocol; Network packet; Wireless; Telecommunications","score_opus":0.004810543354341957,"score_gpt":0.15785674496890126,"score_spread":0.1530462016145593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540034369","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011943494,0.0030059044,0.987028,0.00089367916,0.00023626092,0.00015155114,0.000025824664,0.00020454012,0.0072599603],"genre_scores_gemma":[0.12036397,0.017751906,0.8388386,0.0010626481,0.0011844842,0.0011623421,0.00014289645,0.00019315052,0.01929997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986119,0.00049771153,0.000083800136,0.00015946817,0.0005867645,0.000060295224],"domain_scores_gemma":[0.99921405,0.0004325651,0.000058734197,0.0001434259,0.00011758412,0.000033610017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014640697,0.0009680557,0.0007817392,0.0012010587,0.0009976152,0.0018137887,0.002044846,0.0015200466,0.0022806537],"category_scores_gemma":[0.0029949027,0.0007101044,0.0010143636,0.0017283395,0.0029153759,0.0034480237,0.0017818172,0.0025929394,0.00073570985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029362069,0.000042196545,0.00013074206,0.00036813205,0.00005687368,0.000154929,0.00043231226,0.06588466,0.0054247775,0.8349749,0.0063645993,0.08613637],"study_design_scores_gemma":[0.00007936382,0.00022024535,0.00014241035,0.00019341393,0.000068255176,0.00042705284,0.00014319656,0.26031458,0.0040981923,0.5384364,0.19579938,0.000077570476],"about_ca_topic_score_codex":0.0009791547,"about_ca_topic_score_gemma":0.0010674492,"teacher_disagreement_score":0.0022806537,"about_ca_system_score_codex":0.0010629345,"about_ca_system_score_gemma":0.0011359552,"threshold_uncertainty_score":0.007742822},"labels":[],"label_agreement":null},{"id":"W2540809141","doi":"10.1109/icccas.2002.1180650","title":"SRL-Enabled QoS model for mobile ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Mobile ad hoc network; Wireless ad hoc network; Computer network; Quality of service; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Optimized Link State Routing Protocol; Telecommunications; Wireless","score_opus":0.015736290487288866,"score_gpt":0.2386984808035368,"score_spread":0.22296219031624795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2540809141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005906641,0.00044853773,0.98471314,0.0005432933,0.00014121755,0.00006698337,0.00011120249,0.0006927089,0.0073762354],"genre_scores_gemma":[0.45251504,0.002224747,0.5269084,0.0007247045,0.0004216828,0.0007793853,0.00063921534,0.00023774114,0.015549056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928445,0.00022351516,0.000046236735,0.00008645973,0.00029569832,0.00006370619],"domain_scores_gemma":[0.99932194,0.00022749673,0.000074795935,0.000126089,0.00020230604,0.00004739059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010056099,0.0006283398,0.00037887786,0.0005240748,0.00039449023,0.001032625,0.0015212122,0.00087446475,0.00128629],"category_scores_gemma":[0.0017343409,0.0002488455,0.00048344335,0.00044236184,0.00064090616,0.0019757845,0.00077206496,0.0012216701,0.00109733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009558439,0.00009642957,0.0005176965,0.00018180555,0.000033007196,0.00045472567,0.00025474856,0.49340975,0.01342241,0.41707012,0.0051499587,0.06931375],"study_design_scores_gemma":[0.0000147371575,0.000047533944,0.000046398865,0.000010414105,0.0000085714255,0.000083108614,0.000017119106,0.9508799,0.0008753546,0.037501678,0.01050377,0.000011453681],"about_ca_topic_score_codex":0.0016856373,"about_ca_topic_score_gemma":0.0016344329,"teacher_disagreement_score":0.0016856373,"about_ca_system_score_codex":0.0010015478,"about_ca_system_score_gemma":0.0010314843,"threshold_uncertainty_score":0.0072668195},"labels":[],"label_agreement":null},{"id":"W2544446217","doi":"10.1109/micc.2009.5431435","title":"Routing based on link expiration time for MANET performance improvement","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Expiration; Expiration date; Computer network; Mobile ad hoc network; Routing (electronic design automation); Link (geometry); Distributed computing; Medicine; Network packet","score_opus":0.009801292917934188,"score_gpt":0.22064348870063677,"score_spread":0.21084219578270258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544446217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19967094,0.008778313,0.77948207,0.0007678071,0.00030945105,0.00014507055,0.0001972521,0.004617593,0.0060315295],"genre_scores_gemma":[0.9172411,0.0017765822,0.079349205,0.00007548343,0.0001105328,0.00008964366,0.000171746,0.00010501126,0.0010807852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990208,0.00039106747,0.000057301233,0.000119675264,0.0003407945,0.00007033923],"domain_scores_gemma":[0.99572384,0.002399503,0.0006685218,0.0006159628,0.0004999105,0.000092198876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020753043,0.000678374,0.0006503685,0.0010629978,0.00043882715,0.00072538207,0.00085759873,0.00047611768,0.000849973],"category_scores_gemma":[0.00821381,0.00021047187,0.00023769918,0.0011670447,0.00031503,0.0012439911,0.00051023846,0.00066904404,0.0003025456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007075335,0.00021191468,0.008251285,0.00029460018,0.000112157766,0.00030358124,0.00016313134,0.59405667,0.043939903,0.011185142,0.0026179042,0.33815628],"study_design_scores_gemma":[0.00001610166,0.0003150639,0.0018607874,0.000019610328,0.000042070904,0.00023688583,0.000021753802,0.9849675,0.0077847773,0.0027450975,0.0019531269,0.000037046902],"about_ca_topic_score_codex":0.0008094022,"about_ca_topic_score_gemma":0.0007697274,"teacher_disagreement_score":0.0020753043,"about_ca_system_score_codex":0.00042483985,"about_ca_system_score_gemma":0.0004710942,"threshold_uncertainty_score":0.010975361},"labels":[],"label_agreement":null},{"id":"W2545304477","doi":"10.1109/tic-sth.2009.5444393","title":"A review of cross-layer scheduling and resource allocation for wireless mesh networks","year":2009,"lang":"en","type":"review","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Protocol stack; Wireless mesh network; Wireless network; Computer network; Wireless; Wireless sensor network; Telecommunications; Mathematical optimization","score_opus":0.04570845871821674,"score_gpt":0.3449843593134288,"score_spread":0.29927590059521203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545304477","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004019785,0.980995,0.011838509,0.00058269454,0.00067637145,0.000034258454,0.000047920792,0.00005192509,0.0053712986],"genre_scores_gemma":[0.0027090055,0.98392546,0.0100944955,0.00029623104,0.0006274387,0.000046774192,0.0000977733,0.000013903897,0.0021889228],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938476,0.000117106734,0.000101603684,0.00008290674,0.00027267836,0.00004093463],"domain_scores_gemma":[0.99887997,0.00055258546,0.0001291525,0.000040900613,0.00035787534,0.00003949002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001230139,0.0011644972,0.0013415708,0.0022180215,0.00047073443,0.00097624434,0.0015528972,0.001391199,0.0038290443],"category_scores_gemma":[0.0023999528,0.00060666865,0.0005974797,0.0039818087,0.000441949,0.0019810505,0.00065530307,0.0010351539,0.002695179],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004519215,0.0000696721,0.00023446644,0.0118295485,0.00007613709,0.0001857377,0.00008264099,0.004376535,0.001798598,0.013506,0.026804311,0.9409913],"study_design_scores_gemma":[0.000012932097,0.00014224472,0.0005972495,0.0037040976,0.00010554503,0.00096489995,0.00007480367,0.0020137983,0.0012945776,0.0073568523,0.9836886,0.00004442766],"about_ca_topic_score_codex":0.0023168062,"about_ca_topic_score_gemma":0.002388687,"teacher_disagreement_score":0.0038290443,"about_ca_system_score_codex":0.00095055555,"about_ca_system_score_gemma":0.0019025954,"threshold_uncertainty_score":0.012809396},"labels":[],"label_agreement":null},{"id":"W2548366617","doi":"10.1109/ccece.2016.7726639","title":"On TDMA scheduling in wireless sensor networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Time division multiple access; Computer science; Scheduling (production processes); Heuristics; Wireless sensor network; Computer network; Distributed computing; Tree (set theory); Schedule; Real-time computing; Mathematical optimization; Mathematics","score_opus":0.01124231694981029,"score_gpt":0.2276824321101232,"score_spread":0.21644011516031292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548366617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03905072,0.003132175,0.9521063,0.00037086473,0.00020643069,0.000095625284,0.0000412384,0.00016310136,0.0048335823],"genre_scores_gemma":[0.6527536,0.007095587,0.33597246,0.00019310221,0.0004883015,0.00021741875,0.000103051505,0.00013122543,0.003045327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990495,0.00053253135,0.00004219507,0.00008876734,0.00020282279,0.0000842546],"domain_scores_gemma":[0.99718875,0.0023322913,0.00013323307,0.00012607219,0.0001631833,0.00005637335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015554862,0.0007399984,0.00066837645,0.0007107899,0.00060552574,0.00075569365,0.0006771626,0.00054076617,0.00086155924],"category_scores_gemma":[0.0049194684,0.00027722152,0.00036393982,0.0015780298,0.00078574865,0.0014495573,0.0004872536,0.0006746469,0.00016949947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014452603,0.00006002495,0.0006228748,0.00014540835,0.000038539223,0.000072099625,0.00008751721,0.891946,0.0024840878,0.040777136,0.0011509962,0.06247079],"study_design_scores_gemma":[0.000014145116,0.00007746883,0.000089317735,0.000009368862,0.000009274081,0.00002604026,0.000023999159,0.98125184,0.00077376503,0.016275799,0.0014435822,0.0000053586195],"about_ca_topic_score_codex":0.0037741547,"about_ca_topic_score_gemma":0.0031114728,"teacher_disagreement_score":0.0037741547,"about_ca_system_score_codex":0.0009167294,"about_ca_system_score_gemma":0.00094685727,"threshold_uncertainty_score":0.008226275},"labels":[],"label_agreement":null},{"id":"W2548425253","doi":"10.1109/ants.2013.6802890","title":"Reliability analytical measurement to design Wireless Mesh Networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Reliability (semiconductor); Wireless mesh network; Computer network; Quality of service; Reliability engineering; Routing (electronic design automation); Multipath routing; Wireless; Multipath propagation; Node (physics); Wireless network; Distributed computing; Routing protocol; Channel (broadcasting); Dynamic Source Routing; Engineering","score_opus":0.034734916611837904,"score_gpt":0.24256365666063048,"score_spread":0.2078287400487926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548425253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047908123,0.00079851283,0.9899067,0.00015649956,0.000056811186,0.00004638802,0.000029597586,0.00024202144,0.0039725993],"genre_scores_gemma":[0.5935699,0.0026133202,0.4002493,0.00015952307,0.00023537574,0.00040997364,0.00014902091,0.00024329212,0.0023703345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983694,0.00073875027,0.0000737793,0.00012960704,0.00058812095,0.00010032291],"domain_scores_gemma":[0.9959435,0.0024219444,0.0004494772,0.0003982797,0.0007268269,0.00005999428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002746308,0.0011918594,0.0005642844,0.0013523141,0.0002648038,0.0008499941,0.0012725053,0.00064143597,0.0010581445],"category_scores_gemma":[0.011893955,0.0005170999,0.00063004164,0.000695657,0.0008661601,0.0016697119,0.00084326207,0.0012791065,0.00029429083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002221578,0.000042986314,0.00047128837,0.00018007391,0.000029909912,0.000033596272,0.00006665073,0.86826396,0.0043415762,0.0920371,0.0009002682,0.033610392],"study_design_scores_gemma":[0.0000033154981,0.000044705732,0.00012097018,0.000035133664,0.000009952506,0.00002662385,0.000016312812,0.9693717,0.0018332147,0.026066884,0.0024627463,0.0000084429175],"about_ca_topic_score_codex":0.0011442014,"about_ca_topic_score_gemma":0.0006403542,"teacher_disagreement_score":0.002746308,"about_ca_system_score_codex":0.0016508979,"about_ca_system_score_gemma":0.0010013984,"threshold_uncertainty_score":0.014524043},"labels":[],"label_agreement":null},{"id":"W2561337605","doi":"10.1109/cisis.2016.55","title":"Investigation of Fitness Function Weight-Coefficients for Optimization in WMN-PSO Simulation System","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science","keywords":"Wireless mesh network; Computer science; Particle swarm optimization; Giant component; Node (physics); Wireless; Computer network; Wireless network; Fitness function; Distributed computing; Algorithm; Machine learning; Engineering; Genetic algorithm; Theoretical computer science; Telecommunications; Structural engineering","score_opus":0.017694473033420324,"score_gpt":0.22857634531702933,"score_spread":0.210881872283609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561337605","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62812144,0.0008319256,0.3544858,0.00060320465,0.00014225085,0.00019768682,0.00022921994,0.0008944034,0.014494132],"genre_scores_gemma":[0.96712697,0.00018111644,0.031637948,0.000037258193,0.000008542033,0.00013824455,0.00010657689,0.000047144335,0.00071613403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995327,0.00020889183,0.000029114308,0.00005185432,0.00010609064,0.000071482435],"domain_scores_gemma":[0.9983246,0.001057373,0.00012378932,0.00007926808,0.00036109533,0.00005392957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014716001,0.0007005569,0.0006289443,0.00076014164,0.00048882345,0.000688715,0.00072123966,0.00082892587,0.0011774775],"category_scores_gemma":[0.004956861,0.00026388184,0.0004685853,0.0005840704,0.00033013258,0.0006744325,0.00051821553,0.0006182533,0.00012153806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041130203,0.00004475935,0.0029058382,0.000057548044,0.000024719731,0.000045536282,0.000049729075,0.9850727,0.0010795431,0.0015491027,0.00026005576,0.008869349],"study_design_scores_gemma":[0.0000051807906,0.000017816757,0.00027596782,0.000004100704,0.0000046170003,0.000005043293,0.0000084806725,0.99910814,0.00034787442,0.0001309126,0.00008915161,0.0000027249503],"about_ca_topic_score_codex":0.010680575,"about_ca_topic_score_gemma":0.0048619946,"teacher_disagreement_score":0.010680575,"about_ca_system_score_codex":0.0005754105,"about_ca_system_score_gemma":0.00072244805,"threshold_uncertainty_score":0.021236837},"labels":[],"label_agreement":null},{"id":"W2561388393","doi":"10.1007/978-3-319-51204-4_27","title":"A Gateway Prototype for Coalition Tactical MANETs","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer network; Interoperability; Computer science; Mobile ad hoc network; Network packet; World Wide Web","score_opus":0.023278185196115558,"score_gpt":0.24784840719981782,"score_spread":0.22457022200370227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561388393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11906475,0.0007208254,0.69091403,0.00060535927,0.0008638537,0.0013086726,0.0009846785,0.11477197,0.07076581],"genre_scores_gemma":[0.5369913,0.0006820953,0.3855387,0.0006020555,0.00009431898,0.0006146031,0.0036346219,0.00543474,0.06640756],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979097,0.000037743495,0.000015254113,0.00003763358,0.000078984725,0.000039435407],"domain_scores_gemma":[0.9997385,0.000050885323,0.00000943607,0.00008474552,0.000045147077,0.00007130098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039642907,0.0005243056,0.00043604273,0.00035933938,0.00030219136,0.00097093475,0.0020649927,0.00076995965,0.013313592],"category_scores_gemma":[0.00082733936,0.0003836495,0.00029017136,0.00027830678,0.0002818787,0.0012190418,0.0016037814,0.0008648868,0.0036971977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024332574,0.0013710995,0.0036049513,0.001286855,0.00027871877,0.0025246174,0.002263728,0.034742188,0.21641602,0.06013303,0.14291222,0.53203326],"study_design_scores_gemma":[0.000984691,0.0015996591,0.0029981826,0.00023172215,0.00024846883,0.00203398,0.0008043177,0.41283917,0.15484159,0.027157117,0.39610472,0.00015635235],"about_ca_topic_score_codex":0.00091859914,"about_ca_topic_score_gemma":0.0012296442,"teacher_disagreement_score":0.013313592,"about_ca_system_score_codex":0.00020231241,"about_ca_system_score_gemma":0.0003854838,"threshold_uncertainty_score":0.04453838},"labels":[],"label_agreement":null},{"id":"W2563330281","doi":"10.1109/cisis.2016.86","title":"Experimental Results of a Raspberry Pi Based Wireless Mesh Network Testbed Considering TCP and LoS Scenario","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Testbed; Computer network; Computer science; Wireless mesh network; Jitter; Routing protocol; Transmission Control Protocol; Throughput; Wireless network; Distributed computing; Wireless; Routing (electronic design automation); Network packet; Operating system; Telecommunications","score_opus":0.016450940975915256,"score_gpt":0.23672545300857956,"score_spread":0.2202745120326643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2563330281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96895,0.00017680226,0.025251625,0.0001502099,0.00010492983,0.00014053595,0.0008664191,0.0010708326,0.0032887114],"genre_scores_gemma":[0.9841412,0.000108378954,0.013916956,0.000021437421,0.0000069365333,0.00010550017,0.00068810896,0.00004343743,0.0009680627],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99951005,0.0001595081,0.00004872616,0.000073848816,0.00012930129,0.00007859171],"domain_scores_gemma":[0.9986131,0.00050523767,0.00018265813,0.00017129141,0.00031631367,0.00021140152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089520996,0.00055037654,0.0004724406,0.0004505266,0.00048617684,0.0002956951,0.000754616,0.00053782796,0.0018008498],"category_scores_gemma":[0.001026478,0.00013977262,0.00023683411,0.0004408695,0.000360872,0.00047439753,0.0003617278,0.00029109797,0.00027579322],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026249767,0.0025455686,0.0107536055,0.00076208025,0.00016818597,0.0019764039,0.00046340175,0.17734027,0.7630378,0.0017056022,0.003376867,0.03524521],"study_design_scores_gemma":[0.0003500547,0.011630379,0.03403141,0.00007892032,0.00023683604,0.00080414437,0.00066093606,0.45321843,0.49169168,0.0014243975,0.0057606543,0.00011217032],"about_ca_topic_score_codex":0.0009460787,"about_ca_topic_score_gemma":0.0011804827,"teacher_disagreement_score":0.0018008498,"about_ca_system_score_codex":0.00027336413,"about_ca_system_score_gemma":0.00016251465,"threshold_uncertainty_score":0.0060244203},"labels":[],"label_agreement":null},{"id":"W2565401572","doi":"10.1109/uemcon.2016.7777921","title":"Evaluation of channel switching overhead for multicast communications in wireless mesh networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer network; Multicast; Computer science; Wireless mesh network; Jitter; Overhead (engineering); Source-specific multicast; Channel (broadcasting); Throughput; Protocol Independent Multicast; Wireless network; Wireless; Telecommunications","score_opus":0.06713697351418098,"score_gpt":0.32859465130885956,"score_spread":0.2614576777946786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565401572","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96193784,0.0009397256,0.03388697,0.0001547049,0.000046685233,0.00006603109,0.00008258107,0.00022087325,0.0026645157],"genre_scores_gemma":[0.99690944,0.00011181209,0.0028294749,0.000008255895,0.000007676724,0.000009871284,0.00002392119,0.000012827887,0.00008672811],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984969,0.0006887288,0.000069669484,0.00007729778,0.00047820684,0.00018921682],"domain_scores_gemma":[0.98258567,0.014852058,0.00093020406,0.0005491809,0.0008907369,0.00019220119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001955452,0.00067080744,0.0005249427,0.00082878885,0.00047192595,0.0005181489,0.0007215116,0.000527051,0.0005043843],"category_scores_gemma":[0.011698698,0.00019752147,0.00027306168,0.00077589066,0.00039859724,0.00097301847,0.00036169658,0.0004742556,0.000038812526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050261006,0.00022345618,0.004865414,0.00009633755,0.000055008288,0.000084645595,0.000045632318,0.9632792,0.013421245,0.00096246734,0.00015566272,0.01630829],"study_design_scores_gemma":[0.000011977505,0.00028031738,0.0010618801,0.000006288444,0.000026787475,0.00003287847,0.000016166096,0.99338853,0.0048766294,0.00020881006,0.00008267317,0.000007089044],"about_ca_topic_score_codex":0.0027225201,"about_ca_topic_score_gemma":0.0019671267,"teacher_disagreement_score":0.0027225201,"about_ca_system_score_codex":0.001458141,"about_ca_system_score_gemma":0.00065084104,"threshold_uncertainty_score":0.010579586},"labels":[],"label_agreement":null},{"id":"W2566502855","doi":"10.1109/nbis.2016.31","title":"Node Placement in Wireless Mesh Networks: A Comparison Study of WMN-SA and WMN-PSO Simulation Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Japan Society for the Promotion of Science","keywords":"Wireless mesh network; Computer science; Simulated annealing; Computer network; Order One Network Protocol; Mesh networking; Particle swarm optimization; Node (physics); Distributed computing; Wireless network; Wireless; Algorithm; Engineering; Telecommunications","score_opus":0.02140154466910168,"score_gpt":0.27468871356829433,"score_spread":0.25328716889919267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566502855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39226967,0.0033563664,0.58440727,0.0008185566,0.00035962157,0.0002247428,0.00023478613,0.0011884724,0.017140536],"genre_scores_gemma":[0.89887345,0.0010827462,0.09849999,0.000066043656,0.00004587984,0.00011218324,0.00018849755,0.000104535866,0.0010267678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987111,0.00071514293,0.00008209235,0.0001336628,0.00027950728,0.00007835519],"domain_scores_gemma":[0.99463356,0.0037506514,0.00031501256,0.00037433507,0.0008074703,0.00011895373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025253273,0.00061193405,0.0007839309,0.0010771906,0.00053028174,0.00081533566,0.0009324619,0.00083010434,0.001160429],"category_scores_gemma":[0.008527148,0.00035095197,0.00065661594,0.0014243142,0.00039864169,0.0016273134,0.0006031282,0.00050764065,0.00016839245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018065992,0.000093629,0.0040206634,0.00017497556,0.00009660368,0.000048514597,0.00009948333,0.9486514,0.0011324795,0.0045062928,0.0005583839,0.040436894],"study_design_scores_gemma":[0.000008055747,0.00006760534,0.00036660463,0.0000072143166,0.000012961891,0.000014918149,0.00002328157,0.9983156,0.00039634574,0.0004050066,0.00037812453,0.0000043320574],"about_ca_topic_score_codex":0.0076360507,"about_ca_topic_score_gemma":0.00517101,"teacher_disagreement_score":0.0076360507,"about_ca_system_score_codex":0.000865578,"about_ca_system_score_gemma":0.00067615305,"threshold_uncertainty_score":0.01518321},"labels":[],"label_agreement":null},{"id":"W2571084045","doi":"10.1007/s11235-016-0268-x","title":"Neighbor discovery and routing schemes for mobile ad-hoc networks with beamwidth adaptive smart antennas","year":2017,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Neighbor Discovery Protocol; Beamwidth; Wireless ad hoc network; Node (physics); Distributed computing; Directional antenna; Topology control; Geographic routing; Throughput; Routing protocol; Adaptive quality of service multi-hop routing; Routing (electronic design automation); Dynamic Source Routing; Wireless; Wireless network; Telecommunications; The Internet; Key distribution in wireless sensor networks","score_opus":0.023712279909021822,"score_gpt":0.2625323440612145,"score_spread":0.23882006415219267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571084045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06981829,0.0017107154,0.9241059,0.00037471426,0.00022620767,0.00015063737,0.0000598929,0.00039286236,0.0031607517],"genre_scores_gemma":[0.7748534,0.0009035721,0.21976884,0.00012628478,0.000118218406,0.0001368135,0.00013830072,0.00003486773,0.0039195814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993629,0.00022477558,0.00005109271,0.00007715248,0.00020524175,0.00007885287],"domain_scores_gemma":[0.99824584,0.0008286097,0.00018062245,0.0003312702,0.0003471629,0.0000665268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015298934,0.00035577881,0.0006275175,0.0009449589,0.0009493084,0.00071322965,0.001323935,0.0006209645,0.0007793304],"category_scores_gemma":[0.0033762853,0.00033729174,0.00030175116,0.000813441,0.00064684503,0.0013758707,0.0009612262,0.0006641624,0.00022404607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010053901,0.00025552075,0.0026365048,0.0002875419,0.00017308306,0.00022625907,0.00070527795,0.4065122,0.04671271,0.1053911,0.004487885,0.4316065],"study_design_scores_gemma":[0.00008873399,0.00030892092,0.0005694413,0.000018104056,0.00008292724,0.0002806519,0.00014587771,0.96782,0.0074161887,0.019265287,0.0039651124,0.00003870786],"about_ca_topic_score_codex":0.0014486795,"about_ca_topic_score_gemma":0.0035430507,"teacher_disagreement_score":0.0015298934,"about_ca_system_score_codex":0.0006895816,"about_ca_system_score_gemma":0.0005509815,"threshold_uncertainty_score":0.008090913},"labels":[],"label_agreement":null},{"id":"W2572729042","doi":"10.1109/mass.2016.040","title":"PASOR: A Packet Salvaging Model for Opportunistic Routing Protocols","year":2016,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Network packet; Routing protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.0648899664997507,"score_gpt":0.3071319798648766,"score_spread":0.2422420133651259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2572729042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019114872,0.00037695706,0.9718617,0.00035851687,0.0001189644,0.000150686,0.0002502803,0.0003969968,0.0073709865],"genre_scores_gemma":[0.8461741,0.001377955,0.13585858,0.00026491337,0.00016706857,0.0006496673,0.0004251948,0.00013862563,0.014943966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993451,0.00022249871,0.000035503366,0.00009888596,0.00019704136,0.00010093205],"domain_scores_gemma":[0.9991652,0.00041074632,0.00013142734,0.000095103795,0.000150513,0.000047053843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009554274,0.000757773,0.00069771655,0.000716474,0.00062186026,0.0010707363,0.0020640367,0.00096811063,0.0018657455],"category_scores_gemma":[0.0023231779,0.0003280434,0.0008114185,0.00074273604,0.0006978306,0.0016654895,0.00095671584,0.0011238898,0.0003887828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009759812,0.00005312829,0.00065704866,0.00009635349,0.00004232256,0.000273209,0.00013146996,0.86857086,0.003577378,0.10876425,0.0020917507,0.015644608],"study_design_scores_gemma":[0.0000056043905,0.00003087481,0.00005154965,0.0000046906175,0.000011460422,0.0000455893,0.000012143235,0.99057734,0.00027501577,0.0076082344,0.0013706379,0.0000068326226],"about_ca_topic_score_codex":0.0040022335,"about_ca_topic_score_gemma":0.0035544625,"teacher_disagreement_score":0.0040022335,"about_ca_system_score_codex":0.00095975195,"about_ca_system_score_gemma":0.0011695242,"threshold_uncertainty_score":0.007957876},"labels":[],"label_agreement":null},{"id":"W2590681617","doi":"10.1109/sensorcomm.2007.4394946","title":"Hierarchical Geographic Multicast Routing for Wireless Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Royal Society; National Science Foundation","keywords":"Computer science; Computer network; Multicast; Protocol Independent Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Xcast; Pragmatic General Multicast","score_opus":0.013706011113857377,"score_gpt":0.2546956230782407,"score_spread":0.2409896119643833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590681617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011973936,0.011996791,0.9576205,0.0022469983,0.00049637473,0.00017916741,0.00021195991,0.002020869,0.013253429],"genre_scores_gemma":[0.42862618,0.011514396,0.54894507,0.0005787871,0.0007761032,0.00047337203,0.0008152012,0.0001734631,0.008097499],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995777,0.00015844425,0.000017407,0.00003694866,0.00018075998,0.00002872985],"domain_scores_gemma":[0.99973136,0.000097827826,0.000038385264,0.000060324488,0.000056884353,0.000015194114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048583862,0.00036553375,0.00033673542,0.00054305256,0.00049345446,0.0005107647,0.0007778021,0.0006815393,0.0021056412],"category_scores_gemma":[0.0012823975,0.00015401538,0.00023662578,0.00090078777,0.000404223,0.0009804495,0.00070159516,0.00048790802,0.0006001745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009415661,0.00004653229,0.0007425021,0.0008154122,0.00006199109,0.00037211363,0.00021970384,0.16670376,0.016760381,0.23625712,0.03726442,0.540662],"study_design_scores_gemma":[0.00005815112,0.00015007179,0.0009261297,0.00010141029,0.000060039103,0.0005879959,0.000113736845,0.6017331,0.0048782085,0.21203591,0.17930673,0.000048545855],"about_ca_topic_score_codex":0.0012838544,"about_ca_topic_score_gemma":0.0016608397,"teacher_disagreement_score":0.0021056412,"about_ca_system_score_codex":0.00061260216,"about_ca_system_score_gemma":0.00051711395,"threshold_uncertainty_score":0.0070441365},"labels":[],"label_agreement":null},{"id":"W2592586851","doi":"10.1109/ccwc.2017.7868479","title":"Performance evaluation of VoIP calls over MANET for different voice codecs","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Voice over IP; Codec; Mean opinion score; Computer science; Jitter; Mobile ad hoc network; Packet loss; Computer network; Network packet; Quality of service; Telecommunications; The Internet; Engineering; Operating system","score_opus":0.04727663251046498,"score_gpt":0.31264485241492124,"score_spread":0.26536821990445625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592586851","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.992378,0.0006495501,0.004927148,0.00007136863,0.000041032912,0.000036751855,0.00011373762,0.00032105946,0.0014612209],"genre_scores_gemma":[0.99818856,0.00017869235,0.0010674946,0.00001978328,0.000013512991,0.000014618024,0.0001277655,0.000015002877,0.00037445078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987558,0.00032187076,0.000106082414,0.00012857266,0.00042920464,0.00025849827],"domain_scores_gemma":[0.9953715,0.00227679,0.00040868757,0.00019262884,0.0014709379,0.00027946619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015260391,0.00083049043,0.0007940109,0.0011688498,0.0005773283,0.0007909235,0.00048231217,0.000762327,0.0007127825],"category_scores_gemma":[0.0045366613,0.00012601136,0.00021458164,0.0007855424,0.00042943357,0.0005682595,0.00041029413,0.00043261828,0.00018099669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0113508925,0.0012586359,0.04705631,0.0010115685,0.00064771046,0.002102784,0.0007629893,0.49904725,0.2723159,0.0015184386,0.0018230614,0.16110437],"study_design_scores_gemma":[0.00016163751,0.009520175,0.05096546,0.00005568278,0.00036064105,0.001569346,0.0005704228,0.8239223,0.11111269,0.00045693442,0.0011358567,0.0001689463],"about_ca_topic_score_codex":0.0032590912,"about_ca_topic_score_gemma":0.002258625,"teacher_disagreement_score":0.0032590912,"about_ca_system_score_codex":0.0006934722,"about_ca_system_score_gemma":0.00038660888,"threshold_uncertainty_score":0.008070588},"labels":[],"label_agreement":null},{"id":"W2594889267","doi":"10.1109/jiot.2017.2679119","title":"Token-Based Adaptive MAC for a Two-Hop Internet-of-Things Enabled MANET","year":2017,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Security token; Time division multiple access; Mobile ad hoc network; Network packet; Wireless ad hoc network; Token passing; Media access control; Scalability; Node (physics); Distributed computing; Wireless","score_opus":0.025041588429813747,"score_gpt":0.27656670183738796,"score_spread":0.2515251134075742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594889267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013849957,0.00077608536,0.98334867,0.0001334178,0.0002226449,0.00006537881,0.000027193088,0.0003604542,0.0012163091],"genre_scores_gemma":[0.8418932,0.0009646236,0.15397595,0.00016751826,0.00012300076,0.00018603123,0.00006997467,0.000045941826,0.0025736901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00011646753,0.00003519603,0.000102036945,0.00012847793,0.0000635348],"domain_scores_gemma":[0.9993856,0.00024010343,0.00010001968,0.00007736171,0.00016531823,0.0000314788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609932,0.00057973823,0.0004765084,0.0005741324,0.00070250005,0.0007093651,0.0014082636,0.00052222086,0.0006146793],"category_scores_gemma":[0.0013987721,0.0001735511,0.00045088795,0.00053820485,0.0005701708,0.0011305603,0.0006167317,0.0007316916,0.00015811731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050718914,0.00023009758,0.0015540454,0.0007210213,0.00024051183,0.00096210046,0.00031809264,0.56276107,0.078398496,0.12035297,0.0050809756,0.22887349],"study_design_scores_gemma":[0.000012956442,0.00015207795,0.00018948928,0.000010254191,0.00004120998,0.00019982168,0.000027723436,0.9858366,0.003997938,0.0061703837,0.003334558,0.000026970141],"about_ca_topic_score_codex":0.0013469049,"about_ca_topic_score_gemma":0.0017979703,"teacher_disagreement_score":0.0014082636,"about_ca_system_score_codex":0.0006819909,"about_ca_system_score_gemma":0.00093703915,"threshold_uncertainty_score":0.0049482584},"labels":[],"label_agreement":null},{"id":"W2594910557","doi":"10.1109/ccwc.2017.7868487","title":"Scalability in mobile Ad hoc networks with Brownian mobility","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Abitibi-Témiscamingue","funders":"","keywords":"Computer network; Wireless ad hoc network; Computer science; Network packet; Mobile ad hoc network; Node (physics); Scalability; Network topology; Routing protocol; Optimized Link State Routing Protocol; Packet forwarding; Topology (electrical circuits); Distributed computing; Wireless; Mathematics; Telecommunications; Engineering","score_opus":0.010891584082965658,"score_gpt":0.24360671165719416,"score_spread":0.23271512757422852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594910557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26483732,0.016873023,0.6854919,0.005475108,0.0005137983,0.00023909977,0.0002658024,0.00045633188,0.02584762],"genre_scores_gemma":[0.97489613,0.0039305976,0.017576491,0.00018566342,0.00041212921,0.00014961418,0.000076322875,0.000057969046,0.0027150898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987405,0.000581305,0.00004673472,0.00014845113,0.00027393934,0.00020899317],"domain_scores_gemma":[0.99400216,0.004689963,0.00049912796,0.0001808853,0.00040043003,0.00022744383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020733066,0.00067739916,0.00075536635,0.0010794053,0.000788489,0.0012506769,0.0008829235,0.0009834564,0.0010232413],"category_scores_gemma":[0.009326656,0.00042079776,0.00061965256,0.0010230367,0.0016517248,0.0040794862,0.0014227269,0.0009679556,0.00017561039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014974311,0.00007939118,0.00602799,0.00044353158,0.00015966666,0.0010641388,0.0007165737,0.7522689,0.0064286445,0.19856812,0.003202067,0.030891191],"study_design_scores_gemma":[0.000015997517,0.00012405461,0.0012284623,0.000043502227,0.000035009536,0.00029219233,0.00023343487,0.9162538,0.00068664487,0.07875921,0.0022986531,0.000028939101],"about_ca_topic_score_codex":0.0016251843,"about_ca_topic_score_gemma":0.0007156122,"teacher_disagreement_score":0.0020733066,"about_ca_system_score_codex":0.00089194265,"about_ca_system_score_gemma":0.00042238165,"threshold_uncertainty_score":0.010964811},"labels":[],"label_agreement":null},{"id":"W2600811548","doi":"","title":"M2ANET Simulation in 3D in NS2","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science","score_opus":0.009928909789727746,"score_gpt":0.24127212429924752,"score_spread":0.23134321450951978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600811548","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14777128,0.0003425905,0.76991373,0.0010320267,0.0008938742,0.0006501914,0.009406418,0.02638554,0.043604437],"genre_scores_gemma":[0.7009767,0.0005053693,0.2730306,0.0004216307,0.00006410048,0.0015771765,0.008597494,0.0016067649,0.013220077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967885,0.00010012873,0.00002739305,0.000025381682,0.00012856722,0.000039655402],"domain_scores_gemma":[0.9992913,0.00030554083,0.00004703708,0.000090598754,0.00020687674,0.00005851805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062800874,0.00061331905,0.0005386716,0.00032496642,0.0005337595,0.00082046236,0.0014436418,0.0007521334,0.008102536],"category_scores_gemma":[0.0015149825,0.00036772992,0.00068050245,0.00044253346,0.00038524834,0.0006573554,0.00073152676,0.001064054,0.0011573215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020177824,0.00010987643,0.0022641427,0.00016931984,0.000078852485,0.00015305397,0.00015181165,0.9640171,0.0040136646,0.0072073676,0.009463612,0.012169458],"study_design_scores_gemma":[0.000042268646,0.00001933886,0.00020553067,0.000009290769,0.00000769621,0.00001815308,0.000022048844,0.9886359,0.002228519,0.0009792611,0.007818992,0.000013134438],"about_ca_topic_score_codex":0.01364277,"about_ca_topic_score_gemma":0.011791742,"teacher_disagreement_score":0.01364277,"about_ca_system_score_codex":0.0005054462,"about_ca_system_score_gemma":0.0010580553,"threshold_uncertainty_score":0.02712667},"labels":[],"label_agreement":null},{"id":"W2606140059","doi":"10.71781/10374","title":"Protocoles de routage pour les réseaux ad hoc","year":2004,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Political science; Humanities; Philosophy","score_opus":0.044980349763520486,"score_gpt":0.33666925126030683,"score_spread":0.29168890149678633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606140059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029361704,0.025190726,0.8255763,0.006228134,0.0033774213,0.0016141174,0.0018223176,0.0074399104,0.09938945],"genre_scores_gemma":[0.32458806,0.03240853,0.35743892,0.0011124227,0.002753237,0.0028548364,0.0032929536,0.0013178706,0.27423313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996585,0.0009323739,0.00021896459,0.00035857537,0.001602093,0.00030305306],"domain_scores_gemma":[0.99397707,0.0023495492,0.00022399059,0.001030767,0.0021063695,0.00031225503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043007922,0.0013930692,0.0014139883,0.0028314956,0.002074092,0.005447678,0.0025566076,0.001933395,0.018330729],"category_scores_gemma":[0.012472985,0.0008500589,0.00086911605,0.0021492776,0.0015210934,0.0045985496,0.001264696,0.0029282058,0.0045030755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008440106,0.00018243474,0.0011667801,0.0009252461,0.00012763306,0.00045061877,0.0010706651,0.036694262,0.010404896,0.5507107,0.06993671,0.32748607],"study_design_scores_gemma":[0.0006681381,0.0005374819,0.0026436213,0.00065458275,0.00016483509,0.0007177588,0.0006770721,0.22973105,0.027366847,0.090064175,0.64646834,0.00030608676],"about_ca_topic_score_codex":0.061463766,"about_ca_topic_score_gemma":0.038750485,"teacher_disagreement_score":0.061463766,"about_ca_system_score_codex":0.0066969227,"about_ca_system_score_gemma":0.00623356,"threshold_uncertainty_score":0.12221205},"labels":[],"label_agreement":null},{"id":"W2612436241","doi":"","title":"A hop-by-hop delay-constrained routing algorithm with explicit loop avoidance and backup routing information: Research Articles","year":2004,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Static routing; Distributed computing; Dynamic Source Routing; Link-state routing protocol; Equal-cost multi-path routing; Routing Information Protocol; Policy-based routing; Destination-Sequenced Distance Vector routing; Geographic routing; Path vector protocol; Routing table; Multipath routing; Backup; Source routing; Routing protocol; Routing (electronic design automation)","score_opus":0.02802959245960825,"score_gpt":0.29803457264663563,"score_spread":0.2700049801870274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612436241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018643513,0.0016792791,0.9746728,0.00029113365,0.00016803388,0.00015200126,0.00006858633,0.000798148,0.0035265177],"genre_scores_gemma":[0.28867745,0.0016273984,0.7005996,0.00022178076,0.00012932027,0.00023444806,0.00038477598,0.00013899877,0.007986197],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968076,0.00006999691,0.000024506591,0.000088607674,0.00010269245,0.000033387496],"domain_scores_gemma":[0.9996517,0.00013022243,0.000042749976,0.0000638167,0.0000875319,0.00002390749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039104462,0.00065142807,0.0007190518,0.0006417594,0.0005768913,0.0008420661,0.0013397984,0.00091699883,0.0026604268],"category_scores_gemma":[0.00095804845,0.00021867781,0.00035755936,0.0012977837,0.00042028783,0.0010747152,0.00057933666,0.0005761937,0.00065931916],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032598444,0.00023239263,0.0008511187,0.00038881286,0.00010891591,0.00013377711,0.00013653445,0.37977293,0.02588275,0.021731162,0.007638465,0.56279725],"study_design_scores_gemma":[0.000039102615,0.00009241666,0.00017128384,0.000019691153,0.000019142612,0.00014243765,0.000019198334,0.98218614,0.0038251376,0.005212119,0.00825528,0.00001809778],"about_ca_topic_score_codex":0.0029365765,"about_ca_topic_score_gemma":0.002263539,"teacher_disagreement_score":0.0029365765,"about_ca_system_score_codex":0.00060358795,"about_ca_system_score_gemma":0.001199634,"threshold_uncertainty_score":0.008899987},"labels":[],"label_agreement":null},{"id":"W2612807511","doi":"10.71781/11049","title":"Optimisation et balancement de la consommation d'énergie dans les réseaux ad hoc mobiles et de capteurs","year":2006,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Humanities; Art","score_opus":0.007947713484950778,"score_gpt":0.2091039072690962,"score_spread":0.20115619378414543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612807511","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4133133,0.001340994,0.5580556,0.00085020333,0.0002886278,0.00015369162,0.00018309211,0.0007550292,0.025059465],"genre_scores_gemma":[0.9492838,0.00029132442,0.03866709,0.0000594687,0.000046639252,0.00008377662,0.00008773193,0.00019896026,0.011281309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957305,0.00010918354,0.000014963002,0.00008464209,0.00012428322,0.00009383985],"domain_scores_gemma":[0.9987876,0.0008561853,0.00007603606,0.000042581083,0.00017538277,0.0000621635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562858,0.0010006803,0.0010196758,0.0007512434,0.00070023484,0.0023643742,0.00069482974,0.0013036304,0.0053531],"category_scores_gemma":[0.0033706385,0.0005205242,0.0005049406,0.000589647,0.0006024876,0.001262378,0.0005795818,0.00079040957,0.0006323071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079569756,0.00015510632,0.0011973407,0.00014954843,0.00004734564,0.00009406507,0.00013087345,0.90916264,0.023138717,0.0051425546,0.0007489822,0.059237223],"study_design_scores_gemma":[0.000058637077,0.00018289388,0.0011892419,0.000014118362,0.000020690457,0.000035537825,0.00007271423,0.987002,0.008912874,0.0015165248,0.0009781793,0.000016518556],"about_ca_topic_score_codex":0.009543944,"about_ca_topic_score_gemma":0.0067778225,"teacher_disagreement_score":0.009543944,"about_ca_system_score_codex":0.0013499954,"about_ca_system_score_gemma":0.00092677324,"threshold_uncertainty_score":0.018976808},"labels":[],"label_agreement":null},{"id":"W2613262147","doi":"10.1016/s1474-6670(17)32383-2","title":"Development of an Interface Between the IEEE 802.11b WLAN Technology and the New Mobile ad hoc Subnetwork Relay SNR) Technology","year":2004,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer network; Subnetwork; Wireless ad hoc network; Computer science; Relay; Vehicular ad hoc network; Ad hoc wireless distribution service; Mobile ad hoc network; Interface (matter); IEEE 802.11s; Wireless; IEEE 802.11; Optimized Link State Routing Protocol; Wireless network; Telecommunications; Wireless mesh network; Power (physics)","score_opus":0.007921106820345683,"score_gpt":0.2337041412451412,"score_spread":0.2257830344247955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613262147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029428026,0.0009109133,0.9423289,0.00069055025,0.00053052895,0.0003853983,0.000060655286,0.0015624894,0.024102632],"genre_scores_gemma":[0.21154599,0.0015945825,0.74837834,0.00058075826,0.00046903288,0.000293151,0.00033899743,0.00019514207,0.036604017],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99929976,0.00013807611,0.000049009854,0.00007984682,0.00037519453,0.000058149602],"domain_scores_gemma":[0.9987993,0.0002027053,0.00007419345,0.00009857798,0.00071181706,0.0001134234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017960885,0.00030325892,0.0002693533,0.00071541173,0.00022269879,0.0010838241,0.0010380168,0.00090682704,0.0038782766],"category_scores_gemma":[0.0019189306,0.00024395587,0.00030544444,0.000313005,0.00037095216,0.0016000705,0.00081522105,0.0011380884,0.0020278872],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044533532,0.00061174104,0.0044949492,0.00046520322,0.000039941136,0.0007099278,0.0006923999,0.0052540926,0.26953438,0.13154231,0.007974013,0.5782356],"study_design_scores_gemma":[0.0003486731,0.0041624084,0.0064232773,0.00028023002,0.0001727465,0.003144091,0.00039682788,0.14501975,0.24010482,0.01764636,0.5821842,0.00011655864],"about_ca_topic_score_codex":0.0005563961,"about_ca_topic_score_gemma":0.00051857205,"teacher_disagreement_score":0.0038782766,"about_ca_system_score_codex":0.00034323652,"about_ca_system_score_gemma":0.00094170845,"threshold_uncertainty_score":0.012974083},"labels":[],"label_agreement":null},{"id":"W2613849956","doi":"10.1109/wcnc.2017.7925893","title":"Globally-Aware Allocation of Limited Bandwidth in Multipath Routing Based on Queueing Performance","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multipath routing; Computer science; Queueing theory; Computer network; Bandwidth allocation; Bandwidth (computing); Node (physics); Multipath propagation; Routing (electronic design automation); Distributed computing; Mathematical optimization; Static routing; Routing protocol; Channel (broadcasting); Engineering; Mathematics","score_opus":0.017446380811819092,"score_gpt":0.25032038838965953,"score_spread":0.23287400757784044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2613849956","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024191733,0.00040337956,0.97400135,0.00008104178,0.0000296247,0.000027329655,0.000012718249,0.00023737682,0.0010154257],"genre_scores_gemma":[0.83230877,0.00039817474,0.16567217,0.000048557573,0.000054252712,0.00006061015,0.000038374856,0.00011003986,0.0013090469],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929476,0.00022521427,0.000024377247,0.00013743315,0.00017661498,0.0001415219],"domain_scores_gemma":[0.99900913,0.0005866078,0.00012894472,0.00006629812,0.00015562472,0.000053345553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014402487,0.0011990834,0.0013163176,0.00068969897,0.0006250693,0.0010074693,0.0012155812,0.0006140888,0.0006623546],"category_scores_gemma":[0.003057924,0.00038306677,0.00039348254,0.00072371215,0.00078109215,0.0016295128,0.0009994402,0.00066923373,0.00014302987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038845516,0.000019417897,0.00040694443,0.000025253792,0.000020881633,0.000024032915,0.000038412367,0.9675712,0.0030860952,0.0041352063,0.00022520398,0.02440857],"study_design_scores_gemma":[0.0000025817426,0.000028813687,0.00006954679,0.0000029822506,0.000007191334,0.000011281342,0.000008736654,0.99734324,0.00069836376,0.0016655851,0.00015606807,0.0000056474614],"about_ca_topic_score_codex":0.003997898,"about_ca_topic_score_gemma":0.0036836541,"teacher_disagreement_score":0.003997898,"about_ca_system_score_codex":0.0013378463,"about_ca_system_score_gemma":0.0014450861,"threshold_uncertainty_score":0.009706736},"labels":[],"label_agreement":null},{"id":"W2617596100","doi":"10.11591/ijeecs.v6.i1.pp16-25","title":"An Adaptive Cross-Layer Architecture to Optimize QoS Provisioning in MANET","year":2017,"lang":"en","type":"article","venue":"Indonesian Journal of Electrical Engineering and Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ste. Anne's Hospital","funders":"","keywords":"Computer network; Computer science; Adaptive quality of service multi-hop routing; Quality of service; Mobile ad hoc network; Mobile QoS; Wireless ad hoc network; Node (physics); Provisioning; Wireless; Distributed computing; Routing protocol; Optimized Link State Routing Protocol; Routing (electronic design automation); Service (business); Telecommunications; Engineering; Service provider","score_opus":0.008898932318616624,"score_gpt":0.2524417121613252,"score_spread":0.24354277984270858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617596100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08825309,0.002614587,0.8960575,0.0005063977,0.00040793297,0.0002517435,0.00009746119,0.0037353619,0.008075977],"genre_scores_gemma":[0.81815207,0.0009382005,0.17417245,0.00028956338,0.00010146393,0.00012218536,0.00019392943,0.00013147149,0.00589873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970657,0.00006417394,0.000022399452,0.00006438224,0.00008399125,0.000058478312],"domain_scores_gemma":[0.99963236,0.000067993555,0.000044306744,0.00006215956,0.00014920563,0.000043928587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087236386,0.0005809147,0.00038165794,0.00035513702,0.0004577743,0.00092077494,0.0015756965,0.0004503396,0.0013791057],"category_scores_gemma":[0.0008810045,0.00028102216,0.00028908782,0.00029910234,0.00025768683,0.0011022881,0.00079383876,0.0008105178,0.00044036022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061239,0.00055379566,0.0030366168,0.00030310702,0.00029319277,0.00054335705,0.00027450424,0.49335793,0.12928018,0.023145247,0.010275534,0.33832413],"study_design_scores_gemma":[0.000019036654,0.00017944931,0.00035365555,0.000010713267,0.00005031919,0.000096202726,0.000030227455,0.9841128,0.008814431,0.0023319204,0.003980502,0.000020710198],"about_ca_topic_score_codex":0.002086125,"about_ca_topic_score_gemma":0.0030056657,"teacher_disagreement_score":0.002086125,"about_ca_system_score_codex":0.00048194252,"about_ca_system_score_gemma":0.0005604011,"threshold_uncertainty_score":0.0046135783},"labels":[],"label_agreement":null},{"id":"W2623946715","doi":"10.24138/jcomss.v13i2.376","title":"Performance Evaluation of Routing Metrics in the LOADng Routing Protocol","year":2017,"lang":"en","type":"article","venue":"Journal of Communications Software and Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundação para a Ciência e a Tecnologia; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Instituto Nacional de Telecomunicações; Universidade da Beira Interior","keywords":"Computer science; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Computer network; Routing protocol; Dynamic Source Routing; Link-state routing protocol; Routing Information Protocol; Wireless Routing Protocol; Static routing; Metrics; Interior gateway protocol; Distance-vector routing protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.11071021903544616,"score_gpt":0.3651799075418834,"score_spread":0.25446968850643725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623946715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9466772,0.0025417337,0.03892902,0.00027634882,0.00018033657,0.00034467864,0.0005022983,0.0011132461,0.009435116],"genre_scores_gemma":[0.98644,0.00047009904,0.011363304,0.000022015969,0.000013806335,0.00009242244,0.00058174005,0.000047570276,0.00096913555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969092,0.0009381439,0.00022650616,0.00025487813,0.001413086,0.00025819312],"domain_scores_gemma":[0.99397355,0.0030238912,0.00067668286,0.0005860834,0.0015851689,0.00015456688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027762437,0.0009330381,0.0006393709,0.0015426523,0.0005030478,0.0012275126,0.0007375459,0.00054180087,0.0006186238],"category_scores_gemma":[0.008545042,0.00013100781,0.00023052035,0.0014805646,0.00044134463,0.0014868475,0.0005890847,0.00040165443,0.0001785011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003785768,0.0012477032,0.038870707,0.001114859,0.00041895657,0.00070271647,0.0008203116,0.40700555,0.16479096,0.010556744,0.004877814,0.36580786],"study_design_scores_gemma":[0.000053412423,0.0041522942,0.018595077,0.0000625525,0.00019910789,0.0008217173,0.00046924173,0.84340733,0.123346575,0.0023088453,0.0064465357,0.00013730276],"about_ca_topic_score_codex":0.0016962569,"about_ca_topic_score_gemma":0.0015056581,"teacher_disagreement_score":0.0027762437,"about_ca_system_score_codex":0.0012714148,"about_ca_system_score_gemma":0.0006918672,"threshold_uncertainty_score":0.014682412},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010550252660611156,"score_gpt":0.23096115420782723,"score_spread":0.22041090154721607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2667052534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09794622,0.0037165058,0.88038987,0.0014100347,0.0002702641,0.00011964703,0.00034193302,0.0006799547,0.015125589],"genre_scores_gemma":[0.86625904,0.00754515,0.1019293,0.00039416505,0.00069236034,0.0002718143,0.00085721933,0.00028269197,0.02176819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989497,0.00038852493,0.000061744846,0.0001898405,0.00027264963,0.00013757359],"domain_scores_gemma":[0.98916197,0.008448905,0.00087514403,0.00043043573,0.0007041939,0.0003793049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010212642,0.0005240059,0.0012476192,0.0014339841,0.0011987402,0.0020024143,0.001707054,0.0013519003,0.002136397],"category_scores_gemma":[0.009951831,0.00076204404,0.00045968787,0.002447343,0.0015263101,0.0025561384,0.001045862,0.0012435414,0.0005169011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026993098,0.00012583724,0.002050736,0.0008489103,0.00009992611,0.000595022,0.0007934227,0.41008613,0.006782664,0.47291335,0.009070623,0.09636345],"study_design_scores_gemma":[0.000074074014,0.000051481762,0.00055578805,0.000043928605,0.00008612032,0.00024205372,0.0001411788,0.61890936,0.0012159253,0.37103796,0.0076115374,0.000030620176],"about_ca_topic_score_codex":0.004331235,"about_ca_topic_score_gemma":0.0036493526,"teacher_disagreement_score":0.004331235,"about_ca_system_score_codex":0.0012129488,"about_ca_system_score_gemma":0.00077404187,"threshold_uncertainty_score":0.008800626},"labels":[],"label_agreement":null},{"id":"W2678738978","doi":"10.48550/arxiv.1706.05596","title":"Joint Scheduling and Transmission Power Control in Wireless Ad Hoc Networks","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Siemens (Canada)","funders":"","keywords":"Computer science; Wireless ad hoc network; Power control; Computer network; Network packet; Scheduling (production processes); Energy consumption; Maximum throughput scheduling; Wireless network; Wireless; Mobile ad hoc network; Distributed computing; Transmission (telecommunications); Dynamic priority scheduling; Power (physics); Round-robin scheduling; Mathematical optimization; Engineering; Telecommunications; Quality of service; Mathematics; Electrical engineering","score_opus":0.03737049513836388,"score_gpt":0.18399275095491746,"score_spread":0.14662225581655358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2678738978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02088379,0.0026445065,0.97334373,0.00032700668,0.000115191026,0.000036803118,0.000012174182,0.00014643688,0.0024903342],"genre_scores_gemma":[0.8809834,0.0029983239,0.11249752,0.00011609654,0.00047870097,0.00013089846,0.000030110952,0.00005824276,0.0027066928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.00055677706,0.00007461219,0.00018815226,0.00046133483,0.000108959415],"domain_scores_gemma":[0.9979348,0.0013587043,0.00024119556,0.00017950441,0.00023476091,0.000051138068],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020977687,0.000811461,0.0008184431,0.00045566825,0.00047433947,0.001209786,0.00094239635,0.00096530555,0.000511555],"category_scores_gemma":[0.005264437,0.00041254616,0.00029700267,0.0011166891,0.0014233285,0.002006202,0.00075054565,0.0008505762,0.00015382649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089617846,0.00007481299,0.00064494344,0.00016569583,0.00004267475,0.00010986222,0.0001475321,0.83194524,0.0048282845,0.07639814,0.00081859675,0.08473459],"study_design_scores_gemma":[0.000013777292,0.000050630617,0.00012753115,0.000007929315,0.000011181552,0.00003660176,0.000022540016,0.9652906,0.0011262713,0.032098923,0.0012052825,0.000008793726],"about_ca_topic_score_codex":0.0013251386,"about_ca_topic_score_gemma":0.0007042936,"teacher_disagreement_score":0.0020977687,"about_ca_system_score_codex":0.0006359293,"about_ca_system_score_gemma":0.0009652117,"threshold_uncertainty_score":0.0110942125},"labels":[],"label_agreement":null},{"id":"W2716509290","doi":"10.1109/ccece.2017.7946683","title":"IMRP: Interference-aware multicast routing for Wireless Mesh Networks","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Multicast; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Wireless mesh network; Xcast; Source-specific multicast; Metrics; Routing (electronic design automation); Routing protocol; Wireless network; Wireless; Static routing; Telecommunications","score_opus":0.030696078312489522,"score_gpt":0.28285941814687615,"score_spread":0.25216333983438666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2716509290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011913497,0.0014454491,0.97640014,0.00036225904,0.00027816027,0.00012886291,0.00010731748,0.0028738675,0.006490529],"genre_scores_gemma":[0.33986527,0.0012752294,0.65176564,0.0004058474,0.00042978104,0.00030125462,0.00053044007,0.0002588247,0.0051676133],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933076,0.00017824475,0.000037555037,0.00007069696,0.00030580562,0.00007694469],"domain_scores_gemma":[0.99957424,0.000112394555,0.000057274232,0.000101296486,0.00012965275,0.000025043915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009515179,0.000589982,0.00075163576,0.00091569975,0.00071541517,0.0006054302,0.0017786337,0.00071490364,0.0013481163],"category_scores_gemma":[0.0014565839,0.00018121375,0.0004921807,0.00063771673,0.0003273149,0.0011782253,0.001049774,0.0008158995,0.00050346466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002936206,0.0002301372,0.001556461,0.00076717813,0.00018224858,0.000446376,0.00029976646,0.10918584,0.057435613,0.07316496,0.019917488,0.7365203],"study_design_scores_gemma":[0.00006010368,0.00046809352,0.001070727,0.000086954606,0.00012792108,0.00087042805,0.00010335584,0.8897834,0.031032082,0.02504404,0.051293124,0.000059708396],"about_ca_topic_score_codex":0.00044659563,"about_ca_topic_score_gemma":0.0007415242,"teacher_disagreement_score":0.0017786337,"about_ca_system_score_codex":0.000512089,"about_ca_system_score_gemma":0.0003304623,"threshold_uncertainty_score":0.005032122},"labels":[],"label_agreement":null},{"id":"W2731173363","doi":"10.1177/1550147717716815","title":"Honey bee algorithm–based efficient cluster formation and optimization scheme in mobile ad hoc networks","year":2017,"lang":"en","type":"article","venue":"International Journal of Distributed Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Cluster analysis; Scalability; Mobile ad hoc network; Node (physics); Wireless ad hoc network; Computer network; Distributed computing; Overhead (engineering); Topology control; Optimized Link State Routing Protocol; Network topology; Bees algorithm; Routing protocol; Routing (electronic design automation); Algorithm; Metaheuristic; Artificial intelligence; Wireless; Wireless network; Key distribution in wireless sensor networks","score_opus":0.00880913269714439,"score_gpt":0.24946773433221117,"score_spread":0.24065860163506678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2731173363","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050245553,0.003975446,0.9360569,0.00051896216,0.00022812079,0.00025608932,0.000082238534,0.0007677495,0.007868842],"genre_scores_gemma":[0.7376812,0.0020651156,0.253734,0.00021926644,0.00008118269,0.00036926114,0.0002500567,0.000050630308,0.0055493517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996903,0.000098433964,0.000024285335,0.000049121954,0.00010974423,0.000028162134],"domain_scores_gemma":[0.99984455,0.00003909857,0.00002692043,0.000024828425,0.000053024716,0.000011552292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039824157,0.00037048722,0.00061221403,0.00044831284,0.0005904611,0.0005286623,0.0010596369,0.0006078039,0.00052785163],"category_scores_gemma":[0.000632164,0.00017328157,0.0003757612,0.00069788075,0.0003743689,0.0007524549,0.0005726718,0.00041819667,0.00016851789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018900407,0.000101829646,0.0014036029,0.0003002242,0.00019716015,0.0003009225,0.00027736212,0.6743007,0.029550394,0.038043097,0.008987117,0.24634863],"study_design_scores_gemma":[0.000046933626,0.00017011378,0.00060526875,0.000019744755,0.000029138111,0.00019969414,0.000043149343,0.9778555,0.0046035335,0.007829142,0.008569871,0.000027910739],"about_ca_topic_score_codex":0.0022038952,"about_ca_topic_score_gemma":0.0021941795,"teacher_disagreement_score":0.0022038952,"about_ca_system_score_codex":0.0004168174,"about_ca_system_score_gemma":0.00053541065,"threshold_uncertainty_score":0.0043821335},"labels":[],"label_agreement":null},{"id":"W2738496724","doi":"10.23919/inm.2017.7987348","title":"Ensuring two routes connectivity in mobile ad hoc networks with Random Waypoint mobility","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Waypoint; Mobility model; Computer science; Computer network; Wireless ad hoc network; Node (physics); Mobile ad hoc network; Probabilistic logic; Reliability (semiconductor); Network packet; Mobile computing; Delay-tolerant networking; Distributed computing; Vehicular ad hoc network; Optimized Link State Routing Protocol; Wireless; Real-time computing; Routing protocol; Engineering; Telecommunications","score_opus":0.01255580453666839,"score_gpt":0.247347086115449,"score_spread":0.23479128157878063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738496724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1059377,0.0014762661,0.8892036,0.00027496307,0.00003959258,0.00007765036,0.00004312342,0.00020021832,0.002746872],"genre_scores_gemma":[0.95894605,0.0013164128,0.038719874,0.000044382814,0.000053006628,0.000120114506,0.000041642295,0.00003695846,0.00072145683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818665,0.00083380885,0.000078753226,0.00018159483,0.0005523753,0.00016683192],"domain_scores_gemma":[0.9956398,0.0027914762,0.0006644681,0.00035603475,0.00044776703,0.00010040171],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015086419,0.00055794657,0.0005588431,0.001025291,0.00042317074,0.0007393693,0.0007797241,0.0007540322,0.00061778974],"category_scores_gemma":[0.009626776,0.0004112551,0.00055423577,0.0006667662,0.0011092959,0.0024179665,0.0009023632,0.0005344034,0.00021157043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012583136,0.00006312401,0.0026684252,0.00041937226,0.00008732224,0.0008520117,0.00040314771,0.82599396,0.020977294,0.112114705,0.00084430695,0.035450537],"study_design_scores_gemma":[0.000020168358,0.00028575558,0.0011803501,0.000038072812,0.00005564346,0.00085606624,0.00016867349,0.94114023,0.0035896187,0.05079607,0.0018228614,0.00004641105],"about_ca_topic_score_codex":0.0010483658,"about_ca_topic_score_gemma":0.00095796585,"teacher_disagreement_score":0.0015086419,"about_ca_system_score_codex":0.00049654924,"about_ca_system_score_gemma":0.0004633936,"threshold_uncertainty_score":0.007978559},"labels":[],"label_agreement":null},{"id":"W2740073444","doi":"10.1007/s11277-017-4727-9","title":"Adaptive Transmission Rate Congestion Aware Routing Algorithm in Wireless Mesh Network","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Network congestion; Wireless mesh network; Transmission (telecommunications); Algorithm; Routing algorithm; Wireless; Routing (electronic design automation); Transmission rate; Wireless network; Distributed computing; Routing protocol; Telecommunications","score_opus":0.03920284064492906,"score_gpt":0.28918135147104834,"score_spread":0.24997851082611927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740073444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066655286,0.001350472,0.9270642,0.0004341634,0.00039553898,0.00010942041,0.00007352026,0.00089359464,0.0030238307],"genre_scores_gemma":[0.81656384,0.0006323424,0.17958151,0.00011715556,0.00013631613,0.000110265486,0.0001435565,0.000058789195,0.0026562796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996164,0.00012176093,0.000025996591,0.000081540245,0.000107998654,0.000046296314],"domain_scores_gemma":[0.9993592,0.00028797035,0.00007426407,0.0000640076,0.0001867871,0.000027798345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007787629,0.0003618342,0.0005492069,0.0006255872,0.00045472666,0.00056502875,0.001513953,0.00044210907,0.0008502902],"category_scores_gemma":[0.0020176347,0.0001966171,0.0002656671,0.0005633147,0.00025464417,0.00081420556,0.00047764758,0.0006107259,0.00016614776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004332035,0.00029497317,0.0027302373,0.00023980497,0.00013233775,0.00020468979,0.00022877681,0.6393447,0.04200745,0.020348515,0.006687669,0.28734773],"study_design_scores_gemma":[0.000017684359,0.00008669801,0.00026749674,0.0000048883594,0.000021357668,0.000065319255,0.00001971426,0.9944377,0.0026212824,0.0014874954,0.0009604199,0.000009980464],"about_ca_topic_score_codex":0.0017662967,"about_ca_topic_score_gemma":0.0017396591,"teacher_disagreement_score":0.0017662967,"about_ca_system_score_codex":0.00048786245,"about_ca_system_score_gemma":0.0004902425,"threshold_uncertainty_score":0.0041185617},"labels":[],"label_agreement":null},{"id":"W2741259491","doi":"10.1007/s11277-017-4749-3","title":"A Hybrid MAC Protocol with Multi-slot Reservation for Dense Wireless Ad-Hoc Networks","year":2017,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Throughput; Wireless ad hoc network; Access control; Multiple Access with Collision Avoidance for Wireless; Quality of service; Handshake; Reservation; Media access control; Channel (broadcasting); Wireless; Protocol (science); Carrier sense multiple access with collision avoidance; Wireless network; Vehicular ad hoc network; Telecommunications","score_opus":0.07081761842990714,"score_gpt":0.3360708156256036,"score_spread":0.26525319719569646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741259491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050610755,0.0012467592,0.9420089,0.00019254032,0.0003758524,0.00018590169,0.00006029626,0.0017735541,0.0035454002],"genre_scores_gemma":[0.74265414,0.00042771036,0.25113645,0.00015720665,0.0002090183,0.00026556203,0.00014389379,0.00013185259,0.0048742215],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915195,0.00025392743,0.00006582774,0.000089024514,0.00031350018,0.00012576804],"domain_scores_gemma":[0.9982835,0.0007281839,0.00009003321,0.0004294208,0.00036676717,0.00010209711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015539955,0.00046553844,0.00084769906,0.00083596725,0.00078557385,0.0009810032,0.00198317,0.00044337986,0.0014257182],"category_scores_gemma":[0.0020672863,0.00042558953,0.00036617965,0.0006036455,0.0005899362,0.0013057957,0.0014733718,0.0008664184,0.00032676302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015040513,0.0005665406,0.0017708767,0.0004926308,0.00034849602,0.00067860045,0.00061239005,0.24277417,0.15821958,0.08417173,0.009048585,0.49981236],"study_design_scores_gemma":[0.00008451919,0.00033930223,0.00040272123,0.000015796943,0.0000941601,0.00032352644,0.0000633835,0.97479564,0.009555647,0.007918848,0.0063483072,0.000058120604],"about_ca_topic_score_codex":0.0013728825,"about_ca_topic_score_gemma":0.0021997646,"teacher_disagreement_score":0.00198317,"about_ca_system_score_codex":0.00051504787,"about_ca_system_score_gemma":0.0008979325,"threshold_uncertainty_score":0.008218408},"labels":[],"label_agreement":null},{"id":"W2741757785","doi":"10.5220/0006478300430054","title":"Toward Testing Security Attacks and Defense Mechanisms for P2PSIP in MANETs with a Simulator","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cegep de Sainte Foy; Carleton University","funders":"","keywords":"Computer science; Computer security; Computer network; Embedded system","score_opus":0.03999454423854635,"score_gpt":0.270123087653793,"score_spread":0.23012854341524666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741757785","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7678518,0.00020026874,0.22559908,0.00049401016,0.000096398755,0.0005100209,0.00027957076,0.0011882884,0.0037805617],"genre_scores_gemma":[0.9510472,0.000117015355,0.047809064,0.00006318607,0.00001120301,0.00012632436,0.00013551928,0.000040252045,0.0006501542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774617,0.0011609879,0.00013247844,0.00019135277,0.0004668933,0.00030218236],"domain_scores_gemma":[0.98021245,0.014613173,0.0011797564,0.0021296712,0.0014394871,0.00042555464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035853295,0.00082653126,0.00048299495,0.0010694014,0.00057103235,0.0009198806,0.0014967973,0.00119819,0.0010475836],"category_scores_gemma":[0.01695928,0.00043019728,0.000616229,0.0003850563,0.0012952294,0.0019476366,0.0014034563,0.0010528624,0.0001435874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007472947,0.00051693193,0.0064240214,0.00015119389,0.00012870265,0.000116630865,0.00013519409,0.95187813,0.012472539,0.013923794,0.00058239454,0.012923299],"study_design_scores_gemma":[0.00003241181,0.00016171599,0.00013782621,0.0000054314332,0.000018820605,0.000019272931,0.000028902863,0.9947977,0.003405775,0.0012477168,0.0001403644,0.000003983457],"about_ca_topic_score_codex":0.004095697,"about_ca_topic_score_gemma":0.0027184621,"teacher_disagreement_score":0.004095697,"about_ca_system_score_codex":0.0011566768,"about_ca_system_score_gemma":0.002408064,"threshold_uncertainty_score":0.01896125},"labels":[],"label_agreement":null},{"id":"W2751372205","doi":"","title":"Performance enhancements in wireless multihop ad-hoc networks","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Wireless ad hoc network; Hidden node problem; Computer science; Multiple Access with Collision Avoidance for Wireless; Wireless network; Ad hoc wireless distribution service; Node (physics); Mobile ad hoc network; Throughput; Network packet; Vehicular ad hoc network; Wireless; Optimized Link State Routing Protocol; Transmission (telecommunications); Distributed computing; Routing protocol; Wi-Fi array; Engineering; Telecommunications","score_opus":0.01215032598258811,"score_gpt":0.239765983726689,"score_spread":0.2276156577441009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751372205","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1890227,0.045594163,0.66161597,0.005028666,0.0019455635,0.00020962318,0.00022542667,0.002574116,0.093783736],"genre_scores_gemma":[0.9170745,0.012237131,0.062562004,0.00033339395,0.0007726072,0.00008641315,0.00011985179,0.000115944764,0.0066981176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982248,0.0006702558,0.000084944906,0.00013357097,0.00071809895,0.00016822651],"domain_scores_gemma":[0.99673414,0.0018847982,0.00022579356,0.00035458952,0.0007088707,0.00009190526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018791346,0.0007366457,0.00048002123,0.00057646394,0.00048790872,0.001382779,0.0006525522,0.0005803906,0.0014884257],"category_scores_gemma":[0.007592546,0.0002607509,0.0002091316,0.00074137584,0.00040167093,0.0023441669,0.0010695425,0.000894807,0.000605722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036669875,0.00021283174,0.0037252088,0.0011633325,0.00009875853,0.0006878088,0.0005140667,0.36747292,0.03809183,0.1258282,0.009977027,0.4518612],"study_design_scores_gemma":[0.000048845803,0.0010228164,0.0026925893,0.00024394316,0.00013539234,0.0011958883,0.00040933737,0.8314374,0.01851869,0.080143906,0.06406939,0.00008174658],"about_ca_topic_score_codex":0.00042678945,"about_ca_topic_score_gemma":0.00038056038,"teacher_disagreement_score":0.0018791346,"about_ca_system_score_codex":0.00055670034,"about_ca_system_score_gemma":0.00046744678,"threshold_uncertainty_score":0.009937942},"labels":[],"label_agreement":null},{"id":"W2756349355","doi":"10.1007/s11276-017-1575-1","title":"Secure opportunistic routing protocols: methods, models, and classification","year":2017,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Routing protocol; Computer network; Interior gateway protocol; Reliability (semiconductor); Protocol (science); Network packet; Node (physics); Set (abstract data type); Distributed computing; Routing (electronic design automation); Wireless; Cryptographic protocol; Link-state routing protocol; Computer security; Cryptography; Telecommunications","score_opus":0.09514426653872908,"score_gpt":0.3564103952561668,"score_spread":0.2612661287174377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2756349355","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020643566,0.0072036027,0.9633721,0.0016910373,0.00024651785,0.00022116861,0.0003305976,0.0003467079,0.0059446907],"genre_scores_gemma":[0.66321105,0.026753357,0.29296097,0.0003863949,0.0015658146,0.0011360006,0.0011979367,0.00018242327,0.012606122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968099,0.001000338,0.0002316472,0.0004540582,0.0012381918,0.0002658783],"domain_scores_gemma":[0.9912583,0.0052793142,0.0010610167,0.001369011,0.0008429303,0.0001894571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040512355,0.0016759488,0.0015209023,0.0035200734,0.0010718309,0.0033384298,0.0024965745,0.0016944088,0.0014405643],"category_scores_gemma":[0.009366968,0.00080753816,0.0010942578,0.0032607876,0.0020655538,0.00599789,0.001642313,0.0027059035,0.00046394274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014505141,0.00022633764,0.004136126,0.00035153684,0.00009206094,0.00010722403,0.00027863405,0.24219649,0.0017214961,0.61806685,0.006520299,0.12615786],"study_design_scores_gemma":[0.000019676132,0.00007476922,0.00046940273,0.00006583822,0.000043867793,0.0002630765,0.00006330893,0.75981385,0.0007376882,0.23239228,0.0060208994,0.000035359295],"about_ca_topic_score_codex":0.0019184686,"about_ca_topic_score_gemma":0.0020636488,"teacher_disagreement_score":0.0040512355,"about_ca_system_score_codex":0.0023800386,"about_ca_system_score_gemma":0.0017399613,"threshold_uncertainty_score":0.021425247},"labels":[],"label_agreement":null},{"id":"W2769648038","doi":"10.1007/s11036-017-0958-y","title":"Performance Evaluation of Large-scale RF-Mesh Networks in a Smart City Context","year":2017,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Wireless mesh network; Computer science; Mesh networking; Switched mesh; Smart grid; Modular design; Wireless; Order One Network Protocol; Context (archaeology); Wireless network; Computer network; Distributed computing; Telecommunications; Operating system","score_opus":0.018700392212231902,"score_gpt":0.27827099801276206,"score_spread":0.25957060580053015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769648038","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9809862,0.00048579118,0.012184885,0.0003788198,0.00006919841,0.000095915835,0.00025584947,0.00041828366,0.005125126],"genre_scores_gemma":[0.9974366,0.00008982918,0.0019175011,0.00001578446,0.0000120939085,0.0000114440145,0.00014670932,0.000012132214,0.00035785633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863726,0.0006140359,0.00006261636,0.00015994972,0.00025824484,0.00026789727],"domain_scores_gemma":[0.99577206,0.0024970362,0.00034103708,0.00031996644,0.00080388214,0.000265987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018566224,0.00072365697,0.00046974022,0.0008930098,0.0005973043,0.0008559842,0.0010087894,0.00078381517,0.00146877],"category_scores_gemma":[0.0050211116,0.00015173541,0.00020506613,0.0010935919,0.0006498385,0.0013074876,0.0009042382,0.0003551038,0.00023585702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002452187,0.00073165115,0.014405337,0.0003279901,0.00016207556,0.0004337607,0.00019410117,0.91034335,0.017377855,0.0031510508,0.0034188663,0.04700186],"study_design_scores_gemma":[0.00008582774,0.0010443494,0.0048726695,0.000008925145,0.00005410663,0.00013727944,0.00030654136,0.98620355,0.005823291,0.00075669406,0.000689099,0.000017620378],"about_ca_topic_score_codex":0.007057708,"about_ca_topic_score_gemma":0.00611627,"teacher_disagreement_score":0.007057708,"about_ca_system_score_codex":0.0012506096,"about_ca_system_score_gemma":0.00048209843,"threshold_uncertainty_score":0.014033258},"labels":[],"label_agreement":null},{"id":"W277065427","doi":"","title":"Efficient multicast routing protocol for mobile ad hoc networks based on dense zones","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Computer network; Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer science; Distributed computing; Multicast; Source-specific multicast; Xcast; Wireless Routing Protocol; Optimized Link State Routing Protocol; Pragmatic General Multicast; Routing protocol; Routing (electronic design automation)","score_opus":0.025849508983194155,"score_gpt":0.2830307267523214,"score_spread":0.2571812177691272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W277065427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034902718,0.0045191515,0.9520899,0.00037374636,0.000286992,0.00026468508,0.00014200997,0.00078022486,0.0066406038],"genre_scores_gemma":[0.47367644,0.0026012373,0.5156029,0.00023660704,0.00020236308,0.0005295233,0.0007182921,0.00006352326,0.006369122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996846,0.00010572828,0.000021228072,0.000025198071,0.00013281294,0.000030494],"domain_scores_gemma":[0.9997693,0.000068509165,0.000032988886,0.000041540392,0.000071764814,0.000015951713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004456335,0.00032189317,0.0004249616,0.0006796913,0.00062502583,0.0004832996,0.00081673113,0.00040971136,0.00086024305],"category_scores_gemma":[0.0006488062,0.00016064888,0.00025108384,0.00056739734,0.00024412991,0.001130781,0.001022038,0.00042529852,0.00026427337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049689336,0.00015797227,0.0018084141,0.00090556795,0.00020554953,0.0011563689,0.00077432406,0.055478614,0.14484191,0.15665802,0.015750207,0.62176615],"study_design_scores_gemma":[0.000442085,0.00094745675,0.0029510106,0.00014863774,0.00035934817,0.0037423498,0.00060089736,0.57016593,0.07026677,0.09075018,0.25948533,0.00013998196],"about_ca_topic_score_codex":0.0004933131,"about_ca_topic_score_gemma":0.0007185185,"teacher_disagreement_score":0.00086024305,"about_ca_system_score_codex":0.00031245075,"about_ca_system_score_gemma":0.0003402879,"threshold_uncertainty_score":0.0028778315},"labels":[],"label_agreement":null},{"id":"W277307140","doi":"10.71781/10947","title":"Métriques de routage dans les réseaux maillés sans fil","year":2011,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Université de Montréal","keywords":"Humanities; Political science; Physics; Art","score_opus":0.05582156694591326,"score_gpt":0.3157834248438713,"score_spread":0.259961857897958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W277307140","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12169315,0.007526446,0.82566285,0.0017473687,0.00045122128,0.00025615614,0.0019269583,0.0023270147,0.038408868],"genre_scores_gemma":[0.74249625,0.008924142,0.19252826,0.00032584014,0.00067354995,0.00043347824,0.0030918622,0.00076274533,0.050763804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99735165,0.00062691217,0.00015746335,0.000473936,0.0011093472,0.00028072752],"domain_scores_gemma":[0.99661213,0.0015582512,0.0003949895,0.00027750462,0.0010921913,0.000064872176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017835627,0.0012021563,0.0011341906,0.0017705653,0.001187051,0.003949766,0.0010661158,0.001612315,0.0087667685],"category_scores_gemma":[0.0077641727,0.0006312209,0.00085027877,0.0018569742,0.0006523314,0.003670611,0.0006927882,0.0014253076,0.00294294],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089350156,0.00015488366,0.012129477,0.0016192143,0.00018288843,0.0013944142,0.0016682622,0.440938,0.037715018,0.15364948,0.020661537,0.32899332],"study_design_scores_gemma":[0.000059539194,0.00031882853,0.010395949,0.00034226093,0.00009880211,0.0016179949,0.001512735,0.7905459,0.042887013,0.04059252,0.11143191,0.00019648281],"about_ca_topic_score_codex":0.0103912465,"about_ca_topic_score_gemma":0.0075471126,"teacher_disagreement_score":0.0103912465,"about_ca_system_score_codex":0.0031204831,"about_ca_system_score_gemma":0.0015385412,"threshold_uncertainty_score":0.02932775},"labels":[],"label_agreement":null},{"id":"W2780494139","doi":"10.1016/j.comnet.2017.12.009","title":"Using flow cost to globally allocate and optimize limited bandwidth in multipath routing","year":2017,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multipath routing; Multipath propagation; Bandwidth (computing); Computer network; Routing (electronic design automation); Telecommunications; Dynamic Source Routing; Routing protocol; Channel (broadcasting)","score_opus":0.03846839244225675,"score_gpt":0.27851759476787535,"score_spread":0.2400492023256186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780494139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1351273,0.00082945207,0.85969156,0.00045462517,0.00014171509,0.00008686099,0.000101052094,0.00053979916,0.0030276885],"genre_scores_gemma":[0.8819738,0.00023115767,0.11544605,0.00008068414,0.000073841715,0.00007595797,0.00008351011,0.00022971272,0.00180532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903655,0.00039567632,0.00003578893,0.00010195113,0.00023339872,0.00019652476],"domain_scores_gemma":[0.99606836,0.0028756694,0.0002426118,0.0002479139,0.00040410244,0.00016135327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003498039,0.0013331637,0.0017940857,0.0015296988,0.0008250822,0.001430028,0.0014216162,0.0011888808,0.0019554305],"category_scores_gemma":[0.009340386,0.0007595652,0.00047173773,0.0014749637,0.0009849839,0.0032576816,0.001318585,0.00085282297,0.00016247592],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010638266,0.00003818783,0.0005001769,0.000018145665,0.000025953823,0.00001125618,0.000019899504,0.97348255,0.0006843607,0.004424329,0.00044972068,0.020239135],"study_design_scores_gemma":[0.0000046733794,0.000022750908,0.000071670984,0.0000023026037,0.000012217898,0.0000048478523,0.0000056985964,0.99707854,0.0002798024,0.0024256331,0.00008851511,0.0000034528023],"about_ca_topic_score_codex":0.0063742497,"about_ca_topic_score_gemma":0.007833495,"teacher_disagreement_score":0.0063742497,"about_ca_system_score_codex":0.0024651121,"about_ca_system_score_gemma":0.0021731323,"threshold_uncertainty_score":0.018499613},"labels":[],"label_agreement":null},{"id":"W2783071455","doi":"","title":"Interference Minimization in k-Connected Wireless Networks.","year":2017,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Interference (communication); Computer science; Minification; Wireless; Wireless network; Computer network; Telecommunications","score_opus":0.026078376337796652,"score_gpt":0.253558978571153,"score_spread":0.22748060223335637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783071455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045332,0.0026370394,0.92878616,0.0015727985,0.00026705564,0.000098371595,0.0005709825,0.00028145593,0.020454183],"genre_scores_gemma":[0.8172823,0.004131043,0.15878578,0.0005236053,0.0004919206,0.00027637568,0.0007550998,0.0002760817,0.017477768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990361,0.00043447694,0.000040839335,0.00016463119,0.00016748071,0.00015659245],"domain_scores_gemma":[0.9972288,0.0020783413,0.00018787445,0.00014706998,0.00022277646,0.00013518932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221647,0.0011457512,0.0011890943,0.00083261763,0.0007853579,0.0011816977,0.0021483074,0.0010935393,0.0031191586],"category_scores_gemma":[0.005120337,0.00050777814,0.0006229078,0.002099694,0.0011440351,0.0019540743,0.0016595118,0.0013208915,0.0009426366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002903178,0.000121052246,0.00090320135,0.000593471,0.00016588192,0.0002661105,0.0003019136,0.7460646,0.002538922,0.14830919,0.019992907,0.08045242],"study_design_scores_gemma":[0.000028849967,0.00005856245,0.00035582625,0.000044977718,0.000035074645,0.00017063388,0.00012148223,0.8368182,0.0008273848,0.1585495,0.002972096,0.000017359615],"about_ca_topic_score_codex":0.0023638739,"about_ca_topic_score_gemma":0.0023200996,"teacher_disagreement_score":0.0031191586,"about_ca_system_score_codex":0.001152464,"about_ca_system_score_gemma":0.0007803756,"threshold_uncertainty_score":0.010434687},"labels":[],"label_agreement":null},{"id":"W2783239915","doi":"10.1007/978-3-319-74439-1_12","title":"An Efficient Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface (MCMI) Ad Hoc Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Interface (matter); Algorithm; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Computer network; Distributed computing; Link-state routing protocol; Routing (electronic design automation); Wireless; Routing protocol; Parallel computing; Telecommunications","score_opus":0.02898009330017165,"score_gpt":0.2705286122830046,"score_spread":0.24154851898283297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783239915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010112625,0.00029338986,0.9823199,0.00016354899,0.00015902647,0.00013521564,0.000095058174,0.0016841585,0.005037037],"genre_scores_gemma":[0.10431437,0.00021060112,0.8891972,0.00008534142,0.000061635066,0.00020232597,0.0003252225,0.00017260217,0.0054306975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.00007017331,0.000017002083,0.00005647867,0.00013115777,0.000059445058],"domain_scores_gemma":[0.9994906,0.00018934718,0.000038939408,0.00008823896,0.00015682708,0.00003602598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004722871,0.0008187988,0.0008810981,0.0006938319,0.0009045735,0.0010680951,0.0020152905,0.0007045057,0.004852183],"category_scores_gemma":[0.0015396462,0.0003814317,0.00044892926,0.0012986683,0.0003524919,0.0013448815,0.0010160925,0.0010896615,0.000971627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021480754,0.00020392126,0.00037856697,0.00016138994,0.00003786397,0.00006210896,0.00009661926,0.2598417,0.009722418,0.024806356,0.016182313,0.68829185],"study_design_scores_gemma":[0.000033465592,0.000053593147,0.00012642304,0.000007748035,0.000011496362,0.000056345452,0.000023549488,0.98681355,0.0018986819,0.0078878915,0.0030763855,0.000010806663],"about_ca_topic_score_codex":0.0032128647,"about_ca_topic_score_gemma":0.0057555484,"teacher_disagreement_score":0.004852183,"about_ca_system_score_codex":0.0009922,"about_ca_system_score_gemma":0.001385123,"threshold_uncertainty_score":0.016232133},"labels":[],"label_agreement":null},{"id":"W2784046327","doi":"10.5555/3242181.3242539","title":"Network layer connectivity awareness with application to investigate the OLSR protocol in tactical manets","year":2017,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Routing protocol; Network packet; Mobile ad hoc network; Wireless ad hoc network; Link-state routing protocol; Metrics; Network layer; Wireless Routing Protocol; Distributed computing; Link layer; Metric (unit); Ad hoc wireless distribution service; Physical layer; Zone Routing Protocol; Layer (electronics); Wireless; Engineering; Telecommunications","score_opus":0.054296831826294537,"score_gpt":0.33816485134136826,"score_spread":0.28386801951507373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784046327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15621734,0.0010908889,0.82979745,0.0004903675,0.00008519717,0.00013896277,0.00013764501,0.001093092,0.010949189],"genre_scores_gemma":[0.77264076,0.0008843331,0.22468449,0.00007089709,0.000050989882,0.00012784865,0.000112378766,0.000073701,0.0013545996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969673,0.00013084302,0.000012938113,0.00003569988,0.000101932725,0.00002183568],"domain_scores_gemma":[0.9990662,0.00053252734,0.00014024595,0.00010570268,0.00012561043,0.000029680508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005740621,0.00035236537,0.00025897942,0.00071013585,0.00029650136,0.00056688057,0.00046367262,0.0004624576,0.00070571253],"category_scores_gemma":[0.002643875,0.00017642019,0.00025436416,0.0007844648,0.00042722584,0.0012298123,0.0005782292,0.0005517388,0.000080533035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051735355,0.00007867497,0.0040470515,0.00011627785,0.00003971813,0.00018976851,0.00022909475,0.8544831,0.01297891,0.065121785,0.00096248917,0.061701283],"study_design_scores_gemma":[0.000004706514,0.00007161417,0.0005169606,0.0000090207195,0.000011182369,0.0000783942,0.00003727691,0.9884143,0.0027223623,0.005401032,0.002722609,0.0000105035615],"about_ca_topic_score_codex":0.0018827306,"about_ca_topic_score_gemma":0.0015496985,"teacher_disagreement_score":0.0018827306,"about_ca_system_score_codex":0.00027145207,"about_ca_system_score_gemma":0.00035910375,"threshold_uncertainty_score":0.0037435293},"labels":[],"label_agreement":null},{"id":"W2784496769","doi":"10.1007/978-3-319-74439-1_7","title":"Integrating Intrusion Response Functionality into the MANET Specific Dynamic Intrusion Detection Hierarchy Architecture","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Intrusion detection system; Backup; Computer science; Mobile ad hoc network; Computer network; Node (physics); Architecture; Intrusion; Distributed computing; Computer security; Engineering; Operating system; Network packet","score_opus":0.013240177722447793,"score_gpt":0.22888575265014877,"score_spread":0.21564557492770098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784496769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016030485,0.00065902126,0.9387746,0.0004240396,0.00021793711,0.00034658235,0.00027120436,0.023916498,0.019359635],"genre_scores_gemma":[0.26455644,0.0011527659,0.68733364,0.00084844057,0.00017884577,0.00020904961,0.0016765952,0.0016708092,0.042373355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960715,0.000042878728,0.0000347861,0.00007932346,0.00017684196,0.000058998805],"domain_scores_gemma":[0.9994666,0.00009859785,0.000029867324,0.00021164698,0.00014186192,0.000051359733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006912832,0.0005190381,0.00038736974,0.0007301209,0.0003258621,0.0014887509,0.0017871336,0.0006185922,0.005931485],"category_scores_gemma":[0.0010996022,0.0004518373,0.00051194156,0.00061117864,0.00039408787,0.0019332523,0.0014870295,0.0014136509,0.0028120033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004075544,0.0004204363,0.002876489,0.00077501277,0.00020386033,0.00034984437,0.0005082662,0.029625727,0.14530794,0.054799795,0.02738535,0.73733974],"study_design_scores_gemma":[0.000064188316,0.0004845315,0.002883009,0.00019003892,0.00032791158,0.0011531727,0.00015018291,0.49264157,0.17764376,0.052421592,0.2719124,0.00012767268],"about_ca_topic_score_codex":0.0017768651,"about_ca_topic_score_gemma":0.003112557,"teacher_disagreement_score":0.005931485,"about_ca_system_score_codex":0.0005880892,"about_ca_system_score_gemma":0.0007560815,"threshold_uncertainty_score":0.019842803},"labels":[],"label_agreement":null},{"id":"W2785566894","doi":"10.22215/etd/2014-10112","title":"Unmanned Aeronautical Ad-hoc Networks: Enhancing the Reactive-Greedy-Reactive Protocol and Introducing a New Mobility Model","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Mobility model; Computer network; Network packet; Waypoint; Routing protocol; Protocol (science); Wireless ad hoc network; Optimized Link State Routing Protocol; Latency (audio); Wireless Routing Protocol; Zone Routing Protocol; Distributed computing; Real-time computing; Wireless; Telecommunications","score_opus":0.011367486929531944,"score_gpt":0.2724887390842359,"score_spread":0.26112125215470394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785566894","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009768268,0.0015616361,0.97726715,0.0006701497,0.0006405306,0.00014338957,0.000058750626,0.0005911315,0.009299033],"genre_scores_gemma":[0.3972605,0.00809121,0.5708721,0.0006123497,0.0008175953,0.00038326991,0.0004546777,0.00029384322,0.02121446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993523,0.0001455189,0.000039176863,0.00010827585,0.0002932859,0.00006144887],"domain_scores_gemma":[0.9992865,0.00024608208,0.00007398411,0.00012065298,0.0002187103,0.000054111213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080078264,0.0006277676,0.00034942795,0.00046025854,0.00040953662,0.00087131094,0.0016645597,0.00054643454,0.0012350631],"category_scores_gemma":[0.0018944821,0.00019998982,0.00041264645,0.0006370655,0.00058748166,0.0027383715,0.0011646643,0.0012363171,0.0006453807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001915816,0.00025923323,0.0008521586,0.0004090593,0.000086011045,0.0003133296,0.00045791286,0.2617564,0.039737478,0.23867139,0.015998106,0.44126746],"study_design_scores_gemma":[0.00004877844,0.00021638894,0.00029905757,0.00006276412,0.0000699916,0.00034157682,0.00010141384,0.8855417,0.012559093,0.04172431,0.058973417,0.00006151917],"about_ca_topic_score_codex":0.0016701737,"about_ca_topic_score_gemma":0.0021051373,"teacher_disagreement_score":0.0016701737,"about_ca_system_score_codex":0.000519922,"about_ca_system_score_gemma":0.0007709651,"threshold_uncertainty_score":0.004235029},"labels":[],"label_agreement":null},{"id":"W2789617153","doi":"10.1016/j.cose.2018.02.018","title":"An efficient intrusion detection in resource-constrained mobile ad-hoc networks","year":2018,"lang":"en","type":"article","venue":"Computers & Security","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Communication source; Node (physics); Intrusion detection system; Mobile ad hoc network; Wireless ad hoc network; Game theory; Resource (disambiguation); Computer network; Scheme (mathematics); Bayesian game; Bayesian probability; Distributed computing; Computer security; Artificial intelligence; Repeated game; Wireless; Network packet","score_opus":0.0057128601128184735,"score_gpt":0.22688577565410006,"score_spread":0.2211729155412816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789617153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13085377,0.0015872631,0.8620457,0.0005105301,0.00028230363,0.00023918229,0.00015214288,0.0014275147,0.002901565],"genre_scores_gemma":[0.8339631,0.0006514646,0.16235086,0.000096454336,0.00011093529,0.000111672365,0.00020966545,0.000033017655,0.0024728165],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990897,0.00021222493,0.00007279706,0.00017888797,0.00032164354,0.0001246644],"domain_scores_gemma":[0.9990646,0.00043178254,0.00008138394,0.000108054184,0.00026454084,0.000049707418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006598413,0.00057277066,0.001036615,0.001053645,0.0005937387,0.0010943584,0.0010289875,0.00052907615,0.0008942044],"category_scores_gemma":[0.0024332325,0.0003227822,0.000346953,0.0008173987,0.00036456904,0.0014894501,0.0009253765,0.0005116187,0.00020028082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009821716,0.00041616824,0.0055477824,0.00030557942,0.00020074399,0.00034853598,0.00014988345,0.31442586,0.04701522,0.015038691,0.0062831235,0.60928625],"study_design_scores_gemma":[0.000011834159,0.000078749435,0.00042138653,0.0000047528315,0.000018097604,0.000102699996,0.000019613968,0.9924832,0.004549711,0.001596142,0.0007077186,0.0000061903957],"about_ca_topic_score_codex":0.0016787131,"about_ca_topic_score_gemma":0.0017986157,"teacher_disagreement_score":0.0016787131,"about_ca_system_score_codex":0.00049807184,"about_ca_system_score_gemma":0.0010207556,"threshold_uncertainty_score":0.00361377},"labels":[],"label_agreement":null},{"id":"W2789912089","doi":"10.1007/978-3-319-74439-1_13","title":"Exploiting Multiple Beam Antennas for End-to-End Delay Reduction in Ad Hoc Networks","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Transmission delay; Computer science; Network packet; Computer network; End-to-end delay; Reduction (mathematics); Wireless ad hoc network; Scheduling (production processes); Exploit; Node (physics); Wireless; Engineering; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.023688498002984493,"score_gpt":0.2387486341925481,"score_spread":0.2150601361895636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789912089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014638547,0.0033135025,0.9731226,0.000117763535,0.00020403678,0.000014525577,0.0000406364,0.0007271164,0.007821272],"genre_scores_gemma":[0.41198152,0.008047794,0.54465634,0.0002991182,0.00042640316,0.00008053835,0.00021770837,0.00033800595,0.033952717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997837,0.000049686296,0.0000073924525,0.00003134964,0.00009446812,0.000033368302],"domain_scores_gemma":[0.99973935,0.00014614852,0.000017676137,0.00004095634,0.00004951102,0.000006494266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002077143,0.0009823986,0.00046364497,0.00028260093,0.00017134477,0.0006503983,0.000826138,0.0006501185,0.0034427354],"category_scores_gemma":[0.00036533983,0.00029147646,0.00033083645,0.00064739364,0.00026176195,0.0006427673,0.00051763817,0.0007406645,0.0013881074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037260662,0.00012737002,0.00036338714,0.00027649148,0.00013998977,0.00011924355,0.00007700976,0.11281272,0.2878058,0.02077619,0.006298741,0.5708305],"study_design_scores_gemma":[0.000039439114,0.0004727713,0.0006611725,0.000057997062,0.00011395814,0.00050684426,0.000066166736,0.7767701,0.17121595,0.020860879,0.029187515,0.00004722414],"about_ca_topic_score_codex":0.00012759896,"about_ca_topic_score_gemma":0.0003077962,"teacher_disagreement_score":0.0034427354,"about_ca_system_score_codex":0.00023638089,"about_ca_system_score_gemma":0.00012132049,"threshold_uncertainty_score":0.0115171075},"labels":[],"label_agreement":null},{"id":"W2790139187","doi":"10.1109/mobisecserv.2018.8311439","title":"Graph-based wormhole attack detection in mobile ad hoc networks (MANETs)","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Wormhole; Computer science; Computer network; Eavesdropping; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Optimized Link State Routing Protocol; Routing protocol; Vehicular ad hoc network; Distributed computing; Routing (electronic design automation); Computer security; Wireless; Network packet; Engineering; Telecommunications","score_opus":0.01638776635677438,"score_gpt":0.25545489408887423,"score_spread":0.23906712773209984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790139187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049044114,0.0005227636,0.9480351,0.00029339205,0.000073298856,0.00011849329,0.00008592172,0.00072564906,0.0011012563],"genre_scores_gemma":[0.8418258,0.00090803823,0.1551956,0.00016780432,0.00008232365,0.000110144516,0.00026577996,0.000074063486,0.0013705426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.00033599607,0.000066348955,0.00023610264,0.00038703848,0.00009717655],"domain_scores_gemma":[0.99670154,0.0018950125,0.0005772072,0.00030634843,0.00041803284,0.000101889054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008185523,0.0007719705,0.00085059286,0.0018904975,0.0004462224,0.00091928826,0.001343394,0.0014029873,0.000430794],"category_scores_gemma":[0.0050257687,0.00042037963,0.0008197192,0.0011864648,0.0010242366,0.0025050354,0.00106467,0.00097370753,0.00018702011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002558425,0.0002003836,0.009473611,0.00034975493,0.00022665955,0.00058203225,0.00023636168,0.7723496,0.022770073,0.05902139,0.0033852032,0.13114904],"study_design_scores_gemma":[0.00000609075,0.000050053462,0.0004788654,0.000008915844,0.000016402595,0.000120967125,0.000020181771,0.9863772,0.0025007061,0.009725268,0.0006812742,0.000014152791],"about_ca_topic_score_codex":0.0023570354,"about_ca_topic_score_gemma":0.0019441553,"teacher_disagreement_score":0.0023570354,"about_ca_system_score_codex":0.0007255677,"about_ca_system_score_gemma":0.0005438915,"threshold_uncertainty_score":0.0052644014},"labels":[],"label_agreement":null},{"id":"W2795361217","doi":"10.1007/s11036-018-1039-6","title":"ARP Cache Poisoning and Routing Loops in ad Hoc Networks","year":2018,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Computer network; Spoofing attack; Distributed computing; Computer security","score_opus":0.0073162432554559394,"score_gpt":0.23369541544525932,"score_spread":0.22637917218980338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795361217","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51336473,0.009302733,0.452801,0.004305334,0.0004757535,0.00015181897,0.00017999075,0.0011220665,0.018296482],"genre_scores_gemma":[0.9809512,0.0015864514,0.013698074,0.00017848173,0.00028848037,0.00003265768,0.000072581344,0.00004700213,0.0031450316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975333,0.000931195,0.00014828525,0.00030224555,0.00083897874,0.00024599614],"domain_scores_gemma":[0.97527415,0.018019918,0.0032864998,0.0018588773,0.0012548881,0.00030559488],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029224076,0.00042903647,0.00081905624,0.001608507,0.0013695459,0.0023479292,0.0012197421,0.0025134603,0.0012430565],"category_scores_gemma":[0.022664135,0.0008221192,0.00038599715,0.001988497,0.003028497,0.0062240763,0.0014018962,0.0012367724,0.00025650486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001567328,0.000422544,0.027493715,0.00066328904,0.00026383623,0.0035264646,0.0019418237,0.45285589,0.011995172,0.36598024,0.007118507,0.1261712],"study_design_scores_gemma":[0.00010634923,0.00025442024,0.0024561842,0.000055900222,0.000177575,0.0026635274,0.00060709735,0.774461,0.008235587,0.20487562,0.0060636373,0.00004318555],"about_ca_topic_score_codex":0.0013006495,"about_ca_topic_score_gemma":0.0012673205,"teacher_disagreement_score":0.0029224076,"about_ca_system_score_codex":0.0010696012,"about_ca_system_score_gemma":0.00071435404,"threshold_uncertainty_score":0.015455306},"labels":[],"label_agreement":null},{"id":"W2795645808","doi":"10.1007/s11036-018-1035-x","title":"Editorial: MONET Special Issue on Recent Advances in Ad Hoc Networking","year":2018,"lang":"en","type":"editorial","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Telecommunications; Wireless","score_opus":0.005393729194766841,"score_gpt":0.2568154606705526,"score_spread":0.2514217314757858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795645808","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024419218,0.00460084,0.00011464968,0.01219043,0.98204535,0.000012772805,0.000039709554,0.000043787993,0.0009279493],"genre_scores_gemma":[0.00024659937,0.003579343,0.00006623929,0.005833293,0.9839188,0.000013396683,0.000034198085,0.000034860375,0.006273277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946806,0.00079100905,0.0006346583,0.0006315646,0.002778161,0.00048398276],"domain_scores_gemma":[0.97424287,0.0063845036,0.0025051543,0.00064265047,0.011708676,0.0045161876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006190713,0.0044652754,0.004961866,0.0064482125,0.002761396,0.009799832,0.0031936395,0.011247568,0.027551873],"category_scores_gemma":[0.020921202,0.0013469484,0.0026841036,0.002415907,0.0020938055,0.0039412845,0.0020184538,0.013398281,0.01840169],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049683884,0.000014631517,0.000033399123,0.00021452378,0.000022157097,0.00008032775,0.000005093125,0.000028767856,0.00007499489,0.00014691566,0.9935675,0.00576197],"study_design_scores_gemma":[0.000080009486,0.000047623274,0.00035298406,0.00035788974,0.00007775899,0.00022777196,0.000023984927,0.00019049564,0.00013415894,0.00069716637,0.9977914,0.000018681638],"about_ca_topic_score_codex":0.0010613328,"about_ca_topic_score_gemma":0.003999668,"teacher_disagreement_score":0.027551873,"about_ca_system_score_codex":0.0028928816,"about_ca_system_score_gemma":0.0027540252,"threshold_uncertainty_score":0.09217018},"labels":[],"label_agreement":null},{"id":"W2795803580","doi":"10.1007/s11036-018-1041-z","title":"A Routing and Interface Assignment Algorithm for Multi-Channel Multi-Interface Ad Hoc Networks","year":2018,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Interface (matter); Computer network; Algorithm; Viterbi algorithm; Wireless ad hoc network; Destination-Sequenced Distance Vector routing; Channel (broadcasting); Distributed computing; Routing (electronic design automation); Link-state routing protocol; Wireless; Routing protocol; Parallel computing; Telecommunications; Decoding methods","score_opus":0.02113163299793235,"score_gpt":0.288326920538177,"score_spread":0.26719528754024463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2795803580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008008687,0.00014930608,0.988117,0.00014799647,0.00014582169,0.00014049036,0.00005675814,0.0012493075,0.0019846288],"genre_scores_gemma":[0.11126692,0.00017062917,0.8840745,0.00010557398,0.00008712666,0.00025475243,0.00027000532,0.00016370529,0.0036068407],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994217,0.00014460982,0.000042289204,0.00009551073,0.00019834173,0.00009747479],"domain_scores_gemma":[0.99876153,0.00046751776,0.000082517065,0.00018439257,0.0004168568,0.00008720361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009310082,0.00096557965,0.0011375985,0.0011820946,0.0012744337,0.0012530496,0.002280492,0.0010895291,0.0043329992],"category_scores_gemma":[0.003375602,0.0005291016,0.00059290597,0.0013585214,0.00043968047,0.0020311263,0.0013830945,0.0014939636,0.0010985442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003899495,0.00039901648,0.0006941883,0.00016091479,0.0000813384,0.00010612059,0.0001451677,0.34548104,0.010709872,0.020320158,0.011517402,0.6099948],"study_design_scores_gemma":[0.000062957726,0.0000744339,0.00013748989,0.0000068935333,0.00002017234,0.000054982713,0.000024980096,0.9905087,0.0018034216,0.0053988122,0.0018918081,0.00001526234],"about_ca_topic_score_codex":0.0035195951,"about_ca_topic_score_gemma":0.0056325453,"teacher_disagreement_score":0.0043329992,"about_ca_system_score_codex":0.0008349845,"about_ca_system_score_gemma":0.0014840093,"threshold_uncertainty_score":0.014495313},"labels":[],"label_agreement":null},{"id":"W2798494602","doi":"10.1109/smartgridcomm.2017.8340677","title":"Performance analysis of large scale RF-mesh networks for smart cities and IoT","year":2017,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Wireless mesh network; Scalability; Mesh networking; Computer network; Retransmission; Distributed computing; Network topology; Context (archaeology); Smart city; Smart grid; Switched mesh; Throughput; Wireless network; Wireless; Internet of Things; Telecommunications; Embedded system; Database; Engineering","score_opus":0.012609295680942515,"score_gpt":0.24790677147258217,"score_spread":0.23529747579163965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798494602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4078196,0.0016490852,0.5737673,0.0013579695,0.00009251698,0.00010581199,0.00028890904,0.00028480744,0.014633917],"genre_scores_gemma":[0.9936605,0.00037478967,0.0047541996,0.000032509462,0.000023220307,0.000025282156,0.00005579407,0.000016367188,0.0010573128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956554,0.00018530268,0.000010982584,0.000051631596,0.0000903138,0.00009623255],"domain_scores_gemma":[0.9987888,0.0008000507,0.00016366913,0.00007205182,0.00013229679,0.00004312952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011544246,0.00045931397,0.00037306937,0.00041878573,0.00030526772,0.00050286896,0.00081430026,0.00061051897,0.0011906548],"category_scores_gemma":[0.0031918837,0.00018415347,0.00043309754,0.00038982418,0.00056924636,0.0008910126,0.0004883617,0.00039564457,0.00014190587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039742998,0.000018228879,0.00072423846,0.000023173088,0.000013617859,0.000033734108,0.000020936079,0.9871023,0.0013102989,0.0073849782,0.0003314237,0.0029971995],"study_design_scores_gemma":[0.0000010126417,0.000013028676,0.00014540578,0.0000015094075,0.0000029139796,0.0000070951564,0.0000064024007,0.99850583,0.00013097239,0.0011241602,0.00005997868,0.0000016884358],"about_ca_topic_score_codex":0.0048066266,"about_ca_topic_score_gemma":0.0025184506,"teacher_disagreement_score":0.0048066266,"about_ca_system_score_codex":0.0015496874,"about_ca_system_score_gemma":0.000475657,"threshold_uncertainty_score":0.01124382},"labels":[],"label_agreement":null},{"id":"W2801034136","doi":"10.5539/mas.v12n5p22","title":"Policy Based Approach for Information Transfer over Mobile ad hoc Network using Messages Privacy Control","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Node (physics); Vehicular ad hoc network; Router; Computer security; Delay-tolerant networking; Wireless; Network packet; Telecommunications","score_opus":0.0149964431508815,"score_gpt":0.2573389651260419,"score_spread":0.24234252197516037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801034136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011271239,0.0004220163,0.9821814,0.0003160536,0.00008111117,0.00025195803,0.000030304696,0.0005669894,0.0048789857],"genre_scores_gemma":[0.7400165,0.0010060078,0.2496752,0.00023467978,0.000160089,0.00048572483,0.00015999711,0.000081474966,0.0081802355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739575,0.00083145354,0.00018571851,0.00036797381,0.0010162472,0.00020281483],"domain_scores_gemma":[0.9988682,0.0004853832,0.00013857636,0.00021141983,0.00024136982,0.000055083983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015336025,0.0004874304,0.0005638967,0.0007992648,0.0008580548,0.0015792144,0.0013669019,0.0010088466,0.0013034894],"category_scores_gemma":[0.0022388678,0.00020977326,0.000744385,0.00065336644,0.0008178841,0.001854187,0.0011926703,0.0009773239,0.00036833883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042238334,0.0005574165,0.0037262065,0.0005737717,0.00023390981,0.0012048215,0.0014091245,0.32913846,0.040285323,0.2925679,0.0052027293,0.32467794],"study_design_scores_gemma":[0.000052257474,0.00025831274,0.00040872238,0.00004369295,0.00008332456,0.0005018055,0.00015880467,0.91453063,0.016670387,0.049593706,0.01765727,0.0000410129],"about_ca_topic_score_codex":0.0011687608,"about_ca_topic_score_gemma":0.0006010062,"teacher_disagreement_score":0.0015792144,"about_ca_system_score_codex":0.0007969224,"about_ca_system_score_gemma":0.0012874404,"threshold_uncertainty_score":0.008110523},"labels":[],"label_agreement":null},{"id":"W2802128095","doi":"10.5539/cis.v11n2p64","title":"An Enhanced Queue Management Approach for Greedy Routing in MANETs","year":2018,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Distributed computing; Packet forwarding; Network packet; Greedy algorithm; Algorithm","score_opus":0.011909564469646278,"score_gpt":0.2534712854118189,"score_spread":0.24156172094217263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2802128095","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013291002,0.0006583,0.9826962,0.00025910547,0.00024032524,0.00012071551,0.00006222761,0.00042390465,0.0022483594],"genre_scores_gemma":[0.70945257,0.0008344399,0.28427553,0.0003304035,0.00027246453,0.0001699875,0.00017154453,0.00006786585,0.0044251685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944013,0.000117516654,0.000041353138,0.000102170765,0.00020530599,0.000093543254],"domain_scores_gemma":[0.9993988,0.00018469366,0.00006056297,0.00006658414,0.00023101752,0.00005834001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009937297,0.00051017886,0.0006166406,0.00078887417,0.0008223617,0.00090759597,0.0019366402,0.00053678727,0.0016513201],"category_scores_gemma":[0.0018348057,0.00019092983,0.00047930112,0.00077562383,0.00045736454,0.0012189263,0.00077315647,0.0006667557,0.00031518558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044532726,0.00025070045,0.0023354518,0.00027550763,0.00012529602,0.00030307862,0.00031907216,0.5658965,0.021098608,0.10499466,0.008641519,0.2953142],"study_design_scores_gemma":[0.00002905772,0.000105336534,0.00014740217,0.000008234889,0.000025064137,0.00006775854,0.000022295737,0.98570824,0.001350187,0.0097213695,0.0027971696,0.000017867607],"about_ca_topic_score_codex":0.0041456567,"about_ca_topic_score_gemma":0.0053674793,"teacher_disagreement_score":0.0041456567,"about_ca_system_score_codex":0.0011674489,"about_ca_system_score_gemma":0.0015735682,"threshold_uncertainty_score":0.008470476},"labels":[],"label_agreement":null},{"id":"W2807377293","doi":"10.1007/s12083-018-0658-9","title":"Localized topology control and on-demand power-efficient routing for wireless ad hoc and sensor networks","year":2018,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Research and Development Corporation of Newfoundland and Labrador; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Topology control; Computer science; Computer network; Routing protocol; Topology (electrical circuits); Distributed computing; Wireless ad hoc network; Link-state routing protocol; Optimized Link State Routing Protocol; Geographic routing; Network topology; Dynamic Source Routing; Network packet; Wireless network; Wireless; Key distribution in wireless sensor networks; Mathematics; Telecommunications","score_opus":0.011553187671306584,"score_gpt":0.2658277026464752,"score_spread":0.2542745149751686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807377293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02340733,0.001330922,0.9703053,0.0004123264,0.00018631981,0.000041569725,0.00004147536,0.00031994478,0.003954766],"genre_scores_gemma":[0.9262555,0.0014336214,0.06454066,0.00012046615,0.0002819258,0.00009133502,0.00009867576,0.00009148218,0.0070864344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958616,0.0001284798,0.000018840685,0.000081579936,0.00014454799,0.000040399787],"domain_scores_gemma":[0.999257,0.0003689734,0.00009642937,0.00011610367,0.00013372744,0.00002759451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005252075,0.000516387,0.0006266832,0.0004942123,0.00038260198,0.00092437107,0.0012601856,0.0005598283,0.0013599538],"category_scores_gemma":[0.0020952518,0.0002630863,0.00029021644,0.0006981795,0.0008408333,0.0013916648,0.00071295915,0.0006929513,0.00022971426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021592219,0.0001166715,0.00042487367,0.00024220126,0.000050405644,0.00014053166,0.00018858319,0.7107327,0.022217479,0.08155867,0.0043737674,0.17973824],"study_design_scores_gemma":[0.000014315554,0.00008539917,0.00019525427,0.0000063202924,0.000013409631,0.000047184352,0.00002974214,0.972913,0.0024123024,0.02265234,0.0016207839,0.000009967502],"about_ca_topic_score_codex":0.0011280817,"about_ca_topic_score_gemma":0.0018579988,"teacher_disagreement_score":0.0013599538,"about_ca_system_score_codex":0.00054663274,"about_ca_system_score_gemma":0.0003889735,"threshold_uncertainty_score":0.0045494437},"labels":[],"label_agreement":null},{"id":"W2808356940","doi":"10.1002/net.21928","title":"Minimum shared‐power edge cut","year":2020,"lang":"en","type":"preprint","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo; Collège Boréal","funders":"Natural Sciences and Engineering Research Council of Canada; Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Rectangle; Combinatorics; Time complexity; Mathematics; Unit disk graph; Undirected graph; Polynomial-time approximation scheme; Enhanced Data Rates for GSM Evolution; Bounded function; Dominating set; Matching (statistics); Approximation algorithm; Graph; Discrete mathematics; Computational complexity theory; Computer science; Algorithm; Wireless network; Wireless; Geometry; Vertex (graph theory)","score_opus":0.022143382076043324,"score_gpt":0.2493531432810017,"score_spread":0.22720976120495837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808356940","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15192671,0.00080209714,0.8293485,0.0016313016,0.00018786006,0.00029340066,0.0012248573,0.0005513038,0.014033994],"genre_scores_gemma":[0.7010105,0.00039179545,0.28730354,0.00031379974,0.00012809539,0.0002679095,0.0018207213,0.00024281355,0.008520835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998643,0.0003570351,0.00007588352,0.00034305357,0.00035292332,0.00022811837],"domain_scores_gemma":[0.99750644,0.0014378316,0.00019732362,0.00033972846,0.00029818146,0.00022054836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090962386,0.0009204075,0.0012355967,0.0006997581,0.000795008,0.0016739044,0.002125051,0.0015550642,0.007876982],"category_scores_gemma":[0.004143878,0.00047219187,0.00077291485,0.0013876891,0.00091452344,0.0030942687,0.0018358032,0.0013785214,0.00053120527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007615201,0.00038110022,0.0026831685,0.00069310213,0.00023761422,0.00067703676,0.00031239667,0.64437026,0.009358731,0.14272928,0.021794697,0.17600112],"study_design_scores_gemma":[0.00010183753,0.00014221085,0.00069335505,0.000052231295,0.000048064892,0.00045908714,0.00019445593,0.7698555,0.0052476875,0.21339886,0.009786395,0.000020274467],"about_ca_topic_score_codex":0.0010471311,"about_ca_topic_score_gemma":0.0010427162,"teacher_disagreement_score":0.007876982,"about_ca_system_score_codex":0.00080433075,"about_ca_system_score_gemma":0.00074254075,"threshold_uncertainty_score":0.026351154},"labels":[],"label_agreement":null},{"id":"W2885286232","doi":"10.5220/0006887400330041","title":"Virtual Network Function Embedding in Multi-hop Wireless Networks","year":2018,"lang":"en","type":"article","venue":"Proceedings of the 15th International Joint Conference on e-Business and Telecommunications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Wireless network; Hop (telecommunications); Embedding; Wireless; Function (biology); Telecommunications; Artificial intelligence","score_opus":0.03782564509283265,"score_gpt":0.2738773545437266,"score_spread":0.23605170945089393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885286232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06691095,0.00029877486,0.9298233,0.00018197086,0.00006890105,0.000018192339,0.000025594605,0.00021440342,0.0024578604],"genre_scores_gemma":[0.88362426,0.0003621798,0.112183034,0.00004925539,0.000040249874,0.000044122276,0.000066335575,0.00006936988,0.0035613568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994325,0.0002874893,0.000024020115,0.00006707165,0.00012294973,0.00006593432],"domain_scores_gemma":[0.99863523,0.0007287034,0.00010174897,0.00026742197,0.00019765545,0.00006920985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080810825,0.0004857347,0.00047125365,0.00062564894,0.00036301135,0.0011939729,0.0008143166,0.00055119843,0.0011096802],"category_scores_gemma":[0.0030443452,0.00023325124,0.0002484472,0.0005012302,0.00074568315,0.0021096938,0.0013737816,0.00079476525,0.00021477978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035257108,0.00013438039,0.0009178693,0.00014351752,0.00004601199,0.00022116497,0.00025288103,0.5475322,0.016571704,0.26369405,0.0019860428,0.16814758],"study_design_scores_gemma":[0.0000048981638,0.00003934612,0.000102049264,0.000009398821,0.000008370062,0.000064074135,0.00002882181,0.96409845,0.002682927,0.031541567,0.0014141889,0.0000058817654],"about_ca_topic_score_codex":0.0005545343,"about_ca_topic_score_gemma":0.000638857,"teacher_disagreement_score":0.0011939729,"about_ca_system_score_codex":0.00051330635,"about_ca_system_score_gemma":0.00035575865,"threshold_uncertainty_score":0.0042737126},"labels":[],"label_agreement":null},{"id":"W2887878543","doi":"10.1109/icc.2018.8422314","title":"Multihop Multicast Header Compression in MANETs","year":2018,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer network; Computer science; Multicast; Unicast; Header; Network packet; Mobile ad hoc network; Distributed computing","score_opus":0.01915212374659019,"score_gpt":0.2745981376373997,"score_spread":0.2554460138908095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887878543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10228067,0.0044664284,0.8819004,0.0005123042,0.00028609013,0.00030318112,0.00017977814,0.0015620298,0.008509086],"genre_scores_gemma":[0.75696373,0.0032940712,0.23467101,0.00019171782,0.00031714956,0.00024093447,0.00030072522,0.00010411476,0.003916461],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956125,0.00013043027,0.00002567888,0.000038688446,0.00019585689,0.000048022623],"domain_scores_gemma":[0.99946314,0.0002436398,0.00007917615,0.000078258054,0.00011257117,0.000023202767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074321614,0.00031130007,0.00039471049,0.0011263851,0.00058967114,0.00048671284,0.00060234725,0.0006478161,0.0007133496],"category_scores_gemma":[0.0014853589,0.00025980867,0.00019661465,0.0008787715,0.00032194686,0.0008889579,0.0005076504,0.00039702212,0.00021472634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000348382,0.00019180581,0.0032824182,0.0006297782,0.000078214754,0.0010576267,0.00037980705,0.33329523,0.07419402,0.04701825,0.0062559876,0.5332686],"study_design_scores_gemma":[0.000048887316,0.00042265357,0.0024002008,0.00010342045,0.00006188718,0.0011935944,0.00023816834,0.8866486,0.056157615,0.031230753,0.021436442,0.00005786801],"about_ca_topic_score_codex":0.0009320626,"about_ca_topic_score_gemma":0.0007527163,"teacher_disagreement_score":0.0011263851,"about_ca_system_score_codex":0.0003833881,"about_ca_system_score_gemma":0.0003393911,"threshold_uncertainty_score":0.003930509},"labels":[],"label_agreement":null},{"id":"W2888511005","doi":"10.4236/ijcns.2018.117009","title":"P2P Overlay Performance in Large-Scale MANETs","year":2018,"lang":"en","type":"article","venue":"International Journal of Communications Network and System Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Army Research Laboratory; Research, Development and Engineering Command","keywords":"Computer network; Computer science; Overlay network; Mobile ad hoc network; Chord (peer-to-peer); Bottleneck; Overlay; Distributed computing; Flooding (psychology); Routing protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing (electronic design automation); Network packet; Wireless; The Internet; Embedded system","score_opus":0.01918824986636469,"score_gpt":0.28550747417733097,"score_spread":0.2663192243109663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888511005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93162453,0.0013894684,0.058363482,0.00046065057,0.00013545454,0.00011613442,0.00021844132,0.0013065253,0.006385307],"genre_scores_gemma":[0.9916433,0.00030519834,0.0074773496,0.000019879008,0.00001234696,0.000019374136,0.00011035434,0.000038588172,0.00037372808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869627,0.00043917994,0.00006944735,0.00017066093,0.00042246116,0.00020210649],"domain_scores_gemma":[0.9954491,0.0029350598,0.00024898292,0.0004480723,0.0006644353,0.00025434495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020834932,0.00067204534,0.0006138983,0.00067583355,0.0010170281,0.0009809032,0.000761122,0.00083134836,0.00075981097],"category_scores_gemma":[0.00840526,0.0003042441,0.00020933848,0.0009952304,0.0007343884,0.002835009,0.0010543374,0.00057707797,0.00024526002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522698,0.00025909353,0.008474748,0.00038035208,0.00015133906,0.000876972,0.00065274467,0.9018136,0.034292843,0.006421087,0.0028896683,0.0431352],"study_design_scores_gemma":[0.000054832926,0.0007392424,0.004607762,0.00002200219,0.000055352124,0.00037865367,0.0006436507,0.96545327,0.020379124,0.005769637,0.001852023,0.00004447087],"about_ca_topic_score_codex":0.0049254447,"about_ca_topic_score_gemma":0.0027076064,"teacher_disagreement_score":0.0049254447,"about_ca_system_score_codex":0.00072531943,"about_ca_system_score_gemma":0.00048131513,"threshold_uncertainty_score":0.011018693},"labels":[],"label_agreement":null},{"id":"W2890009228","doi":"10.1109/tvt.2018.2871036","title":"A Markov Model for Batch-Based Opportunistic Routing in Multi-Hop Wireless Mesh Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Research and Development Corporation of Newfoundland and Labrador","keywords":"Computer network; Computer science; Wireless mesh network; Markov chain; Markov model; Hop (telecommunications); Wireless; Markov process; Wireless network; Distributed computing; Telecommunications; Mathematics","score_opus":0.025278024483775762,"score_gpt":0.2617061739582279,"score_spread":0.23642814947445212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890009228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013763604,0.00036448272,0.98112315,0.0004465642,0.00009222125,0.00007950637,0.000300535,0.0002655221,0.0035644395],"genre_scores_gemma":[0.87336147,0.0014216859,0.11205859,0.00027804903,0.0002397518,0.0005889415,0.0006515744,0.000110543544,0.011289499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991289,0.00025082496,0.000047355097,0.00018189612,0.00021060454,0.00018040264],"domain_scores_gemma":[0.99761367,0.0015913185,0.00027324483,0.00016954674,0.00023819477,0.00011399145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015076553,0.0007607866,0.0010089206,0.0006966664,0.0008953532,0.0011888184,0.002731754,0.001420238,0.0033358466],"category_scores_gemma":[0.0036243293,0.0006299323,0.001169327,0.00087970006,0.0013861286,0.0023926187,0.0010988561,0.0017945238,0.0005345657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076504715,0.000047602767,0.00088262546,0.0000711899,0.000028855029,0.00022340189,0.0001362809,0.7539503,0.0016759922,0.2351189,0.0015010628,0.006287342],"study_design_scores_gemma":[0.00001073514,0.000018072782,0.00009139631,0.000006258916,0.00000822014,0.000026525171,0.000008795866,0.97378427,0.00018135396,0.025287522,0.0005662576,0.000010618636],"about_ca_topic_score_codex":0.012782521,"about_ca_topic_score_gemma":0.010615663,"teacher_disagreement_score":0.012782521,"about_ca_system_score_codex":0.002729162,"about_ca_system_score_gemma":0.001724478,"threshold_uncertainty_score":0.025416195},"labels":[],"label_agreement":null},{"id":"W2890194468","doi":"10.20944/preprints201809.0329.v1","title":"A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks","year":2018,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cluster analysis; Ant colony optimization algorithms; Scalability; Wireless ad hoc network; Cluster (spacecraft); Algorithm; Simple (philosophy); Selection (genetic algorithm); k-medoids; Stability (learning theory); Correlation clustering; CURE data clustering algorithm; Artificial intelligence; Computer network; Machine learning","score_opus":0.045942701961057195,"score_gpt":0.3168136811283892,"score_spread":0.270870979167332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890194468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010332542,0.0005387129,0.98644316,0.00010288783,0.00008404855,0.00013728619,0.000024124976,0.0003705566,0.0019666913],"genre_scores_gemma":[0.31818244,0.00071326253,0.6754961,0.00013834592,0.00010310117,0.00037233683,0.00014418154,0.00010560011,0.0047445768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999383,0.00018612295,0.000030027695,0.000103784965,0.00026770515,0.000029346766],"domain_scores_gemma":[0.9994929,0.00021427633,0.00006097616,0.000051616225,0.00015271592,0.000027414268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062467385,0.0008071316,0.0010870814,0.00058612396,0.000591632,0.0006616949,0.0014978709,0.0010596208,0.0008076452],"category_scores_gemma":[0.0018542046,0.0003490943,0.00037418495,0.0012482397,0.00061401824,0.0008143682,0.0006692156,0.0007141703,0.00032022654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000622683,0.0000780257,0.00062627735,0.00014665637,0.00006823994,0.00007557997,0.00008916919,0.81275946,0.007885065,0.011702876,0.002603115,0.1639034],"study_design_scores_gemma":[0.000021597518,0.000049859078,0.000131555,0.000004395328,0.0000097424345,0.00003237827,0.00000807342,0.9943751,0.0011759597,0.0026135468,0.0015695456,0.000008201481],"about_ca_topic_score_codex":0.002455163,"about_ca_topic_score_gemma":0.0029733726,"teacher_disagreement_score":0.002455163,"about_ca_system_score_codex":0.0003916365,"about_ca_system_score_gemma":0.0008599009,"threshold_uncertainty_score":0.0048817396},"labels":[],"label_agreement":null},{"id":"W2891564882","doi":"","title":"Linear Node Movement Patterns in MANETS","year":2013,"lang":"en","type":"article","venue":"International Conference on Wireless and Mobile Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Node (physics); Computer network; Mobile ad hoc network; Movement (music); Network packet; Engineering","score_opus":0.03737594421789338,"score_gpt":0.29769377330529945,"score_spread":0.2603178290874061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891564882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57094866,0.0013445781,0.417466,0.00071298843,0.000101000136,0.00017076988,0.0010211621,0.0006374681,0.0075973477],"genre_scores_gemma":[0.97825044,0.0005336572,0.01651432,0.000053082458,0.00003137518,0.00006732398,0.00044779104,0.000046549936,0.004055409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999337,0.00022466325,0.000047370115,0.00013204121,0.00015358841,0.00010529282],"domain_scores_gemma":[0.99614465,0.0021461337,0.0006258597,0.00031281097,0.0005585554,0.00021193238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009113737,0.0002833693,0.0004476285,0.0016992238,0.00054449914,0.0008807338,0.0008302298,0.00055429945,0.0017182293],"category_scores_gemma":[0.0068150214,0.00049400085,0.0002536657,0.0023262005,0.0006238998,0.0013987814,0.0007661081,0.00047175412,0.00055482937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006682623,0.0001753674,0.059549704,0.00036040443,0.00011905421,0.00091634353,0.00075757527,0.7472816,0.008113195,0.057701908,0.004236661,0.12011984],"study_design_scores_gemma":[0.000018505374,0.00012421061,0.010589712,0.000030213476,0.000021434782,0.0005856022,0.00039029086,0.95744115,0.0012759045,0.02707863,0.0024200454,0.000024332747],"about_ca_topic_score_codex":0.0030244945,"about_ca_topic_score_gemma":0.004371772,"teacher_disagreement_score":0.0030244945,"about_ca_system_score_codex":0.00064662466,"about_ca_system_score_gemma":0.00042608724,"threshold_uncertainty_score":0.006013751},"labels":[],"label_agreement":null},{"id":"W2899131070","doi":"","title":"A Design Framework for Wireless MANET QoS Gateway","year":2005,"lang":"en","type":"article","venue":"European Wireless Conference","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Quality of service; Node (physics); Reservation; Distributed computing; Wireless ad hoc network; Default gateway; Wireless; Telecommunications; Network packet; Engineering","score_opus":0.039799746002381974,"score_gpt":0.2546712355194666,"score_spread":0.2148714895170846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899131070","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014313244,0.00021690516,0.9908394,0.00026787506,0.000116164876,0.00019729353,0.000035913923,0.0011342836,0.0057607633],"genre_scores_gemma":[0.066132255,0.00082645024,0.9118527,0.00042251183,0.00015688378,0.0010322356,0.0002525054,0.00047697028,0.018847508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939275,0.00013630613,0.00005960194,0.000097212964,0.00023323536,0.000080903184],"domain_scores_gemma":[0.999608,0.000060177998,0.0000316802,0.00008614249,0.00013948917,0.000074491836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017627849,0.0007240101,0.0004898548,0.00072721276,0.0010646852,0.002591212,0.002429841,0.0019094805,0.0045531476],"category_scores_gemma":[0.0015281135,0.00069996394,0.0009973937,0.0004178494,0.00091857556,0.0021773828,0.0019441416,0.0023425573,0.002602715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008207493,0.0000996911,0.0003968092,0.000275294,0.00005301896,0.0008803982,0.00092639745,0.03422861,0.021140473,0.82948554,0.0118878875,0.1005439],"study_design_scores_gemma":[0.000108040804,0.0002667223,0.0002846818,0.00020414042,0.00012581886,0.0016015689,0.00024114312,0.342912,0.01651499,0.15372324,0.48391017,0.00010760112],"about_ca_topic_score_codex":0.0016289754,"about_ca_topic_score_gemma":0.0018170002,"teacher_disagreement_score":0.0045531476,"about_ca_system_score_codex":0.00094502093,"about_ca_system_score_gemma":0.0014216616,"threshold_uncertainty_score":0.015231788},"labels":[],"label_agreement":null},{"id":"W2902116167","doi":"10.3390/jlpea8040049","title":"Enhancing Reliability of Tactical MANETs by Improving Routing Decisions","year":2018,"lang":"en","type":"article","venue":"Journal of Low Power Electronics and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Federation for the Humanities and Social Sciences","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Ad hoc On-Demand Distance Vector Routing; Link-state routing protocol; Routing protocol; Zone Routing Protocol; Distributed computing; Routing (electronic design automation)","score_opus":0.004376744065699563,"score_gpt":0.24526387507471667,"score_spread":0.2408871310090171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902116167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33764225,0.00231657,0.64931107,0.0005686025,0.00022722238,0.00012437918,0.0000806953,0.0010351482,0.008694103],"genre_scores_gemma":[0.9687001,0.00062505115,0.029789256,0.000051321127,0.00005206786,0.000028321954,0.000046873563,0.000025315298,0.00068150635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993204,0.00022884856,0.000044184486,0.000102466955,0.00023655183,0.0000675244],"domain_scores_gemma":[0.9969643,0.0014097557,0.00057323714,0.0004197976,0.0005591387,0.00007379867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010112089,0.0006732117,0.00037231084,0.0005643191,0.0003261048,0.0008419991,0.00082560204,0.00047307464,0.0004960298],"category_scores_gemma":[0.0055535105,0.00023190102,0.00018830359,0.00045294708,0.00028736156,0.0010500482,0.00062965025,0.00050964474,0.00024533604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002413828,0.00013643944,0.00503244,0.0002515486,0.0000853165,0.00025722917,0.00028593108,0.6893281,0.08015541,0.008481402,0.0011280067,0.21461678],"study_design_scores_gemma":[0.00001899055,0.0004187325,0.0016202471,0.000025333811,0.000066592984,0.0002093834,0.00011743385,0.97230285,0.017709473,0.0048899986,0.0025941564,0.000026823296],"about_ca_topic_score_codex":0.0005805143,"about_ca_topic_score_gemma":0.00076892576,"teacher_disagreement_score":0.0010112089,"about_ca_system_score_codex":0.00027337845,"about_ca_system_score_gemma":0.00044237426,"threshold_uncertainty_score":0.005347848},"labels":[],"label_agreement":null},{"id":"W2903285415","doi":"10.5539/mas.v12n12p185","title":"Comprehensive Overview of Security and Privacy of Data Transfer in Wireless ad Hock Network","year":2018,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Node (physics); Mobile ad hoc network; Wireless network; Computer security; Wireless WAN; Wireless; Network packet; Wi-Fi array; Telecommunications","score_opus":0.0622603907044706,"score_gpt":0.30016851279027257,"score_spread":0.23790812208580198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903285415","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009813129,0.49794355,0.34762648,0.0070348303,0.0019979142,0.00036413004,0.00041740036,0.0004854292,0.13431723],"genre_scores_gemma":[0.19943298,0.61724323,0.14247423,0.002433428,0.006081903,0.000565231,0.0010307261,0.00011438311,0.030623885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981811,0.0004966353,0.00018934233,0.00022096625,0.000761078,0.0001509016],"domain_scores_gemma":[0.9990716,0.00046355868,0.000069848466,0.00013783755,0.00022084998,0.000036354006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013480597,0.0006326208,0.00060856267,0.0017940669,0.0010465194,0.0024018337,0.000865317,0.0012914675,0.0024886962],"category_scores_gemma":[0.0014999078,0.0003702214,0.00072722975,0.0023508184,0.0011777265,0.004688749,0.0012578856,0.0018099713,0.000867778],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006984711,0.000115437935,0.0015219545,0.0033861925,0.00007667182,0.0008243768,0.0007707842,0.0077774245,0.003534175,0.5056933,0.032061215,0.4441687],"study_design_scores_gemma":[0.0000136191375,0.000227725,0.0017936712,0.0015677401,0.00010519474,0.0033290796,0.0004599803,0.026569985,0.0032540248,0.21561137,0.746984,0.000083526764],"about_ca_topic_score_codex":0.0010547889,"about_ca_topic_score_gemma":0.0006095945,"teacher_disagreement_score":0.0024886962,"about_ca_system_score_codex":0.0011859525,"about_ca_system_score_gemma":0.00142978,"threshold_uncertainty_score":0.008604765},"labels":[],"label_agreement":null},{"id":"W2907408383","doi":"10.1109/milcom.2018.8599776","title":"Impact of Header Compression on Tactical Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"Defence Research and Development Canada","keywords":"Computer network; Computer science; Header; Network packet","score_opus":0.021525322116125997,"score_gpt":0.31224525173606493,"score_spread":0.2907199296199389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907408383","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9607721,0.0025798478,0.023360746,0.00036262834,0.00017886834,0.00014382841,0.00021813568,0.00063523283,0.011748554],"genre_scores_gemma":[0.9947338,0.00056536635,0.0039266627,0.00006472287,0.000035311175,0.000016176165,0.00009744282,0.00002624054,0.0005342992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989754,0.00031563698,0.000038831466,0.000068769965,0.0004255716,0.00017582241],"domain_scores_gemma":[0.99091023,0.006728521,0.0007551214,0.0005881918,0.00088689046,0.00013103458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600691,0.00066214916,0.00035974075,0.0006620778,0.0005216274,0.00067332335,0.00056740304,0.00054440624,0.0014114637],"category_scores_gemma":[0.006790482,0.00014151212,0.00016231752,0.00070433016,0.00051678653,0.0011107483,0.0004317204,0.00042336018,0.00017906842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013304898,0.0003807666,0.00982099,0.00041561434,0.000081680875,0.0013841542,0.00017679315,0.74142915,0.087027654,0.0047808667,0.0019696942,0.15120213],"study_design_scores_gemma":[0.000068168156,0.0019353084,0.013662813,0.00011882049,0.0001774741,0.0013411563,0.00031420978,0.8308777,0.1447404,0.002990476,0.0037155459,0.000057795107],"about_ca_topic_score_codex":0.0021504355,"about_ca_topic_score_gemma":0.001483678,"teacher_disagreement_score":0.0021504355,"about_ca_system_score_codex":0.0008776,"about_ca_system_score_gemma":0.00043545724,"threshold_uncertainty_score":0.0063675046},"labels":[],"label_agreement":null},{"id":"W2908959188","doi":"10.1109/apusncursinrsm.2018.8608219","title":"A New Way to Integrate Physics-Based Channel Models in Communication System Design","year":2018,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Protocol design; Computer science; Channel (broadcasting); Simple (philosophy); Wireless; Protocol (science); Systems design; Communications protocol; Point (geometry); Wireless network; Network planning and design; Communications system; Distributed computing; Computer network; Systems engineering; Telecommunications; Engineering; Software engineering","score_opus":0.04485006899753208,"score_gpt":0.2551786826850183,"score_spread":0.21032861368748623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2908959188","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00094404834,0.00014626434,0.9939581,0.00044345783,0.00011140446,0.000022439242,0.000016469623,0.00014867297,0.004209181],"genre_scores_gemma":[0.15800875,0.0017487265,0.82828385,0.00079519325,0.00034796333,0.00028061538,0.00008186464,0.000414588,0.0100383805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989624,0.0002822491,0.000050717626,0.00012427283,0.00051726896,0.00006304354],"domain_scores_gemma":[0.9988876,0.00040616066,0.000079765334,0.0003514206,0.00022731785,0.000047778274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011737607,0.001058871,0.00090879016,0.0009875303,0.0007702404,0.0019724446,0.0019056911,0.0015616711,0.0039312188],"category_scores_gemma":[0.0025761297,0.0010272964,0.001618865,0.0006140665,0.0020155474,0.0047740713,0.001928005,0.0036394934,0.0013147998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038186285,0.00014051226,0.00035393063,0.0001986208,0.00011553441,0.00012679657,0.00022559882,0.36080196,0.008369875,0.58564854,0.0024265368,0.04155389],"study_design_scores_gemma":[0.000028149925,0.00012714796,0.00009354742,0.00005899546,0.00003915643,0.00014548197,0.00004392813,0.7338864,0.0029072014,0.23677075,0.02584867,0.0000505412],"about_ca_topic_score_codex":0.0014949306,"about_ca_topic_score_gemma":0.0020786014,"teacher_disagreement_score":0.0039312188,"about_ca_system_score_codex":0.00094082195,"about_ca_system_score_gemma":0.0016051303,"threshold_uncertainty_score":0.013151228},"labels":[],"label_agreement":null},{"id":"W2913342302","doi":"10.5539/cis.v12n1p82","title":"Ant Colony Optimization (ACO) Based MANET Routing Protocols: A Comprehensive Review","year":2019,"lang":"en","type":"review","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Bottleneck; Mobile ad hoc network; Computer network; Network packet; Ant colony optimization algorithms; Routing protocol; Field (mathematics); Routing (electronic design automation); Link-state routing protocol; Popularity; Distributed computing; Artificial intelligence; Embedded system","score_opus":0.056941282567146104,"score_gpt":0.3402812193928622,"score_spread":0.2833399368257161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913342302","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000641488,0.9925027,0.0025921687,0.00046110802,0.00029100722,0.000022416323,0.000040154682,0.000034328048,0.0034147468],"genre_scores_gemma":[0.0031797888,0.9931552,0.0023721687,0.0001401503,0.00018036409,0.000016982323,0.000058190348,0.0000062825557,0.00089092046],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997253,0.0000401787,0.000042452626,0.000045556146,0.00012643651,0.00002011622],"domain_scores_gemma":[0.99926287,0.00035184043,0.000091864844,0.000022183474,0.00024066996,0.000030597228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005987153,0.000725669,0.0009093748,0.0020591894,0.0002959399,0.0009561449,0.0009911319,0.00077984045,0.0020943247],"category_scores_gemma":[0.0012041866,0.00035637457,0.0004983416,0.0032765376,0.00028661735,0.0012079668,0.00047522198,0.0009064616,0.0012613685],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000349982,0.00010724841,0.00043629424,0.013679957,0.000086752334,0.00015600266,0.000065678476,0.0032841824,0.0014411055,0.0061947675,0.016136702,0.9583763],"study_design_scores_gemma":[0.000013619487,0.00025157334,0.0011674867,0.0047259275,0.00026030827,0.0011995884,0.00014003835,0.0029899003,0.0015487556,0.005304986,0.98234415,0.000053609972],"about_ca_topic_score_codex":0.0014549245,"about_ca_topic_score_gemma":0.0016366856,"teacher_disagreement_score":0.0020943247,"about_ca_system_score_codex":0.00041461343,"about_ca_system_score_gemma":0.0012103659,"threshold_uncertainty_score":0.007006228},"labels":[],"label_agreement":null},{"id":"W2914236913","doi":"","title":"Proceedings of the 9th international conference on Ad-hoc, mobile and wireless networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Alberta","funders":"","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Telecommunications; Wireless","score_opus":0.009593081558831332,"score_gpt":0.2290555007815801,"score_spread":0.21946241922274878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914236913","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03382551,0.04788701,0.31023902,0.012609471,0.117142364,0.0008672573,0.0017582155,0.004341442,0.47132975],"genre_scores_gemma":[0.10124124,0.030847995,0.06514941,0.0021874344,0.007735583,0.0003282239,0.0043945196,0.0006695262,0.787446],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993228,0.00016142582,0.00004107827,0.00008994199,0.0002856089,0.00009924786],"domain_scores_gemma":[0.9977914,0.00035406934,0.00006143966,0.0002823891,0.0011030422,0.00040770703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016168832,0.0008588863,0.0011531705,0.0006533845,0.00074404594,0.0027059282,0.0010400104,0.0011002241,0.049812682],"category_scores_gemma":[0.0017321826,0.00023478277,0.00049976795,0.0007447508,0.00067320175,0.0016561775,0.0009039905,0.0016452938,0.027930912],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058094366,0.0005320817,0.002081357,0.0004485008,0.00010095686,0.0003202434,0.00015291105,0.002451409,0.008774255,0.012981456,0.4460803,0.5254955],"study_design_scores_gemma":[0.000037161728,0.00021754517,0.0017423433,0.00020230269,0.00011417802,0.00043164805,0.00021076456,0.01980504,0.005122199,0.005652999,0.9664352,0.000028696373],"about_ca_topic_score_codex":0.0032030696,"about_ca_topic_score_gemma":0.007474264,"teacher_disagreement_score":0.049812682,"about_ca_system_score_codex":0.00050294085,"about_ca_system_score_gemma":0.0015070079,"threshold_uncertainty_score":0.16663998},"labels":[],"label_agreement":null},{"id":"W2920976905","doi":"","title":"Gossiping with interference in radio chain networks","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"","keywords":"Gossip; Computer science; Computer network; Node (physics); Upper and lower bounds; Communication source; Transmission (telecommunications); Message passing; Focus (optics); Distributed computing; Mathematics; Telecommunications","score_opus":0.012008251942115163,"score_gpt":0.21610835670665546,"score_spread":0.2041001047645403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920976905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05852254,0.0020653072,0.9260004,0.0005307705,0.0001561503,0.00012930298,0.0000955278,0.0003664035,0.012133699],"genre_scores_gemma":[0.8053577,0.0034144202,0.177395,0.00021078736,0.0004219204,0.00038403747,0.0003022475,0.00020293504,0.012310965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988493,0.00041564292,0.000071917915,0.00021519471,0.00027776283,0.00017016001],"domain_scores_gemma":[0.99648654,0.002661158,0.0003242767,0.00022576113,0.00016248967,0.00013969411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014207797,0.00083524745,0.0009668749,0.00069053454,0.00089261984,0.001562394,0.0010785039,0.0010443984,0.0022414501],"category_scores_gemma":[0.0046159015,0.0005078839,0.0007772978,0.0010406887,0.0017341594,0.002516415,0.0016974516,0.0012136006,0.00042809316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000259976,0.00007171592,0.0007993103,0.00047712843,0.00011345013,0.00050028577,0.00057325047,0.7250271,0.0074350284,0.22724806,0.0023181068,0.035176624],"study_design_scores_gemma":[0.00004600157,0.00010986584,0.00014290804,0.000025520747,0.000028972732,0.00013934274,0.00007166719,0.8606415,0.0017671868,0.13289073,0.004118838,0.000017459095],"about_ca_topic_score_codex":0.0015048233,"about_ca_topic_score_gemma":0.00082216464,"teacher_disagreement_score":0.0022414501,"about_ca_system_score_codex":0.0009306614,"about_ca_system_score_gemma":0.000662211,"threshold_uncertainty_score":0.0075138807},"labels":[],"label_agreement":null},{"id":"W2930568265","doi":"10.5539/mas.v13n4p89","title":"Hot Spot Phenomenon and Greedy Routing Failure in Mobile Ad-hoc Networks","year":2019,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hot spot (computer programming); Mobile ad hoc network; Computer science; Computer network; Greedy algorithm; Routing (electronic design automation); Wireless ad hoc network; Path (computing); Phenomenon; Shortest path problem; Distributed computing; Telecommunications; Theoretical computer science; Algorithm; Wireless","score_opus":0.007455340751670073,"score_gpt":0.20965458559964112,"score_spread":0.20219924484797105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2930568265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43377548,0.0131699275,0.53193265,0.0027184912,0.0006474199,0.00015072551,0.00013590448,0.00078750995,0.016681947],"genre_scores_gemma":[0.9873963,0.0018673418,0.009076835,0.00012627713,0.00017077572,0.00003164937,0.000027233295,0.000021317192,0.0012823555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990521,0.0002640128,0.000051256688,0.0001581237,0.00029116924,0.00018332999],"domain_scores_gemma":[0.997712,0.00127043,0.0004873376,0.00021404901,0.00021491855,0.00010132785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000985902,0.00048182992,0.0006770468,0.00089096965,0.00087518373,0.0010859139,0.0010375442,0.0011084529,0.0007618291],"category_scores_gemma":[0.0035640767,0.00033788246,0.00041638236,0.0009407552,0.0017674413,0.0024307382,0.0010369716,0.0007561489,0.00017259855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010362401,0.00015529258,0.035667244,0.0016686064,0.00046105648,0.012339971,0.005230026,0.31747225,0.04722256,0.33396122,0.0121049285,0.23268065],"study_design_scores_gemma":[0.00007463518,0.0011775431,0.018531963,0.00023247536,0.00029609952,0.018733677,0.0044173724,0.6595282,0.019693961,0.24869558,0.028339723,0.0002787772],"about_ca_topic_score_codex":0.00091342925,"about_ca_topic_score_gemma":0.00077745866,"teacher_disagreement_score":0.0011084529,"about_ca_system_score_codex":0.00065041846,"about_ca_system_score_gemma":0.0003692158,"threshold_uncertainty_score":0.0052140355},"labels":[],"label_agreement":null},{"id":"W2937104025","doi":"10.1186/s13638-019-1375-7","title":"A novel dynamic reputation-based source routing protocol for mobile ad hoc networks","year":2019,"lang":"en","type":"article","venue":"EURASIP Journal on Wireless Communications and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Network packet; Link-state routing protocol; Routing protocol; DSRFLOW; Reputation; Wireless Routing Protocol; Optimized Link State Routing Protocol; Static routing; Routing (electronic design automation); Distributed computing","score_opus":0.026783580902927425,"score_gpt":0.3055044130615846,"score_spread":0.2787208321586572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937104025","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005705717,0.0041968687,0.97584426,0.00063934404,0.0008552517,0.00038472805,0.0002637122,0.003388789,0.00872138],"genre_scores_gemma":[0.48897108,0.004844441,0.48705396,0.0008434701,0.0009079849,0.0010208895,0.0015697507,0.00030607238,0.014482397],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897873,0.00028511957,0.00008718507,0.0001447449,0.00043038384,0.00007383504],"domain_scores_gemma":[0.99902153,0.00030290236,0.00013342909,0.00015488587,0.00029992984,0.00008738467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008779316,0.0006893362,0.0012219719,0.000794958,0.00088906207,0.0011421492,0.002799606,0.0009457637,0.0020074425],"category_scores_gemma":[0.002263694,0.0002418027,0.0004633563,0.0010072379,0.00055124675,0.0021519503,0.0015332688,0.0013936788,0.0015618622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006934726,0.00036833127,0.0010141289,0.0012442702,0.0002777219,0.0016095345,0.0003842227,0.11861254,0.049052738,0.11388249,0.078491636,0.6343689],"study_design_scores_gemma":[0.0003026479,0.0005637979,0.0004978674,0.00009721456,0.00019169252,0.002196764,0.00008800982,0.83134115,0.0094690425,0.04113699,0.11390695,0.00020796363],"about_ca_topic_score_codex":0.0009253799,"about_ca_topic_score_gemma":0.0013255986,"teacher_disagreement_score":0.002799606,"about_ca_system_score_codex":0.00055658864,"about_ca_system_score_gemma":0.0010017027,"threshold_uncertainty_score":0.0067155957},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02429437019936401,"score_gpt":0.25414638166167824,"score_spread":0.22985201146231424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943017603","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043036113,0.14298849,0.8024582,0.0020974076,0.001277565,0.00014063419,0.0008724113,0.0006956651,0.045165963],"genre_scores_gemma":[0.15275398,0.44025362,0.3687741,0.0018569746,0.010106323,0.0009070385,0.0021704454,0.0005333847,0.022644142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99920136,0.0001905926,0.000085899446,0.00020257852,0.00025388575,0.00006581279],"domain_scores_gemma":[0.99886215,0.00075497746,0.00006768675,0.00011209373,0.0001796289,0.000023518518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011230374,0.0026096152,0.001411219,0.0027043163,0.00043440022,0.002506071,0.0015749489,0.0018760758,0.0045872396],"category_scores_gemma":[0.0030826926,0.00072362076,0.0011681436,0.0038330916,0.0009979117,0.0037136409,0.0010822372,0.0031936015,0.0026933826],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006587061,0.00021192094,0.0015317326,0.0024437273,0.00013883026,0.00054348493,0.00042304897,0.10200571,0.0075598783,0.49288824,0.043173652,0.3490139],"study_design_scores_gemma":[0.00001141117,0.0002261696,0.0020898408,0.0010123611,0.00010040514,0.0015608828,0.00017537472,0.3154311,0.0041229357,0.39367777,0.28143984,0.00015195391],"about_ca_topic_score_codex":0.0018167286,"about_ca_topic_score_gemma":0.00063320145,"teacher_disagreement_score":0.0045872396,"about_ca_system_score_codex":0.0013466579,"about_ca_system_score_gemma":0.0005627,"threshold_uncertainty_score":0.015345812},"labels":[],"label_agreement":null},{"id":"W2943828857","doi":"10.1109/tmc.2019.2911945","title":"Possibility-based trust for mobile wireless networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Reputation; Network packet; Computer network; Authentication (law); Wireless; Mobile ad hoc network; Mobile computing; Wireless network; Mobile wireless; Computer security; Telecommunications","score_opus":0.01048481649275894,"score_gpt":0.24871920237001316,"score_spread":0.2382343858772542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943828857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013047306,0.0023418244,0.9761885,0.0018480279,0.00013373359,0.000076990334,0.00007671124,0.00011655154,0.006170368],"genre_scores_gemma":[0.8709355,0.0025305173,0.12259669,0.00016717485,0.00034072134,0.00026410184,0.00012147473,0.000026469323,0.0030173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9959214,0.0021013063,0.00022208499,0.0003386455,0.0012397377,0.00017682805],"domain_scores_gemma":[0.98959047,0.007873206,0.0008284284,0.0005559119,0.0008636568,0.00028834457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037602924,0.00070095557,0.00095882965,0.001753297,0.0011467427,0.003468152,0.0014559278,0.0018108626,0.0018993211],"category_scores_gemma":[0.017906994,0.0005566969,0.001483233,0.001750016,0.0034822477,0.0054410864,0.0022952864,0.0026938566,0.00032755898],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006538115,0.000030238385,0.00074511167,0.000191859,0.00009973125,0.0003258926,0.00037417116,0.28452232,0.0006485748,0.6809675,0.001179336,0.030849941],"study_design_scores_gemma":[0.000015429272,0.000038646882,0.0001615834,0.000041071024,0.000020101239,0.00010192434,0.000065887056,0.5371528,0.00017026177,0.46015733,0.0020438626,0.000030984596],"about_ca_topic_score_codex":0.0040677977,"about_ca_topic_score_gemma":0.0026009206,"teacher_disagreement_score":0.0040677977,"about_ca_system_score_codex":0.003368626,"about_ca_system_score_gemma":0.0015000742,"threshold_uncertainty_score":0.024441242},"labels":[],"label_agreement":null},{"id":"W2947998289","doi":"10.1145/3322497","title":"Multicast Scaling of Capacity and Energy Efficiency in Heterogeneous Wireless Sensor Networks","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alberta Gambling Research Institute, University of Calgary; National Natural Science Foundation of China","keywords":"Multicast; Source-specific multicast; Computer network; Xcast; Computer science; Protocol Independent Multicast; Distributed computing; Distance Vector Multicast Routing Protocol; IP multicast; Pragmatic General Multicast; Wireless sensor network; Multicast address","score_opus":0.012933796387925923,"score_gpt":0.21904006271922874,"score_spread":0.20610626633130283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2947998289","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63223815,0.0023440332,0.34478667,0.0016749286,0.00008873436,0.000050659317,0.00016816515,0.00033785845,0.018310832],"genre_scores_gemma":[0.9960224,0.00032214387,0.003125889,0.0000570987,0.000038052003,0.000025115844,0.0000273362,0.000018832472,0.0003631663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955434,0.00014822226,0.000012954468,0.00007825631,0.00009386325,0.000112264956],"domain_scores_gemma":[0.99763894,0.0014683778,0.00026956905,0.00025588335,0.00023722622,0.00012999235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008965527,0.00036166108,0.0004605798,0.000803938,0.000519753,0.0007859763,0.00077488757,0.0005802349,0.000853077],"category_scores_gemma":[0.0055365614,0.0002513612,0.00038863678,0.0005924025,0.0014038079,0.0024489998,0.001031821,0.00066356454,0.000084816544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001234389,0.00008015954,0.0035389676,0.00013055913,0.000052896947,0.00033288513,0.00041439643,0.73582894,0.015999129,0.22402884,0.0017849794,0.017684817],"study_design_scores_gemma":[0.000005546998,0.000021252363,0.0011296312,0.000011635365,0.000007842233,0.000046692126,0.00007245044,0.94819635,0.0012761503,0.048797615,0.0004228906,0.000011936945],"about_ca_topic_score_codex":0.0014742876,"about_ca_topic_score_gemma":0.0006902569,"teacher_disagreement_score":0.0014742876,"about_ca_system_score_codex":0.0009322948,"about_ca_system_score_gemma":0.000258759,"threshold_uncertainty_score":0.0067642927},"labels":[],"label_agreement":null},{"id":"W2948856558","doi":"10.1109/cybermatics_2018.2018.00081","title":"Distortion-Aware Multicasting of Multiple Description Coded Media in Wireless Mesh Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multicast; Computer network; Computer science; RSS; Relay; Wireless; Wireless mesh network; Bandwidth (computing); Multiple description coding; Scheme (mathematics); Coding (social sciences); Linear network coding; Distributed computing; Wireless network; Network packet; Telecommunications","score_opus":0.023815708010580503,"score_gpt":0.23945905867752187,"score_spread":0.21564335066694137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948856558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12086152,0.0012740955,0.87556046,0.00018913257,0.00004703704,0.000044703167,0.00005185599,0.00019808582,0.001773117],"genre_scores_gemma":[0.9142862,0.00047088126,0.0840996,0.000032271826,0.00003906828,0.000035315486,0.000062398736,0.000024527873,0.0009497043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956363,0.00014309457,0.000016609436,0.000043833377,0.00019871356,0.000034062636],"domain_scores_gemma":[0.99926585,0.00044463933,0.00009944363,0.00006108994,0.00010149775,0.000027461021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007924802,0.00043651243,0.0004656938,0.00061157544,0.0003083848,0.00038521417,0.0009323552,0.0005418295,0.00034332456],"category_scores_gemma":[0.002021127,0.00021206443,0.0002623839,0.00051607157,0.00042136238,0.0007712664,0.00066017814,0.0003560384,0.000079344485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018964535,0.00004217274,0.00092050637,0.0001543988,0.000036203874,0.00016968924,0.000075640586,0.8807529,0.02745122,0.009005084,0.0007040114,0.08049848],"study_design_scores_gemma":[0.00000613269,0.000039199484,0.00013504444,0.0000031750262,0.0000061873357,0.000039451847,0.000009346448,0.9950682,0.002833108,0.0016298521,0.00022444293,0.0000058815626],"about_ca_topic_score_codex":0.0017126194,"about_ca_topic_score_gemma":0.0013033833,"teacher_disagreement_score":0.0017126194,"about_ca_system_score_codex":0.00073766505,"about_ca_system_score_gemma":0.00028335527,"threshold_uncertainty_score":0.005352199},"labels":[],"label_agreement":null},{"id":"W2949151776","doi":"10.1017/s0001867800003773","title":"On the expected maximum degree of Gabriel and Yao graphs","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McGill University","funders":"","keywords":"Mathematics; Combinatorics; Random graph; Degree (music); Discrete mathematics; Graph; Unit square; Random regular graph; Chordal graph; 1-planar graph","score_opus":0.015536163493355543,"score_gpt":0.23897226591980186,"score_spread":0.22343610242644632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949151776","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4187053,0.0040694047,0.54924107,0.0074032852,0.00021784152,0.00012485814,0.0007750538,0.0005205612,0.018942581],"genre_scores_gemma":[0.9665944,0.003128009,0.02518685,0.00051038415,0.00039265517,0.00022832518,0.00037582597,0.00020632379,0.0033772124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971107,0.0013337043,0.00007249534,0.0004652487,0.0005885846,0.0004291827],"domain_scores_gemma":[0.9199652,0.068489976,0.0033387442,0.0029199203,0.002684604,0.002601556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055140466,0.0012010639,0.001866774,0.0030871914,0.0016539696,0.0025290956,0.002906608,0.0021015692,0.003252907],"category_scores_gemma":[0.0735412,0.0011598632,0.00089912344,0.0025518457,0.00522692,0.010818301,0.0030661367,0.0027933829,0.0005420457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039510662,0.0000701709,0.0041441424,0.00030095817,0.0000784131,0.0003290824,0.0005999881,0.18379064,0.0033941767,0.7905631,0.0041770935,0.012157131],"study_design_scores_gemma":[0.00007620493,0.000083503706,0.0014789077,0.00008756432,0.000042491476,0.00045908653,0.0001706985,0.38581622,0.0013580885,0.6078961,0.002470507,0.000060693437],"about_ca_topic_score_codex":0.0018563044,"about_ca_topic_score_gemma":0.0018551641,"teacher_disagreement_score":0.0055140466,"about_ca_system_score_codex":0.0032322556,"about_ca_system_score_gemma":0.0011130504,"threshold_uncertainty_score":0.029161394},"labels":[],"label_agreement":null},{"id":"W2949773557","doi":"10.48550/arxiv.1611.08938","title":"Asynchronous Broadcasting with Bivalent Beeps","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Computer science; Broadcasting (networking); Computer network; Node (physics); Anonymity; Computer security","score_opus":0.0441018763381862,"score_gpt":0.17168274635292094,"score_spread":0.12758087001473473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949773557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0660427,0.00045697228,0.9195822,0.0005397513,0.00008652921,0.00013058781,0.00016803505,0.00045725738,0.012535995],"genre_scores_gemma":[0.8466818,0.00065820507,0.13883503,0.00024825716,0.00017758459,0.00036160118,0.00026398528,0.0001500867,0.012623517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808395,0.0005147548,0.00011081103,0.00043012184,0.0005065112,0.00035391957],"domain_scores_gemma":[0.9846764,0.011704276,0.0011794774,0.0013355375,0.00065832253,0.00044601545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018850968,0.00086456747,0.001142264,0.00083881745,0.0010755376,0.0021519964,0.0027319696,0.0016298092,0.0050797933],"category_scores_gemma":[0.010671554,0.00067992613,0.0010509508,0.0010839398,0.0016711513,0.0032619052,0.0023103037,0.0021582558,0.0007107093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007226065,0.00018991412,0.0013364009,0.00037067322,0.000083971034,0.00027514852,0.0003720814,0.52317625,0.009917138,0.41891074,0.0035276525,0.04111744],"study_design_scores_gemma":[0.000067480294,0.00009585736,0.00018515867,0.000017211323,0.00002671914,0.00009746008,0.00004509545,0.8987671,0.0015440224,0.09728316,0.001849768,0.000020881167],"about_ca_topic_score_codex":0.0025535673,"about_ca_topic_score_gemma":0.0021371993,"teacher_disagreement_score":0.0050797933,"about_ca_system_score_codex":0.001862861,"about_ca_system_score_gemma":0.0010571555,"threshold_uncertainty_score":0.016993642},"labels":[],"label_agreement":null},{"id":"W2950083153","doi":"10.48550/arxiv.1204.3920","title":"Low-Complexity Energy-Efficient Broadcasting in One-Dimensional Wireless Networks","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Broadcasting (networking); Node (physics); Time complexity; Wireless network; Computational complexity theory; Distributed algorithm; Wireless; Transmission (telecommunications); Network topology; Distributed computing; Computer network; Algorithm; Energy consumption; Topology (electrical circuits); Mathematics; Telecommunications; Combinatorics; Engineering","score_opus":0.07878818494810157,"score_gpt":0.18826565536518736,"score_spread":0.10947747041708579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950083153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066128,0.000787625,0.9276975,0.00043533032,0.00003046873,0.000058058464,0.000046801102,0.00029412482,0.0045220936],"genre_scores_gemma":[0.78847706,0.0006520021,0.20759042,0.00010358365,0.00005368517,0.00016541652,0.000109340835,0.00005953564,0.0027889414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993186,0.0003301393,0.000020869187,0.000086578286,0.00016644517,0.00007743357],"domain_scores_gemma":[0.99839705,0.0012871838,0.00011927624,0.00008346167,0.000081765764,0.000031210882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091378926,0.00043400427,0.00069483503,0.0004829572,0.00051327917,0.00077889016,0.0008808035,0.0009168809,0.001213556],"category_scores_gemma":[0.0038971025,0.00039218608,0.00030932945,0.00087425945,0.00089175184,0.0014969249,0.00070966536,0.00051025936,0.00023501657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007894906,0.00004278768,0.00034752797,0.00012549355,0.000019295707,0.000049967126,0.00010107615,0.95315266,0.0026625383,0.020685652,0.0006860715,0.022047877],"study_design_scores_gemma":[0.000012643422,0.000019962272,0.00006961792,0.0000025466707,0.0000034493405,0.000020829542,0.000020940122,0.9916488,0.00042937874,0.0075238035,0.0002446756,0.0000033367908],"about_ca_topic_score_codex":0.0018933285,"about_ca_topic_score_gemma":0.0018976072,"teacher_disagreement_score":0.0018933285,"about_ca_system_score_codex":0.0008998738,"about_ca_system_score_gemma":0.00054521346,"threshold_uncertainty_score":0.0065291524},"labels":[],"label_agreement":null},{"id":"W2951598461","doi":"10.48550/arxiv.0811.3585","title":"The Capacity of Ad hoc Networks under Random Packet Losses","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Wireless ad hoc network; Computer network; Network packet; Computer science; Mobile ad hoc network; Telecommunications; Wireless","score_opus":0.043606047653929406,"score_gpt":0.2483586035394876,"score_spread":0.20475255588555819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951598461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16840555,0.004390597,0.8052604,0.0017435781,0.0002011386,0.00010138946,0.00039958372,0.00070550124,0.018792173],"genre_scores_gemma":[0.9820645,0.0026308664,0.012577786,0.00012858052,0.00022835181,0.00018094615,0.00011947977,0.00008815719,0.0019812947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979157,0.0007671537,0.00006294338,0.00028042105,0.00059807015,0.00037574477],"domain_scores_gemma":[0.97655904,0.019504124,0.001193531,0.00091277435,0.0015056662,0.00032487916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038324506,0.0009970322,0.0011315586,0.0022403458,0.0009204263,0.0020097988,0.0020814114,0.0011770703,0.0013242175],"category_scores_gemma":[0.0341809,0.00074674416,0.0003932581,0.0015720573,0.0033143344,0.004284052,0.0017037604,0.0016270633,0.00034616087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008656773,0.00002791408,0.00060631736,0.00010053685,0.000033978155,0.00014917305,0.00010084567,0.92440474,0.0015640396,0.064337224,0.0009920569,0.0075965803],"study_design_scores_gemma":[0.00000641906,0.000024167037,0.00024399557,0.00002596892,0.000009138266,0.0000525009,0.00003112439,0.9547482,0.00052115467,0.043837935,0.00048657175,0.000012811794],"about_ca_topic_score_codex":0.0030730083,"about_ca_topic_score_gemma":0.0009926386,"teacher_disagreement_score":0.0038324506,"about_ca_system_score_codex":0.0029194385,"about_ca_system_score_gemma":0.0010363464,"threshold_uncertainty_score":0.02118206},"labels":[],"label_agreement":null},{"id":"W2956735194","doi":"10.1109/tnet.2019.2928798","title":"The Gain of Energy Accumulation in Multi-Hop Wireless Network Broadcast","year":2019,"lang":"en","type":"preprint","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hop (telecommunications); Computer science; Computer network; Dissemination; Wireless network; Efficient energy use; Energy (signal processing); Wireless; Broadcast radiation; Exponent; Broadcast communication network; Distributed computing; Topology (electrical circuits); Telecommunications; Mathematics; Electrical engineering; Engineering; Combinatorics","score_opus":0.054493448252643954,"score_gpt":0.29381675744607544,"score_spread":0.23932330919343148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956735194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102562584,0.010610215,0.8352051,0.0031356977,0.0006809454,0.00009777664,0.00019695335,0.00063938677,0.046871286],"genre_scores_gemma":[0.9503193,0.0051181996,0.03742773,0.00044000286,0.0003882141,0.00010953639,0.00009984917,0.00011728587,0.005979959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988752,0.00027873964,0.000035765308,0.00014540671,0.000457699,0.00020714053],"domain_scores_gemma":[0.99331915,0.005332369,0.00033171126,0.00052052544,0.00037311023,0.00012322128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001454335,0.0009409421,0.000977627,0.0010127269,0.0006424959,0.0014879898,0.0012506988,0.0010067928,0.0028740212],"category_scores_gemma":[0.010248612,0.0004664195,0.00056025345,0.0014435614,0.0014512927,0.003434301,0.0019251811,0.0016914407,0.0005875788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006376201,0.00020929708,0.0019572494,0.00089313916,0.00010547116,0.0007178498,0.0004046336,0.46076027,0.029072508,0.38703713,0.009047055,0.10915777],"study_design_scores_gemma":[0.000049127826,0.00029531508,0.0012187135,0.00014809465,0.000075870536,0.0008959988,0.00016822375,0.8038449,0.008892301,0.17457336,0.009796701,0.000041396383],"about_ca_topic_score_codex":0.0005744986,"about_ca_topic_score_gemma":0.0005858062,"teacher_disagreement_score":0.0028740212,"about_ca_system_score_codex":0.001313824,"about_ca_system_score_gemma":0.0006456028,"threshold_uncertainty_score":0.009614527},"labels":[],"label_agreement":null},{"id":"W2957998068","doi":"10.1007/s12083-019-00787-3","title":"Secure and reliable certification management scheme for large-scale MANETs based on a distributed anonymous authority","year":2019,"lang":"en","type":"article","venue":"Peer-to-Peer Networking and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Compromise; Certification; Computer security; Computer science; Adversary; Certificate authority; Scheme (mathematics); Service (business); Computer network; Distributed computing; Business; Public-key cryptography; Mathematics; Law; Encryption","score_opus":0.01237803639514889,"score_gpt":0.2541564328483454,"score_spread":0.2417783964531965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2957998068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15078358,0.0008928375,0.8374445,0.0007497383,0.00054492994,0.00040671197,0.00014018589,0.0023724898,0.006665024],"genre_scores_gemma":[0.9489147,0.00020422663,0.047354788,0.00006837083,0.00010219861,0.00011572427,0.00011176809,0.000034720295,0.0030936082],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984428,0.0003291932,0.00014625507,0.00030880753,0.0005774926,0.00019536704],"domain_scores_gemma":[0.9972819,0.00040011056,0.00034380044,0.0009947859,0.00073990395,0.00023942489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001507839,0.00035982925,0.0009203372,0.0009748775,0.0020934378,0.0012463933,0.0016298983,0.00097188255,0.0013422851],"category_scores_gemma":[0.002772265,0.00027922,0.00044279214,0.0007255542,0.0010761726,0.0024894017,0.0026127521,0.0011599101,0.00047843409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024325703,0.0007276401,0.0070426734,0.0005989244,0.00033816294,0.0020739187,0.0017372997,0.17651533,0.15766637,0.28635553,0.01813269,0.34637895],"study_design_scores_gemma":[0.00044524152,0.00075572036,0.001931475,0.00005195732,0.0002658727,0.0014094567,0.00030123588,0.89239174,0.03382899,0.047858752,0.020514203,0.00024534087],"about_ca_topic_score_codex":0.0011240387,"about_ca_topic_score_gemma":0.0011123297,"teacher_disagreement_score":0.0020934378,"about_ca_system_score_codex":0.0008656601,"about_ca_system_score_gemma":0.0022273678,"threshold_uncertainty_score":0.007974267},"labels":[],"label_agreement":null},{"id":"W2963746388","doi":"10.1109/tvt.2019.2930657","title":"Joint Traffic Routing and Virtualized Security Function Activation in Wireless Multihop Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Research Foundation of Korea","keywords":"Computer network; Joint (building); Computer science; Wireless; Routing (electronic design automation); Geographic routing; Wireless network; Dynamic Source Routing; Routing protocol; Engineering; Telecommunications","score_opus":0.006873368671018474,"score_gpt":0.20451733808374217,"score_spread":0.1976439694127237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963746388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043964658,0.0001543207,0.9542433,0.0001707225,0.000026045293,0.00003258566,0.000016478434,0.000090584035,0.001301271],"genre_scores_gemma":[0.9574864,0.000119485056,0.04108988,0.000031059186,0.000019111885,0.00005772539,0.000022197295,0.00002392467,0.0011503716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989065,0.00050305726,0.000030695923,0.00017584549,0.00019950529,0.00018446524],"domain_scores_gemma":[0.9988714,0.0006428181,0.0001865395,0.00009757733,0.0001352433,0.00006638919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014631742,0.0007560728,0.00090960227,0.0003974978,0.0004952099,0.0009759719,0.0007871284,0.00092970155,0.0007130526],"category_scores_gemma":[0.0025302337,0.00044082451,0.0005561989,0.00049715,0.0011971382,0.0015337367,0.001182869,0.000867544,0.000086966946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026774042,0.000014577298,0.00012453206,0.000016295344,0.000008330184,0.000027730974,0.000016966678,0.9845926,0.0012784101,0.008646502,0.00011377692,0.005133385],"study_design_scores_gemma":[0.000003598417,0.00001811885,0.000036720554,0.0000011817802,0.0000023439052,0.000008560797,0.0000052206283,0.9966036,0.0002937231,0.0029245734,0.000099990306,0.0000023688872],"about_ca_topic_score_codex":0.0018420103,"about_ca_topic_score_gemma":0.0015755135,"teacher_disagreement_score":0.0018420103,"about_ca_system_score_codex":0.00095379975,"about_ca_system_score_gemma":0.0013053997,"threshold_uncertainty_score":0.0077381134},"labels":[],"label_agreement":null},{"id":"W2965964559","doi":"10.1109/iceiec.2019.8784478","title":"Group Key Agreement for Mission-Critical Wireless Mesh Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rekeying; Computer science; Wireless mesh network; Key (lock); Computer network; Overhead (engineering); Mesh networking; Communication in small groups; Distributed computing; Wireless; Resource (disambiguation); Wireless network; Key management; Computer security; Telecommunications; Operating system","score_opus":0.013393904212900277,"score_gpt":0.25678281003774983,"score_spread":0.24338890582484957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965964559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020148216,0.0016516492,0.97437245,0.0004200502,0.00014454857,0.00009370464,0.00003762147,0.00013746302,0.002994312],"genre_scores_gemma":[0.87947005,0.0022122546,0.113868594,0.00010898245,0.00022054632,0.00025192992,0.00011958782,0.000048092537,0.003699927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984101,0.00061449537,0.00009076816,0.00018988311,0.00052940595,0.00016526715],"domain_scores_gemma":[0.9981042,0.001059569,0.00023010257,0.0003082106,0.00025021075,0.000047629936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016924767,0.00035419685,0.0004586667,0.00056978595,0.000812669,0.0010802329,0.00089999975,0.00066837453,0.0017366366],"category_scores_gemma":[0.0055734916,0.00024149929,0.00030149377,0.00085670967,0.0010444144,0.0030830514,0.0012960167,0.0012008819,0.0004666663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042217478,0.000093471805,0.0012015508,0.0006122045,0.00010034261,0.00056184107,0.00067419064,0.29902098,0.030195769,0.48486164,0.0051156823,0.17714028],"study_design_scores_gemma":[0.000042512012,0.00017396064,0.00027992396,0.000044698267,0.00003244972,0.0002792125,0.00017471181,0.8000905,0.0043443567,0.18452539,0.009979202,0.00003312544],"about_ca_topic_score_codex":0.00080677826,"about_ca_topic_score_gemma":0.00058376486,"teacher_disagreement_score":0.0017366366,"about_ca_system_score_codex":0.0011019228,"about_ca_system_score_gemma":0.0011228877,"threshold_uncertainty_score":0.00895077},"labels":[],"label_agreement":null},{"id":"W2976839850","doi":"10.1109/apcc.2004.1391725","title":"A SIP-based multicast framework in MANET","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multicast; Computer science; Computer network; Overlay multicast; Overlay network; Distributed computing; Protocol Independent Multicast; Xcast; Mobile ad hoc network; Pragmatic General Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; IP multicast; The Internet; World Wide Web","score_opus":0.01067650289034451,"score_gpt":0.24964135328406037,"score_spread":0.23896485039371584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976839850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005266627,0.0013059203,0.97585547,0.00054339267,0.00035615583,0.00019894388,0.00009526044,0.0032564653,0.01312173],"genre_scores_gemma":[0.2378313,0.0026204472,0.7402906,0.0006696746,0.0005669463,0.0006880106,0.0005208413,0.0003502844,0.016461916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948895,0.00018704205,0.000040938,0.00004693632,0.00019495463,0.000041095132],"domain_scores_gemma":[0.9997601,0.00006150221,0.000014008466,0.00004386696,0.00007483794,0.000045629386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001227371,0.00044877268,0.00048929825,0.0005931996,0.0011053971,0.0014371381,0.0012301896,0.0011225091,0.0023472223],"category_scores_gemma":[0.00093260134,0.0003065349,0.0005182064,0.0004912227,0.0006351144,0.0015453596,0.0013282937,0.0011438705,0.0010672839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028131375,0.00018980658,0.00054251775,0.00047661288,0.000093125454,0.0015542208,0.00092106144,0.06233077,0.027335314,0.61278945,0.027469914,0.26601595],"study_design_scores_gemma":[0.00007727776,0.00028206897,0.00026354805,0.00014487121,0.00010691469,0.0011637167,0.00021934164,0.60894585,0.013846167,0.14647956,0.22836812,0.00010261314],"about_ca_topic_score_codex":0.00088509795,"about_ca_topic_score_gemma":0.0010040819,"teacher_disagreement_score":0.0023472223,"about_ca_system_score_codex":0.0004544069,"about_ca_system_score_gemma":0.00065947504,"threshold_uncertainty_score":0.007852256},"labels":[],"label_agreement":null},{"id":"W2986405714","doi":"10.36548/jsws.2019.1.005","title":"SECURE MULTIMEDIA DATA TRANSMISSION IN MOBILE AD-HOC NETWORKS","year":2019,"lang":"en","type":"article","venue":"IRO Journal on Sustainable Wireless Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Computer network; Network packet; Node (physics); Encryption; Throughput; Transmission (telecommunications); Mobile ad hoc network; Quality of service; Data transmission; File size; Multimedia; Operating system; Wireless; Telecommunications","score_opus":0.010796044432940514,"score_gpt":0.24530052977661143,"score_spread":0.2345044853436709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986405714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09923417,0.013736348,0.8704318,0.0007628648,0.0006069926,0.00023962073,0.00010203236,0.0007743684,0.0141118625],"genre_scores_gemma":[0.89646226,0.0078065647,0.088111356,0.00015094488,0.00027626197,0.00016379662,0.00014561496,0.0000392581,0.0068439404],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99942374,0.00016261775,0.00004121608,0.00006332659,0.00026300031,0.00004619135],"domain_scores_gemma":[0.99955744,0.00017182545,0.000059803435,0.000050058832,0.00014311825,0.000017758595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046407917,0.00038193166,0.00036119437,0.00064439455,0.000539154,0.00062197645,0.0004227347,0.00047041572,0.0008131883],"category_scores_gemma":[0.0010023888,0.00018059002,0.00022510083,0.0007220216,0.0003410916,0.0011195163,0.00051712035,0.00036437152,0.00030084714],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005002435,0.00022041876,0.0027841853,0.0014331068,0.00017149998,0.0017516302,0.00054963166,0.24533264,0.0921146,0.05673798,0.009928068,0.5884759],"study_design_scores_gemma":[0.000053306507,0.00070189295,0.0014162661,0.00014859562,0.0001039363,0.0021642898,0.00029251943,0.8989356,0.040386695,0.023294719,0.032428928,0.00007319635],"about_ca_topic_score_codex":0.00093692617,"about_ca_topic_score_gemma":0.00070884003,"teacher_disagreement_score":0.00093692617,"about_ca_system_score_codex":0.00036574237,"about_ca_system_score_gemma":0.00039433627,"threshold_uncertainty_score":0.002720356},"labels":[],"label_agreement":null},{"id":"W3001257962","doi":"10.1007/978-3-642-14785-2","title":"Ad-Hoc, Mobile and Wireless Networks","year":2010,"lang":"en","type":"book","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Mobile ad hoc network; Wireless network; Computer network; Ad hoc wireless distribution service; Wireless; Vehicular ad hoc network; Mobile wireless; Set (abstract data type); Optimized Link State Routing Protocol; Telecommunications","score_opus":0.006274591855507203,"score_gpt":0.22260059635936105,"score_spread":0.21632600450385386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001257962","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031500238,0.26042312,0.12074961,0.0023261108,0.03571541,0.0003045188,0.00072209863,0.0019376505,0.57467145],"genre_scores_gemma":[0.01189334,0.105275005,0.026028393,0.0014530144,0.0071846857,0.00021370336,0.00073575764,0.00043949354,0.84677655],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995844,0.000049021193,0.000020631283,0.00007199405,0.00024561983,0.000028399443],"domain_scores_gemma":[0.9995871,0.000144583,0.000024861121,0.0000631975,0.00012246249,0.000057706675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031570197,0.0023244084,0.0014470726,0.0015207409,0.0006348844,0.0023686748,0.0011592236,0.0012285964,0.04010595],"category_scores_gemma":[0.0009913982,0.00055187446,0.00041419332,0.003816676,0.00071274006,0.0038650671,0.0010885571,0.001974118,0.029196944],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064811014,0.00011343402,0.00019623245,0.0013211811,0.000044540688,0.00020749563,0.00011646406,0.0051314468,0.004399974,0.047598902,0.3414439,0.5993617],"study_design_scores_gemma":[0.000012767135,0.00008969794,0.00045047354,0.0002906701,0.000025815125,0.0007066859,0.000060710143,0.0052098283,0.0004878186,0.023555368,0.96908957,0.00002055037],"about_ca_topic_score_codex":0.0006758641,"about_ca_topic_score_gemma":0.0015368653,"teacher_disagreement_score":0.04010595,"about_ca_system_score_codex":0.00054436317,"about_ca_system_score_gemma":0.00067763356,"threshold_uncertainty_score":0.13416773},"labels":[],"label_agreement":null},{"id":"W3003180894","doi":"10.1109/ficloud.2019.00042","title":"Directional Graph-Based Energy Model for IoT Wireless Relay Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université de Sherbrooke","funders":"","keywords":"Beamwidth; Computer network; Computer science; Omnidirectional antenna; Relay; Directional antenna; Wireless network; Wireless; Telecommunications; Power (physics); Antenna (radio)","score_opus":0.011303199691799295,"score_gpt":0.21060625740473002,"score_spread":0.19930305771293072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003180894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02218708,0.0007840851,0.95138115,0.0008558139,0.00014754964,0.00009352387,0.00047368908,0.00025420633,0.0238228],"genre_scores_gemma":[0.88207686,0.002464384,0.065342195,0.00039907964,0.00014003791,0.0003959687,0.0005870271,0.00022209353,0.04837237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996911,0.00010240091,0.000015010021,0.00007243785,0.000073701616,0.000045431374],"domain_scores_gemma":[0.99949884,0.00023676697,0.00007678667,0.000040218398,0.00010971683,0.000037637623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053016655,0.0011306233,0.00084527076,0.0008053059,0.00055822823,0.001270162,0.0022902242,0.0018777425,0.0069716317],"category_scores_gemma":[0.0013309473,0.00040379592,0.0007916153,0.0010832719,0.00087199366,0.0020903104,0.0009585383,0.0010552147,0.001574391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032930875,0.000030259847,0.00021218353,0.000049027192,0.000017492126,0.0001481866,0.000047799404,0.9022696,0.0012386439,0.090538785,0.0012710261,0.004144091],"study_design_scores_gemma":[0.0000053502827,0.000011495735,0.000048369686,0.0000034395762,0.000005269117,0.000028337103,0.000012865591,0.98758626,0.00006475673,0.011530767,0.00069738756,0.0000057862594],"about_ca_topic_score_codex":0.0041242936,"about_ca_topic_score_gemma":0.003993251,"teacher_disagreement_score":0.0069716317,"about_ca_system_score_codex":0.0012839901,"about_ca_system_score_gemma":0.000489904,"threshold_uncertainty_score":0.023322403},"labels":[],"label_agreement":null},{"id":"W3006025744","doi":"10.1109/uemcon47517.2019.8993014","title":"A Survey of Applying Reinforcement Learning Techniques to Multicast Routing","year":2019,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Carleton University","funders":"","keywords":"Computer network; Computer science; Protocol Independent Multicast; Multicast; Distance Vector Multicast Routing Protocol; Distributed computing; Source-specific multicast; Xcast; Pragmatic General Multicast; Link-state routing protocol; Routing protocol; Network packet","score_opus":0.02207014000529373,"score_gpt":0.2695822397408095,"score_spread":0.2475120997355158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006025744","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076152994,0.23781614,0.72907686,0.001140891,0.0006609589,0.00020289981,0.0000760939,0.00055479805,0.022856046],"genre_scores_gemma":[0.2476927,0.3330153,0.40517703,0.0009953195,0.0023332038,0.0004927825,0.00035496856,0.00027430864,0.0096642785],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863005,0.0004580425,0.00012576567,0.00023303824,0.0004710246,0.00008208271],"domain_scores_gemma":[0.99773943,0.0015128446,0.00009196182,0.00019943988,0.00039538235,0.00006098359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018200991,0.0013586534,0.0015194553,0.001648235,0.00058727287,0.0014679374,0.0021453083,0.0017451936,0.0027574243],"category_scores_gemma":[0.004095788,0.0007452619,0.001361186,0.002840294,0.000763842,0.0019540947,0.0011261516,0.0018340347,0.0010344564],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011032123,0.0002853767,0.0015515746,0.0021014295,0.00022891794,0.00021060952,0.00018548772,0.10615461,0.0025673718,0.039841756,0.005126284,0.84163636],"study_design_scores_gemma":[0.00008846586,0.0010491814,0.0025032994,0.0016790441,0.0002719381,0.0013145704,0.0003210079,0.6771752,0.007896481,0.07919579,0.2283245,0.00018043662],"about_ca_topic_score_codex":0.0019888575,"about_ca_topic_score_gemma":0.0010054116,"teacher_disagreement_score":0.0027574243,"about_ca_system_score_codex":0.001064558,"about_ca_system_score_gemma":0.00078083423,"threshold_uncertainty_score":0.009625733},"labels":[],"label_agreement":null},{"id":"W3012985095","doi":"10.5383/juspn.07.01.005","title":"Multi-hop Wireless Network: A Comparative Study for Routing Protocols Using OMNET++ Simulator","year":2016,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Routing protocol; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Dynamic Source Routing; Network simulation; Wireless ad hoc network; Distance-vector routing protocol; Interior gateway protocol; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.07593900346058716,"score_gpt":0.3400410546709598,"score_spread":0.26410205121037267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012985095","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7129798,0.009003573,0.23155351,0.00079532224,0.00061677594,0.0008039356,0.0028933608,0.0018885722,0.039465155],"genre_scores_gemma":[0.89586747,0.004222659,0.09238406,0.000059076763,0.000058485468,0.00043280883,0.002057259,0.00016454326,0.0047537265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990451,0.0003525049,0.000081139086,0.00007056791,0.0003805679,0.00007022987],"domain_scores_gemma":[0.99694246,0.0019485545,0.00021764672,0.00014994018,0.0006751303,0.00006626516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017076709,0.00037307543,0.00037295668,0.001306516,0.00028810225,0.00053274626,0.00056816015,0.0003390171,0.0011841841],"category_scores_gemma":[0.0032205123,0.00010893098,0.000335658,0.0015853664,0.00015091323,0.0014322132,0.00028307957,0.0003367749,0.0002195268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012465877,0.0011009275,0.03284186,0.003124609,0.0005520996,0.0013811201,0.0011557576,0.41240773,0.036426485,0.032023765,0.020356772,0.4573823],"study_design_scores_gemma":[0.000092912924,0.0040171123,0.023903392,0.00028180334,0.0003916827,0.0021177277,0.002326013,0.8746011,0.029666135,0.0077429875,0.054721557,0.00013749357],"about_ca_topic_score_codex":0.0011458816,"about_ca_topic_score_gemma":0.0015697492,"teacher_disagreement_score":0.0017076709,"about_ca_system_score_codex":0.0003869383,"about_ca_system_score_gemma":0.00040154744,"threshold_uncertainty_score":0.009031117},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; 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","score_opus":0.022311129572233277,"score_gpt":0.25128018265264523,"score_spread":0.22896905308041196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015911510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07505951,0.001499265,0.918866,0.0004269255,0.00014109262,0.000096863405,0.00014709475,0.0006621979,0.0031010464],"genre_scores_gemma":[0.81682086,0.0014828444,0.17601268,0.000111106776,0.00015856016,0.00013838967,0.00039610168,0.00013885897,0.004740683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907386,0.00032061557,0.000054951437,0.00019327122,0.00026726373,0.00009006188],"domain_scores_gemma":[0.9963523,0.0021720915,0.00039185624,0.00040827453,0.00052954,0.00014600954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010173213,0.00048274526,0.0009312494,0.0016945766,0.0013240593,0.0011619908,0.0020600804,0.0015131638,0.0015761738],"category_scores_gemma":[0.006526474,0.0005806565,0.00040858376,0.0027676313,0.0011812747,0.0026173973,0.001178301,0.00073419424,0.0004818777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003484398,0.00008768421,0.0016742431,0.00026296498,0.00007280627,0.000093768416,0.0002431219,0.85594153,0.004891398,0.037692286,0.0033863327,0.09530537],"study_design_scores_gemma":[0.000025642861,0.00007066555,0.0007104486,0.000016441883,0.000026830567,0.00013389059,0.000069053,0.96226484,0.0015194799,0.033569586,0.0015701852,0.000023006376],"about_ca_topic_score_codex":0.0035628036,"about_ca_topic_score_gemma":0.0037194428,"teacher_disagreement_score":0.0035628036,"about_ca_system_score_codex":0.0010722501,"about_ca_system_score_gemma":0.000687744,"threshold_uncertainty_score":0.0077797174},"labels":[],"label_agreement":null},{"id":"W3018317585","doi":"10.1016/j.comcom.2020.04.047","title":"A-CAFDSP: An Adaptive-Congestion Aware Fibonacci Sequence based Data Scheduling Policy","year":2020,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Computer network; Network packet; Distributed computing; Scheduling (production processes); Quality of service; Wireless; Telecommunications","score_opus":0.22962359075371797,"score_gpt":0.35342769149904146,"score_spread":0.1238041007453235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018317585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038964186,0.00087781396,0.9414024,0.00063561863,0.0009879355,0.0004460352,0.0006632011,0.007373809,0.008648952],"genre_scores_gemma":[0.60619015,0.000377189,0.3860478,0.0006396714,0.00031373967,0.0003641871,0.0007491489,0.00034376228,0.0049744067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921787,0.00018799982,0.000062081424,0.00012289299,0.00026820519,0.0001408674],"domain_scores_gemma":[0.9975655,0.0008016469,0.00013820478,0.00051396585,0.0007010647,0.00027966392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015127792,0.0008198247,0.0008049752,0.0019561828,0.0015883937,0.0013050056,0.0024681403,0.000985958,0.0039109876],"category_scores_gemma":[0.004492923,0.0003489168,0.00038500348,0.0014139324,0.00066994847,0.0011177708,0.0011696679,0.0014106266,0.0010054695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029510637,0.00073252636,0.002764693,0.00044498473,0.0001377141,0.0003902653,0.00025857965,0.17399326,0.06936043,0.084976636,0.05915009,0.60483974],"study_design_scores_gemma":[0.0001684033,0.00031080365,0.0004928184,0.000023947412,0.000033424614,0.00025520872,0.00004432351,0.94705385,0.015405307,0.020563077,0.015592364,0.00005647597],"about_ca_topic_score_codex":0.005324121,"about_ca_topic_score_gemma":0.0076891975,"teacher_disagreement_score":0.005324121,"about_ca_system_score_codex":0.0017573026,"about_ca_system_score_gemma":0.0033424273,"threshold_uncertainty_score":0.013083577},"labels":[],"label_agreement":null},{"id":"W3025998413","doi":"10.1109/pdp50117.2020.00046","title":"Heuristic Algorithms with Near Optimal Broadcasting in Cactus Graphs","year":2020,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Chordal graph; Heuristics; Vertex (graph theory); Maximal independent set; Clique problem; Heuristic; Feedback vertex set; Indifference graph; Steiner tree problem; Broadcasting (networking); Clique-sum; Pathwidth; Theoretical computer science; Algorithm; Combinatorics; Graph; Mathematics; 1-planar graph; Computer network; Line graph","score_opus":0.015825918522794098,"score_gpt":0.21965776700705453,"score_spread":0.20383184848426042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025998413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34198725,0.001998384,0.623749,0.0010971627,0.00013833407,0.00084126566,0.0006350278,0.0029994205,0.026554173],"genre_scores_gemma":[0.6498229,0.00067583896,0.3446842,0.00024598496,0.00005563521,0.00046035345,0.00095588516,0.00020245848,0.0028968167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993351,0.00019319697,0.000035161076,0.00013315058,0.000115000585,0.00018840507],"domain_scores_gemma":[0.9978198,0.0014366772,0.00021663356,0.00023819674,0.00015342484,0.00013534506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070538715,0.00097492436,0.0009774314,0.0013435821,0.0010750572,0.0012215053,0.0017649552,0.0014986178,0.003199378],"category_scores_gemma":[0.004983688,0.0006749086,0.0006579135,0.0023090928,0.0009064867,0.0012878875,0.0009225348,0.0009112787,0.00044958407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037336416,0.00022397161,0.0011049171,0.00027477584,0.000064280415,0.00019666748,0.0002844197,0.8763599,0.0030921453,0.02672954,0.005455697,0.08584038],"study_design_scores_gemma":[0.00013129493,0.00006732558,0.00020312426,0.00002384807,0.000021554573,0.00008225776,0.0001033379,0.9743808,0.0013878681,0.021428041,0.0021576593,0.000012915495],"about_ca_topic_score_codex":0.009633543,"about_ca_topic_score_gemma":0.009796999,"teacher_disagreement_score":0.009633543,"about_ca_system_score_codex":0.0021734838,"about_ca_system_score_gemma":0.0024099615,"threshold_uncertainty_score":0.019154906},"labels":[],"label_agreement":null},{"id":"W3035202434","doi":"10.5539/cis.v13n3p1","title":"Traffic Analysis of a Congested and Uncongested Network in a Sequential Server Model","year":2020,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Queue; Network packet; Throughput; Queueing theory; Server; Real-time computing; Telecommunications; Wireless","score_opus":0.020317631998550474,"score_gpt":0.2380522423649277,"score_spread":0.21773461036637723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035202434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9477108,0.00012612465,0.050087847,0.00008663512,0.000018220508,0.00003170687,0.00013216793,0.0001661567,0.0016402722],"genre_scores_gemma":[0.9967236,0.00007135261,0.0025151486,0.000010356166,0.0000059690014,0.0000143423285,0.00007495788,0.000012461639,0.00057190604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993856,0.00016919426,0.000024267607,0.00012553632,0.00014560469,0.00014973078],"domain_scores_gemma":[0.9984384,0.00067934697,0.00022155883,0.00012486811,0.00040977247,0.00012611672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008205856,0.0005855268,0.0005443795,0.0010979119,0.00042268954,0.000623541,0.0009620141,0.00048384396,0.000729463],"category_scores_gemma":[0.0019491536,0.00028579572,0.00041287346,0.00091798056,0.00062485936,0.0010477987,0.00039570342,0.00038964543,0.00012138125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017179751,0.00006619885,0.0034744882,0.000025890587,0.00002353564,0.0001745685,0.0000633349,0.98369515,0.007000069,0.0027054618,0.00023172621,0.002367807],"study_design_scores_gemma":[0.0000019193367,0.000019081062,0.00036144376,0.0000010890195,0.0000031005147,0.000014711708,0.000012704426,0.99887484,0.00037088423,0.00030848332,0.000028907958,0.000002887149],"about_ca_topic_score_codex":0.0107006915,"about_ca_topic_score_gemma":0.0051618265,"teacher_disagreement_score":0.0107006915,"about_ca_system_score_codex":0.0014429739,"about_ca_system_score_gemma":0.00083401514,"threshold_uncertainty_score":0.021276832},"labels":[],"label_agreement":null},{"id":"W3042614545","doi":"10.1109/tits.2020.3005931","title":"Cross-Layer Defense Methods for Jamming-Resistant CBTC Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Beijing Municipal Science and Technology Commission; Natural Science Foundation of Beijing Municipality; Beijing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Jamming; Computer science; Physics","score_opus":0.06351296883540476,"score_gpt":0.33964255947462746,"score_spread":0.2761295906392227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042614545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021089591,0.0003246154,0.97497725,0.00011640516,0.00004242786,0.00003741633,0.000011851842,0.0003505948,0.003049766],"genre_scores_gemma":[0.96018475,0.0002912843,0.036725547,0.00012619041,0.000032071122,0.000051444895,0.000026456548,0.000034100485,0.0025281394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999318,0.00013089366,0.000039712148,0.00013942915,0.00023942525,0.00013255687],"domain_scores_gemma":[0.9991222,0.00031346633,0.0001911055,0.00011789713,0.00019809915,0.000057173253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007352504,0.00075734925,0.00052159996,0.0004962906,0.00058484665,0.00086358027,0.0007515921,0.00066588377,0.0022687744],"category_scores_gemma":[0.0017228927,0.0002539038,0.0005947494,0.00032783017,0.00057426293,0.0011158367,0.0016851993,0.0009852415,0.0003458526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023650631,0.00009779509,0.0010868444,0.00017435024,0.00010449981,0.00019273965,0.00028171137,0.78699076,0.034855306,0.04757321,0.001965009,0.12644117],"study_design_scores_gemma":[0.000005643979,0.00006071357,0.000092319344,0.0000049895034,0.000010135801,0.000034346343,0.000012602893,0.9951155,0.0016916347,0.0023933977,0.0005723256,0.0000063569014],"about_ca_topic_score_codex":0.0018960356,"about_ca_topic_score_gemma":0.0011025922,"teacher_disagreement_score":0.0022687744,"about_ca_system_score_codex":0.0006744254,"about_ca_system_score_gemma":0.00072476844,"threshold_uncertainty_score":0.0075897574},"labels":[],"label_agreement":null},{"id":"W3044022837","doi":"","title":"The Advantage of Moving Nodes in Formations in MANETs and M2ANETs","year":2013,"lang":"en","type":"article","venue":"International Conference on Wireless and Mobile Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Mobile ad hoc network; Computer network; Network packet","score_opus":0.024196111969159072,"score_gpt":0.2894615349471186,"score_spread":0.2652654229779596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044022837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4550504,0.0078528505,0.49949315,0.002684525,0.0010123401,0.00014544015,0.00022835344,0.00033802437,0.033194873],"genre_scores_gemma":[0.9685997,0.0012809954,0.025317684,0.00013131824,0.00016180385,0.000032772223,0.000051145293,0.000033516702,0.0043910467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926764,0.0002992014,0.000029103647,0.00012637973,0.00016731516,0.00011039037],"domain_scores_gemma":[0.99698985,0.0017925596,0.0003128355,0.00040656948,0.00026083353,0.00023730555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001069731,0.00049704197,0.00064282794,0.000537502,0.0011979116,0.0010850943,0.0011401756,0.0012130378,0.0021602672],"category_scores_gemma":[0.0067346217,0.00036076352,0.0003885175,0.0009901422,0.0012281565,0.0029519293,0.0020555963,0.0008325589,0.0004604698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023617574,0.00017462778,0.012531014,0.00077711785,0.00019979231,0.0015080713,0.0018209202,0.35893252,0.038074534,0.3850494,0.005562891,0.1930073],"study_design_scores_gemma":[0.0001944436,0.0013156078,0.00696493,0.0000963325,0.00028741724,0.0027496924,0.001860794,0.76162434,0.016507551,0.18149382,0.026803842,0.00010127121],"about_ca_topic_score_codex":0.0010606166,"about_ca_topic_score_gemma":0.0013579288,"teacher_disagreement_score":0.0021602672,"about_ca_system_score_codex":0.00036676155,"about_ca_system_score_gemma":0.00038453468,"threshold_uncertainty_score":0.0072268844},"labels":[],"label_agreement":null},{"id":"W3045850097","doi":"10.1007/978-3-319-32903-1_240-1","title":"Opportunistic Routing (OR)","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Computer science","score_opus":0.03889239627103634,"score_gpt":0.24164433941609284,"score_spread":0.2027519431450565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045850097","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018305818,0.017673908,0.122383095,0.0013869783,0.0037894866,0.00022181241,0.000961697,0.0031819784,0.8485706],"genre_scores_gemma":[0.051935527,0.038254824,0.094700314,0.0020963422,0.0020224664,0.0002962654,0.0020702719,0.0009153971,0.80770856],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996927,0.000037599748,0.000012753252,0.00007336596,0.00013605207,0.000047507965],"domain_scores_gemma":[0.9997129,0.000087782544,0.000022065404,0.00009662104,0.000054657205,0.000025948371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035461463,0.0008490236,0.0004902119,0.0010802427,0.0006791749,0.0021636991,0.0012177813,0.0010367443,0.06565737],"category_scores_gemma":[0.00085622084,0.00027457168,0.00039505944,0.0018474013,0.0004709855,0.0020069936,0.0015990713,0.0010480948,0.030454604],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006318264,0.000057144374,0.00008652234,0.00048568315,0.000018734105,0.00012314085,0.00006850102,0.002852336,0.0031501562,0.15564379,0.23607029,0.6013805],"study_design_scores_gemma":[0.000012776433,0.000055779845,0.000114493196,0.00017401014,0.000018586268,0.00051663717,0.000039723942,0.005325713,0.0014258676,0.04034692,0.9519489,0.000020606387],"about_ca_topic_score_codex":0.0010209505,"about_ca_topic_score_gemma":0.0020697846,"teacher_disagreement_score":0.06565737,"about_ca_system_score_codex":0.0006281524,"about_ca_system_score_gemma":0.0007246621,"threshold_uncertainty_score":0.2196458},"labels":[],"label_agreement":null},{"id":"W305713279","doi":"","title":"Performance improvement of clustered mobile ad hoc networks using a CDMA single channel and based on admission control approach","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Computer network; Quality of service; Cluster analysis; Throughput; Overhead (engineering); Mobile ad hoc network; Network packet; Admission control; Wireless ad hoc network; Distributed computing; Cluster (spacecraft); Packet loss; Network performance; Wireless","score_opus":0.02048542293808598,"score_gpt":0.21284758412608615,"score_spread":0.19236216118800017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W305713279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62029624,0.0007199215,0.36837444,0.00039558078,0.00019614818,0.000082759136,0.000032051594,0.0014576494,0.008445191],"genre_scores_gemma":[0.9906517,0.000050085706,0.008886998,0.00001572775,0.000010258124,0.000008470675,0.0000066041575,0.0000053689064,0.00036484338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99954695,0.000136708,0.000014036837,0.00006383205,0.0001706705,0.00006782591],"domain_scores_gemma":[0.99911433,0.00038932863,0.00006484332,0.000092200666,0.00026980738,0.00006957926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063670013,0.0004320374,0.0002846023,0.00059408176,0.00055320136,0.0006268767,0.00069420296,0.0005223321,0.0007324147],"category_scores_gemma":[0.0019691275,0.000115255156,0.0002225466,0.0005327584,0.0004509709,0.0006075942,0.00042905772,0.00045009327,0.00011938961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043604302,0.0002922486,0.0030781212,0.0000706798,0.00008292499,0.00009750352,0.00012070119,0.8926981,0.027140526,0.008371547,0.0008021963,0.06680946],"study_design_scores_gemma":[0.000010518252,0.000085713196,0.00025377024,0.0000027764424,0.000013293932,0.000019656924,0.000013894505,0.9948521,0.0040060505,0.0005388507,0.00019721923,0.0000061312826],"about_ca_topic_score_codex":0.0050600106,"about_ca_topic_score_gemma":0.0033902233,"teacher_disagreement_score":0.0050600106,"about_ca_system_score_codex":0.0010609708,"about_ca_system_score_gemma":0.0008278314,"threshold_uncertainty_score":0.010061145},"labels":[],"label_agreement":null},{"id":"W3082387259","doi":"10.1142/s0218195920500016","title":"Local Routing in Convex Subdivisions","year":2020,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Manitoba; Carleton University","funders":"","keywords":"Subdivision; Monotone polygon; Mathematics; Computer science; Topology (electrical circuits); Combinatorics; Geometry; Geography","score_opus":0.015343762615412522,"score_gpt":0.28210660449716746,"score_spread":0.2667628418817549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082387259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07851755,0.00021691839,0.9108987,0.00020581967,0.00003462911,0.00006987386,0.000115940085,0.0007614686,0.0091790715],"genre_scores_gemma":[0.77411354,0.00025611374,0.21821706,0.000141136,0.000027029584,0.00014547192,0.00034426473,0.00015106863,0.006604294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994282,0.00013670478,0.00003543792,0.00012802595,0.00017774913,0.000093916045],"domain_scores_gemma":[0.9983987,0.00066560315,0.00021000394,0.00045587687,0.00020082027,0.0000690674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056877616,0.0003556942,0.00056140916,0.0004059637,0.00063719065,0.0010503342,0.0011439371,0.00044223492,0.0028606688],"category_scores_gemma":[0.0030413563,0.00023566416,0.00041435522,0.00049467257,0.0012974445,0.0019541858,0.002041073,0.0008710432,0.00057990267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002797046,0.000057387966,0.0009659481,0.00013141774,0.000022804768,0.0001962423,0.00047292135,0.4556618,0.017351419,0.3736403,0.0029643008,0.1482557],"study_design_scores_gemma":[0.000015668067,0.00007469187,0.0001511584,0.000015001104,0.000007938758,0.000062404775,0.00006539453,0.8488289,0.0056711654,0.14132947,0.003763694,0.000014463643],"about_ca_topic_score_codex":0.0019617353,"about_ca_topic_score_gemma":0.002503307,"teacher_disagreement_score":0.0028606688,"about_ca_system_score_codex":0.00096825825,"about_ca_system_score_gemma":0.00054774596,"threshold_uncertainty_score":0.009569883},"labels":[],"label_agreement":null},{"id":"W30851396","doi":"10.1016/j.jaac.2018.09.448","title":"A generic background dissemination service for mobile ad-hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Institute of Mental Health; Canadian Institutes of Health Research; Klingenstein Third Generation Foundation; Fondation Brain Canada; National Alliance for Research on Schizophrenia and Depression; American Psychiatric Publishing; American Foundation for Suicide Prevention; Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute on Drug Abuse; Brain and Behavior Research Foundation","keywords":"Computer science; Dissemination; Mobile ad hoc network; Computer network; Service discovery; Wireless ad hoc network; Service (business); Information Dissemination; Vehicular ad hoc network; Service delivery framework; Ad hoc wireless distribution service; Mobile computing; Protocol (science); Distributed computing; World Wide Web; Optimized Link State Routing Protocol; Telecommunications; Web service; Wireless; Network packet; Business; Medicine","score_opus":0.016152520746922253,"score_gpt":0.2654207938189967,"score_spread":0.24926827307207444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30851396","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1494027,0.0029617136,0.16745318,0.0055096042,0.0039920807,0.014387582,0.09338014,0.18474655,0.37816653],"genre_scores_gemma":[0.45413804,0.0029251054,0.05897915,0.002505528,0.0030974688,0.0063482122,0.06416427,0.0055694734,0.4022727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996358,0.00009377659,0.00003406221,0.00005966251,0.00010215793,0.00007449064],"domain_scores_gemma":[0.99799037,0.00037503237,0.0001756616,0.00050971215,0.00048718168,0.0004619382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011272636,0.000648848,0.00072246627,0.0017099703,0.000722215,0.0012196545,0.0010086414,0.0010430674,0.15620497],"category_scores_gemma":[0.0042826612,0.00022098825,0.00028655314,0.0014118394,0.00017951342,0.00084213505,0.0017448905,0.0009671647,0.08733196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014122105,0.00056146696,0.0077359215,0.000883357,0.000054865603,0.000811136,0.00048650062,0.00080810435,0.023070484,0.0045910706,0.3847605,0.5748244],"study_design_scores_gemma":[0.001585195,0.0011555933,0.036171302,0.00032110163,0.00019216735,0.0021052144,0.00043718467,0.02210597,0.009279797,0.005318112,0.9211679,0.00016046141],"about_ca_topic_score_codex":0.0021580688,"about_ca_topic_score_gemma":0.0021867298,"teacher_disagreement_score":0.15620497,"about_ca_system_score_codex":0.00039275215,"about_ca_system_score_gemma":0.0007156678,"threshold_uncertainty_score":0.5225577},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04267789685971997,"score_gpt":0.32294169688550456,"score_spread":0.2802638000257846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089637452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075814985,0.00211176,0.9819886,0.00028883913,0.00016836595,0.00016206842,0.00004268662,0.0009823997,0.0066736597],"genre_scores_gemma":[0.23042306,0.0033248484,0.75775254,0.00020370728,0.0001414472,0.0006426568,0.00023640963,0.00010675244,0.0071684937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957615,0.00015206098,0.000024787128,0.000057289144,0.00015739146,0.000032292704],"domain_scores_gemma":[0.99975413,0.000110587345,0.00003169786,0.000025892066,0.000064977234,0.00001269322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046261196,0.0005022295,0.00059553783,0.00077250943,0.0004562859,0.00080690667,0.0009486285,0.00075094023,0.0008215479],"category_scores_gemma":[0.0012190592,0.00019673786,0.00050663546,0.0013081478,0.0005369137,0.000798666,0.00062688807,0.0008397111,0.0003522829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007185393,0.000115443494,0.0012499399,0.00027993668,0.00014144581,0.00034986413,0.00020085584,0.5163416,0.01082006,0.08071755,0.0050886124,0.38462284],"study_design_scores_gemma":[0.000054974855,0.00020067912,0.0005112181,0.000075853364,0.00006294309,0.00047076604,0.000053721855,0.92241174,0.00437871,0.039631665,0.032082666,0.00006499576],"about_ca_topic_score_codex":0.0022283187,"about_ca_topic_score_gemma":0.0015312902,"teacher_disagreement_score":0.0022283187,"about_ca_system_score_codex":0.00059001945,"about_ca_system_score_gemma":0.0009425792,"threshold_uncertainty_score":0.0044307113},"labels":[],"label_agreement":null},{"id":"W3100145955","doi":"","title":"Routing Load of Route Discovery and Route Maintenance in Wireless Reactive Routing Protocols","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Alberta","funders":"","keywords":"Computer science; Dynamic Source Routing; Computer network; Link-state routing protocol; Zone Routing Protocol; Static routing; Wireless Routing Protocol; Distributed computing; Interior gateway protocol; Routing protocol; Routing Information Protocol; Policy-based routing; Distance-vector routing protocol; Destination-Sequenced Distance Vector routing; Routing (electronic design automation)","score_opus":0.017933334277622,"score_gpt":0.2715902592140624,"score_spread":0.2536569249364404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100145955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24741153,0.017150711,0.6914299,0.0024899319,0.00096862204,0.00022376743,0.0004473945,0.0010984492,0.03877965],"genre_scores_gemma":[0.9636235,0.004631837,0.026337335,0.00021495367,0.0004908478,0.00013886581,0.00022631818,0.0002491557,0.004087221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760854,0.0006446762,0.00009467603,0.00032458457,0.0010880764,0.00023951266],"domain_scores_gemma":[0.99253404,0.0053501767,0.0005632071,0.0006445789,0.0007970151,0.00011096966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015203311,0.0009936899,0.0008000584,0.0011816196,0.00070924143,0.0017186146,0.0015092209,0.0010641954,0.0017558174],"category_scores_gemma":[0.0142928595,0.0004884893,0.00042169567,0.0013674658,0.0009137501,0.0039280476,0.000843219,0.0010203734,0.00033582092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040645245,0.00024138867,0.004007185,0.0009025082,0.00014392055,0.00073429575,0.00060796324,0.698621,0.024217654,0.14682277,0.0038356709,0.119459264],"study_design_scores_gemma":[0.000016496764,0.00021035079,0.0019518625,0.0000752266,0.00010450017,0.00053532637,0.000196136,0.9447038,0.0074826204,0.036806118,0.007875275,0.000042187112],"about_ca_topic_score_codex":0.0013609359,"about_ca_topic_score_gemma":0.0011678465,"teacher_disagreement_score":0.0017558174,"about_ca_system_score_codex":0.00138632,"about_ca_system_score_gemma":0.00063300476,"threshold_uncertainty_score":0.010058463},"labels":[],"label_agreement":null},{"id":"W3117413955","doi":"10.22215/etd/2018-12665","title":"Simple Cross-Layer Network Utility Maximization Framework for Multiflow Mobile Ad-Hoc Networks","year":2018,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Utility maximization; Network congestion; Network layer; Optimized Link State Routing Protocol; Queue; Utility maximization problem; Vehicular ad hoc network; Routing protocol; Routing (electronic design automation); Wireless; Network packet; Layer (electronics); Telecommunications","score_opus":0.01916863447739227,"score_gpt":0.3149377845747653,"score_spread":0.29576915009737303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117413955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036490425,0.00074676203,0.98761135,0.00027578208,0.00006526006,0.000062906794,0.000060521506,0.00012021135,0.0074080876],"genre_scores_gemma":[0.5914285,0.0031805404,0.3766459,0.0005098777,0.00044338056,0.0005563684,0.00028775595,0.0003002599,0.026647335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909055,0.00035871015,0.000027029608,0.00013333373,0.0002539825,0.00013650268],"domain_scores_gemma":[0.99948514,0.0002403074,0.000040794115,0.000058332138,0.00013205688,0.000043377466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019462105,0.0011716516,0.0009281204,0.0006113974,0.0005582,0.0013764703,0.002686116,0.0009297086,0.0049273334],"category_scores_gemma":[0.0020937875,0.00041990122,0.0009506009,0.0008904197,0.0007957079,0.0020617682,0.0018600984,0.001909358,0.001158537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047122452,0.000114734,0.00032213485,0.00022240303,0.00008424642,0.00016975921,0.00014785229,0.57512915,0.0032705646,0.36873752,0.0062793423,0.04547524],"study_design_scores_gemma":[0.0000074317995,0.00003154672,0.000091041606,0.00001620665,0.000016369142,0.000044346445,0.000014981841,0.92846817,0.00031188963,0.067732975,0.0032556364,0.000009406347],"about_ca_topic_score_codex":0.0021906924,"about_ca_topic_score_gemma":0.0021049418,"teacher_disagreement_score":0.0049273334,"about_ca_system_score_codex":0.0017028328,"about_ca_system_score_gemma":0.0011897088,"threshold_uncertainty_score":0.016483605},"labels":[],"label_agreement":null},{"id":"W3126352285","doi":"10.1007/978-3-030-67369-7_6","title":"Analysis and Performance of Topology Inference in Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Mobile ad hoc network; Computer science; Computer network; Wireless ad hoc network; Inference; Topology (electrical circuits); Artificial intelligence; Telecommunications; Engineering; Electrical engineering; Wireless","score_opus":0.014143414715786833,"score_gpt":0.23770931842753917,"score_spread":0.22356590371175233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126352285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19634841,0.011942416,0.77859455,0.0016731342,0.00033624485,0.00014559297,0.00044877842,0.0019735089,0.008537339],"genre_scores_gemma":[0.89781964,0.0021992049,0.09651102,0.00012857199,0.00027615885,0.000063332474,0.00046125037,0.0002704943,0.0022703928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9913077,0.0048014787,0.00033529918,0.00072831893,0.002291635,0.00053568574],"domain_scores_gemma":[0.8999594,0.091656625,0.0014390945,0.0033841906,0.0031368092,0.00042394747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010201911,0.0015307836,0.0019394433,0.001778682,0.0008390033,0.0023585395,0.0023504111,0.0017175865,0.002304429],"category_scores_gemma":[0.05421259,0.0007627924,0.00049577124,0.0024213952,0.0018877131,0.004966869,0.0016815572,0.0017776521,0.00033671982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076677714,0.00015435964,0.0028790957,0.00016298576,0.000103278064,0.00006543308,0.00008684635,0.88431317,0.002657753,0.010770682,0.0017424485,0.09629715],"study_design_scores_gemma":[0.000006258527,0.00004926611,0.00035289026,0.000006608557,0.000012750128,0.000024794654,0.000014711475,0.99429226,0.0007324849,0.0043963916,0.00010640333,0.0000052867795],"about_ca_topic_score_codex":0.00504137,"about_ca_topic_score_gemma":0.0035286776,"teacher_disagreement_score":0.010201911,"about_ca_system_score_codex":0.0023491404,"about_ca_system_score_gemma":0.0016715474,"threshold_uncertainty_score":0.05395353},"labels":[],"label_agreement":null},{"id":"W3127765628","doi":"10.3390/s21030901","title":"QSMVM: QoS-Aware and Social-Aware Multimetric Routing Protocol for Video-Streaming Services over MANETS","year":2021,"lang":"en","type":"article","venue":"Sensors","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"European Regional Development Fund; Atlantic Research Center for Information and Communication Technologies","keywords":"Computer science; Mobile ad hoc network; Computer network; Quality of service; Routing protocol; Node (physics); Routing (electronic design automation); Service (business); Metric (unit); Multimedia; Network packet; Business","score_opus":0.018840223683593747,"score_gpt":0.2896469990988489,"score_spread":0.27080677541525516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127765628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021117339,0.0025224334,0.96286523,0.001531848,0.00077478803,0.0007447064,0.0003683426,0.0028846997,0.007190615],"genre_scores_gemma":[0.74299824,0.0023300755,0.24347529,0.0010733342,0.0004479762,0.0010582014,0.0009573766,0.00016033216,0.007499025],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906653,0.00031524725,0.00008718616,0.00011314462,0.00031602598,0.00010192279],"domain_scores_gemma":[0.99898475,0.00035175745,0.00013691871,0.00013313946,0.00029915496,0.00009425833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001337608,0.00061553845,0.0008669812,0.0013001877,0.0011879003,0.0011485158,0.0015549243,0.0010311926,0.0015661295],"category_scores_gemma":[0.003674296,0.0002074287,0.0003967635,0.0011513699,0.00068449613,0.0014278004,0.0019262972,0.0010176018,0.0005423496],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070888107,0.00031341688,0.0018534738,0.0009931357,0.0002185573,0.0012649205,0.0009671816,0.21457879,0.048422582,0.2056352,0.048011847,0.477032],"study_design_scores_gemma":[0.00008372315,0.00031214886,0.00050604565,0.00008202952,0.0000601138,0.0005916199,0.00019562001,0.90292406,0.0068902983,0.041442677,0.046833795,0.00007791637],"about_ca_topic_score_codex":0.0018715364,"about_ca_topic_score_gemma":0.0028696586,"teacher_disagreement_score":0.0018715364,"about_ca_system_score_codex":0.0012236532,"about_ca_system_score_gemma":0.0014143122,"threshold_uncertainty_score":0.008878291},"labels":[],"label_agreement":null},{"id":"W3128378252","doi":"10.1007/978-3-030-67369-7_11","title":"Efficient Backbone Routing in Hierarchical MANETs","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Distributed computing; Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Routing protocol; Backbone network; Flooding (psychology); Link-state routing protocol; Wireless ad hoc network; Dynamic Source Routing; Network packet; Wireless; Telecommunications","score_opus":0.017358158257614976,"score_gpt":0.23069892550306778,"score_spread":0.2133407672454528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128378252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063086204,0.0067213364,0.89032507,0.00075442484,0.00026515024,0.00017380952,0.00047653686,0.0016254259,0.036572017],"genre_scores_gemma":[0.5931928,0.0074430183,0.36249775,0.00017980764,0.00023132676,0.00018338866,0.0012031884,0.00031914323,0.034749683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997453,0.0000660267,0.000011751952,0.00003525322,0.00009849253,0.000043141277],"domain_scores_gemma":[0.99966466,0.00018093333,0.000025272486,0.0000645235,0.00004179775,0.00002283118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040759548,0.00040547232,0.00049607235,0.0007637092,0.0003783507,0.0008527482,0.0009787775,0.00044737788,0.0039053669],"category_scores_gemma":[0.0012875617,0.0003820791,0.00018387432,0.0013011198,0.00036906308,0.0014362467,0.0010375368,0.0005415262,0.00090389664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016149966,0.00010923424,0.00044812568,0.00040996826,0.000040276693,0.00011078843,0.00013619155,0.4897116,0.015903058,0.08662567,0.01853661,0.387807],"study_design_scores_gemma":[0.000027035887,0.00011011034,0.00045203633,0.000041462237,0.000023347233,0.00014168385,0.00008197515,0.8948426,0.0043144715,0.082209334,0.017742448,0.000013508516],"about_ca_topic_score_codex":0.001066666,"about_ca_topic_score_gemma":0.0021517067,"teacher_disagreement_score":0.0039053669,"about_ca_system_score_codex":0.0005182042,"about_ca_system_score_gemma":0.0004047862,"threshold_uncertainty_score":0.013064742},"labels":[],"label_agreement":null},{"id":"W3142212837","doi":"10.22215/etd/2011-07214","title":"Reactive-greedy-reactive in unmanned aeronautical Ad-hoc networks : a combinational routing mechanism","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.014556748594081131,"score_gpt":0.2452545333132354,"score_spread":0.23069778471915428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142212837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017321795,0.0007598716,0.97058576,0.00038599,0.00019459393,0.00014750626,0.00005860113,0.0019961642,0.0085496865],"genre_scores_gemma":[0.60174406,0.0009780984,0.38238117,0.0003423034,0.00014694041,0.00024932972,0.00023553566,0.0003579401,0.0135646835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986286,0.00040415072,0.000102544655,0.00021632505,0.00047697086,0.00017136433],"domain_scores_gemma":[0.9980812,0.00067532156,0.00023569723,0.0005586194,0.00029754656,0.00015154945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002489699,0.00071336626,0.00060491514,0.00090405735,0.0009451327,0.0015092295,0.0027628082,0.00098525,0.002564586],"category_scores_gemma":[0.0029227843,0.00055934343,0.00056914624,0.001038623,0.00092850387,0.002713678,0.0024485888,0.0013822023,0.00068121497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010606807,0.00036959464,0.001572908,0.0004297437,0.0002706502,0.00047297354,0.00045067363,0.31494546,0.03832673,0.17677976,0.013558597,0.4517622],"study_design_scores_gemma":[0.000088028864,0.0002972978,0.00044841683,0.000035943736,0.00008601034,0.0003646441,0.00009805581,0.9239594,0.012482155,0.045302685,0.016774293,0.000063125946],"about_ca_topic_score_codex":0.0011535996,"about_ca_topic_score_gemma":0.0023027302,"teacher_disagreement_score":0.0027628082,"about_ca_system_score_codex":0.0006648109,"about_ca_system_score_gemma":0.0007920363,"threshold_uncertainty_score":0.013166964},"labels":[],"label_agreement":null},{"id":"W3144070601","doi":"10.1109/mcom.2008.4539478","title":"Guest editorial - Topics in ad hoc and sensor networks","year":2008,"lang":"en","type":"editorial","venue":"IEEE Communications Magazine","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless ad hoc network; Computer science; Computer network; Wireless sensor network; Vehicular ad hoc network; Ad hoc wireless distribution service; Cover (algebra); Mobile ad hoc network; Focus (optics); Optimized Link State Routing Protocol; Adaptive quality of service multi-hop routing; Wireless; Telecommunications; Engineering","score_opus":0.01682147393498764,"score_gpt":0.2687733076911893,"score_spread":0.25195183375620167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144070601","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000051141953,0.004829891,0.00019019036,0.007506896,0.98502314,0.000012536783,0.000026489799,0.000038132977,0.0023216556],"genre_scores_gemma":[0.00045609687,0.0067856945,0.00013672034,0.0051679392,0.9710684,0.000015005979,0.000045324803,0.000049775,0.01627514],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997877,0.00022551413,0.00023426468,0.00027093923,0.0012224593,0.00016978747],"domain_scores_gemma":[0.988436,0.0023390173,0.00058424124,0.00024510585,0.005920034,0.0024756137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025930703,0.0031596844,0.0025113546,0.003080898,0.0016935242,0.0055682505,0.0020803895,0.0049853697,0.022954753],"category_scores_gemma":[0.007570388,0.00064669305,0.00166139,0.0014309264,0.0011025182,0.002975519,0.0012619608,0.008313702,0.021064464],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042986427,0.000018821514,0.00004596131,0.00022571467,0.000012177664,0.0001295593,0.000008439028,0.000035056342,0.00015913878,0.00028765542,0.9854174,0.013617121],"study_design_scores_gemma":[0.000032982884,0.000048471113,0.0002554464,0.00025115986,0.000029258332,0.00040048666,0.000025592442,0.00016285686,0.00017152917,0.0006275916,0.99798334,0.000011269608],"about_ca_topic_score_codex":0.0004215102,"about_ca_topic_score_gemma":0.0013649454,"teacher_disagreement_score":0.022954753,"about_ca_system_score_codex":0.0011684747,"about_ca_system_score_gemma":0.0011476787,"threshold_uncertainty_score":0.076791346},"labels":[],"label_agreement":null},{"id":"W3144454098","doi":"10.1049/cp:20051491","title":"Performance evaluation of routing with ARC congested node over BTSnet for mobile ad hoc networks and inter-vehicular communications","year":2005,"lang":"en","type":"article","venue":"IEE Mobility Conference 2005. The Second International Conference on Mobile Technology, Applications and Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Assumption University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Network packet; Node (physics); Vehicular ad hoc network; Real-time computing; Wireless; Telecommunications; Engineering","score_opus":0.03556035270570062,"score_gpt":0.2975502926344971,"score_spread":0.2619899399287965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144454098","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8779781,0.0024112065,0.10719234,0.00032385366,0.0002103237,0.0001543635,0.00027442843,0.0018978879,0.009557529],"genre_scores_gemma":[0.9813385,0.0004007025,0.01669518,0.000021867943,0.00001129668,0.000026704925,0.0002359039,0.00003852245,0.0012312848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876,0.00043472697,0.000074520976,0.00012381803,0.00044319674,0.00016381478],"domain_scores_gemma":[0.99769884,0.0011480019,0.0001994894,0.00015663046,0.0006902909,0.000106823696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018767284,0.00055428466,0.00048654864,0.00090309995,0.00041533101,0.00064322626,0.0006885057,0.00035951927,0.0009237903],"category_scores_gemma":[0.0035627715,0.00013853199,0.00018867705,0.0010761009,0.00030330807,0.0009642719,0.00038271013,0.00026499396,0.0001639955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019502951,0.00016740014,0.011330302,0.00032668104,0.00016904518,0.00022590325,0.0001619755,0.8506144,0.016890906,0.0031811213,0.0020283652,0.11295356],"study_design_scores_gemma":[0.000025615042,0.00052572193,0.0024188315,0.0000071509658,0.000039760584,0.000112541755,0.000056094785,0.9893132,0.006510641,0.00029816202,0.00067802425,0.000014307313],"about_ca_topic_score_codex":0.0066384804,"about_ca_topic_score_gemma":0.0055552013,"teacher_disagreement_score":0.0066384804,"about_ca_system_score_codex":0.0013618856,"about_ca_system_score_gemma":0.000545068,"threshold_uncertainty_score":0.013199627},"labels":[],"label_agreement":null},{"id":"W3151955359","doi":"10.1109/date.2007.364523","title":"A Tiny and Efficient Wireless Ad-hoc Protocol for Low-cost Sensor Networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada; Simon Fraser University; University of Alberta","funders":"","keywords":"Computer science; Wireless ad hoc network; Computer network; Robustness (evolution); Fault tolerance; Software deployment; Quality of service; Distributed computing; Optimized Link State Routing Protocol; Wireless sensor network; Ad hoc wireless distribution service; Reliability (semiconductor); Routing protocol; Mobile ad hoc network; Wireless; Routing (electronic design automation); Network packet; Telecommunications","score_opus":0.014841410775693033,"score_gpt":0.281482915134482,"score_spread":0.26664150435878897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151955359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004349692,0.005894561,0.9769622,0.00051699526,0.0013552583,0.00049345824,0.00014895387,0.0018388093,0.0084400745],"genre_scores_gemma":[0.098281704,0.0073976293,0.87069434,0.00081268727,0.00055848516,0.0013198339,0.0007316135,0.00036805894,0.019835608],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994823,0.00010987867,0.00004335708,0.000036134963,0.0003092139,0.000019126015],"domain_scores_gemma":[0.99968994,0.000093840266,0.000038923856,0.00006563369,0.000076138014,0.00003545504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005291672,0.00049713056,0.00055950077,0.00056365464,0.00051385217,0.00064788683,0.0012205917,0.0006046673,0.001958614],"category_scores_gemma":[0.0012468363,0.0002749979,0.00031192752,0.00060585944,0.00055092317,0.001347771,0.0012461523,0.0010421313,0.0012174909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019708446,0.00015775586,0.00044790405,0.0017530319,0.00015204024,0.0009705876,0.0002793532,0.031957,0.085341655,0.15982759,0.046760134,0.67215586],"study_design_scores_gemma":[0.00013842293,0.00070858916,0.0006520637,0.00023718248,0.0001957251,0.0035905598,0.0000899947,0.1867291,0.03734764,0.06326435,0.7068949,0.00015139775],"about_ca_topic_score_codex":0.00014799826,"about_ca_topic_score_gemma":0.00042193092,"teacher_disagreement_score":0.001958614,"about_ca_system_score_codex":0.00017887917,"about_ca_system_score_gemma":0.00036401962,"threshold_uncertainty_score":0.0065522194},"labels":[],"label_agreement":null},{"id":"W3160406857","doi":"10.5121/ijasuc.2021.12201","title":"Optimum Neighbors for Resource-Constrained Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"article","venue":"International Journal of Ad hoc Sensor & Ubiquitous Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Wireless ad hoc network; Network packet; Optimized Link State Routing Protocol; Node (physics); Routing protocol; Throughput; Distributed computing; Bandwidth (computing); Wireless; Telecommunications; Engineering","score_opus":0.012510441238579905,"score_gpt":0.2680211108180769,"score_spread":0.255510669579497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160406857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02686209,0.00953877,0.94698083,0.00066473195,0.00039631987,0.00012440194,0.00010210497,0.0002002975,0.015130515],"genre_scores_gemma":[0.570345,0.010495947,0.4096176,0.00028905366,0.00039376845,0.00027950126,0.00015982239,0.0001259089,0.008293303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922633,0.00027170667,0.000041087776,0.00014346886,0.00025889766,0.000058519494],"domain_scores_gemma":[0.998838,0.00074469217,0.00012648934,0.00008374815,0.0001648205,0.00004231843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009169508,0.00049437274,0.00075194705,0.0006798111,0.0007444857,0.0009993174,0.0007831055,0.00081703655,0.002200891],"category_scores_gemma":[0.0041686944,0.00038265742,0.00036845682,0.00063319784,0.0007759509,0.0022076713,0.00074066967,0.0007484108,0.00042255805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022670189,0.000061847015,0.0014383852,0.0007748307,0.00007705284,0.00044525368,0.00030341189,0.5381132,0.007505933,0.33044794,0.005371766,0.115233734],"study_design_scores_gemma":[0.00007845674,0.00029895388,0.00059559604,0.00015242925,0.00007071131,0.0009483499,0.00025017202,0.80160517,0.0034393899,0.15110295,0.041392535,0.00006530335],"about_ca_topic_score_codex":0.0006529279,"about_ca_topic_score_gemma":0.001319355,"teacher_disagreement_score":0.002200891,"about_ca_system_score_codex":0.00045206695,"about_ca_system_score_gemma":0.00045267993,"threshold_uncertainty_score":0.0073627234},"labels":[],"label_agreement":null},{"id":"W3161215392","doi":"10.1109/icassp39728.2021.9413511","title":"Scalable Reinforcement Learning For Routing In Ad-Hoc Networks Based On Physical-Layer Attributes","year":2021,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reinforcement learning; Wireless ad hoc network; Computer network; Distributed computing; Dynamic Source Routing; Scalability; Wireless Routing Protocol; Adaptive quality of service multi-hop routing; Routing (electronic design automation); Routing protocol; Optimized Link State Routing Protocol; Artificial intelligence; Wireless; Telecommunications","score_opus":0.021819006292856543,"score_gpt":0.25655195994002555,"score_spread":0.234732953647169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161215392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023824863,0.00018496934,0.9739043,0.00024370685,0.000044256863,0.000038799237,0.000018220859,0.00023759007,0.001503266],"genre_scores_gemma":[0.93619627,0.0001616664,0.061860964,0.00009805339,0.000038563914,0.00009286874,0.000037463575,0.000034938814,0.0014792283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995485,0.00015852909,0.000020900581,0.00008504262,0.00012037885,0.00006675301],"domain_scores_gemma":[0.99823135,0.0011329546,0.00017538124,0.00013715852,0.0002260525,0.000097049444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001402324,0.00067393837,0.0007924488,0.00027969477,0.00034086077,0.00056450174,0.0012283548,0.0006774182,0.0010839527],"category_scores_gemma":[0.004508046,0.00033627776,0.0002942311,0.0002848575,0.001036063,0.0011646487,0.0009840371,0.001477231,0.00016219157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021446798,0.00002559007,0.00031451404,0.000019287663,0.000014217031,0.000024270767,0.000017586557,0.98054975,0.000843367,0.0059922594,0.0002739946,0.011903786],"study_design_scores_gemma":[0.0000028608115,0.0000081851185,0.000023124527,0.0000010335286,0.0000013094515,0.0000022608988,0.0000013543721,0.9975503,0.00008921853,0.0022613527,0.00005788069,0.0000011135726],"about_ca_topic_score_codex":0.0029282449,"about_ca_topic_score_gemma":0.0028782727,"teacher_disagreement_score":0.0029282449,"about_ca_system_score_codex":0.0009994621,"about_ca_system_score_gemma":0.0008909276,"threshold_uncertainty_score":0.0074162483},"labels":[],"label_agreement":null},{"id":"W3180830413","doi":"10.1007/978-3-030-77459-2_7","title":"Directional QoS Routing Framework","year":2021,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Quality of service; Distributed computing; Wireless network; Anycast; Wireless; Bandwidth (computing); Routing (electronic design automation); Telecommunications","score_opus":0.006358392109598615,"score_gpt":0.1879278840853847,"score_spread":0.18156949197578606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3180830413","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034129426,0.0020196685,0.84668595,0.00105282,0.0009748347,0.00026188348,0.0011559305,0.0066253934,0.13781062],"genre_scores_gemma":[0.11578851,0.007240377,0.6620422,0.0011386725,0.0006475227,0.000535309,0.004306577,0.0013281361,0.20697266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970967,0.00003118725,0.00001667586,0.00006439754,0.00014096926,0.000037060752],"domain_scores_gemma":[0.99978596,0.000030364814,0.000010295787,0.00006865833,0.00007729969,0.000027387834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055100146,0.0007309801,0.00037494322,0.0006680392,0.00056841254,0.0020940965,0.001173209,0.0005859458,0.018600589],"category_scores_gemma":[0.0006972685,0.00026801278,0.0003411799,0.0006518364,0.0003171155,0.0011572758,0.001114547,0.0011442597,0.0089654215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000776068,0.00010700621,0.00018130385,0.00015863463,0.000018979046,0.00008571157,0.0000856694,0.014413481,0.014337457,0.61167395,0.059982833,0.29887742],"study_design_scores_gemma":[0.000030531344,0.00007383461,0.00020541504,0.00007831685,0.00004040027,0.00029302292,0.00007678244,0.122683086,0.0092549855,0.24092673,0.6262906,0.000046345038],"about_ca_topic_score_codex":0.0019786498,"about_ca_topic_score_gemma":0.0030302901,"teacher_disagreement_score":0.018600589,"about_ca_system_score_codex":0.000689417,"about_ca_system_score_gemma":0.001149961,"threshold_uncertainty_score":0.062225163},"labels":[],"label_agreement":null},{"id":"W3186640055","doi":"10.18280/ts.380330","title":"An Efficient Signal Processing Model for Malicious Signal Identification and Energy Consumption Reduction for Improving Data Transmission Rate","year":2021,"lang":"en","type":"article","venue":"Traitement du signal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Energy consumption; Computer network; SIGNAL (programming language); Transmission (telecommunications); Real-time computing; Data transmission; Identification (biology); Energy (signal processing); Wireless ad hoc network; Telecommunications; Wireless; Engineering; Electrical engineering","score_opus":0.039487385598263744,"score_gpt":0.2804620480961879,"score_spread":0.24097466249792415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186640055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007441182,0.00031187083,0.98701906,0.0001683762,0.00006291765,0.000057012916,0.000038016406,0.0003795238,0.004522034],"genre_scores_gemma":[0.77213997,0.0015856997,0.19838673,0.00018795457,0.00013955389,0.00032199812,0.00024363757,0.00013193204,0.026862463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993837,0.000097049975,0.000035117442,0.00016991171,0.00023965552,0.00007453282],"domain_scores_gemma":[0.9996549,0.00010512741,0.00004086506,0.000038960075,0.00014670772,0.0000134626625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005930614,0.00089968037,0.0006748542,0.00063631,0.000499899,0.0011051991,0.0014390876,0.00090599665,0.0039802673],"category_scores_gemma":[0.0008995969,0.0002626086,0.0008957931,0.0005425044,0.00055008155,0.0014096898,0.0005074537,0.0011726851,0.0010714267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029538482,0.00019822427,0.00072251266,0.00024226149,0.0000639956,0.00034532373,0.00017025745,0.7655832,0.04048551,0.04248952,0.0035278653,0.1458759],"study_design_scores_gemma":[0.0000053280605,0.000074363765,0.00008415082,0.000005330912,0.000012347889,0.000067749286,0.000008883858,0.99409,0.002696805,0.0017979505,0.0011498462,0.0000071896343],"about_ca_topic_score_codex":0.0031151727,"about_ca_topic_score_gemma":0.002375687,"teacher_disagreement_score":0.0039802673,"about_ca_system_score_codex":0.00085034117,"about_ca_system_score_gemma":0.00078109285,"threshold_uncertainty_score":0.01331538},"labels":[],"label_agreement":null},{"id":"W3186682778","doi":"10.11591/ijece.v12i1.pp605-619","title":"Performance of symmetric and asymmetric links in wireless networks","year":2021,"lang":"en","type":"article","venue":"International Journal of Power Electronics and Drive Systems/International Journal of Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Jordan University of Science and Technology","keywords":"Computer science; Computer network; Wireless network; Wireless; Network packet; Dual (grammatical number); Bandwidth (computing); Radio resource management; Distributed computing; Telecommunications","score_opus":0.003277748833819549,"score_gpt":0.2002711042761904,"score_spread":0.19699335544237087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186682778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91047555,0.0025974296,0.07339655,0.00073766307,0.00019701238,0.000111235284,0.0003332649,0.0005096216,0.011641726],"genre_scores_gemma":[0.9956797,0.00033902162,0.0032260753,0.000036643538,0.000021800704,0.000025555903,0.00009878538,0.000018721808,0.0005536646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966788,0.001215321,0.00017636476,0.00037616337,0.00092730223,0.0006260407],"domain_scores_gemma":[0.97984034,0.014348394,0.0018511126,0.0011549694,0.0022277972,0.0005773046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004327886,0.0008841442,0.00088473485,0.0013344212,0.0012760784,0.0020200452,0.0013196473,0.001104616,0.0011913544],"category_scores_gemma":[0.020210387,0.0003721579,0.00031979362,0.0013214048,0.0012084604,0.0030690504,0.0017307806,0.00070246996,0.0002673087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069567765,0.00016657298,0.005145747,0.00017301236,0.0000633509,0.00023171958,0.00016784116,0.9519554,0.0072839474,0.008606271,0.0011140533,0.02439635],"study_design_scores_gemma":[0.000016485581,0.00036180308,0.0010542494,0.000015607759,0.000026944394,0.00013407317,0.00011814168,0.99048305,0.0038718719,0.0036102138,0.00028505144,0.000022488806],"about_ca_topic_score_codex":0.0030912522,"about_ca_topic_score_gemma":0.0022231636,"teacher_disagreement_score":0.004327886,"about_ca_system_score_codex":0.0018663298,"about_ca_system_score_gemma":0.00092602347,"threshold_uncertainty_score":0.022888303},"labels":[],"label_agreement":null},{"id":"W3187761480","doi":"10.32920/ryerson.14645583.v1","title":"OLSR in Android operating system","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Optimized Link State Routing Protocol; Computer network; Computer science; Ad hoc wireless distribution service; Wireless Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Routing protocol; Operating system; Wireless; Routing (electronic design automation)","score_opus":0.014830195530743946,"score_gpt":0.2373564993741067,"score_spread":0.22252630384336275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187761480","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01289292,0.0032987017,0.08179891,0.0010336342,0.0009480003,0.0029133495,0.040579375,0.7068441,0.14969096],"genre_scores_gemma":[0.21093544,0.0086378595,0.15778401,0.00508391,0.0010950671,0.011044272,0.12640236,0.15607,0.32294708],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998965,0.00009005731,0.00012653644,0.00017132562,0.0004560426,0.00019090858],"domain_scores_gemma":[0.9984615,0.000238792,0.00017839193,0.00029398315,0.00067454815,0.00015276975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071857916,0.0021013282,0.0013012734,0.0015481757,0.0005034426,0.0014580138,0.0023597213,0.0009314283,0.07932993],"category_scores_gemma":[0.0031500284,0.0007668041,0.00079880795,0.0007081159,0.00039694377,0.0017432276,0.0017189123,0.0016286838,0.08703455],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012876305,0.00023420106,0.0022294477,0.0024466182,0.00012139686,0.0011098492,0.00080379535,0.0013680664,0.019419381,0.0064309426,0.7279344,0.23661423],"study_design_scores_gemma":[0.00041691418,0.0003908878,0.008343625,0.00055975834,0.00019029278,0.0014415522,0.00027014862,0.0081376545,0.02592545,0.004486787,0.9494514,0.0003854618],"about_ca_topic_score_codex":0.002231651,"about_ca_topic_score_gemma":0.001441334,"teacher_disagreement_score":0.07932993,"about_ca_system_score_codex":0.00038216455,"about_ca_system_score_gemma":0.0011920467,"threshold_uncertainty_score":0.2653851},"labels":[],"label_agreement":null},{"id":"W3189530906","doi":"10.32920/ryerson.14648250.v1","title":"Preventing Collaborative Wormhole Attacks In AODV-based Mobile Ad-Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Computer science; Wormhole; Computer network; Network packet; Wireless ad hoc network; Vehicular ad hoc network; Wireless; Routing (electronic design automation); Computer security; Routing protocol; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.011885562593803257,"score_gpt":0.2666207783937986,"score_spread":0.25473521579999536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189530906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24319951,0.0020938604,0.7467839,0.00029353698,0.00020007967,0.00043285495,0.000057903177,0.0011447027,0.0057936762],"genre_scores_gemma":[0.9322686,0.00055510784,0.06597962,0.000044791046,0.000028119292,0.00009726227,0.00005381306,0.000021308791,0.00095135055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890184,0.00029305642,0.000100798694,0.00011029619,0.00048615283,0.00010785159],"domain_scores_gemma":[0.9979747,0.000866956,0.0004258688,0.00028386273,0.00037702516,0.00007159489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010775288,0.0005200779,0.0005660637,0.001035839,0.0006235027,0.0006283841,0.00090091786,0.00063484354,0.00034047055],"category_scores_gemma":[0.0038628608,0.0002745549,0.00037184972,0.00057048205,0.0005675169,0.0013140172,0.0010489993,0.00050066435,0.00011922226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007386538,0.00043579453,0.0069050333,0.0006901646,0.0002953326,0.0008876569,0.00062378024,0.5771164,0.11650332,0.03523765,0.0022101018,0.2583561],"study_design_scores_gemma":[0.000063169275,0.00068660564,0.00095766364,0.000032822147,0.0000891218,0.00049857225,0.00017652009,0.9506776,0.03522283,0.007821991,0.0037319853,0.00004108936],"about_ca_topic_score_codex":0.0010461047,"about_ca_topic_score_gemma":0.0012679271,"teacher_disagreement_score":0.0010775288,"about_ca_system_score_codex":0.0003727304,"about_ca_system_score_gemma":0.00065294467,"threshold_uncertainty_score":0.0056986213},"labels":[],"label_agreement":null},{"id":"W3190040767","doi":"10.32920/ryerson.14664300.v1","title":"Energy-aware ant colony optimization based routing for mobile ad hoc networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Wireless Routing Protocol; Optimized Link State Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Routing protocol; Mobile ad hoc network; Distributed computing; Routing (electronic design automation)","score_opus":0.013548754518283766,"score_gpt":0.24028081694059497,"score_spread":0.2267320624223112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190040767","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020009832,0.005624039,0.96058935,0.00040452572,0.00041846457,0.00013541983,0.00006624302,0.000589288,0.012162805],"genre_scores_gemma":[0.5874233,0.007692658,0.3909966,0.00022389773,0.00015676365,0.00030353392,0.00027793102,0.00014268322,0.012782544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.00005424454,0.00000823409,0.000023116036,0.000105413535,0.000009320823],"domain_scores_gemma":[0.9998411,0.00006967032,0.000025700307,0.000012954873,0.000044050874,0.0000063639964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019023403,0.0003948951,0.00040646346,0.0002788151,0.00023731399,0.0005075161,0.00050263654,0.00036942158,0.00073517376],"category_scores_gemma":[0.0007419463,0.000141514,0.00025193006,0.00053741183,0.0002536882,0.00040824056,0.00031152242,0.00046830086,0.00026645805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044721637,0.00005782092,0.0005905247,0.00028515825,0.00006536335,0.00014944194,0.0000615568,0.80351245,0.012406346,0.021081889,0.004283076,0.15746166],"study_design_scores_gemma":[0.000006880742,0.00004018486,0.00019112563,0.0000124509925,0.000011026109,0.00005839769,0.00001298487,0.9863427,0.0012133279,0.005591412,0.0065118386,0.000007713139],"about_ca_topic_score_codex":0.001434146,"about_ca_topic_score_gemma":0.0018377386,"teacher_disagreement_score":0.001434146,"about_ca_system_score_codex":0.00025798182,"about_ca_system_score_gemma":0.00041394267,"threshold_uncertainty_score":0.0028516054},"labels":[],"label_agreement":null},{"id":"W3196752116","doi":"10.1109/tvt.2021.3110085","title":"Throughput-Optimal Dynamic Broadcast for SINR-Based Multi-Hop Wireless Networks With Time-Varying Topology","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Wireless network; Wireless ad hoc network; Signal-to-interference-plus-noise ratio; Scheduling (production processes); Network topology; Wireless; Broadcast radiation; Distributed computing; Wireless sensor network; Network packet; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.009684001774675904,"score_gpt":0.2403280891886022,"score_spread":0.2306440874139263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196752116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030555569,0.00097122055,0.9632258,0.0002755686,0.000058252455,0.00007515973,0.000111040965,0.0003868056,0.0043406975],"genre_scores_gemma":[0.9015025,0.001514216,0.09458519,0.00013904936,0.00008952975,0.00017566595,0.00023627482,0.00011576402,0.0016417898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987797,0.00033540747,0.000044910714,0.00020270189,0.00042638107,0.00021087957],"domain_scores_gemma":[0.99700385,0.0021732785,0.00029990298,0.00015223904,0.00027849857,0.000092291164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016131173,0.00082607777,0.0011763832,0.0010085213,0.00089122314,0.0011466868,0.0013034864,0.0007458282,0.00094518176],"category_scores_gemma":[0.007218367,0.0005164177,0.00047629335,0.0015432069,0.0014218437,0.0013302864,0.00097492296,0.0009247106,0.00025684206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015384774,0.00006527763,0.00038206214,0.00019227412,0.00002599533,0.00012666702,0.0001310263,0.94195074,0.0062791468,0.022910854,0.0014712506,0.026310788],"study_design_scores_gemma":[0.00001202513,0.0000454648,0.00008765727,0.000006657991,0.000009137642,0.00003580805,0.0000277542,0.9908235,0.0009356021,0.007649906,0.0003615326,0.0000050794656],"about_ca_topic_score_codex":0.0042797914,"about_ca_topic_score_gemma":0.0041946364,"teacher_disagreement_score":0.0042797914,"about_ca_system_score_codex":0.002340403,"about_ca_system_score_gemma":0.0017725965,"threshold_uncertainty_score":0.016980886},"labels":[],"label_agreement":null},{"id":"W3198009227","doi":"10.1007/s11277-021-09009-7","title":"Fuzzy Routing Protocol for D2D Communications Based on Probabilistic Normed Spaces","year":2021,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; St. Francis Xavier University","funders":"","keywords":"Computer science; Path vector protocol; Probabilistic logic; Routing protocol; Shortest path problem; Node (physics); Routing (electronic design automation); Protocol (science); Computer network; Metric (unit); Fuzzy logic; Stability (learning theory); Path (computing); Metric space; Set (abstract data type); Distributed computing; Mathematical optimization; Wireless Routing Protocol; Theoretical computer science; Artificial intelligence; Mathematics; Machine learning; Discrete mathematics","score_opus":0.06864362942295127,"score_gpt":0.3380428857664586,"score_spread":0.2693992563435073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198009227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021078324,0.00028555567,0.9750259,0.0002737452,0.0000835203,0.00007160718,0.00011304952,0.00015529554,0.0029129607],"genre_scores_gemma":[0.7860527,0.00041207127,0.20975772,0.00011488003,0.0000833868,0.00020007804,0.00021632522,0.000021480218,0.0031413585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862397,0.000380146,0.000110114815,0.00019246644,0.0005837091,0.00010961985],"domain_scores_gemma":[0.9984831,0.00066321256,0.00016079657,0.00019578266,0.0004123195,0.000084755986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013692571,0.00036532228,0.00075546425,0.0009054392,0.0012672324,0.0014220373,0.001343767,0.0008794344,0.001090527],"category_scores_gemma":[0.0030738367,0.00019813904,0.0005113444,0.001108708,0.00081800646,0.0020488962,0.0016298083,0.0009053296,0.00020173992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004663495,0.00010680431,0.0008614937,0.00020612865,0.00009733115,0.00022767759,0.0003469883,0.46731457,0.014491049,0.37580022,0.0038578843,0.1362234],"study_design_scores_gemma":[0.00001932651,0.00007719046,0.0001425951,0.000012541603,0.000017360127,0.00009476144,0.00004298247,0.94079363,0.0019001724,0.05469766,0.0021747667,0.000027043528],"about_ca_topic_score_codex":0.0021019233,"about_ca_topic_score_gemma":0.0024026725,"teacher_disagreement_score":0.0021019233,"about_ca_system_score_codex":0.0011417537,"about_ca_system_score_gemma":0.0011499352,"threshold_uncertainty_score":0.008284092},"labels":[],"label_agreement":null},{"id":"W3200998278","doi":"10.32920/ryerson.14654271.v1","title":"Abstract ACO-EEAODR: An Ant-Swarm Inspired Energy-Efficient Ad Hoc On-Demand Routing Protocol for Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Strong","keywords":"Wireless Routing Protocol; Computer science; Ant colony optimization algorithms; Optimized Link State Routing Protocol; Computer network; Routing protocol; Mobile ad hoc network; Ad hoc wireless distribution service; Wireless ad hoc network; Distributed computing; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Routing (electronic design automation); Wireless; Telecommunications; Artificial intelligence","score_opus":0.02834946657381693,"score_gpt":0.30029523870789315,"score_spread":0.2719457721340762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200998278","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041793123,0.003393748,0.92116445,0.0011604542,0.00092087046,0.0004477981,0.00033356808,0.001552182,0.02923381],"genre_scores_gemma":[0.61778927,0.0025684973,0.35641095,0.00070206093,0.00019676956,0.00039559908,0.000838575,0.00022954177,0.020868747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966204,0.00009264681,0.000019851463,0.000057261946,0.00014114415,0.00002704873],"domain_scores_gemma":[0.9996544,0.00010595563,0.000052760224,0.000052148534,0.000106121275,0.000028531906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003311899,0.000459469,0.00043883087,0.0005499211,0.00035826446,0.0008491975,0.0008822133,0.00058921357,0.0013518932],"category_scores_gemma":[0.0010149475,0.00013818199,0.0004211176,0.00083107,0.00031142888,0.0005043167,0.00048005668,0.00073613453,0.0003995327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027770374,0.00029960842,0.0020535728,0.00075155875,0.00025313513,0.00050306227,0.00014025514,0.50627303,0.04827831,0.049560204,0.021124437,0.37048522],"study_design_scores_gemma":[0.000057908215,0.00014876777,0.00049996044,0.000027724185,0.00003697251,0.0003408301,0.000032581916,0.9524626,0.0083022425,0.0075166235,0.030548442,0.00002526664],"about_ca_topic_score_codex":0.0017739041,"about_ca_topic_score_gemma":0.0022944415,"teacher_disagreement_score":0.0017739041,"about_ca_system_score_codex":0.00031288058,"about_ca_system_score_gemma":0.00061884255,"threshold_uncertainty_score":0.004522562},"labels":[],"label_agreement":null},{"id":"W3201022335","doi":"10.32920/ryerson.14656281.v1","title":"QoS support using SWAN model in mobile ad-hoc networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mobile ad hoc network; Quality of service; Computer network; Computer science; Mobile QoS; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Distributed computing; Routing protocol; Routing (electronic design automation); Optimized Link State Routing Protocol; Service (business); Service provider; Telecommunications; Wireless","score_opus":0.02971126519652401,"score_gpt":0.27593814005080025,"score_spread":0.24622687485427625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201022335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059897367,0.0071308413,0.79162204,0.0040494027,0.0006814543,0.00013934373,0.00020315366,0.00027630848,0.136],"genre_scores_gemma":[0.8941586,0.008508118,0.06954347,0.0005902988,0.0006204553,0.00023270668,0.00017191391,0.00007372021,0.026100744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953675,0.0001768914,0.00002178803,0.000057733658,0.00016070581,0.00004610564],"domain_scores_gemma":[0.9994862,0.00026837934,0.000062135834,0.000046697944,0.000105568775,0.000030955485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053136784,0.00053105084,0.00029704347,0.0006500596,0.0005816402,0.0011793537,0.0007308226,0.0008718694,0.0017846444],"category_scores_gemma":[0.0014448039,0.00015553265,0.0004017201,0.0009335574,0.0008017321,0.0024004937,0.0007292211,0.0010161811,0.00048369737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024597968,0.000043776705,0.00040741672,0.00012969335,0.000010749346,0.00029523714,0.00021971193,0.09526383,0.0021410754,0.8774932,0.0022793051,0.02169148],"study_design_scores_gemma":[0.000008216843,0.00006453033,0.00015009777,0.000045005156,0.000012323995,0.0002874448,0.00013550986,0.67404824,0.0005213458,0.3074269,0.017284626,0.000015740263],"about_ca_topic_score_codex":0.0016815996,"about_ca_topic_score_gemma":0.001196713,"teacher_disagreement_score":0.0017846444,"about_ca_system_score_codex":0.000848318,"about_ca_system_score_gemma":0.00060965435,"threshold_uncertainty_score":0.006155014},"labels":[],"label_agreement":null},{"id":"W320810298","doi":"10.1016/j.tcs.2015.04.035","title":"Connectivity and stretch factor trade-offs in wireless sensor networks with directional antennae","year":2015,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Beamwidth; Omnidirectional antenna; Antenna (radio); Orientation (vector space); Computer science; Directional antenna; Algorithm; Mathematics; Telecommunications; Geometry","score_opus":0.013291151686099257,"score_gpt":0.2316010301662544,"score_spread":0.21830987848015515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320810298","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73041564,0.008573601,0.24160185,0.0023251341,0.000110318164,0.00007054574,0.0002707205,0.00025928454,0.016372913],"genre_scores_gemma":[0.9921085,0.0010935132,0.005424671,0.000041509436,0.00006701031,0.000025315281,0.000035460096,0.000042741034,0.0011613284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992261,0.00034756862,0.000032308002,0.00010590619,0.00015882778,0.00012939109],"domain_scores_gemma":[0.9810534,0.01610532,0.0013420966,0.0005337392,0.0005322636,0.0004331267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018965959,0.0006276832,0.0007629225,0.0012089123,0.00080048584,0.0012322535,0.0011303993,0.0012506727,0.0025934821],"category_scores_gemma":[0.018042514,0.0007028506,0.0003036014,0.0015774822,0.0018560418,0.004271758,0.0016009042,0.0007836101,0.00021013299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074209983,0.00015868882,0.0063923365,0.0003082333,0.000067230125,0.00038262756,0.0005316026,0.8275286,0.014208147,0.08944449,0.0015729788,0.05866293],"study_design_scores_gemma":[0.000050677936,0.00035771143,0.0037151133,0.000047107198,0.00005046938,0.0005056716,0.00041138817,0.89481455,0.0023170188,0.096542776,0.0011449046,0.000042635318],"about_ca_topic_score_codex":0.0009761722,"about_ca_topic_score_gemma":0.0015293063,"teacher_disagreement_score":0.0025934821,"about_ca_system_score_codex":0.0011795666,"about_ca_system_score_gemma":0.0002825115,"threshold_uncertainty_score":0.01003027},"labels":[],"label_agreement":null},{"id":"W3209179561","doi":"10.1109/mahss.2004.1392179","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":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Zone Routing Protocol; Algorithm; Routing protocol; Network packet; Distributed computing","score_opus":0.015509473291051712,"score_gpt":0.2568385471824251,"score_spread":0.2413290738913734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209179561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008653815,0.00056927843,0.9885429,0.0001153266,0.0000372371,0.000064878215,0.000023497778,0.0004696957,0.0015234281],"genre_scores_gemma":[0.17726287,0.0010578544,0.81777185,0.000097075565,0.00007228533,0.00020421561,0.0001841208,0.00007889163,0.003270806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993843,0.0002065102,0.000029249542,0.00006509842,0.00027544686,0.000039380964],"domain_scores_gemma":[0.9990808,0.0004785091,0.0001127222,0.00013259455,0.0001725802,0.000022912045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012816363,0.00061902305,0.00048516854,0.0008910508,0.00062398956,0.000855057,0.0013991798,0.00077598274,0.0010526648],"category_scores_gemma":[0.0035814492,0.00030032702,0.00026532565,0.00094280817,0.00056731864,0.0018253138,0.0007260799,0.0006938973,0.000431926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014635456,0.00009938476,0.00083440443,0.00013366515,0.000052068,0.000059950256,0.00016020432,0.592072,0.0055933716,0.07568958,0.0030416723,0.3221173],"study_design_scores_gemma":[0.00003108524,0.00009494121,0.00016710554,0.00001248234,0.000014345206,0.00006547868,0.000039041795,0.9712108,0.002386937,0.022666952,0.0032949906,0.000015940235],"about_ca_topic_score_codex":0.0013167051,"about_ca_topic_score_gemma":0.0018487542,"teacher_disagreement_score":0.0013991798,"about_ca_system_score_codex":0.0007742768,"about_ca_system_score_gemma":0.0008123577,"threshold_uncertainty_score":0.006778002},"labels":[],"label_agreement":null},{"id":"W3211997589","doi":"10.32920/ryerson.14652795.v1","title":"Interference-Aware Multicast in Wireless Mesh Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Ontario Stroke Network","funders":"","keywords":"Multicast; Computer network; Protocol Independent Multicast; Source-specific multicast; Xcast; Computer science; Pragmatic General Multicast; Distance Vector Multicast Routing Protocol; Secure multicast; Node (physics); Wireless mesh network; IP multicast; Interference (communication); Distributed computing; Transmitter; Multicast address; Wireless network; Wireless; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.023492356531990943,"score_gpt":0.259505480581779,"score_spread":0.23601312404978808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211997589","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049398046,0.0019158788,0.94359463,0.00032850017,0.00015338793,0.00007801499,0.00007591589,0.0004589404,0.0039966884],"genre_scores_gemma":[0.80040944,0.001801316,0.19484502,0.00013535644,0.00020603363,0.00011352526,0.00018395961,0.000058997317,0.002246357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994867,0.00017492154,0.00002959671,0.00006319621,0.00019185062,0.000053749034],"domain_scores_gemma":[0.9996326,0.00015239057,0.000051787792,0.00006041012,0.00008665275,0.00001608116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052001345,0.00026234036,0.0004126311,0.00065897685,0.0006022689,0.00043930302,0.0005505806,0.00046788942,0.0005746835],"category_scores_gemma":[0.001385067,0.00015637549,0.00031159996,0.00067848916,0.00023133014,0.0008268055,0.0006494141,0.00038421826,0.00013622326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027230568,0.00012827787,0.0044816285,0.00048910704,0.00017598754,0.0005610625,0.0003668637,0.48803386,0.049266625,0.049410228,0.0064417846,0.40037236],"study_design_scores_gemma":[0.000014884974,0.00012074372,0.00072266615,0.000021802032,0.000032762953,0.00023043607,0.00008254897,0.9636736,0.0059125707,0.023620468,0.0055535515,0.000013963178],"about_ca_topic_score_codex":0.0007744716,"about_ca_topic_score_gemma":0.0008015022,"teacher_disagreement_score":0.0007744716,"about_ca_system_score_codex":0.00038901748,"about_ca_system_score_gemma":0.0002534839,"threshold_uncertainty_score":0.002822578},"labels":[],"label_agreement":null},{"id":"W3212714379","doi":"10.32920/ryerson.14654013.v1","title":"Preventing Collaborative Blackhole Attacks on Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Packet drop attack; Computer network; Network packet; Computer science; Node (physics); Routing protocol; Overhead (engineering); Benchmark (surveying); Routing (electronic design automation); DSRFLOW; Throughput; Dynamic Source Routing; End-to-end delay; Protocol (science); Mobile ad hoc network; Wireless ad hoc network; Link-state routing protocol; Engineering; Wireless; Telecommunications; Medicine","score_opus":0.012863479180519388,"score_gpt":0.26813104516447045,"score_spread":0.25526756598395106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212714379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23327762,0.0023973843,0.7481649,0.00064246776,0.00030685664,0.00024820166,0.00004953332,0.0022341888,0.012678938],"genre_scores_gemma":[0.9636266,0.0006558918,0.033581458,0.000061506275,0.00008653903,0.00007220423,0.000043091193,0.00002851192,0.0018441714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.00032029004,0.00004898886,0.00012408616,0.0004299089,0.0001460065],"domain_scores_gemma":[0.99739265,0.0013173926,0.00034425317,0.00049565797,0.00035833387,0.00009169711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097111845,0.00075984106,0.00062628876,0.001007869,0.00054008135,0.0010543524,0.00071371475,0.0008734983,0.00069808005],"category_scores_gemma":[0.0053487937,0.0002719759,0.00031152007,0.00042506246,0.0005789282,0.0021497512,0.0017124385,0.00060547784,0.0002613869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057434017,0.0003658323,0.0029106245,0.00043207462,0.00018899799,0.00058444554,0.00038551987,0.49174,0.07979708,0.04826535,0.006896945,0.36785883],"study_design_scores_gemma":[0.000043306296,0.00037830678,0.00056681444,0.000025578873,0.00004035609,0.00031298687,0.00009973483,0.9647717,0.016185481,0.013093886,0.0044582514,0.000023535838],"about_ca_topic_score_codex":0.00051696907,"about_ca_topic_score_gemma":0.00046381517,"teacher_disagreement_score":0.0010543524,"about_ca_system_score_codex":0.00031535,"about_ca_system_score_gemma":0.0003843952,"threshold_uncertainty_score":0.005135834},"labels":[],"label_agreement":null},{"id":"W3216566392","doi":"10.32920/ryerson.14647707.v1","title":"An analysis of structured and unstructured P2P systems over MANET","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mobile ad hoc network; Computer science; Overlay network; Peer-to-peer; Computer network; Overlay; Wireless ad hoc network; Distributed computing; Network topology; Wireless; World Wide Web; The Internet; Operating system","score_opus":0.00806015742931656,"score_gpt":0.24288953832339635,"score_spread":0.2348293808940798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216566392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80553496,0.0016030372,0.17522338,0.00095924234,0.00007142512,0.00022483754,0.00044833243,0.00032792104,0.015606969],"genre_scores_gemma":[0.9916643,0.0003362543,0.0066773472,0.000026060488,0.000024724899,0.000032674492,0.00010229507,0.000021307895,0.0011150556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.00021600362,0.00003100405,0.00011228286,0.0002568406,0.00010105115],"domain_scores_gemma":[0.99534094,0.003402517,0.00037054595,0.00017771166,0.00055360637,0.00015460573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068357633,0.00042989373,0.0005411392,0.00091184146,0.0006848717,0.0010284088,0.0005921713,0.00068948936,0.0013382897],"category_scores_gemma":[0.0061262175,0.00021366353,0.0003823327,0.0009604114,0.00081201753,0.0014800895,0.00048293834,0.00047180493,0.00012320316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070811424,0.00005153164,0.0026293658,0.00010989893,0.000042282987,0.00039637982,0.0001462812,0.96434605,0.0036593697,0.021456392,0.0007627971,0.006328866],"study_design_scores_gemma":[0.0000037675015,0.00001932576,0.0005085332,0.0000023428672,0.000005240159,0.000042736254,0.000036551017,0.9960188,0.0002548701,0.0029021353,0.0002017947,0.000003867475],"about_ca_topic_score_codex":0.006229856,"about_ca_topic_score_gemma":0.0025567901,"teacher_disagreement_score":0.006229856,"about_ca_system_score_codex":0.0008386093,"about_ca_system_score_gemma":0.00071817456,"threshold_uncertainty_score":0.0123871565},"labels":[],"label_agreement":null},{"id":"W326778424","doi":"10.1007/978-3-540-24838-5_28","title":"Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Minimum spanning tree; Spanning tree; Wireless ad hoc network; Computer science; Enhanced Data Rates for GSM Evolution; Node (physics); RADIUS; Combinatorics; Algorithm; Topology (electrical circuits); Mathematics; Computer network; Physics; Wireless; Telecommunications","score_opus":0.01774785019716523,"score_gpt":0.24540984768245863,"score_spread":0.2276619974852934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W326778424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019929705,0.0006719048,0.9775474,0.00010382047,0.000028958531,0.000047307083,0.000047939735,0.00030194712,0.0013210323],"genre_scores_gemma":[0.16368116,0.0010819639,0.83282423,0.000039262162,0.000059328042,0.00013049376,0.00020665424,0.00029160277,0.0016852068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922264,0.00023222162,0.00006741002,0.00014718481,0.00027959415,0.000050910938],"domain_scores_gemma":[0.9977022,0.0015274787,0.0002307318,0.0002666279,0.00021363048,0.00005943783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010121005,0.000975772,0.0013788575,0.0010900343,0.00061713415,0.000988449,0.0021447008,0.0012276524,0.0014045361],"category_scores_gemma":[0.006731857,0.00095061085,0.0007396872,0.0016311147,0.00081915304,0.0031089922,0.0013462604,0.0010355671,0.0005092002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041808918,0.00015358084,0.0009623624,0.0009531546,0.000102488724,0.00020864255,0.00070734177,0.33563852,0.052114505,0.10409538,0.007424649,0.49722132],"study_design_scores_gemma":[0.00005291851,0.00028250282,0.0005030465,0.0000720094,0.00009399673,0.00063614745,0.00022352036,0.8501793,0.029371016,0.11238166,0.006154506,0.000049444967],"about_ca_topic_score_codex":0.00043505372,"about_ca_topic_score_gemma":0.00055202097,"teacher_disagreement_score":0.0021447008,"about_ca_system_score_codex":0.00045016664,"about_ca_system_score_gemma":0.00039580624,"threshold_uncertainty_score":0.0053525567},"labels":[],"label_agreement":null},{"id":"W34717989","doi":"10.1016/j.scitotenv.2021.151223","title":"Power Awareness on Demand Routing Protocol for MANET","year":2013,"lang":"en","type":"article","venue":"The Science of The Total Environment","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Mobile ad hoc network; Computer science; Ad hoc On-Demand Distance Vector Routing; Optimized Link State Routing Protocol; Routing protocol; Wireless ad hoc network; Ad hoc wireless distribution service; Wireless Routing Protocol; Distributed computing; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.013678374640388739,"score_gpt":0.24354432584148708,"score_spread":0.22986595120109835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34717989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035362422,0.003368194,0.86887217,0.002859465,0.0015177962,0.0015225348,0.0034457985,0.011213199,0.07183843],"genre_scores_gemma":[0.8401949,0.001926508,0.115985066,0.0011641732,0.00027294472,0.0013418318,0.004252963,0.0004522849,0.03440943],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995646,0.00011277753,0.00004176149,0.000082166735,0.00011209493,0.00008663669],"domain_scores_gemma":[0.99929845,0.00025104824,0.00005176436,0.00014719345,0.00020737344,0.000044067583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071968115,0.00065405824,0.000615669,0.0006327804,0.00084530906,0.0013179849,0.0013556217,0.0007217932,0.010012512],"category_scores_gemma":[0.0019591975,0.00027498743,0.00030370883,0.00082789373,0.0003646961,0.0014983496,0.0013734434,0.0010274828,0.0017511735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012136669,0.00030481926,0.0013186139,0.0007426822,0.00016643043,0.00060955103,0.000273614,0.30551895,0.014231059,0.11285656,0.16419663,0.39856744],"study_design_scores_gemma":[0.00007522418,0.00014497837,0.000282551,0.000048094556,0.00002842468,0.00018805284,0.00008910214,0.92010295,0.002499228,0.034303382,0.042189848,0.000048258626],"about_ca_topic_score_codex":0.00426685,"about_ca_topic_score_gemma":0.008164411,"teacher_disagreement_score":0.010012512,"about_ca_system_score_codex":0.0010604969,"about_ca_system_score_gemma":0.0011315704,"threshold_uncertainty_score":0.033495188},"labels":[],"label_agreement":null},{"id":"W359656693","doi":"10.1007/s11277-015-2327-0","title":"DNACK: False Data Detection Based on Negative Acknowledgment and Digital Signature on Mobile Ad-hoc Network","year":2015,"lang":"en","type":"article","venue":"Wireless Personal Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Malaysia Japan International Institute of Technology, Universiti Teknologi Malaysia","keywords":"Computer science; Network packet; Intrusion detection system; Digital signature; Mobile ad hoc network; Computer network; Throughput; Packet drop attack; Flooding (psychology); Wireless ad hoc network; Signature (topology); False positive rate; Computer security; Routing protocol; Wireless; Artificial intelligence; Telecommunications","score_opus":0.05080773827731543,"score_gpt":0.28864757518108863,"score_spread":0.2378398369037732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W359656693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0591844,0.001061904,0.9285951,0.00058912166,0.0010501692,0.0004020933,0.0002462723,0.0068201898,0.0020507013],"genre_scores_gemma":[0.7262984,0.00039127623,0.2655157,0.00038813226,0.0002398093,0.0002600525,0.00050438487,0.00014561534,0.0062566716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953323,0.0010973256,0.00026802503,0.00063297997,0.0020552615,0.00061404053],"domain_scores_gemma":[0.9925988,0.0025077777,0.00084894453,0.0014542294,0.0021144066,0.00047590144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030233113,0.0011723734,0.001772244,0.0024183413,0.0011583826,0.0017768525,0.0022125198,0.0016157058,0.0017205472],"category_scores_gemma":[0.009329402,0.0004642062,0.00047366487,0.0011796547,0.0011393017,0.0032939734,0.0033363982,0.0017001752,0.0009587375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066106017,0.0009251867,0.012119593,0.0006535882,0.00038123282,0.0014746984,0.00034914928,0.0521168,0.11581351,0.02829372,0.018666655,0.76259524],"study_design_scores_gemma":[0.00016933346,0.00085623347,0.0021747672,0.000043834614,0.00011671429,0.0014359439,0.00011264861,0.8605991,0.11781464,0.010527645,0.006000614,0.00014849579],"about_ca_topic_score_codex":0.0008342353,"about_ca_topic_score_gemma":0.00087352376,"teacher_disagreement_score":0.0030233113,"about_ca_system_score_codex":0.0011655749,"about_ca_system_score_gemma":0.0019019219,"threshold_uncertainty_score":0.015989006},"labels":[],"label_agreement":null},{"id":"W37384390","doi":"10.2196/48923","title":"Authentication, pre-Handoff and Handoff in Pure MANET","year":2006,"lang":"en","type":"dissertation","venue":"JMIR Research Protocols","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Cancer Institute","keywords":"Handover; Computer network; Authentication (law); Computer science; Mobile ad hoc network; Computer security","score_opus":0.07033934143804046,"score_gpt":0.4729213425965302,"score_spread":0.40258200115848974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W37384390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071078405,0.0048308503,0.87390447,0.0008855369,0.0010376846,0.0005497896,0.00032695977,0.0025604975,0.04482588],"genre_scores_gemma":[0.7985572,0.0029011546,0.11660713,0.00023406341,0.00057250273,0.00024206268,0.00046566117,0.0001926683,0.080227606],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877554,0.0003087184,0.00010136295,0.00019531214,0.00040587503,0.00021323591],"domain_scores_gemma":[0.9984016,0.0005763118,0.00007250824,0.00055038906,0.00031612936,0.00008308744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014830232,0.0005726631,0.0006636376,0.0008036795,0.0010208888,0.0012842745,0.00092878385,0.0009154214,0.0054394403],"category_scores_gemma":[0.0029115013,0.0005153067,0.0003722214,0.0005951937,0.0006284602,0.002758261,0.0014818488,0.0010424813,0.0031912434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024358905,0.0004758209,0.0038798556,0.0006807249,0.00021523007,0.0014884585,0.0005178946,0.08672738,0.06286501,0.19686426,0.020261522,0.623588],"study_design_scores_gemma":[0.00011335186,0.00048856984,0.0023642736,0.00009857746,0.00016488227,0.001929973,0.00021394833,0.8280183,0.02338041,0.1161753,0.026958251,0.000094108946],"about_ca_topic_score_codex":0.0013443398,"about_ca_topic_score_gemma":0.0021472548,"teacher_disagreement_score":0.0054394403,"about_ca_system_score_codex":0.0004370454,"about_ca_system_score_gemma":0.0010286175,"threshold_uncertainty_score":0.018196702},"labels":[],"label_agreement":null},{"id":"W40960331","doi":"","title":"Proceedings of the fifth international workshop on Foundations of mobile computing","year":2008,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless sensor network; Mobile computing; Wireless ad hoc network; Context (archaeology); Wireless network; Wireless; Telecommunications; Computer network","score_opus":0.021899513335503298,"score_gpt":0.2615391810829159,"score_spread":0.2396396677474126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W40960331","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078722965,0.112462044,0.45068902,0.06461174,0.092442915,0.0005499476,0.0015740996,0.0028469916,0.266951],"genre_scores_gemma":[0.120856225,0.08657387,0.22302067,0.0115363225,0.044530656,0.0012351155,0.0051721456,0.0018493104,0.50522566],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974878,0.0008040252,0.00020343972,0.00046283638,0.00077508105,0.00026686717],"domain_scores_gemma":[0.99612314,0.0014515911,0.0001089396,0.0007344828,0.0010338593,0.0005480236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047586877,0.0013261631,0.0013077012,0.0015249366,0.0013704657,0.005869942,0.0019947677,0.0023905695,0.046070855],"category_scores_gemma":[0.0082192775,0.0007190778,0.0013643145,0.0012843723,0.0016892819,0.0053287544,0.0029544344,0.0056148535,0.014112419],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002026645,0.0001273236,0.0006557962,0.0005229845,0.000083386345,0.00030097258,0.000646738,0.002017516,0.0019309154,0.18083315,0.5203431,0.2923355],"study_design_scores_gemma":[0.000020433648,0.000064509935,0.00033541367,0.00029806545,0.000026507996,0.00027811172,0.00009945795,0.003279483,0.00055739324,0.041460358,0.95355624,0.000024026882],"about_ca_topic_score_codex":0.0016094453,"about_ca_topic_score_gemma":0.0018859439,"teacher_disagreement_score":0.046070855,"about_ca_system_score_codex":0.0017777018,"about_ca_system_score_gemma":0.0018530346,"threshold_uncertainty_score":0.15412235},"labels":[],"label_agreement":null},{"id":"W41495264","doi":"","title":"Associativity-based adaptive weighted clustering for large-scale mobile ad hoc networks","year":2007,"lang":"en","type":"article","venue":"IASTED International Conference on Parallel and Distributed Computing and Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Cluster analysis; Computer science; Wireless ad hoc network; Mobile ad hoc network; Computer network; Node (physics); Distributed computing; Stability (learning theory); Overhead (engineering); Wireless; Engineering; Artificial intelligence; Network packet","score_opus":0.02834229652280277,"score_gpt":0.28257721825221843,"score_spread":0.25423492172941564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W41495264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009263721,0.00021507803,0.989771,0.0000601055,0.00002511127,0.000020060874,0.0000067096125,0.00011911995,0.0005190526],"genre_scores_gemma":[0.62120616,0.0006808318,0.37443012,0.000081012804,0.0001236184,0.00021851639,0.000088334804,0.00010178878,0.003069702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.0002427337,0.00004976135,0.00013221377,0.0004248007,0.00006746066],"domain_scores_gemma":[0.9978643,0.0009732007,0.00024619277,0.00020407431,0.0006325145,0.00007967161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016381635,0.0005820242,0.0006202296,0.0008092375,0.0008057468,0.0008858298,0.0017170773,0.00075785856,0.00085220806],"category_scores_gemma":[0.0051703695,0.00030754803,0.0005083963,0.0012255261,0.0009289941,0.002328777,0.00089817896,0.00076463656,0.0003307945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065539076,0.00004675998,0.0011352288,0.00008482138,0.00007535577,0.000085971136,0.00015501658,0.8939381,0.0043542013,0.046914667,0.0007162031,0.05242806],"study_design_scores_gemma":[0.0000036605566,0.000019089106,0.000117253985,0.0000025789766,0.000009502225,0.000029215622,0.000013742183,0.9893506,0.00055103865,0.009354243,0.0005420839,0.0000069731445],"about_ca_topic_score_codex":0.0024512047,"about_ca_topic_score_gemma":0.0020033894,"teacher_disagreement_score":0.0024512047,"about_ca_system_score_codex":0.0010007637,"about_ca_system_score_gemma":0.00074101955,"threshold_uncertainty_score":0.008663535},"labels":[],"label_agreement":null},{"id":"W4200593408","doi":"10.18280/isi.260606","title":"Pragmatic Security-Aware Cross-Layer Design for Wireless Networks from Vampire Attacks","year":2021,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Mobile ad hoc network; Vehicular ad hoc network; Wireless network; Ad hoc wireless distribution service; Network packet; Optimized Link State Routing Protocol; Wireless; Routing protocol; Telecommunications","score_opus":0.018692212362793576,"score_gpt":0.26056887912678367,"score_spread":0.24187666676399008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200593408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009002489,0.0004913629,0.9853903,0.00026682526,0.00009522534,0.00009799219,0.000010193974,0.0005644501,0.004081081],"genre_scores_gemma":[0.5191822,0.00089372357,0.47165284,0.00048585836,0.000117224205,0.00037064927,0.00007507302,0.00024130962,0.006981031],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998486,0.0005879541,0.00013198025,0.0001418807,0.00050744734,0.00014482951],"domain_scores_gemma":[0.9986908,0.00030744064,0.00016071687,0.0003654588,0.0003988272,0.00007678316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017865687,0.0005942599,0.0003168916,0.0005034884,0.0006594484,0.001424039,0.0012356791,0.00071505085,0.0021384484],"category_scores_gemma":[0.0031843763,0.0004521266,0.00042238005,0.00020664935,0.0007843344,0.0020214636,0.0015551605,0.0016788146,0.0006347005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005098704,0.00024052932,0.0016485399,0.00049536367,0.0002095066,0.0006808777,0.001162546,0.14716282,0.13471776,0.3392192,0.010259396,0.3636935],"study_design_scores_gemma":[0.00011120608,0.0005215627,0.0006432859,0.00013931644,0.00016859926,0.00086535927,0.00023311096,0.7997144,0.055375338,0.08001367,0.06214213,0.0000720834],"about_ca_topic_score_codex":0.00040047552,"about_ca_topic_score_gemma":0.0007800537,"teacher_disagreement_score":0.0021384484,"about_ca_system_score_codex":0.0006472894,"about_ca_system_score_gemma":0.000754808,"threshold_uncertainty_score":0.009448409},"labels":[],"label_agreement":null},{"id":"W4229519035","doi":"10.4018/9781605662503.ch001","title":"Cooperation-Based Routing Protocol for Mobile Ad-Hoc Network","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer network; Computer science; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Ad hoc wireless distribution service; Wireless ad hoc network; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.02791825958172992,"score_gpt":0.27246503934072286,"score_spread":0.24454677975899294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229519035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020088064,0.1013087,0.6561439,0.003062442,0.006068277,0.0012580155,0.0014614426,0.005749997,0.22293843],"genre_scores_gemma":[0.046767592,0.10644578,0.57467467,0.0040811957,0.0023100723,0.0037570803,0.0069046495,0.001414395,0.25364453],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917966,0.00019949723,0.00005970494,0.00009229309,0.00042062832,0.000048221595],"domain_scores_gemma":[0.99966097,0.00011357994,0.00002621475,0.00005685806,0.00011991765,0.000022457398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061787514,0.0012837071,0.00092132913,0.001168182,0.0008189923,0.0015213485,0.0018860865,0.0018895926,0.011980973],"category_scores_gemma":[0.0010230488,0.00044951358,0.00058529055,0.0028445877,0.0008541145,0.0018671731,0.0012800656,0.0028123963,0.015569747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006724501,0.000091427835,0.00016681445,0.0022090697,0.0000724345,0.00072914566,0.0005315617,0.009324612,0.008006686,0.20978794,0.28724238,0.48177072],"study_design_scores_gemma":[0.000023854522,0.000058466354,0.00014390494,0.00031593232,0.000026428685,0.00096272863,0.00006069887,0.00832827,0.0010773764,0.037603572,0.95135707,0.000041677406],"about_ca_topic_score_codex":0.001052897,"about_ca_topic_score_gemma":0.001486715,"teacher_disagreement_score":0.011980973,"about_ca_system_score_codex":0.0010749251,"about_ca_system_score_gemma":0.0010961369,"threshold_uncertainty_score":0.04008037},"labels":[],"label_agreement":null},{"id":"W4230105903","doi":"10.32920/ryerson.14647707","title":"An analysis of structured and unstructured P2P systems over MANET","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Mobile ad hoc network; Overlay network; Peer-to-peer; Computer network; Overlay; Wireless ad hoc network; Distributed computing; Network topology; Wireless; World Wide Web; The Internet; Operating system","score_opus":0.00806015742931656,"score_gpt":0.24288953832339635,"score_spread":0.2348293808940798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230105903","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80553496,0.0016030372,0.17522338,0.00095924234,0.00007142512,0.00022483754,0.00044833243,0.00032792104,0.015606969],"genre_scores_gemma":[0.9916643,0.0003362543,0.0066773472,0.000026060488,0.000024724899,0.000032674492,0.00010229507,0.000021307895,0.0011150556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.00021600362,0.00003100405,0.00011228286,0.0002568406,0.00010105115],"domain_scores_gemma":[0.99534094,0.003402517,0.00037054595,0.00017771166,0.00055360637,0.00015460573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068357633,0.00042989373,0.0005411392,0.00091184146,0.0006848717,0.0010284088,0.0005921713,0.00068948936,0.0013382897],"category_scores_gemma":[0.0061262175,0.00021366353,0.0003823327,0.0009604114,0.00081201753,0.0014800895,0.00048293834,0.00047180493,0.00012320316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070811424,0.00005153164,0.0026293658,0.00010989893,0.000042282987,0.00039637982,0.0001462812,0.96434605,0.0036593697,0.021456392,0.0007627971,0.006328866],"study_design_scores_gemma":[0.0000037675015,0.00001932576,0.0005085332,0.0000023428672,0.000005240159,0.000042736254,0.000036551017,0.9960188,0.0002548701,0.0029021353,0.0002017947,0.000003867475],"about_ca_topic_score_codex":0.006229856,"about_ca_topic_score_gemma":0.0025567901,"teacher_disagreement_score":0.006229856,"about_ca_system_score_codex":0.0008386093,"about_ca_system_score_gemma":0.00071817456,"threshold_uncertainty_score":0.0123871565},"labels":[],"label_agreement":null},{"id":"W4231410054","doi":"10.22215/etd/2005-10716","title":"K-hops passive clustering in ad hoc networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Türkiye Atom Enerjisi Kurumu","keywords":"Cluster analysis; Computer science; Information retrieval; Artificial intelligence","score_opus":0.007973264924703655,"score_gpt":0.2429250355215923,"score_spread":0.23495177059688865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231410054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06659427,0.0035789583,0.91354185,0.0005249747,0.00028447906,0.00016219566,0.00012217592,0.0008317261,0.014359383],"genre_scores_gemma":[0.7719169,0.006617264,0.16360138,0.00011380199,0.00031663408,0.00021447062,0.0003928961,0.000222548,0.056604076],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999567,0.0001150152,0.000027610466,0.000095176154,0.00015887362,0.00003632731],"domain_scores_gemma":[0.99902725,0.0004893501,0.00006218221,0.00015780493,0.00022942621,0.000034114237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006733397,0.00032814164,0.00031584434,0.00054882676,0.0004445488,0.0008262958,0.00088098476,0.00055292906,0.0016710724],"category_scores_gemma":[0.002063685,0.00041249127,0.00018779868,0.00084496796,0.0006003501,0.001791924,0.00044535336,0.0003929881,0.001257216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007575408,0.0002999873,0.0024551814,0.0010203824,0.00010745771,0.000186368,0.00076377066,0.2888558,0.04990596,0.12744287,0.012558839,0.51564586],"study_design_scores_gemma":[0.0001082044,0.0004478088,0.0032735392,0.000114517694,0.00008836314,0.0005292892,0.00034300194,0.8510681,0.035047527,0.08216459,0.026748294,0.00006664411],"about_ca_topic_score_codex":0.0010275715,"about_ca_topic_score_gemma":0.001245813,"teacher_disagreement_score":0.0016710724,"about_ca_system_score_codex":0.00041467787,"about_ca_system_score_gemma":0.0005045535,"threshold_uncertainty_score":0.0055903196},"labels":[],"label_agreement":null},{"id":"W4232021810","doi":"10.24124/2011/bpgub731","title":"Generation and analysis of realistic mobility models for mobile ad hoc networks.","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Northern British Columbia","keywords":"Mobility model; TRACE (psycholinguistics); Computer science; Software; Credibility; Mobile ad hoc network; Distributed computing; Range (aeronautics); Telecommunications; Engineering; Wireless","score_opus":0.03783232424800039,"score_gpt":0.28159032007900714,"score_spread":0.24375799583100674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232021810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012407545,0.00036349517,0.9775662,0.0002947639,0.00012328412,0.00028656458,0.0009422204,0.0022351276,0.0057807593],"genre_scores_gemma":[0.15731044,0.0019692392,0.8255343,0.00015546315,0.00006668568,0.00093047466,0.0056683617,0.000802174,0.007562851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960023,0.00012408788,0.00002973622,0.000042457523,0.00018136739,0.000022069695],"domain_scores_gemma":[0.99917185,0.00039459448,0.00007871181,0.0001587162,0.00017597979,0.000020157304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018337,0.0006534969,0.00036960546,0.000742389,0.00038904732,0.00078275823,0.00087602093,0.0006528402,0.002782384],"category_scores_gemma":[0.0046917587,0.0004081579,0.0007133128,0.0004955138,0.00020355619,0.0010597929,0.00078238273,0.00072917313,0.0011465068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056762576,0.00017554694,0.0028757097,0.00047873863,0.00009074821,0.0003186083,0.0004312304,0.70528686,0.01338949,0.083575666,0.020719528,0.17260106],"study_design_scores_gemma":[0.000023183735,0.00006217333,0.00049083406,0.00009050747,0.000025865153,0.00018891551,0.00006629597,0.93348897,0.007559161,0.016987955,0.04099236,0.000023831457],"about_ca_topic_score_codex":0.0013077797,"about_ca_topic_score_gemma":0.0014212535,"teacher_disagreement_score":0.002782384,"about_ca_system_score_codex":0.00048637128,"about_ca_system_score_gemma":0.0008574593,"threshold_uncertainty_score":0.009307981},"labels":[],"label_agreement":null},{"id":"W4232685217","doi":"10.1109/icppw.2004.1327568","title":"Controllable fair QoS-based MAC protocols for ad hoc wireless networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Countdown; Computer science; Quality of service; Network packet; Wireless ad hoc network; Wireless; Differentiated services; Service (business); Telecommunications; Engineering","score_opus":0.015261313587128292,"score_gpt":0.27013889300680266,"score_spread":0.25487757941967437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232685217","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045817364,0.0011681844,0.9888698,0.0002198903,0.000335152,0.00019086736,0.00004574063,0.00071292615,0.003875757],"genre_scores_gemma":[0.56994367,0.0032012567,0.415041,0.0005391614,0.00069434795,0.0014070835,0.00035314495,0.00023105147,0.008589333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978968,0.00057371776,0.00014473383,0.0002059446,0.0010495919,0.00012920036],"domain_scores_gemma":[0.99687177,0.0016675339,0.00026734333,0.0005567914,0.0004942311,0.0001423524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031065827,0.0009486606,0.00047638098,0.0009012252,0.0011333255,0.0017907226,0.0023216167,0.0006369887,0.0021877352],"category_scores_gemma":[0.005875468,0.0003287146,0.00050618267,0.00074315455,0.0016247397,0.0024478724,0.0015241955,0.0015060776,0.00040013247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031143453,0.00012999198,0.00060642004,0.0005447648,0.000103490995,0.00027994232,0.00044500735,0.070253976,0.024707465,0.74228865,0.0057616136,0.15456727],"study_design_scores_gemma":[0.0001913569,0.00030328397,0.000366091,0.00011274349,0.00014873472,0.00026108287,0.00010145593,0.66714853,0.02394122,0.2372172,0.07010547,0.000102850194],"about_ca_topic_score_codex":0.0014092006,"about_ca_topic_score_gemma":0.0014531265,"teacher_disagreement_score":0.0031065827,"about_ca_system_score_codex":0.0013663708,"about_ca_system_score_gemma":0.0012953294,"threshold_uncertainty_score":0.016429365},"labels":[],"label_agreement":null},{"id":"W4232714070","doi":"10.22215/etd/2005-08224","title":"Mobility support in mesh networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.009598219529934659,"score_gpt":0.25861618203880155,"score_spread":0.24901796250886687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232714070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26981208,0.011143135,0.59712243,0.0059291353,0.0016126954,0.0002495543,0.0011340044,0.0023495238,0.110647455],"genre_scores_gemma":[0.94458765,0.0040373607,0.03202248,0.00012789034,0.0004447679,0.00011055274,0.0005464272,0.00008344076,0.01803942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979824,0.000054073033,0.000015586627,0.000029937786,0.000060952283,0.000041219417],"domain_scores_gemma":[0.9994646,0.00022789121,0.00005546266,0.0001073086,0.00010576723,0.000038945895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035192055,0.00022309963,0.0001677031,0.00048720278,0.00041556905,0.00075783505,0.0005492734,0.00037371193,0.0056836484],"category_scores_gemma":[0.0021226287,0.0001326118,0.0001158769,0.0004659655,0.00020161398,0.0013286036,0.0009900248,0.00030967552,0.0012037113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068090745,0.00012558974,0.005445331,0.0005692592,0.000060286726,0.0007047086,0.00074210716,0.07498249,0.0780956,0.171442,0.026714763,0.64043695],"study_design_scores_gemma":[0.00012019996,0.00052969804,0.0042201323,0.00029589402,0.000092244394,0.0010525789,0.00093007565,0.539134,0.025796125,0.13428073,0.29347003,0.000078422425],"about_ca_topic_score_codex":0.0007366998,"about_ca_topic_score_gemma":0.0008761086,"teacher_disagreement_score":0.0056836484,"about_ca_system_score_codex":0.00032071903,"about_ca_system_score_gemma":0.00022882214,"threshold_uncertainty_score":0.019013762},"labels":[],"label_agreement":null},{"id":"W4233400130","doi":"10.1109/wsc.2017.8248118","title":"Network layer connectivity awareness with application to investigate the OLSR protocol in tactical MANETs","year":2017,"lang":"en","type":"article","venue":"2017 Winter Simulation Conference (WSC)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Routing protocol; Network packet; Mobile ad hoc network; Wireless ad hoc network; Metrics; Network layer; Link-state routing protocol; Link layer; Distributed computing; Metric (unit); Wireless Routing Protocol; Physical layer; Layer (electronics); Wireless; Engineering; Telecommunications","score_opus":0.06907115100372632,"score_gpt":0.3495997021531276,"score_spread":0.28052855114940123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233400130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16427985,0.0011023066,0.8199059,0.00051422796,0.00009698495,0.00015388502,0.00016692404,0.0013215254,0.012458401],"genre_scores_gemma":[0.76697516,0.0008630872,0.23019277,0.00007539156,0.00005196536,0.00013756726,0.00013224567,0.00008420063,0.001487651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970067,0.00012244558,0.000013103103,0.00003682915,0.00010464159,0.000022380229],"domain_scores_gemma":[0.99910223,0.00048941746,0.00014458703,0.000105317784,0.00012945602,0.000028953278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056728325,0.000365681,0.00027170402,0.00071985944,0.00030141763,0.00059600174,0.00049354194,0.00048394315,0.00078258256],"category_scores_gemma":[0.00256039,0.00017630734,0.00026748155,0.0007952061,0.00041806934,0.0012466896,0.00060686294,0.0005625823,0.00008792062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059959206,0.00008930071,0.004479851,0.00013875397,0.000043774442,0.0002192978,0.000266068,0.8431424,0.0148198875,0.06793828,0.001160508,0.06764193],"study_design_scores_gemma":[0.000005125216,0.00007692969,0.00059326674,0.000010282727,0.000012732007,0.00008832338,0.00004151304,0.9872639,0.003231205,0.00551342,0.0031515462,0.0000117661675],"about_ca_topic_score_codex":0.001873841,"about_ca_topic_score_gemma":0.001536253,"teacher_disagreement_score":0.001873841,"about_ca_system_score_codex":0.00026648625,"about_ca_system_score_gemma":0.00036970188,"threshold_uncertainty_score":0.0037258863},"labels":[],"label_agreement":null},{"id":"W4233819503","doi":"10.1002/wcm.737","title":"ARMA: a scalable secure routing protocol with privacy protection for mobile<i>ad hoc</i>networks","year":2009,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Routing protocol; Computer security; Wireless Routing Protocol; Mobile ad hoc network; Encryption; Scalability; Correctness; Wireless ad hoc network; Protocol (science); Distributed computing; Routing (electronic design automation); Wireless; Network packet","score_opus":0.01840513777442785,"score_gpt":0.27854253838735715,"score_spread":0.2601374006129293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233819503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051350318,0.001345647,0.928862,0.0012610895,0.00045163158,0.0005121731,0.00019472816,0.0057470426,0.010275364],"genre_scores_gemma":[0.7400467,0.0007122237,0.24928962,0.00040612664,0.0002687357,0.0005184286,0.00041084905,0.00022640283,0.008120969],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893886,0.00039411962,0.000106312946,0.00010837205,0.00037270004,0.000079602694],"domain_scores_gemma":[0.998621,0.0003514676,0.00032050937,0.00039183247,0.00020838865,0.00010682601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585371,0.00043307358,0.00054720696,0.00070974074,0.00089333416,0.0011433298,0.0015240852,0.0007478754,0.0020081],"category_scores_gemma":[0.002188663,0.00021769652,0.0006676132,0.0006982267,0.0010704274,0.0019811105,0.0017885221,0.000965203,0.0007847545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012976145,0.00044769878,0.0020640143,0.0010231194,0.00027747368,0.0025231016,0.0010648128,0.1801608,0.16080295,0.2419412,0.03498918,0.37340808],"study_design_scores_gemma":[0.00024881162,0.00087346137,0.00062596804,0.00008659234,0.00017238295,0.0015014337,0.00016903796,0.8274939,0.033868406,0.06150224,0.073308885,0.00014884607],"about_ca_topic_score_codex":0.0004646491,"about_ca_topic_score_gemma":0.00042025722,"teacher_disagreement_score":0.0020081,"about_ca_system_score_codex":0.0004195563,"about_ca_system_score_gemma":0.0009638021,"threshold_uncertainty_score":0.008384287},"labels":[],"label_agreement":null},{"id":"W4233907759","doi":"10.22215/etd/2007-07795","title":"Channel assignment in multi-channel wireless ad hoc networks","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Channel (broadcasting); Computer science; Computer network; Telecommunications","score_opus":0.021952129844273565,"score_gpt":0.28281060402528285,"score_spread":0.26085847418100927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233907759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031142728,0.009063515,0.9449391,0.0011235343,0.0011199601,0.0001175686,0.00008614292,0.0005085872,0.011898872],"genre_scores_gemma":[0.8492697,0.009400638,0.111868456,0.0003547486,0.0013462009,0.00027468769,0.00019626554,0.00010494162,0.027184408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913883,0.0003928272,0.00002828124,0.00012030508,0.00018437306,0.00013538057],"domain_scores_gemma":[0.9981244,0.0013796957,0.000102740574,0.0001026122,0.00018499407,0.00010556378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008554257,0.00034038376,0.00047190973,0.0005679904,0.00061643345,0.0011143056,0.0007622231,0.00055681367,0.0025273918],"category_scores_gemma":[0.0031544964,0.00027993246,0.00015345291,0.0010668173,0.0006749707,0.0014936841,0.0007278312,0.00087824033,0.00051506335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025994124,0.00017418698,0.00187351,0.00041418575,0.00006204565,0.00030621563,0.00021534199,0.5901092,0.0033731721,0.08108239,0.012675981,0.30945382],"study_design_scores_gemma":[0.000026263315,0.000086187625,0.00047723233,0.000039826555,0.00001828261,0.00018508613,0.00011257024,0.9520952,0.0007922168,0.03605279,0.0100944275,0.000019826972],"about_ca_topic_score_codex":0.00294133,"about_ca_topic_score_gemma":0.0029023904,"teacher_disagreement_score":0.00294133,"about_ca_system_score_codex":0.00062934164,"about_ca_system_score_gemma":0.0007289749,"threshold_uncertainty_score":0.008454919},"labels":[],"label_agreement":null},{"id":"W4234165964","doi":"10.22215/etd/2010-08723","title":"Channel assignment using topology control based on power control in wireless mesh networks","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"Medical Research and Materiel Command; Chinese Academy of Agricultural Sciences","keywords":"Channel (broadcasting); Topology (electrical circuits); Computer science; Computer network; Wireless mesh network; Control channel; Control (management); Wireless; Telecommunications; Wireless network; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.008205211305445865,"score_gpt":0.24587816148654665,"score_spread":0.2376729501811008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234165964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06763232,0.0008059818,0.92465615,0.0002797798,0.00020937041,0.000058099882,0.00003743323,0.00048693683,0.005833932],"genre_scores_gemma":[0.95300657,0.00041838692,0.043512024,0.00003558755,0.00009594318,0.000051524315,0.000042551877,0.00003824714,0.0027990097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973804,0.00009578126,0.000013129348,0.000049433533,0.000067327186,0.000036335816],"domain_scores_gemma":[0.9994306,0.00035106856,0.00005574776,0.00005677339,0.000079878286,0.000025911671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003836844,0.00021234363,0.00024715203,0.00045567128,0.00020992351,0.00046396817,0.00061765435,0.00019372988,0.0011813359],"category_scores_gemma":[0.0016798491,0.00010883587,0.00013705452,0.00037054942,0.00034861141,0.000665932,0.00041876055,0.00030756652,0.00014263437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027210172,0.00013334486,0.0010733507,0.00010511803,0.000038097194,0.000072709736,0.00010467267,0.6088287,0.02238042,0.022779861,0.002414613,0.34179702],"study_design_scores_gemma":[0.000011872827,0.000068007466,0.00020332984,0.000003692961,0.000007823943,0.000021695381,0.000011576664,0.99225473,0.001976895,0.0044865245,0.0009488194,0.000004900971],"about_ca_topic_score_codex":0.0010374236,"about_ca_topic_score_gemma":0.0011144431,"teacher_disagreement_score":0.0011813359,"about_ca_system_score_codex":0.00032264285,"about_ca_system_score_gemma":0.0002731841,"threshold_uncertainty_score":0.0039519668},"labels":[],"label_agreement":null},{"id":"W4234219117","doi":"10.22215/etd/2016-11691","title":"Software-defined Mobile Ad Hoc Networks with Trust Management","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless ad hoc network; Vehicular ad hoc network; Routing protocol; Distributed computing; Wireless Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Distance-vector routing protocol; Ad hoc wireless distribution service; Destination-Sequenced Distance Vector routing; Adaptive quality of service multi-hop routing; Dynamic Source Routing; Routing (electronic design automation); Computer security; Wireless; Telecommunications","score_opus":0.004941233754849534,"score_gpt":0.21509234409518824,"score_spread":0.2101511103403387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234219117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009830377,0.02061298,0.89918864,0.0028296567,0.0013509017,0.00036365146,0.000110743604,0.0007640609,0.064949036],"genre_scores_gemma":[0.52550894,0.047234643,0.3644985,0.001085322,0.002056795,0.0010216564,0.00063940574,0.00020488721,0.057749942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892116,0.0002763902,0.00008652281,0.00014717491,0.0004914653,0.00007726796],"domain_scores_gemma":[0.9989342,0.00037720703,0.00012290849,0.00020545347,0.00028958006,0.0000705905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009842265,0.00066705217,0.00042306588,0.0004196063,0.0007042912,0.0016842441,0.0008125063,0.00081857806,0.0021574076],"category_scores_gemma":[0.002771283,0.00031150907,0.0004285821,0.0009819373,0.0009507037,0.002185436,0.0015338799,0.0016080299,0.0013553759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006270055,0.00013293927,0.00075889344,0.0008034332,0.00006899278,0.00052058545,0.0009655239,0.028917223,0.00892336,0.4749857,0.015219854,0.4686408],"study_design_scores_gemma":[0.00007213258,0.0003298366,0.0006320797,0.00040313473,0.00009127765,0.0011407547,0.00031584766,0.12521413,0.00849564,0.2659666,0.59726554,0.00007296079],"about_ca_topic_score_codex":0.0006910725,"about_ca_topic_score_gemma":0.0005661206,"teacher_disagreement_score":0.0021574076,"about_ca_system_score_codex":0.0007592928,"about_ca_system_score_gemma":0.0010387542,"threshold_uncertainty_score":0.007217288},"labels":[],"label_agreement":null},{"id":"W4235679874","doi":"10.1007/978-1-4614-6170-8_100026","title":"Transportable Networks","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Geology","score_opus":0.010750443131343488,"score_gpt":0.19415288368756226,"score_spread":0.18340244055621877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235679874","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001066869,0.03197176,0.07456567,0.0022559592,0.0054538194,0.00011983091,0.00055517,0.0011506636,0.88286024],"genre_scores_gemma":[0.0078608785,0.029799089,0.011989302,0.0005521636,0.0011166229,0.00013843032,0.0006633449,0.00037401952,0.94750625],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99973065,0.000035000918,0.000010552166,0.000045387438,0.00014855112,0.000029879515],"domain_scores_gemma":[0.9998242,0.00004564354,0.000009371741,0.000048001275,0.000054546228,0.00001815604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002364183,0.0013989514,0.0006271982,0.0011607226,0.0008417483,0.0022758858,0.001119768,0.0009594955,0.07444261],"category_scores_gemma":[0.0007603934,0.00042746577,0.00033458215,0.0020333582,0.0007011009,0.0037501885,0.0016279365,0.0018554722,0.03847584],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019481542,0.000040202223,0.000052190575,0.00036445272,0.000011208753,0.000088679655,0.000168648,0.0024965333,0.0015496266,0.21403699,0.37151125,0.40966076],"study_design_scores_gemma":[0.0000020553075,0.000009062753,0.000044352895,0.00012005768,0.00000373054,0.000072142444,0.000030341822,0.0010493221,0.0002779158,0.031610023,0.966775,0.0000059832687],"about_ca_topic_score_codex":0.0017121956,"about_ca_topic_score_gemma":0.002786344,"teacher_disagreement_score":0.07444261,"about_ca_system_score_codex":0.0012628223,"about_ca_system_score_gemma":0.0010209715,"threshold_uncertainty_score":0.24903536},"labels":[],"label_agreement":null},{"id":"W4235685096","doi":"10.24124/2007/bpgub438","title":"Development of a trace generation and analysis software for random mobility models.","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia","funders":"","keywords":"TRACE (psycholinguistics); Computer science; Humanities; Art; Philosophy; Linguistics","score_opus":0.027222389045569218,"score_gpt":0.2872318197895037,"score_spread":0.26000943074393446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235685096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026618948,0.000049326274,0.86139774,0.00007092505,0.00007335455,0.00027156295,0.0016017532,0.13229407,0.0015794414],"genre_scores_gemma":[0.078731924,0.00031006229,0.87703335,0.00015602127,0.000063243446,0.0012955574,0.011307594,0.020441454,0.010660828],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988825,0.00020421766,0.00014908133,0.00019485899,0.00049194944,0.00007750349],"domain_scores_gemma":[0.9957417,0.0018971863,0.0002763215,0.0009765896,0.00094348175,0.0001647728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025839857,0.0013188664,0.00077167037,0.0019880107,0.0005788082,0.0013167502,0.0026415172,0.00090985536,0.01818779],"category_scores_gemma":[0.011343732,0.0010312677,0.000928395,0.0009942856,0.00028813025,0.0020416025,0.0014799294,0.0016493158,0.007497338],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006598538,0.00079093815,0.008625912,0.0010166047,0.0004424567,0.0010114169,0.0009464738,0.10652607,0.041378353,0.020770295,0.10842149,0.7094102],"study_design_scores_gemma":[0.00021874192,0.00021749118,0.0012263146,0.00012397308,0.00010701202,0.00050852716,0.00009332525,0.87982565,0.033740982,0.010017388,0.07382714,0.00009341341],"about_ca_topic_score_codex":0.004000618,"about_ca_topic_score_gemma":0.0032288146,"teacher_disagreement_score":0.01818779,"about_ca_system_score_codex":0.0005591611,"about_ca_system_score_gemma":0.001712772,"threshold_uncertainty_score":0.060844243},"labels":[],"label_agreement":null},{"id":"W4235919830","doi":"10.22215/etd/2005-06441","title":"PIES: protocol independent energy saving technique for mobile ad hoc networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol (science); Medicine","score_opus":0.008978940567726313,"score_gpt":0.27725836749260974,"score_spread":0.26827942692488344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235919830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04132782,0.0024062025,0.881565,0.00067992596,0.001474647,0.0005043975,0.0007258082,0.016713317,0.054602962],"genre_scores_gemma":[0.46537745,0.0034180472,0.36849308,0.00082174863,0.00044743443,0.00056060136,0.0020529134,0.0015545983,0.15727411],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998006,0.000024804898,0.00001099759,0.000030197301,0.00010027702,0.000033203763],"domain_scores_gemma":[0.9998055,0.000038704613,0.000013879207,0.00006706661,0.000049011094,0.000025870442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003088703,0.00064427266,0.00033959709,0.0007664604,0.00056860433,0.00078870094,0.0012277067,0.00030495413,0.008727404],"category_scores_gemma":[0.0007602594,0.00022570947,0.00033648364,0.0006070082,0.0002871455,0.0015072727,0.0012196638,0.0010399836,0.002145149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007043634,0.00029008862,0.0011717534,0.00057144125,0.00012492404,0.0006749933,0.0003860395,0.0140602505,0.13837251,0.041551914,0.033653807,0.7684379],"study_design_scores_gemma":[0.0003459702,0.001473201,0.0039786827,0.00018350995,0.00024986727,0.0031691294,0.00055822387,0.20077689,0.34390426,0.03525461,0.40995046,0.00015513503],"about_ca_topic_score_codex":0.00028930232,"about_ca_topic_score_gemma":0.0008323174,"teacher_disagreement_score":0.008727404,"about_ca_system_score_codex":0.0002249779,"about_ca_system_score_gemma":0.0005722923,"threshold_uncertainty_score":0.029196084},"labels":[],"label_agreement":null},{"id":"W4235977129","doi":"10.1145/941322.941323","title":"Alert aggregation in mobile ad hoc networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Intrusion detection system; Computer network; Mobile ad hoc network; Routing protocol; Wireless ad hoc network; Default gateway; Interoperability; Routing (electronic design automation); Vehicular ad hoc network; Distributed computing; Data mining; Network packet; Wireless","score_opus":0.009508983044100163,"score_gpt":0.22653477712147943,"score_spread":0.21702579407737926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235977129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07680511,0.0025137865,0.9145569,0.0003522413,0.00019725828,0.00016566485,0.000060205606,0.0031193732,0.002229429],"genre_scores_gemma":[0.858014,0.00096589176,0.13837826,0.00017052857,0.00019041696,0.000110201625,0.00012486194,0.00005038388,0.0019953179],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984029,0.0005114901,0.00014890208,0.00023226491,0.0005875055,0.000117044234],"domain_scores_gemma":[0.996942,0.0015900614,0.00035579054,0.00043754722,0.000584595,0.00008999269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017962919,0.0007341432,0.00089074305,0.0014519113,0.00071332545,0.00134907,0.0008366187,0.00077735196,0.000539858],"category_scores_gemma":[0.005194225,0.00036426625,0.00032768364,0.0010642036,0.00049860764,0.0021665052,0.0011546941,0.00062027125,0.00029530548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008521828,0.00018394196,0.008482712,0.00039368882,0.00022432997,0.00088896666,0.0009050272,0.2517291,0.052621398,0.033628166,0.005486114,0.64460444],"study_design_scores_gemma":[0.000056252426,0.0003576541,0.0017990908,0.000028289973,0.00012182931,0.000578303,0.0001648407,0.9417923,0.022923427,0.021520196,0.010614256,0.000043711774],"about_ca_topic_score_codex":0.0011387737,"about_ca_topic_score_gemma":0.000728404,"teacher_disagreement_score":0.0017962919,"about_ca_system_score_codex":0.00055607775,"about_ca_system_score_gemma":0.00036182144,"threshold_uncertainty_score":0.009499788},"labels":[],"label_agreement":null},{"id":"W4236238515","doi":"10.1002/wcm.384","title":"Voronoi diagram and convex hull based geocasting and routing in wireless networks","year":2006,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Consejo Nacional de Ciencia y Tecnología","keywords":"Voronoi diagram; Rectangle; Convex hull; Computer science; Geographic routing; Greedy algorithm; Routing (electronic design automation); Destination-Sequenced Distance Vector routing; Algorithm; Mathematical optimization; Static routing; Regular polygon; Dynamic Source Routing; Mathematics; Routing protocol; Computer network; Geometry","score_opus":0.011137985039685076,"score_gpt":0.23634916341573114,"score_spread":0.22521117837604607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236238515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012758833,0.0003804611,0.9854799,0.00007535116,0.00003497661,0.000042620777,0.000045840123,0.00014045495,0.0010416257],"genre_scores_gemma":[0.5087879,0.00081287074,0.48702604,0.000055895234,0.000074036936,0.00013297233,0.00027546572,0.000054732114,0.0027801504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933136,0.000247033,0.000028985782,0.000097780285,0.00024493973,0.00004994171],"domain_scores_gemma":[0.99884206,0.0006248718,0.00015111318,0.00012842003,0.00018812348,0.000065389555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077481894,0.00038170343,0.00072891754,0.0010168542,0.00037903897,0.0010141815,0.0010018932,0.00049937936,0.0008098697],"category_scores_gemma":[0.0027490805,0.00023099249,0.00038267643,0.0010840411,0.0008363445,0.001336621,0.0009223036,0.00048443835,0.0002156745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015315297,0.000037132613,0.00091010396,0.00015577619,0.000038804465,0.000098710574,0.00017083542,0.7189962,0.0069000856,0.12678894,0.0014572953,0.14429298],"study_design_scores_gemma":[0.000018523027,0.000031276828,0.00021912335,0.000008689852,0.0000071348777,0.000062008265,0.00003043937,0.97195274,0.002177193,0.022410419,0.003070706,0.000011817848],"about_ca_topic_score_codex":0.003918109,"about_ca_topic_score_gemma":0.0027137566,"teacher_disagreement_score":0.003918109,"about_ca_system_score_codex":0.0009133962,"about_ca_system_score_gemma":0.00079921493,"threshold_uncertainty_score":0.007790625},"labels":[],"label_agreement":null},{"id":"W4236347696","doi":"10.1002/net.20372","title":"Exact and performance‐guaranteed multicast algorithms for lifetime optimization in WANETs","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Multicast; Computer science; Mathematical optimization; Heuristic; Upper and lower bounds; Approximation algorithm; Connection (principal bundle); Graph; Wireless network; Optimization problem; Constant (computer programming); Algorithm; Wireless; Mathematics; Theoretical computer science; Distributed computing; Telecommunications","score_opus":0.011406620044224783,"score_gpt":0.23997228167146117,"score_spread":0.2285656616272364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236347696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03979498,0.00060558465,0.95486844,0.00042614175,0.000042191296,0.000046304056,0.00006730393,0.00036570936,0.0037834137],"genre_scores_gemma":[0.73087025,0.0005642771,0.26547346,0.0001400222,0.0000818748,0.00017204965,0.00016109909,0.0001339726,0.0024029496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991493,0.0004317055,0.000028877925,0.0000901959,0.0001630367,0.00013682654],"domain_scores_gemma":[0.9979196,0.0014477768,0.00020234298,0.00017848788,0.00018284663,0.00006894768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026300424,0.0009287423,0.0010620544,0.00067654013,0.0006557826,0.0010361508,0.0012887549,0.0010266849,0.0020783648],"category_scores_gemma":[0.0062634293,0.00039300683,0.00040537454,0.0008796708,0.00090296956,0.002032445,0.0013710029,0.0011037503,0.00031642785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010376698,0.00003687023,0.00020488181,0.000040480205,0.000015134283,0.000018917188,0.00004979934,0.9482711,0.0006836728,0.025015011,0.001140035,0.024420286],"study_design_scores_gemma":[0.0000106905145,0.000013560695,0.000025469966,0.0000038580843,0.0000024340711,0.000007165686,0.000009485571,0.98848164,0.00019904543,0.0110106105,0.00023425296,0.0000018363015],"about_ca_topic_score_codex":0.0015773509,"about_ca_topic_score_gemma":0.0012927633,"teacher_disagreement_score":0.0026300424,"about_ca_system_score_codex":0.0014184058,"about_ca_system_score_gemma":0.0010695547,"threshold_uncertainty_score":0.013909161},"labels":[],"label_agreement":null},{"id":"W4236520211","doi":"10.1109/icppw.2004.1327566","title":"PIES: Protocol independent energy saving algorithm","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Protocol (science); Energy (signal processing); Node (physics); Energy conservation; Set (abstract data type); Algorithm; Routing (electronic design automation); Engineering; Mathematics","score_opus":0.009634219092828081,"score_gpt":0.2477796187259893,"score_spread":0.23814539963316123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236520211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909262,0.00084045436,0.94188315,0.00086750096,0.00051141036,0.00039110414,0.000538661,0.0056165326,0.036441915],"genre_scores_gemma":[0.39768162,0.0010107002,0.5471434,0.0010452067,0.00020089874,0.00088046753,0.002754504,0.0007936271,0.048489634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995352,0.00008261076,0.00002705776,0.000084969826,0.00017320392,0.00009690727],"domain_scores_gemma":[0.99950314,0.00013663995,0.000037291036,0.0001337151,0.00014380534,0.000045396588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007283388,0.0007188873,0.0005392092,0.00093045435,0.0007376405,0.001356993,0.0021931494,0.00089853676,0.013088796],"category_scores_gemma":[0.002418293,0.00027505454,0.00048712202,0.0009492008,0.0005699198,0.0018661327,0.0019600554,0.0013454804,0.0033428813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061295845,0.00019638114,0.0013811651,0.00031926428,0.0000697478,0.00020845179,0.00011524246,0.2294882,0.00957629,0.098854974,0.07033089,0.5888464],"study_design_scores_gemma":[0.0001891731,0.0002289396,0.0004120147,0.000058304016,0.000037228372,0.00043593068,0.0000742396,0.8570799,0.01215144,0.04904286,0.0802486,0.000041328523],"about_ca_topic_score_codex":0.0007405405,"about_ca_topic_score_gemma":0.0010472204,"teacher_disagreement_score":0.013088796,"about_ca_system_score_codex":0.00063280057,"about_ca_system_score_gemma":0.0016546493,"threshold_uncertainty_score":0.043786347},"labels":[],"label_agreement":null},{"id":"W4236565228","doi":"10.22215/etd/2012-06875","title":"QoS aware adptive security scheme for video streaming in MANETs","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer science; Scheme (mathematics); Computer network; Mathematics","score_opus":0.01237028507681194,"score_gpt":0.2724411106686119,"score_spread":0.26007082559179995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236565228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19451833,0.0028354407,0.76857793,0.0023208985,0.0010719819,0.00073681085,0.0005555564,0.0018717845,0.027511181],"genre_scores_gemma":[0.9119084,0.0007013644,0.076033495,0.00038892927,0.0002913079,0.00018066134,0.0004314798,0.000045758476,0.010018586],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903345,0.00024744353,0.00009579512,0.00015211922,0.00029488743,0.00017633321],"domain_scores_gemma":[0.9976107,0.00072086253,0.00019776664,0.0006647632,0.0005866549,0.00021930556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013327892,0.00059942843,0.00056877994,0.0008333685,0.0013408841,0.0014790869,0.0011107615,0.00086212746,0.0035477187],"category_scores_gemma":[0.0028725923,0.00021562434,0.00031857638,0.00043722062,0.00084291614,0.0023646138,0.0020468468,0.0016914434,0.00073877943],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037626508,0.0007592986,0.0023058814,0.0006277577,0.00015878513,0.0011979566,0.0009861436,0.04000325,0.2587163,0.29574853,0.01617782,0.3795556],"study_design_scores_gemma":[0.0004487102,0.001889153,0.002795199,0.0002258447,0.00018430887,0.0026234223,0.00063436193,0.71774304,0.098876946,0.12939344,0.04496258,0.00022297056],"about_ca_topic_score_codex":0.0005821169,"about_ca_topic_score_gemma":0.00075022783,"teacher_disagreement_score":0.0035477187,"about_ca_system_score_codex":0.0011709895,"about_ca_system_score_gemma":0.0010792378,"threshold_uncertainty_score":0.011868358},"labels":[],"label_agreement":null},{"id":"W4236589167","doi":"10.1007/978-3-319-58721-9_3","title":"System Model","year":2017,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Node (physics); Topology (electrical circuits); Channel (broadcasting); Distributed computing; Network topology; Mathematics","score_opus":0.018894128338349046,"score_gpt":0.22211530551795125,"score_spread":0.2032211771796022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236589167","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014805024,0.0024326965,0.7045213,0.004017186,0.0011114343,0.0009128492,0.011644545,0.0033094313,0.2572455],"genre_scores_gemma":[0.5305461,0.007001732,0.07166601,0.0021680945,0.001137307,0.0024512482,0.012161242,0.0006266073,0.37224174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937695,0.0001536004,0.000022164455,0.00017100101,0.00018766391,0.00008868574],"domain_scores_gemma":[0.9994993,0.00018505448,0.000047262325,0.00008645771,0.00015814001,0.00002375921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046714742,0.001241189,0.0010799746,0.0009480565,0.00066094205,0.0021095022,0.0021313427,0.0017878184,0.046076637],"category_scores_gemma":[0.0016645645,0.00031616006,0.0006946089,0.0012001228,0.00060792523,0.0021882525,0.001525965,0.0013203513,0.0196292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016379637,0.00015581334,0.0010245732,0.00069639826,0.00009810435,0.00086619944,0.0001946935,0.44631293,0.0038415107,0.4091941,0.07352744,0.06392441],"study_design_scores_gemma":[0.0001009915,0.00013933638,0.00043148655,0.00007105761,0.000066917026,0.00051815185,0.00010658571,0.75319266,0.0011894341,0.15682809,0.08730246,0.000052841508],"about_ca_topic_score_codex":0.0033509235,"about_ca_topic_score_gemma":0.0022027148,"teacher_disagreement_score":0.046076637,"about_ca_system_score_codex":0.0009317585,"about_ca_system_score_gemma":0.0009996074,"threshold_uncertainty_score":0.15414166},"labels":[],"label_agreement":null},{"id":"W4236992307","doi":"10.22215/etd/2016-11455","title":"Design and Analysis of An Intelligent Wireless Ad Hoc Routing Protocol and Controller for UAV Networks","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Optimized Link State Routing Protocol; Network packet; Throughput; Ad hoc On-Demand Distance Vector Routing; Wireless ad hoc network; Routing protocol; End-to-end delay; Mobile ad hoc network; Ad hoc wireless distribution service; Network simulation; Vehicular ad hoc network; Wireless Routing Protocol; Controller (irrigation); Packet loss; Distributed computing; Wireless","score_opus":0.01779045311522551,"score_gpt":0.29300939359190037,"score_spread":0.27521894047667483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236992307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01796701,0.00060820655,0.96983105,0.00016308816,0.00010754067,0.00025615122,0.000030568637,0.0003670436,0.010669371],"genre_scores_gemma":[0.6564624,0.0011465026,0.33239326,0.00012192202,0.000082416824,0.0005183141,0.00013951924,0.0000939877,0.009041666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995554,0.00006572394,0.000018770126,0.000060535265,0.00025284878,0.0000466318],"domain_scores_gemma":[0.9996517,0.0001035071,0.00003458586,0.00003254403,0.00016297438,0.000014637343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055106345,0.000460119,0.00039352322,0.00039065172,0.00046594735,0.0010431474,0.0009884151,0.00043649433,0.0016113673],"category_scores_gemma":[0.0010200706,0.00027438454,0.0004021075,0.0001932548,0.00030376125,0.000647901,0.0003075885,0.000557673,0.00033934656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008780362,0.00013403043,0.0015077848,0.0002873528,0.00007868069,0.00028600494,0.00013060289,0.7228567,0.05713589,0.07851565,0.0030127512,0.13596676],"study_design_scores_gemma":[0.000009382069,0.00010226766,0.00014593347,0.000011376192,0.00002338414,0.00005213243,0.000016036636,0.98553884,0.0069827,0.0023219318,0.0047889464,0.000007036408],"about_ca_topic_score_codex":0.0024354684,"about_ca_topic_score_gemma":0.0024272767,"teacher_disagreement_score":0.0024354684,"about_ca_system_score_codex":0.0009644649,"about_ca_system_score_gemma":0.0011518335,"threshold_uncertainty_score":0.0069977045},"labels":[],"label_agreement":null},{"id":"W4238428328","doi":"10.5220/0006887401990207","title":"Virtual Network Function Embedding in Multi-hop Wireless Networks","year":2018,"lang":"en","type":"article","venue":"Proceedings of the 15th International Joint Conference on e-Business and Telecommunications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Hop (telecommunications); Wireless network; Embedding; Wireless; Function (biology); Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.03782564509283265,"score_gpt":0.2738773545437266,"score_spread":0.23605170945089393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238428328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06691095,0.00029877486,0.9298233,0.00018197086,0.00006890105,0.000018192339,0.000025594605,0.00021440342,0.0024578604],"genre_scores_gemma":[0.88362426,0.0003621798,0.112183034,0.00004925539,0.000040249874,0.000044122276,0.000066335575,0.00006936988,0.0035613568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994325,0.0002874893,0.000024020115,0.00006707165,0.00012294973,0.00006593432],"domain_scores_gemma":[0.99863523,0.0007287034,0.00010174897,0.00026742197,0.00019765545,0.00006920985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080810825,0.0004857347,0.00047125365,0.00062564894,0.00036301135,0.0011939729,0.0008143166,0.00055119843,0.0011096802],"category_scores_gemma":[0.0030443452,0.00023325124,0.0002484472,0.0005012302,0.00074568315,0.0021096938,0.0013737816,0.00079476525,0.00021477978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035257108,0.00013438039,0.0009178693,0.00014351752,0.00004601199,0.00022116497,0.00025288103,0.5475322,0.016571704,0.26369405,0.0019860428,0.16814758],"study_design_scores_gemma":[0.0000048981638,0.00003934612,0.000102049264,0.000009398821,0.000008370062,0.000064074135,0.00002882181,0.96409845,0.002682927,0.031541567,0.0014141889,0.0000058817654],"about_ca_topic_score_codex":0.0005545343,"about_ca_topic_score_gemma":0.000638857,"teacher_disagreement_score":0.0011939729,"about_ca_system_score_codex":0.00051330635,"about_ca_system_score_gemma":0.00035575865,"threshold_uncertainty_score":0.0042737126},"labels":[],"label_agreement":null},{"id":"W4238558706","doi":"10.32920/ryerson.14645349","title":"A Performance Study of TCP on Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario College of Art and Design","funders":"Türkiye Atom Enerjisi Kurumu","keywords":"Computer network; Computer science; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Link-state routing protocol; DSRFLOW; Optimized Link State Routing Protocol; Routing protocol; Distance-vector routing protocol; Distributed computing; Network packet","score_opus":0.020157995250752604,"score_gpt":0.24812992027088646,"score_spread":0.22797192502013386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238558706","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76097137,0.013451253,0.19783418,0.00087904744,0.00060144585,0.00034732814,0.00037474325,0.0010887241,0.024451878],"genre_scores_gemma":[0.9807489,0.0036222478,0.013734442,0.00004736746,0.00019550031,0.000095207666,0.00019683999,0.00008470303,0.001274864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587727,0.0018130459,0.00022672316,0.0003364923,0.0014731105,0.00027325976],"domain_scores_gemma":[0.9891639,0.00782706,0.0006027122,0.00062174915,0.0016094168,0.00017521152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027468554,0.0010723849,0.0008117101,0.0017779649,0.0007908575,0.0016248262,0.0010315822,0.001049697,0.0007402968],"category_scores_gemma":[0.014834867,0.00032418573,0.00046060458,0.0025224532,0.00088944286,0.0026236635,0.00050789624,0.00085056573,0.00015944937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038349984,0.0002167235,0.014165692,0.0006852577,0.00027992687,0.0010645324,0.00073008426,0.8501184,0.01758071,0.028650096,0.0029561762,0.08316891],"study_design_scores_gemma":[0.000008514656,0.00028248396,0.0027368502,0.000049624283,0.000034410863,0.00031526768,0.00009782739,0.98860383,0.0035185062,0.0019175743,0.0024113127,0.000023758412],"about_ca_topic_score_codex":0.0026362198,"about_ca_topic_score_gemma":0.00071053056,"teacher_disagreement_score":0.0027468554,"about_ca_system_score_codex":0.0010792572,"about_ca_system_score_gemma":0.0004617601,"threshold_uncertainty_score":0.014526904},"labels":[],"label_agreement":null},{"id":"W4238694306","doi":"10.1145/3243046","title":"Proceedings of the 15th ACM International Symposium on Performance Evaluation of Wireless Ad Hoc, Sensor, &amp; Ubiquitous Networks","year":2018,"lang":"en","type":"paratext","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless ad hoc network; Computer science; Wireless sensor network; Variety (cybernetics); Pleasure; Telecommunications; Wireless; World Wide Web; Computer network; Artificial intelligence","score_opus":0.026623629329003102,"score_gpt":0.279162113854863,"score_spread":0.2525384845258599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238694306","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05042088,0.1591484,0.3666801,0.026875678,0.09344408,0.0033068385,0.0084711,0.0068916753,0.28476134],"genre_scores_gemma":[0.27236706,0.119988576,0.1886517,0.0041431016,0.02764767,0.0030543138,0.026042162,0.0028145548,0.3552908],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99129885,0.0027899363,0.0006708015,0.00066853274,0.0040965737,0.0004753367],"domain_scores_gemma":[0.9824399,0.0047610775,0.00060163223,0.0018246941,0.008160172,0.0022126047],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00986454,0.0021952875,0.002423723,0.0020886739,0.000992745,0.0048436695,0.0019085365,0.0015638325,0.03007038],"category_scores_gemma":[0.014826577,0.0005757526,0.00085912814,0.0018055753,0.0010565062,0.0038915551,0.0021789426,0.003084585,0.010942901],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000606009,0.0006259387,0.007369757,0.0008419497,0.00029835137,0.00028606268,0.00032847945,0.0051079593,0.0044957697,0.012360266,0.50453895,0.46314052],"study_design_scores_gemma":[0.000121427554,0.0009519545,0.010996226,0.0010882075,0.00023374501,0.0007598551,0.0005585995,0.045131005,0.00445471,0.013034795,0.9225363,0.00013310795],"about_ca_topic_score_codex":0.00565656,"about_ca_topic_score_gemma":0.006208384,"teacher_disagreement_score":0.96992964,"about_ca_system_score_codex":0.0017518338,"about_ca_system_score_gemma":0.0036599059,"threshold_uncertainty_score":0.100595474},"labels":[],"label_agreement":null},{"id":"W4240117274","doi":"10.32920/ryerson.14644083","title":"Multi-Channel Wireless Mesh Networks With TCP Proxies","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Wireless network; Network packet; Scalability; Shared mesh; Wireless; Distributed computing; Telecommunications","score_opus":0.019195319018339266,"score_gpt":0.23617828093895757,"score_spread":0.2169829619206183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240117274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48923907,0.0011421333,0.49743292,0.00032743893,0.0002442142,0.0002582207,0.00014395907,0.0033275064,0.007884512],"genre_scores_gemma":[0.9512375,0.00016746782,0.047510594,0.00004083822,0.000018688685,0.00007944771,0.000073864445,0.000026281477,0.00084524637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914265,0.0004018904,0.00006305275,0.00010322891,0.00016968825,0.00011949847],"domain_scores_gemma":[0.9979748,0.000888744,0.00025889836,0.00050006824,0.00028915852,0.000088325134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313976,0.00034994,0.00043815753,0.00051766087,0.00040449883,0.0007689151,0.001028759,0.00046447702,0.0010274304],"category_scores_gemma":[0.0033836355,0.0002118171,0.00032513627,0.0005259033,0.00033163695,0.0014343938,0.00085904106,0.00043932,0.00020006344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017933241,0.0005987941,0.019754207,0.0005663437,0.00023181901,0.00092285353,0.00037537707,0.6081313,0.09722249,0.0219595,0.0032127749,0.24523114],"study_design_scores_gemma":[0.000048404123,0.00061378314,0.0017890066,0.000036819107,0.00007728976,0.00021208267,0.00008322562,0.9551754,0.032639947,0.0040945285,0.005183591,0.000045935263],"about_ca_topic_score_codex":0.0005227341,"about_ca_topic_score_gemma":0.000560308,"teacher_disagreement_score":0.001313976,"about_ca_system_score_codex":0.00048220326,"about_ca_system_score_gemma":0.00036209784,"threshold_uncertainty_score":0.0069490075},"labels":[],"label_agreement":null},{"id":"W4240130476","doi":"10.1007/978-1-4939-7131-2_101373","title":"Transportable Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.013487383156810447,"score_gpt":0.20507793089617515,"score_spread":0.1915905477393647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240130476","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010380883,0.031193584,0.059153624,0.0026318834,0.006754332,0.00011160879,0.00057210244,0.0011149129,0.89742994],"genre_scores_gemma":[0.007882255,0.029803816,0.009888062,0.0006042483,0.0015224506,0.00014128406,0.00070623745,0.0003838659,0.94906765],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99972194,0.000035387162,0.000010409107,0.000048285005,0.00015304315,0.000030925192],"domain_scores_gemma":[0.9998035,0.000051363815,0.000010549895,0.00005439445,0.000057217094,0.0000229944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519762,0.0013990699,0.0006113202,0.001087205,0.0008553976,0.0025199421,0.0011248677,0.0010035058,0.08273343],"category_scores_gemma":[0.0008476893,0.0004164937,0.00033080965,0.0019590345,0.0007259553,0.0040145083,0.0017240158,0.0019651551,0.044942778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020170106,0.000040280836,0.00005179215,0.0003893186,0.000010280683,0.000084243846,0.00016921603,0.0021803253,0.001408193,0.22404265,0.4109659,0.36063772],"study_design_scores_gemma":[0.000001934451,0.000008167584,0.00004125331,0.00011085589,0.000003112317,0.000062668594,0.000028776667,0.00082730944,0.00020833466,0.031157186,0.9675454,0.0000049978885],"about_ca_topic_score_codex":0.0014343357,"about_ca_topic_score_gemma":0.0022420702,"teacher_disagreement_score":0.08273343,"about_ca_system_score_codex":0.001283369,"about_ca_system_score_gemma":0.0010306514,"threshold_uncertainty_score":0.2767709},"labels":[],"label_agreement":null},{"id":"W4240183566","doi":"10.32920/ryerson.14655516","title":"An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Multipath routing; Link-state routing protocol; Routing protocol; Distributed computing; Optimized Link State Routing Protocol; Static routing; Routing (electronic design automation)","score_opus":0.017456802750293987,"score_gpt":0.26357081511237657,"score_spread":0.24611401236208258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240183566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051055826,0.0022703295,0.93884015,0.0006319575,0.00043546446,0.0003083897,0.00015780533,0.0010103333,0.0052897963],"genre_scores_gemma":[0.7808456,0.0014805921,0.21168292,0.00011016727,0.00012439377,0.0002195213,0.00022104097,0.00004568552,0.005270081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958855,0.000102569145,0.000031682303,0.00005851592,0.00018043126,0.00003828875],"domain_scores_gemma":[0.9995584,0.00008985996,0.00008987042,0.00011138241,0.00011780606,0.000032675613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049595203,0.00038952532,0.00041795018,0.0004797331,0.00062270125,0.0006490524,0.00077733974,0.0005868241,0.00091911096],"category_scores_gemma":[0.0019467153,0.00013758297,0.00034947408,0.0006923407,0.0003898041,0.0011472928,0.0009471948,0.00057641504,0.00030962506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065380626,0.00013371855,0.0015106554,0.000574228,0.00017117828,0.00074356457,0.00044219257,0.21404245,0.0936105,0.12720922,0.009559525,0.55134887],"study_design_scores_gemma":[0.00009458437,0.0012255914,0.0012731634,0.00007947442,0.00018212794,0.0016192772,0.00017763244,0.8629148,0.026718605,0.045416396,0.060166854,0.00013139844],"about_ca_topic_score_codex":0.0006894693,"about_ca_topic_score_gemma":0.0009297299,"teacher_disagreement_score":0.00091911096,"about_ca_system_score_codex":0.0006191877,"about_ca_system_score_gemma":0.00065228104,"threshold_uncertainty_score":0.0044925213},"labels":[],"label_agreement":null},{"id":"W4240540945","doi":"10.4018/978-1-60960-563-6.ch004","title":"Performance Enhancement of Routing Protocols in Mobile Ad hoc Networks","year":2011,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Computer science; Backbone network; Connected dominating set; Wireless ad hoc network; Computer network; Distributed computing; Flooding (psychology); Mobile ad hoc network; Scalability; Bundle; Minimum spanning tree; Network packet; Wireless; Algorithm","score_opus":0.02090588101714081,"score_gpt":0.25168570014919034,"score_spread":0.23077981913204954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240540945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07214434,0.16013145,0.52792716,0.0046198196,0.003722314,0.00031686126,0.00033092583,0.00620141,0.22460571],"genre_scores_gemma":[0.66056615,0.07494773,0.21033491,0.0007985851,0.0025016156,0.00033226353,0.0008019034,0.0008200902,0.04889678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987004,0.00040688776,0.00005290346,0.000121891484,0.00063010695,0.00008784506],"domain_scores_gemma":[0.99883944,0.00055520394,0.000078689074,0.00018463467,0.00029796435,0.000044092525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00125006,0.0008468085,0.00055168354,0.0008601684,0.00042112704,0.0019918885,0.0011697799,0.0008581955,0.0025946146],"category_scores_gemma":[0.003328682,0.00023425708,0.00025143166,0.001734147,0.00037264,0.0025555028,0.0008216289,0.00092554453,0.0017262561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020622008,0.00014313943,0.00079694594,0.0011946713,0.00005678288,0.0002982251,0.00031073645,0.045883253,0.029228773,0.07008285,0.020060986,0.83173746],"study_design_scores_gemma":[0.00008115146,0.0014990974,0.0029999784,0.00065503427,0.00027741346,0.002716642,0.0004169214,0.40087298,0.039603453,0.0887811,0.46197549,0.00012078324],"about_ca_topic_score_codex":0.00027874013,"about_ca_topic_score_gemma":0.0002176741,"teacher_disagreement_score":0.0025946146,"about_ca_system_score_codex":0.0006477689,"about_ca_system_score_gemma":0.0004510584,"threshold_uncertainty_score":0.008679867},"labels":[],"label_agreement":null},{"id":"W4240588248","doi":"10.1007/978-1-4939-7131-2_100689","title":"Moveable Networks","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science","score_opus":0.01441836110048619,"score_gpt":0.2108493283277661,"score_spread":0.1964309672272799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240588248","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011963978,0.03177685,0.062406804,0.0020620679,0.0051878043,0.00008221028,0.0004098337,0.00090783223,0.8959702],"genre_scores_gemma":[0.012466088,0.027912362,0.012190872,0.00063404173,0.0013533094,0.00012049313,0.0005133089,0.00027911382,0.9445304],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99980944,0.000024207895,0.000005497844,0.000040228628,0.00009931172,0.000021403239],"domain_scores_gemma":[0.9998642,0.000037768692,0.000008962163,0.000033896762,0.000037193997,0.000017924318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015652932,0.0011480155,0.00049811765,0.00084370724,0.00064830494,0.0017711635,0.0010058518,0.00087228947,0.07451302],"category_scores_gemma":[0.0006074547,0.00031596,0.0002430036,0.0013738353,0.0006076342,0.0028263328,0.0013687811,0.001443305,0.03805081],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022646884,0.00003065085,0.00005784166,0.00038330647,0.000010704897,0.00009562259,0.00014533031,0.0034098586,0.0018995969,0.25419694,0.32489473,0.4148528],"study_design_scores_gemma":[0.0000023198704,0.0000106696625,0.000054410633,0.00009665524,0.0000037532166,0.00008838392,0.000030281191,0.001097321,0.0002601789,0.036759257,0.9615914,0.0000053519666],"about_ca_topic_score_codex":0.0009743993,"about_ca_topic_score_gemma":0.001830257,"teacher_disagreement_score":0.07451302,"about_ca_system_score_codex":0.00080733857,"about_ca_system_score_gemma":0.00059650105,"threshold_uncertainty_score":0.24927086},"labels":[],"label_agreement":null},{"id":"W4240973236","doi":"10.32920/ryerson.14654013","title":"Preventing Collaborative Blackhole Attacks on Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Packet drop attack; Computer network; Network packet; Computer science; Node (physics); Overhead (engineering); Benchmark (surveying); Routing protocol; Routing (electronic design automation); DSRFLOW; Throughput; End-to-end delay; Dynamic Source Routing; Wireless ad hoc network; Protocol (science); Link-state routing protocol; Engineering; Wireless; Telecommunications; Medicine","score_opus":0.012863479180519388,"score_gpt":0.26813104516447045,"score_spread":0.25526756598395106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240973236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23327762,0.0023973843,0.7481649,0.00064246776,0.00030685664,0.00024820166,0.00004953332,0.0022341888,0.012678938],"genre_scores_gemma":[0.9636266,0.0006558918,0.033581458,0.000061506275,0.00008653903,0.00007220423,0.000043091193,0.00002851192,0.0018441714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893075,0.00032029004,0.00004898886,0.00012408616,0.0004299089,0.0001460065],"domain_scores_gemma":[0.99739265,0.0013173926,0.00034425317,0.00049565797,0.00035833387,0.00009169711],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097111845,0.00075984106,0.00062628876,0.001007869,0.00054008135,0.0010543524,0.00071371475,0.0008734983,0.00069808005],"category_scores_gemma":[0.0053487937,0.0002719759,0.00031152007,0.00042506246,0.0005789282,0.0021497512,0.0017124385,0.00060547784,0.0002613869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057434017,0.0003658323,0.0029106245,0.00043207462,0.00018899799,0.00058444554,0.00038551987,0.49174,0.07979708,0.04826535,0.006896945,0.36785883],"study_design_scores_gemma":[0.000043306296,0.00037830678,0.00056681444,0.000025578873,0.00004035609,0.00031298687,0.00009973483,0.9647717,0.016185481,0.013093886,0.0044582514,0.000023535838],"about_ca_topic_score_codex":0.00051696907,"about_ca_topic_score_gemma":0.00046381517,"teacher_disagreement_score":0.0010543524,"about_ca_system_score_codex":0.00031535,"about_ca_system_score_gemma":0.0003843952,"threshold_uncertainty_score":0.005135834},"labels":[],"label_agreement":null},{"id":"W4241402985","doi":"10.1109/glocom.2014.7417422","title":"A Comprehensive Reputation System to Improve the Security of Opportunistic Routing Protocols in Wireless Networks","year":2014,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reputation; Computer science; Reliability (semiconductor); Computer network; Routing protocol; Network packet; Computer security; Trust management (information system); Routing (electronic design automation); Reputation system; Wireless; Wireless network; Telecommunications","score_opus":0.044478337033916966,"score_gpt":0.3235311183297579,"score_spread":0.27905278129584093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241402985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04611377,0.0017355442,0.94270015,0.00052018923,0.00034916328,0.00016971884,0.000066861205,0.0011950389,0.0071494826],"genre_scores_gemma":[0.9024019,0.00062515086,0.09265383,0.00011293509,0.00019662992,0.00007415256,0.00009201456,0.00004463827,0.0037987768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987789,0.0003688547,0.00011199048,0.00021640732,0.00040747275,0.000116388386],"domain_scores_gemma":[0.9974722,0.0007138629,0.00036322145,0.00043274398,0.0008224006,0.0001954707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020180196,0.00045316844,0.00076348434,0.0007614949,0.0008343538,0.001337647,0.0011576926,0.0007246614,0.0010063598],"category_scores_gemma":[0.005744783,0.00022619205,0.00046307963,0.0006258869,0.0005208448,0.002762744,0.0011932077,0.0008921518,0.00041068956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005241713,0.00041878747,0.0050529772,0.00051686284,0.00033882985,0.0010752383,0.0005880492,0.26963615,0.058255527,0.13545763,0.0143578965,0.51377785],"study_design_scores_gemma":[0.00006066801,0.0006237081,0.0018551314,0.000042387037,0.00021225802,0.0007757318,0.00007715724,0.95900756,0.007358563,0.018681156,0.011179565,0.00012605505],"about_ca_topic_score_codex":0.0015261591,"about_ca_topic_score_gemma":0.0019674469,"teacher_disagreement_score":0.0020180196,"about_ca_system_score_codex":0.00068077975,"about_ca_system_score_gemma":0.0011782886,"threshold_uncertainty_score":0.01067245},"labels":[],"label_agreement":null},{"id":"W4241461078","doi":"10.1007/978-3-319-78262-1_4","title":"Capacity Analysis of Interference-Limited Wireless Networks in Three-Dimensional Space","year":2020,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Victoria","funders":"","keywords":"Interference (communication); Wireless network; Computer science; Wireless; Computer network; Telecommunications; Channel (broadcasting)","score_opus":0.027763298305842024,"score_gpt":0.21922111476089357,"score_spread":0.19145781645505155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241461078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047405507,0.011171854,0.8017115,0.0015851738,0.00024987207,0.000070097565,0.00056693243,0.0005824189,0.13665664],"genre_scores_gemma":[0.94065034,0.009786141,0.024746638,0.00041812914,0.0005020824,0.00017287284,0.00032837273,0.00027494613,0.023120431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994469,0.00018927643,0.000015116423,0.000044656095,0.00020848363,0.00009553737],"domain_scores_gemma":[0.99756503,0.0018707803,0.00010864253,0.00011335315,0.0002796897,0.0000624384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008214715,0.000802277,0.0007502728,0.001234943,0.0004458272,0.001490974,0.001331095,0.0007137059,0.004735845],"category_scores_gemma":[0.0039712777,0.00032130175,0.00045058032,0.0016620781,0.0015739924,0.0018942207,0.0011454566,0.0011274252,0.0006995575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058442853,0.000042689502,0.00026723367,0.00019913208,0.000034373697,0.0001544924,0.00018251198,0.7237767,0.0041053626,0.2490715,0.005890028,0.016217649],"study_design_scores_gemma":[0.0000016959592,0.000010217317,0.00015986718,0.000029326544,0.0000063750804,0.000071932285,0.00004146985,0.9321327,0.00057103933,0.06560633,0.0013577518,0.000011347395],"about_ca_topic_score_codex":0.0035558462,"about_ca_topic_score_gemma":0.0018034368,"teacher_disagreement_score":0.004735845,"about_ca_system_score_codex":0.0015404365,"about_ca_system_score_gemma":0.0006825868,"threshold_uncertainty_score":0.015843034},"labels":[],"label_agreement":null},{"id":"W4242045271","doi":"10.32920/ryerson.14646249.v1","title":"A Security Enhanced AODV Routing Protocol For Wireless Mesh Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Routing protocol; Zone Routing Protocol; Link-state routing protocol; Wireless Routing Protocol; Message authentication code; Distributed computing; Routing (electronic design automation); Cryptography; Computer security","score_opus":0.02122719196609606,"score_gpt":0.29715909988137773,"score_spread":0.27593190791528166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242045271","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027304992,0.0056268373,0.92235214,0.0014884359,0.0017075551,0.00097318564,0.0011892257,0.0036857347,0.03567194],"genre_scores_gemma":[0.3188021,0.0055397977,0.6213837,0.0007075866,0.0003790947,0.0009857544,0.004088585,0.00031270276,0.047800753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00007184785,0.00003406596,0.00004186534,0.00018576223,0.00002435065],"domain_scores_gemma":[0.99981815,0.000032574506,0.000018467981,0.000033189437,0.00008428655,0.0000133943295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031097405,0.0002491767,0.00023965875,0.00057310617,0.00044350777,0.0004916921,0.00077705755,0.0004068317,0.0018325679],"category_scores_gemma":[0.00070112693,0.00016223086,0.00034557396,0.0005002734,0.00022144658,0.00063570694,0.0006812143,0.0006507843,0.00079665094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027498376,0.00018519869,0.0014747686,0.0008225909,0.00013805443,0.0007104553,0.00029860932,0.039479904,0.08194793,0.11816865,0.05114767,0.70535123],"study_design_scores_gemma":[0.00014079979,0.00039638675,0.0018978793,0.00013834919,0.00010477162,0.0013324436,0.00020943685,0.27579826,0.042107936,0.041839838,0.6359177,0.00011611625],"about_ca_topic_score_codex":0.0010965519,"about_ca_topic_score_gemma":0.0015745005,"teacher_disagreement_score":0.0018325679,"about_ca_system_score_codex":0.00041181003,"about_ca_system_score_gemma":0.0007062918,"threshold_uncertainty_score":0.006130576},"labels":[],"label_agreement":null},{"id":"W4242539479","doi":"10.32920/ryerson.14652795","title":"Interference-Aware Multicast in Wireless Mesh Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; Ontario Stroke Network","funders":"","keywords":"Multicast; Computer network; Source-specific multicast; Protocol Independent Multicast; Xcast; Computer science; Pragmatic General Multicast; Distance Vector Multicast Routing Protocol; Secure multicast; Node (physics); IP multicast; Interference (communication); Transmitter; Distributed computing; Wireless mesh network; Wireless network; Wireless; Telecommunications; Engineering; Channel (broadcasting)","score_opus":0.023492356531990943,"score_gpt":0.259505480581779,"score_spread":0.23601312404978808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242539479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049398046,0.0019158788,0.94359463,0.00032850017,0.00015338793,0.00007801499,0.00007591589,0.0004589404,0.0039966884],"genre_scores_gemma":[0.80040944,0.001801316,0.19484502,0.00013535644,0.00020603363,0.00011352526,0.00018395961,0.000058997317,0.002246357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994867,0.00017492154,0.00002959671,0.00006319621,0.00019185062,0.000053749034],"domain_scores_gemma":[0.9996326,0.00015239057,0.000051787792,0.00006041012,0.00008665275,0.00001608116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052001345,0.00026234036,0.0004126311,0.00065897685,0.0006022689,0.00043930302,0.0005505806,0.00046788942,0.0005746835],"category_scores_gemma":[0.001385067,0.00015637549,0.00031159996,0.00067848916,0.00023133014,0.0008268055,0.0006494141,0.00038421826,0.00013622326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027230568,0.00012827787,0.0044816285,0.00048910704,0.00017598754,0.0005610625,0.0003668637,0.48803386,0.049266625,0.049410228,0.0064417846,0.40037236],"study_design_scores_gemma":[0.000014884974,0.00012074372,0.00072266615,0.000021802032,0.000032762953,0.00023043607,0.00008254897,0.9636736,0.0059125707,0.023620468,0.0055535515,0.000013963178],"about_ca_topic_score_codex":0.0007744716,"about_ca_topic_score_gemma":0.0008015022,"teacher_disagreement_score":0.0007744716,"about_ca_system_score_codex":0.00038901748,"about_ca_system_score_gemma":0.0002534839,"threshold_uncertainty_score":0.002822578},"labels":[],"label_agreement":null},{"id":"W4242545016","doi":"10.1002/dac.1030","title":"Special issue on ubiquitous wireless mesh networks","year":2009,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Guelph","funders":"","keywords":"Computer science; Computer network; Municipal wireless network; Wireless network; Wireless WAN; Wireless mesh network; Wireless broadband; Wi-Fi array; Heterogeneous network; Wireless; Fixed wireless; Telecommunications","score_opus":0.015583226395364096,"score_gpt":0.2813549329301287,"score_spread":0.2657717065347646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242545016","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00058381737,0.0343752,0.0023675123,0.023586247,0.89430493,0.00023213342,0.00034266384,0.00030913996,0.043898363],"genre_scores_gemma":[0.0032224432,0.0357172,0.0013443741,0.007045743,0.8300198,0.00017988314,0.0007559977,0.0003236714,0.121390946],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966953,0.00043519822,0.00034425646,0.0006316961,0.0014945316,0.00039901884],"domain_scores_gemma":[0.9918783,0.0014687156,0.00060303905,0.00051470246,0.003585489,0.0019498112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029629173,0.0021314532,0.002775993,0.0037086215,0.0023523867,0.0071454304,0.0025329082,0.0041418336,0.08037007],"category_scores_gemma":[0.0067279586,0.00063422037,0.0018730058,0.0025222301,0.0010360028,0.005316326,0.0028384419,0.0049143326,0.038500138],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003112884,0.00003665573,0.00016898211,0.000336476,0.000017217066,0.0001271885,0.000026649483,0.00009811397,0.00028476637,0.002108523,0.96664935,0.030115033],"study_design_scores_gemma":[0.000007594982,0.000038263956,0.0003187719,0.00022531245,0.000015659512,0.00020564256,0.000034641802,0.00020257024,0.000104742656,0.0009952408,0.99784064,0.0000109101375],"about_ca_topic_score_codex":0.00077773316,"about_ca_topic_score_gemma":0.0014182458,"teacher_disagreement_score":0.08037007,"about_ca_system_score_codex":0.0019526297,"about_ca_system_score_gemma":0.0021945073,"threshold_uncertainty_score":0.2688647},"labels":[],"label_agreement":null},{"id":"W4243207106","doi":"10.1109/icppw.2004.1328033","title":"Cross-layer flow control in lightly-loaded multi-hop ad hoc networks","year":2004,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer network; Computer science; Network packet; Wireless ad hoc network; Throughput; Mobile ad hoc network; Node (physics); Routing protocol; Optimized Link State Routing Protocol; Hop (telecommunications); Flow control (data); Wireless; Engineering; Telecommunications","score_opus":0.014796959365890826,"score_gpt":0.25784893934365755,"score_spread":0.24305197997776673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243207106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067474045,0.0035977203,0.9242127,0.00031470682,0.0002885682,0.00015054391,0.000017685832,0.0012830644,0.0026609858],"genre_scores_gemma":[0.85045034,0.0017303618,0.14459397,0.00029884218,0.00032198755,0.00012933309,0.00005194762,0.000090366746,0.0023327584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891925,0.0004247767,0.00007253629,0.00012964009,0.00034705206,0.00010682103],"domain_scores_gemma":[0.99811685,0.00090083835,0.00027260187,0.0002203273,0.00035660376,0.00013277562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030643141,0.00067120366,0.000506776,0.0006652254,0.0006381046,0.0015574634,0.0010187819,0.0007471638,0.00072714937],"category_scores_gemma":[0.003736178,0.00043750432,0.0002790869,0.0003964682,0.0011325689,0.0014931272,0.001032061,0.0008405581,0.0002046493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078670133,0.00049345696,0.0034082984,0.00031709915,0.00013298319,0.0006907414,0.0006311522,0.4664634,0.07574833,0.05126213,0.003977502,0.39608824],"study_design_scores_gemma":[0.000052043437,0.00027742062,0.0005392409,0.00002935537,0.000059470676,0.00019214259,0.0000318703,0.9665713,0.015967736,0.01183842,0.004400684,0.000040404422],"about_ca_topic_score_codex":0.0015737683,"about_ca_topic_score_gemma":0.0009388201,"teacher_disagreement_score":0.0030643141,"about_ca_system_score_codex":0.0005521999,"about_ca_system_score_gemma":0.00060797046,"threshold_uncertainty_score":0.016205847},"labels":[],"label_agreement":null},{"id":"W4243297766","doi":"10.1145/1089803","title":"Proceedings of the 2nd ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks","year":2005,"lang":"en","type":"paratext","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless ad hoc network; Computer science; Software deployment; Wireless sensor network; Context (archaeology); Wireless; Ubiquitous computing; Process (computing); Wireless network; Data science; Telecommunications; Computer network; Human–computer interaction; Software engineering","score_opus":0.025049891982772583,"score_gpt":0.2767592091866681,"score_spread":0.2517093172038955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243297766","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0394774,0.13274936,0.5698415,0.02637465,0.053092577,0.003348871,0.0050784303,0.0048929206,0.16514437],"genre_scores_gemma":[0.27504262,0.101579614,0.32756606,0.005227775,0.023836594,0.0034534212,0.020613996,0.0031154165,0.23956455],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.98595273,0.00557115,0.0009935837,0.0012041186,0.0055646375,0.0007137266],"domain_scores_gemma":[0.98275304,0.006520917,0.0006027179,0.0020539397,0.006485118,0.0015842217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015386942,0.0028392083,0.0031775108,0.00213795,0.00097091775,0.006247606,0.00314781,0.0022849762,0.022500606],"category_scores_gemma":[0.018612636,0.0007657712,0.0014058602,0.0017433132,0.0013849805,0.0046857437,0.0028372922,0.0039616567,0.009216177],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013714737,0.0011005602,0.005956197,0.0014135394,0.00047087146,0.00063461787,0.0007019062,0.013124208,0.007813069,0.02112742,0.4117294,0.5345567],"study_design_scores_gemma":[0.00027931464,0.0015853224,0.009534413,0.0017576041,0.0004098741,0.0011329714,0.0008630016,0.08724927,0.0076582227,0.025480917,0.86385024,0.0001989408],"about_ca_topic_score_codex":0.005401515,"about_ca_topic_score_gemma":0.0051931385,"teacher_disagreement_score":0.022500606,"about_ca_system_score_codex":0.0020489194,"about_ca_system_score_gemma":0.0041136863,"threshold_uncertainty_score":0.08137488},"labels":[],"label_agreement":null},{"id":"W4243417415","doi":"10.32920/14669139.v1","title":"Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Wireless mesh network; Routing protocol; Hazy Sighted Link State Routing Protocol; Mesh networking; Link-state routing protocol; Optimized Link State Routing Protocol; Distributed computing; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.01275625014224499,"score_gpt":0.22651457617603424,"score_spread":0.21375832603378925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243417415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035154883,0.0025500725,0.9551385,0.0007445726,0.00014811201,0.00007176314,0.00003009566,0.00028251624,0.0058795763],"genre_scores_gemma":[0.5751424,0.0046561966,0.4119704,0.0002772305,0.00030041585,0.00016953758,0.00014930237,0.00010840661,0.007226143],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996462,0.000113914,0.000016698465,0.000058787904,0.00012911619,0.000035404562],"domain_scores_gemma":[0.9997297,0.00009364642,0.000053837215,0.00006276143,0.00004632241,0.000013616933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955957,0.0005011289,0.0002779443,0.00047890356,0.00041684223,0.0006232237,0.00090282375,0.0007097384,0.0011021575],"category_scores_gemma":[0.0009777714,0.00018851145,0.00022413024,0.0004996393,0.00035962966,0.0015192776,0.0009231234,0.00051572634,0.00045779246],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014242312,0.00021928472,0.0015957747,0.0007172205,0.00009850639,0.00026262208,0.00020324484,0.107683696,0.12598154,0.11698337,0.003907505,0.64220494],"study_design_scores_gemma":[0.000090650006,0.00085554516,0.0014131987,0.00018512912,0.00015929886,0.0011419018,0.00038904496,0.70602757,0.07774934,0.1112798,0.10063787,0.0000706352],"about_ca_topic_score_codex":0.00022991255,"about_ca_topic_score_gemma":0.00036115578,"teacher_disagreement_score":0.0011021575,"about_ca_system_score_codex":0.0002786546,"about_ca_system_score_gemma":0.00030131877,"threshold_uncertainty_score":0.0036870837},"labels":[],"label_agreement":null},{"id":"W4243739598","doi":"10.21203/rs.3.rs-498677/v1","title":"An Efficient Route Optimization Using Ticket-Id Based Routing Management System (T-ID BRM)","year":2021,"lang":"en","type":"preprint","venue":"Research Square","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity College","funders":"","keywords":"Computer science; Computer network; Policy-based routing; Multipath routing; Dynamic Source Routing; Link-state routing protocol; Static routing; Distributed computing; Destination-Sequenced Distance Vector routing; Wireless Routing Protocol; Routing protocol; Ticket; Node (physics); Routing (electronic design automation); Engineering","score_opus":0.05226558717712135,"score_gpt":0.35179485697602636,"score_spread":0.29952926979890504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243739598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24030992,0.0014441832,0.7367067,0.00049417565,0.00043456757,0.00038868125,0.0004957061,0.009077456,0.010648597],"genre_scores_gemma":[0.8271265,0.00021788635,0.1685096,0.00010870764,0.000035921654,0.0001083891,0.00045356425,0.00006071224,0.0033787685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996314,0.000076680575,0.000032994027,0.000090607464,0.00010872471,0.000059651666],"domain_scores_gemma":[0.9996505,0.000050820658,0.00006926851,0.00008368776,0.000113411195,0.000032350436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005005152,0.0003897006,0.00055388594,0.0007891234,0.00056186074,0.00076832593,0.00097628107,0.00046285964,0.0017485132],"category_scores_gemma":[0.00084736996,0.00013773236,0.00032021586,0.0005759705,0.00020214968,0.00068509753,0.0004988211,0.0003331857,0.00041851355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001075524,0.0005742009,0.006655348,0.0005424868,0.00012617664,0.00030759608,0.00019308386,0.1886728,0.070426084,0.008160005,0.016087085,0.7071797],"study_design_scores_gemma":[0.0001132824,0.00077151204,0.002399155,0.000025864743,0.00006584235,0.00036957924,0.00015283159,0.95752573,0.027615245,0.0014701547,0.0094372025,0.00005373209],"about_ca_topic_score_codex":0.0023676553,"about_ca_topic_score_gemma":0.0022564437,"teacher_disagreement_score":0.0023676553,"about_ca_system_score_codex":0.00050783716,"about_ca_system_score_gemma":0.00090604246,"threshold_uncertainty_score":0.005849302},"labels":[],"label_agreement":null},{"id":"W4245059129","doi":"10.32920/ryerson.14664300","title":"Energy-aware ant colony optimization based routing for mobile ad hoc networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Optimized Link State Routing Protocol; Wireless Routing Protocol; Routing protocol; Dynamic Source Routing; Mobile ad hoc network; Destination-Sequenced Distance Vector routing; Distributed computing; Routing (electronic design automation)","score_opus":0.013548754518283766,"score_gpt":0.24028081694059497,"score_spread":0.2267320624223112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245059129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020009832,0.005624039,0.96058935,0.00040452572,0.00041846457,0.00013541983,0.00006624302,0.000589288,0.012162805],"genre_scores_gemma":[0.5874233,0.007692658,0.3909966,0.00022389773,0.00015676365,0.00030353392,0.00027793102,0.00014268322,0.012782544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997998,0.00005424454,0.00000823409,0.000023116036,0.000105413535,0.000009320823],"domain_scores_gemma":[0.9998411,0.00006967032,0.000025700307,0.000012954873,0.000044050874,0.0000063639964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019023403,0.0003948951,0.00040646346,0.0002788151,0.00023731399,0.0005075161,0.00050263654,0.00036942158,0.00073517376],"category_scores_gemma":[0.0007419463,0.000141514,0.00025193006,0.00053741183,0.0002536882,0.00040824056,0.00031152242,0.00046830086,0.00026645805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044721637,0.00005782092,0.0005905247,0.00028515825,0.00006536335,0.00014944194,0.0000615568,0.80351245,0.012406346,0.021081889,0.004283076,0.15746166],"study_design_scores_gemma":[0.000006880742,0.00004018486,0.00019112563,0.0000124509925,0.000011026109,0.00005839769,0.00001298487,0.9863427,0.0012133279,0.005591412,0.0065118386,0.000007713139],"about_ca_topic_score_codex":0.001434146,"about_ca_topic_score_gemma":0.0018377386,"teacher_disagreement_score":0.001434146,"about_ca_system_score_codex":0.00025798182,"about_ca_system_score_gemma":0.00041394267,"threshold_uncertainty_score":0.0028516054},"labels":[],"label_agreement":null},{"id":"W4245097521","doi":"10.1007/s11036-018-1037-8","title":"Exploiting Multi-Beam Antennas for End-to-End Delay Reduction in Ad Hoc Networks","year":2018,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Beamwidth; Network packet; Computer network; Transmission delay; End-to-end delay; Scheduling (production processes); Transceiver; Wireless ad hoc network; Processing delay; Wireless; Antenna (radio); Telecommunications; Mathematical optimization","score_opus":0.017472767569939398,"score_gpt":0.26791585416541297,"score_spread":0.2504430865954736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245097521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05478426,0.0006433926,0.94097227,0.0001276179,0.00008714129,0.000011515773,0.000029713976,0.00043426867,0.0029097102],"genre_scores_gemma":[0.7351525,0.001010956,0.25739932,0.00018555619,0.00012436394,0.000040358624,0.0000957943,0.00009912066,0.005892028],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996778,0.00009499327,0.000012114933,0.000039677,0.00011796673,0.000057409932],"domain_scores_gemma":[0.99932957,0.00034954678,0.0000673574,0.000105324674,0.00012978986,0.000018575793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035251272,0.00069073465,0.00033615195,0.000292979,0.0002333994,0.00047160708,0.00063525693,0.0005560194,0.0017360499],"category_scores_gemma":[0.0007081328,0.00028873057,0.00029255,0.00043829266,0.00028506888,0.00062451314,0.0005742859,0.00050600705,0.00059802237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081783865,0.00018264694,0.0017240178,0.00014882491,0.00014537212,0.00015309088,0.00010455614,0.18780407,0.57498294,0.010803817,0.0017987469,0.22133403],"study_design_scores_gemma":[0.00003220725,0.00035271503,0.0010886291,0.00001707564,0.000079024,0.00028731464,0.000061914005,0.7869807,0.20207119,0.004955802,0.004040407,0.00003303246],"about_ca_topic_score_codex":0.00022049723,"about_ca_topic_score_gemma":0.0006351628,"teacher_disagreement_score":0.0017360499,"about_ca_system_score_codex":0.00023614799,"about_ca_system_score_gemma":0.0002056818,"threshold_uncertainty_score":0.005807638},"labels":[],"label_agreement":null},{"id":"W4245964686","doi":"10.1002/dac.947","title":"An energy‐efficient localized topology control algorithm for wireless<i>ad hoc</i>and sensor networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Topology control; Computer science; Wireless sensor network; Wireless ad hoc network; Computer network; Topology (electrical circuits); Network topology; Mobile wireless sensor network; Wireless network; Distributed computing; Optimized Link State Routing Protocol; Logical topology; Overhead (engineering); Mobile ad hoc network; Algorithm; Routing protocol; Key distribution in wireless sensor networks; Wireless; Routing (electronic design automation); Network packet; Mathematics; Telecommunications","score_opus":0.013511404362145237,"score_gpt":0.2666373892939119,"score_spread":0.25312598493176663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245964686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04674507,0.00026244458,0.9509132,0.00015171133,0.000029828068,0.000054215398,0.000011993533,0.00050615415,0.0013254309],"genre_scores_gemma":[0.8214117,0.00019184369,0.17653736,0.00007795956,0.000031696847,0.000120325974,0.000052322455,0.00004178135,0.0015350094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984944,0.00004412978,0.0000100845,0.00003595481,0.000042729083,0.000017594039],"domain_scores_gemma":[0.99958366,0.00016937811,0.000100342484,0.000041993488,0.000074582145,0.000030066796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003827295,0.00035378363,0.00037170778,0.000590407,0.0004349613,0.0004925963,0.00066559,0.0003919153,0.0006610712],"category_scores_gemma":[0.0011264258,0.00014107909,0.00021979699,0.00034304368,0.00047401537,0.0008018559,0.00049426104,0.0004002774,0.0001137326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024048534,0.00013730841,0.0012696293,0.00012535955,0.00005096678,0.00021091948,0.00026231562,0.59702766,0.048296254,0.032324385,0.0033563396,0.3166984],"study_design_scores_gemma":[0.0000362616,0.00012430389,0.00014323057,0.0000066480616,0.00001287807,0.0000773139,0.0000223608,0.9877121,0.0064171134,0.0041094343,0.0013292618,0.000009077676],"about_ca_topic_score_codex":0.0009987744,"about_ca_topic_score_gemma":0.0009145801,"teacher_disagreement_score":0.0009987744,"about_ca_system_score_codex":0.00039953974,"about_ca_system_score_gemma":0.00045325895,"threshold_uncertainty_score":0.0028989315},"labels":[],"label_agreement":null},{"id":"W4246001271","doi":"10.1002/wcm.701","title":"Channel assignment for multicast in multi‐channel multi‐radio wireless mesh networks","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multicast; Computer science; Computer network; Source-specific multicast; Unicast; Throughput; Xcast; Protocol Independent Multicast; Wireless mesh network; Pragmatic General Multicast; Channel (broadcasting); Distributed computing; Distance Vector Multicast Routing Protocol; Node (physics); Network packet; Wireless network; Wireless; Telecommunications","score_opus":0.05223035414448596,"score_gpt":0.2897389234527742,"score_spread":0.23750856930828823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246001271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06560402,0.00092805276,0.9293314,0.0003147253,0.00011403749,0.00006860455,0.00004740914,0.00034535397,0.003246306],"genre_scores_gemma":[0.86231405,0.00034433836,0.13568425,0.00007477794,0.00007674904,0.000108833,0.00007484285,0.000036470137,0.0012856891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.00019729786,0.000015180456,0.00003790197,0.00007519864,0.00007756632],"domain_scores_gemma":[0.99915063,0.0005088674,0.00009051933,0.00008015914,0.00012333956,0.00004638689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008214442,0.00023173723,0.0003541393,0.0005895124,0.0006303531,0.00043411524,0.00057803525,0.00034895405,0.0016680348],"category_scores_gemma":[0.0020993873,0.00013848193,0.00018270426,0.00043481533,0.00035316325,0.0007626372,0.0007993536,0.00040061987,0.000211493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046794018,0.00015481714,0.0028843575,0.00030080596,0.00007105256,0.00023067532,0.0002303895,0.5650469,0.01968491,0.05853781,0.006355816,0.3460345],"study_design_scores_gemma":[0.000025849211,0.00006225452,0.00022959289,0.000012838544,0.000013102378,0.00006832185,0.000037666192,0.97802174,0.0026699873,0.016385248,0.002465479,0.000007970007],"about_ca_topic_score_codex":0.0006336642,"about_ca_topic_score_gemma":0.0007869877,"teacher_disagreement_score":0.0016680348,"about_ca_system_score_codex":0.00046057889,"about_ca_system_score_gemma":0.00032878542,"threshold_uncertainty_score":0.0055801272},"labels":[],"label_agreement":null},{"id":"W4246541278","doi":"10.32920/ryerson.14645583","title":"OLSR in Android operating system","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Optimized Link State Routing Protocol; Computer network; Computer science; Ad hoc wireless distribution service; Wireless Routing Protocol; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Routing protocol; Operating system; Wireless; Routing (electronic design automation)","score_opus":0.014830195530743946,"score_gpt":0.2373564993741067,"score_spread":0.22252630384336275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246541278","genre_codex":"software","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01289292,0.0032987017,0.08179891,0.0010336342,0.0009480003,0.0029133495,0.040579375,0.7068441,0.14969096],"genre_scores_gemma":[0.21093544,0.0086378595,0.15778401,0.00508391,0.0010950671,0.011044272,0.12640236,0.15607,0.32294708],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998965,0.00009005731,0.00012653644,0.00017132562,0.0004560426,0.00019090858],"domain_scores_gemma":[0.9984615,0.000238792,0.00017839193,0.00029398315,0.00067454815,0.00015276975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071857916,0.0021013282,0.0013012734,0.0015481757,0.0005034426,0.0014580138,0.0023597213,0.0009314283,0.07932993],"category_scores_gemma":[0.0031500284,0.0007668041,0.00079880795,0.0007081159,0.00039694377,0.0017432276,0.0017189123,0.0016286838,0.08703455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012876305,0.00023420106,0.0022294477,0.0024466182,0.00012139686,0.0011098492,0.00080379535,0.0013680664,0.019419381,0.0064309426,0.7279344,0.23661423],"study_design_scores_gemma":[0.00041691418,0.0003908878,0.008343625,0.00055975834,0.00019029278,0.0014415522,0.00027014862,0.0081376545,0.02592545,0.004486787,0.9494514,0.0003854618],"about_ca_topic_score_codex":0.002231651,"about_ca_topic_score_gemma":0.001441334,"teacher_disagreement_score":0.07932993,"about_ca_system_score_codex":0.00038216455,"about_ca_system_score_gemma":0.0011920467,"threshold_uncertainty_score":0.2653851},"labels":[],"label_agreement":null},{"id":"W4246696038","doi":"10.22215/etd/2014-10492","title":"A Mean Field Game Theoretic Approach for Security Enhancements in Mobile Ad-hoc Networks","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mobile ad hoc network; Computer science; Scheme (mathematics); Node (physics); Game theory; Computer security; Wireless ad hoc network; Computer network; Field (mathematics); Distributed computing; Vehicular ad hoc network; Computer security model; Aggregate (composite); Engineering; Mathematics; Telecommunications; Wireless","score_opus":0.00743865426939509,"score_gpt":0.25308495569465767,"score_spread":0.2456463014252626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246696038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006318384,0.00064212934,0.97658885,0.00090776023,0.00015705967,0.00012627731,0.000033839984,0.000043430937,0.015182282],"genre_scores_gemma":[0.6407346,0.0036420631,0.33458057,0.00091854046,0.00057135004,0.0006702712,0.0000857059,0.00006540657,0.018731387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985507,0.0007604969,0.00004866166,0.00015071178,0.00037468167,0.00011463438],"domain_scores_gemma":[0.99869734,0.00084305747,0.0000938744,0.00011053199,0.00018077137,0.000074415606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019258856,0.00094209117,0.0008634301,0.0009681558,0.00084755523,0.0015497929,0.0016381431,0.0015557775,0.0027236482],"category_scores_gemma":[0.004107957,0.000358097,0.0013950219,0.0009425625,0.0022116671,0.0032878986,0.0013744163,0.0027559274,0.00046127793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002816277,0.00005886425,0.00013555774,0.00010779771,0.000035284367,0.00006399057,0.00012417171,0.0973872,0.0018719245,0.8799638,0.0018092784,0.018413981],"study_design_scores_gemma":[0.000029993742,0.000108417706,0.00012031572,0.00005021182,0.000030629508,0.00010145524,0.000050575527,0.42704314,0.0007236397,0.56389946,0.0078108977,0.00003123994],"about_ca_topic_score_codex":0.0010369201,"about_ca_topic_score_gemma":0.0010336476,"teacher_disagreement_score":0.0027236482,"about_ca_system_score_codex":0.0019790735,"about_ca_system_score_gemma":0.0016867804,"threshold_uncertainty_score":0.014359236},"labels":[],"label_agreement":null},{"id":"W4247231092","doi":"10.1145/513819.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":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Connected dominating set; Wireless ad hoc network; Computer science; Dominating set; Approximation algorithm; Cluster analysis; Mobile ad hoc network; Graph; Algorithm; Topology (electrical circuits); Distributed computing; Mathematics; Theoretical computer science; Combinatorics; Computer network; Vertex (graph theory); Wireless","score_opus":0.01737055995851462,"score_gpt":0.24332785745205746,"score_spread":0.22595729749354285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247231092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024350591,0.00033690355,0.97398055,0.000111918795,0.000030164561,0.0000650393,0.000058598514,0.00022954852,0.00083659147],"genre_scores_gemma":[0.42923924,0.0006201775,0.5674892,0.000086315486,0.00008016231,0.00033732993,0.00042930123,0.000092706294,0.0016255347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990024,0.00033703883,0.00005715413,0.00016618666,0.00038154153,0.00005563541],"domain_scores_gemma":[0.9967624,0.0019528718,0.00032825637,0.00041737474,0.00042652665,0.00011244175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017127539,0.0009482634,0.0012582156,0.0013460771,0.0006826171,0.0008430335,0.001734582,0.00078710396,0.0008039009],"category_scores_gemma":[0.009254752,0.00045749077,0.00066765957,0.0017728632,0.00080661115,0.0016085629,0.0011200865,0.00081954774,0.00030820287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009400208,0.000047133075,0.00069046905,0.00010021329,0.00003483312,0.00003473052,0.000073514064,0.93671167,0.002708502,0.009095468,0.0008321712,0.049577266],"study_design_scores_gemma":[0.000010091193,0.00004061352,0.000112285095,0.0000050048584,0.0000069233956,0.000022088496,0.000014560366,0.9896736,0.001080528,0.00861026,0.00041997948,0.000004124752],"about_ca_topic_score_codex":0.0014750713,"about_ca_topic_score_gemma":0.0018937764,"teacher_disagreement_score":0.001734582,"about_ca_system_score_codex":0.0012058653,"about_ca_system_score_gemma":0.00072618644,"threshold_uncertainty_score":0.009057999},"labels":[],"label_agreement":null},{"id":"W4247426359","doi":"10.1007/978-3-319-25067-0","title":"Ad Hoc Networks","year":2015,"lang":"en","type":"book","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Technical University of Athens; Indian Statistical Institute; Istanbul Teknik Üniversitesi; Università di Pisa; Università della Calabria; Bilkent Üniversitesi; Università di Bologna; Wayne State University; National and Kapodistrian University of Athens; Université de Strasbourg; West Virginia University; Centre National de la Recherche Scientifique; University of Ottawa; University of Notre Dame; University of Central Florida; Florida International University","keywords":"Wireless ad hoc network; Computer science; Mobile ad hoc network; Computer network; Telecommunications","score_opus":0.02009633042537533,"score_gpt":0.23699813329735642,"score_spread":0.21690180287198108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247426359","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037198744,0.09955942,0.30529514,0.0030352913,0.013793489,0.00080539356,0.003158036,0.0063386033,0.5642948],"genre_scores_gemma":[0.04251533,0.09526304,0.10512169,0.0019551576,0.0047703106,0.00071470195,0.0076139695,0.0007522103,0.7412936],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991984,0.00012168146,0.000050642015,0.00014838482,0.00042249626,0.000058492413],"domain_scores_gemma":[0.9993082,0.00016633427,0.000050695664,0.0001851746,0.0002274435,0.00006212116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005994022,0.0017341906,0.0014091858,0.0013655162,0.00073941506,0.0031509134,0.0020222687,0.0011529278,0.046038363],"category_scores_gemma":[0.0012908998,0.0005266781,0.0003853442,0.0029206965,0.00054460164,0.0028021245,0.0016219527,0.001738415,0.06169476],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005637742,0.00010511615,0.00018720189,0.0007199735,0.000059469014,0.00021070358,0.00008780254,0.0040458543,0.0028599023,0.043752708,0.3297848,0.61813],"study_design_scores_gemma":[0.000018218872,0.000085632215,0.0003125439,0.00033112147,0.000031561423,0.0008045565,0.000058277703,0.0076805158,0.0013042793,0.035400175,0.9539447,0.000028570203],"about_ca_topic_score_codex":0.00037211567,"about_ca_topic_score_gemma":0.00076005835,"teacher_disagreement_score":0.046038363,"about_ca_system_score_codex":0.0004446467,"about_ca_system_score_gemma":0.00068014034,"threshold_uncertainty_score":0.15401363},"labels":[],"label_agreement":null},{"id":"W4248411142","doi":"10.32920/ryerson.14655516.v1","title":"An Energy Aware Trust Based Multipath Routing Scheme For Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Dynamic Source Routing; Wireless Routing Protocol; Destination-Sequenced Distance Vector routing; Multipath routing; Link-state routing protocol; Routing protocol; Distributed computing; Optimized Link State Routing Protocol; Routing (electronic design automation)","score_opus":0.017456802750293987,"score_gpt":0.26357081511237657,"score_spread":0.24611401236208258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248411142","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051055826,0.0022703295,0.93884015,0.0006319575,0.00043546446,0.0003083897,0.00015780533,0.0010103333,0.0052897963],"genre_scores_gemma":[0.7808456,0.0014805921,0.21168292,0.00011016727,0.00012439377,0.0002195213,0.00022104097,0.00004568552,0.005270081],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958855,0.000102569145,0.000031682303,0.00005851592,0.00018043126,0.00003828875],"domain_scores_gemma":[0.9995584,0.00008985996,0.00008987042,0.00011138241,0.00011780606,0.000032675613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049595203,0.00038952532,0.00041795018,0.0004797331,0.00062270125,0.0006490524,0.00077733974,0.0005868241,0.00091911096],"category_scores_gemma":[0.0019467153,0.00013758297,0.00034947408,0.0006923407,0.0003898041,0.0011472928,0.0009471948,0.00057641504,0.00030962506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065380626,0.00013371855,0.0015106554,0.000574228,0.00017117828,0.00074356457,0.00044219257,0.21404245,0.0936105,0.12720922,0.009559525,0.55134887],"study_design_scores_gemma":[0.00009458437,0.0012255914,0.0012731634,0.00007947442,0.00018212794,0.0016192772,0.00017763244,0.8629148,0.026718605,0.045416396,0.060166854,0.00013139844],"about_ca_topic_score_codex":0.0006894693,"about_ca_topic_score_gemma":0.0009297299,"teacher_disagreement_score":0.00091911096,"about_ca_system_score_codex":0.0006191877,"about_ca_system_score_gemma":0.00065228104,"threshold_uncertainty_score":0.0044925213},"labels":[],"label_agreement":null},{"id":"W4248668002","doi":"10.1109/wsc.2015.7408364","title":"Evaluating the effectiveness of Situational Awareness dissemination in tactical mobile ad hoc networks","year":2015,"lang":"en","type":"article","venue":"2015 Winter Simulation Conference (WSC)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Mobile ad hoc network; Situation awareness; Relay; Wireless ad hoc network; Vehicular ad hoc network; Computer network; Distributed computing; Overhead (engineering); Mobility model; Mobile computing; Wireless; Engineering; Telecommunications","score_opus":0.0777217847762204,"score_gpt":0.40447641805779616,"score_spread":0.3267546332815758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248668002","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9685249,0.0008872946,0.026942158,0.00018185313,0.000036176214,0.00019268652,0.000046688827,0.0001410241,0.0030474036],"genre_scores_gemma":[0.9897781,0.00020314657,0.009784165,0.00001399227,0.000008791014,0.00003154383,0.000026417609,0.000008637521,0.00014511059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967998,0.0019645116,0.000181122,0.00018835036,0.00064153393,0.00022467533],"domain_scores_gemma":[0.9610887,0.03311431,0.0022500458,0.0014804854,0.0016019257,0.00046457234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058033243,0.0009586562,0.00067579816,0.0013806302,0.00045945897,0.0009634192,0.0007519406,0.0009975643,0.00040387502],"category_scores_gemma":[0.030773146,0.0002806401,0.00024778344,0.0008437929,0.0009175175,0.0019197718,0.0009411411,0.00049734453,0.000058362963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009839778,0.00053132675,0.0073535023,0.00029846097,0.00015920257,0.00006815581,0.00016079434,0.9248079,0.012554772,0.002259861,0.00021601326,0.050606046],"study_design_scores_gemma":[0.000087367815,0.0026930925,0.0035473858,0.000027369388,0.00008639871,0.000073041076,0.00015028506,0.97754055,0.014673822,0.0007485308,0.00034104465,0.00003100311],"about_ca_topic_score_codex":0.00227369,"about_ca_topic_score_gemma":0.0020095522,"teacher_disagreement_score":0.0058033243,"about_ca_system_score_codex":0.001076091,"about_ca_system_score_gemma":0.00061150605,"threshold_uncertainty_score":0.030691326},"labels":[],"label_agreement":null},{"id":"W4248976814","doi":"10.22215/etd/2012-07263","title":"Covert channels in ad hoc networking : an analysis using the optimized link state routing protocol","year":2012,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Computer network; Computer science; Covert; Protocol (science); State (computer science); Algorithm; Philosophy","score_opus":0.028687471001450318,"score_gpt":0.31549175303644855,"score_spread":0.28680428203499825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248976814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32982004,0.00952079,0.62638825,0.0023391175,0.00050031854,0.00037952,0.00034517286,0.0006638683,0.030042978],"genre_scores_gemma":[0.9544687,0.00662084,0.0321212,0.000116151336,0.00040995062,0.0001400577,0.0002074715,0.00011330055,0.005802324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998466,0.000374864,0.000042315456,0.00008799077,0.00080580945,0.00022295438],"domain_scores_gemma":[0.99269557,0.0056874375,0.0004276031,0.00034279114,0.0007299422,0.000116746996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016331022,0.0006059039,0.0005047632,0.0021872844,0.00080090854,0.0013751384,0.0007614608,0.00077149284,0.0020629535],"category_scores_gemma":[0.0075442274,0.00037612303,0.0005536231,0.0015616866,0.0011930986,0.0030375607,0.00082654075,0.0009216018,0.00025782493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015372201,0.00014115126,0.0032197745,0.00021195922,0.000072149414,0.00032408195,0.00019587626,0.81385255,0.0033575993,0.11000882,0.004015417,0.06444688],"study_design_scores_gemma":[0.0000053356966,0.000058307636,0.0006253859,0.000013862888,0.000024967316,0.00014062565,0.00004306246,0.98556304,0.00061720255,0.011525057,0.0013726309,0.000010485455],"about_ca_topic_score_codex":0.0036935373,"about_ca_topic_score_gemma":0.0047209966,"teacher_disagreement_score":0.0036935373,"about_ca_system_score_codex":0.0013897212,"about_ca_system_score_gemma":0.0011640515,"threshold_uncertainty_score":0.010083199},"labels":[],"label_agreement":null},{"id":"W4249049239","doi":"10.1145/570764.570767","title":"Energy-aware routing in MANETs","year":2002,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Routing protocol; Dynamic Source Routing; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Link-state routing protocol; Zone Routing Protocol; Distributed computing; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.015562074331286082,"score_gpt":0.20553308011782326,"score_spread":0.18997100578653717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249049239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021195445,0.029392593,0.917093,0.002018707,0.0011520524,0.00022206678,0.000099580335,0.0012487881,0.027577758],"genre_scores_gemma":[0.5620251,0.061973684,0.34485877,0.0009561174,0.0016496637,0.00056020904,0.0004718275,0.0002733813,0.027231256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937785,0.00024729953,0.00004299959,0.00006767146,0.00022869372,0.00003544627],"domain_scores_gemma":[0.9994392,0.0003112734,0.000060925748,0.000084081374,0.0000790157,0.00002555485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083720003,0.0005480706,0.0005946587,0.00077860814,0.0005256535,0.0013363792,0.00085710234,0.00091017794,0.0013035559],"category_scores_gemma":[0.0023639244,0.00048219846,0.00022742838,0.0013248931,0.0007067358,0.0024877423,0.0009165255,0.00067910145,0.00059450744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092043556,0.00008175444,0.0009488535,0.0008978366,0.00008789334,0.0005800162,0.00034997068,0.30937538,0.007209061,0.29128662,0.012929855,0.3761607],"study_design_scores_gemma":[0.00003720099,0.0001526074,0.00057214603,0.00020536131,0.00007977437,0.0008094148,0.00023761122,0.5296523,0.003956314,0.34620956,0.118016705,0.00007108636],"about_ca_topic_score_codex":0.00059301086,"about_ca_topic_score_gemma":0.00087858725,"teacher_disagreement_score":0.0013363792,"about_ca_system_score_codex":0.0003366988,"about_ca_system_score_gemma":0.00040599215,"threshold_uncertainty_score":0.004427612},"labels":[],"label_agreement":null},{"id":"W4249052652","doi":"10.1002/net.20114","title":"Route discovery with constant memory in oriented planar geometric networks","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Concordia University; Carleton University; University of Ottawa","funders":"","keywords":"Vertex (graph theory); Planar graph; Planar; Routing (electronic design automation); Computer science; Face (sociological concept); Combinatorics; Constant (computer programming); Eulerian path; Spatial network; Topology (electrical circuits); Graph; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Pure mathematics","score_opus":0.005255363127485251,"score_gpt":0.19104026970096916,"score_spread":0.1857849065734839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249052652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43809906,0.0012778894,0.55361676,0.00086947036,0.000054772438,0.00010019503,0.0002528882,0.00061552605,0.0051134517],"genre_scores_gemma":[0.93817455,0.0005782326,0.059092235,0.000078372745,0.000050455532,0.000072887764,0.00023273467,0.000027881415,0.0016927022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941504,0.00012543399,0.000038660215,0.00015106365,0.00014381764,0.00012613033],"domain_scores_gemma":[0.9960174,0.0021498294,0.0008529882,0.0004671421,0.00034942108,0.0001632511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006731806,0.0004105819,0.00079291494,0.0012165102,0.0006394659,0.0013138928,0.0017714907,0.000760109,0.0015120029],"category_scores_gemma":[0.008472495,0.0003464704,0.0003093436,0.001473576,0.001138654,0.00332788,0.0017840669,0.0005342555,0.00028880598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000788609,0.0000892065,0.0043875226,0.00027962268,0.00009099155,0.0005085096,0.00047669845,0.6956422,0.008797536,0.11163666,0.0029556695,0.17434675],"study_design_scores_gemma":[0.0000555436,0.00015001478,0.00056461646,0.000028176437,0.000054343935,0.00033979866,0.00018704946,0.8596055,0.0075595872,0.12795399,0.003469617,0.00003174494],"about_ca_topic_score_codex":0.0017547364,"about_ca_topic_score_gemma":0.0012799845,"teacher_disagreement_score":0.0017714907,"about_ca_system_score_codex":0.00080896687,"about_ca_system_score_gemma":0.0005172446,"threshold_uncertainty_score":0.005869508},"labels":[],"label_agreement":null},{"id":"W4251203290","doi":"10.32920/ryerson.14648250","title":"Preventing Collaborative Wormhole Attacks In AODV-based Mobile Ad-Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Ad hoc On-Demand Distance Vector Routing; Mobile ad hoc network; Computer science; Wormhole; Computer network; Network packet; Wireless ad hoc network; Vehicular ad hoc network; Wireless; Routing (electronic design automation); Computer security; Optimized Link State Routing Protocol; Routing protocol; Telecommunications","score_opus":0.011885562593803257,"score_gpt":0.2666207783937986,"score_spread":0.25473521579999536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251203290","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24319951,0.0020938604,0.7467839,0.00029353698,0.00020007967,0.00043285495,0.000057903177,0.0011447027,0.0057936762],"genre_scores_gemma":[0.9322686,0.00055510784,0.06597962,0.000044791046,0.000028119292,0.00009726227,0.00005381306,0.000021308791,0.00095135055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890184,0.00029305642,0.000100798694,0.00011029619,0.00048615283,0.00010785159],"domain_scores_gemma":[0.9979747,0.000866956,0.0004258688,0.00028386273,0.00037702516,0.00007159489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010775288,0.0005200779,0.0005660637,0.001035839,0.0006235027,0.0006283841,0.00090091786,0.00063484354,0.00034047055],"category_scores_gemma":[0.0038628608,0.0002745549,0.00037184972,0.00057048205,0.0005675169,0.0013140172,0.0010489993,0.00050066435,0.00011922226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007386538,0.00043579453,0.0069050333,0.0006901646,0.0002953326,0.0008876569,0.00062378024,0.5771164,0.11650332,0.03523765,0.0022101018,0.2583561],"study_design_scores_gemma":[0.000063169275,0.00068660564,0.00095766364,0.000032822147,0.0000891218,0.00049857225,0.00017652009,0.9506776,0.03522283,0.007821991,0.0037319853,0.00004108936],"about_ca_topic_score_codex":0.0010461047,"about_ca_topic_score_gemma":0.0012679271,"teacher_disagreement_score":0.0010775288,"about_ca_system_score_codex":0.0003727304,"about_ca_system_score_gemma":0.00065294467,"threshold_uncertainty_score":0.0056986213},"labels":[],"label_agreement":null},{"id":"W4251227225","doi":"10.2139/ssrn.3606911","title":"Performance Comparison of Routing Protocols in Mobile Ad Hoc Networks","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Computer network; Mobile ad hoc network; Optimized Link State Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Wireless ad hoc network; Wireless Routing Protocol; Routing protocol; Routing (electronic design automation); Telecommunications; Wireless; Network packet","score_opus":0.02144820413012606,"score_gpt":0.2945449818226589,"score_spread":0.2730967776925329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251227225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9106786,0.018355856,0.044974703,0.0010748716,0.001140113,0.00043529752,0.0009248573,0.0017272736,0.020688416],"genre_scores_gemma":[0.98272413,0.002796378,0.010760717,0.000060353286,0.00013827288,0.00007148358,0.0009361326,0.000085570304,0.0024270297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994833,0.002044237,0.00052574836,0.0003477799,0.0017743551,0.00047489523],"domain_scores_gemma":[0.9841415,0.0105252955,0.00076801877,0.0011089607,0.0030659845,0.00039026112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057305237,0.0009734951,0.0010117096,0.0030973477,0.00085537723,0.0017341594,0.0014636472,0.0010481632,0.0020634297],"category_scores_gemma":[0.012581359,0.0002566301,0.00037552146,0.0024369878,0.00057926215,0.0026667719,0.00080480037,0.000553703,0.00043065046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010508512,0.0016488184,0.01706466,0.0025873615,0.0011158299,0.0005582968,0.0005591883,0.45459506,0.062283184,0.014160066,0.011124182,0.42379484],"study_design_scores_gemma":[0.00053904357,0.00869475,0.013644652,0.00015731581,0.00089349464,0.0011620893,0.0011585965,0.903363,0.054309215,0.0058972896,0.01000088,0.00017970793],"about_ca_topic_score_codex":0.0017396044,"about_ca_topic_score_gemma":0.0015977822,"teacher_disagreement_score":0.0057305237,"about_ca_system_score_codex":0.0018953995,"about_ca_system_score_gemma":0.0010316485,"threshold_uncertainty_score":0.03030628},"labels":[],"label_agreement":null},{"id":"W4251371575","doi":"10.1109/mobiq.2006.340457","title":"Randomized 3D Position-based Routing Algorithms for Ad-hoc Networks","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Destination-Sequenced Distance Vector routing; Computer science; Link-state routing protocol; Static routing; Algorithm; Dynamic Source Routing; Equal-cost multi-path routing; Multipath routing; Distributed computing; Computer network; Routing (electronic design automation); Routing protocol","score_opus":0.010185214636045874,"score_gpt":0.23797184764037463,"score_spread":0.22778663300432875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251371575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044545913,0.00040481865,0.9927049,0.00014734463,0.00009313865,0.000051064642,0.000049262195,0.000854153,0.0012407502],"genre_scores_gemma":[0.15422745,0.00079189724,0.84114903,0.0001776519,0.0000790726,0.00031525624,0.0003551368,0.00014046107,0.0027639046],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988242,0.0004178908,0.0000712516,0.0001757403,0.00043772743,0.00007332978],"domain_scores_gemma":[0.9984108,0.0006348784,0.00018228564,0.00040879514,0.0003180104,0.000045096236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011195056,0.0008840241,0.000803634,0.00090179127,0.0008956677,0.0012978498,0.0016261727,0.00091644947,0.0026514272],"category_scores_gemma":[0.00410663,0.00044361598,0.0006605394,0.0011640771,0.00064958923,0.0017707876,0.0013540224,0.0009887825,0.0009837825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023595711,0.000075928954,0.00097298535,0.00014940942,0.00008249795,0.00008423426,0.00011944037,0.602857,0.0064742235,0.05838625,0.0062467554,0.3243153],"study_design_scores_gemma":[0.00005522556,0.00008399886,0.00019011281,0.000015692654,0.000024804076,0.00011795258,0.000027289378,0.9676753,0.0030949498,0.020351171,0.008332538,0.000031013285],"about_ca_topic_score_codex":0.0034810994,"about_ca_topic_score_gemma":0.0050626397,"teacher_disagreement_score":0.0034810994,"about_ca_system_score_codex":0.00096544175,"about_ca_system_score_gemma":0.0012023281,"threshold_uncertainty_score":0.008869886},"labels":[],"label_agreement":null},{"id":"W4251922402","doi":"10.32920/ryerson.14656281","title":"QoS support using SWAN model in mobile ad-hoc networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quality of service; Mobile ad hoc network; Computer network; Computer science; Mobile QoS; Adaptive quality of service multi-hop routing; Wireless ad hoc network; Routing protocol; Distributed computing; Routing (electronic design automation); Provisioning; Optimized Link State Routing Protocol; Service (business); Service provider; Telecommunications; Wireless","score_opus":0.02971126519652401,"score_gpt":0.27593814005080025,"score_spread":0.24622687485427625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251922402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059897367,0.0071308413,0.79162204,0.0040494027,0.0006814543,0.00013934373,0.00020315366,0.00027630848,0.136],"genre_scores_gemma":[0.8941586,0.008508118,0.06954347,0.0005902988,0.0006204553,0.00023270668,0.00017191391,0.00007372021,0.026100744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953675,0.0001768914,0.00002178803,0.000057733658,0.00016070581,0.00004610564],"domain_scores_gemma":[0.9994862,0.00026837934,0.000062135834,0.000046697944,0.000105568775,0.000030955485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053136784,0.00053105084,0.00029704347,0.0006500596,0.0005816402,0.0011793537,0.0007308226,0.0008718694,0.0017846444],"category_scores_gemma":[0.0014448039,0.00015553265,0.0004017201,0.0009335574,0.0008017321,0.0024004937,0.0007292211,0.0010161811,0.00048369737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024597968,0.000043776705,0.00040741672,0.00012969335,0.000010749346,0.00029523714,0.00021971193,0.09526383,0.0021410754,0.8774932,0.0022793051,0.02169148],"study_design_scores_gemma":[0.000008216843,0.00006453033,0.00015009777,0.000045005156,0.000012323995,0.0002874448,0.00013550986,0.67404824,0.0005213458,0.3074269,0.017284626,0.000015740263],"about_ca_topic_score_codex":0.0016815996,"about_ca_topic_score_gemma":0.001196713,"teacher_disagreement_score":0.0017846444,"about_ca_system_score_codex":0.000848318,"about_ca_system_score_gemma":0.00060965435,"threshold_uncertainty_score":0.006155014},"labels":[],"label_agreement":null},{"id":"W4252442075","doi":"10.24124/2005/bpgub330","title":"Connectionless routing protocols for mobile ad-hoc networks.","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Library and Archives Canada","funders":"","keywords":"Connectionless communication; Computer network; Computer science","score_opus":0.01717993713236515,"score_gpt":0.30730589431842814,"score_spread":0.290125957186063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252442075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038942539,0.052612923,0.836703,0.003271341,0.008382883,0.0011275593,0.0013162374,0.0067488756,0.085942924],"genre_scores_gemma":[0.12504716,0.09892907,0.61384517,0.0017512226,0.0060989987,0.0034591935,0.008368858,0.0016455875,0.14085475],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986613,0.00029175958,0.00012863308,0.00011942495,0.00073819776,0.000060752758],"domain_scores_gemma":[0.99820316,0.0006325739,0.000092574,0.0004844073,0.0004999599,0.0000872322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015059428,0.0013242459,0.00078173546,0.0013309618,0.00092577597,0.0019013227,0.0024033675,0.0012248468,0.008636005],"category_scores_gemma":[0.0049939062,0.0010639532,0.00046390406,0.0019673766,0.0010125908,0.0032209943,0.0013899119,0.0022771019,0.0075696614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013720778,0.00020682518,0.00028205663,0.0018208247,0.00010462844,0.00036168538,0.0004586714,0.015363315,0.008931972,0.23441729,0.22636405,0.51155156],"study_design_scores_gemma":[0.00014748871,0.00017151007,0.00049792964,0.0006433137,0.00012227289,0.0010516364,0.00013609667,0.04711647,0.008423388,0.16135387,0.78026485,0.00007120493],"about_ca_topic_score_codex":0.0010774225,"about_ca_topic_score_gemma":0.0018337405,"teacher_disagreement_score":0.008636005,"about_ca_system_score_codex":0.00079070154,"about_ca_system_score_gemma":0.0010642846,"threshold_uncertainty_score":0.028890312},"labels":[],"label_agreement":null},{"id":"W4252680989","doi":"10.32920/ryerson.14646249","title":"A Security Enhanced AODV Routing Protocol For Wireless Mesh Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Dynamic Source Routing; Routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Link-state routing protocol; Wireless mesh network; Distributed computing; Wireless; Routing (electronic design automation); Wireless network; Telecommunications","score_opus":0.02122719196609606,"score_gpt":0.29715909988137773,"score_spread":0.27593190791528166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252680989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027304992,0.0056268373,0.92235214,0.0014884359,0.0017075551,0.00097318564,0.0011892257,0.0036857347,0.03567194],"genre_scores_gemma":[0.3188021,0.0055397977,0.6213837,0.0007075866,0.0003790947,0.0009857544,0.004088585,0.00031270276,0.047800753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999642,0.00007184785,0.00003406596,0.00004186534,0.00018576223,0.00002435065],"domain_scores_gemma":[0.99981815,0.000032574506,0.000018467981,0.000033189437,0.00008428655,0.0000133943295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031097405,0.0002491767,0.00023965875,0.00057310617,0.00044350777,0.0004916921,0.00077705755,0.0004068317,0.0018325679],"category_scores_gemma":[0.00070112693,0.00016223086,0.00034557396,0.0005002734,0.00022144658,0.00063570694,0.0006812143,0.0006507843,0.00079665094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027498376,0.00018519869,0.0014747686,0.0008225909,0.00013805443,0.0007104553,0.00029860932,0.039479904,0.08194793,0.11816865,0.05114767,0.70535123],"study_design_scores_gemma":[0.00014079979,0.00039638675,0.0018978793,0.00013834919,0.00010477162,0.0013324436,0.00020943685,0.27579826,0.042107936,0.041839838,0.6359177,0.00011611625],"about_ca_topic_score_codex":0.0010965519,"about_ca_topic_score_gemma":0.0015745005,"teacher_disagreement_score":0.0018325679,"about_ca_system_score_codex":0.00041181003,"about_ca_system_score_gemma":0.0007062918,"threshold_uncertainty_score":0.006130576},"labels":[],"label_agreement":null},{"id":"W4253048043","doi":"10.32920/ryerson.14654271","title":"Abstract ACO-EEAODR: An Ant-Swarm Inspired Energy-Efficient Ad Hoc On-Demand Routing Protocol for Mobile Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Strong","keywords":"Wireless Routing Protocol; Computer science; Ant colony optimization algorithms; Computer network; Optimized Link State Routing Protocol; Routing protocol; Mobile ad hoc network; Wireless ad hoc network; Ad hoc wireless distribution service; Distributed computing; Routing (electronic design automation); Wireless; Telecommunications; Artificial intelligence","score_opus":0.02834946657381693,"score_gpt":0.30029523870789315,"score_spread":0.2719457721340762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253048043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041793123,0.003393748,0.92116445,0.0011604542,0.00092087046,0.0004477981,0.00033356808,0.001552182,0.02923381],"genre_scores_gemma":[0.61778927,0.0025684973,0.35641095,0.00070206093,0.00019676956,0.00039559908,0.000838575,0.00022954177,0.020868747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966204,0.00009264681,0.000019851463,0.000057261946,0.00014114415,0.00002704873],"domain_scores_gemma":[0.9996544,0.00010595563,0.000052760224,0.000052148534,0.000106121275,0.000028531906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003311899,0.000459469,0.00043883087,0.0005499211,0.00035826446,0.0008491975,0.0008822133,0.00058921357,0.0013518932],"category_scores_gemma":[0.0010149475,0.00013818199,0.0004211176,0.00083107,0.00031142888,0.0005043167,0.00048005668,0.00073613453,0.0003995327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027770374,0.00029960842,0.0020535728,0.00075155875,0.00025313513,0.00050306227,0.00014025514,0.50627303,0.04827831,0.049560204,0.021124437,0.37048522],"study_design_scores_gemma":[0.000057908215,0.00014876777,0.00049996044,0.000027724185,0.00003697251,0.0003408301,0.000032581916,0.9524626,0.0083022425,0.0075166235,0.030548442,0.00002526664],"about_ca_topic_score_codex":0.0017739041,"about_ca_topic_score_gemma":0.0022944415,"teacher_disagreement_score":0.0017739041,"about_ca_system_score_codex":0.00031288058,"about_ca_system_score_gemma":0.00061884255,"threshold_uncertainty_score":0.004522562},"labels":[],"label_agreement":null},{"id":"W4253210252","doi":"10.32920/ryerson.14646123","title":"OSPF for Wireless Mesh Backbone Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Wireless mesh network; Open Shortest Path First; Computer science; Wireless ad hoc network; Optimized Link State Routing Protocol; Routing protocol; Ad hoc On-Demand Distance Vector Routing; Hazy Sighted Link State Routing Protocol; Distributed computing; Mobile ad hoc network; Mesh networking; Order One Network Protocol; Ad hoc wireless distribution service; Wireless network; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Link-state routing protocol; Network packet; Telecommunications","score_opus":0.019378466434694822,"score_gpt":0.2515149727792894,"score_spread":0.2321365063445946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253210252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012917486,0.01567483,0.8367403,0.0072284737,0.0051668854,0.00064938853,0.004891704,0.009154106,0.1075768],"genre_scores_gemma":[0.33073917,0.025840497,0.5175539,0.0028154054,0.0031814293,0.0017416567,0.018034386,0.0010086114,0.09908488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999382,0.00015894696,0.000046845485,0.00010769618,0.0002418111,0.00006259222],"domain_scores_gemma":[0.9994357,0.000110395886,0.00008009091,0.00010907633,0.00022971423,0.000034994635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006059065,0.00062814576,0.0004375688,0.0010071655,0.0008624151,0.0013532541,0.00084910565,0.0009434048,0.01040444],"category_scores_gemma":[0.0016320989,0.00017829034,0.00036432373,0.0012181243,0.00052649714,0.0018860507,0.00082792214,0.0014938241,0.005118661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015211428,0.00007534003,0.00065166614,0.0007059492,0.000050395098,0.0006696007,0.00019692768,0.01832328,0.008433448,0.37301156,0.22146302,0.3762667],"study_design_scores_gemma":[0.000057578494,0.00013546784,0.00069497543,0.0002125083,0.00003293947,0.00076973886,0.00011773545,0.07899119,0.005263535,0.22361125,0.6900452,0.00006791668],"about_ca_topic_score_codex":0.0016199595,"about_ca_topic_score_gemma":0.00093258754,"teacher_disagreement_score":0.01040444,"about_ca_system_score_codex":0.00083981315,"about_ca_system_score_gemma":0.0011078165,"threshold_uncertainty_score":0.03480631},"labels":[],"label_agreement":null},{"id":"W4253531500","doi":"10.32920/14669139","title":"Promoting Wired Links in Wireless Mesh Networks: An Efficient Engineering Solution","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer network; Computer science; Wireless mesh network; Mesh networking; Routing protocol; Hazy Sighted Link State Routing Protocol; Link-state routing protocol; Order One Network Protocol; Dynamic Source Routing; Distributed computing; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.01275625014224499,"score_gpt":0.22651457617603424,"score_spread":0.21375832603378925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253531500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035154883,0.0025500725,0.9551385,0.0007445726,0.00014811201,0.00007176314,0.00003009566,0.00028251624,0.0058795763],"genre_scores_gemma":[0.5751424,0.0046561966,0.4119704,0.0002772305,0.00030041585,0.00016953758,0.00014930237,0.00010840661,0.007226143],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996462,0.000113914,0.000016698465,0.000058787904,0.00012911619,0.000035404562],"domain_scores_gemma":[0.9997297,0.00009364642,0.000053837215,0.00006276143,0.00004632241,0.000013616933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003955957,0.0005011289,0.0002779443,0.00047890356,0.00041684223,0.0006232237,0.00090282375,0.0007097384,0.0011021575],"category_scores_gemma":[0.0009777714,0.00018851145,0.00022413024,0.0004996393,0.00035962966,0.0015192776,0.0009231234,0.00051572634,0.00045779246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014242312,0.00021928472,0.0015957747,0.0007172205,0.00009850639,0.00026262208,0.00020324484,0.107683696,0.12598154,0.11698337,0.003907505,0.64220494],"study_design_scores_gemma":[0.000090650006,0.00085554516,0.0014131987,0.00018512912,0.00015929886,0.0011419018,0.00038904496,0.70602757,0.07774934,0.1112798,0.10063787,0.0000706352],"about_ca_topic_score_codex":0.00022991255,"about_ca_topic_score_gemma":0.00036115578,"teacher_disagreement_score":0.0011021575,"about_ca_system_score_codex":0.0002786546,"about_ca_system_score_gemma":0.00030131877,"threshold_uncertainty_score":0.0036870837},"labels":[],"label_agreement":null},{"id":"W4254034155","doi":"10.22215/etd/2015-11008","title":"Spectrum Requirements for Interference-Free Wireless Mesh Networks","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Wireless mesh network; Computer science; Heuristics; Interference (communication); Throughput; Channel (broadcasting); Wireless network; Channel allocation schemes; Mesh networking; Beamforming; Computer network; Zero-forcing precoding; Adjacent-channel interference; Wireless; Distributed computing; Topology (electrical circuits); MIMO; Telecommunications; Engineering; Precoding","score_opus":0.029417520505026523,"score_gpt":0.29050084152502803,"score_spread":0.26108332102000154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254034155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066485606,0.0015213621,0.9122817,0.00043713927,0.000170046,0.00011248876,0.00018694841,0.00023740539,0.01856734],"genre_scores_gemma":[0.8799074,0.0012421438,0.11531486,0.00012834309,0.00012940104,0.00024149487,0.0001834171,0.00011311515,0.0027397755],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999027,0.00023432139,0.000044717395,0.00011427059,0.00045589346,0.00012386436],"domain_scores_gemma":[0.9976453,0.0016737904,0.00014360418,0.00016061157,0.0003245885,0.000052206975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009333716,0.0005188089,0.0005157435,0.0004915494,0.00062578166,0.00082059775,0.0011045771,0.0007979384,0.002335707],"category_scores_gemma":[0.007112863,0.00034579376,0.00022373315,0.00053774746,0.00045233095,0.0014687749,0.00088863395,0.0005760125,0.00045931776],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020223015,0.000106574094,0.00075187144,0.0005476469,0.00003363406,0.0004270498,0.00033749655,0.6676773,0.05080612,0.1666091,0.0033189314,0.10918203],"study_design_scores_gemma":[0.00001869202,0.00009837654,0.00038339844,0.000044127308,0.0000127874455,0.00026607225,0.000105966814,0.9139287,0.0065186215,0.072924264,0.0056770467,0.000021892152],"about_ca_topic_score_codex":0.00069146807,"about_ca_topic_score_gemma":0.0006252534,"teacher_disagreement_score":0.002335707,"about_ca_system_score_codex":0.000639469,"about_ca_system_score_gemma":0.0004634422,"threshold_uncertainty_score":0},"labels":[{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"grok","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"opus","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"}],"label_agreement":"split"},{"id":"W4254710518","doi":"10.32920/ryerson.14644083.v1","title":"Multi-Channel Wireless Mesh Networks With TCP Proxies","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Wireless mesh network; Computer science; Wireless network; Network packet; Scalability; Wireless; Shared mesh; Distributed computing; Telecommunications","score_opus":0.019195319018339266,"score_gpt":0.23617828093895757,"score_spread":0.2169829619206183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254710518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48923907,0.0011421333,0.49743292,0.00032743893,0.0002442142,0.0002582207,0.00014395907,0.0033275064,0.007884512],"genre_scores_gemma":[0.9512375,0.00016746782,0.047510594,0.00004083822,0.000018688685,0.00007944771,0.000073864445,0.000026281477,0.00084524637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914265,0.0004018904,0.00006305275,0.00010322891,0.00016968825,0.00011949847],"domain_scores_gemma":[0.9979748,0.000888744,0.00025889836,0.00050006824,0.00028915852,0.000088325134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001313976,0.00034994,0.00043815753,0.00051766087,0.00040449883,0.0007689151,0.001028759,0.00046447702,0.0010274304],"category_scores_gemma":[0.0033836355,0.0002118171,0.00032513627,0.0005259033,0.00033163695,0.0014343938,0.00085904106,0.00043932,0.00020006344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017933241,0.0005987941,0.019754207,0.0005663437,0.00023181901,0.00092285353,0.00037537707,0.6081313,0.09722249,0.0219595,0.0032127749,0.24523114],"study_design_scores_gemma":[0.000048404123,0.00061378314,0.0017890066,0.000036819107,0.00007728976,0.00021208267,0.00008322562,0.9551754,0.032639947,0.0040945285,0.005183591,0.000045935263],"about_ca_topic_score_codex":0.0005227341,"about_ca_topic_score_gemma":0.000560308,"teacher_disagreement_score":0.001313976,"about_ca_system_score_codex":0.00048220326,"about_ca_system_score_gemma":0.00036209784,"threshold_uncertainty_score":0.0069490075},"labels":[],"label_agreement":null},{"id":"W4255055944","doi":"10.1002/wcm.636","title":"Localized power‐aware alternate routing for wireless ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Wireless Communications and Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Overhead (engineering); Wireless ad hoc network; Routing protocol; Network packet; Optimized Link State Routing Protocol; Wireless; Transmission (telecommunications); Routing (electronic design automation); Mobile ad hoc network; Distributed computing; Ad hoc wireless distribution service; Wireless network; Telecommunications","score_opus":0.023855647592229624,"score_gpt":0.27178476651422573,"score_spread":0.2479291189219961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255055944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025497243,0.0012021647,0.96981907,0.0001954557,0.00008240571,0.00005122634,0.00001779745,0.00055499416,0.0025796217],"genre_scores_gemma":[0.73436797,0.0010498352,0.260442,0.00020590473,0.00012839913,0.00017134346,0.00011895029,0.000059722362,0.0034558375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955696,0.00019526764,0.00002178155,0.000053428586,0.00014114573,0.000031355114],"domain_scores_gemma":[0.9993624,0.00026909824,0.00008344467,0.00012189588,0.00012960786,0.000033570414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005281611,0.0003676437,0.00030710295,0.00043073753,0.00031619205,0.0004950181,0.00090520194,0.00032078233,0.00083678495],"category_scores_gemma":[0.0013430972,0.0001534652,0.00021033183,0.00040401693,0.00040637606,0.0009784889,0.0006400766,0.00045344606,0.00027219873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030196455,0.00016602938,0.0016192298,0.00041326185,0.00009709117,0.00041339686,0.00026351007,0.3464759,0.05782768,0.06883288,0.006864576,0.5167245],"study_design_scores_gemma":[0.000046347817,0.0003004549,0.00033056125,0.000022368673,0.00004342765,0.00031441613,0.00005751765,0.9454767,0.010106752,0.028376,0.014902242,0.000023238765],"about_ca_topic_score_codex":0.00023032239,"about_ca_topic_score_gemma":0.00043868367,"teacher_disagreement_score":0.00090520194,"about_ca_system_score_codex":0.00026221757,"about_ca_system_score_gemma":0.0002975471,"threshold_uncertainty_score":0.0027993321},"labels":[],"label_agreement":null},{"id":"W4255560841","doi":"10.32920/ryerson.14646123.v1","title":"OSPF for Wireless Mesh Backbone Network","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Wireless mesh network; Open Shortest Path First; Computer science; Optimized Link State Routing Protocol; Wireless ad hoc network; Routing protocol; Hazy Sighted Link State Routing Protocol; Distributed computing; Ad hoc On-Demand Distance Vector Routing; Order One Network Protocol; Mesh networking; Shared mesh; Ad hoc wireless distribution service; Wireless network; Wireless Routing Protocol; Wireless; Routing (electronic design automation); Link-state routing protocol; Telecommunications","score_opus":0.019378466434694822,"score_gpt":0.2515149727792894,"score_spread":0.2321365063445946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255560841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012917486,0.01567483,0.8367403,0.0072284737,0.0051668854,0.00064938853,0.004891704,0.009154106,0.1075768],"genre_scores_gemma":[0.33073917,0.025840497,0.5175539,0.0028154054,0.0031814293,0.0017416567,0.018034386,0.0010086114,0.09908488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999382,0.00015894696,0.000046845485,0.00010769618,0.0002418111,0.00006259222],"domain_scores_gemma":[0.9994357,0.000110395886,0.00008009091,0.00010907633,0.00022971423,0.000034994635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006059065,0.00062814576,0.0004375688,0.0010071655,0.0008624151,0.0013532541,0.00084910565,0.0009434048,0.01040444],"category_scores_gemma":[0.0016320989,0.00017829034,0.00036432373,0.0012181243,0.00052649714,0.0018860507,0.00082792214,0.0014938241,0.005118661],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015211428,0.00007534003,0.00065166614,0.0007059492,0.000050395098,0.0006696007,0.00019692768,0.01832328,0.008433448,0.37301156,0.22146302,0.3762667],"study_design_scores_gemma":[0.000057578494,0.00013546784,0.00069497543,0.0002125083,0.00003293947,0.00076973886,0.00011773545,0.07899119,0.005263535,0.22361125,0.6900452,0.00006791668],"about_ca_topic_score_codex":0.0016199595,"about_ca_topic_score_gemma":0.00093258754,"teacher_disagreement_score":0.01040444,"about_ca_system_score_codex":0.00083981315,"about_ca_system_score_gemma":0.0011078165,"threshold_uncertainty_score":0.03480631},"labels":[],"label_agreement":null},{"id":"W4255569650","doi":"10.32920/ryerson.14645349.v1","title":"A Performance Study of TCP on Ad Hoc Networks","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario College of Art and Design","funders":"Türkiye Atom Enerjisi Kurumu","keywords":"Computer network; Computer science; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Link-state routing protocol; DSRFLOW; Optimized Link State Routing Protocol; Routing protocol; Distance-vector routing protocol; Distributed computing; Network packet","score_opus":0.020157995250752604,"score_gpt":0.24812992027088646,"score_spread":0.22797192502013386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255569650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76097137,0.013451253,0.19783418,0.00087904744,0.00060144585,0.00034732814,0.00037474325,0.0010887241,0.024451878],"genre_scores_gemma":[0.9807489,0.0036222478,0.013734442,0.00004736746,0.00019550031,0.000095207666,0.00019683999,0.00008470303,0.001274864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99587727,0.0018130459,0.00022672316,0.0003364923,0.0014731105,0.00027325976],"domain_scores_gemma":[0.9891639,0.00782706,0.0006027122,0.00062174915,0.0016094168,0.00017521152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027468554,0.0010723849,0.0008117101,0.0017779649,0.0007908575,0.0016248262,0.0010315822,0.001049697,0.0007402968],"category_scores_gemma":[0.014834867,0.00032418573,0.00046060458,0.0025224532,0.00088944286,0.0026236635,0.00050789624,0.00085056573,0.00015944937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038349984,0.0002167235,0.014165692,0.0006852577,0.00027992687,0.0010645324,0.00073008426,0.8501184,0.01758071,0.028650096,0.0029561762,0.08316891],"study_design_scores_gemma":[0.000008514656,0.00028248396,0.0027368502,0.000049624283,0.000034410863,0.00031526768,0.00009782739,0.98860383,0.0035185062,0.0019175743,0.0024113127,0.000023758412],"about_ca_topic_score_codex":0.0026362198,"about_ca_topic_score_gemma":0.00071053056,"teacher_disagreement_score":0.0027468554,"about_ca_system_score_codex":0.0010792572,"about_ca_system_score_gemma":0.0004617601,"threshold_uncertainty_score":0.014526904},"labels":[],"label_agreement":null},{"id":"W4280551762","doi":"10.1109/wcnc51071.2022.9771796","title":"Integer Programs for Contention Aware Connected Dominating Sets in Wireless Multi-Hop Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Connected dominating set; Integer programming; Computer network; Wireless network; Wireless; Hop (telecommunications); Wireless ad hoc network; Set (abstract data type); Transmission (telecommunications); Distributed computing; Integer (computer science); Theoretical computer science; Algorithm; Graph; Telecommunications","score_opus":0.06412927341488701,"score_gpt":0.2948004175331864,"score_spread":0.23067114411829942,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280551762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071856678,0.0007997796,0.98290896,0.0006226035,0.00012554294,0.00024198041,0.00031666047,0.00020448412,0.0075942515],"genre_scores_gemma":[0.18204583,0.0014711481,0.8045061,0.0005059491,0.00024866746,0.0014890824,0.0007647352,0.00031452265,0.008653973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801946,0.0010288924,0.00009298784,0.00024102976,0.00040818154,0.00020936754],"domain_scores_gemma":[0.9932806,0.0058040977,0.00028088095,0.000107820284,0.0003903091,0.00013640255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040935148,0.0025869543,0.0016478153,0.0011900052,0.00090032484,0.002381255,0.001593473,0.0016461625,0.0067308876],"category_scores_gemma":[0.010302557,0.0010435381,0.0015303807,0.0016910867,0.0013872505,0.0021563875,0.0015743251,0.0035144496,0.00090401503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006709099,0.000103833205,0.00028686196,0.00022774581,0.00003611619,0.000083256586,0.00012938258,0.913161,0.00041446212,0.059190203,0.003111416,0.023188615],"study_design_scores_gemma":[0.000023213775,0.00002230385,0.000044004264,0.000028018869,0.00000875315,0.000013569846,0.000036245594,0.9700547,0.00019190673,0.027874969,0.0016955403,0.000006838741],"about_ca_topic_score_codex":0.004700426,"about_ca_topic_score_gemma":0.005593759,"teacher_disagreement_score":0.0067308876,"about_ca_system_score_codex":0.002215505,"about_ca_system_score_gemma":0.0023596855,"threshold_uncertainty_score":0.022517025},"labels":[],"label_agreement":null},{"id":"W4281725275","doi":"10.1016/j.comnet.2022.109086","title":"G-3MRP: A game-theoretical multimedia multimetric map-aware routing protocol for vehicular ad hoc networks","year":2022,"lang":"en","type":"article","venue":"Computer Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Agencia Estatal de Investigación","keywords":"Computer science; Computer network; Network packet; Routing (electronic design automation); Vehicular ad hoc network; Wireless ad hoc network; Routing protocol; Protocol (science); Resource (disambiguation); Telecommunications; Wireless","score_opus":0.014222453476649148,"score_gpt":0.26176634968466866,"score_spread":0.2475438962080195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281725275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011978971,0.00073270994,0.9610039,0.00060648395,0.0003273078,0.00028133846,0.00049781887,0.0029837287,0.021587709],"genre_scores_gemma":[0.59267074,0.0016485249,0.37709716,0.00044670596,0.00013571723,0.0006297804,0.0011079416,0.000419567,0.025843855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997341,0.000096810516,0.000012463521,0.00003324005,0.000085157924,0.000038140523],"domain_scores_gemma":[0.99977034,0.00008546139,0.00002476451,0.00003315855,0.000051769148,0.000034553304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051559706,0.0006212087,0.00033869565,0.0005848344,0.00043276098,0.00095149304,0.0012376551,0.00080928113,0.004170579],"category_scores_gemma":[0.0011600018,0.0001438305,0.00036056203,0.00059639785,0.0005172727,0.0010104188,0.0011968617,0.0008376621,0.0012595891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037267926,0.00022231213,0.0010895637,0.00042493784,0.0001247159,0.00065943005,0.00026544524,0.38331205,0.024150193,0.29836076,0.04109857,0.24991937],"study_design_scores_gemma":[0.000049764938,0.0001304377,0.00023087238,0.000049420818,0.00003562613,0.00025568018,0.000056839846,0.88599867,0.004922627,0.05818944,0.05003682,0.00004378317],"about_ca_topic_score_codex":0.003307994,"about_ca_topic_score_gemma":0.00391119,"teacher_disagreement_score":0.004170579,"about_ca_system_score_codex":0.00062042143,"about_ca_system_score_gemma":0.00096985267,"threshold_uncertainty_score":0.013951957},"labels":[],"label_agreement":null},{"id":"W4285123959","doi":"10.1109/tnsm.2022.3176365","title":"Introduction and Evaluation of Attachability for Mobile IoT Routing Protocols With Markov Chain Analysis","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Routing protocol; Network packet; Distributed computing; Link-state routing protocol; Dynamic Source Routing; Routing table; Markov chain; Source routing; Wireless Routing Protocol; Static routing; Routing (electronic design automation)","score_opus":0.01652014758513882,"score_gpt":0.26995615275737556,"score_spread":0.25343600517223674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285123959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087698415,0.001045359,0.90628004,0.00029110519,0.00007603788,0.00021474005,0.00024157598,0.0007184825,0.0034342604],"genre_scores_gemma":[0.88418746,0.0008713326,0.11332999,0.000064242246,0.00008150084,0.00027440742,0.0003953082,0.000088156616,0.00070772064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575764,0.0017971653,0.00027741847,0.0004641683,0.0014743108,0.0002293349],"domain_scores_gemma":[0.98036,0.013833968,0.0016787029,0.0018544787,0.0019744372,0.00029842753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055330233,0.001042328,0.00074008096,0.002139115,0.0006655263,0.0013000693,0.0009919207,0.0010534895,0.0010149282],"category_scores_gemma":[0.022579638,0.0005018722,0.0010555092,0.0014441623,0.0013247114,0.0024296956,0.0011634196,0.0013116515,0.00018281283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015048272,0.00009797684,0.009855021,0.00015740433,0.00011636225,0.00007994189,0.00014800821,0.8933094,0.00529302,0.043795522,0.00054489175,0.046451952],"study_design_scores_gemma":[0.000002763417,0.000064412445,0.00083159504,0.000016418835,0.000014715687,0.000029197257,0.000014454931,0.9906721,0.0011186808,0.0069291987,0.00029378207,0.000012793078],"about_ca_topic_score_codex":0.005462053,"about_ca_topic_score_gemma":0.0021221007,"teacher_disagreement_score":0.0055330233,"about_ca_system_score_codex":0.00240976,"about_ca_system_score_gemma":0.0015246405,"threshold_uncertainty_score":0.029261768},"labels":[],"label_agreement":null},{"id":"W42863969","doi":"10.1201/9781420040401.ch15","title":"Adaptive Routing in Ad Hoc Networks","year":2002,"lang":"en","type":"book-chapter","venue":"˜The œelectrical engineering handbook/Electrical engineering handbook series/Electrical engineering handbook","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Adaptive quality of service multi-hop routing; Computer science; Computer network; Wireless ad hoc network; Mobile ad hoc network; Routing (electronic design automation); Optimized Link State Routing Protocol; Routing protocol; Telecommunications; Network packet; Wireless","score_opus":0.007558845454273174,"score_gpt":0.1709345007159196,"score_spread":0.1633756552616464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42863969","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004058835,0.12394558,0.77794534,0.005938734,0.006906359,0.0007670403,0.00038643394,0.0033298936,0.076721735],"genre_scores_gemma":[0.19834343,0.20331292,0.51104635,0.003976125,0.009525792,0.0025164357,0.001992955,0.0006778791,0.06860813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998102,0.000596093,0.00013600942,0.00021616624,0.0008763512,0.000073456016],"domain_scores_gemma":[0.99866474,0.0006623211,0.00010783257,0.00017229821,0.0003300665,0.0000627106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011249797,0.001335409,0.0010535979,0.0014226983,0.00076555373,0.0026110467,0.0017787556,0.002355939,0.0049195033],"category_scores_gemma":[0.00360988,0.0005632484,0.00045927108,0.0030836307,0.0015154523,0.0030820316,0.0015631565,0.002422614,0.003580289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048363505,0.000076007855,0.0006305844,0.001607429,0.00008981325,0.0005439955,0.00036079463,0.046861384,0.003173838,0.28807148,0.05582131,0.602715],"study_design_scores_gemma":[0.00005751133,0.0001539102,0.0005862878,0.0006419962,0.00006333194,0.0011934355,0.0001853253,0.099821,0.001115676,0.29668802,0.5994045,0.000088980116],"about_ca_topic_score_codex":0.00094451016,"about_ca_topic_score_gemma":0.0006614963,"teacher_disagreement_score":0.0049195033,"about_ca_system_score_codex":0.0008568472,"about_ca_system_score_gemma":0.0009756716,"threshold_uncertainty_score":0.016457379},"labels":[],"label_agreement":null},{"id":"W4287178432","doi":"10.48550/arxiv.2105.10595","title":"Deterministic Size Discovery and Topology Recognition in Radio Networks with Short Labels","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Topology (electrical circuits); Node (physics); Network topology; Computer science; Graph; Binary logarithm; Construct (python library); Theoretical computer science; Algorithm; Computer network; Mathematics; Discrete mathematics; Combinatorics","score_opus":0.039508209675877475,"score_gpt":0.1801120257693895,"score_spread":0.14060381609351202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287178432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04222864,0.000269449,0.9524185,0.0009046903,0.00006970088,0.0001698271,0.00024627073,0.0011771715,0.002515749],"genre_scores_gemma":[0.39289528,0.0003130181,0.59872144,0.00042978095,0.00014887932,0.0005366348,0.0009631136,0.00032278287,0.0056691696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99464095,0.0015743987,0.0004372794,0.0015780643,0.0011453563,0.0006238967],"domain_scores_gemma":[0.9673884,0.019526783,0.004481273,0.0063423845,0.0013868267,0.00087430084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004194457,0.0009307625,0.0013927819,0.001208373,0.0018833509,0.0026625404,0.0031430048,0.0022897045,0.0032037667],"category_scores_gemma":[0.025224514,0.0009810728,0.0015611411,0.0019520387,0.0035857551,0.010320781,0.0039593186,0.0024519558,0.000785481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011914754,0.00024576418,0.003844514,0.00053819385,0.00007616197,0.00025153425,0.0011095413,0.4581643,0.015029187,0.34423912,0.0068994868,0.16841063],"study_design_scores_gemma":[0.00008330043,0.00017431629,0.00056129886,0.000049077422,0.000033454366,0.00024046382,0.0002094057,0.6713543,0.009018598,0.31128868,0.0069204327,0.000066645494],"about_ca_topic_score_codex":0.0019342235,"about_ca_topic_score_gemma":0.0018036478,"teacher_disagreement_score":0.004194457,"about_ca_system_score_codex":0.0032126294,"about_ca_system_score_gemma":0.002178727,"threshold_uncertainty_score":0.02330935},"labels":[],"label_agreement":null},{"id":"W4293595602","doi":"10.5383/juspn.07.01.003","title":"A Guard Node (GN) based Technique against Misbehaving Nodes in MANET","year":2016,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Guard (computer science); Network packet; Routing protocol; Mobile ad hoc network; Intrusion detection system; Node (physics); Overhead (engineering); Wireless ad hoc network; Computer security; Wireless; Engineering; Telecommunications","score_opus":0.01147508621031084,"score_gpt":0.22721665920873688,"score_spread":0.21574157299842603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293595602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32660112,0.005642632,0.65182096,0.0008208885,0.00064406317,0.000571296,0.00019150937,0.0051154024,0.008592126],"genre_scores_gemma":[0.92616296,0.00088183954,0.070286654,0.00023393947,0.000066988614,0.00010928851,0.00014462271,0.000036360692,0.0020772887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934405,0.00019347158,0.000062064166,0.00011528063,0.0002053969,0.00007971264],"domain_scores_gemma":[0.9979685,0.0005152431,0.0004261201,0.0004494737,0.00047173267,0.00016893484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000852899,0.0005013788,0.0005535307,0.0008935291,0.00084974547,0.00045748203,0.0015409105,0.00077138026,0.000655211],"category_scores_gemma":[0.0026942424,0.00019937447,0.00023558641,0.0004727967,0.00069889106,0.0012684314,0.0010481412,0.00053489296,0.0003261331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017181267,0.00042169285,0.015860716,0.0014550799,0.00020002185,0.001987131,0.0015965188,0.05469398,0.22226125,0.014518991,0.0063454737,0.678941],"study_design_scores_gemma":[0.00041392253,0.010100763,0.019204939,0.0004708578,0.00070306065,0.019134661,0.0015903049,0.56536174,0.30909678,0.01753262,0.05599419,0.0003961692],"about_ca_topic_score_codex":0.0013598489,"about_ca_topic_score_gemma":0.0014766346,"teacher_disagreement_score":0.0015409105,"about_ca_system_score_codex":0.00034246073,"about_ca_system_score_gemma":0.0007371215,"threshold_uncertainty_score":0.0045105815},"labels":[],"label_agreement":null},{"id":"W4294068673","doi":"10.1109/tnet.2022.3198331","title":"Distributed Stable Multisource Global Broadcast for SINR-Based Wireless Multihop Networks","year":2022,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Network packet; Computer science; Bounded function; Distributed algorithm; Computer network; Wireless network; Algorithm; Latency (audio); Wireless sensor network; Wireless; Distributed computing; Mathematics; Telecommunications","score_opus":0.021829212398229787,"score_gpt":0.2519617721337929,"score_spread":0.2301325597355631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294068673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01037402,0.00069801806,0.9843536,0.00030040342,0.000098128374,0.00006904398,0.00008051976,0.00018898584,0.0038374306],"genre_scores_gemma":[0.83604056,0.002420872,0.14841086,0.00042706565,0.00039444235,0.00050034496,0.0005723841,0.00026665613,0.010966768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918324,0.00027459604,0.000029383353,0.00017620363,0.00022241028,0.00011412835],"domain_scores_gemma":[0.99770975,0.0015792736,0.00023059893,0.00010422724,0.00028254272,0.00009354477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019466672,0.0013396153,0.0011760361,0.0007326559,0.000615968,0.0011980719,0.0016123925,0.0012626948,0.0028388856],"category_scores_gemma":[0.005656751,0.0004326977,0.0006758561,0.0010547021,0.0010077611,0.0014123914,0.0017032801,0.0013061657,0.00055983255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017749076,0.00005472371,0.00044844198,0.00032596395,0.000057422752,0.0001711326,0.00017448758,0.9197526,0.0032976274,0.040967453,0.004505676,0.030066956],"study_design_scores_gemma":[0.000022211138,0.000038861825,0.00007607761,0.000010958252,0.000014426485,0.000028541295,0.000031942185,0.9863549,0.0003811666,0.01232659,0.00070657703,0.000007769853],"about_ca_topic_score_codex":0.0028071483,"about_ca_topic_score_gemma":0.0026388378,"teacher_disagreement_score":0.0028388856,"about_ca_system_score_codex":0.0012364567,"about_ca_system_score_gemma":0.0011650154,"threshold_uncertainty_score":0.010295093},"labels":[],"label_agreement":null},{"id":"W4294766546","doi":"","title":"Efficient gathering in radio grids with interference","year":2005,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Interference (communication); Co-channel interference; Electromagnetic interference; Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.012919361375856402,"score_gpt":0.22770997867414589,"score_spread":0.2147906172982895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294766546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12565097,0.000944612,0.8616452,0.0006021408,0.0000794223,0.00013231201,0.00012149207,0.0006194645,0.010204384],"genre_scores_gemma":[0.8720298,0.00084292324,0.12265988,0.00014570431,0.00006564783,0.00019921552,0.0001851383,0.00010916755,0.0037624808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987394,0.0004900118,0.000058565493,0.00019090316,0.0002583023,0.00026273102],"domain_scores_gemma":[0.9955087,0.003048972,0.0005282869,0.00053180056,0.00021906086,0.00016319948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013251588,0.00088306144,0.0011179993,0.00060081686,0.00092228426,0.0012604119,0.0014603637,0.0007286414,0.0016175259],"category_scores_gemma":[0.004792899,0.00066746806,0.0005314063,0.00102757,0.0015541746,0.0023411724,0.002559725,0.00079873216,0.0004887748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028612328,0.00007296446,0.0008896041,0.00020593067,0.000059662878,0.00025809673,0.00027322758,0.90373534,0.0063210223,0.062222302,0.0022251906,0.023450598],"study_design_scores_gemma":[0.000059976333,0.000113906084,0.00024680913,0.000015697398,0.0000139833155,0.00012869613,0.00012292643,0.9452807,0.0026120215,0.048804816,0.0025854649,0.000015116079],"about_ca_topic_score_codex":0.0016472944,"about_ca_topic_score_gemma":0.0009633542,"teacher_disagreement_score":0.0016472944,"about_ca_system_score_codex":0.0009373208,"about_ca_system_score_gemma":0.0005039095,"threshold_uncertainty_score":0.007008195},"labels":[],"label_agreement":null},{"id":"W4295987301","doi":"","title":"A statistical detection mechanism for node misbehaviours in wireless mesh networks","year":2019,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Musée de la Civilisation","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Node (physics); Mechanism (biology); Wireless network; Wireless; Distributed computing; Telecommunications; Engineering; Physics","score_opus":0.008691836456776812,"score_gpt":0.2195219143658739,"score_spread":0.21083007790909708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295987301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029595526,0.0002163202,0.96711195,0.00029995534,0.00013097006,0.00014358058,0.00007446539,0.0016108786,0.00081634853],"genre_scores_gemma":[0.8457263,0.00021632116,0.15075237,0.00029884907,0.00037601255,0.00030173734,0.0001642085,0.00016458149,0.0019996213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925033,0.0023791038,0.0007126847,0.0008470167,0.0030214202,0.00053643057],"domain_scores_gemma":[0.9240623,0.046292268,0.007368854,0.010725004,0.010387965,0.0011635682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01176966,0.0008423377,0.0013992524,0.0037471417,0.0014572996,0.002025979,0.0037839473,0.0018455946,0.0014534717],"category_scores_gemma":[0.05715572,0.0009401701,0.00062928314,0.001972086,0.0017193698,0.004076719,0.0034622338,0.0018488378,0.0005607373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019698134,0.00093257765,0.01904335,0.00041301464,0.00043440957,0.00064203376,0.0008688195,0.2601783,0.07042737,0.090873174,0.006601309,0.54761577],"study_design_scores_gemma":[0.0000366344,0.0002852588,0.0010765791,0.000018280858,0.000060011662,0.0002794734,0.00005706052,0.97253925,0.009439391,0.0150316395,0.0011218854,0.000054547836],"about_ca_topic_score_codex":0.0010643997,"about_ca_topic_score_gemma":0.0013823411,"teacher_disagreement_score":0.01176966,"about_ca_system_score_codex":0.0016913232,"about_ca_system_score_gemma":0.001990814,"threshold_uncertainty_score":0.062244713},"labels":[],"label_agreement":null},{"id":"W4297833080","doi":"","title":"Energy and Throughput Optimization of Wireless Mesh Network with Continuous Power Control","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Throughput; Wireless mesh network; Power control; Computer science; Computer network; Power (physics); Energy (signal processing); Wireless network; Control (management); Wireless; Telecommunications; Mathematics; Physics","score_opus":0.005593130140008297,"score_gpt":0.18912426609769312,"score_spread":0.18353113595768483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297833080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1497771,0.0014781598,0.83695245,0.0008788948,0.0000666329,0.000043704465,0.0001507352,0.00012756801,0.010524704],"genre_scores_gemma":[0.9764109,0.00047433248,0.02051566,0.00004484921,0.000037299138,0.000045810742,0.00004019552,0.000029833933,0.0024011661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975866,0.0001131864,0.0000061692294,0.000031982614,0.000051368417,0.00003862961],"domain_scores_gemma":[0.9995988,0.00027685848,0.000050297593,0.000016993521,0.00004207169,0.000015022269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007389023,0.0005120897,0.00042464488,0.0003318226,0.00018399762,0.00071505556,0.00046306927,0.00050152646,0.0008666183],"category_scores_gemma":[0.0014941585,0.00020945507,0.0002726577,0.0004436674,0.00048146772,0.0006899409,0.0004670232,0.0003800383,0.00009106461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045311663,0.000018422108,0.00030764335,0.000043106917,0.000015166337,0.000046277062,0.000020660964,0.9773974,0.0026857888,0.012407709,0.00042622938,0.0065862853],"study_design_scores_gemma":[0.0000021679407,0.000013395872,0.00006553657,0.0000015468711,0.0000021935186,0.0000046018595,0.0000046528507,0.9966754,0.00022328564,0.0029087535,0.00009716468,0.0000012590841],"about_ca_topic_score_codex":0.0012224313,"about_ca_topic_score_gemma":0.00081136014,"teacher_disagreement_score":0.0012224313,"about_ca_system_score_codex":0.00077469484,"about_ca_system_score_gemma":0.00040335656,"threshold_uncertainty_score":0.005620837},"labels":[],"label_agreement":null},{"id":"W4297913661","doi":"10.5383/juspn.07.01.002","title":"Comparison and Analysis Study between AODV and DSR Routing Protocols in VANET with IEEE 802.11","year":2016,"lang":"en","type":"article","venue":"Journal of Ubiquitous Systems and Pervasive Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ad hoc On-Demand Distance Vector Routing; Computer network; Computer science; Vehicular ad hoc network; Destination-Sequenced Distance Vector routing; Dynamic Source Routing; Mobile ad hoc network; Optimized Link State Routing Protocol; Distance-vector routing protocol; Routing protocol; Wireless ad hoc network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.02934762940618573,"score_gpt":0.30029803509186825,"score_spread":0.2709504056856825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297913661","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80605143,0.034793716,0.11950237,0.0014068373,0.0012160719,0.0004977562,0.0014009397,0.0012855781,0.03384528],"genre_scores_gemma":[0.97489196,0.0052413545,0.015260145,0.00009757168,0.00013267747,0.00011392075,0.0010570674,0.00008057271,0.0031247095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996396,0.00080534804,0.0002903508,0.00035798433,0.0018261101,0.000324229],"domain_scores_gemma":[0.99093294,0.0050560012,0.00081072794,0.00043555244,0.0026181317,0.000146694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027385342,0.00078689767,0.0007268854,0.0026698653,0.0005990606,0.0013549009,0.00091166684,0.0005759024,0.001072859],"category_scores_gemma":[0.008540559,0.00019223703,0.0006018396,0.002622702,0.0004085425,0.0024866846,0.00042349097,0.00061705156,0.00022624769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024520536,0.0010229135,0.045487113,0.0028035464,0.0010121708,0.001228657,0.0007797583,0.36081958,0.026468035,0.028026616,0.013358551,0.51654106],"study_design_scores_gemma":[0.00008199254,0.004696948,0.04296127,0.0002274135,0.00085535453,0.0024587375,0.002413431,0.88396925,0.028976936,0.0068696607,0.02628186,0.00020713246],"about_ca_topic_score_codex":0.0033708678,"about_ca_topic_score_gemma":0.002827891,"teacher_disagreement_score":0.0033708678,"about_ca_system_score_codex":0.001304498,"about_ca_system_score_gemma":0.0007834444,"threshold_uncertainty_score":0.014482915},"labels":[],"label_agreement":null},{"id":"W4300673300","doi":"","title":"Managing rescue and relief operations using wireless mobile ad hoc technology, the best way?","year":2009,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Wireless ad hoc network; Computer science; Wireless; Computer network; Mobile ad hoc network; Computer security; Telecommunications","score_opus":0.01041811884796627,"score_gpt":0.23026867998369438,"score_spread":0.2198505611357281,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300673300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07777698,0.14551832,0.33144003,0.26534462,0.0208151,0.00058294646,0.0005707901,0.0014408187,0.15651041],"genre_scores_gemma":[0.73853797,0.096808486,0.07402179,0.011899299,0.012867676,0.00037211864,0.000504944,0.00016488682,0.06482287],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987962,0.00033718272,0.0001032249,0.00012313528,0.00035573842,0.0002844179],"domain_scores_gemma":[0.9974796,0.0006078041,0.0004905483,0.00010571685,0.0008424175,0.00047388853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155736,0.0011085576,0.0012630348,0.000731715,0.0010534483,0.006885186,0.0021414745,0.005397131,0.011726665],"category_scores_gemma":[0.004800151,0.00035251034,0.00034079174,0.00090755837,0.001121559,0.00971469,0.0017413857,0.0014285804,0.003632768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004808356,0.0003356583,0.0057920692,0.0031733743,0.00026134314,0.0009644867,0.0007593217,0.0329645,0.01798377,0.044070713,0.114678554,0.7785353],"study_design_scores_gemma":[0.0002520395,0.0019322594,0.01014171,0.0032334162,0.00051954424,0.0027407003,0.033163738,0.1343251,0.008294087,0.11846121,0.68658715,0.00034905062],"about_ca_topic_score_codex":0.0009991266,"about_ca_topic_score_gemma":0.0024350502,"teacher_disagreement_score":0.011726665,"about_ca_system_score_codex":0.00046767676,"about_ca_system_score_gemma":0.0013474206,"threshold_uncertainty_score":0.03922963},"labels":[],"label_agreement":null},{"id":"W4301736607","doi":"","title":"Graph-based wormhole attack detection in mobile ad hoc networks (MANETs)","year":2018,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mobile ad hoc network; Computer science; Wireless ad hoc network; Computer network; Vehicular ad hoc network; Wormhole; Wireless; Telecommunications; Physics","score_opus":0.0100655951093091,"score_gpt":0.22316278606652432,"score_spread":0.21309719095721522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301736607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42652455,0.001668535,0.5649879,0.00060366024,0.0002504701,0.00026149547,0.0003447286,0.0018808221,0.0034778358],"genre_scores_gemma":[0.94406825,0.0005498202,0.053848136,0.000066651985,0.000050720857,0.00003753453,0.00024242589,0.000031208667,0.0011051741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926287,0.00020923693,0.000040716757,0.00011631137,0.00029241457,0.000078364836],"domain_scores_gemma":[0.9969247,0.0016746196,0.00041055251,0.0002142956,0.00064163515,0.00013416109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066586095,0.00050329836,0.0007719881,0.002360194,0.00039213782,0.0006777043,0.0007713524,0.0008033656,0.0006713552],"category_scores_gemma":[0.004032039,0.00023396043,0.00033801567,0.0013347523,0.00047978034,0.0012309004,0.0007886296,0.0005055233,0.00018892963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013349261,0.0004971087,0.020497758,0.00058498024,0.00035019286,0.00061717385,0.00025210794,0.46794564,0.06643166,0.013488823,0.0057083466,0.42229134],"study_design_scores_gemma":[0.000011742298,0.00015266656,0.0023288976,0.000008908865,0.000028845514,0.00017388839,0.000047080142,0.9874321,0.0061618844,0.0030587087,0.0005825365,0.000012751166],"about_ca_topic_score_codex":0.0018436181,"about_ca_topic_score_gemma":0.0020006523,"teacher_disagreement_score":0.002360194,"about_ca_system_score_codex":0.0004178173,"about_ca_system_score_gemma":0.00039609912,"threshold_uncertainty_score":0.0036658049},"labels":[],"label_agreement":null},{"id":"W4307101766","doi":"10.3233/mis-2010-0102","title":"An Enhanced MPR-Based Solution for Flooding of Broadcast Messages in OLSR Wireless ad hoc Networks","year":2010,"lang":"en","type":"article","venue":"DOAJ (DOAJ: Directory of Open Access Journals)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Flooding (psychology); Wireless ad hoc network; Optimized Link State Routing Protocol; Computer network; Computer science; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless; Distributed computing; Telecommunications; Psychology; Network packet","score_opus":0.11930623965937583,"score_gpt":0.4905571229994962,"score_spread":0.3712508833401204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307101766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025769636,0.00048093032,0.970812,0.00020345277,0.000070893606,0.00014746863,0.00003142527,0.000608316,0.0018757817],"genre_scores_gemma":[0.45387086,0.00045393704,0.5407729,0.00015647915,0.00012505968,0.00018647563,0.0001016443,0.00006390184,0.004268818],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993772,0.00019445209,0.000045341978,0.00008138891,0.0002474277,0.00005413574],"domain_scores_gemma":[0.9994779,0.00014655043,0.00008943042,0.00008576113,0.00017768441,0.000022636877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007083859,0.00050844526,0.0007090563,0.00069646194,0.00043528707,0.00048729198,0.0014409813,0.0008976233,0.00073442515],"category_scores_gemma":[0.0018452678,0.00022079005,0.0003923061,0.00041363973,0.00029807468,0.00095015357,0.00084505574,0.00055993424,0.00033889493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005286615,0.00027566927,0.0009624106,0.00055052654,0.00018141628,0.00095039204,0.000501272,0.3316963,0.14368281,0.0378496,0.004261172,0.4785597],"study_design_scores_gemma":[0.000050398456,0.00037689527,0.00031891925,0.000017998593,0.00006615554,0.00052280084,0.0000553918,0.9717932,0.016678754,0.0037345313,0.006350135,0.000034831242],"about_ca_topic_score_codex":0.0006510786,"about_ca_topic_score_gemma":0.0009895463,"teacher_disagreement_score":0.0014409813,"about_ca_system_score_codex":0.00029454601,"about_ca_system_score_gemma":0.0004981086,"threshold_uncertainty_score":0.0037463307},"labels":[],"label_agreement":null},{"id":"W4307551212","doi":"10.3390/electronics11213480","title":"EBR: Routing Protocol to Detect Blackhole Attacks in Mobile Ad Hoc Networks","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer network; Computer science; Packet drop attack; Mobile ad hoc network; Network packet; Routing protocol; End-to-end delay; Optimized Link State Routing Protocol; Wireless ad hoc network; Throughput; Overhead (engineering); Computer security; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.008149998371202205,"score_gpt":0.2609300830715267,"score_spread":0.2527800847003245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307551212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02734379,0.0028386288,0.950742,0.00065051083,0.0006584613,0.0012086174,0.0002573079,0.008904874,0.0073958496],"genre_scores_gemma":[0.52666306,0.0026957416,0.45649618,0.00097384903,0.00031830158,0.0019568144,0.0011406811,0.0005493541,0.009205972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980567,0.00059932866,0.0002327861,0.00023513107,0.00070197374,0.00017396142],"domain_scores_gemma":[0.9977584,0.000733896,0.00040650959,0.00044932036,0.0005610193,0.00009081971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019738993,0.0010699033,0.001087361,0.0017176421,0.0007712914,0.0010114855,0.001983756,0.0016697644,0.0017054221],"category_scores_gemma":[0.004580064,0.0003799235,0.0005843471,0.0009217484,0.0007754018,0.0031468766,0.0015553901,0.0014419903,0.0010539427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014731267,0.0007200463,0.003721149,0.002724578,0.000685177,0.0033833368,0.001133964,0.12612128,0.16838701,0.10094433,0.03545892,0.55524707],"study_design_scores_gemma":[0.00071246433,0.002315029,0.0018476719,0.0003966605,0.00038951315,0.005191612,0.0003256991,0.7395339,0.11214725,0.040574163,0.09619705,0.0003690394],"about_ca_topic_score_codex":0.00038486053,"about_ca_topic_score_gemma":0.00035204404,"teacher_disagreement_score":0.001983756,"about_ca_system_score_codex":0.00039001764,"about_ca_system_score_gemma":0.00084507756,"threshold_uncertainty_score":0.010439098},"labels":[],"label_agreement":null},{"id":"W4310183448","doi":"10.18280/isi.270508","title":"A Neighbor Trust Weight Based Cryptography for Multi Key Distribution for Improving Quality of Service in MANETS","year":2022,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Key management; Mobile ad hoc network; Key distribution; Key (lock); Routing protocol; Encryption; Distributed computing; Key generation; Computer security; Public-key cryptography; Routing (electronic design automation); Network packet","score_opus":0.023511607986114607,"score_gpt":0.2582200180666555,"score_spread":0.2347084100805409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310183448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0146572245,0.00220423,0.9751297,0.00035697717,0.0002355884,0.00012792606,0.000035079862,0.00046581114,0.0067873825],"genre_scores_gemma":[0.75355494,0.003372218,0.22931372,0.00035206703,0.000241089,0.00024216052,0.00019572322,0.00009336136,0.012634824],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889356,0.00031978945,0.000053373067,0.00016065968,0.00048747772,0.00008513324],"domain_scores_gemma":[0.9993987,0.00011927505,0.0000670034,0.0001542189,0.00022844803,0.000032314543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007735117,0.00042295214,0.00047905263,0.00069096935,0.00060508295,0.0009768761,0.0011186188,0.00061578344,0.0021052393],"category_scores_gemma":[0.0021163176,0.00015649559,0.0005026473,0.0010854081,0.000565708,0.0028194285,0.0009856485,0.0008027232,0.0008378868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092844,0.00025909327,0.0016283622,0.00050331216,0.00013599636,0.00035148062,0.00038039198,0.11827473,0.06134996,0.2850963,0.01227373,0.51923734],"study_design_scores_gemma":[0.000086369386,0.00048418762,0.0004886867,0.00007361389,0.00008801132,0.00076103414,0.00010796132,0.9067454,0.020861799,0.032107104,0.0381134,0.00008240355],"about_ca_topic_score_codex":0.0012299025,"about_ca_topic_score_gemma":0.0011112145,"teacher_disagreement_score":0.0021052393,"about_ca_system_score_codex":0.0011120463,"about_ca_system_score_gemma":0.00092554535,"threshold_uncertainty_score":0.008068502},"labels":[],"label_agreement":null},{"id":"W4312500313","doi":"10.1109/access.2022.3230991","title":"Adaptive Routing Protocol in Mobile Ad-Hoc Networks Using Genetic Algorithm","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Wireless Routing Protocol; Optimized Link State Routing Protocol; Computer network; Wireless ad hoc network; Mobile ad hoc network; Ad hoc wireless distribution service; Adaptive quality of service multi-hop routing; Routing protocol; Zone Routing Protocol; Dynamic Source Routing; Destination-Sequenced Distance Vector routing; Link-state routing protocol; Distributed computing; Algorithm; Routing (electronic design automation); Wireless; Telecommunications; Network packet","score_opus":0.033769558318487616,"score_gpt":0.313624816977331,"score_spread":0.2798552586588434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312500313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011252657,0.0016497122,0.9809671,0.00022635957,0.00011054833,0.00019871903,0.000048930215,0.000733177,0.004812857],"genre_scores_gemma":[0.29865983,0.0035039878,0.6916892,0.00021979799,0.000105875915,0.0008255244,0.00024613988,0.00008595592,0.0046637193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950945,0.00019610878,0.0000291917,0.000061004797,0.00017301756,0.000031267093],"domain_scores_gemma":[0.999713,0.00013856664,0.000038782764,0.00002549395,0.00007227727,0.000012000037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006009414,0.00055133714,0.00065962656,0.00075024064,0.00045101217,0.0007816428,0.0010283726,0.0008023454,0.0005690549],"category_scores_gemma":[0.0011539151,0.00020851319,0.0004900717,0.0012715595,0.0005759735,0.0007352774,0.0005245406,0.00084108376,0.00026488912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052609445,0.0001139685,0.0012473193,0.00024040128,0.00013385707,0.00024282091,0.00014167669,0.77951676,0.012487774,0.031257696,0.002240014,0.17232516],"study_design_scores_gemma":[0.00004548236,0.00014786853,0.00043507502,0.000053215157,0.00004915134,0.00022336213,0.00004600454,0.96689403,0.0030591146,0.018453294,0.0105572315,0.00003618708],"about_ca_topic_score_codex":0.0031845097,"about_ca_topic_score_gemma":0.0021361,"teacher_disagreement_score":0.0031845097,"about_ca_system_score_codex":0.0005576967,"about_ca_system_score_gemma":0.0008515741,"threshold_uncertainty_score":0.0063319206},"labels":[],"label_agreement":null},{"id":"W4313287259","doi":"10.14209/its.2002.678","title":"Enhancing Service Discovery in ad hoc communications","year":2002,"lang":"en","type":"article","venue":"Anais do 2002 International Telecommunications Symposium","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Wireless ad hoc network; Service discovery; Service (business); Computer network; Telecommunications; World Wide Web; Web service; Wireless; Business","score_opus":0.02307876714694211,"score_gpt":0.26481189805077543,"score_spread":0.2417331309038333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313287259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016670357,0.00554525,0.9376188,0.0017177663,0.0004471836,0.0002651353,0.000043247284,0.0011299021,0.036562372],"genre_scores_gemma":[0.33376193,0.009391043,0.6328563,0.00070707954,0.000577055,0.00043565707,0.00026799334,0.00023789403,0.021765029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953177,0.0017395841,0.00025357297,0.00031230305,0.002036936,0.00034001554],"domain_scores_gemma":[0.99491715,0.0031717576,0.00020743681,0.0007301863,0.00080381916,0.00016969991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004164974,0.0007309654,0.00091124006,0.0021846031,0.0017074733,0.0031529914,0.001620413,0.0018363206,0.0025457756],"category_scores_gemma":[0.010354192,0.0005115533,0.0005596992,0.0029025008,0.00202931,0.0071572466,0.003409657,0.0015459954,0.0015663629],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021635625,0.0002227279,0.0011533384,0.00063353777,0.000051728435,0.0004988671,0.0012374163,0.029799264,0.012061701,0.56428283,0.0062026433,0.38363954],"study_design_scores_gemma":[0.000103249346,0.00027282964,0.0004422056,0.00021432541,0.000105681705,0.0013266794,0.0006717798,0.30748963,0.022359215,0.44672436,0.2202091,0.00008093815],"about_ca_topic_score_codex":0.001882804,"about_ca_topic_score_gemma":0.0014398037,"teacher_disagreement_score":0.004164974,"about_ca_system_score_codex":0.0013615323,"about_ca_system_score_gemma":0.0014490375,"threshold_uncertainty_score":0.022026777},"labels":[],"label_agreement":null},{"id":"W4316076805","doi":"10.1109/ictacse50438.2022.10009849","title":"Offering New Routing Method in Ad hoc Networks using Ant Colony Algorithm","year":2022,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Ant colony optimization algorithms; Destination-Sequenced Distance Vector routing; Wireless ad hoc network; Latency (audio); Adaptive quality of service multi-hop routing; Optimized Link State Routing Protocol; Mobile ad hoc network; Distributed computing; Algorithm; Routing (electronic design automation); Routing protocol; Link-state routing protocol; Wireless; Telecommunications","score_opus":0.02442801431245013,"score_gpt":0.28111462088881284,"score_spread":0.2566866065763627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316076805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010744508,0.0031774838,0.9760282,0.000503743,0.0004800029,0.00018124512,0.00004886341,0.00093946944,0.007896477],"genre_scores_gemma":[0.24098903,0.0057595093,0.7360371,0.0003566362,0.00036433223,0.00036363726,0.00024124264,0.00016891895,0.015719727],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994856,0.00011661455,0.000031624855,0.000084899686,0.0002537645,0.00002750806],"domain_scores_gemma":[0.99969876,0.00009194043,0.00003120235,0.000034982917,0.000123463,0.00001970593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038827502,0.0004814902,0.0005571247,0.0008316982,0.0005763881,0.0010779015,0.0009803664,0.00089678075,0.0013810628],"category_scores_gemma":[0.0009459543,0.00024464066,0.00046912604,0.0008331505,0.0003467311,0.0015461132,0.0004895257,0.00069316966,0.0005432708],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113689515,0.00022129473,0.0018627271,0.0009840138,0.00020787843,0.00047216742,0.00032165996,0.17759013,0.04455001,0.055808928,0.012637355,0.70523006],"study_design_scores_gemma":[0.0000973538,0.00039773586,0.0007971698,0.000104278966,0.00011697606,0.0012799161,0.00016567089,0.87387407,0.016031757,0.024268936,0.08278574,0.00008038673],"about_ca_topic_score_codex":0.0011410828,"about_ca_topic_score_gemma":0.0012253346,"teacher_disagreement_score":0.0013810628,"about_ca_system_score_codex":0.0003173487,"about_ca_system_score_gemma":0.00056970096,"threshold_uncertainty_score":0.004620135},"labels":[],"label_agreement":null},{"id":"W4366829273","doi":"10.3390/electronics12091956","title":"A Survey on Parameters Affecting MANET Performance","year":2023,"lang":"en","type":"article","venue":"Electronics","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University of Edmonton","funders":"","keywords":"Mobile ad hoc network; Routing protocol; Computer science; Computer network; Network packet; Flexibility (engineering); Wireless ad hoc network; Network simulation; Network performance; Optimized Link State Routing Protocol; Routing (electronic design automation); Wireless network; Protocol (science); Wireless; Distributed computing; Telecommunications","score_opus":0.020232639222136296,"score_gpt":0.24645859213305302,"score_spread":0.2262259529109167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366829273","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05572075,0.7741779,0.07797651,0.0023475722,0.0026652822,0.00045047814,0.0036332333,0.0020351158,0.080993176],"genre_scores_gemma":[0.29356244,0.65590817,0.02722528,0.0011424178,0.001688471,0.00032503525,0.006010338,0.0005157768,0.013622004],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976407,0.0004942653,0.00028332506,0.00033094882,0.0010301231,0.00022066811],"domain_scores_gemma":[0.9930657,0.0044192183,0.00050398445,0.00034211928,0.0015440445,0.00012492698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018479518,0.001622336,0.0012989233,0.00390451,0.00069178606,0.0023470693,0.0016243521,0.0011705757,0.00592117],"category_scores_gemma":[0.010027657,0.0005665589,0.00080143724,0.006601901,0.00044444055,0.0034865078,0.00079590885,0.0008499216,0.0031755508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045865512,0.00019606252,0.013993142,0.013063925,0.00022959993,0.00053986325,0.00030790947,0.031172158,0.0072447327,0.0111608235,0.038172714,0.88346034],"study_design_scores_gemma":[0.00003878827,0.001747796,0.02190402,0.006830093,0.00096186734,0.004785678,0.001922537,0.051301256,0.027071388,0.013953343,0.86904866,0.00043452592],"about_ca_topic_score_codex":0.0015684383,"about_ca_topic_score_gemma":0.0011433086,"teacher_disagreement_score":0.00592117,"about_ca_system_score_codex":0.0007888794,"about_ca_system_score_gemma":0.0009001212,"threshold_uncertainty_score":0.019808233},"labels":[],"label_agreement":null},{"id":"W43763161","doi":"","title":"Zone-Based Intrusion Detection for Mobile Ad Hoc Networks.","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Intrusion detection system; Mobile ad hoc network; Computer network; Anomaly detection; Wireless ad hoc network; Markov chain; Default gateway; Routing protocol; Distributed computing; Data mining; Routing (electronic design automation); Machine learning; Network packet; Wireless; Telecommunications","score_opus":0.006354875222979212,"score_gpt":0.2142338136906757,"score_spread":0.2078789384676965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W43763161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01390208,0.00092961855,0.983401,0.00011301055,0.00005569419,0.00007044838,0.00003852761,0.000767707,0.00072200637],"genre_scores_gemma":[0.6018515,0.0016734644,0.3937804,0.000092679744,0.00008621008,0.00020205922,0.000268561,0.000052636078,0.0019923586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920005,0.00027950946,0.00004978769,0.0001067093,0.0003149018,0.000049077127],"domain_scores_gemma":[0.9987244,0.0007788044,0.00012785832,0.00015789074,0.00017438454,0.000036641915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095711555,0.0004943115,0.00053221587,0.0008539553,0.00040204462,0.0008002918,0.0010075432,0.00039570848,0.0007340809],"category_scores_gemma":[0.0043230415,0.00025885008,0.00043593778,0.0006634444,0.00043828244,0.0013054762,0.0008590954,0.0006282269,0.0003346944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041682276,0.0001011106,0.0058932654,0.00024579896,0.00016884206,0.00015384889,0.00018827592,0.47638953,0.022725325,0.051998682,0.0035456032,0.43817282],"study_design_scores_gemma":[0.0000064531455,0.00006689709,0.0003639349,0.000007627879,0.000014183206,0.000071590934,0.00002109508,0.98791075,0.0032018118,0.006304543,0.0020207579,0.0000103538205],"about_ca_topic_score_codex":0.0019912925,"about_ca_topic_score_gemma":0.0022036594,"teacher_disagreement_score":0.0019912925,"about_ca_system_score_codex":0.00068353885,"about_ca_system_score_gemma":0.00060152484,"threshold_uncertainty_score":0.0050618052},"labels":[],"label_agreement":null},{"id":"W4379180570","doi":"10.1109/access.2023.3277817","title":"A Novel Cross-Layer Adaptive Fuzzy-Based Ad Hoc On-Demand Distance Vector Routing Protocol for MANETs","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; University of Guelph","keywords":"Computer science; Computer network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Distance-vector routing protocol; Mobile ad hoc network; Wireless ad hoc network; Routing protocol; Zone Routing Protocol; Wireless Routing Protocol; Ad hoc On-Demand Distance Vector Routing; Routing (electronic design automation); Distributed computing; Wireless; Telecommunications","score_opus":0.08550856062078675,"score_gpt":0.37600590958701213,"score_spread":0.29049734896622537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379180570","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029190015,0.00087264995,0.9636046,0.00026311583,0.00024350901,0.00015561987,0.00008208948,0.00043858762,0.0051497524],"genre_scores_gemma":[0.75365806,0.0009854111,0.23856679,0.00027095678,0.00007355418,0.00022508224,0.00023307088,0.000024505287,0.0059625814],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997594,0.000038248723,0.000019237417,0.000045749966,0.00011495191,0.00002239397],"domain_scores_gemma":[0.99986374,0.000031484073,0.00001844214,0.000010168675,0.00006600317,0.000010068683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026992915,0.00035586974,0.0003539712,0.00033914833,0.0003520177,0.0004863286,0.0011326455,0.0004786008,0.0006862195],"category_scores_gemma":[0.00048117293,0.0001212585,0.00033502068,0.00030613624,0.0002001302,0.00061579637,0.00039375026,0.00047916453,0.00016245006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026054346,0.00029633567,0.0020289405,0.0005372756,0.00020556191,0.000980914,0.00031629868,0.4044821,0.09213675,0.03950535,0.0072692977,0.45198065],"study_design_scores_gemma":[0.00003036327,0.0002599074,0.00041065423,0.000015776131,0.000039531325,0.00038206068,0.00004328557,0.9802171,0.006039696,0.003945703,0.008586276,0.000029555997],"about_ca_topic_score_codex":0.002770851,"about_ca_topic_score_gemma":0.0039478266,"teacher_disagreement_score":0.002770851,"about_ca_system_score_codex":0.00035073073,"about_ca_system_score_gemma":0.0005619989,"threshold_uncertainty_score":0.005509436},"labels":[],"label_agreement":null},{"id":"W4385214689","doi":"10.1109/tvt.2023.3298514","title":"Dual Wireless Anti-Interception for Ground Combat Vehicles","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Interception; Tactical communications; Reinforcement learning; Computer science; Wireless; Throughput; Context (archaeology); Selection (genetic algorithm); Mathematical optimization; Adversary; Wireless network; Dual (grammatical number); Convex optimization; Engineering; Computer network; Regular polygon; Artificial intelligence; Telecommunications; Computer security","score_opus":0.01648832129887284,"score_gpt":0.25124715457962443,"score_spread":0.2347588332807516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385214689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11512961,0.0005815262,0.8780956,0.00041383484,0.00007550737,0.000036206242,0.000024577654,0.00028580718,0.0053572548],"genre_scores_gemma":[0.9787708,0.00012589796,0.018963706,0.000045352408,0.000012940556,0.000024396077,0.000017991213,0.000011961097,0.0020269055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998293,0.0000451843,0.000004011517,0.000032075262,0.000041318854,0.000048040078],"domain_scores_gemma":[0.9996636,0.00015498839,0.00006490854,0.000019748019,0.000058116984,0.000038615362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034944707,0.0004864021,0.00041280265,0.00024863964,0.00029448312,0.00045251768,0.00057762937,0.0004286197,0.0011540458],"category_scores_gemma":[0.00095757126,0.00019570137,0.00021996073,0.00017883569,0.00045142916,0.00047544556,0.0007049409,0.0006453087,0.00018697357],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008342538,0.000037845784,0.00072706054,0.000029380843,0.00001456124,0.00006236633,0.0000269393,0.95728445,0.0038547409,0.0037617327,0.0006488543,0.03346862],"study_design_scores_gemma":[0.0000032264095,0.00002045866,0.000046489436,0.0000011681971,0.0000017490967,0.000006414903,0.000003691678,0.9990283,0.00024436484,0.00051724334,0.00012568486,0.0000012112278],"about_ca_topic_score_codex":0.0038424088,"about_ca_topic_score_gemma":0.0032875566,"teacher_disagreement_score":0.0038424088,"about_ca_system_score_codex":0.0005116106,"about_ca_system_score_gemma":0.0005936756,"threshold_uncertainty_score":0.0076401234},"labels":[],"label_agreement":null},{"id":"W4385269653","doi":"10.1109/wimob58348.2023.10187830","title":"A Review of AI-based MANET Routing Protocols","year":2023,"lang":"en","type":"review","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Computer science; Link-state routing protocol; Routing protocol; Distributed computing; Scalability; Computer network; Optimized Link State Routing Protocol; Mobile ad hoc network; Dynamic Source Routing; Static routing; Wireless Routing Protocol; Adaptive quality of service multi-hop routing; Policy-based routing; Routing (electronic design automation)","score_opus":0.10908280000671697,"score_gpt":0.4051500801979426,"score_spread":0.29606728019122563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385269653","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035844985,0.98323613,0.0046009547,0.0008803677,0.0009166021,0.00004775067,0.00010619723,0.00006889519,0.0097847],"genre_scores_gemma":[0.0016349467,0.9900192,0.0039999834,0.00046729099,0.00052072835,0.00005340059,0.00016514272,0.000015589962,0.0031237118],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995832,0.000052935982,0.00006447044,0.00006706903,0.00020219591,0.000030092944],"domain_scores_gemma":[0.99896264,0.0004988379,0.00008976838,0.000049051196,0.00035390296,0.00004578938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069854915,0.0011535464,0.0010015535,0.003069218,0.00054792746,0.0012806675,0.001605712,0.0014003136,0.005534469],"category_scores_gemma":[0.0018656133,0.0005836158,0.00058896403,0.0046270974,0.0005378172,0.0025142077,0.0007531895,0.0018767731,0.0053290096],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000358487,0.000106482636,0.00019387592,0.013730848,0.00006295448,0.00017414612,0.00009882242,0.001703654,0.0017167416,0.017313626,0.04801348,0.9168495],"study_design_scores_gemma":[0.0000053025256,0.0000707396,0.00026519218,0.0024103979,0.000050877625,0.0004964226,0.00004330283,0.0004823265,0.00050580606,0.004827913,0.9908187,0.000023011035],"about_ca_topic_score_codex":0.0014625404,"about_ca_topic_score_gemma":0.0014545732,"teacher_disagreement_score":0.005534469,"about_ca_system_score_codex":0.00075733155,"about_ca_system_score_gemma":0.0015391712,"threshold_uncertainty_score":0.018514633},"labels":[],"label_agreement":null},{"id":"W4385451814","doi":"10.1109/iccns58795.2023.10193472","title":"Routing Protocol in Mobile Ad Hoc Networks based on Energy Consumption","year":2023,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Optimized Link State Routing Protocol; Computer network; Wireless Routing Protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless ad hoc network; Energy consumption; Routing protocol; Adaptive quality of service multi-hop routing; Vehicular ad hoc network; Zone Routing Protocol; Routing (electronic design automation); Telecommunications; Engineering; Wireless; Electrical engineering","score_opus":0.019667752529806373,"score_gpt":0.2758506316491522,"score_spread":0.25618287911934584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385451814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02315897,0.034894034,0.8604101,0.0019844822,0.0018700978,0.0008429562,0.0004660603,0.0020225672,0.07435078],"genre_scores_gemma":[0.5561337,0.043310966,0.34290546,0.0010493221,0.0009939473,0.001607567,0.0011771636,0.0003400781,0.052481897],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999198,0.000188684,0.0000604481,0.00009123501,0.00041659057,0.000045192694],"domain_scores_gemma":[0.99956506,0.00015404876,0.000062682906,0.00005171313,0.00015026712,0.000016267944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054945407,0.00065479864,0.00064820575,0.0008686495,0.0005049004,0.0014326028,0.0011234323,0.00088201993,0.0016071406],"category_scores_gemma":[0.0014498658,0.00021309366,0.00036641958,0.0018313192,0.0005571773,0.0019792242,0.00060395396,0.00091221946,0.00090926175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017523185,0.00017284862,0.002829827,0.0016381515,0.00018765035,0.0008118712,0.00040232873,0.17519939,0.027887043,0.26983142,0.02148512,0.49937916],"study_design_scores_gemma":[0.00007824515,0.0006534311,0.0027724516,0.0006345193,0.00022035328,0.0026190593,0.0004438787,0.5771556,0.017732808,0.13301325,0.26447886,0.0001975104],"about_ca_topic_score_codex":0.00094035635,"about_ca_topic_score_gemma":0.0009873379,"teacher_disagreement_score":0.0016071406,"about_ca_system_score_codex":0.00066611136,"about_ca_system_score_gemma":0.0005959186,"threshold_uncertainty_score":0.005376458},"labels":[],"label_agreement":null},{"id":"W4388079009","doi":"10.1109/pimrc56721.2023.10293864","title":"Reliable Multicast Routing Protocol Based on Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Protocol Independent Multicast; Multicast; Reinforcement learning; Computer network; Distance Vector Multicast Routing Protocol; Routing protocol; Zone Routing Protocol; Routing (electronic design automation); Protocol (science); Reliable multicast; Pragmatic General Multicast; Distributed computing; Wireless Routing Protocol; Xcast; Artificial intelligence; Medicine","score_opus":0.021513276630206114,"score_gpt":0.2807536924757235,"score_spread":0.2592404158455174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388079009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033431906,0.00049849227,0.95857865,0.0003271122,0.00012669584,0.00016610348,0.000044819823,0.0011930321,0.0056332066],"genre_scores_gemma":[0.8472814,0.00037751131,0.14806923,0.00016770588,0.00006428856,0.000318697,0.00010768691,0.00004549764,0.0035679562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994722,0.00015882129,0.00002892006,0.000067012996,0.00021742962,0.000055647826],"domain_scores_gemma":[0.99945706,0.00019759545,0.00008750084,0.000053755026,0.0001660392,0.000037999154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006427131,0.0003648691,0.0005067511,0.00049358734,0.0005061453,0.00042710223,0.0010147899,0.0005135128,0.0008134763],"category_scores_gemma":[0.0013012901,0.00015253428,0.00033562217,0.00031623515,0.00034365087,0.00065524655,0.00059897185,0.00059652096,0.0001934471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036652957,0.00030372664,0.0026404758,0.00031360326,0.00019305019,0.0009852984,0.0003928525,0.5242157,0.0425528,0.06206829,0.006472063,0.35949558],"study_design_scores_gemma":[0.00006058744,0.00017482706,0.00034877672,0.00001062738,0.000025937961,0.00022212898,0.000023562048,0.9802741,0.004047008,0.010328991,0.004458649,0.00002492539],"about_ca_topic_score_codex":0.0013105252,"about_ca_topic_score_gemma":0.00094748806,"teacher_disagreement_score":0.0013105252,"about_ca_system_score_codex":0.0004739851,"about_ca_system_score_gemma":0.0005909889,"threshold_uncertainty_score":0.0034390688},"labels":[],"label_agreement":null},{"id":"W4391114523","doi":"10.1109/aikiie60097.2023.10390117","title":"Hybrid Cocky Search Algorithm with Hill Climb Approach for solving the Quality-of-Service Multicast Routing in MANET","year":2023,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Multicast; Routing (electronic design automation); Distributed computing; Tree traversal; Climb; Computer network; Algorithm; Engineering","score_opus":0.0567342516906006,"score_gpt":0.31122652725119376,"score_spread":0.2544922755605932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391114523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07237446,0.0016227468,0.9125415,0.00059689546,0.00019052124,0.00015068956,0.00011939617,0.00092900696,0.011474774],"genre_scores_gemma":[0.70431554,0.0008077384,0.2844098,0.00036101756,0.00008668954,0.00028023304,0.00030933155,0.0001812099,0.0092485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977416,0.000055558303,0.000011190164,0.0000418557,0.000060217684,0.000057010293],"domain_scores_gemma":[0.9997732,0.00008878235,0.000022269604,0.000015265468,0.0000689866,0.000031438616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039527888,0.0007232702,0.0012850283,0.0008114529,0.0009350896,0.00086122926,0.0013114512,0.0010943745,0.0024916336],"category_scores_gemma":[0.0007791143,0.0003832041,0.0006838578,0.00090437994,0.00043234392,0.000766284,0.0008072262,0.00070599775,0.00038107586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006873344,0.000067618734,0.001306836,0.00009252342,0.00007431112,0.00011870831,0.00007978398,0.9498233,0.0011792551,0.005817817,0.002970494,0.038400628],"study_design_scores_gemma":[0.000019834059,0.000023033244,0.00011170185,0.000005001424,0.0000065011513,0.000020169158,0.000019609342,0.99777836,0.00016181149,0.0012592233,0.00058973656,0.000004965352],"about_ca_topic_score_codex":0.017295247,"about_ca_topic_score_gemma":0.013496817,"teacher_disagreement_score":0.017295247,"about_ca_system_score_codex":0.0006607172,"about_ca_system_score_gemma":0.0016961746,"threshold_uncertainty_score":0.03438914},"labels":[],"label_agreement":null},{"id":"W4392153286","doi":"10.1109/globecom54140.2023.10436952","title":"Link-Weight Adjustment for Efficient Link-State Multicast Routing with MARL","year":2023,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec","funders":"","keywords":"Multicast; Link (geometry); Computer science; Computer network; Routing (electronic design automation); Protocol Independent Multicast; Xcast; Distributed computing","score_opus":0.015764975738537176,"score_gpt":0.24423549234310024,"score_spread":0.22847051660456308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392153286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020261621,0.00007946199,0.9774115,0.00015603653,0.000022958391,0.00005242604,0.000010872446,0.00035494266,0.0016502495],"genre_scores_gemma":[0.7931643,0.0000696994,0.204932,0.00014333804,0.000026658228,0.0001509226,0.00003545846,0.000054038566,0.0014235468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994493,0.00021629811,0.000024830755,0.00009165935,0.00013824306,0.00007978036],"domain_scores_gemma":[0.9991393,0.000343973,0.00021541,0.000082376995,0.00016366085,0.00005524868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013611101,0.0006050472,0.0006749726,0.000505544,0.00047377122,0.00060492667,0.001249281,0.0006579947,0.001028203],"category_scores_gemma":[0.0026438523,0.00033079323,0.00031241708,0.00029756612,0.00070472696,0.0008379371,0.0010058053,0.0009578505,0.00028741444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055330784,0.00013390798,0.00063228107,0.000042160937,0.000025151856,0.00007703884,0.000082306724,0.92361504,0.0069153863,0.009043782,0.0006991263,0.058678474],"study_design_scores_gemma":[0.000006182853,0.000021928898,0.000033429096,0.0000015512749,0.0000023471537,0.000007662479,0.000004197399,0.99813724,0.00042800285,0.0011451902,0.00020979703,0.0000024841388],"about_ca_topic_score_codex":0.002061009,"about_ca_topic_score_gemma":0.0027492335,"teacher_disagreement_score":0.002061009,"about_ca_system_score_codex":0.00081478857,"about_ca_system_score_gemma":0.0008563615,"threshold_uncertainty_score":0.0071983337},"labels":[],"label_agreement":null},{"id":"W4392173336","doi":"10.1007/978-3-031-54321-0_6","title":"Disaster-Resilient Messaging Using Dew Computing","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Dew; Computer science; World Wide Web; Physics; Meteorology","score_opus":0.03822010077535391,"score_gpt":0.30419927178543454,"score_spread":0.2659791710100806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392173336","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01726987,0.0034452623,0.7895986,0.0011034306,0.0018026225,0.0002550961,0.00031476602,0.0065546217,0.17965566],"genre_scores_gemma":[0.43054882,0.0050394223,0.28633696,0.0008299333,0.00066432473,0.00029897067,0.0010268937,0.0011873686,0.27406737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980575,0.000027232676,0.000010447155,0.00004009642,0.00008137335,0.00003503688],"domain_scores_gemma":[0.99971145,0.00007722039,0.00001527341,0.00011621642,0.00005687384,0.000022966029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025524796,0.0006478893,0.00039389427,0.00076823874,0.0007136216,0.0018732107,0.0014129127,0.0007443598,0.012313979],"category_scores_gemma":[0.00069247035,0.00030105116,0.00025330484,0.0009302479,0.00037639524,0.0024159693,0.0013780285,0.0010652844,0.00416796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020531478,0.00015683693,0.0004409922,0.00040041542,0.0000445353,0.00030909546,0.0003734778,0.026790587,0.04563898,0.1775811,0.072106734,0.6759519],"study_design_scores_gemma":[0.00004526522,0.00021266968,0.0008515821,0.0002050736,0.000059334776,0.0008515947,0.0004722821,0.3200687,0.044250745,0.13969076,0.49321136,0.00008056257],"about_ca_topic_score_codex":0.0007046873,"about_ca_topic_score_gemma":0.0011155375,"teacher_disagreement_score":0.012313979,"about_ca_system_score_codex":0.00037531674,"about_ca_system_score_gemma":0.00034276448,"threshold_uncertainty_score":0.04119438},"labels":[],"label_agreement":null},{"id":"W4392354631","doi":"10.18280/ria.380127","title":"A Reliable Transmission on Cluster Based Wireless Ad Hoc Network with Adaptive Negotiations Using Vector Assisted Energy Efficient Dynamic Opportunistic Routing Mechanism","year":2024,"lang":"en","type":"article","venue":"Revue d intelligence artificielle","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless Routing Protocol; Dynamic Source Routing; Distributed computing; Network packet; Wireless ad hoc network; Mobile ad hoc network; Optimized Link State Routing Protocol; Wireless; Telecommunications","score_opus":0.031122515829313403,"score_gpt":0.2520086851309922,"score_spread":0.22088616930167881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392354631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063307285,0.00047945685,0.9280641,0.00034593482,0.000114882154,0.00013635686,0.000040036386,0.00032008023,0.007191888],"genre_scores_gemma":[0.92448217,0.00044500662,0.070285015,0.00009723004,0.000042191667,0.00015853843,0.000053535998,0.00003168894,0.004404631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996352,0.00012101561,0.000016882634,0.00005877414,0.00013126,0.000036823225],"domain_scores_gemma":[0.99970394,0.00010918107,0.000050208706,0.00003828831,0.00007091071,0.000027509452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056422845,0.00032451755,0.0004137803,0.00036205468,0.00062568026,0.000771119,0.0010738887,0.0004478863,0.00075809186],"category_scores_gemma":[0.0009968422,0.00020470862,0.00025840968,0.00048147322,0.000512286,0.0011014737,0.00085921044,0.00042854677,0.00015758556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016473599,0.00009894199,0.0008269933,0.00010212218,0.0000615806,0.00034892224,0.00025599948,0.83730537,0.020803953,0.06500655,0.003040056,0.07198482],"study_design_scores_gemma":[0.000008383096,0.00006446681,0.00007314089,0.0000032755659,0.000009553403,0.000060401486,0.000023598135,0.9937443,0.00093616266,0.0034695715,0.0015951376,0.000012040501],"about_ca_topic_score_codex":0.0017432037,"about_ca_topic_score_gemma":0.0015880973,"teacher_disagreement_score":0.0017432037,"about_ca_system_score_codex":0.00046416634,"about_ca_system_score_gemma":0.00070168846,"threshold_uncertainty_score":0.0034661293},"labels":[],"label_agreement":null},{"id":"W4392486089","doi":"10.18280/jesa.570114","title":"A Review of Power Management Approaches for Mobile Ad Hoc Networks","year":2024,"lang":"en","type":"review","venue":"Journal Européen des Systèmes Automatisés","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mobile ad hoc network; Computer science; Wireless ad hoc network; Power (physics); Computer network; Telecommunications; Wireless","score_opus":0.048605436325025037,"score_gpt":0.30595638651820417,"score_spread":0.2573509501931791,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392486089","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022917417,0.9915057,0.0027205131,0.00034634757,0.0005530155,0.000026599999,0.000052927968,0.000034741908,0.004531007],"genre_scores_gemma":[0.001760133,0.9914096,0.0033139593,0.0002738411,0.0005855988,0.000028992383,0.00009792192,0.000011731377,0.00251831],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994567,0.000075732576,0.000083222134,0.00008832496,0.00025910386,0.000036972837],"domain_scores_gemma":[0.99899346,0.00047837396,0.00008881062,0.0000407085,0.00036114038,0.000037462534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000733596,0.0011428805,0.0011668202,0.0030378813,0.000506083,0.0013486666,0.0015375547,0.0012345368,0.0069011846],"category_scores_gemma":[0.0017026286,0.00064597855,0.0006621883,0.004955603,0.00046375993,0.0024970793,0.0006921026,0.0015098426,0.0047224844],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037370213,0.00008760207,0.0002249152,0.014694937,0.00006195883,0.00015961763,0.00008628136,0.0011202815,0.0014468734,0.008484549,0.03693714,0.93665856],"study_design_scores_gemma":[0.000006338757,0.00010018664,0.00057824125,0.0037497042,0.0000658371,0.0007869783,0.000074710086,0.00048468492,0.0005248413,0.0034162665,0.9901822,0.000029861254],"about_ca_topic_score_codex":0.0016474624,"about_ca_topic_score_gemma":0.0022799291,"teacher_disagreement_score":0.0069011846,"about_ca_system_score_codex":0.0006965871,"about_ca_system_score_gemma":0.0012641576,"threshold_uncertainty_score":0.023086727},"labels":[],"label_agreement":null},{"id":"W4393261217","doi":"10.18280/mmep.110308","title":"An Energy-Aware Cluster Head Selection and Optimal Route Selection Algorithm for Maximizing Network Lifetime in MANETs","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Computer science; Cluster (spacecraft); Head (geology); Selection algorithm; Energy (signal processing); Algorithm; Mobile ad hoc network; Mathematical optimization; Computer network; Artificial intelligence; Mathematics; Statistics; Biology","score_opus":0.013074048448393518,"score_gpt":0.22259132708187462,"score_spread":0.2095172786334811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393261217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027690435,0.00047792197,0.9685429,0.0002146774,0.000056603098,0.00010927486,0.000047210742,0.00051176763,0.0023491634],"genre_scores_gemma":[0.6149836,0.00058127183,0.37659523,0.00016366936,0.0000619144,0.0003130272,0.00024276119,0.000101902464,0.0069565913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996822,0.00007401497,0.000014286465,0.00008785354,0.00009709674,0.00004453441],"domain_scores_gemma":[0.9997241,0.00010284706,0.000033947912,0.000020103673,0.00009682423,0.000022256218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004652685,0.0005898736,0.00071820634,0.00093150506,0.00069767097,0.00056346046,0.001378251,0.00069201255,0.001191676],"category_scores_gemma":[0.0011195915,0.00026188977,0.00042463013,0.000996461,0.0003760877,0.0008239488,0.0006638631,0.00049819483,0.00029885548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000110011846,0.00007136618,0.0009717048,0.00008352357,0.000059031965,0.000101152225,0.00013394194,0.8277818,0.0070298286,0.009449083,0.0034852102,0.15072334],"study_design_scores_gemma":[0.000011729662,0.000043285654,0.000115041235,0.0000036978533,0.000009034388,0.000038214315,0.000020462925,0.99646544,0.0010358038,0.0014115588,0.0008375685,0.000008124101],"about_ca_topic_score_codex":0.004775911,"about_ca_topic_score_gemma":0.0056432406,"teacher_disagreement_score":0.004775911,"about_ca_system_score_codex":0.0007481082,"about_ca_system_score_gemma":0.001208415,"threshold_uncertainty_score":0.009496212},"labels":[],"label_agreement":null},{"id":"W4396508117","doi":"10.22215/etd/2024-15939","title":"Adaptive Multicast Routing Protocol Based on Reinforcement Learning","year":2024,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Protocol Independent Multicast; Distance Vector Multicast Routing Protocol; Computer network; Computer science; Multicast; Distributed computing; Path vector protocol; Open Shortest Path First; Xcast; Wireless Routing Protocol; Zone Routing Protocol; Optimized Link State Routing Protocol; Source-specific multicast; Routing protocol; Link-state routing protocol; Network packet","score_opus":0.01729273542026848,"score_gpt":0.29166008707818736,"score_spread":0.27436735165791887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396508117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03916156,0.00063826074,0.94342744,0.0004107628,0.00021969779,0.00032462203,0.00009078667,0.0022267888,0.013500009],"genre_scores_gemma":[0.859452,0.0003226141,0.13330135,0.00018392922,0.000058407757,0.00040083175,0.00016586982,0.00004354306,0.0060715084],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999653,0.00009779925,0.000021605281,0.0000562838,0.00012476905,0.000046616387],"domain_scores_gemma":[0.9995995,0.00014237674,0.000048503887,0.00004038503,0.00013596144,0.000033276676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004101328,0.00039492353,0.00049255264,0.00044857292,0.00045774312,0.0004009152,0.00096988137,0.00048091175,0.0013124363],"category_scores_gemma":[0.0010196635,0.00012620231,0.00032969037,0.00031256097,0.0002792546,0.00044452972,0.0005930467,0.0006449476,0.00028038814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044988276,0.00039534186,0.0022942915,0.00023430267,0.00017269625,0.0007454536,0.00023880201,0.5137723,0.03500766,0.040420547,0.00943556,0.3968332],"study_design_scores_gemma":[0.000054503715,0.0001480113,0.00032712336,0.000008465342,0.00001990609,0.00017774232,0.000014698506,0.98587483,0.0028646132,0.006065416,0.0044265618,0.000018068096],"about_ca_topic_score_codex":0.0018622626,"about_ca_topic_score_gemma":0.0015776039,"teacher_disagreement_score":0.0018622626,"about_ca_system_score_codex":0.00047586518,"about_ca_system_score_gemma":0.00055275596,"threshold_uncertainty_score":0.0043905377},"labels":[],"label_agreement":null},{"id":"W4396782687","doi":"10.1007/978-3-031-57296-8_6","title":"Summary and Future Directions","year":2024,"lang":"en","type":"book-chapter","venue":"Wireless networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor","funders":"","keywords":"Computer science","score_opus":0.007939568074419494,"score_gpt":0.20773086050398543,"score_spread":0.19979129242956592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396782687","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007772854,0.55586946,0.0056082164,0.12228455,0.1266623,0.0002846758,0.0025968463,0.0005920732,0.1853246],"genre_scores_gemma":[0.0058834674,0.4855892,0.0071477047,0.061749272,0.03830592,0.00052175834,0.0030511504,0.00017475281,0.3975768],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988432,0.0002815396,0.0000837771,0.0001738818,0.00038797184,0.00022959776],"domain_scores_gemma":[0.99691844,0.0005209866,0.00014362771,0.00015458767,0.0015881044,0.0006742383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033177193,0.0011271422,0.0010498957,0.0019852596,0.0014103907,0.0061423145,0.0023242878,0.0030663963,0.15740182],"category_scores_gemma":[0.00500416,0.00031580913,0.0010229411,0.0024115017,0.0007056473,0.0055500194,0.002015045,0.0029502374,0.061657887],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017855516,0.000105158324,0.000170289,0.0017374282,0.000019488023,0.00009635103,0.00006353654,0.00019285474,0.0003225569,0.01476802,0.6519643,0.33038142],"study_design_scores_gemma":[0.000020185182,0.000059084585,0.00017866826,0.001034823,0.000027491404,0.00009077101,0.00017129774,0.000045240202,0.000102875085,0.0054682237,0.9927938,0.000007608452],"about_ca_topic_score_codex":0.0042385613,"about_ca_topic_score_gemma":0.007914256,"teacher_disagreement_score":0.15740182,"about_ca_system_score_codex":0.0018423777,"about_ca_system_score_gemma":0.005904272,"threshold_uncertainty_score":0.5265615},"labels":[],"label_agreement":null},{"id":"W4399726542","doi":"10.32920/26052679.v1","title":"Triangle Evacuation of 2 Agents in the Wireless Model","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McGill University","funders":"","keywords":"Wireless; Computer science; Computer network; Telecommunications","score_opus":0.05919153527023601,"score_gpt":0.3090508497283858,"score_spread":0.2498593144581498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399726542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20805164,0.0010956251,0.7563705,0.0027211227,0.00021693212,0.00026960112,0.0005446267,0.00023385485,0.030496119],"genre_scores_gemma":[0.8896421,0.0011710757,0.083981566,0.00034226882,0.00018026309,0.00033928867,0.00041397708,0.000104961386,0.023824448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882215,0.00045972853,0.000044731296,0.00021082538,0.00018893491,0.0002735169],"domain_scores_gemma":[0.9965917,0.0021913454,0.0005306648,0.00018856155,0.0001598826,0.00033778235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010570176,0.001372734,0.0011995957,0.0008191464,0.0011197457,0.0017219245,0.0029830716,0.0031604173,0.0065653874],"category_scores_gemma":[0.00598434,0.00070327276,0.0013646017,0.0012160132,0.0020396109,0.0031618658,0.003114896,0.002035746,0.00074120495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019749807,0.000068144305,0.00045029644,0.000119368175,0.00003569034,0.000453257,0.00016512476,0.8916084,0.0011148043,0.10119574,0.0011917611,0.003399812],"study_design_scores_gemma":[0.00004117671,0.000052034375,0.000075967626,0.000008310736,0.000010550595,0.00005286761,0.00006219473,0.97506434,0.00017914396,0.023586571,0.0008588072,0.000008056463],"about_ca_topic_score_codex":0.007997548,"about_ca_topic_score_gemma":0.004618602,"teacher_disagreement_score":0.007997548,"about_ca_system_score_codex":0.0014603902,"about_ca_system_score_gemma":0.0006937403,"threshold_uncertainty_score":0.021963418},"labels":[],"label_agreement":null},{"id":"W4399726658","doi":"10.32920/26052679","title":"Triangle Evacuation of 2 Agents in the Wireless Model","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McGill University","funders":"","keywords":"Computer science; Wireless; Computer network; Computer security; Telecommunications","score_opus":0.05919153527023601,"score_gpt":0.3090508497283858,"score_spread":0.2498593144581498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399726658","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20805164,0.0010956251,0.7563705,0.0027211227,0.00021693212,0.00026960112,0.0005446267,0.00023385485,0.030496119],"genre_scores_gemma":[0.8896421,0.0011710757,0.083981566,0.00034226882,0.00018026309,0.00033928867,0.00041397708,0.000104961386,0.023824448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882215,0.00045972853,0.000044731296,0.00021082538,0.00018893491,0.0002735169],"domain_scores_gemma":[0.9965917,0.0021913454,0.0005306648,0.00018856155,0.0001598826,0.00033778235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010570176,0.001372734,0.0011995957,0.0008191464,0.0011197457,0.0017219245,0.0029830716,0.0031604173,0.0065653874],"category_scores_gemma":[0.00598434,0.00070327276,0.0013646017,0.0012160132,0.0020396109,0.0031618658,0.003114896,0.002035746,0.00074120495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019749807,0.000068144305,0.00045029644,0.000119368175,0.00003569034,0.000453257,0.00016512476,0.8916084,0.0011148043,0.10119574,0.0011917611,0.003399812],"study_design_scores_gemma":[0.00004117671,0.000052034375,0.000075967626,0.000008310736,0.000010550595,0.00005286761,0.00006219473,0.97506434,0.00017914396,0.023586571,0.0008588072,0.000008056463],"about_ca_topic_score_codex":0.007997548,"about_ca_topic_score_gemma":0.004618602,"teacher_disagreement_score":0.007997548,"about_ca_system_score_codex":0.0014603902,"about_ca_system_score_gemma":0.0006937403,"threshold_uncertainty_score":0.021963418},"labels":[],"label_agreement":null},{"id":"W4400689446","doi":"10.1145/3673422.3674891","title":"DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Shortest path problem; Computer science; Routing (electronic design automation); Loop (graph theory); Computation; Path (computing); Private Network-to-Network Interface; Path vector protocol; Topology (electrical circuits); Computer network; Theoretical computer science; Link-state routing protocol; Algorithm; Mathematics; Routing protocol; Combinatorics; Graph","score_opus":0.01999329747282931,"score_gpt":0.2851881112906218,"score_spread":0.26519481381779253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400689446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010299172,0.00072169927,0.97986835,0.0003465181,0.00025024317,0.00009503478,0.000077799676,0.0032720885,0.005069055],"genre_scores_gemma":[0.18087634,0.0010952356,0.8100897,0.00040317737,0.00017210643,0.00023074706,0.00035320566,0.00070898235,0.006070445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989706,0.00019045721,0.00008488135,0.00016084808,0.00047656122,0.00011657181],"domain_scores_gemma":[0.99821824,0.00071974756,0.00012999168,0.0005010018,0.00032149113,0.000109473374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014797442,0.00079011667,0.0010019734,0.001289475,0.0007611891,0.0021186834,0.0018122955,0.00090867194,0.0044849683],"category_scores_gemma":[0.005291572,0.00047930251,0.00065566914,0.00087686774,0.001155373,0.0041592387,0.0030969547,0.003076218,0.0012370835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007598542,0.0003235151,0.0010722481,0.0005308048,0.00012726845,0.00029778804,0.0004199464,0.118069805,0.059030775,0.3178312,0.012901541,0.48863515],"study_design_scores_gemma":[0.00032491394,0.0002745962,0.0003031389,0.00010045705,0.00007611994,0.00044235346,0.00012867342,0.74914247,0.064046524,0.09334795,0.0916633,0.00014957156],"about_ca_topic_score_codex":0.0009112335,"about_ca_topic_score_gemma":0.0008516861,"teacher_disagreement_score":0.0044849683,"about_ca_system_score_codex":0.0006100781,"about_ca_system_score_gemma":0.0007348915,"threshold_uncertainty_score":0.015003741},"labels":[],"label_agreement":null},{"id":"W4401163912","doi":"10.1109/bmsb62888.2024.10608288","title":"Resource Allocation in Heterogeneous ITCN","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Resource management (computing); Distributed computing; Computer network","score_opus":0.011366024794624967,"score_gpt":0.23794964163266433,"score_spread":0.22658361683803935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401163912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12679617,0.00042527207,0.8619189,0.00020514824,0.00006460696,0.00007344963,0.00007446328,0.00018104943,0.01026093],"genre_scores_gemma":[0.96371967,0.0001291013,0.03407542,0.00007788251,0.00001848498,0.000051388175,0.00005153344,0.000020149324,0.0018564429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922085,0.00023950657,0.000027004015,0.00016621698,0.0001241261,0.00022223525],"domain_scores_gemma":[0.99943155,0.00025556082,0.000070821516,0.000057705125,0.00010985863,0.000074575415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008338463,0.0005774458,0.0006134362,0.00041685795,0.00067495427,0.0011256019,0.001199253,0.0005136288,0.0014460937],"category_scores_gemma":[0.0015903111,0.00023157755,0.0003077821,0.0008961551,0.0006066441,0.0012746213,0.0010816782,0.00046447688,0.00014795552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011034822,0.00004870415,0.00070170674,0.00003848684,0.00003017423,0.00023360294,0.000057586356,0.9479821,0.0033343148,0.014650013,0.00084972737,0.03196314],"study_design_scores_gemma":[0.000007839626,0.000024727704,0.000108320164,0.0000023831742,0.00000800554,0.000030303892,0.000024688165,0.9954116,0.00047905813,0.0034788344,0.0004199586,0.0000042047577],"about_ca_topic_score_codex":0.007240862,"about_ca_topic_score_gemma":0.006963621,"teacher_disagreement_score":0.007240862,"about_ca_system_score_codex":0.00117578,"about_ca_system_score_gemma":0.001030355,"threshold_uncertainty_score":0.014397442},"labels":[],"label_agreement":null},{"id":"W4401508576","doi":"10.1109/infocom52122.2024.10621415","title":"DDR: A Deadline-Driven Routing Protocol for Delay Guaranteed Service","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer network; Computer science; Zone Routing Protocol; Routing protocol; Enhanced Interior Gateway Routing Protocol; Routing (electronic design automation); Routing Information Protocol; Protocol (science); Dynamic Source Routing; Distributed computing; Medicine","score_opus":0.030147782951775615,"score_gpt":0.315346892384391,"score_spread":0.2851991094326154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401508576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068055233,0.0017080503,0.9835829,0.00051662297,0.0005760444,0.0003299921,0.0002738508,0.0027218186,0.0034851322],"genre_scores_gemma":[0.4607708,0.0034896221,0.5226725,0.001349072,0.00047456502,0.0010869383,0.0013962289,0.0005921273,0.008168151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870384,0.00029537463,0.00012948367,0.00022071942,0.0005211865,0.00012934381],"domain_scores_gemma":[0.99846077,0.00047164052,0.00026221375,0.00029611777,0.0003652276,0.00014404621],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018499213,0.0008028406,0.0010305739,0.0011317013,0.0009813047,0.0011781264,0.0025928877,0.0009809266,0.0015338435],"category_scores_gemma":[0.003631296,0.00034367185,0.00056493666,0.0009869608,0.0006976261,0.001579291,0.0019990327,0.0015938127,0.0007316327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007564285,0.00026539224,0.0011377498,0.0013072923,0.00026689153,0.000723204,0.0005471198,0.21704121,0.06725339,0.12741406,0.043222375,0.54006493],"study_design_scores_gemma":[0.000217059,0.0004613555,0.000357203,0.00007975763,0.00010951937,0.0008527699,0.00009991853,0.8393821,0.017136905,0.04298268,0.09817062,0.00015013388],"about_ca_topic_score_codex":0.0014458183,"about_ca_topic_score_gemma":0.0021910092,"teacher_disagreement_score":0.0025928877,"about_ca_system_score_codex":0.00089022296,"about_ca_system_score_gemma":0.0018246243,"threshold_uncertainty_score":0.009783447},"labels":[],"label_agreement":null},{"id":"W4401751500","doi":"10.1109/icccn61486.2024.10637540","title":"LEMUR: Efficient Multicasting in Ad-hoc Networks Using Label Switching and Unicast Routing","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Unicast; Computer science; Computer network; Wireless ad hoc network; Routing (electronic design automation); Multicast; Vehicular ad hoc network; Distributed computing; Telecommunications; Wireless","score_opus":0.026563600769897798,"score_gpt":0.27960468081779405,"score_spread":0.25304108004789627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401751500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030204725,0.0008280749,0.9446354,0.000449705,0.00010593143,0.00022960886,0.00019058822,0.010038625,0.013317383],"genre_scores_gemma":[0.36572093,0.00057270884,0.6206647,0.0003676527,0.00013854203,0.00037586864,0.00082417164,0.0004790481,0.010856328],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994523,0.00019433399,0.00002050757,0.000049592865,0.00022165717,0.00006168283],"domain_scores_gemma":[0.99955994,0.00018131718,0.00003642892,0.000104244806,0.000084165746,0.000033887674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091276417,0.0005842555,0.0005778708,0.0010034513,0.0007703813,0.000861932,0.0013108267,0.00064939365,0.002632196],"category_scores_gemma":[0.0019539904,0.00021756745,0.00024081476,0.00059228414,0.0005086622,0.0018541567,0.0015735487,0.0006614484,0.0010916048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000794542,0.00038798773,0.0011149271,0.0004156079,0.00010730992,0.0004965724,0.000473505,0.0974345,0.06043036,0.06925448,0.025703518,0.7433866],"study_design_scores_gemma":[0.00012971132,0.0002802874,0.00041294412,0.00003862862,0.00003297055,0.00026325864,0.00009302002,0.9287086,0.019557087,0.026810216,0.023634324,0.00003900398],"about_ca_topic_score_codex":0.001058217,"about_ca_topic_score_gemma":0.0021293894,"teacher_disagreement_score":0.002632196,"about_ca_system_score_codex":0.0005863374,"about_ca_system_score_gemma":0.00046401663,"threshold_uncertainty_score":0.008805573},"labels":[],"label_agreement":null},{"id":"W4402857775","doi":"10.1016/j.aej.2024.09.032","title":"Routing protocols strategies for flying Ad-Hoc network (FANET): Review, taxonomy, and open research issues","year":2024,"lang":"en","type":"article","venue":"Alexandria Engineering Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"Qatar National Library","keywords":"Computer science; Wireless ad hoc network; Computer network; Open research; Telecommunications; World Wide Web; Wireless","score_opus":0.10484009544293216,"score_gpt":0.3846151611702775,"score_spread":0.27977506572734534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402857775","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078910217,0.97922933,0.012835405,0.0011764884,0.00094960345,0.000045861678,0.000048018275,0.00007605755,0.0048501696],"genre_scores_gemma":[0.006808526,0.9809838,0.008959215,0.00046040764,0.0012189673,0.000070250026,0.0001476543,0.000026384843,0.0013247315],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992101,0.00014786996,0.00013215508,0.00016301461,0.00028711578,0.000059797192],"domain_scores_gemma":[0.9971011,0.0018330672,0.0002519024,0.00012633829,0.0006205662,0.000067011686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015839195,0.0012694207,0.0011878597,0.0027596045,0.0006303828,0.0022451198,0.0023355603,0.001829368,0.0024820336],"category_scores_gemma":[0.004256717,0.0007270901,0.00073129876,0.005175181,0.0010725515,0.0053302636,0.0009774151,0.002356161,0.0017086042],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046493307,0.00011088417,0.0005297338,0.010160652,0.000059661477,0.00010587858,0.00020209991,0.006300919,0.0009391812,0.041419238,0.022902517,0.91722274],"study_design_scores_gemma":[0.000018246412,0.00030788855,0.00097628485,0.0068736942,0.00017431592,0.0012902295,0.0005210357,0.011366371,0.0010323854,0.03979606,0.9375299,0.00011364554],"about_ca_topic_score_codex":0.0020263118,"about_ca_topic_score_gemma":0.0011625699,"teacher_disagreement_score":0.0027596045,"about_ca_system_score_codex":0.0009899654,"about_ca_system_score_gemma":0.0019244344,"threshold_uncertainty_score":0.008376658},"labels":[],"label_agreement":null},{"id":"W4403016868","doi":"10.1016/j.comcom.2024.107966","title":"RIPPLE-WiN: An efficient protocol for loop-free multipath routing in wireless networks","year":2024,"lang":"en","type":"article","venue":"Computer Communications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Computer network; Ripple; Multipath propagation; Wireless; Multipath routing; Routing (electronic design automation); Protocol (science); Routing protocol; Dynamic Source Routing; Telecommunications; Electrical engineering; Channel (broadcasting)","score_opus":0.04827933413342932,"score_gpt":0.33312237452679905,"score_spread":0.2848430403933697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403016868","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022094702,0.001012874,0.9431045,0.0003980065,0.00053491554,0.00036369986,0.0005407393,0.02374443,0.008206141],"genre_scores_gemma":[0.49994475,0.0016274691,0.4711652,0.00042160088,0.0002629504,0.0008007266,0.002284637,0.0026236442,0.020868992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992142,0.00015447213,0.00006347745,0.00007623755,0.000325045,0.00016654431],"domain_scores_gemma":[0.9984328,0.00050614873,0.00012233868,0.0004902287,0.0003055498,0.00014289071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014838568,0.00086915004,0.0009664936,0.0017102902,0.0014294744,0.0015816017,0.0026278167,0.00081399427,0.0053923107],"category_scores_gemma":[0.003803065,0.0005727264,0.0004757595,0.0012688966,0.00075753254,0.0026640326,0.002964707,0.0013633013,0.0013908751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029278037,0.00028290748,0.0012436858,0.00097582414,0.0003048584,0.00045520844,0.000561295,0.102162614,0.03532885,0.10181133,0.06340487,0.6905408],"study_design_scores_gemma":[0.0006177127,0.0006777524,0.00063466287,0.00015552534,0.00037367595,0.0006345675,0.0002874412,0.74159473,0.07218027,0.08833634,0.0942173,0.0002900723],"about_ca_topic_score_codex":0.0020972765,"about_ca_topic_score_gemma":0.0043000146,"teacher_disagreement_score":0.0053923107,"about_ca_system_score_codex":0.0008567672,"about_ca_system_score_gemma":0.0019970073,"threshold_uncertainty_score":0.018039107},"labels":[],"label_agreement":null},{"id":"W4403845913","doi":"10.18280/jesa.570513","title":"Adapting Wired TCP for Wireless Ad-hoc Networks Using Fuzzy Logic Control","year":2024,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Fuzzy logic; Mobile ad hoc network; Wireless; Artificial intelligence; Telecommunications; Network packet","score_opus":0.04275300523013483,"score_gpt":0.2829210373404366,"score_spread":0.24016803211030177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403845913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06839082,0.00027594296,0.9246319,0.00012395545,0.00014284556,0.000098287615,0.000023620069,0.0003990086,0.005913609],"genre_scores_gemma":[0.9655335,0.000117297306,0.03309438,0.000031339816,0.000023662675,0.000046890134,0.000015201237,0.000013577864,0.0011240927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968135,0.00006482272,0.00002304032,0.0000687525,0.00011691503,0.000045215933],"domain_scores_gemma":[0.9993204,0.0003283865,0.00006629089,0.00005061406,0.00021099033,0.000023389459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007777491,0.00039649828,0.0003437154,0.0004759119,0.0004505601,0.0010112157,0.000685772,0.00048590466,0.0013226357],"category_scores_gemma":[0.0018412874,0.00017414137,0.00039300215,0.00029216785,0.00044134253,0.00057607255,0.00044184725,0.0005264743,0.00012565343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021585918,0.00018379578,0.0013780026,0.000114189,0.000076887656,0.00019667814,0.00014858467,0.80907464,0.023559686,0.01105705,0.0007129283,0.15328172],"study_design_scores_gemma":[0.000009871519,0.00004355261,0.00017441741,0.0000053072868,0.000018883287,0.0000126086225,0.000008914459,0.9964541,0.0013494221,0.0016753183,0.00024268424,0.000004919146],"about_ca_topic_score_codex":0.0052497224,"about_ca_topic_score_gemma":0.0046220687,"teacher_disagreement_score":0.0052497224,"about_ca_system_score_codex":0.0008369017,"about_ca_system_score_gemma":0.00049730897,"threshold_uncertainty_score":0.010438323},"labels":[],"label_agreement":null},{"id":"W4405464930","doi":"10.1145/3670865.3673588","title":"Online Matching and Contention Resolution for Edge Arrivals with Vanishing Probabilities","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enhanced Data Rates for GSM Evolution; Matching (statistics); Computer science; Resolution (logic); Algorithm; Artificial intelligence; Mathematics; Statistics","score_opus":0.02268527847758829,"score_gpt":0.253758723891269,"score_spread":0.23107344541368074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405464930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.268187,0.0004596241,0.7235591,0.0007535467,0.000093673356,0.00018635817,0.0001814574,0.00081851304,0.0057607763],"genre_scores_gemma":[0.962454,0.00018909929,0.035292413,0.000120914054,0.00006781143,0.000088495006,0.000088547946,0.00007318946,0.0016255309],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942597,0.0019524273,0.0002296116,0.0012675558,0.0010031759,0.001287579],"domain_scores_gemma":[0.94721866,0.03971519,0.0055083623,0.0050185355,0.0012002265,0.0013391053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066126985,0.0012373574,0.0015836828,0.0013810192,0.0012032017,0.0017223097,0.0034031852,0.0012837779,0.0033048436],"category_scores_gemma":[0.043545276,0.0007377941,0.0008454045,0.0017704009,0.0026163305,0.0047311117,0.0024140887,0.0019826717,0.0004929625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012744458,0.0004067294,0.003594198,0.00022285256,0.00016531536,0.00026271172,0.00022946972,0.8285283,0.011950932,0.10603107,0.001989452,0.045344517],"study_design_scores_gemma":[0.000040887415,0.0001289489,0.00035715548,0.0000056827407,0.000024564744,0.00008053763,0.000028610842,0.9703269,0.0028591177,0.025837855,0.00029491264,0.000014793196],"about_ca_topic_score_codex":0.001971101,"about_ca_topic_score_gemma":0.0017044189,"teacher_disagreement_score":0.0066126985,"about_ca_system_score_codex":0.0021051643,"about_ca_system_score_gemma":0.0022316226,"threshold_uncertainty_score":0.034971714},"labels":[],"label_agreement":null},{"id":"W4405866116","doi":"10.2139/ssrn.5074007","title":"Energy and Density-Based Stable Election Routing Protocol for Wireless Iot Network","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Computer network; Wireless Routing Protocol; Computer science; Routing protocol; Protocol (science); Zone Routing Protocol; Dynamic Source Routing; Energy (signal processing); Routing (electronic design automation); Internet of Things; Computer security; Physics; Medicine","score_opus":0.010879545930693027,"score_gpt":0.26012906505655053,"score_spread":0.24924951912585752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405866116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112182386,0.0025619569,0.8703351,0.0014500493,0.000610921,0.00024641136,0.00020780972,0.000884807,0.011520612],"genre_scores_gemma":[0.93301654,0.00093266414,0.060430206,0.00012916987,0.000117122596,0.00016159743,0.00022353805,0.000047204572,0.004942071],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.00010635889,0.000026225913,0.00005828453,0.00014448042,0.000041486022],"domain_scores_gemma":[0.9995322,0.00016954006,0.000046658966,0.00006388713,0.00016428654,0.00002338052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050520943,0.00031353394,0.0005014385,0.0007057209,0.0007117894,0.00061586825,0.0008462673,0.0003851986,0.0009092652],"category_scores_gemma":[0.0016885509,0.00021738352,0.0002416317,0.0008726814,0.00049338175,0.0011294807,0.0011611001,0.00061728596,0.00021615768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007441736,0.00027662024,0.003520632,0.00043091527,0.00016750302,0.00050279335,0.00073545566,0.35149595,0.06973019,0.21819088,0.021987421,0.33221743],"study_design_scores_gemma":[0.00004837728,0.00023810656,0.0012242633,0.000019593854,0.000065921784,0.00036872333,0.00018658476,0.9393515,0.010382056,0.037926625,0.010140071,0.000048119924],"about_ca_topic_score_codex":0.0010135826,"about_ca_topic_score_gemma":0.0017217655,"teacher_disagreement_score":0.0010135826,"about_ca_system_score_codex":0.0005766236,"about_ca_system_score_gemma":0.0005802092,"threshold_uncertainty_score":0.004183769},"labels":[],"label_agreement":null},{"id":"W4407128782","doi":"10.1109/jiot.2025.3538167","title":"OpenL3: Embedding Diverse Network Services into MANETs Using Multidimensional Identifier","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Beijing Jiaotong University; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Identifier; Mobile ad hoc network; Embedding; Distributed computing; Artificial intelligence","score_opus":0.013947462985468008,"score_gpt":0.2902983454777164,"score_spread":0.2763508824922484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407128782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019970916,0.00056961953,0.9578354,0.00038897127,0.00028481637,0.00032331332,0.00027572463,0.014489919,0.0058613084],"genre_scores_gemma":[0.5012457,0.00090648496,0.48531702,0.0010019378,0.00024162709,0.0007975847,0.00187473,0.00075714954,0.007857715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832314,0.0004411626,0.00018693402,0.0002495987,0.0005519179,0.00024715991],"domain_scores_gemma":[0.9980502,0.0003412299,0.0002713716,0.0007654618,0.00030667492,0.0002649814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021589345,0.000771994,0.00086753746,0.0013579819,0.0010988441,0.0026396723,0.0030719491,0.0011678961,0.0023906003],"category_scores_gemma":[0.002812982,0.00042376455,0.0007992145,0.001112893,0.0011298729,0.005345005,0.007165638,0.0013933688,0.0012173285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015010781,0.0006601416,0.0067385575,0.0008834251,0.00030069813,0.0018299574,0.0015299574,0.05147552,0.08841277,0.16977087,0.038257245,0.63863975],"study_design_scores_gemma":[0.0003020299,0.0009938565,0.002120859,0.00016090895,0.00017448489,0.0013437641,0.0006991833,0.6960735,0.0596334,0.06273892,0.17535776,0.00040123754],"about_ca_topic_score_codex":0.0024542545,"about_ca_topic_score_gemma":0.0016787131,"teacher_disagreement_score":0.0030719491,"about_ca_system_score_codex":0.0010846086,"about_ca_system_score_gemma":0.0012402016,"threshold_uncertainty_score":0.011417687},"labels":[],"label_agreement":null},{"id":"W4408012891","doi":"10.1007/978-981-97-8355-7_29","title":"Computational Intelligence to Progress in WMN","year":2025,"lang":"en","type":"book-chapter","venue":"Smart innovation, systems and technologies","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science","score_opus":0.019266878827176172,"score_gpt":0.255207981440455,"score_spread":0.2359411026132788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408012891","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008888956,0.05829787,0.30574524,0.024700714,0.0059013334,0.00007957973,0.00021494477,0.00046261272,0.5957088],"genre_scores_gemma":[0.37158263,0.0813955,0.17756537,0.0042981347,0.00807783,0.00027126516,0.00055134797,0.0004297463,0.3558281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962187,0.00013197774,0.000020629343,0.00006137348,0.00011722235,0.00004687188],"domain_scores_gemma":[0.99879104,0.00082603167,0.00004906883,0.00015411999,0.000116197705,0.00006352553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010891353,0.000539043,0.00043160786,0.000935237,0.00060011126,0.0034628722,0.00093267416,0.0012798127,0.009967379],"category_scores_gemma":[0.0039732056,0.0003058926,0.00028658373,0.0021825752,0.0025500257,0.006797422,0.0018953001,0.0023656625,0.0017684485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008450295,0.000013051739,0.00006463005,0.000094780946,0.000004473385,0.00003236115,0.00012572923,0.00654822,0.00010836212,0.9218941,0.016313657,0.054792225],"study_design_scores_gemma":[0.0000027367014,0.0000065771574,0.000065790984,0.000110118664,0.0000031130571,0.000044913973,0.000088563116,0.016468102,0.00013108418,0.8585815,0.12449161,0.000005890398],"about_ca_topic_score_codex":0.0016853429,"about_ca_topic_score_gemma":0.0014930058,"teacher_disagreement_score":0.009967379,"about_ca_system_score_codex":0.001415833,"about_ca_system_score_gemma":0.00075765495,"threshold_uncertainty_score":0.03334421},"labels":[],"label_agreement":null},{"id":"W4408145158","doi":"10.1109/jiot.2025.3547341","title":"Distributed Routing and Data Scheduling in IPNs With GNN-Based Multiagent DRL","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Barrie Urology Group","funders":"National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Scheduling (production processes); Computer network; Mathematical optimization; Mathematics","score_opus":0.020185877706774658,"score_gpt":0.27844523352671463,"score_spread":0.25825935581994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054962777,0.00024274613,0.93922466,0.00036867053,0.00008013396,0.000058781334,0.000045668625,0.0009012476,0.0041153855],"genre_scores_gemma":[0.9221082,0.000095845666,0.07489748,0.00022235893,0.000030446312,0.000075478696,0.00007794382,0.000060177954,0.0024320248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964964,0.00007558966,0.000016860979,0.00011517839,0.0000729438,0.000069834176],"domain_scores_gemma":[0.99942446,0.00019396233,0.00009844064,0.00007568501,0.00013285197,0.0000746175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006525972,0.00055381516,0.00051895034,0.0003021104,0.00046040904,0.00059475563,0.0013566001,0.0006499791,0.0011596887],"category_scores_gemma":[0.0016990644,0.0002663684,0.0003228336,0.0002749709,0.00072770705,0.00095246214,0.0011099174,0.00089753605,0.00020571338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044528322,0.000040066105,0.0007320613,0.00002424646,0.000019083951,0.000046138724,0.000041205065,0.9637245,0.0021434915,0.0041458257,0.0007479073,0.02829098],"study_design_scores_gemma":[0.0000031909547,0.000009858572,0.000047983132,9.1764883e-7,0.0000028667794,0.0000046795735,0.000004204712,0.99829835,0.00025021288,0.0012065535,0.00016943074,0.0000017240443],"about_ca_topic_score_codex":0.008490669,"about_ca_topic_score_gemma":0.0098718535,"teacher_disagreement_score":0.008490669,"about_ca_system_score_codex":0.0012494952,"about_ca_system_score_gemma":0.0012429375,"threshold_uncertainty_score":0.016882539},"labels":[],"label_agreement":null},{"id":"W4408667083","doi":"10.1016/j.tcs.2025.115190","title":"Improved algorithms for optimal k sink location on path networks","year":2025,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Japan Science and Technology Agency; Research Grants Council, University Grants Committee; Japan Society for the Promotion of Science; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Path (computing); Sink (geography); Computer science; Mathematics; Computer network; Geography","score_opus":0.008280889676144442,"score_gpt":0.25603675457510383,"score_spread":0.2477558648989594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408667083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011940042,0.00031496005,0.9831049,0.00022430341,0.00011508355,0.00013605197,0.00015701893,0.001396604,0.0026110543],"genre_scores_gemma":[0.14110683,0.00031264185,0.8527394,0.00011696831,0.000109496395,0.00027010567,0.00046346668,0.00025569188,0.0046253833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979559,0.00057089824,0.00013971265,0.00046581653,0.00056136027,0.0003062371],"domain_scores_gemma":[0.995644,0.0024074402,0.00028947668,0.00083636335,0.00068609463,0.00013662674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001796285,0.0020437362,0.0021934279,0.0022581685,0.001448216,0.0021031518,0.0043124924,0.0022950864,0.009223234],"category_scores_gemma":[0.010580079,0.0011394254,0.0011520359,0.0034758502,0.0014471683,0.004668048,0.0043837745,0.002173558,0.0023095445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062813977,0.00019799557,0.0010578264,0.000284092,0.00008153007,0.00012388676,0.00033313088,0.67480546,0.004355006,0.03813416,0.009429536,0.27056918],"study_design_scores_gemma":[0.000077727775,0.00005204748,0.00017385698,0.000014522519,0.000022930799,0.0000485866,0.000049393966,0.9760543,0.0012443105,0.020727258,0.001516015,0.000019078152],"about_ca_topic_score_codex":0.009772519,"about_ca_topic_score_gemma":0.011713387,"teacher_disagreement_score":0.009772519,"about_ca_system_score_codex":0.002534735,"about_ca_system_score_gemma":0.0028613503,"threshold_uncertainty_score":0.030854762},"labels":[],"label_agreement":null},{"id":"W4410086843","doi":"10.1109/ojcoms.2025.3567024","title":"FedRoute: A Multi-Server Federated Meta-DRL Routing Scheme for Tactical Air-Ground WSNs","year":2025,"lang":"en","type":"article","venue":"IEEE Open Journal of the Communications Society","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheme (mathematics); Computer network; Routing (electronic design automation); Computer science; Mathematics","score_opus":0.13234918330047424,"score_gpt":0.3774836987420922,"score_spread":0.24513451544161796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050296877,0.000267403,0.9434889,0.00021717206,0.00007769487,0.00007242621,0.00009247108,0.0038900601,0.0015970347],"genre_scores_gemma":[0.87894297,0.000077220044,0.11854308,0.00016037871,0.000017380966,0.00008089173,0.0001872667,0.00012010516,0.0018707188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995938,0.00010602359,0.000026082074,0.000118381795,0.00008139995,0.000074350464],"domain_scores_gemma":[0.9993537,0.00013548773,0.000113759204,0.00021178134,0.00011492357,0.000070293725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009503207,0.000734583,0.0008551771,0.00041849716,0.00054810295,0.00055253896,0.0023021947,0.00080480304,0.00141222],"category_scores_gemma":[0.001695549,0.0002658369,0.0005014868,0.00030300635,0.0005047835,0.0015385748,0.0014136565,0.000930356,0.0003804987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034175743,0.00013953252,0.0008841295,0.000061083294,0.00008533146,0.0001546471,0.00012425602,0.84964925,0.011027562,0.0070491377,0.0029120569,0.12757125],"study_design_scores_gemma":[0.000011843151,0.00004946501,0.0000607474,0.0000024177948,0.0000061704054,0.000023123659,0.000008794639,0.9967064,0.0010930621,0.0015770078,0.0004549327,0.0000060222164],"about_ca_topic_score_codex":0.0029342696,"about_ca_topic_score_gemma":0.0050686672,"teacher_disagreement_score":0.0029342696,"about_ca_system_score_codex":0.00082536764,"about_ca_system_score_gemma":0.00080698787,"threshold_uncertainty_score":0.005988419},"labels":[],"label_agreement":null},{"id":"W4410727826","doi":"10.14419/sxnnhw10","title":"Comprehensive analysis of manet routing protocols and quality of service metrics","year":2025,"lang":"en","type":"article","venue":"International Journal of Basic and Applied Sciences","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Mobile ad hoc network; Quality of service; Routing (electronic design automation); Routing protocol; Computer network","score_opus":0.052614325760093617,"score_gpt":0.35574482087729803,"score_spread":0.3031304951172044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410727826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15275283,0.084424846,0.7040177,0.0039364942,0.0008145337,0.0009075201,0.00435522,0.0016481321,0.047142733],"genre_scores_gemma":[0.7465436,0.058803357,0.17965281,0.0005072754,0.00061450555,0.0006861623,0.004886622,0.00028324046,0.008022444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773055,0.00040402418,0.00018267588,0.00021667412,0.0013270025,0.0001391157],"domain_scores_gemma":[0.9948515,0.0025164757,0.0007701642,0.0004098699,0.0013497835,0.00010224023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024735255,0.0011751087,0.00096104486,0.005217086,0.000758879,0.0020232198,0.00080961856,0.0007121687,0.0012041195],"category_scores_gemma":[0.009328983,0.00030402376,0.0006923031,0.005361541,0.00040673726,0.0027493774,0.00061417307,0.00090520806,0.00043093876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013751545,0.0002482756,0.016965296,0.0014531628,0.0003814948,0.0005563377,0.00034320733,0.30013552,0.010753967,0.14311185,0.012185399,0.51372796],"study_design_scores_gemma":[0.000011992778,0.0005592644,0.018778315,0.0005531733,0.00026898095,0.00229755,0.00067355955,0.7368783,0.010412937,0.12808447,0.10132591,0.0001556274],"about_ca_topic_score_codex":0.0015091728,"about_ca_topic_score_gemma":0.0013804566,"teacher_disagreement_score":0.005217086,"about_ca_system_score_codex":0.0014155201,"about_ca_system_score_gemma":0.001092407,"threshold_uncertainty_score":0.013081372},"labels":[],"label_agreement":null},{"id":"W4411298049","doi":"10.1016/j.adhoc.2025.103942","title":"QLA-MAODV: A Q-learning adaptive multicast routing protocol for mobile ad-hoc networks","year":2025,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Protocol Independent Multicast; Computer network; Distance Vector Multicast Routing Protocol; Computer science; Multicast; Wireless Routing Protocol; Optimized Link State Routing Protocol; Geocast; Ad hoc wireless distribution service; Distributed computing; Routing protocol; Routing (electronic design automation); Xcast","score_opus":0.0162838174051752,"score_gpt":0.29187008167596573,"score_spread":0.2755862642707905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411298049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021238351,0.0014056971,0.96822697,0.00046117944,0.00018997172,0.0006623981,0.00020452742,0.0029189622,0.004691922],"genre_scores_gemma":[0.60277134,0.0014504832,0.3860631,0.0005108316,0.00014634251,0.0012225013,0.00073502876,0.0001419763,0.006958386],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943656,0.00019140844,0.000042018713,0.000051286235,0.00023078357,0.000047836184],"domain_scores_gemma":[0.99928313,0.00025497976,0.00009838073,0.00006984673,0.00024715607,0.000046465477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001022528,0.00042673596,0.00065830455,0.0008184996,0.0005892574,0.0006451027,0.0016142419,0.00079100183,0.00079565035],"category_scores_gemma":[0.0021552725,0.00021473576,0.00035833532,0.00071774516,0.00044211393,0.00080808904,0.0011031575,0.00086666323,0.00027632277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006556797,0.0004246005,0.0027863143,0.0009010271,0.00030179345,0.0006741894,0.0005826638,0.16188103,0.057275746,0.038950488,0.018789811,0.71677667],"study_design_scores_gemma":[0.00020935568,0.00058522215,0.0009570675,0.00005070231,0.00008505448,0.0005605524,0.00010628557,0.9272481,0.014096735,0.014375502,0.04165093,0.000074415286],"about_ca_topic_score_codex":0.0021038235,"about_ca_topic_score_gemma":0.0023351216,"teacher_disagreement_score":0.0021038235,"about_ca_system_score_codex":0.0005275865,"about_ca_system_score_gemma":0.0009816249,"threshold_uncertainty_score":0.0054077506},"labels":[],"label_agreement":null},{"id":"W4411617934","doi":"10.51847/bdiqovi2x0","title":"10.51847/bDIQOvI2X0","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ad hoc On-Demand Distance Vector Routing; Computer science; Destination-Sequenced Distance Vector routing; Mobile ad hoc network; Distance-vector routing protocol; Routing protocol; Network simulation; Computer network; Routing (electronic design automation); Dynamic Source Routing; Simulation","score_opus":0.005766400329963165,"score_gpt":0.17957921039721714,"score_spread":0.17381281006725396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411617934","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014522943,0.0006691505,0.004493559,0.00047906794,0.0006297241,0.00014752864,0.0008515675,0.0020182943,0.9892588],"genre_scores_gemma":[0.0033679816,0.00029229428,0.0017028624,0.0003464582,0.000085446896,0.00005918062,0.00085656584,0.00022655829,0.9930627],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962556,0.00003859497,0.00002607395,0.0001048114,0.00013667782,0.00006826377],"domain_scores_gemma":[0.9990627,0.0001650868,0.000044807657,0.00014643242,0.00038922997,0.0001917952],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006329311,0.0012685928,0.0006409495,0.002050012,0.001077209,0.0023408006,0.0011819572,0.0028308292,0.9421588],"category_scores_gemma":[0.0010110197,0.00035021766,0.0005030687,0.0020488366,0.00053852866,0.0019774204,0.00161287,0.0011739341,0.95153934],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025750868,0.00020878442,0.0009993293,0.00035936947,0.00002133854,0.00022316059,0.00008454467,0.00048310743,0.0074776923,0.007940098,0.2633266,0.7186185],"study_design_scores_gemma":[0.00003718069,0.000062349376,0.00065431657,0.00011980049,0.000013892748,0.00024342582,0.000048439655,0.00053344056,0.0011041762,0.00084248267,0.9963251,0.000015400734],"about_ca_topic_score_codex":0.0039046973,"about_ca_topic_score_gemma":0.0020598725,"teacher_disagreement_score":0.05784118,"about_ca_system_score_codex":0.0008192382,"about_ca_system_score_gemma":0.0005602204,"threshold_uncertainty_score":0.08250332},"labels":[],"label_agreement":null},{"id":"W4411657018","doi":"10.51847/q1wyco2ayd","title":"10.51847/Q1wyCO2AYD","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wireless mesh network; Computer science; Computer network; Wireless network; Order One Network Protocol; Wireless; Telecommunications","score_opus":0.005742731697106677,"score_gpt":0.17936195523707135,"score_spread":0.17361922353996467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411657018","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017005973,0.0005422699,0.004178618,0.00070044893,0.00087037624,0.000107140164,0.00077225384,0.0015515296,0.9895768],"genre_scores_gemma":[0.0033944463,0.00020015339,0.00090513384,0.00027046836,0.000060232414,0.00003094836,0.00054772536,0.00019463984,0.9943963],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996388,0.00003938904,0.000025777501,0.000111500616,0.00011712856,0.00006740003],"domain_scores_gemma":[0.9991014,0.0001328293,0.000031668373,0.00013021841,0.00043530896,0.00016859808],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005425024,0.0012142758,0.0005839752,0.0014628433,0.0011269388,0.0021525822,0.00090378773,0.0028156047,0.9258845],"category_scores_gemma":[0.00091296853,0.00033452854,0.00045236267,0.0015605869,0.00059620064,0.0015069125,0.001467493,0.0011031317,0.9272908],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034793338,0.00016764751,0.0011870147,0.00028946155,0.0000190414,0.00028730632,0.00009133363,0.00050763483,0.007050337,0.0065635466,0.29934397,0.68414485],"study_design_scores_gemma":[0.000034320346,0.000047520247,0.00053617515,0.000087431705,0.000008999385,0.00021995636,0.000054569537,0.00077905704,0.0011369213,0.0007590076,0.9963224,0.0000137560455],"about_ca_topic_score_codex":0.0041354448,"about_ca_topic_score_gemma":0.0033513457,"teacher_disagreement_score":0.074115515,"about_ca_system_score_codex":0.0009175605,"about_ca_system_score_gemma":0.0005558115,"threshold_uncertainty_score":0.105716705},"labels":[],"label_agreement":null},{"id":"W4412038507","doi":"10.18280/ijsse.150517","title":"Mitigating Malicious and Unintentional Packet Drops in Mobile Ad Hoc Networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer network; Computer security; Mobile ad hoc network; Computer science; Network packet; Wireless ad hoc network; Packet drop attack; Wireless; Telecommunications; Routing protocol","score_opus":0.002992839482928057,"score_gpt":0.21523138100208078,"score_spread":0.21223854151915272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412038507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32546583,0.0034934378,0.6633878,0.00054778205,0.0003683751,0.0002687959,0.0000515623,0.0013949618,0.0050215125],"genre_scores_gemma":[0.9782507,0.0007004114,0.019893823,0.00006706313,0.000055834793,0.000027044242,0.00003656351,0.000021321368,0.0009473146],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986547,0.00035532968,0.00009898959,0.00013638304,0.00058802176,0.00016649156],"domain_scores_gemma":[0.9972096,0.0010813205,0.00047409884,0.00039004665,0.00074634276,0.0000986419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012572609,0.0008270871,0.00067311036,0.0012431376,0.0006907495,0.0009991503,0.0012480987,0.0005421048,0.00030639843],"category_scores_gemma":[0.0046704463,0.00023520108,0.00030027665,0.00074982614,0.00043016326,0.001736488,0.00115058,0.0005800182,0.00017988335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007018318,0.00055889797,0.011059507,0.00051130104,0.0002677192,0.0010185721,0.0005964748,0.41615152,0.10248358,0.0114893215,0.0036711076,0.45149007],"study_design_scores_gemma":[0.000012395445,0.0006373461,0.0012707293,0.000027910612,0.00009157788,0.00048811757,0.00023272657,0.96800107,0.024302362,0.002630272,0.0022829557,0.000022476139],"about_ca_topic_score_codex":0.0011987665,"about_ca_topic_score_gemma":0.0011905732,"teacher_disagreement_score":0.0012572609,"about_ca_system_score_codex":0.0004478289,"about_ca_system_score_gemma":0.00067159586,"threshold_uncertainty_score":0.006649077},"labels":[],"label_agreement":null},{"id":"W4413157688","doi":"10.1109/gcwkshp64532.2024.11100991","title":"An Adaptive Power Allocation Scheme for Wildfire Emergency Communication Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheme (mathematics); Computer science; Power (physics); Computer network","score_opus":0.01741572943244391,"score_gpt":0.2787285351709651,"score_spread":0.26131280573852117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413157688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03148822,0.00015332735,0.96628433,0.000091334085,0.000041083837,0.00004275051,0.000013030662,0.00012486972,0.0017611411],"genre_scores_gemma":[0.95809746,0.000101218495,0.04025073,0.00005211957,0.000040767507,0.000054213036,0.000019659956,0.000010626709,0.0013732109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973613,0.00008048103,0.000013811421,0.00006549529,0.0000712488,0.000032794007],"domain_scores_gemma":[0.99972373,0.00009549195,0.00006586083,0.000029241708,0.00006338711,0.000022173077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043285405,0.00041152255,0.00047982266,0.00021243942,0.00036604513,0.00035834062,0.0007293636,0.00039616466,0.0008730166],"category_scores_gemma":[0.0010054398,0.00013755202,0.00018250213,0.0003094017,0.0003735719,0.0005708761,0.0004947265,0.00043181735,0.00014566451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011191377,0.00008981982,0.00049281993,0.000058892692,0.000027779228,0.000096973636,0.000098829885,0.84852904,0.01546728,0.013621998,0.0013813223,0.12002329],"study_design_scores_gemma":[0.00000871446,0.000047154917,0.000095774034,0.0000016945773,0.0000032015444,0.000021002079,0.0000058262126,0.9971214,0.0006321334,0.0017024896,0.00035724562,0.0000034069442],"about_ca_topic_score_codex":0.00097478007,"about_ca_topic_score_gemma":0.0018427321,"teacher_disagreement_score":0.00097478007,"about_ca_system_score_codex":0.00032368265,"about_ca_system_score_gemma":0.00039264225,"threshold_uncertainty_score":0.002920568},"labels":[],"label_agreement":null},{"id":"W4413181514","doi":"10.1109/gcwkshp64532.2024.11100909","title":"Robust Resource Allocation for Over-The-Air Computation Networks with Fluid Antenna Array","year":2024,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computation; Computer science; Resource allocation; Antenna array; Antenna (radio); Distributed computing; Telecommunications; Computer network; Algorithm","score_opus":0.01567024155683539,"score_gpt":0.22948518894862374,"score_spread":0.21381494739178836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413181514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037743233,0.00026921649,0.95930886,0.00023321752,0.000043409324,0.000023944734,0.000024079865,0.00014743012,0.002206548],"genre_scores_gemma":[0.93660676,0.00015556603,0.06164944,0.00008374184,0.000028047063,0.00006432079,0.000029794135,0.000028465354,0.0013538727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994697,0.00022058786,0.000017088376,0.00007932246,0.000099500154,0.00011394233],"domain_scores_gemma":[0.9991831,0.00050916045,0.000105150975,0.00006043763,0.00009300636,0.000049094033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073684443,0.00061606494,0.00069028686,0.00023700805,0.000462191,0.00083074055,0.0006487438,0.00051605655,0.00086222286],"category_scores_gemma":[0.002685232,0.00021773824,0.00025019297,0.00035243607,0.00088600407,0.0010656253,0.0013253159,0.0007244539,0.00014419743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062893436,0.00001307919,0.00019053837,0.000017075929,0.000009611414,0.00004690275,0.000025287758,0.9787184,0.0022913741,0.0074775857,0.00041150165,0.010735687],"study_design_scores_gemma":[0.0000024000576,0.000010402493,0.00002443753,8.956651e-7,0.0000013396299,0.000004617558,0.0000057024176,0.9981554,0.00024151591,0.0014277945,0.00012359707,0.0000018610365],"about_ca_topic_score_codex":0.0031001847,"about_ca_topic_score_gemma":0.0028297338,"teacher_disagreement_score":0.0031001847,"about_ca_system_score_codex":0.0006307443,"about_ca_system_score_gemma":0.0009418161,"threshold_uncertainty_score":0.0061643124},"labels":[],"label_agreement":null},{"id":"W4413912307","doi":"10.5267/j.ijdns.2025.7.002","title":"Euler spiral based backoff algorithm for MAC protocol in mobile Ad Hoc networks","year":2025,"lang":"en","type":"article","venue":"International Journal of Data and Network Science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Exponential backoff; Computer science; Computer network; Mobile ad hoc network; Wireless ad hoc network; Algorithm; Spiral (railway); Protocol (science); Distributed coordination function; Mathematics; Throughput; Wireless; IEEE 802.11; Network packet; Telecommunications; Medicine","score_opus":0.020776698309988944,"score_gpt":0.33809318562687624,"score_spread":0.3173164873168873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413912307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01919588,0.001897388,0.9725037,0.00028829774,0.00021187511,0.00016118071,0.00004379631,0.0008547293,0.004843101],"genre_scores_gemma":[0.48803303,0.0026508276,0.5019701,0.00023877478,0.00011556783,0.00041912537,0.00021130886,0.00009062238,0.0062706713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999376,0.0002052382,0.000047180794,0.000062722705,0.0002259003,0.00008298259],"domain_scores_gemma":[0.9992478,0.00033784145,0.00007405128,0.00008989271,0.00021052698,0.00003991697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009919334,0.0006279327,0.0005414315,0.0009901597,0.0007073585,0.0007953001,0.00083981355,0.00064357184,0.0014966719],"category_scores_gemma":[0.0024441958,0.00023515601,0.00031859157,0.00068918447,0.0005714042,0.0009757153,0.0006801167,0.0008286577,0.0005292837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064626243,0.00012140214,0.0024371855,0.0003867771,0.00007460526,0.00032376833,0.00050735247,0.20553438,0.031635072,0.097929575,0.007453081,0.65295047],"study_design_scores_gemma":[0.00009424261,0.0004342339,0.00079583173,0.000093034476,0.000035665682,0.00063337275,0.0001234822,0.92794985,0.014959462,0.03626613,0.018557047,0.000057628466],"about_ca_topic_score_codex":0.0015635205,"about_ca_topic_score_gemma":0.0012489312,"teacher_disagreement_score":0.0015635205,"about_ca_system_score_codex":0.00067232817,"about_ca_system_score_gemma":0.0013568714,"threshold_uncertainty_score":0.005245924},"labels":[],"label_agreement":null},{"id":"W4414188729","doi":"10.18280/isi.300702","title":"Impact of Deployment Strategies and Mobility Models on MANET Routing Protocols: A Performance Evaluation","year":2025,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Software deployment; Routing (electronic design automation); Key (lock); Mobile ad hoc network; Routing protocol; Mobility model","score_opus":0.029787942524699844,"score_gpt":0.30331183798896516,"score_spread":0.2735238954642653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414188729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95529133,0.0031837695,0.034187976,0.0005134226,0.00018300589,0.00034406505,0.00033825563,0.0004324155,0.005525836],"genre_scores_gemma":[0.99011165,0.0008902764,0.008321267,0.000039262934,0.000030226367,0.0000742363,0.00016822168,0.000030776475,0.0003341236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953057,0.002359102,0.00034487116,0.00037276663,0.001122853,0.0004945965],"domain_scores_gemma":[0.97279286,0.021059623,0.002118083,0.0013502341,0.0022587508,0.00042033262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047922144,0.0017765007,0.0006958147,0.0016828097,0.00056299265,0.0010647379,0.0008012513,0.00091270846,0.000502033],"category_scores_gemma":[0.01674727,0.00028490802,0.00053034315,0.0013012196,0.0007208051,0.001801562,0.0008134475,0.0007307056,0.00012468523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009850356,0.0007860922,0.015468619,0.00049394893,0.00024639702,0.00030182773,0.00015603566,0.9103634,0.009875465,0.0020039626,0.00091005064,0.058409285],"study_design_scores_gemma":[0.000074819574,0.00438533,0.008246772,0.00007297857,0.0003207675,0.0004943942,0.00038845383,0.9659981,0.017835243,0.00090707693,0.0011954191,0.00008064936],"about_ca_topic_score_codex":0.001883418,"about_ca_topic_score_gemma":0.0019124545,"teacher_disagreement_score":0.0047922144,"about_ca_system_score_codex":0.0013351502,"about_ca_system_score_gemma":0.0006906543,"threshold_uncertainty_score":0.025343955},"labels":[],"label_agreement":null},{"id":"W4414807368","doi":"10.1016/b978-0-443-22392-1.00001-8","title":"Surviving mixed traffic","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Neurotrauma Foundation","funders":"","keywords":"Government (linguistics); Service (business); Key (lock); Automation; Critical infrastructure; Service provider","score_opus":0.0119185389976846,"score_gpt":0.2205884470552161,"score_spread":0.2086699080575315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414807368","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032328624,0.010291469,0.11763344,0.005435656,0.0061813043,0.00007778691,0.00032904794,0.0017538188,0.8259688],"genre_scores_gemma":[0.17844369,0.007633615,0.023123879,0.0015651805,0.0016791472,0.000081168626,0.00055296667,0.0006007545,0.78631973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998165,0.000018493965,0.0000043488685,0.000026266029,0.00008704524,0.00004747046],"domain_scores_gemma":[0.99963796,0.000072818395,0.00001702993,0.00008727348,0.00010985062,0.000075071606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035168914,0.00077073084,0.00046113046,0.00083619356,0.0011243782,0.0023573695,0.00096263253,0.0012813129,0.028301967],"category_scores_gemma":[0.0011443796,0.00031167068,0.0003472796,0.0005415546,0.000755253,0.0031572822,0.0024896434,0.0015772884,0.009815196],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009761099,0.000084491294,0.00057874084,0.0001740464,0.00002860893,0.00063197466,0.0004894327,0.007967047,0.009740297,0.40827417,0.16374545,0.40818813],"study_design_scores_gemma":[0.00001534595,0.0001074056,0.00045260324,0.00018425602,0.000029220531,0.0010217305,0.0005070178,0.032795813,0.004978987,0.29835737,0.6615213,0.000028992365],"about_ca_topic_score_codex":0.0011419555,"about_ca_topic_score_gemma":0.0016557256,"teacher_disagreement_score":0.028301967,"about_ca_system_score_codex":0.0005777004,"about_ca_system_score_gemma":0.00055054313,"threshold_uncertainty_score":0.094679475},"labels":[],"label_agreement":null},{"id":"W4414871532","doi":"10.1109/tnse.2025.3617848","title":"Location-Aware Anti-Jamming Game: An Intelligent Approach for Reliable Wireless Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Stochastic game; Wireless; Jamming; Residual; Transmitter; Key (lock); Interference (communication); Game theory","score_opus":0.01659383210616466,"score_gpt":0.24820799494981027,"score_spread":0.2316141628436456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023615686,0.00016933272,0.9713387,0.0003048204,0.00004885594,0.00007829115,0.000052661588,0.00033537985,0.0040562684],"genre_scores_gemma":[0.75728226,0.00022860157,0.23610201,0.00032360535,0.000071714785,0.00024876473,0.00017287277,0.00011496211,0.0054552737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957556,0.000115809205,0.000017092729,0.00009277663,0.00010789018,0.00009100994],"domain_scores_gemma":[0.9992537,0.0004224501,0.00008385766,0.000049666778,0.00011681253,0.0000734019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007896112,0.0011116845,0.001346452,0.0006057382,0.0005224979,0.0009468249,0.0024560671,0.0014264766,0.003379486],"category_scores_gemma":[0.0019584442,0.0005509048,0.00080020213,0.00044118648,0.0011464488,0.0014949242,0.0013903494,0.002006478,0.00040741733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045261462,0.00004284048,0.00031692616,0.0000421975,0.000024959596,0.00006406808,0.000040329312,0.9683178,0.0013180729,0.012995217,0.00082184165,0.01597045],"study_design_scores_gemma":[0.0000030928106,0.000007884787,0.000017102559,0.000001379782,0.0000019316235,0.0000044321732,0.000002730799,0.9978325,0.0000912303,0.0019457184,0.000090281195,0.0000016587255],"about_ca_topic_score_codex":0.009198964,"about_ca_topic_score_gemma":0.010428589,"teacher_disagreement_score":0.009198964,"about_ca_system_score_codex":0.0013223893,"about_ca_system_score_gemma":0.0018575718,"threshold_uncertainty_score":0.018290818},"labels":[],"label_agreement":null},{"id":"W4416513917","doi":"10.1109/isncc66965.2025.11250471","title":"Distance-Based Loop-Free Routing with Positive and Negative Link Weights","year":2025,"lang":"","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Routing (electronic design automation); Convergence (economics); Link-state routing protocol; Static routing; Routing protocol; Destination-Sequenced Distance Vector routing; Equal-cost multi-path routing","score_opus":0.005769852990863316,"score_gpt":0.21372259114869854,"score_spread":0.20795273815783522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016948918,0.00015836456,0.9780381,0.0000656906,0.000070757305,0.000077718214,0.00003973003,0.0008624362,0.0037383968],"genre_scores_gemma":[0.61865026,0.0003516771,0.3730812,0.000084629064,0.0000736957,0.00017778263,0.00022621514,0.00020140916,0.007153123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991431,0.00017150119,0.00005847161,0.00008826811,0.00046263388,0.00007598614],"domain_scores_gemma":[0.9982924,0.0006124208,0.00024138094,0.0003690349,0.00041898366,0.00006579646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081302534,0.00065851986,0.00068422675,0.0009956842,0.0005999091,0.0011643238,0.0016433039,0.0004872186,0.001510761],"category_scores_gemma":[0.00296754,0.0002736606,0.00045948697,0.00070106646,0.00065007666,0.0014365374,0.0012652177,0.0007947035,0.0004353132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002768163,0.00019646596,0.0010259708,0.0002381059,0.00008428294,0.00028155843,0.00021497089,0.5939136,0.033705253,0.12370807,0.0037472984,0.24260765],"study_design_scores_gemma":[0.000031015396,0.00020004535,0.00018495136,0.000013059482,0.000032250417,0.0002582075,0.000026331863,0.95783395,0.012584996,0.022457812,0.0063349474,0.000042523563],"about_ca_topic_score_codex":0.00081652956,"about_ca_topic_score_gemma":0.0011327276,"teacher_disagreement_score":0.0016433039,"about_ca_system_score_codex":0.0006653043,"about_ca_system_score_gemma":0.0007077678,"threshold_uncertainty_score":0.005053997},"labels":[],"label_agreement":null},{"id":"W49981394","doi":"10.1007/978-0-387-09777-0_8","title":"Network Selection for HeterogeneousWireless Access Networks","year":2008,"lang":"en","type":"book-chapter","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Selection (genetic algorithm); Computer science; Computer network; Artificial intelligence","score_opus":0.029610833658622254,"score_gpt":0.2501392482560554,"score_spread":0.22052841459743314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W49981394","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009619141,0.019845555,0.84860665,0.00085591583,0.0015205242,0.00014913094,0.00024693584,0.0013229359,0.11783326],"genre_scores_gemma":[0.29825315,0.031183625,0.3596606,0.00073266594,0.0026828896,0.0004159281,0.0013392717,0.0006123504,0.30511948],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99976903,0.00003798826,0.00000930517,0.00003815873,0.00012141563,0.000024116036],"domain_scores_gemma":[0.9997507,0.00013391057,0.00001208768,0.000027582297,0.000060094073,0.000015759264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003254566,0.00061069155,0.00046402126,0.00057431526,0.00044169778,0.0009522729,0.0008454138,0.0003691562,0.011140367],"category_scores_gemma":[0.0007293563,0.00020607538,0.00018280446,0.0009172191,0.00023151265,0.000983707,0.0004917739,0.0005842959,0.0026547066],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010503745,0.000044326058,0.00037507535,0.00026825527,0.000028590464,0.00026341924,0.00007388659,0.024346335,0.011818208,0.07237,0.051175408,0.8391314],"study_design_scores_gemma":[0.000055164022,0.00023477674,0.001302792,0.00024594387,0.00009334109,0.0016897256,0.00014194184,0.40159485,0.014446795,0.14156611,0.43856207,0.00006652782],"about_ca_topic_score_codex":0.0005676903,"about_ca_topic_score_gemma":0.0014106532,"teacher_disagreement_score":0.011140367,"about_ca_system_score_codex":0.00045447794,"about_ca_system_score_gemma":0.00029725253,"threshold_uncertainty_score":0.03726828},"labels":[],"label_agreement":null},{"id":"W581120286","doi":"10.71781/9630","title":"Un outil de conception pour les réseaux maillés sans fil","year":2008,"lang":"fr","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Network planning and design; Heuristic; Wireless network; Scalability; Reliability (semiconductor); Interface (matter); Computer network; Distributed computing; Throughput; Key (lock); Wireless; Power (physics); Telecommunications","score_opus":0.009793575905867019,"score_gpt":0.18919729804761662,"score_spread":0.1794037221417496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W581120286","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097619,0.006610106,0.9354767,0.004417168,0.0018767413,0.00037700136,0.0019963002,0.002948766,0.0365352],"genre_scores_gemma":[0.10812317,0.007057502,0.7711542,0.0011519396,0.0021309038,0.00092747086,0.0041446122,0.002146601,0.10316364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99158466,0.002732199,0.0006202837,0.0014579713,0.0030339968,0.00057090895],"domain_scores_gemma":[0.98856956,0.003764155,0.00046081629,0.0016038377,0.0051471596,0.00045444665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0094923545,0.0023258862,0.0014138247,0.0059752245,0.003726687,0.017894981,0.0035407399,0.0031431918,0.013901902],"category_scores_gemma":[0.02328867,0.0013533978,0.002423135,0.004581341,0.005988079,0.013033881,0.0023656907,0.0050461343,0.006596177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012486598,0.00010419758,0.002870027,0.0004672538,0.00005699948,0.00034245677,0.0041294345,0.0043499027,0.0027959077,0.7988391,0.02774736,0.1581725],"study_design_scores_gemma":[0.000055802306,0.00012585933,0.002780476,0.0007049664,0.00007813406,0.0010482555,0.002675076,0.035401765,0.006787013,0.13667262,0.8134799,0.00019014598],"about_ca_topic_score_codex":0.10074879,"about_ca_topic_score_gemma":0.041289415,"teacher_disagreement_score":0.10074879,"about_ca_system_score_codex":0.009245628,"about_ca_system_score_gemma":0.01228085,"threshold_uncertainty_score":0.20032471},"labels":[],"label_agreement":null},{"id":"W62856139","doi":"10.1007/978-3-642-40164-0_22","title":"Approximation Algorithms for the Antenna Orientation Problem","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Beamwidth; Omnidirectional antenna; Computer science; Orientation (vector space); Antenna (radio); Algorithm; Fan-beam antenna; Coaxial antenna; Mathematics; Telecommunications; Geometry","score_opus":0.018963664152656955,"score_gpt":0.24769109992354968,"score_spread":0.22872743577089272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62856139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043338705,0.0014201821,0.9809894,0.0005135636,0.00020576098,0.00007513877,0.00023013148,0.00061780564,0.011614149],"genre_scores_gemma":[0.14032601,0.0034019605,0.83463347,0.00045584928,0.0006791004,0.0005676529,0.0017825908,0.0007619768,0.017391462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849784,0.00047861063,0.000065045024,0.00027484534,0.00042656733,0.00025708097],"domain_scores_gemma":[0.9967591,0.002146372,0.00017478022,0.0005308081,0.00026680937,0.00012216902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015670991,0.0030359684,0.0024876087,0.001458277,0.0009368664,0.002842096,0.0042962944,0.0025437206,0.013421649],"category_scores_gemma":[0.008228468,0.0011370318,0.0019604575,0.004045193,0.0013437811,0.0046041585,0.0031608215,0.0055176094,0.004329919],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037818195,0.00035397615,0.0007559547,0.000480287,0.00010885088,0.00009780146,0.00019776533,0.47474504,0.0016468307,0.15180188,0.04001326,0.32942012],"study_design_scores_gemma":[0.00011932697,0.000057627738,0.0001736459,0.00006791515,0.000037955157,0.00013512623,0.00007913733,0.802774,0.00055772945,0.1880922,0.007886547,0.000018678218],"about_ca_topic_score_codex":0.004310024,"about_ca_topic_score_gemma":0.004375786,"teacher_disagreement_score":0.013421649,"about_ca_system_score_codex":0.002229042,"about_ca_system_score_gemma":0.0016839395,"threshold_uncertainty_score":0.04489988},"labels":[],"label_agreement":null},{"id":"W64125330","doi":"","title":"Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing","year":2010,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Wireless ad hoc network; Eleventh; Variety (cybernetics); Telecommunications; Library science; World Wide Web; Wireless; Artificial intelligence","score_opus":0.008007374313359572,"score_gpt":0.23148356744364942,"score_spread":0.22347619313028985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W64125330","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008546027,0.1974461,0.13178062,0.043150764,0.27131763,0.002006777,0.004967631,0.006543616,0.33424082],"genre_scores_gemma":[0.021045238,0.1104549,0.039617345,0.0075939065,0.044434384,0.00076125015,0.008222114,0.00169368,0.7661771],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967249,0.0008225371,0.00025925363,0.00050566864,0.0014343386,0.000253284],"domain_scores_gemma":[0.9902862,0.002472966,0.00045585423,0.00089519203,0.003853981,0.002035856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003932571,0.0019692031,0.0022224255,0.0019675377,0.0012200762,0.0062242174,0.0018913382,0.002237622,0.12757926],"category_scores_gemma":[0.009051687,0.0006616438,0.0010055365,0.0017862754,0.00096435135,0.005781047,0.002612865,0.005415451,0.09943458],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010911439,0.000089864945,0.0005631604,0.00056706386,0.000058197118,0.00017499636,0.00012867281,0.00027134715,0.0022512435,0.002939547,0.73023474,0.2626121],"study_design_scores_gemma":[0.000011669729,0.00008652896,0.00057804014,0.00028148465,0.00002740921,0.00032791847,0.00010256037,0.0010154629,0.00041535488,0.0020338236,0.99509275,0.000026974185],"about_ca_topic_score_codex":0.0013965898,"about_ca_topic_score_gemma":0.0022383279,"teacher_disagreement_score":0.12757926,"about_ca_system_score_codex":0.00092525565,"about_ca_system_score_gemma":0.0022148865,"threshold_uncertainty_score":0.42679513},"labels":[],"label_agreement":null},{"id":"W6893012117","doi":"10.5281/zenodo.1305883","title":"Top 10 Routing Papers: Recommended Reading – Network Research","year":2018,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Routing (electronic design automation); DSRFLOW; Dynamic Source Routing; Static routing; Policy-based routing; Network packet; Destination-Sequenced Distance Vector routing; Link-state routing protocol","score_opus":0.05140414305278571,"score_gpt":0.2817422176174597,"score_spread":0.230338074564674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893012117","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011773123,0.051900215,0.0096429465,0.048126925,0.32939944,0.0007772152,0.008610182,0.0037753698,0.5465903],"genre_scores_gemma":[0.004649511,0.044477005,0.00563284,0.0061006118,0.06199743,0.0002525894,0.010765411,0.0012086483,0.86491597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986004,0.00020731594,0.000099026416,0.0003004368,0.0006899824,0.000102769474],"domain_scores_gemma":[0.99122846,0.00077006675,0.00040173624,0.00063936313,0.005707387,0.001252877],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001828104,0.0021804858,0.0022941597,0.004316852,0.0013132453,0.007030855,0.002111337,0.0029408894,0.42346963],"category_scores_gemma":[0.0061852206,0.0007755366,0.0010437568,0.006492316,0.00052434515,0.0041619255,0.00125319,0.0025508201,0.43356204],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019241583,0.000030761454,0.00008341767,0.00024752447,0.000006807939,0.000019579873,0.0000043469286,0.00018994584,0.0001829125,0.0008549875,0.93322307,0.06513744],"study_design_scores_gemma":[0.000012642203,0.00002920325,0.00035917287,0.0003323024,0.000014997118,0.00005063502,0.0000178949,0.00031925712,0.00016168953,0.001736021,0.9969522,0.000013954077],"about_ca_topic_score_codex":0.0021024374,"about_ca_topic_score_gemma":0.005116173,"teacher_disagreement_score":0.42346963,"about_ca_system_score_codex":0.0018829366,"about_ca_system_score_gemma":0.0020861987,"threshold_uncertainty_score":0.8223506},"labels":[],"label_agreement":null},{"id":"W6901734922","doi":"10.60692/hqjpj-38043","title":"Clustering and reliability-driven mitigation of routing attacks in massive IoT systems","year":2019,"lang":"en","type":"article","venue":"Greater South Information System","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Sinkhole; Intrusion detection system; Routing (electronic design automation); Exploit; Internet of Things; Cluster analysis; The Internet","score_opus":0.013010778862914898,"score_gpt":0.20283802021420574,"score_spread":0.18982724135129084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6901734922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3544585,0.0010637916,0.63488686,0.000694988,0.00014555865,0.00017146995,0.00008881054,0.0018393461,0.006650676],"genre_scores_gemma":[0.97818655,0.00014751831,0.02076715,0.000040973144,0.000023575954,0.00002217419,0.000045739063,0.000028520213,0.00073779974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.00013451074,0.000037057012,0.00011171834,0.00020905441,0.00009522444],"domain_scores_gemma":[0.9980344,0.00056385226,0.00042510952,0.00043392836,0.0004264316,0.000116319155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007877748,0.00054073555,0.00052479317,0.00089593395,0.00054112065,0.00060745986,0.00073059805,0.00047999536,0.0005496253],"category_scores_gemma":[0.003140151,0.00022313664,0.00032257548,0.00041801314,0.00045500742,0.0010688875,0.0010011657,0.00041917452,0.0002533087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035883472,0.00015045235,0.007997254,0.00017637198,0.000111160494,0.0003770825,0.00034836252,0.7532199,0.059200708,0.018064164,0.0028821551,0.15711349],"study_design_scores_gemma":[0.000012540298,0.0002151656,0.0027700455,0.000014281357,0.000029686493,0.00025067304,0.00012488972,0.9779384,0.0088051,0.0076600234,0.0021612726,0.000017999211],"about_ca_topic_score_codex":0.0012806973,"about_ca_topic_score_gemma":0.0014142058,"teacher_disagreement_score":0.0012806973,"about_ca_system_score_codex":0.0005955461,"about_ca_system_score_gemma":0.000530325,"threshold_uncertainty_score":0.004320979},"labels":[],"label_agreement":null},{"id":"W6907379118","doi":"10.20381/ruor-4847","title":"Multi-retransmission Route Discovery Schemes for Ad Hoc Wireless Network with a Realistic Physical Layer","year":2011,"lang":"en","type":"article","venue":"Library and Archives Canada (Government of Canada)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Retransmission; Network packet; Overhead (engineering); Node (physics); Physical layer; Wireless ad hoc network; Scheme (mathematics); Neighbor Discovery Protocol","score_opus":0.008559155496705648,"score_gpt":0.16330935119389856,"score_spread":0.1547501956971929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907379118","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14556073,0.003866677,0.84561497,0.0003657722,0.0002939376,0.00039125115,0.0001047028,0.0015347097,0.002267263],"genre_scores_gemma":[0.72161263,0.001315847,0.27415043,0.00013725334,0.00012867078,0.00022569508,0.00019842254,0.00006712275,0.0021638768],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978872,0.0008898376,0.00019359328,0.00019211309,0.00071247487,0.00012487633],"domain_scores_gemma":[0.9956292,0.0011988288,0.0008435313,0.0015431085,0.0006958274,0.0000895232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030196572,0.00063072896,0.00061317027,0.00087994913,0.0005247004,0.0005727876,0.002182352,0.0006770222,0.00073706853],"category_scores_gemma":[0.0050232895,0.0002739577,0.0006514358,0.00054903945,0.00046884932,0.001951996,0.0007390692,0.0007383824,0.00040897308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017362839,0.0009860635,0.004731956,0.0012325536,0.00046456963,0.00075457344,0.0007092508,0.338905,0.14317417,0.033632047,0.004653526,0.46901986],"study_design_scores_gemma":[0.00021986557,0.002342907,0.0022962876,0.000059243946,0.00022934882,0.0016243125,0.0001157995,0.94459283,0.033381294,0.006146863,0.008805958,0.00018526532],"about_ca_topic_score_codex":0.00087193627,"about_ca_topic_score_gemma":0.0015661295,"teacher_disagreement_score":0.0030196572,"about_ca_system_score_codex":0.000757503,"about_ca_system_score_gemma":0.00058935006,"threshold_uncertainty_score":0.015969694},"labels":[],"label_agreement":null},{"id":"W69307075","doi":"10.1007/978-1-4614-6357-3_2","title":"Routing for Wireless Multi-Hop Networks: Unifying Features","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Wireless Routing Protocol; Computer network; Computer science; Dynamic Source Routing; Zone Routing Protocol; Link-state routing protocol; Distributed computing; Routing Information Protocol; Routing protocol; Static routing; Enhanced Interior Gateway Routing Protocol; Routing (electronic design automation)","score_opus":0.023406792562072773,"score_gpt":0.25182731530065106,"score_spread":0.22842052273857827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W69307075","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004417492,0.13713974,0.74968857,0.0037574314,0.0062855254,0.00023114348,0.00023248495,0.0014232937,0.0968244],"genre_scores_gemma":[0.11276043,0.22878955,0.5298878,0.0021413134,0.0134375775,0.00070742914,0.0007843352,0.0011594476,0.11033212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922514,0.00011947141,0.00007741548,0.00015259831,0.00036529498,0.00006008294],"domain_scores_gemma":[0.9994961,0.00020929953,0.000038889673,0.00013260935,0.00008905245,0.00003413604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767934,0.0015517059,0.0014615211,0.0013235947,0.000603148,0.00387691,0.002057032,0.0020018686,0.004900332],"category_scores_gemma":[0.0015769618,0.00069589104,0.0010523825,0.0032881391,0.0015070294,0.009321785,0.0025475612,0.002433326,0.0027040218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003700877,0.000055206154,0.0001136,0.00097259803,0.00003247229,0.00011179422,0.00022167989,0.006888388,0.004077605,0.5402522,0.019376775,0.42786074],"study_design_scores_gemma":[0.000025355725,0.00015764424,0.00025445802,0.00042611462,0.000089700145,0.0013304335,0.00012106165,0.032069895,0.0021176613,0.42381513,0.5395327,0.00005989512],"about_ca_topic_score_codex":0.00030301992,"about_ca_topic_score_gemma":0.00045334708,"teacher_disagreement_score":0.004900332,"about_ca_system_score_codex":0.0007162461,"about_ca_system_score_gemma":0.000700643,"threshold_uncertainty_score":0.016393244},"labels":[],"label_agreement":null},{"id":"W6986627826","doi":"","title":"Propagation Characteristics for Modern Wireless System Networks in Underground Mine Galleries","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wireless; Ground-penetrating radar; Ray tracing (physics); Cascade; Wave propagation; Tracing; Surface finish","score_opus":0.012508784374137815,"score_gpt":0.22193992459969397,"score_spread":0.20943114022555614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986627826","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91791564,0.0006782205,0.07561596,0.00016266134,0.000017242779,0.000025944235,0.0002027893,0.00024877634,0.005132748],"genre_scores_gemma":[0.99555284,0.00025977244,0.0031759941,0.000009652738,0.0000066721277,0.00001106141,0.00008774744,0.000013336069,0.000882867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99981314,0.000047614303,0.000008755118,0.000019862986,0.00007160389,0.000039038696],"domain_scores_gemma":[0.99844486,0.00095343107,0.00018898209,0.00007405573,0.0002870382,0.00005158507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040918132,0.00023236824,0.00015322892,0.00075043016,0.00029277266,0.00032590932,0.00018503863,0.00035819702,0.0014315437],"category_scores_gemma":[0.001917669,0.00012815952,0.00013772053,0.000847284,0.00030195172,0.0005216032,0.00026206387,0.0002398382,0.00023139038],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008163978,0.00010963407,0.06467284,0.00028594115,0.000081821105,0.0011407775,0.001345225,0.714159,0.114327416,0.01789176,0.0022172201,0.08295192],"study_design_scores_gemma":[0.000013864789,0.00037491866,0.039343152,0.00002904601,0.00003183473,0.0013837052,0.00044508156,0.9387049,0.012954812,0.0036924342,0.0029803424,0.00004583589],"about_ca_topic_score_codex":0.0024623838,"about_ca_topic_score_gemma":0.002185148,"teacher_disagreement_score":0.0024623838,"about_ca_system_score_codex":0.0004602936,"about_ca_system_score_gemma":0.00017334717,"threshold_uncertainty_score":0.0048961043},"labels":[],"label_agreement":null},{"id":"W6986654550","doi":"","title":"Proceedings of the 12th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM'09","year":2009,"lang":"en","type":"other","venue":"Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless network; Cover (algebra); Session (web analytics); Wireless; Wireless ad hoc network; Gratitude; Key (lock); Wireless site survey; Dominion; Wi-Fi array","score_opus":0.01602663254989611,"score_gpt":0.23529239102985972,"score_spread":0.2192657584799636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986654550","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015373004,0.03831838,0.78937215,0.011093032,0.02388473,0.0011048203,0.0059535964,0.014243035,0.10065724],"genre_scores_gemma":[0.10196058,0.0626861,0.5128952,0.0035460456,0.0041703326,0.0021331506,0.030896822,0.0052392017,0.27647254],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99780804,0.00072882057,0.00019825902,0.00029711073,0.00080399425,0.0001638448],"domain_scores_gemma":[0.9963558,0.0011592673,0.000098843586,0.00089636695,0.0010296492,0.000460156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033045246,0.0020775145,0.002168185,0.0011915643,0.0006918115,0.004734041,0.0029033704,0.0020355133,0.052416194],"category_scores_gemma":[0.006474912,0.0011114776,0.0016458648,0.0009537298,0.0010406997,0.0037296554,0.0034680201,0.0042121764,0.019951325],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004907159,0.00072961673,0.0032588793,0.00078520225,0.0003695591,0.00041085333,0.0003724635,0.032569174,0.0047133164,0.022501497,0.58361447,0.35018423],"study_design_scores_gemma":[0.00009537535,0.00020019452,0.0020790491,0.00054104044,0.00018543276,0.0005182781,0.00024368563,0.13617165,0.0021121893,0.019415798,0.8383489,0.000088398185],"about_ca_topic_score_codex":0.01190602,"about_ca_topic_score_gemma":0.012937019,"teacher_disagreement_score":0.052416194,"about_ca_system_score_codex":0.0012785827,"about_ca_system_score_gemma":0.0028744983,"threshold_uncertainty_score":0.17534965},"labels":[],"label_agreement":null},{"id":"W6988160039","doi":"","title":"Wireless networks and walks in the quarter plane","year":2010,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Wireless network; Wireless; Plane (geometry); Wireless sensor network; Quarter (Canadian coin)","score_opus":0.005856578933440574,"score_gpt":0.19708602514568405,"score_spread":0.19122944621224347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6988160039","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.58969456,0.003629984,0.3651797,0.0017394536,0.00030753438,0.000116107694,0.0004475529,0.00038398526,0.03850117],"genre_scores_gemma":[0.97560513,0.0016595908,0.01250228,0.00012329793,0.00012852991,0.000053159903,0.00026776033,0.000112312424,0.009547999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990897,0.00036970456,0.000027923896,0.000117187985,0.00022283317,0.00017262899],"domain_scores_gemma":[0.996003,0.0025623196,0.00039619498,0.00036571038,0.00040236374,0.0002704433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010957563,0.0005335802,0.0010291145,0.001977038,0.0009175106,0.0024830478,0.00068481785,0.0010613662,0.0053255255],"category_scores_gemma":[0.008335164,0.00036686592,0.0005422501,0.002833264,0.0013488445,0.0023797783,0.0012433531,0.0010148315,0.0007697476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005766711,0.00013766244,0.004715724,0.00012864718,0.00007415624,0.00021645376,0.00034270258,0.51962316,0.0056029395,0.42,0.0052988566,0.043282952],"study_design_scores_gemma":[0.000017965334,0.0000768485,0.0017577735,0.000017097105,0.000012196932,0.00016951158,0.00015494628,0.90166736,0.0011717334,0.09267481,0.0022601318,0.000019532155],"about_ca_topic_score_codex":0.0023440935,"about_ca_topic_score_gemma":0.0015100439,"teacher_disagreement_score":0.0053255255,"about_ca_system_score_codex":0.001184584,"about_ca_system_score_gemma":0.0005889923,"threshold_uncertainty_score":0.01781565},"labels":[],"label_agreement":null},{"id":"W6992884886","doi":"","title":"A mobile agent based routing protocol for mobile ad hoc networks","year":2004,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Wireless Routing Protocol; Dynamic Source Routing; Link-state routing protocol; Destination-Sequenced Distance Vector routing; Zone Routing Protocol; Static routing; Optimized Link State Routing Protocol; Enhanced Interior Gateway Routing Protocol","score_opus":0.015709525841372203,"score_gpt":0.24196977571153547,"score_spread":0.22626024987016327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6992884886","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022844141,0.019854683,0.8930285,0.0025668934,0.004586293,0.003611648,0.001769247,0.009894275,0.062404074],"genre_scores_gemma":[0.06383473,0.02158017,0.81384975,0.0037949665,0.0020513858,0.008183583,0.00807993,0.0008025221,0.07782311],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978224,0.00060784706,0.00026499797,0.00026699033,0.00091008755,0.00012761196],"domain_scores_gemma":[0.9988299,0.00034333774,0.00017393388,0.00016572434,0.00037467724,0.00011233979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012281238,0.0013729569,0.0017193363,0.0014685295,0.0016011015,0.0025934181,0.0031669815,0.0030286196,0.0126224235],"category_scores_gemma":[0.0024896385,0.0005417893,0.0009956278,0.0027490037,0.0011396403,0.0030764034,0.0024569985,0.003944549,0.010490531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031651414,0.0003163113,0.0005853234,0.0029203007,0.00030201612,0.0015863226,0.00058491266,0.021979883,0.02192676,0.18945304,0.23234908,0.5276796],"study_design_scores_gemma":[0.0002062483,0.000325146,0.00028804058,0.00032230077,0.00012777811,0.001294249,0.000103687686,0.039975416,0.003940237,0.03182735,0.9214299,0.00015974442],"about_ca_topic_score_codex":0.0016880867,"about_ca_topic_score_gemma":0.0024454994,"teacher_disagreement_score":0.0126224235,"about_ca_system_score_codex":0.0010350188,"about_ca_system_score_gemma":0.0018498827,"threshold_uncertainty_score":0.042226195},"labels":[],"label_agreement":null},{"id":"W6998475501","doi":"","title":"Advanced Wireless Networks for Underground Mine Communications","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Wireless network; Wireless; Network topology; Heterogeneous network; Bandwidth (computing); Wireless WAN; Wi-Fi array; Wi-Fi","score_opus":0.02005905956975642,"score_gpt":0.2704037548485782,"score_spread":0.2503446952788218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6998475501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006328711,0.23314208,0.525737,0.02822054,0.01670387,0.00019505655,0.0003186094,0.0009971553,0.188357],"genre_scores_gemma":[0.14231852,0.3290297,0.3123392,0.0065741986,0.012231758,0.00050028675,0.0011237548,0.00028890438,0.1955936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970955,0.00007953893,0.000015097356,0.000038194397,0.0001358666,0.000021654609],"domain_scores_gemma":[0.99950147,0.0001737732,0.00003977812,0.00006306668,0.00017847748,0.00004345527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050893065,0.00047447826,0.00030477074,0.00053681,0.00046793604,0.0011290304,0.00068360363,0.0012738779,0.010141722],"category_scores_gemma":[0.001179855,0.0001447199,0.00019021443,0.00089748343,0.00062042323,0.002387877,0.0010617484,0.0020789485,0.004393529],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046904854,0.00003677162,0.00031782285,0.00090558047,0.000024756258,0.00037409726,0.00014969941,0.005697935,0.008710261,0.48162887,0.079236,0.42287135],"study_design_scores_gemma":[0.000008682192,0.0000462941,0.00018464754,0.00024922722,0.00001508213,0.00045090046,0.0000505761,0.008367339,0.0010863262,0.114248574,0.8752731,0.000019151541],"about_ca_topic_score_codex":0.00043299704,"about_ca_topic_score_gemma":0.0007509381,"teacher_disagreement_score":0.010141722,"about_ca_system_score_codex":0.0004660833,"about_ca_system_score_gemma":0.000585821,"threshold_uncertainty_score":0.03392744},"labels":[],"label_agreement":null},{"id":"W7010193342","doi":"","title":"Health equity and rurality in Northern Ontario","year":2021,"lang":"en","type":"dissertation","venue":"Lu Zone Ul (Laurentian University)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rurality; Health equity; Equity (law); Descriptive statistics; Health care; Context (archaeology); Thematic analysis; Operationalization; Rural area; Socioeconomic status","score_opus":0.012297270947264446,"score_gpt":0.23170393755968613,"score_spread":0.2194066666124217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010193342","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87445134,0.002785619,0.0006955943,0.014469895,0.00006812746,0.00024787872,0.0014057664,0.00002721399,0.10584862],"genre_scores_gemma":[0.9927563,0.0010669949,0.00027284696,0.00047212746,0.000009814274,0.000061906736,0.0001376322,0.0000052470036,0.0052171806],"study_design_codex":"qualitative","study_design_gemma":"observational","domain_scores_codex":[0.99797946,0.0004125903,0.00005519265,0.00016226075,0.0005506923,0.00083982875],"domain_scores_gemma":[0.9966551,0.00065440906,0.0005360236,0.00009919583,0.00085202366,0.0012032201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018924313,0.00013509062,0.00021604517,0.0007879245,0.008690459,0.0026199962,0.0007699607,0.0003358406,0.0047725854],"category_scores_gemma":[0.0033966287,0.00014299578,0.00015683573,0.0024356432,0.0042633973,0.000712336,0.0026815645,0.00059054943,0.00012460131],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001767233,0.000100940124,0.36680782,0.0013971021,0.00005423689,0.0021827149,0.41659898,0.00093653577,0.0014194525,0.063721865,0.031092491,0.11551105],"study_design_scores_gemma":[0.000021621066,0.000075337084,0.5915036,0.0007569963,0.000026306448,0.00027936904,0.27329287,0.00036639147,0.00022931778,0.0038343046,0.12956898,0.000044883494],"about_ca_topic_score_codex":0.9811265,"about_ca_topic_score_gemma":0.9923453,"teacher_disagreement_score":0.065622635,"about_ca_system_score_codex":0.065622635,"about_ca_system_score_gemma":0.11935044,"threshold_uncertainty_score":0.47612774},"labels":[],"label_agreement":null},{"id":"W7011933689","doi":"","title":"A Novel Solution for Achieving Anonymity in Wireless Ad Hoc Routing Protocol","year":2004,"lang":"en","type":"article","venue":"NPARC","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless Routing Protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Dynamic Source Routing; Routing protocol; Destination-Sequenced Distance Vector routing","score_opus":0.022830818766550225,"score_gpt":0.27499974192866833,"score_spread":0.2521689231621181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7011933689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012486078,0.0012684012,0.97667956,0.0008795796,0.00062125764,0.0003150322,0.000061630424,0.0007901923,0.0068983976],"genre_scores_gemma":[0.3494546,0.0021918435,0.6296472,0.0012985488,0.0007944026,0.000808673,0.0002754879,0.00012733736,0.015401831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.0011269868,0.00024461822,0.00036141407,0.0011605024,0.00026251114],"domain_scores_gemma":[0.9980725,0.0005714541,0.00029623674,0.0004421108,0.0005004314,0.00011724219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025137712,0.000660511,0.0007442431,0.0010420702,0.0026739722,0.001753424,0.0021317787,0.0019269731,0.0011810743],"category_scores_gemma":[0.0036767565,0.0003316041,0.0008899099,0.00096017634,0.0015324799,0.005356979,0.003379711,0.0019260497,0.00066392095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068141834,0.0003360095,0.0014734415,0.0010381753,0.00029074654,0.0012463962,0.0020694344,0.023078725,0.052540127,0.521727,0.016572649,0.37894583],"study_design_scores_gemma":[0.0004327572,0.0021002595,0.0010385356,0.00027483728,0.0005503672,0.006163136,0.0011060279,0.30341533,0.07254278,0.2611417,0.35087505,0.00035917878],"about_ca_topic_score_codex":0.00037660752,"about_ca_topic_score_gemma":0.00047028522,"teacher_disagreement_score":0.0026739722,"about_ca_system_score_codex":0.000753486,"about_ca_system_score_gemma":0.0015082655,"threshold_uncertainty_score":0.01329422},"labels":[],"label_agreement":null},{"id":"W7017164884","doi":"","title":"Ad-hoc, mobile, and wireless networks second international conference, ADHOC-NOW 2003, Montreal, Canada, October 8 - 10, 2003 ; proceedings","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless network; Wireless; Key (lock); Intelligent Network","score_opus":0.007323828434537227,"score_gpt":0.2042565718137975,"score_spread":0.19693274337926028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017164884","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08145693,0.072491005,0.31290492,0.032415546,0.06496349,0.0017721899,0.006315811,0.011341277,0.41633883],"genre_scores_gemma":[0.07858835,0.033987436,0.03763456,0.001406305,0.0031392213,0.00019714476,0.005241257,0.00088894943,0.8389168],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994035,0.00008478728,0.000021269028,0.00006923113,0.00030594456,0.0001152178],"domain_scores_gemma":[0.9974915,0.00026385492,0.000044647426,0.0001445581,0.0016194023,0.0004360344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020296818,0.0011388985,0.0011471518,0.00092952664,0.0013386123,0.0029987164,0.001533723,0.00084834587,0.03125487],"category_scores_gemma":[0.0016416134,0.00041099955,0.0002961979,0.0013133967,0.001274197,0.0015835916,0.0007378067,0.0016556414,0.015814042],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003363152,0.0002834382,0.003171074,0.0002634801,0.000053829168,0.0002805242,0.0003438446,0.0018422755,0.0060051805,0.006051653,0.6957077,0.2856606],"study_design_scores_gemma":[0.00009824409,0.00026007637,0.008716197,0.00024244003,0.00014106407,0.0006506109,0.0010839095,0.03053173,0.008803365,0.0041537443,0.945246,0.00007271779],"about_ca_topic_score_codex":0.16476518,"about_ca_topic_score_gemma":0.3166683,"teacher_disagreement_score":0.16476518,"about_ca_system_score_codex":0.0024332614,"about_ca_system_score_gemma":0.006729536,"threshold_uncertainty_score":0.32761228},"labels":[],"label_agreement":null},{"id":"W7017588482","doi":"","title":"Barite, Anhydrite and Gypsum Reference Materials forIn SituOxygen and Sulfur Isotope Ratio Measurements","year":2024,"lang":"en","type":"article","venue":"Publication Database GFZ (GFZ German Research Centre for Geosciences)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Gypsum; Reproducibility; Isotope; Analytical Chemistry (journal); Mass spectrometry; Sulfur; Anhydrite; Isotope-ratio mass spectrometry","score_opus":0.0815385296728332,"score_gpt":0.3507148280243966,"score_spread":0.26917629835156337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7017588482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6690718,0.0045791217,0.19461022,0.0005188218,0.00041572555,0.002230525,0.048992127,0.003726105,0.07585557],"genre_scores_gemma":[0.62319535,0.003579996,0.23285076,0.00024189311,0.00012681032,0.0017248418,0.0600184,0.0014545277,0.07680749],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987062,0.00008492219,0.00009526939,0.00019753985,0.0008124488,0.00010362561],"domain_scores_gemma":[0.9992066,0.00004105896,0.00009031296,0.00022092025,0.00040785488,0.00003325491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016474106,0.00081933575,0.0004728159,0.0024921005,0.0010899594,0.00091720955,0.0013282355,0.00045751172,0.008464055],"category_scores_gemma":[0.0010832363,0.00037921587,0.0002730367,0.0023351915,0.00044733656,0.00048398605,0.000776256,0.00035661264,0.0028095134],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024429732,0.000046084177,0.010287131,0.00027516246,0.00002974329,0.00019506208,0.00017235917,0.0008609802,0.94072545,0.0027252827,0.0050695087,0.03936899],"study_design_scores_gemma":[0.00006608242,0.00031083348,0.05527958,0.00007956608,0.0000968799,0.0006527219,0.0002459939,0.003483322,0.7114501,0.000990146,0.22730252,0.000042305935],"about_ca_topic_score_codex":0.027462382,"about_ca_topic_score_gemma":0.1045729,"teacher_disagreement_score":0.027462382,"about_ca_system_score_codex":0.001517867,"about_ca_system_score_gemma":0.001462798,"threshold_uncertainty_score":0.054605067},"labels":[],"label_agreement":null},{"id":"W7030728464","doi":"","title":"Norton))Helpline@@&amp;gt;1=800=750=6584&amp;lt;$$$ Norton $@$@$$ customer service phone number","year":2016,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Phone; Service (business); Telephone number; Phone call; Helpline; Telephone line","score_opus":0.014766966466519718,"score_gpt":0.2614727546700089,"score_spread":0.2467057882034892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030728464","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043758194,0.00025526024,0.0006202989,0.00039480015,0.0003321068,0.00005840009,0.0015897441,0.002820497,0.99349123],"genre_scores_gemma":[0.00056629855,0.0001491261,0.00020639133,0.00008245184,0.000021120526,0.000010115529,0.0005498032,0.0003262679,0.9980882],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996805,0.000018253304,0.000012587149,0.00006587714,0.0001759282,0.00004686395],"domain_scores_gemma":[0.99905115,0.00008647995,0.00003523049,0.00009476033,0.00044620858,0.00028613536],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026391583,0.00096550514,0.00066909596,0.0010860654,0.0014739829,0.00488398,0.00091504777,0.0012160207,0.9199985],"category_scores_gemma":[0.0013084774,0.0006050322,0.00038413238,0.0014773182,0.00036919556,0.0023462812,0.0014682015,0.0010560635,0.90754354],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036227506,0.000039753693,0.00016213777,0.00008041587,0.0000014350587,0.00007676139,0.00005740725,0.000042641597,0.00074643927,0.0021150794,0.945479,0.051162712],"study_design_scores_gemma":[0.0000065444447,0.00001335739,0.00026470434,0.000039642182,0.0000020305129,0.00008028051,0.000075603435,0.00006915915,0.0002798799,0.00020342073,0.99895966,0.000005641401],"about_ca_topic_score_codex":0.008097126,"about_ca_topic_score_gemma":0.024449207,"teacher_disagreement_score":0.08000147,"about_ca_system_score_codex":0.0009702649,"about_ca_system_score_gemma":0.0013061969,"threshold_uncertainty_score":0.11411232},"labels":[],"label_agreement":null},{"id":"W7033287227","doi":"","title":"The Reliability and Validity of the Alberta Infant Motor Scale in Japan","year":2009,"lang":"en","type":"dissertation","venue":"Infolib","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Reliability (semiconductor); Scale (ratio); Validity; Measure (data warehouse); Motor activity","score_opus":0.00767330329081048,"score_gpt":0.2383655836868076,"score_spread":0.23069228039599712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033287227","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963288,0.000573986,0.0006140389,0.00007583768,0.00009328976,0.000038780297,0.00021295811,0.000006842838,0.0020555854],"genre_scores_gemma":[0.9976948,0.0003466488,0.0007913702,0.000035981422,0.000037162594,0.00006955127,0.0004355557,0.000015463349,0.0005735289],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9949183,0.0015025242,0.0009921935,0.0008855088,0.0014173156,0.00028409174],"domain_scores_gemma":[0.984922,0.0046380307,0.0018818899,0.0011268846,0.0066506513,0.0007805403],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008358782,0.0006001536,0.0007001291,0.0026527238,0.0008500221,0.0011947317,0.0010771644,0.00065476215,0.0007725397],"category_scores_gemma":[0.025708042,0.0007198591,0.0013436717,0.0019561034,0.0013822827,0.0013390381,0.0016227592,0.00071359164,0.00043192212],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002070639,0.000056217326,0.9872154,0.000039369086,0.0002083151,0.00007804839,0.0018154404,0.00015240455,0.00034375634,0.0001233206,0.00036006668,0.009400487],"study_design_scores_gemma":[0.000023948809,0.000092408794,0.99687046,0.000034344757,0.00011824598,0.000098525066,0.0012945468,0.00059026986,0.0001863694,0.00010639729,0.0005669424,0.000017465252],"about_ca_topic_score_codex":0.039649997,"about_ca_topic_score_gemma":0.050453063,"teacher_disagreement_score":0.039649997,"about_ca_system_score_codex":0.001312939,"about_ca_system_score_gemma":0.002034024,"threshold_uncertainty_score":0.07883841},"labels":[],"label_agreement":null},{"id":"W7039676880","doi":"","title":"A method for assessing the performance of multicast algorithms in wireless networks","year":2004,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Multicast; Protocol Independent Multicast; Pragmatic General Multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Xcast; Inter-domain; Multicast address","score_opus":0.01489574151522824,"score_gpt":0.25560022322956505,"score_spread":0.2407044817143368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039676880","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013712786,0.001777962,0.9695451,0.00026975834,0.00048999896,0.0013690676,0.0010797624,0.0027865937,0.008968998],"genre_scores_gemma":[0.112212665,0.0011531905,0.8776632,0.00024062108,0.00019877298,0.0035533255,0.0011112251,0.0004923906,0.0033746918],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9586411,0.018470518,0.0032861552,0.0021836322,0.01665657,0.0007619507],"domain_scores_gemma":[0.9311383,0.045129173,0.0058353776,0.008867527,0.008447045,0.00058263354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017797552,0.0032662894,0.0018851937,0.01320417,0.0014538247,0.003327747,0.0029717388,0.00403774,0.0033014007],"category_scores_gemma":[0.07349119,0.0008051045,0.0017745584,0.010925949,0.0019329682,0.0056738127,0.0030832891,0.0037203545,0.0018301064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013449235,0.0015318799,0.050407443,0.0033060452,0.0014233008,0.0005199051,0.0019534717,0.094423644,0.061463997,0.09281252,0.018855467,0.6719574],"study_design_scores_gemma":[0.0002534126,0.0051236935,0.03605023,0.00092239765,0.00048615955,0.0029496327,0.001316238,0.715351,0.06657752,0.044878427,0.12530494,0.00078638707],"about_ca_topic_score_codex":0.0023761312,"about_ca_topic_score_gemma":0.001870255,"teacher_disagreement_score":0.017797552,"about_ca_system_score_codex":0.0016178649,"about_ca_system_score_gemma":0.0012614394,"threshold_uncertainty_score":0.09412354},"labels":[],"label_agreement":null},{"id":"W7096980428","doi":"","title":"Probabilistic Protocols for Node Discovery in Ad-hoc, Single Broadcast Channel Networks (Extended Abstract)","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Node (physics); Key (lock); Probabilistic logic; Network topology; State (computer science); Channel (broadcasting); Protocol (science)","score_opus":0.029531995691270203,"score_gpt":0.2704498911282047,"score_spread":0.2409178954369345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096980428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034763147,0.00085246307,0.99109286,0.0010154385,0.00014202284,0.00013615288,0.000052941312,0.0002444258,0.0029873985],"genre_scores_gemma":[0.4382217,0.0044170776,0.5405547,0.0006565553,0.0009474403,0.0021793388,0.0003368798,0.00017277105,0.01251353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948443,0.0020649724,0.00030786826,0.00046544216,0.0019567553,0.00036056802],"domain_scores_gemma":[0.9804726,0.015342766,0.0010629563,0.0016750791,0.0011359733,0.0003106781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00705981,0.0009106546,0.0013332689,0.0018530681,0.002038431,0.0031587759,0.003862523,0.0024714721,0.003238813],"category_scores_gemma":[0.024627548,0.0011914945,0.001167945,0.0031366183,0.004243388,0.0059486944,0.0036436163,0.0023079717,0.00090021634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086006694,0.0000589154,0.000365552,0.00021098719,0.000047546717,0.00020347934,0.0003128678,0.12830058,0.001125996,0.8338315,0.005290199,0.03016637],"study_design_scores_gemma":[0.00009600403,0.00007577787,0.000132034,0.000047123445,0.000042758922,0.00024697668,0.000069461465,0.618795,0.0008802274,0.3692038,0.010364385,0.00004643102],"about_ca_topic_score_codex":0.0015746691,"about_ca_topic_score_gemma":0.0022941586,"teacher_disagreement_score":0.00705981,"about_ca_system_score_codex":0.002432391,"about_ca_system_score_gemma":0.0019300248,"threshold_uncertainty_score":0.03733629},"labels":[],"label_agreement":null},{"id":"W7101070429","doi":"","title":"Modeling and Performance Analysis of Service Discovery Strategies in Ad Hoc Networks (Extended Abstract)","year":2003,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Service discovery; Service (business); Context (archaeology); Wireless ad hoc network; Key (lock); Service provider","score_opus":0.013031397409479971,"score_gpt":0.23285595956636043,"score_spread":0.21982456215688045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7101070429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40452492,0.0013688019,0.5790931,0.0015758404,0.00008751793,0.00022479991,0.00019607751,0.0003199451,0.012609061],"genre_scores_gemma":[0.9768523,0.00041779326,0.020527638,0.00005751803,0.000032070504,0.00012730254,0.000057983856,0.000028313514,0.0018990956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982666,0.00082897383,0.00006357166,0.00019072926,0.00042655683,0.00022367964],"domain_scores_gemma":[0.9897496,0.008007977,0.0008136346,0.00040280944,0.0008222423,0.00020371149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039500757,0.0010153223,0.0007870113,0.001119592,0.00075158454,0.0016987433,0.0019249144,0.0013361609,0.0012587048],"category_scores_gemma":[0.0149671,0.0005548164,0.00058632146,0.0012445084,0.0015548044,0.0022833135,0.0009742865,0.0009784917,0.00030711613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038569695,0.000034562112,0.0009850208,0.000025024907,0.000014831334,0.00004086792,0.00007656555,0.9761835,0.0005835751,0.018380273,0.00024033959,0.0033968387],"study_design_scores_gemma":[0.0000042733877,0.000022149723,0.00010092879,0.0000029474074,0.000005543386,0.000010884435,0.000013541211,0.99606556,0.00010788919,0.0035657634,0.000097436394,0.0000030796027],"about_ca_topic_score_codex":0.00868999,"about_ca_topic_score_gemma":0.0042268382,"teacher_disagreement_score":0.00868999,"about_ca_system_score_codex":0.0033634224,"about_ca_system_score_gemma":0.0013920659,"threshold_uncertainty_score":0.024403393},"labels":[],"label_agreement":null},{"id":"W7116341087","doi":"10.18280/ijsse.150911","title":"A Blockchain-Enabled GNN Framework for Secure Routing in IoT Networks","year":2025,"lang":"","type":"article","venue":"International Journal of Safety and Security Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Routing (electronic design automation); Internet of Things; Routing protocol; Routing algorithm","score_opus":0.00512701050094432,"score_gpt":0.23963962454580437,"score_spread":0.23451261404486004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116341087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019506678,0.00027063343,0.9697679,0.00039133255,0.000110280984,0.00012919493,0.00016734492,0.0020139983,0.0076426025],"genre_scores_gemma":[0.7362849,0.0005749784,0.25029716,0.00018907292,0.000049353344,0.00029914413,0.0005579559,0.00023065528,0.011516821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948347,0.00015082238,0.00003252295,0.000076818455,0.00018588958,0.00007045789],"domain_scores_gemma":[0.99951434,0.00014633623,0.000046056222,0.00013017078,0.000105062325,0.00005799946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009629797,0.0003152355,0.0004250355,0.00038210116,0.0006769874,0.00092084997,0.0011259699,0.00070811255,0.003624889],"category_scores_gemma":[0.00168977,0.00020544269,0.0003753783,0.00040849653,0.00084269413,0.0016508051,0.0015291615,0.0009440392,0.0007030751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019713368,0.0000981621,0.0009705439,0.00014077805,0.00003410619,0.0004176477,0.00017620329,0.7060845,0.009213872,0.19320057,0.004686461,0.08478004],"study_design_scores_gemma":[0.000020818532,0.000032379186,0.00008290819,0.0000125317165,0.000007021174,0.0000530869,0.000017500608,0.9513163,0.0017510935,0.039609775,0.0070857876,0.000010882326],"about_ca_topic_score_codex":0.005377588,"about_ca_topic_score_gemma":0.0077272193,"teacher_disagreement_score":0.005377588,"about_ca_system_score_codex":0.0010458257,"about_ca_system_score_gemma":0.0016521888,"threshold_uncertainty_score":0.012126446},"labels":[],"label_agreement":null},{"id":"W7117455090","doi":"10.1109/tnse.2025.3649013","title":"Revisiting Scalability of Distributed Wireless Networks: A Multi-Hop Communication Perspective","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Wireless network; Network topology; Software deployment; Wireless; Heterogeneous network; Perspective (graphical); Topology (electrical circuits)","score_opus":0.010211272528814881,"score_gpt":0.24424795693739076,"score_spread":0.2340366844085759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117455090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06572919,0.025559064,0.8557714,0.02234147,0.00061314995,0.00013478973,0.0004413322,0.00053085573,0.028878687],"genre_scores_gemma":[0.9379423,0.015158677,0.04104385,0.0012424334,0.0020937743,0.00020043447,0.0001420854,0.00017069266,0.0020056362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959693,0.0017663422,0.00016276566,0.00056955154,0.0012509055,0.00028112176],"domain_scores_gemma":[0.96796465,0.024955695,0.0019564752,0.0021162773,0.0024376386,0.0005693393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057870434,0.0013403747,0.0014108185,0.0025965972,0.0011240344,0.0030113338,0.0028713278,0.0017669365,0.0014944345],"category_scores_gemma":[0.029234411,0.0006893171,0.0009759059,0.0030362413,0.004497829,0.012931102,0.002905605,0.0037187643,0.00027348663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006874841,0.00008111814,0.005130023,0.0006927001,0.00012377324,0.00085056864,0.0008914418,0.43858278,0.0028653794,0.47073343,0.0061247833,0.07385534],"study_design_scores_gemma":[0.000013122265,0.00006911707,0.0016785226,0.0001699741,0.000037502155,0.0002960245,0.00040540914,0.67237383,0.00085894874,0.31707606,0.0069762114,0.00004522743],"about_ca_topic_score_codex":0.005486477,"about_ca_topic_score_gemma":0.0031682537,"teacher_disagreement_score":0.0057870434,"about_ca_system_score_codex":0.002794786,"about_ca_system_score_gemma":0.0016503251,"threshold_uncertainty_score":0.030605197},"labels":[],"label_agreement":null},{"id":"W7128726204","doi":"10.1109/icerect65215.2025.11377177","title":"Deep Reinforcement Learning-based Mobile Ad Hoc Network for Secure and Dynamic Routing through Cryptographic Assurance","year":2025,"lang":"","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Routing protocol; Mobile ad hoc network; Dynamic Source Routing; Network packet; Link-state routing protocol; Node (physics); Wireless ad hoc network; Routing (electronic design automation); Static routing","score_opus":0.006813285862154489,"score_gpt":0.2493793859303041,"score_spread":0.2425661000681496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7128726204","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029301813,0.0005298603,0.9657845,0.00040087837,0.000070164606,0.000046657136,0.000030554496,0.0004894774,0.0033461342],"genre_scores_gemma":[0.93277115,0.00024973365,0.06391418,0.00015973108,0.000024351448,0.00006377054,0.00004800335,0.000026786493,0.0027423128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996718,0.00010504782,0.000016677312,0.0000635402,0.000088219706,0.00005475236],"domain_scores_gemma":[0.99924964,0.0003732694,0.00009477762,0.00006184938,0.00017981259,0.000040484363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011220537,0.00045179593,0.0005374108,0.0003254743,0.0003192459,0.00050675427,0.0009689623,0.00055600563,0.0015601997],"category_scores_gemma":[0.002014622,0.00018251222,0.00031127277,0.00025227354,0.0006860904,0.0008559908,0.00083878153,0.001091072,0.00028356715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009471627,0.000076820776,0.0006970329,0.000044088174,0.0000361713,0.000053467098,0.00004817244,0.90711886,0.002926039,0.018370837,0.0014419985,0.06909183],"study_design_scores_gemma":[0.0000037748107,0.000022049471,0.000034679855,0.0000016405156,0.0000030977599,0.0000058162486,0.0000021434669,0.997017,0.00028799305,0.0024019333,0.0002178944,0.0000019021624],"about_ca_topic_score_codex":0.0026539175,"about_ca_topic_score_gemma":0.003280796,"teacher_disagreement_score":0.0026539175,"about_ca_system_score_codex":0.0010911428,"about_ca_system_score_gemma":0.0009105912,"threshold_uncertainty_score":0.007916808},"labels":[],"label_agreement":null},{"id":"W7133340000","doi":"10.1109/ciot67574.2025.11410154","title":"Multicasting with No Multicast Routing Protocols in Wireless Networks and IoT Deployments","year":2025,"lang":"","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Multicast; Protocol Independent Multicast; Xcast; IP multicast; Source-specific multicast; Distance Vector Multicast Routing Protocol; Internet Group Management Protocol","score_opus":0.015218291479552698,"score_gpt":0.2800615906669243,"score_spread":0.2648432991873716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133340000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025049511,0.014653736,0.91049886,0.005436556,0.0017899092,0.00012642735,0.00010256586,0.00080260506,0.041539866],"genre_scores_gemma":[0.60930663,0.0122938715,0.35860968,0.001723562,0.002336164,0.00030948303,0.00018593993,0.00022143841,0.015013188],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99830496,0.00063464337,0.00009248849,0.00020916198,0.0006101051,0.00014854765],"domain_scores_gemma":[0.9984059,0.00073979254,0.00020747134,0.00033985518,0.0002358373,0.000071188755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021158203,0.0005250313,0.0006034611,0.0008979509,0.0012113572,0.0020327854,0.0014936008,0.0019788428,0.0009307247],"category_scores_gemma":[0.004242951,0.00039741406,0.00043870814,0.001032028,0.0013518172,0.004111163,0.0015895474,0.001471748,0.00033725475],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010490066,0.00007791556,0.0018068231,0.00045985158,0.000068076115,0.0011291249,0.00042904596,0.03966951,0.0077426094,0.7004058,0.012045234,0.23606111],"study_design_scores_gemma":[0.000036186135,0.0002879157,0.0011990604,0.0003368629,0.00012448034,0.0026818006,0.0005699128,0.2886066,0.00951475,0.4976321,0.19893037,0.0000799928],"about_ca_topic_score_codex":0.00074387336,"about_ca_topic_score_gemma":0.0008330977,"teacher_disagreement_score":0.0021158203,"about_ca_system_score_codex":0.00092655385,"about_ca_system_score_gemma":0.00060747407,"threshold_uncertainty_score":0.01118964},"labels":[],"label_agreement":null},{"id":"W7161953639","doi":"10.82308/18316","title":"Wireless GINI : an emulator for ad-hoc wireless local area networks","year":2005,"lang":"en","type":"dissertation","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Wireless network; Wireless WAN; Wi-Fi array; Wi-Fi; Wireless; Wireless security; Wireless site survey; Local area network","score_opus":0.012990504567592535,"score_gpt":0.26089717291668885,"score_spread":0.2479066683490963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161953639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018626159,0.00034987053,0.8769739,0.00022764155,0.00024851912,0.000690955,0.0011248743,0.08928233,0.012475734],"genre_scores_gemma":[0.3355427,0.0010988992,0.6145926,0.00042356362,0.00010905507,0.002247669,0.00588848,0.016108656,0.023988448],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990804,0.00028570413,0.000067126006,0.00008903665,0.0003688654,0.00010876876],"domain_scores_gemma":[0.9987136,0.00047955848,0.00010124759,0.00028847653,0.00028839125,0.0001288289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015746286,0.0009923654,0.0006621933,0.0007212847,0.00035646665,0.0009535149,0.00323602,0.00081567216,0.008551811],"category_scores_gemma":[0.004386983,0.0004950367,0.00037080506,0.00048157308,0.00039943296,0.0013978201,0.0012927129,0.0018776354,0.0044465596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025326384,0.001006016,0.008795669,0.0015088182,0.0003241936,0.0012752643,0.0014570853,0.20434837,0.073316425,0.08336966,0.23952858,0.38253722],"study_design_scores_gemma":[0.00036896227,0.0004936676,0.0014200913,0.000117630094,0.0000886744,0.00055722106,0.000053923442,0.7313579,0.06645906,0.007304063,0.19168195,0.00009684167],"about_ca_topic_score_codex":0.00058523053,"about_ca_topic_score_gemma":0.00052942423,"teacher_disagreement_score":0.008551811,"about_ca_system_score_codex":0.0004936833,"about_ca_system_score_gemma":0.00063536566,"threshold_uncertainty_score":0.02860862},"labels":[],"label_agreement":null},{"id":"W75776381","doi":"10.1007/978-1-4614-6357-3_1","title":"Introduction to Wireless Multi-Hop Networks","year":2013,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer network; Wireless ad hoc network; Computer science; Wireless network; Key distribution in wireless sensor networks; Mobile ad hoc network; Wireless; Wi-Fi array; Wireless WAN; Wireless mesh network; Wireless sensor network; Network packet; Telecommunications","score_opus":0.014067996831581001,"score_gpt":0.22887161076237528,"score_spread":0.21480361393079428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75776381","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018367483,0.27969626,0.3935581,0.0045153983,0.01773303,0.00017802103,0.00084254344,0.0017860763,0.2998538],"genre_scores_gemma":[0.026964309,0.3397459,0.1112615,0.0025439495,0.009836754,0.00041081567,0.0011950709,0.00058991794,0.50745183],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998079,0.00002088568,0.000011705619,0.00003808899,0.000101691694,0.000019836985],"domain_scores_gemma":[0.999665,0.00018587886,0.000011114751,0.000030214234,0.00008438405,0.000023485494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021203917,0.0010569113,0.00075858005,0.0011814901,0.0003498194,0.00126906,0.0011292633,0.0010602382,0.041552763],"category_scores_gemma":[0.0007654228,0.00039487457,0.00032227914,0.002335488,0.00047338728,0.0024618849,0.000868938,0.0016181968,0.015804345],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028609089,0.00006303134,0.0000946429,0.0014504164,0.000018609615,0.00017584089,0.00012437585,0.005851062,0.003182428,0.10676908,0.17486867,0.70737326],"study_design_scores_gemma":[0.000005214172,0.00003225969,0.00009416489,0.00027637382,0.000010138462,0.0002978381,0.000033277756,0.0034165077,0.00042203045,0.034305904,0.96109277,0.000013465987],"about_ca_topic_score_codex":0.00039179818,"about_ca_topic_score_gemma":0.0006196585,"teacher_disagreement_score":0.041552763,"about_ca_system_score_codex":0.00043431533,"about_ca_system_score_gemma":0.00047743178,"threshold_uncertainty_score":0.1390078},"labels":[],"label_agreement":null},{"id":"W77769772","doi":"10.1007/0-306-48642-3_13","title":"Clustering In Mobile Wireless Ad Hoc Networks","year":2006,"lang":"en","type":"book-chapter","venue":"Kluwer Academic Publishers eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Computer science; Wireless ad hoc network; Cluster analysis; Optimized Link State Routing Protocol; Ad hoc wireless distribution service; Mobile ad hoc network; Wireless Routing Protocol; Vehicular ad hoc network; Adaptive quality of service multi-hop routing; Distributed computing; Base station; Routing protocol; Wireless; Routing (electronic design automation); Telecommunications","score_opus":0.013067259642324002,"score_gpt":0.22389133143232917,"score_spread":0.21082407179000517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77769772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004481126,0.3405358,0.39600924,0.0027760346,0.0060099033,0.00038925197,0.00030676558,0.0029078086,0.24658418],"genre_scores_gemma":[0.07713601,0.31647924,0.3305661,0.0020907286,0.0056760265,0.0005702985,0.0011690571,0.00090382935,0.26540872],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995136,0.00009793429,0.000024406478,0.00006869378,0.00026690954,0.000028439821],"domain_scores_gemma":[0.99965787,0.0001542396,0.000018078834,0.00004911427,0.00009764299,0.000023070119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037817776,0.001130613,0.0008436397,0.001234668,0.00057233626,0.0014913519,0.0014583715,0.0013691109,0.0068448056],"category_scores_gemma":[0.0012529453,0.00045061487,0.00033955535,0.003490259,0.00069397996,0.0021100924,0.0008517766,0.0011058326,0.0074876295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030852807,0.000049548267,0.00019535053,0.001615908,0.000039885548,0.00035022432,0.00047490076,0.015699558,0.0020802214,0.16846398,0.11115179,0.6998478],"study_design_scores_gemma":[0.000013344584,0.00007028169,0.00029513548,0.00045607996,0.000022736971,0.0011325326,0.0001261751,0.013698713,0.0006918,0.100075535,0.8833799,0.00003778959],"about_ca_topic_score_codex":0.00075794954,"about_ca_topic_score_gemma":0.00086936366,"teacher_disagreement_score":0.0068448056,"about_ca_system_score_codex":0.0006403188,"about_ca_system_score_gemma":0.00047866305,"threshold_uncertainty_score":0.022898197},"labels":[],"label_agreement":null},{"id":"W77802288","doi":"10.4018/978-1-61520-701-5.ch009","title":"Joint Link Scheduling and Topology Control for Wireless Sensor Networks with SINR Constraints","year":2010,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Wireless sensor network; Computer network; Scheduling (production processes); Network topology; Distributed computing; Topology control; Topology (electrical circuits); Key distribution in wireless sensor networks; Wireless network; Wireless; Engineering; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.01247217908931112,"score_gpt":0.22321096873052004,"score_spread":0.21073878964120893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77802288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062585506,0.02420635,0.90978837,0.0009348778,0.0010877225,0.000087755616,0.0001206412,0.00033535805,0.057180442],"genre_scores_gemma":[0.24508983,0.072787695,0.56828797,0.000737349,0.0031938646,0.0006164096,0.0007786249,0.0006001406,0.10790821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996563,0.00008791355,0.000019016792,0.00005920039,0.00015307324,0.00002435218],"domain_scores_gemma":[0.99951863,0.0002945634,0.00004103956,0.000054261676,0.00006792347,0.000023649709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000707645,0.0010406123,0.0006499261,0.00045329545,0.00036258972,0.0012381951,0.0010334512,0.00062917755,0.004464532],"category_scores_gemma":[0.0013570251,0.0003831884,0.0004704296,0.0016572997,0.0006644255,0.0022825534,0.0006118355,0.0014381737,0.0013464394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007561471,0.00008980471,0.00017471453,0.0006580214,0.00003994538,0.00012038924,0.00021485049,0.21898286,0.0041606007,0.3930472,0.019237844,0.36319813],"study_design_scores_gemma":[0.000044627828,0.00018964212,0.00037594006,0.00028341933,0.000044282937,0.0002457395,0.00012754003,0.45610017,0.0029435386,0.34594232,0.19366173,0.000040964907],"about_ca_topic_score_codex":0.00089463225,"about_ca_topic_score_gemma":0.0011236373,"teacher_disagreement_score":0.004464532,"about_ca_system_score_codex":0.00074936927,"about_ca_system_score_gemma":0.0007490256,"threshold_uncertainty_score":0.014935374},"labels":[],"label_agreement":null},{"id":"W80409128","doi":"","title":"Performance Evaluation of Six Wireless Ad Hoc Network Routing Protocols.","year":2003,"lang":"en","type":"article","venue":"Computers and Their Applications","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University; Queen's University","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless Routing Protocol; Wireless ad hoc network; Optimized Link State Routing Protocol; Mobile ad hoc network; Adaptive quality of service multi-hop routing; Ad hoc wireless distribution service; Link-state routing protocol; Throughput; Network packet; Distributed computing; Wireless; Telecommunications","score_opus":0.024530778362201754,"score_gpt":0.2663343529793348,"score_spread":0.24180357461713303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W80409128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8893782,0.006704286,0.084396645,0.00076792587,0.0005985968,0.0010035386,0.00093029696,0.0014418605,0.014778619],"genre_scores_gemma":[0.9602203,0.0023407033,0.03354756,0.00007858357,0.000059331298,0.00027781684,0.0012038983,0.000065160006,0.0022067577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648595,0.0011010502,0.00030988574,0.00029306507,0.0015400844,0.00026985828],"domain_scores_gemma":[0.9907381,0.0047798334,0.0009499322,0.0007580095,0.002377746,0.0003964734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004032648,0.0011753506,0.0008039526,0.0015683098,0.0005735013,0.0010538603,0.0011703026,0.0010666639,0.00086899265],"category_scores_gemma":[0.010375905,0.00019549677,0.0007332402,0.0013199961,0.00043734798,0.0014970845,0.00067459093,0.00074274,0.00031091596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045576603,0.0025032002,0.034482874,0.0023282827,0.0011754842,0.0006108678,0.000602377,0.5050325,0.06896472,0.010721467,0.0071785906,0.361842],"study_design_scores_gemma":[0.00027108582,0.011253981,0.012253805,0.00012803881,0.0006799438,0.0013658333,0.00048220754,0.88064533,0.077090144,0.0032423462,0.012389259,0.00019814592],"about_ca_topic_score_codex":0.0010343189,"about_ca_topic_score_gemma":0.000971615,"teacher_disagreement_score":0.004032648,"about_ca_system_score_codex":0.0012064289,"about_ca_system_score_gemma":0.00072014285,"threshold_uncertainty_score":0.0213269},"labels":[],"label_agreement":null},{"id":"W804565110","doi":"10.1007/s11276-015-1003-3","title":"EPTR: expected path throughput based routing protocol for wireless mesh network","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Dynamic Source Routing; Link-state routing protocol; Wireless Routing Protocol; Static routing; Distributed computing; Routing protocol; Zone Routing Protocol; Path vector protocol; Equal-cost multi-path routing; Hazy Sighted Link State Routing Protocol; Enhanced Interior Gateway Routing Protocol; Wireless mesh network; Wireless network; Routing (electronic design automation); Wireless; Telecommunications","score_opus":0.03529247846246507,"score_gpt":0.2863528678612852,"score_spread":0.25106038939882014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W804565110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027184399,0.0013410366,0.9276599,0.0011939985,0.0010125247,0.0006420618,0.0020889223,0.024953082,0.013923937],"genre_scores_gemma":[0.5458407,0.0013538465,0.40463805,0.001051943,0.0005041066,0.0010949442,0.005974021,0.0016993182,0.03784308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993344,0.00017064398,0.00005265202,0.00007777266,0.0002721562,0.000092316885],"domain_scores_gemma":[0.9991499,0.00023179142,0.00010011718,0.00020074286,0.0002545573,0.00006282141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00119563,0.0005068125,0.00053917605,0.0007630206,0.0006115795,0.0007231902,0.0016582175,0.0006105661,0.005958498],"category_scores_gemma":[0.0031168316,0.00018189615,0.00030291738,0.00066786417,0.00032903004,0.0015044966,0.0013580298,0.0011052777,0.0014852541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018147755,0.00040438646,0.0014119529,0.00089928677,0.00015019055,0.0007362763,0.00029868304,0.06479205,0.064111166,0.06569616,0.11792355,0.68176156],"study_design_scores_gemma":[0.0004441277,0.0015747383,0.002213585,0.00012890859,0.0001900719,0.0018141306,0.00017363908,0.7401237,0.07363923,0.046514474,0.13299365,0.00018968241],"about_ca_topic_score_codex":0.0006302317,"about_ca_topic_score_gemma":0.0010658965,"teacher_disagreement_score":0.005958498,"about_ca_system_score_codex":0.00047922277,"about_ca_system_score_gemma":0.0007722997,"threshold_uncertainty_score":0.019933164},"labels":[],"label_agreement":null},{"id":"W82089562","doi":"10.1201/9781420035094.ch8","title":"Routing and Traversal via Location Awareness in Ad Hoc Networks","year":2005,"lang":"en","type":"book-chapter","venue":"Chapman & Hall/CRC computer and information science series","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Tree traversal; Computer science; Computer network; Routing (electronic design automation); Mobile ad hoc network; Wireless ad hoc network; Telecommunications; Algorithm; Wireless; Network packet","score_opus":0.010159392389459638,"score_gpt":0.21352202796908104,"score_spread":0.2033626355796214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W82089562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002694991,0.18481098,0.63835084,0.0023251227,0.003814381,0.00021402646,0.00013436099,0.0015117502,0.16614348],"genre_scores_gemma":[0.06366765,0.32708117,0.45495388,0.0021580986,0.0051652524,0.0006178058,0.0005660709,0.0006077347,0.14518237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993531,0.00016394442,0.00003813853,0.000091589965,0.00031393673,0.00003929064],"domain_scores_gemma":[0.99941003,0.00036576073,0.000028959326,0.000100709454,0.00006863388,0.000025963825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058883487,0.0013447073,0.0007866488,0.0017825,0.00079786923,0.0030369558,0.0016075309,0.0016102568,0.0074483273],"category_scores_gemma":[0.0017106648,0.00082664075,0.0006571299,0.004419058,0.0019851397,0.008106959,0.0014482153,0.0021895294,0.0046072425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027951046,0.00005363451,0.00014419152,0.0010680945,0.000032726795,0.00023396027,0.0004450978,0.012322291,0.0015318852,0.57118976,0.046575263,0.36637512],"study_design_scores_gemma":[0.000015290203,0.000069800226,0.00017165688,0.00040855946,0.000034840137,0.0009515449,0.00011834788,0.020137185,0.0009417205,0.29298553,0.68412787,0.00003770021],"about_ca_topic_score_codex":0.0006813867,"about_ca_topic_score_gemma":0.0007044312,"teacher_disagreement_score":0.0074483273,"about_ca_system_score_codex":0.00081047765,"about_ca_system_score_gemma":0.0005016718,"threshold_uncertainty_score":0.024917126},"labels":[],"label_agreement":null},{"id":"W83485855","doi":"10.1007/978-3-662-05592-2_30","title":"Media Access Control for Ad Hoc Networks with Adaptive Antenna Arrays","year":2004,"lang":"en","type":"book-chapter","venue":"Signals and communication technology","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Adaptive quality of service multi-hop routing; Mobile ad hoc network; Vehicular ad hoc network; Ad hoc wireless distribution service; Optimized Link State Routing Protocol; Distributed computing; Wireless; Telecommunications","score_opus":0.019578696378327636,"score_gpt":0.23814609278385354,"score_spread":0.21856739640552592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W83485855","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002670957,0.019941391,0.944374,0.0003936402,0.001280797,0.000064806525,0.00008149711,0.0013674482,0.029825388],"genre_scores_gemma":[0.2932781,0.042533837,0.427642,0.0008494793,0.0054719606,0.0007406461,0.0007840648,0.0005218369,0.22817816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967,0.00006396153,0.000017927709,0.00005492197,0.00016456764,0.000028687298],"domain_scores_gemma":[0.9995963,0.00018961531,0.000023337665,0.000056703797,0.000122047044,0.000012033141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032319452,0.0011372317,0.0006550365,0.0005192311,0.00037838603,0.001120824,0.0011834342,0.0008638823,0.0062510297],"category_scores_gemma":[0.0009119022,0.00027713194,0.00021065779,0.00073747634,0.00062874594,0.0010896277,0.00047337933,0.0013888077,0.0022604386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014351401,0.00008775613,0.00019768909,0.0005316755,0.000062778236,0.00017090449,0.000192941,0.05096888,0.028876966,0.10857294,0.050905883,0.7592881],"study_design_scores_gemma":[0.00006283808,0.00029300057,0.0006173129,0.00024110326,0.00009534519,0.0006521069,0.00008690771,0.5840822,0.016649283,0.08663164,0.31051114,0.00007716541],"about_ca_topic_score_codex":0.00086223555,"about_ca_topic_score_gemma":0.0011262558,"teacher_disagreement_score":0.0062510297,"about_ca_system_score_codex":0.00039283565,"about_ca_system_score_gemma":0.00022725931,"threshold_uncertainty_score":0.020911813},"labels":[],"label_agreement":null},{"id":"W845527318","doi":"10.71781/10336","title":"Routage adaptatif et stabilité dans les réseaux maillés sans fil","year":2013,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal","keywords":"Computer network; Computer science; Default gateway; Interior gateway protocol; Network packet; Gateway (web page); The Internet; Router; Gateway address; Routing protocol; Packet loss; Throughput; Path (computing); Shortest path problem; Internetworking; Wireless mesh network; Wireless; Wireless network; Telecommunications; Link-state routing protocol","score_opus":0.051459441262588015,"score_gpt":0.31311646654989106,"score_spread":0.26165702528730306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W845527318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39741963,0.0014528005,0.5622086,0.0011194812,0.0003447704,0.00040091368,0.00068606203,0.010075442,0.026292311],"genre_scores_gemma":[0.92099214,0.0005934299,0.060915988,0.00019148386,0.00008289674,0.00022337108,0.0005936891,0.00045087995,0.015956178],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988085,0.00023898641,0.00007427448,0.0002866371,0.0003544566,0.0002371492],"domain_scores_gemma":[0.9972542,0.0008663991,0.00028165092,0.00061734964,0.0008511471,0.00012925724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011319105,0.0009246731,0.00058741926,0.00092087715,0.001064387,0.0023156372,0.0011165566,0.0011673793,0.005617495],"category_scores_gemma":[0.004847939,0.00034444805,0.00047084232,0.0007164259,0.0006748176,0.003078257,0.0011050496,0.0010369937,0.0018611132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014767795,0.0003861852,0.014068995,0.000756504,0.00014308476,0.0014386872,0.0020814629,0.35909966,0.1790326,0.03958017,0.013874657,0.38806129],"study_design_scores_gemma":[0.00010748607,0.0009672962,0.009313849,0.00014707333,0.00018484674,0.0010284979,0.0015209247,0.7680161,0.14458634,0.015498429,0.05839617,0.00023298815],"about_ca_topic_score_codex":0.0059390645,"about_ca_topic_score_gemma":0.0052616256,"teacher_disagreement_score":0.0059390645,"about_ca_system_score_codex":0.0015846685,"about_ca_system_score_gemma":0.0012775345,"threshold_uncertainty_score":0.01879239},"labels":[],"label_agreement":null},{"id":"W854970969","doi":"10.1017/cbo9780511841453.023","title":"Wireless ad hoc and sensor networks","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer network; Wireless mesh network; Mobile ad hoc network; Wireless ad hoc network; Computer science; Ad hoc wireless distribution service; Wireless WAN; Optimized Link State Routing Protocol; Wireless network; Vehicular ad hoc network; Key distribution in wireless sensor networks; Distributed computing; Order One Network Protocol; Mesh networking; Wi-Fi array; Service set; Wireless; Telecommunications; Network packet","score_opus":0.011696288351617309,"score_gpt":0.17831645170715793,"score_spread":0.1666201633555406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W854970969","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001746333,0.36411178,0.14261322,0.005721003,0.016360803,0.0007116912,0.0019788856,0.0038136523,0.46294257],"genre_scores_gemma":[0.019079102,0.3542196,0.08598736,0.0050418475,0.010163344,0.0007221817,0.0041336208,0.0009742361,0.51967865],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760276,0.00042303055,0.00016219611,0.0003001736,0.001401518,0.00011035558],"domain_scores_gemma":[0.998697,0.00050000934,0.00008899704,0.00016323976,0.00043698895,0.00011364997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088184647,0.0019192201,0.0015650062,0.0020872352,0.00091929524,0.0030485797,0.002277399,0.0021165079,0.04811091],"category_scores_gemma":[0.0024222764,0.00047005957,0.0005094184,0.0054912535,0.0011022929,0.00419802,0.0018990004,0.0024225644,0.043737818],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041842093,0.0000908889,0.00019108238,0.0025641038,0.00004571122,0.00033337707,0.00023379995,0.0031362083,0.0015794559,0.06694449,0.39119473,0.5336443],"study_design_scores_gemma":[0.0000051084126,0.00002768303,0.00010855713,0.0003513994,0.0000067825235,0.00034941421,0.000043854896,0.0008128088,0.00017353983,0.018013332,0.9800898,0.000017836574],"about_ca_topic_score_codex":0.0009653843,"about_ca_topic_score_gemma":0.0010886473,"teacher_disagreement_score":0.04811091,"about_ca_system_score_codex":0.00081483356,"about_ca_system_score_gemma":0.0012976305,"threshold_uncertainty_score":0.16094702},"labels":[],"label_agreement":null},{"id":"W856882214","doi":"10.1007/s11276-015-1010-4","title":"Towards a novel trust-based opportunistic routing protocol for wireless networks","year":2015,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Routing protocol; Wireless; Wireless Routing Protocol; Dynamic Source Routing; Wireless network; Routing (electronic design automation); Geographic routing; Distributed computing; Telecommunications","score_opus":0.06011457483464218,"score_gpt":0.3011187145857745,"score_spread":0.24100413975113233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W856882214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013392783,0.0005110927,0.9824228,0.00036787204,0.00020112608,0.0001379442,0.00004205985,0.0004904731,0.002433873],"genre_scores_gemma":[0.48904094,0.0010174353,0.50097555,0.00027845587,0.0002358925,0.00031500342,0.00021945103,0.00013371072,0.007783532],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986494,0.00031805027,0.00011818066,0.00013764978,0.00064767635,0.00012910398],"domain_scores_gemma":[0.9977501,0.00073491764,0.00021079261,0.0004018513,0.00074862724,0.00015373195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018949466,0.0004664835,0.0007282086,0.0006826886,0.0009660619,0.001512069,0.0019488058,0.0010197612,0.00084272906],"category_scores_gemma":[0.0050248816,0.0003768681,0.00045510373,0.00075578183,0.0007102181,0.0029421232,0.0025045148,0.0014298313,0.00045244995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092861213,0.0004930516,0.002763163,0.00043746573,0.00023410494,0.0010907162,0.0010590332,0.17504345,0.08178322,0.25168747,0.0151390955,0.4693406],"study_design_scores_gemma":[0.000053939246,0.00020645776,0.00027243048,0.00002699483,0.00008331074,0.00049502886,0.00014830289,0.9406609,0.010184395,0.0326089,0.015208586,0.00005071755],"about_ca_topic_score_codex":0.0017770733,"about_ca_topic_score_gemma":0.002965646,"teacher_disagreement_score":0.0019488058,"about_ca_system_score_codex":0.0007430688,"about_ca_system_score_gemma":0.0012305756,"threshold_uncertainty_score":0.010021567},"labels":[],"label_agreement":null},{"id":"W88094450","doi":"","title":"Achieving Load Awareness in Position-based Wireless Ad Hoc Routing","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Wireless ad hoc network; Computer network; Computer science; Ad hoc wireless distribution service; Wireless; Mobile ad hoc network; Optimized Link State Routing Protocol; Telecommunications","score_opus":0.02004469152087546,"score_gpt":0.2634821559009439,"score_spread":0.24343746438006847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W88094450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13433227,0.0011503375,0.8580127,0.00035699995,0.00011163624,0.00009682195,0.000034469896,0.0009533973,0.00495141],"genre_scores_gemma":[0.9337472,0.00036887993,0.06485319,0.000041499945,0.000092233706,0.000038730486,0.000033503802,0.000048943206,0.00077580806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914265,0.00032181924,0.000042575102,0.00010494656,0.00031519704,0.00007292531],"domain_scores_gemma":[0.9983718,0.00078198506,0.00024002463,0.00027728948,0.00025555264,0.00007336145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012510951,0.00071072154,0.00056997663,0.0009465953,0.00047935042,0.0011726829,0.0011693421,0.0006154959,0.00056377344],"category_scores_gemma":[0.0033728145,0.00027908798,0.00024781743,0.00093043613,0.0009072791,0.0025756927,0.0013010064,0.0006676994,0.00027196706],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002621238,0.00023643089,0.0052407435,0.00026178465,0.00012559559,0.00028667392,0.00028034952,0.68490595,0.07198843,0.041273285,0.0017733249,0.19336534],"study_design_scores_gemma":[0.000028445751,0.00038469245,0.0011642005,0.000018614073,0.000045255736,0.00028239394,0.00009546001,0.9578778,0.023067143,0.013660924,0.00333352,0.00004160194],"about_ca_topic_score_codex":0.0004484487,"about_ca_topic_score_gemma":0.00049550616,"teacher_disagreement_score":0.0012510951,"about_ca_system_score_codex":0.00039178997,"about_ca_system_score_gemma":0.00030038945,"threshold_uncertainty_score":0.006616533},"labels":[],"label_agreement":null},{"id":"W937531023","doi":"10.1007/978-3-319-07362-0_3","title":"Video Transmission Scheduling in Maritime Wideband Communication Networks","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Time division multiple access; Computer network; Upload; Network packet; Scheduling (production processes); Real-time computing; Benchmark (surveying); Broadband networks; Broadband; Distributed computing; Telecommunications; Engineering","score_opus":0.011894819372388668,"score_gpt":0.22766848873006473,"score_spread":0.21577366935767606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W937531023","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058477726,0.021349058,0.8708421,0.00081249035,0.0012652038,0.00008584182,0.00021998318,0.0009112382,0.04603632],"genre_scores_gemma":[0.7995607,0.014779094,0.13221528,0.00028881838,0.0013477224,0.00010542792,0.00044122443,0.0003861689,0.05087549],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997918,0.00004855719,0.000008593114,0.000038886858,0.000060569913,0.00005159932],"domain_scores_gemma":[0.9997049,0.0001557995,0.000024931769,0.000023292816,0.000063131934,0.000027859935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003629091,0.0005496403,0.0004924754,0.0003373562,0.00037958295,0.0009163853,0.00089812244,0.00034102818,0.0039006358],"category_scores_gemma":[0.00093751686,0.00023107443,0.00012140174,0.0009380547,0.00021619581,0.0006386784,0.00032367493,0.0005310547,0.00064930576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047423717,0.000122521,0.00035063544,0.00032544005,0.000033698452,0.00019822743,0.00015407786,0.32393175,0.021900615,0.053234924,0.028021483,0.57125235],"study_design_scores_gemma":[0.000017732727,0.000120529076,0.0004112274,0.000044487908,0.000021947088,0.00011013667,0.000091502734,0.9449311,0.0052532773,0.023096958,0.02588294,0.000018188928],"about_ca_topic_score_codex":0.0048887427,"about_ca_topic_score_gemma":0.005788893,"teacher_disagreement_score":0.0048887427,"about_ca_system_score_codex":0.00092097325,"about_ca_system_score_gemma":0.00058987015,"threshold_uncertainty_score":0.013048947},"labels":[],"label_agreement":null}]}